Abundance of mosaic patterns for CNN with spatially variant templates

Abstract: This work investigates the complexity of one-dimensional cellular neural network mosaic patterns with spatially variant templates on finite and infinite lattices. Various boundary conditions are considered for finite lattices and the exact number of mosaic patterns is computed precisely. The entropy of mosaic patterns with periodic templates can also be calculated for infinite lattices. Furthermore, we show the abundance of mosaic patterns with respect to template periods and, which differ greatly from cases with spatially invariant templates

abund of mosaic pattern for cnn with spatial variant templat
 thi work investig the complex of one-dimension cellular neural network mosaic pattern with spatial variant templat on finit and infinit lattic . variou boundari condit are consid for finit lattic and the exact number of mosaic pattern is comput precis . the entropi of mosaic pattern with period templat can also be calcul for infinit lattic . furthermor , we show the abund of mosaic pattern with respect to templat period and , which differ greatli from case with spatial invari templat

mosaic patterns
CNN
spatially variant templates
one-dimensional cellular neural network
infinite lattices
finite lattices
boundary conditions
spatial entropy
transition matrix


Mammogram synthesis using a 3D simulation. II. Evaluation of synthetic mammogram texture

Abstract: We have evaluated a method for synthesizing mammograms by comparing the texture of clinical and synthetic mammograms. The synthesis algorithm is based upon simulations of breast tissue and the mammographic imaging process. Mammogram texture was synthesized by projections of simulated adipose tissue compartments. It was hypothesized that the synthetic and clinical texture have similar properties, assuming that the mammogram texture reflects the 3D tissue distribution. The size of the projected compartments was computed by mathematical morphology. The texture energy and fractal dimension were also computed and analyzed in terms of the distribution of texture features within four different tissue regions in clinical and synthetic mammograms. Comparison of the cumulative distributions of the mean features computed from 95 mammograms showed that the synthetic images simulate the mean features of the texture of clinical mammograms. Correlation of clinical and synthetic texture feature histograms, averaged over all images, showed that the synthetic images can simulate the range of features seen over a large group of mammograms. The best agreement with clinical texture was achieved for simulated compartments with radii of 4-13.3 mm in predominantly adipose tissue regions, and radii of 2.7-5.33 and 1.3-2.7 mm in retroareolar and dense fibroglandular tissue regions, respectively

mammogram synthesi use a 3d simul . ii . evalu of synthet mammogram textur
 we have evalu a method for synthes mammogram by compar the textur of clinic and synthet mammogram . the synthesi algorithm is base upon simul of breast tissu and the mammograph imag process . mammogram textur wa synthes by project of simul adipos tissu compart . it wa hypothes that the synthet and clinic textur have similar properti , assum that the mammogram textur reflect the 3d tissu distribut . the size of the project compart wa comput by mathemat morpholog . the textur energi and fractal dimens were also comput and analyz in term of the distribut of textur featur within four differ tissu region in clinic and synthet mammogram . comparison of the cumul distribut of the mean featur comput from 95 mammogram show that the synthet imag simul the mean featur of the textur of clinic mammogram . correl of clinic and synthet textur featur histogram , averag over all imag , show that the synthet imag can simul the rang of featur seen over a larg group of mammogram . the best agreement with clinic textur wa achiev for simul compart with radii of 4 - 13.3 mm in predominantli adipos tissu region , and radii of 2.7 - 5.33 and 1.3 - 2.7 mm in retroareolar and dens fibroglandular tissu region , respect

mammogram synthesis
3D simulation
synthetic mammogram texture
adipose tissue compartments
3D tissue distribution
mathematical morphology
fractal dimension
cumulative distributions
synthetic images
dense fibroglandular tissue regions
breast tissue simulation
retroareolar tissue regions
X-ray image acquisition
computationally compressed phantom


Evaluation of existing and new feature recognition algorithms. 2. Experimental results

Abstract: For pt.1 see ibid., p.839-851. This is the second of two papers investigating the performance of general-purpose feature detection techniques. The first paper describes the development of a methodology to synthesize possible general feature detection face sets. Six algorithms resulting from the synthesis have been designed and implemented on a SUN Workstation in C++ using ACIS as the geometric modelling system. In this paper, extensive tests and comparative analysis are conducted on the feature detection algorithms, using carefully selected components from the public domain, mostly from the National Design Repository. The results show that the new and enhanced algorithms identify face sets that previously published algorithms cannot detect. The tests also show that each algorithm can detect, among other types, a certain type of feature that is unique to it. Hence, most of the algorithms discussed in this paper would have to be combined to obtain complete coverage

evalu of exist and new featur recognit algorithm . 2 . experiment result
 for pt.1 see ibid . , p.839 - 851 . thi is the second of two paper investig the perform of general-purpos featur detect techniqu . the first paper describ the develop of a methodolog to synthes possibl gener featur detect face set . six algorithm result from the synthesi have been design and implement on a sun workstat in c++ use aci as the geometr model system . in thi paper , extens test and compar analysi are conduct on the featur detect algorithm , use care select compon from the public domain , mostli from the nation design repositori . the result show that the new and enhanc algorithm identifi face set that previous publish algorithm can not detect . the test also show that each algorithm can detect , among other type , a certain type of featur that is uniqu to it . henc , most of the algorithm discuss in thi paper would have to be combin to obtain complet coverag


Help-desk support is key to wireless success [finance]

Abstract: A well thought out help desk can make or break an institution's mobile play. Schwab, Ameritrade and RBC are taking their support function seriously

help-desk support is key to wireless success [ financ ]
 a well thought out help desk can make or break an institut 's mobil play . schwab , ameritrad and rbc are take their support function serious

wireless
finance
help desk
Schwab
Ameritrade
RBC


Modeling cutting temperatures for turning inserts with various tool geometries and materials

Abstract: Temperatures are of interest in machining because cutting tools often fail by thermal softening or temperature-activated wear. Many models for cutting temperatures have been developed, but these models consider only simple tool geometries such as a rectangular slab with a sharp corner. This report describes a finite element study of tool temperatures in cutting that accounts for tool nose radius and included angle effects. A temperature correction factor model that can be used in the design and selection of inserts is developed to account for these effects. A parametric mesh generator is used to generate the finite element models of tool and inserts of varying geometries. The steady-state temperature response is calculated using NASTRAN solver. Several finite element analysis (FEA) runs are performed to quantify the effects of inserts included angle, nose radius, and materials for the insert and the tool holder on the cutting temperature at the insert rake face. The FEA results are then utilized to develop a temperature correction factor model that accounts for these effects. The temperature correction factor model is integrated with an analytical temperature model for rectangular inserts to predict cutting temperatures for contour turning with inserts of various shapes and nose radii. Finally, experimental measurements of cutting temperature using the tool-work thermocouple technique are performed and compared with the predictions of the new temperature model. The comparisons show good agreement

model cut temperatur for turn insert with variou tool geometri and materi
 temperatur are of interest in machin becaus cut tool often fail by thermal soften or temperature-activ wear . mani model for cut temperatur have been develop , but these model consid onli simpl tool geometri such as a rectangular slab with a sharp corner . thi report describ a finit element studi of tool temperatur in cut that account for tool nose radiu and includ angl effect . a temperatur correct factor model that can be use in the design and select of insert is develop to account for these effect . a parametr mesh gener is use to gener the finit element model of tool and insert of vari geometri . the steady-st temperatur respons is calcul use nastran solver . sever finit element analysi ( fea ) run are perform to quantifi the effect of insert includ angl , nose radiu , and materi for the insert and the tool holder on the cut temperatur at the insert rake face . the fea result are then util to develop a temperatur correct factor model that account for these effect . the temperatur correct factor model is integr with an analyt temperatur model for rectangular insert to predict cut temperatur for contour turn with insert of variou shape and nose radii . final , experiment measur of cut temperatur use the tool-work thermocoupl techniqu are perform and compar with the predict of the new temperatur model . the comparison show good agreement

turning inserts
tool geometries
machining
tool nose radius
temperature correction factor
parametric mesh generator
finite element models
cutting temperature model
insert shape effects


Network-centric systems

Abstract: The author describes a graduate-level course that addresses cutting-edge issues in network-centric systems while following a more traditional graduate seminar format

network-centr system
 the author describ a graduate-level cours that address cutting-edg issu in network-centr system while follow a more tradit graduat seminar format

network-centric systems
graduate level course


A linear time special case for MC games

Abstract: MC games are infinite duration two-player games played on graphs. Deciding the winner in MC games is equivalent to the the modal mu-calculus model checking. In this article we provide a linear time algorithm for a class of MC games. We show that, if all cycles in each strongly connected component of the game graph have at least one common vertex, the winner can be found in linear time. Our results hold also for parity games, which are equivalent to MC games

a linear time special case for mc game
 mc game are infinit durat two-play game play on graph . decid the winner in mc game is equival to the the modal mu-calculu model check . in thi articl we provid a linear time algorithm for a class of mc game . we show that , if all cycl in each strongli connect compon of the game graph have at least one common vertex , the winner can be found in linear time . our result hold also for pariti game , which are equival to mc game

linear time special case
MC games
two-player games
modal mu-calculus model checking
linear time algorithm


A novel genetic algorithm for the design of a signed power-of-two coefficient quadrature mirror filter lattice filter bank

Abstract: A novel genetic algorithm (GA) for the design of a canonical signed power-of-two (SPT) coefficient lattice structure quadrature mirror filter bank is presented. Genetic operations may render the SPT representation of a value noncanonical. A new encoding scheme is introduced to encode the SPT values. In this new scheme, the canonical property of the SPT values is preserved under genetic operations. Additionally, two new features that drastically improve the performance of our GA are introduced. (1) An additional level of natural selection is introduced to simulate the effect of natural selection when sperm cells compete to fertilize an ovule; this dramatically improves the offspring survival rate. A conventional GA is analogous to intracytoplasmic sperm injection and has an extremely low offspring survival rate, resulting in very slow convergence. (2) The probability of mutation for each codon of a chromosome is weighted by the reciprocal of its effect. Because of these new features, the performance of our new GA outperforms conventional GAs

a novel genet algorithm for the design of a sign power-of-two coeffici quadratur mirror filter lattic filter bank
 a novel genet algorithm ( ga ) for the design of a canon sign power-of-two ( spt ) coeffici lattic structur quadratur mirror filter bank is present . genet oper may render the spt represent of a valu noncanon . a new encod scheme is introduc to encod the spt valu . in thi new scheme , the canon properti of the spt valu is preserv under genet oper . addit , two new featur that drastic improv the perform of our ga are introduc . ( 1 ) an addit level of natur select is introduc to simul the effect of natur select when sperm cell compet to fertil an ovul ; thi dramat improv the offspr surviv rate . a convent ga is analog to intracytoplasm sperm inject and ha an extrem low offspr surviv rate , result in veri slow converg . ( 2 ) the probabl of mutat for each codon of a chromosom is weight by the reciproc of it effect . becaus of these new featur , the perform of our new ga outperform convent ga

signed power-of-two coefficient lattice structure


Place/Transition Petri net evolutions: recording ways, analysis and synthesis

Abstract: Four semantic domains for Place/Transition Petri nets and their relationships are considered. They are monoids of respectively: firing sequences, processes, traces and dependence graphs. For each of them the analysis and synthesis problem is stated and solved. The monoid of processes is defined in a non-standard way, Nets under consideration involve weights of arrows and capacities (finite or infinite) of places. However, the analysis and synthesis tasks require nets to be pure, i.e. each of their transition must have the pre-set and post-set disjoint

place / transit petri net evolut : record way , analysi and synthesi
 four semant domain for place / transit petri net and their relationship are consid . they are monoid of respect : fire sequenc , process , trace and depend graph . for each of them the analysi and synthesi problem is state and solv . the monoid of process is defin in a non-standard way , net under consider involv weight of arrow and capac ( finit or infinit ) of place . howev , the analysi and synthesi task requir net to be pure , i.e. each of their transit must have the pre-set and post-set disjoint

place/transition Petri net evolutions
semantic domains
monoids
firing sequences
dependence graphs
post-set disjoint
pre-set disjoint


Trading exchanges: online marketplaces evolve

Abstract: Looks at how trading exchanges are evolving rapidly to help manufacturers keep up with customer demand

trade exchang : onlin marketplac evolv
 look at how trade exchang are evolv rapidli to help manufactur keep up with custom demand

trading exchanges
online marketplaces
manufacturers
customer demand
enterprise platforms
supply chain management
enterprise resource planning
core software platform
private exchanges
integration technology
middleware
XML standards
content management capabilities


Development of an integrated and open-architecture precision motion control system

Abstract: In this paper, the development of an integrated and open-architecture precision motion control system is presented. The control system is generally applicable, but it is developed with a particular focus on direct drive servo systems based on linear motors. The overall control system is comprehensive, comprising of various selected control and instrumentation components, integrated within a configuration of hardware architecture centred around a dSPACE DS1004 DSP processor board. These components include a precision composite controller (comprising of feedforward and feedback control), a disturbance observer, an adaptive notch filter, and a geometrical error compensator. The hardware architecture, software development platform, user interface, and all constituent control components are described

develop of an integr and open-architectur precis motion control system
 in thi paper , the develop of an integr and open-architectur precis motion control system is present . the control system is gener applic , but it is develop with a particular focu on direct drive servo system base on linear motor . the overal control system is comprehens , compris of variou select control and instrument compon , integr within a configur of hardwar architectur centr around a dspace ds1004 dsp processor board . these compon includ a precis composit control ( compris of feedforward and feedback control ) , a disturb observ , an adapt notch filter , and a geometr error compens . the hardwar architectur , softwar develop platform , user interfac , and all constitu control compon are describ

open-architecture
precision
motion control
direct drive servo systems
linear motors
composite controller
feedforward
feedback
adaptive notch filter
geometrical error compensation
dSPACE DS1004 processor


Development of a 3.5 inch magneto-optical disk with a capacity of 2.3 GB

Abstract: The recording capacity of GIGAMO media was enlarged from 1.3 GB to 2.3 GB for 3.5 inch magneto-optical (MO) disks while maintaining downward compatibility. For the new GIGAMO technology, a land and groove recording method was applied in addition to magnetically induced super resolution (MSR) media. Furthermore, a novel address format suitable for the land and groove recording method was adopted. The specifications of the new GIGAMO media were examined to satisfy requirements for practical use with respect to margins. Durability of more than 10/sup 6/ rewritings and an enough lifetime were confirmed

develop of a 3.5 inch magneto-opt disk with a capac of 2.3 gb
 the record capac of gigamo media wa enlarg from 1.3 gb to 2.3 gb for 3.5 inch magneto-opt ( mo ) disk while maintain downward compat . for the new gigamo technolog , a land and groov record method wa appli in addit to magnet induc super resolut ( msr ) media . furthermor , a novel address format suitabl for the land and groov record method wa adopt . the specif of the new gigamo media were examin to satisfi requir for practic use with respect to margin . durabl of more than 10 / sup 6/ rewrit and an enough lifetim were confirm

3.5 inch
magneto-optical disk
2.3 GB
recording capacity
GIGAMO media
magnetically induced super resolution
MSR
address format
lifetime
MO disks
land-groove recording method
rewriting durability
crosstalk
SiN-GdFeCo-GdFe-TbFeCo-SiN-Al


Six common enterprise programming mistakes

Abstract: Instead of giving you tips to use in your programming (at least directly), I want to look at some common mistakes made in enterprise programming. Instead of focusing on what to do, I want to look at what you should not do. Most programmers take books like mine and add in the good things, but they leave their mistakes in the very same programs! So I touch on several common errors I see in enterprise programming, and then briefly mention how to avoid those mistakes

six common enterpris program mistak
 instead of give you tip to use in your program ( at least directli ) , i want to look at some common mistak made in enterpris program . instead of focus on what to do , i want to look at what you should not do . most programm take book like mine and add in the good thing , but they leav their mistak in the veri same program ! so i touch on sever common error i see in enterpris program , and then briefli mention how to avoid those mistak

enterprise programming mistakes
common errors
data store
database
XML
Enterprise JavaBeans
vendor-specific programming


Micro-optical realization of arrays of selectively addressable dipole traps: a scalable configuration for quantum computation with atomic qubits

Abstract: We experimentally demonstrate novel structures for the realization of registers of atomic qubits: We trap neutral atoms in one- and two-dimensional arrays of far-detuned dipole traps obtained by focusing a red-detuned laser beam with a microfabricated array of microlenses. We are able to selectively address individual trap sites due to their large lateral separation of 125 mu m. We initialize and read out different internal states for the individual sites. We also create two interleaved sets of trap arrays with adjustable separation, as required for many proposed implementations of quantum gate operations

micro-opt realiz of array of select address dipol trap : a scalabl configur for quantum comput with atom qubit
 we experiment demonstr novel structur for the realiz of regist of atom qubit : we trap neutral atom in one- and two-dimension array of far-detun dipol trap obtain by focus a red-detun laser beam with a microfabr array of microlens . we are abl to select address individu trap site due to their larg later separ of 125 mu m. we initi and read out differ intern state for the individu site . we also creat two interleav set of trap array with adjust separ , as requir for mani propos implement of quantum gate oper

scalable configuration
quantum computation
atomic qubits
registers
neutral atoms
far-detuned dipole traps
red-detuned laser beam
microfabricated array
microlenses
internal states
quantum gate operations


An adaptive sphere-fitting method for sequential tolerance control

Abstract: The machining of complex parts typically involves a logical and chronological sequence of n operations on m machine tools. Because manufacturing datums cannot always match design constraints, some of the design specifications imposed on the part are usually satisfied by distinct subsets of the n operations prescribed in the process plan. Conventional tolerance control specifies a fixed set point for each operation and a permissible variation about this set point to insure compliance with the specifications, whereas sequential tolerance control (STC) uses real-time measurement information at the completion of one stage to reposition the set point for subsequent operations. However, it has been shown that earlier sphere-fitting methods for STC can lead to inferior solutions when the process distributions are skewed. This paper introduces an extension of STC that uses an adaptive sphere-fitting method that significantly improves the yield in the presence of skewed distributions as well as significantly reducing the computational effort required by earlier probabilistic search methods

an adapt sphere-fit method for sequenti toler control
 the machin of complex part typic involv a logic and chronolog sequenc of n oper on m machin tool . becaus manufactur datum can not alway match design constraint , some of the design specif impos on the part are usual satisfi by distinct subset of the n oper prescrib in the process plan . convent toler control specifi a fix set point for each oper and a permiss variat about thi set point to insur complianc with the specif , wherea sequenti toler control ( stc ) use real-tim measur inform at the complet of one stage to reposit the set point for subsequ oper . howev , it ha been shown that earlier sphere-fit method for stc can lead to inferior solut when the process distribut are skew . thi paper introduc an extens of stc that use an adapt sphere-fit method that significantli improv the yield in the presenc of skew distribut as well as significantli reduc the comput effort requir by earlier probabilist search method

adaptive sphere-fitting method
sequential tolerance control
machine tools
design constraints
compliance
real-time measurement information
skewed distributions
computational effort
yield improvement


Aggregate bandwidth estimation in stored video distribution systems

Abstract: Multimedia applications like video on demand, distance learning, Internet video broadcast, etc. will play a fundamental role in future broadband networks. A common aspect of such applications is the transmission of video streams that require a sustained relatively high bandwidth with stringent requirements of quality of service. In this paper various original algorithms for evaluating, in a video distribution system, a statistical estimation of aggregate bandwidth needed by a given number of smoothed video streams are proposed and discussed. The variable bit rate traffic generated by each video stream is characterized by its marginal distribution and by conditional probabilities between rates of temporary closed streams. The developed iterative algorithms evaluate an upper and lower bound of needed bandwidth for guaranteeing a given loss probability. The obtained results are compared with simulations and with other results, based on similar assumptions, already presented in the literature. Some considerations on the developed algorithms are made, in order to evaluate the effectiveness of the proposed methods

aggreg bandwidth estim in store video distribut system
 multimedia applic like video on demand , distanc learn , internet video broadcast , etc . will play a fundament role in futur broadband network . a common aspect of such applic is the transmiss of video stream that requir a sustain rel high bandwidth with stringent requir of qualiti of servic . in thi paper variou origin algorithm for evalu , in a video distribut system , a statist estim of aggreg bandwidth need by a given number of smooth video stream are propos and discuss . the variabl bit rate traffic gener by each video stream is character by it margin distribut and by condit probabl between rate of temporari close stream . the develop iter algorithm evalu an upper and lower bound of need bandwidth for guarante a given loss probabl . the obtain result are compar with simul and with other result , base on similar assumpt , alreadi present in the literatur . some consider on the develop algorithm are made , in order to evalu the effect of the propos method

aggregate bandwidth estimation
stored video distribution systems
multimedia applications
video on demand
distance learning
Internet video broadcast
broadband networks
quality of service
statistical estimation
variable bit rate traffic
marginal distribution
conditional probabilities
temporary closed streams
iterative algorithms
lower bound
loss probability
simulations
video streams transmission
upper bound
VoD
video coding
QoS

P P P P P P P P P P P P P P P P P R R U M U


Keeping Web accessibility in mind: I&R services for all

Abstract: After presenting three compelling reasons for making Web sites accessible to persons with a broad range of disabilities (it's the morally right thing to do, it's the smart thing to do from an economic perspective, and it's required by law), the author discusses design issues that impact persons with particular types of disabilities. She presents practical advice for assessing and addressing accessibility problems. An extensive list of resources for further information is appended, as is a list of sites which simulate the impact of specific accessibility problems on persons with disabilities

keep web access in mind : i&r servic for all
 after present three compel reason for make web site access to person with a broad rang of disabl ( it 's the moral right thing to do , it 's the smart thing to do from an econom perspect , and it 's requir by law ) , the author discuss design issu that impact person with particular type of disabl . she present practic advic for assess and address access problem . an extens list of resourc for further inform is append , as is a list of site which simul the impact of specif access problem on person with disabl

Web site accessibility
disabilities
information and referral services


Raising the standard of management education for electronic commerce professionals

Abstract: The teaching of electronic commerce in universities has become a growth industry in itself. The rapid expansion of electronic commerce programmes raises the question of what actually is being taught. The association of electronic commerce as primarily a technical or information technology (IT) phenomenon has not been sufficient to constrain it to IT and information systems departments. Business schools have been keen entrants into the electronic commerce coursework race and they are developing electronic commerce programmes in an environment where there is no agreed definition of the term. This paper draws on the work of Kenneth Boulding who argued that the dynamics of change in society are largely a product of changing skills and the way these skills are arranged into roles at the organizational level. It is argued that an overly technical interpretation of electronic commerce narrows the skills being acquired as part of formal education. Universities, under pressure from the market and technological change, are changing their roles resulting in a further narrowing of the breadth of issues that is seen as legitimate to be included as electronic commerce. The outcome is that aspiring electronic commerce professionals are not being exposed to a wide enough agenda of ideas and concepts that will assist them to make better business decisions

rais the standard of manag educ for electron commerc profession
 the teach of electron commerc in univers ha becom a growth industri in itself . the rapid expans of electron commerc programm rais the question of what actual is be taught . the associ of electron commerc as primarili a technic or inform technolog ( it ) phenomenon ha not been suffici to constrain it to it and inform system depart . busi school have been keen entrant into the electron commerc coursework race and they are develop electron commerc programm in an environ where there is no agre definit of the term . thi paper draw on the work of kenneth bould who argu that the dynam of chang in societi are larg a product of chang skill and the way these skill are arrang into role at the organiz level . it is argu that an overli technic interpret of electron commerc narrow the skill be acquir as part of formal educ . univers , under pressur from the market and technolog chang , are chang their role result in a further narrow of the breadth of issu that is seen as legitim to be includ as electron commerc . the outcom is that aspir electron commerc profession are not be expos to a wide enough agenda of idea and concept that will assist them to make better busi decis

management education standards improvement


Instability phenomena in the gas-metal arc welding self-regulation process

Abstract: Arc instability is a very important determinant of weld quality. The instability behaviour of the gas-metal arc welding (GMAW) process is characterized by strong oscillations in arc length and current. In the paper, a model of the GMAW process is developed using an exact arc voltage characteristic. This model is used to study stability of the self-regulation process and to develop a simulation program that helps to understand the transient or dynamic nature of the GMAW process and relationships among current, electrode extension and contact tube-work distance. The process is shown to exhibit instabilities at both long electrode extension and normal extension. Results obtained from simulation runs of the model were also experimentally confirmed by the present author, as reported in this study. In order to explain the concept of the instability phenomena, the metal transfer mode and the arc voltage-current characteristic were examined. Based on this examination, the conclusion of this study is that their combined effects lead to the oscillations in arc current and length

instabl phenomena in the gas-met arc weld self-regul process
 arc instabl is a veri import determin of weld qualiti . the instabl behaviour of the gas-met arc weld ( gmaw ) process is character by strong oscil in arc length and current . in the paper , a model of the gmaw process is develop use an exact arc voltag characterist . thi model is use to studi stabil of the self-regul process and to develop a simul program that help to understand the transient or dynam natur of the gmaw process and relationship among current , electrod extens and contact tube-work distanc . the process is shown to exhibit instabl at both long electrod extens and normal extens . result obtain from simul run of the model were also experiment confirm by the present author , as report in thi studi . in order to explain the concept of the instabl phenomena , the metal transfer mode and the arc voltage-curr characterist were examin . base on thi examin , the conclus of thi studi is that their combin effect lead to the oscil in arc current and length

instability phenomena
gas-metal arc welding
self-regulation process
arc instability
weld quality
GMAW process
exact arc voltage characteristic
metal transfer mode


Supersampling multiframe blind deconvolution resolution enhancement of adaptive optics compensated imagery of low earth orbit satellites

Abstract: We describe a postprocessing methodology for reconstructing undersampled image sequences with randomly varying blur that can provide image enhancement beyond the sampling resolution of the sensor. This method is demonstrated on simulated imagery and on adaptive-optics-(AO)-compensated imagery taken by the Starfire Optical Range 3.5-m telescope that has been artificially undersampled. Also shown are the results of multiframe blind deconvolution of some of the highest quality optical imagery of low earth orbit satellites collected with a ground-based telescope to date. The algorithm used is a generalization of multiframe blind deconvolution techniques that include a representation of spatial sampling by the focal plane array elements based on a forward stochastic model. This generalization enables the random shifts and shape of the AO-compensated point spread function (PSF) to be used to partially eliminate the aliasing effects associated with sub-Nyquist sampling of the image by the focal plane array. The method could be used to reduce resolution loss that occurs when imaging in wide-field-of-view (FOV) modes

supersampl multifram blind deconvolut resolut enhanc of adapt optic compens imageri of low earth orbit satellit
 we describ a postprocess methodolog for reconstruct undersampl imag sequenc with randomli vari blur that can provid imag enhanc beyond the sampl resolut of the sensor . thi method is demonstr on simul imageri and on adaptive-optics-(ao)-compens imageri taken by the starfir optic rang 3.5-m telescop that ha been artifici undersampl . also shown are the result of multifram blind deconvolut of some of the highest qualiti optic imageri of low earth orbit satellit collect with a ground-bas telescop to date . the algorithm use is a gener of multifram blind deconvolut techniqu that includ a represent of spatial sampl by the focal plane array element base on a forward stochast model . thi gener enabl the random shift and shape of the ao-compens point spread function ( psf ) to be use to partial elimin the alias effect associ with sub-nyquist sampl of the imag by the focal plane array . the method could be use to reduc resolut loss that occur when imag in wide-field-of-view ( fov ) mode

supersampling multiframe blind deconvolution resolution enhancement

undersampled image sequence reconstruction

P P P P P P P P P P P P P P P P P R R R R U


Quantum universal variable-length source coding

Abstract: We construct an optimal quantum universal variable-length code that achieves the admissible minimum rate, i.e., our code is used for any probability distribution of quantum states. Its probability of exceeding the admissible minimum rate exponentially goes to 0. Our code is optimal in the sense of its exponent. In addition, its average error asymptotically tends to 0

quantum univers variable-length sourc code
 we construct an optim quantum univers variable-length code that achiev the admiss minimum rate , i.e. , our code is use for ani probabl distribut of quantum state . it probabl of exceed the admiss minimum rate exponenti goe to 0 . our code is optim in the sens of it expon . in addit , it averag error asymptot tend to 0

quantum universal variable-length source coding


New investors get steal of a deal [Global Crossing]

Abstract: Hutchison Telecommunications and Singapore Technologies take control of Global Crossing for a lot less money than they originally offered. The deal leaves the bankrupt carrier intact, but doesn't put it in the clear just yet

new investor get steal of a deal [ global cross ]
 hutchison telecommun and singapor technolog take control of global cross for a lot less money than they origin offer . the deal leav the bankrupt carrier intact , but doe n't put it in the clear just yet

Global Crossing
Hutchison Telecommunications
Singapore Technologies
bankrupt


Design and manufacture of a lightweight piezo-composite curved actuator

Abstract: In this paper we are concerned with the design, manufacture and performance test of a lightweight piezo-composite curved actuator (called LIPCA) using a top carbon fiber composite layer with near-zero coefficient of thermal expansion (CTE), a middle PZT ceramic wafer, and a bottom glass/epoxy layer with a high CTE. The main point of the design for LIPCA is to replace the heavy metal layers of THUNDER TM by lightweight fiber reinforced plastic layers without losing the capabilities for generating high force and large displacement. It is possible to save up to about 40% of the weight if we replace the metallic backing material by the light fiber composite layer. We can also have design flexibility by selecting the fiber direction and the size of prepreg layers. In addition to the lightweight advantage and design flexibility, the proposed device can be manufactured without adhesive layers when we use an epoxy resin prepreg system. Glass/epoxy prepregs, a ceramic wafer with electrode surfaces, and a carbon prepreg were simply stacked and cured at an elevated temperature (177 degrees C) after following an autoclave bagging process. We found that the manufactured composite laminate device had a sufficient curvature after being detached from a flat mould. An analysis method using the classical lamination theory is presented to predict the curvature of LIPCA after curing at an elevated temperature. The predicted curvatures are in quite good agreement with the experimental values. In order to investigate the merits of LIPCA, performance tests of both LIPCA and THUNDER TM have been conducted under the same boundary conditions. From the experimental actuation tests, it was observed that the developed actuator could generate larger actuation displacement than THUNDER TM

design and manufactur of a lightweight piezo-composit curv actuat
 in thi paper we are concern with the design , manufactur and perform test of a lightweight piezo-composit curv actuat ( call lipca ) use a top carbon fiber composit layer with near-zero coeffici of thermal expans ( cte ) , a middl pzt ceram wafer , and a bottom glass / epoxi layer with a high cte . the main point of the design for lipca is to replac the heavi metal layer of thunder tm by lightweight fiber reinforc plastic layer without lose the capabl for gener high forc and larg displac . it is possibl to save up to about 40 % of the weight if we replac the metal back materi by the light fiber composit layer . we can also have design flexibl by select the fiber direct and the size of prepreg layer . in addit to the lightweight advantag and design flexibl , the propos devic can be manufactur without adhes layer when we use an epoxi resin prepreg system . glass / epoxi prepreg , a ceram wafer with electrod surfac , and a carbon prepreg were simpli stack and cure at an elev temperatur ( 177 degre c ) after follow an autoclav bag process . we found that the manufactur composit lamin devic had a suffici curvatur after be detach from a flat mould . an analysi method use the classic lamin theori is present to predict the curvatur of lipca after cure at an elev temperatur . the predict curvatur are in quit good agreement with the experiment valu . in order to investig the merit of lipca , perform test of both lipca and thunder tm have been conduct under the same boundari condit . from the experiment actuat test , it wa observ that the develop actuat could gener larger actuat displac than thunder tm


Controlling in between the Lorenz and the Chen systems

Abstract: This letter investigates a new chaotic system and its role as a joint function between two complex chaotic systems, the Lorenz and the Chen systems, using a simple variable constant controller. With the gradual tuning of the controller, the controlled system evolves from the canonical Lorenz attractor to the Chen attractor through the new transition chaotic attractor. This evolving procedure reveals the forming mechanisms of all similar and closely related chaotic systems, and demonstrates that a simple control technique can be very useful in generating and analyzing some complex chaotic dynamical phenomena

control in between the lorenz and the chen system
 thi letter investig a new chaotic system and it role as a joint function between two complex chaotic system , the lorenz and the chen system , use a simpl variabl constant control . with the gradual tune of the control , the control system evolv from the canon lorenz attractor to the chen attractor through the new transit chaotic attractor . thi evolv procedur reveal the form mechan of all similar and close relat chaotic system , and demonstr that a simpl control techniqu can be veri use in gener and analyz some complex chaotic dynam phenomena

Chen system
tuning
Lorenz attractor
Chen attractors
transition chaotic attractor
Lorenz system


A fast implementation of correlation of long data sequences for coherent receivers

Abstract: Coherent reception depends upon matching of phase between the transmitted and received signal. Fast convolution techniques based on fast Fourier transform (FFT) are widely used for extracting time delay information from such matching. The latency in processing a large data window of the received signal is a serious overhead for mission critical real time applications. The implementation of a parallel algorithm for correlation of long data sequences in multiprocessor environment is demonstrated here. The algorithm does processing while acquiring the received signal and reduces the computation overhead considerably because of inherent parallelism

a fast implement of correl of long data sequenc for coher receiv
 coher recept depend upon match of phase between the transmit and receiv signal . fast convolut techniqu base on fast fourier transform ( fft ) are wide use for extract time delay inform from such match . the latenc in process a larg data window of the receiv signal is a seriou overhead for mission critic real time applic . the implement of a parallel algorithm for correl of long data sequenc in multiprocessor environ is demonstr here . the algorithm doe process while acquir the receiv signal and reduc the comput overhead consider becaus of inher parallel

correlation
long data sequences
coherent receivers
received signal
fast Fourier transform
time delay information
latency
mission critical real time applications
parallel algorithm
multiprocessor environment
computation
transmitted signal


Modeling frequently accessed wireless data with weak consistency

Abstract: To reduce the response times of wireless data access in a mobile network, caches are utilized in wireless handheld devices. If the original data entry has been updated, the cached data in the handheld device becomes stale. Thus, a mechanism is required to predict when the cached copy will expire. This paper studies a weakly consistent data access mechanism that computes the time-to-live (TTL) interval to predict the expiration time. We propose an analytic model to investigate this TTL-based algorithm for frequently accessed data. The analytic model is validated against simulation experiments. Our study quantitatively indicates how the TTL-based algorithm reduces the wireless communication cost by increasing the probability of stale accesses. Depending on the requirements of the application, appropriate parameter values can be selected based on the guidelines provided

model frequent access wireless data with weak consist
 to reduc the respons time of wireless data access in a mobil network , cach are util in wireless handheld devic . if the origin data entri ha been updat , the cach data in the handheld devic becom stale . thu , a mechan is requir to predict when the cach copi will expir . thi paper studi a weakli consist data access mechan that comput the time-to-l ( ttl ) interv to predict the expir time . we propos an analyt model to investig thi ttl-base algorithm for frequent access data . the analyt model is valid against simul experi . our studi quantit indic how the ttl-base algorithm reduc the wireless commun cost by increas the probabl of stale access . depend on the requir of the applic , appropri paramet valu can be select base on the guidelin provid

frequently accessed wireless data modeling


How closely can a personal computer clock track the UTC timescale via the Internet?

Abstract: Nowadays many software packages allow you to keep the clock of your personal computer synchronized to time servers spread over the internet. We present how a didactic laboratory can evaluate, in a statistical sense, the minimum synch error of this process (the other extreme, the maximum, is guaranteed by the code itself). The measurement set-up utilizes the global positioning system satellite constellation in 'common view' between two similar timing stations: one acts as a time server for the other, so the final timing difference at the second station represents the total synch error through the internet. Data recorded over batches of 10000 samples show a typical RMS value of 35 ms. This measurement configuration allows students to obtain a much better understanding of the synch task and pushes them, at all times, to look for an experimental verification of data results, even when they come from the most sophisticated 'black boxes' now readily available off the shelf

how close can a person comput clock track the utc timescal via the internet ?
 nowaday mani softwar packag allow you to keep the clock of your person comput synchron to time server spread over the internet . we present how a didact laboratori can evalu , in a statist sens , the minimum synch error of thi process ( the other extrem , the maximum , is guarante by the code itself ) . the measur set-up util the global posit system satellit constel in ' common view ' between two similar time station : one act as a time server for the other , so the final time differ at the second station repres the total synch error through the internet . data record over batch of 10000 sampl show a typic rm valu of 35 ms . thi measur configur allow student to obtain a much better understand of the synch task and push them , at all time , to look for an experiment verif of data result , even when they come from the most sophist ' black box ' now readili avail off the shelf


Knowledge acquisition for expert systems in accounting and financial problem domains

Abstract: Since the mid-1980s, expert systems have been developed for a variety of problems in accounting and finance. The most commonly cited problems in developing these systems are the unavailability of the experts and knowledge engineers and difficulties with the rule extraction process. Within the field of artificial intelligence, this has been called the 'knowledge acquisition' (KA) problem and has been identified as a major bottleneck in the expert system development process. Recent empirical research reveals that certain KA techniques are significantly more efficient than others in helping to extract certain types of knowledge within specific problem domains. This paper presents a mapping between these empirical studies and a generic taxonomy of expert system problem domains. To accomplish this, we first examine the range of problem domains and suggest a mapping of accounting and finance tasks to a generic problem domain taxonomy. We then identify and describe the most prominent KA techniques employed in developing expert systems in accounting and finance. After examining and summarizing the existing empirical KA work, we conclude by showing how the empirical KA research in the various problem domains can be used to provide guidance to developers of expert systems in the fields of accounting and finance

knowledg acquisit for expert system in account and financi problem domain
 sinc the mid-1980 , expert system have been develop for a varieti of problem in account and financ . the most commonli cite problem in develop these system are the unavail of the expert and knowledg engin and difficulti with the rule extract process . within the field of artifici intellig , thi ha been call the ' knowledg acquisit ' ( ka ) problem and ha been identifi as a major bottleneck in the expert system develop process . recent empir research reveal that certain ka techniqu are significantli more effici than other in help to extract certain type of knowledg within specif problem domain . thi paper present a map between these empir studi and a gener taxonomi of expert system problem domain . to accomplish thi , we first examin the rang of problem domain and suggest a map of account and financ task to a gener problem domain taxonomi . we then identifi and describ the most promin ka techniqu employ in develop expert system in account and financ . after examin and summar the exist empir ka work , we conclud by show how the empir ka research in the variou problem domain can be use to provid guidanc to develop of expert system in the field of account and financ

knowledge acquisition
expert systems
accounting
finance
rule extraction process
artificial intelligence
problem domain taxonomy


A component-based software configuration management model and its supporting system

Abstract: Software configuration management (SCM) is an important key technology in software development. Component-based software development (CBSD) is an emerging paradigm in software development. However, to apply CBSD effectively in real world practice, supporting SCM in CBSD needs to be further investigated. In this paper, the objects that need to be managed in CBSD is analyzed and a component-based SCM model is presented. In this model, components, as the integral logical constituents in a system, are managed as the basic configuration items in SCM, and the relationships between/among components are defined and maintained. Based on this model, a configuration management system is implemented

a component-bas softwar configur manag model and it support system
 softwar configur manag ( scm ) is an import key technolog in softwar develop . component-bas softwar develop ( cbsd ) is an emerg paradigm in softwar develop . howev , to appli cbsd effect in real world practic , support scm in cbsd need to be further investig . in thi paper , the object that need to be manag in cbsd is analyz and a component-bas scm model is present . in thi model , compon , as the integr logic constitu in a system , are manag as the basic configur item in scm , and the relationship between / among compon are defin and maintain . base on thi model , a configur manag system is implement


Games machines play

Abstract: Individual rationality, or doing what is best for oneself, is a standard model used to explain and predict human behavior, and von Neumann-Morgenstern game theory is the classical mathematical formalization of this theory in multiple-agent settings. Individual rationality, however, is an inadequate model for the synthesis of artificial social systems where cooperation is essential, since it does not permit the accommodation of group interests other than as aggregations of individual interests. Satisficing game theory is based upon a well-defined notion of being good enough, and does accommodate group as well as individual interests through the use of conditional preference relationships, whereby a decision maker is able to adjust its preferences as a function of the preferences, and not just the options, of others. This new theory is offered as an alternative paradigm to construct artificial societies that are capable of complex behavior that goes beyond exclusive self interest

game machin play
 individu ration , or do what is best for oneself , is a standard model use to explain and predict human behavior , and von neumann-morgenstern game theori is the classic mathemat formal of thi theori in multiple-ag set . individu ration , howev , is an inadequ model for the synthesi of artifici social system where cooper is essenti , sinc it doe not permit the accommod of group interest other than as aggreg of individu interest . satisf game theori is base upon a well-defin notion of be good enough , and doe accommod group as well as individu interest through the use of condit prefer relationship , wherebi a decis maker is abl to adjust it prefer as a function of the prefer , and not just the option , of other . thi new theori is offer as an altern paradigm to construct artifici societi that are capabl of complex behavior that goe beyond exclus self interest

individual rationality
human behavior
game theory
multiple-agent
artificial social systems
cooperation
conditional preference relationships
artificial societies
self interest
decision theory
group rationality


Fractional differentiation in passive vibration control

Abstract: From a single-degree-of-freedom model used to illustrate the concept of vibration isolation, a method to transform the design for a suspension into a design for a robust controller is presented. Fractional differentiation is used to model the viscoelastic behaviour of the suspension. The use of fractional differentiation not only permits optimisation of just four suspension parameters, showing the 'compactness' of the fractional derivative operator, but also leads to robustness of the suspension's performance to uncertainty of the sprung mass. As an example, an engine suspension is studied

fraction differenti in passiv vibrat control
 from a single-degree-of-freedom model use to illustr the concept of vibrat isol , a method to transform the design for a suspens into a design for a robust control is present . fraction differenti is use to model the viscoelast behaviour of the suspens . the use of fraction differenti not onli permit optimis of just four suspens paramet , show the ' compact ' of the fraction deriv oper , but also lead to robust of the suspens 's perform to uncertainti of the sprung mass . as an exampl , an engin suspens is studi

fractional differentiation
passive vibration control
vibration isolation
suspension
robust controller
viscoelastic behaviour
sprung mass
engine suspension


A fractional-flow model of serial manufacturing systems with rework and its reachability and controllability properties

Abstract: A dynamic fractional-flow model of a serial manufacturing system incorporating rework is considered. Using some results on reachability and controllability of positive linear systems the ability of serial manufacturing systems with rework to "move in space", that is their reachability and controllability properties, are studied. These properties are important not only for optimising the performance of the manufacturing system, possibly off-line, but also to improve its functioning by using feedback control online

a fractional-flow model of serial manufactur system with rework and it reachabl and control properti
 a dynam fractional-flow model of a serial manufactur system incorpor rework is consid . use some result on reachabl and control of posit linear system the abil of serial manufactur system with rework to " move in space " , that is their reachabl and control properti , are studi . these properti are import not onli for optimis the perform of the manufactur system , possibl off-lin , but also to improv it function by use feedback control onlin

serial manufacturing systems
rework
reachability
controllability
dynamic fractional-flow model
positive linear systems
feedback control
performance optimisation


Syndicators turn to the enterprise

Abstract: Syndicators have started reshaping offerings, products, and services towards the marketplace that was looking for enterprise-wide content syndication technology and service. Syndication companies are turning themselves into infrastructure companies. Many syndication companies are now focusing their efforts on enterprise clients instead of the risky dot coms

syndic turn to the enterpris
 syndic have start reshap offer , product , and servic toward the marketplac that wa look for enterprise-wid content syndic technolog and servic . syndic compani are turn themselv into infrastructur compani . mani syndic compani are now focus their effort on enterpris client instead of the riski dot com


Learning nonregular languages: a comparison of simple recurrent networks and LSTM

Abstract: Rodriguez (2001) examined the learning ability of simple recurrent nets (SRNs) (Elman, 1990) on simple context-sensitive and context-free languages. In response to Rodriguez's (2001) article, we compare the performance of simple recurrent nets and long short-term memory recurrent nets on context-free and context-sensitive languages

learn nonregular languag : a comparison of simpl recurr network and lstm
 rodriguez ( 2001 ) examin the learn abil of simpl recurr net ( srn ) ( elman , 1990 ) on simpl context-sensit and context-fre languag . in respons to rodriguez 's ( 2001 ) articl , we compar the perform of simpl recurr net and long short-term memori recurr net on context-fre and context-sensit languag

LSTM
context-free languages
performance
short-term memory recurrent nets
context-sensitive languages
nonregular language learning
recurrent neural networks


Orthogonal decompositions of complete digraphs

Abstract: A family G of isomorphic copies of a given digraph G is said to be an orthogonal decomposition of the complete digraph D/sub n/ by G, if every arc of D/sub n/ belongs to exactly one member of G and the union of any two different elements from G contains precisely one pair of reverse arcs. Given a digraph h, an h family mh is the vertex-disjoint union of m copies of h . In this paper, we consider orthogonal decompositions by h-families. Our objective is to prove the existence of such an orthogonal decomposition whenever certain necessary conditions hold and m is sufficiently large

orthogon decomposit of complet digraph
 a famili g of isomorph copi of a given digraph g is said to be an orthogon decomposit of the complet digraph d / sub n/ by g , if everi arc of d / sub n/ belong to exactli one member of g and the union of ani two differ element from g contain precis one pair of revers arc . given a digraph h , an h famili mh is the vertex-disjoint union of m copi of h . in thi paper , we consid orthogon decomposit by h-famili . our object is to prove the exist of such an orthogon decomposit whenev certain necessari condit hold and m is suffici larg

orthogonal decompositions
complete digraphs
isomorphic copies
vertex-disjoint union
necessary conditions


The quadratic 0-1 knapsack problem with series-parallel support

Abstract: We consider various special cases of the quadratic 0-1 knapsack problem (QKP) for which the underlying graph structure is fairly simple. For the variant with edge series-parallel graphs, we give a dynamic programming algorithm with pseudo-polynomial time complexity, and a fully polynomial time approximation scheme. In strong contrast to this, the variant with vertex series-parallel graphs is shown to be strongly NP-complete

the quadrat 0 - 1 knapsack problem with series-parallel support
 we consid variou special case of the quadrat 0 - 1 knapsack problem ( qkp ) for which the underli graph structur is fairli simpl . for the variant with edg series-parallel graph , we give a dynam program algorithm with pseudo-polynomi time complex , and a fulli polynomi time approxim scheme . in strong contrast to thi , the variant with vertex series-parallel graph is shown to be strongli np-complet


Automated cerebrum segmentation from three-dimensional sagittal brain MR images

Abstract: We present a fully automated cerebrum segmentation algorithm for full three-dimensional sagittal brain MR images. First, cerebrum segmentation from a midsagittal brain MR image is performed utilizing landmarks, anatomical information, and a connectivity-based threshold segmentation algorithm as previously reported. Recognizing that the cerebrum in laterally adjacent slices tends to have similar size and shape, we use the cerebrum segmentation result from the midsagittal brain MR image as a mask to guide cerebrum segmentation in adjacent lateral slices in an iterative fashion. This masking operation yields a masked image (preliminary cerebrum segmentation) for the next lateral slice, which may truncate brain region(s). Truncated regions are restored by first finding end points of their boundaries, by comparing the mask image and masked image boundaries, and then applying a connectivity-based algorithm. The resulting final extracted cerebrum image for this slice is then used as a mask for the next lateral slice. The algorithm yielded satisfactory fully automated cerebrum segmentations in three-dimensional sagittal brain MR images, and had performance superior to conventional edge detection algorithms for segmentation of cerebrum from 3D sagittal brain MR images

autom cerebrum segment from three-dimension sagitt brain mr imag
 we present a fulli autom cerebrum segment algorithm for full three-dimension sagitt brain mr imag . first , cerebrum segment from a midsagitt brain mr imag is perform util landmark , anatom inform , and a connectivity-bas threshold segment algorithm as previous report . recogn that the cerebrum in later adjac slice tend to have similar size and shape , we use the cerebrum segment result from the midsagitt brain mr imag as a mask to guid cerebrum segment in adjac later slice in an iter fashion . thi mask oper yield a mask imag ( preliminari cerebrum segment ) for the next later slice , which may truncat brain region( ) . truncat region are restor by first find end point of their boundari , by compar the mask imag and mask imag boundari , and then appli a connectivity-bas algorithm . the result final extract cerebrum imag for thi slice is then use as a mask for the next later slice . the algorithm yield satisfactori fulli autom cerebrum segment in three-dimension sagitt brain mr imag , and had perform superior to convent edg detect algorithm for segment of cerebrum from 3d sagitt brain mr imag


Female computer science doctorates: what does the survey of earned doctorates reveal?

Abstract: Based on the National Center for Education Statistics (2000), in the 1997-1998 academic year 26.7% of earned bachelors' degrees, 29.0% of earned masters' degrees and 16.3% of earned doctorates' degrees in computer science were awarded to women. As these percentages suggest, women are underrepresented at all academic levels in computer science (Camp, 1997). The most severe shortage occurs at the top level-the doctorate in computer science. We know very little about the women who persist to the top level of academic achievement in computer science. This paper examines a subset of data collected through the Survey of Earned Doctorates (SED). The specific focus of this paper is to identify trends that have emerged from the SED with respect to females completing doctorates in computer science between the academic years 1990-1991 and 1999-2000. Although computer science doctorates include doctorates in information science, prior research (Camp, 1997) suggests that the percentage of women completing doctorates in information science as compared to computer science is low. The specific research questions are: 1. How does the percentage of women who complete doctorates in computer science compare to those that complete doctorates in other fields? 2. How does the length of time in school and the sources of funding differ for females as compared to males who complete doctorates in computer science? 3. Where do women go after completing doctorates in computer science and what positions do they acquire? How do these experiences differ from their male peers?

femal comput scienc doctor : what doe the survey of earn doctor reveal ?
 base on the nation center for educ statist ( 2000 ) , in the 1997 - 1998 academ year 26.7 % of earn bachelor ' degre , 29.0 % of earn master ' degre and 16.3 % of earn doctor ' degre in comput scienc were award to women . as these percentag suggest , women are underrepres at all academ level in comput scienc ( camp , 1997 ) . the most sever shortag occur at the top level-th doctor in comput scienc . we know veri littl about the women who persist to the top level of academ achiev in comput scienc . thi paper examin a subset of data collect through the survey of earn doctor ( sed ) . the specif focu of thi paper is to identifi trend that have emerg from the sed with respect to femal complet doctor in comput scienc between the academ year 1990 - 1991 and 1999 - 2000 . although comput scienc doctor includ doctor in inform scienc , prior research ( camp , 1997 ) suggest that the percentag of women complet doctor in inform scienc as compar to comput scienc is low . the specif research question are : 1 . how doe the percentag of women who complet doctor in comput scienc compar to those that complet doctor in other field ? 2 . how doe the length of time in school and the sourc of fund differ for femal as compar to male who complet doctor in comput scienc ? 3 . where do women go after complet doctor in comput scienc and what posit do they acquir ? how do these experi differ from their male peer ?

female computer science doctorates
Survey of Earned Doctorates
information science


The mutual effects of grid and wind turbine voltage stability control

Abstract: This note considers the results of wind turbine modelling and power system stability investigations. Voltage stability of the power grid with grid-connected wind turbines will be improved by using blade angle control for a temporary reduction of the wind turbine power during and shortly after a short circuit fault in the grid

the mutual effect of grid and wind turbin voltag stabil control
 thi note consid the result of wind turbin model and power system stabil investig . voltag stabil of the power grid with grid-connect wind turbin will be improv by use blade angl control for a temporari reduct of the wind turbin power dure and shortli after a short circuit fault in the grid

wind turbine voltage stability control
wind turbine modelling
power system stability
power grid
grid-connected wind turbines
blade angle control
short circuit fault
grid voltage stability control
wind turbine power reduction
offshore wind turbines


The disconnect continues [digital content providers]

Abstract: The relationships between the people who buy digital content and those who sell it are probably more acrimonious than ever before, says Dick Curtis, a director and lead analyst for the research firm Outsell Inc., where he covers econtent contract and negotiation strategies. Several buyers agree with his observation. They cite aggressive sales tactics, an unwillingness to deliver content in formats buyers need, a reluctance to provide licensing terms that take into account the structure of today's corporations, and inadequate service and support as a few of the factors underlying the acrimony. Still, many buyers remain optimistic that compromises can be reached on some of these issues. But first, they say, sellers must truly understand the econtent needs of today's enterprises

the disconnect continu [ digit content provid ]
 the relationship between the peopl who buy digit content and those who sell it are probabl more acrimoni than ever befor , say dick curti , a director and lead analyst for the research firm outsel inc. , where he cover econt contract and negoti strategi . sever buyer agre with hi observ . they cite aggress sale tactic , an unwilling to deliv content in format buyer need , a reluct to provid licens term that take into account the structur of today 's corpor , and inadequ servic and support as a few of the factor underli the acrimoni . still , mani buyer remain optimist that compromis can be reach on some of these issu . but first , they say , seller must truli understand the econt need of today 's enterpris

digital content
econtent contract
sales tactics
econtent negotiation
econtent buyers
news databases
Web site


Stability of W-methods with applications to operator splitting and to geometric theory

Abstract: We analyze the stability properties of W-methods applied to the parabolic initial value problem u' + Au = Bu. We work in an abstract Banach space setting, assuming that A is the generator of an analytic semigroup and that B is relatively bounded with respect to A. Since W-methods treat the term with A implicitly, whereas the term involving B is discretized in an explicit way, they can be regarded as splitting methods. As an application of our stability results, convergence for nonsmooth initial data is shown. Moreover, the layout of a geometric theory for discretizations of semilinear parabolic problems u' + Au = f (u) is presented

stabil of w-method with applic to oper split and to geometr theori
 we analyz the stabil properti of w-method appli to the parabol initi valu problem u ' + au = bu . we work in an abstract banach space set , assum that a is the gener of an analyt semigroup and that b is rel bound with respect to a. sinc w-method treat the term with a implicitli , wherea the term involv b is discret in an explicit way , they can be regard as split method . as an applic of our stabil result , converg for nonsmooth initi data is shown . moreov , the layout of a geometr theori for discret of semilinear parabol problem u ' + au = f ( u ) is present

operator splitting
geometric theory
parabolic initial value problem
abstract Banach space
analytic semigroup
nonsmooth initial data
W-methods stability
linearly implicit Runge-Kutta methods


Networking in the palm of your hand [PDA buyer's guide]

Abstract: As PDAs move beyond the personal space and into the enterprise, you need to get a firm grip on the options available for your users. What operating system do you choose? What features do you and your company need? How will these devices fit into the existing corporate infrastructure? What about developer support?

network in the palm of your hand [ pda buyer 's guid ]
 as pda move beyond the person space and into the enterpris , you need to get a firm grip on the option avail for your user . what oper system do you choos ? what featur do you and your compani need ? how will these devic fit into the exist corpor infrastructur ? what about develop support ?

PDAs
buyer's guide
operating system
corporate infrastructure
developer support


The chromatic spectrum of mixed hypergraphs

Abstract: A mixed hypergraph is a triple H = (X, C, D), where X is the vertex set, and each of C, D is a list of subsets of X. A strict k-coloring of H is a surjection c : X {1,..., k} such that each member of le has two vertices assigned a common value and each member of D has two vertices assigned distinct values. The feasible set of H is {k: H has a strict k-coloring}. Among other results, we prove that a finite set of positive integers is the feasible set of some mixed hypergraph if and only if it omits the number I or is an interval starting with 1. For the set {s, t} with 2 <or= s <or= t - 2, the smallest realization has 2t - s vertices. When every member of C union D is a single interval in an underlying linear order on the vertices, the feasible set is also a single interval of integers

the chromat spectrum of mix hypergraph
 a mix hypergraph is a tripl h = ( x , c , d ) , where x is the vertex set , and each of c , d is a list of subset of x. a strict k-color of h is a surject c : x { 1 , ... , k } such that each member of le ha two vertic assign a common valu and each member of d ha two vertic assign distinct valu . the feasibl set of h is { k : h ha a strict k-color } . among other result , we prove that a finit set of posit integ is the feasibl set of some mix hypergraph if and onli if it omit the number i or is an interv start with 1 . for the set { s , t } with 2 < or= s < or= t - 2 , the smallest realiz ha 2 t - s vertic . when everi member of c union d is a singl interv in an underli linear order on the vertic , the feasibl set is also a singl interv of integ

chromatic spectrum
mixed hypergraphs
mixed hypergraphs
vertex set
strict k-coloring
positive integers
mixed hypergraph


Questioning the RFP process [telecom]

Abstract: In the current climate, the most serious concern about the purchasing habits of telecom carriers is obviously the lack of spending. Even against a backdrop of economic constraints and financial struggles, however, genuine concerns about the purchasing process itself are being raised by some of those closest to it

question the rfp process [ telecom ]
 in the current climat , the most seriou concern about the purchas habit of telecom carrier is obvious the lack of spend . even against a backdrop of econom constraint and financi struggl , howev , genuin concern about the purchas process itself are be rais by some of those closest to it

telecom carriers
purchasing process
sales cycle
request for information
request for proposal


Data assimilation of local model error forecasts in a deterministic model

Abstract: One of the most popular data assimilation techniques in use today are of the Kalman filter type, which provide an improved estimate of the state of a system up to the current time level, based on actual measurements. From a forecasting viewpoint, this corresponds to an updating of the initial conditions. The standard forecasting procedure is to then run the model uncorrected into the future, driven by predicted boundary and forcing conditions. The problem with this methodology is that the updated initial conditions quickly 'wash-out', thus, after a certain forecast horizon the model predictions are no better than from an initially uncorrected model. This study demonstrates that through the assimilation of error forecasts (in the present case made using so-called local models) entire model domains can be corrected for extended forecast horizons (i.e. long after updated initial conditions have become washed-out), thus demonstrating significant improvements over the conventional methodology. Some alternate uses of local models are also explored for the re-distribution of error forecasts over the entire model domain, which are then compared with more conventional Kalman filter type schemes

data assimil of local model error forecast in a determinist model
 one of the most popular data assimil techniqu in use today are of the kalman filter type , which provid an improv estim of the state of a system up to the current time level , base on actual measur . from a forecast viewpoint , thi correspond to an updat of the initi condit . the standard forecast procedur is to then run the model uncorrect into the futur , driven by predict boundari and forc condit . the problem with thi methodolog is that the updat initi condit quickli ' wash-out ' , thu , after a certain forecast horizon the model predict are no better than from an initi uncorrect model . thi studi demonstr that through the assimil of error forecast ( in the present case made use so-cal local model ) entir model domain can be correct for extend forecast horizon ( i.e. long after updat initi condit have becom washed-out ) , thu demonstr signific improv over the convent methodolog . some altern use of local model are also explor for the re-distribut of error forecast over the entir model domain , which are then compar with more convent kalman filter type scheme

data assimilation
local model error forecasts
deterministic model
Kalman filter
forcing conditions
forecast horizon
error prediction
hydrodynamic modelling


A feature-preserving volumetric technique to merge surface triangulations

Abstract: Several extensions and improvements to surface merging procedures based on the extraction of isosurfaces from a distance map defined on an adaptive background grid are presented. The main objective is to extend the application of these algorithms to surfaces with sharp edges and comers. In order to deal with objects of different length scales, the initial background grids are created using a Delaunay triangulation method and local voxelizations. A point enrichment technique that introduces points into the background grid along detected surface features such as ridges is used to ensure that these features are preserved in the final merged surface. The surface merging methodology is extended to include other Boolean operations between surface triangulations. The iso-surface extraction algorithms are modified to obtain the correct iso-surface for multi-component objects. The procedures are demonstrated with various examples, ranging from simple geometrical entities to complex engineering applications. The present algorithms allow realistic modelling of a large number of complex engineering geometries using overlapping components defined discretely, i.e. via surface triangulations. This capability is very useful for grid generation starting from data originated in measurements or images

a feature-preserv volumetr techniqu to merg surfac triangul
 sever extens and improv to surfac merg procedur base on the extract of isosurfac from a distanc map defin on an adapt background grid are present . the main object is to extend the applic of these algorithm to surfac with sharp edg and comer . in order to deal with object of differ length scale , the initi background grid are creat use a delaunay triangul method and local voxel . a point enrich techniqu that introduc point into the background grid along detect surfac featur such as ridg is use to ensur that these featur are preserv in the final merg surfac . the surfac merg methodolog is extend to includ other boolean oper between surfac triangul . the iso-surfac extract algorithm are modifi to obtain the correct iso-surfac for multi-compon object . the procedur are demonstr with variou exampl , rang from simpl geometr entiti to complex engin applic . the present algorithm allow realist model of a larg number of complex engin geometri use overlap compon defin discret , i.e. via surfac triangul . thi capabl is veri use for grid gener start from data origin in measur or imag

point enrichment technique background grid

P P P P P P P P P P P P P P P P M M R M R R R M U


Design of an adaptive vibration absorber to reduce electrical transformer structural vibration

Abstract: This paper considers the design of a vibration absorber to reduce structural vibration at multiple frequencies, with an enlarged bandwidth control at these target frequencies. While the basic absorber is a passive device a control system has been added to facilitate tuning, effectively giving the combination of a passive and active device, which leads to far greater stability and robustness. Experimental results demonstrating the effectiveness of the absorber are also described

design of an adapt vibrat absorb to reduc electr transform structur vibrat
 thi paper consid the design of a vibrat absorb to reduc structur vibrat at multipl frequenc , with an enlarg bandwidth control at these target frequenc . while the basic absorb is a passiv devic a control system ha been ad to facilit tune , effect give the combin of a passiv and activ devic , which lead to far greater stabil and robust . experiment result demonstr the effect of the absorb are also describ

adaptive vibration absorber
electrical transformer
structural vibration
bandwidth control


Control of transient thermal response during sequential open-die forging: a trajectory optimization approach

Abstract: A trajectory optimization approach is applied to the design of a sequence of open-die forging operations in order to control the transient thermal response of a large titanium alloy billet. The amount of time the billet is soaked in furnace prior to each successive forging operation is optimized to minimize the total process time while simultaneously satisfying constraints on the maximum and minimum values of the billet temperature distribution to avoid microstructural defects during forging. The results indicate that a "differential" heating profile is the most effective at meeting these design goals

control of transient thermal respons dure sequenti open-di forg : a trajectori optim approach
 a trajectori optim approach is appli to the design of a sequenc of open-di forg oper in order to control the transient thermal respons of a larg titanium alloy billet . the amount of time the billet is soak in furnac prior to each success forg oper is optim to minim the total process time while simultan satisfi constraint on the maximum and minimum valu of the billet temperatur distribut to avoid microstructur defect dure forg . the result indic that a " differenti " heat profil is the most effect at meet these design goal

open-die forging
trajectory optimization
titanium alloy billet
temperature distribution
microstructural defects
heating profile
transient thermal response control


Model theory for hereditarily finite superstructures

Abstract: We study model-theoretic properties of hereditarily finite superstructures over models of not more than countable signatures. A question is answered in the negative inquiring whether theories of hereditarily finite superstructures which have a unique (up to isomorphism) hereditarily finite superstructure can be described via definable functions. Yet theories for such superstructures admit a description in terms of iterated families TF and SF. These are constructed using a definable union taken over countable ordinals in the subsets which are unions of finitely many complete subsets and of finite subsets, respectively. Simultaneously, we describe theories that share a unique (up to isomorphism) countable hereditarily finite superstructure

model theori for hereditarili finit superstructur
 we studi model-theoret properti of hereditarili finit superstructur over model of not more than countabl signatur . a question is answer in the neg inquir whether theori of hereditarili finit superstructur which have a uniqu ( up to isomorph ) hereditarili finit superstructur can be describ via defin function . yet theori for such superstructur admit a descript in term of iter famili tf and sf . these are construct use a defin union taken over countabl ordin in the subset which are union of finit mani complet subset and of finit subset , respect . simultan , we describ theori that share a uniqu ( up to isomorph ) countabl hereditarili finit superstructur


Data extraction from the Web based on pre-defined schema

Abstract: With the development of the Internet, the World Wide Web has become an invaluable information source for most organizations. However, most documents available from the Web are in HTML form which is originally designed for document formatting with little consideration of its contents. Effectively extracting data from such documents remains a nontrivial task. In this paper, we present a schema-guided approach to extracting data from HTML pages. Under the approach, the user defines a schema specifying what to be extracted and provides sample mappings between the schema and the HTML page. The system will induce the mapping rules and generate a wrapper that takes the HTML page as input and produces the required data in the form of XML conforming to the user-defined schema. A prototype system implementing the approach has been developed. The preliminary experiments indicate that the proposed semi-automatic approach is not only easy to use but also able to produce a wrapper that extracts required data from inputted pages with high accuracy

data extract from the web base on pre-defin schema
 with the develop of the internet , the world wide web ha becom an invalu inform sourc for most organ . howev , most document avail from the web are in html form which is origin design for document format with littl consider of it content . effect extract data from such document remain a nontrivi task . in thi paper , we present a schema-guid approach to extract data from html page . under the approach , the user defin a schema specifi what to be extract and provid sampl map between the schema and the html page . the system will induc the map rule and gener a wrapper that take the html page as input and produc the requir data in the form of xml conform to the user-defin schema . a prototyp system implement the approach ha been develop . the preliminari experi indic that the propos semi-automat approach is not onli easi to use but also abl to produc a wrapper that extract requir data from input page with high accuraci

data extraction
schema
Internet
information source
HTML
wrapper generation
data integration
distributed database
queries


Sensorless control of induction motor drives

Abstract: Controlled induction motor drives without mechanical speed sensors at the motor shaft have the attractions of low cost and high reliability. To replace the sensor the information on the rotor speed is extracted from measured stator voltages and currents at the motor terminals. Vector-controlled drives require estimating the magnitude and spatial orientation of the fundamental magnetic flux waves in the stator or in the rotor. Open-loop estimators or closed-loop observers are used for this purpose. They differ with respect to accuracy, robustness, and sensitivity against model parameter variations. Dynamic performance and steady-state speed accuracy in the low-speed range can be achieved by exploiting parasitic effects of the machine. The overview in this paper uses signal flow graphs of complex space vector quantities to provide an insightful description of the systems used in sensorless control of induction motors

sensorless control of induct motor drive
 control induct motor drive without mechan speed sensor at the motor shaft have the attract of low cost and high reliabl . to replac the sensor the inform on the rotor speed is extract from measur stator voltag and current at the motor termin . vector-control drive requir estim the magnitud and spatial orient of the fundament magnet flux wave in the stator or in the rotor . open-loop estim or closed-loop observ are use for thi purpos . they differ with respect to accuraci , robust , and sensit against model paramet variat . dynam perform and steady-st speed accuraci in the low-spe rang can be achiev by exploit parasit effect of the machin . the overview in thi paper use signal flow graph of complex space vector quantiti to provid an insight descript of the system use in sensorless control of induct motor

sensorless control
induction motor drives
reliability
stator voltages
vector-controlled drives
magnitude
spatial orientation
fundamental magnetic flux waves
open-loop estimators
closed-loop observers
robustness
sensitivity
model parameter variations
steady-state speed accuracy
parasitic effects
signal flow graphs
space vector quantities
stator currents


Detection and estimation of abrupt changes in the variability of a process

Abstract: Detection of change-points in normal means is a well-studied problem. The parallel problem of detecting changes in variance has had less attention. The form of the generalized likelihood ratio test statistic has long been known, but its null distribution resisted exact analysis. In this paper, we formulate the change-point problem for a sequence of chi-square random variables. We describe a procedure that is exact for the distribution of the likelihood ratio statistic for all even degrees of freedom, and gives upper and lower bounds for odd (and also for non-integer) degrees of freedom. Both the liberal and conservative bounds for chi /sub 1//sup 2/ degrees of freedom are shown through simulation to be reasonably tight. The important problem of testing for change in the normal variance of individual observations corresponds to the chi /sub 1//sup 2/ case. The non-null case is also covered, and confidence intervals for the true change point are derived. The methodology is illustrated with an application to quality control in a deep level gold mine. Other applications include ambulatory monitoring of medical data and econometrics

detect and estim of abrupt chang in the variabl of a process
 detect of change-point in normal mean is a well-studi problem . the parallel problem of detect chang in varianc ha had less attent . the form of the gener likelihood ratio test statist ha long been known , but it null distribut resist exact analysi . in thi paper , we formul the change-point problem for a sequenc of chi-squar random variabl . we describ a procedur that is exact for the distribut of the likelihood ratio statist for all even degre of freedom , and give upper and lower bound for odd ( and also for non-integ ) degre of freedom . both the liber and conserv bound for chi /sub 1//sup 2/ degre of freedom are shown through simul to be reason tight . the import problem of test for chang in the normal varianc of individu observ correspond to the chi /sub 1//sup 2/ case . the non-nul case is also cover , and confid interv for the true chang point are deriv . the methodolog is illustr with an applic to qualiti control in a deep level gold mine . other applic includ ambulatori monitor of medic data and econometr

P P P P P P P P P P P P P P P R R R R R M R M


A dataflow computer which accelerates execution of sequential programs by precedent firing instructions

Abstract: In the dataflow machine, it is important to avoid degradation of performance in sequential processing, and it is important from the viewpoint of hardware scale to reduce the number of waiting operands. This paper demonstrates that processing performance is degraded by sequential processing in the switching process, and presents a method of remedy. Precedent firing control is proposed as a means of remedy, and it is shown by a simulation that the execution time and the total number of waiting operands can be reduced by the precedent firing control. Then the hardware scale is examined as an evaluation of precedent firing control

a dataflow comput which acceler execut of sequenti program by preced fire instruct
 in the dataflow machin , it is import to avoid degrad of perform in sequenti process , and it is import from the viewpoint of hardwar scale to reduc the number of wait operand . thi paper demonstr that process perform is degrad by sequenti process in the switch process , and present a method of remedi . preced fire control is propos as a mean of remedi , and it is shown by a simul that the execut time and the total number of wait operand can be reduc by the preced fire control . then the hardwar scale is examin as an evalu of preced fire control

dataflow computer
sequential programs
precedent firing instructions
hardware scale
waiting operands
processing performance
switching process
precedent firing control
execution time
execution acceleration
parallel processing
computer architecture


BT voices its support for IP

Abstract: BTexact's chief technology officer, Mick Reeve, gives his views on the future for voice over DSL services and virtual private networks, and defends the slow rollout of public access WLANs

bt voic it support for ip
 btexact 's chief technolog offic , mick reev , give hi view on the futur for voic over dsl servic and virtual privat network , and defend the slow rollout of public access wlan

BTexact
voice over DSL
virtual private networks
public access WLANs