A partial converse to Hadamard's theorem on homeomorphisms

Abstract: A theorem by Hadamard gives a two-part condition under which a map from one Banach space to another is a homeomorphism. The theorem, while often very useful, is incomplete in the sense that it does not explicitly specify the family of maps for which the condition is met. Here, under a typically weak additional assumption on the map, we show that Hadamard's condition is met if, and only if, the map is a homeomorphism with a Lipschitz continuous inverse. An application is given concerning the relation between the stability of a nonlinear system and the stability of related linear systems

a partial convers to hadamard 's theorem on homeomorph
 a theorem by hadamard give a two-part condit under which a map from one banach space to anoth is a homeomorph . the theorem , while often veri use , is incomplet in the sens that it doe not explicitli specifi the famili of map for which the condit is met . here , under a typic weak addit assumpt on the map , we show that hadamard 's condit is met if , and onli if , the map is a homeomorph with a lipschitz continu invers . an applic is given concern the relat between the stabil of a nonlinear system and the stabil of relat linear system

partial converse
homeomorphisms
Banach space
Lipschitz continuous inverse
linearization
Hadamard theorem
nonlinear system stability
linear system stability
nonlinear feedback systems
nonlinear networks


Evolving robust asynchronous cellular automata for the density task

Abstract: In this paper the evolution of three kinds of asynchronous cellular automata are studied for the density task. Results are compared with those obtained for synchronous automata and the influence of various asynchronous update policies on the computational strategy is described. How synchronous and asynchronous cellular automata behave is investigated when the update policy is gradually changed, showing that asynchronous cellular automata are more adaptable. The behavior of synchronous and asynchronous evolved automata are studied under the presence of random noise of two kinds and it is shown that asynchronous cellular automata implicitly offer superior fault tolerance

evolv robust asynchron cellular automata for the densiti task
 in thi paper the evolut of three kind of asynchron cellular automata are studi for the densiti task . result are compar with those obtain for synchron automata and the influenc of variou asynchron updat polici on the comput strategi is describ . how synchron and asynchron cellular automata behav is investig when the updat polici is gradual chang , show that asynchron cellular automata are more adapt . the behavior of synchron and asynchron evolv automata are studi under the presenc of random nois of two kind and it is shown that asynchron cellular automata implicitli offer superior fault toler

asynchronous cellular automata
cellular automata
synchronous automata
random noise
fault tolerance
discrete dynamical systems


Estimation of the Poisson stream intensity in a multilinear queue with an exponential job queue decay

Abstract: Times the busy queue periods start are found for a multilinear queue with an exponential job queue decay and uniform resource allocation to individual servers. The stream intensity and the average job are estimated from observations of the times the queue busy periods start

estim of the poisson stream intens in a multilinear queue with an exponenti job queue decay
 time the busi queue period start are found for a multilinear queue with an exponenti job queue decay and uniform resourc alloc to individu server . the stream intens and the averag job are estim from observ of the time the queue busi period start

Poisson stream intensity
stream intensity
multilinear queue
exponential job queue decay
busy queue periods start
uniform resource allocation
individual servers


Surface micromachined paraffin-actuated microvalve

Abstract: Normally-open microvalves have been fabricated and tested which use a paraffin microactuator as the active element. The entire structure with nominal dimension of phi 600 mu m * 30 mu m is batch-fabricated by surface micromachining the actuator and channel materials on top of a single substrate. Gas flow rates in the 0.01-0.1 sccm range have been measured for several devices with actuation powers ranging from 50 to 150 mW on glass substrates. Leak rates as low as 500 mu sccm have been measured. The normally-open blocking microvalve structure has been used to fabricate a precision flow control system of microvalves consisting of four blocking valve structures. The control valve is designed to operate over a 0.01-5.0 sccm flow range at a differential pressure of 800 torr. Flow rates ranging from 0.02 to 4.996 sccm have been measured. Leak rates as low as 3.2 msccm for the four valve system have been measured

surfac micromachin paraffin-actu microvalv
 normally-open microvalv have been fabric and test which use a paraffin microactu as the activ element . the entir structur with nomin dimens of phi 600 mu m * 30 mu m is batch-fabr by surfac micromachin the actuat and channel materi on top of a singl substrat . ga flow rate in the 0.01 - 0.1 sccm rang have been measur for sever devic with actuat power rang from 50 to 150 mw on glass substrat . leak rate as low as 500 mu sccm have been measur . the normally-open block microvalv structur ha been use to fabric a precis flow control system of microvalv consist of four block valv structur . the control valv is design to oper over a 0.01 - 5.0 sccm flow rang at a differenti pressur of 800 torr . flow rate rang from 0.02 to 4.996 sccm have been measur . leak rate as low as 3.2 msccm for the four valv system have been measur

normally-open microvalves
paraffin microactuator
active element
channel materials
gas flow rates
flow rates
actuation powers
50 to 150 mW
leak rates
blocking valve structures
differential pressure
800 torr
surface micromachined microvalve
600 micron
30 micron


Fuzzy systems with overlapping Gaussian concepts: Approximation properties in Sobolev norms

Abstract: In this paper the approximating capabilities of fuzzy systems with overlapping Gaussian concepts are considered. The target function is assumed to be sampled either on a regular gird or according to a uniform probability density. By exploiting a connection with Radial Basis Functions approximators, a new method for the computation of the system coefficients is provided, showing that it guarantees uniform approximation of the derivatives of the target function

fuzzi system with overlap gaussian concept : approxim properti in sobolev norm
 in thi paper the approxim capabl of fuzzi system with overlap gaussian concept are consid . the target function is assum to be sampl either on a regular gird or accord to a uniform probabl densiti . by exploit a connect with radial basi function approxim , a new method for the comput of the system coeffici is provid , show that it guarante uniform approxim of the deriv of the target function

fuzzy systems
overlapping Gaussian concepts
radial basis functions
learning
fuzzy system models
reproducing kernel Hilbert spaces


Conditions for the local manipulation of Gaussian states

Abstract: We present a general necessary and sufficient criterion for the possibility of a state transformation from one mixed Gaussian state to another of a bipartite continuous-variable system with two modes. The class of operations that will be considered is the set of local Gaussian completely positive trace-preserving maps

condit for the local manipul of gaussian state
 we present a gener necessari and suffici criterion for the possibl of a state transform from one mix gaussian state to anoth of a bipartit continuous-vari system with two mode . the class of oper that will be consid is the set of local gaussian complet posit trace-preserv map

local manipulation
Gaussian states
state transformation
bipartite continuous-variable system
trace-preserving maps
quantum information theory


Deterministic single-photon source for distributed quantum networking

Abstract: A sequence of single photons is emitted on demand from a single three-level atom strongly coupled to a high-finesse optical cavity. The photons are generated by an adiabatically driven stimulated Raman transition between two atomic ground states, with the vacuum field of the cavity stimulating one branch of the transition, and laser pulses deterministically driving the other branch. This process is unitary and therefore intrinsically reversible, which is essential for quantum communication and networking, and the photons should be appropriate for all-optical quantum information processing

determinist single-photon sourc for distribut quantum network
 a sequenc of singl photon is emit on demand from a singl three-level atom strongli coupl to a high-finess optic caviti . the photon are gener by an adiabat driven stimul raman transit between two atom ground state , with the vacuum field of the caviti stimul one branch of the transit , and laser puls determinist drive the other branch . thi process is unitari and therefor intrins revers , which is essenti for quantum commun and network , and the photon should be appropri for all-opt quantum inform process


Self-testing chips take a load off ATE

Abstract: Looks at how chipmakers get more life out of automatic test equipment by embedding innovative circuits in silicon

self-test chip take a load off ate
 look at how chipmak get more life out of automat test equip by embed innov circuit in silicon

embedded deterministic testing technique


Design, analysis and testing of some parallel two-step W-methods for stiff systems

Abstract: Parallel two-step W-methods are linearly-implicit integration methods where the s stage values can be computed in parallel. We construct methods of stage order q = s and order p = s with favourable stability properties. Generalizations for the concepts of A- and L-stability are proposed and conditions for stiff accuracy are given. Numerical comparisons on a shared memory computer show the efficiency of the methods, especially in combination with Krylov-techniques for large stiff systems

design , analysi and test of some parallel two-step w-method for stiff system
 parallel two-step w-method are linearly-implicit integr method where the s stage valu can be comput in parallel . we construct method of stage order q = s and order p = s with favour stabil properti . gener for the concept of a- and l-stabil are propos and condit for stiff accuraci are given . numer comparison on a share memori comput show the effici of the method , especi in combin with krylov-techniqu for larg stiff system

parallel two-step W-methods
linearly-implicit integration methods
stage order
stability
shared memory computer
Krylov-techniques
large stiff systems
differential equations
convergence analysis


A case for end system multicast

Abstract: The conventional wisdom has been that Internet protocol (IP) is the natural protocol layer for implementing multicast related functionality. However, more than a decade after its initial proposal, IP multicast is still plagued with concerns pertaining to scalability, network management, deployment, and support for higher layer functionality such as error, flow, and congestion control. We explore an alternative architecture that we term end system multicast, where end systems implement all multicast related functionality including membership management and packet replication. This shifting of multicast support from routers to end systems has the potential to address most problems associated with IP multicast. However, the key concern is the performance penalty associated with such a model. In particular, end system multicast introduces duplicate packets on physical links and incurs larger end-to-end delays than IP multicast. We study these performance concerns in the context of the Narada protocol. In Narada, end systems self-organize into an overlay structure using a fully distributed protocol. Further, end systems attempt to optimize the efficiency of the overlay by adapting to network dynamics and by considering application level performance. We present details of Narada and evaluate it using both simulation and Internet experiments. Our results indicate that the performance penalties are low both from the application and the network perspectives. We believe the potential benefits of transferring multicast functionality from end systems to routers significantly outweigh the performance penalty incurred

a case for end system multicast
 the convent wisdom ha been that internet protocol ( ip ) is the natur protocol layer for implement multicast relat function . howev , more than a decad after it initi propos , ip multicast is still plagu with concern pertain to scalabl , network manag , deploy , and support for higher layer function such as error , flow , and congest control . we explor an altern architectur that we term end system multicast , where end system implement all multicast relat function includ membership manag and packet replic . thi shift of multicast support from router to end system ha the potenti to address most problem associ with ip multicast . howev , the key concern is the perform penalti associ with such a model . in particular , end system multicast introduc duplic packet on physic link and incur larger end-to-end delay than ip multicast . we studi these perform concern in the context of the narada protocol . in narada , end system self-organ into an overlay structur use a fulli distribut protocol . further , end system attempt to optim the effici of the overlay by adapt to network dynam and by consid applic level perform . we present detail of narada and evalu it use both simul and internet experi . our result indic that the perform penalti are low both from the applic and the network perspect . we believ the potenti benefit of transfer multicast function from end system to router significantli outweigh the perform penalti incur

end system multicast
Internet protocol
protocol layer
IP multicast
network management
higher layer functionality
congestion control
membership management
packet replication
performance penalties
end-to-end delays
Narada protocol
overlay structure
distributed protocol
network dynamics
application level performance
simulation
Internet experiments
network scalability
network routers
self-organizing protocol

P P P P P P P P P P P P P P P P P P R R R


Estimation of trifocal tensor using GMM

Abstract: A novel estimation of a trifocal tensor based on the Gaussian mixture model (GMM) is presented. The mixture model is built assuming that the residuals of inliers and outliers belong to different Gaussian distributions. The Bayesian rule is then employed to detect the inliers for re-estimation. Experiments show that the presented method is more precise and relatively unaffected by outliers

estim of trifoc tensor use gmm
 a novel estim of a trifoc tensor base on the gaussian mixtur model ( gmm ) is present . the mixtur model is built assum that the residu of inlier and outlier belong to differ gaussian distribut . the bayesian rule is then employ to detect the inlier for re-estim . experi show that the present method is more precis and rel unaffect by outlier

GMM
Gaussian mixture model
inliers
outliers
Gaussian distributions
Bayesian rule
trifocal tensor estimation
motion analysis
image data
image analysis


Human factors research on data modeling: a review of prior research, an extended framework and future research directions

Abstract: This study reviews and synthesizes human factors research on conceptual data modeling. In addition to analyzing the variables used in earlier studies and summarizing the results of this stream of research, we propose a new framework to help with future efforts in this area. The study finds that prior research has focused on issues that are relevant when conceptual models are used for communication between systems analysts and developers (Analyst Developer models) whereas the issues important for models that are used to facilitate communication between analysts and users (User-Analyst models) have received little attention and, hence, require a significantly stronger role in future research. In addition, we emphasize the importance of building a strong theoretical foundation and using it to guide future empirical work in this area

human factor research on data model : a review of prior research , an extend framework and futur research direct
 thi studi review and synthes human factor research on conceptu data model . in addit to analyz the variabl use in earlier studi and summar the result of thi stream of research , we propos a new framework to help with futur effort in thi area . the studi find that prior research ha focus on issu that are relev when conceptu model are use for commun between system analyst and develop ( analyst develop model ) wherea the issu import for model that are use to facilit commun between analyst and user ( user-analyst model ) have receiv littl attent and , henc , requir a significantli stronger role in futur research . in addit , we emphas the import of build a strong theoret foundat and use it to guid futur empir work in thi area

human factors
conceptual data modeling
future efforts
Analyst Developer models
User-Analyst models
database


VPP Fortran and the design of HPF/JA extensions

Abstract: VPP Fortran is a data parallel language that has been designed for the VPP series of supercomputers. In addition to pure data parallelism, it contains certain low-level features that were designed to extract high performance from user programs. A comparison of VPP Fortran and High-Performance Fortran (HPF) 2.0 shows that these low-level features are not available in HPF 2.0. The features include asynchronous interprocessor communication, explicit shadow, and the LOCAL directive. They were shown in VPP Fortran to be very useful in handling real-world applications, and they have been included in the HPF/JA extensions. They are described in the paper. The HPF/JA Language Specification Version 1.0 is an extension of HPF 2.0 to achieve practical performance for real-world applications and is a result of collaboration in the Japan Association for HPF (JAHPF). Some practical programming and tuning procedures with the HPF/JA Language Specification are described, using the NAS Parallel Benchmark BT as an example

vpp fortran and the design of hpf / ja extens
 vpp fortran is a data parallel languag that ha been design for the vpp seri of supercomput . in addit to pure data parallel , it contain certain low-level featur that were design to extract high perform from user program . a comparison of vpp fortran and high-perform fortran ( hpf ) 2.0 show that these low-level featur are not avail in hpf 2.0 . the featur includ asynchron interprocessor commun , explicit shadow , and the local direct . they were shown in vpp fortran to be veri use in handl real-world applic , and they have been includ in the hpf / ja extens . they are describ in the paper . the hpf / ja languag specif version 1.0 is an extens of hpf 2.0 to achiev practic perform for real-world applic and is a result of collabor in the japan associ for hpf ( jahpf ) . some practic program and tune procedur with the hpf / ja languag specif are describ , use the na parallel benchmark bt as an exampl


Packet spacing: an enabling mechanism for delivering multimedia content in computational grids

Abstract: Streaming multimedia with UDP has become increasingly popular over distributed systems like the Internet. Scientific applications that stream multimedia include remote computational steering of visualization data and video-on-demand teleconferencing over the Access Grid. However, UDP does not possess a self-regulating, congestion-control mechanism; and most best-effort traffic is served by congestion-controlled TCP. Consequently, UDP steals bandwidth from TCP such that TCP flows starve for network resources. With the volume of Internet traffic continuing to increase, the perpetuation of UDP-based streaming will cause the Internet to collapse as it did in the mid-1980's due to the use of non-congestion-controlled TCP. To address this problem, we introduce the counter-intuitive notion of inter-packet spacing with control feedback to enable UDP-based applications to perform well in the next-generation Internet and computational grids. When compared with traditional UDP-based streaming, we illustrate that our approach can reduce packet loss over 50% without adversely affecting delivered throughput

packet space : an enabl mechan for deliv multimedia content in comput grid
 stream multimedia with udp ha becom increasingli popular over distribut system like the internet . scientif applic that stream multimedia includ remot comput steer of visual data and video-on-demand teleconferenc over the access grid . howev , udp doe not possess a self-regul , congestion-control mechan ; and most best-effort traffic is serv by congestion-control tcp . consequ , udp steal bandwidth from tcp such that tcp flow starv for network resourc . with the volum of internet traffic continu to increas , the perpetu of udp-bas stream will caus the internet to collaps as it did in the mid-1980 's due to the use of non-congestion-control tcp . to address thi problem , we introduc the counter-intuit notion of inter-packet space with control feedback to enabl udp-bas applic to perform well in the next-gener internet and comput grid . when compar with tradit udp-bas stream , we illustr that our approach can reduc packet loss over 50 % without advers affect deliv throughput

streaming multimedia
UDP
distributed systems
Internet
remote computational steering
visualization data
UDP-based streaming
inter-packet spacing
network protocol
transport protocols


SIA shelves T+1 decision till 2004

Abstract: The Securities Industry Association has decided that a move to T+1 is more than the industry can handle right now. STP, however, will remain a focus

sia shelv t+1 decis till 2004
 the secur industri associ ha decid that a move to t+1 is more than the industri can handl right now . stp , howev , will remain a focu

T+1
Securities Industry Association
straight-through-processing


Application of traditional system design techniques to Web site design

Abstract: After several decades of computer program construction there emerged a set of principles that provided guidance to produce more manageable programs. With the emergence of the plethora of Internet web sites one wonders if similar guidelines are followed in their construction. Since this is a new technology no apparent universally accepted methods have emerged to guide the designer in Web site construction. This paper reviews the traditional principles of structured programming and the preferred characteristics of Web sites. Finally a mapping of how the traditional guidelines may be applied to Web site construction is presented. The application of the traditional principles of structured programming to the design of a Web site can provide a more usable site for the visitors to the site. The additional benefit of using these time-honored techniques is the creation of a Web site that will be easier to maintain by the development staff

applic of tradit system design techniqu to web site design
 after sever decad of comput program construct there emerg a set of principl that provid guidanc to produc more manag program . with the emerg of the plethora of internet web site one wonder if similar guidelin are follow in their construct . sinc thi is a new technolog no appar univers accept method have emerg to guid the design in web site construct . thi paper review the tradit principl of structur program and the prefer characterist of web site . final a map of how the tradit guidelin may be appli to web site construct is present . the applic of the tradit principl of structur program to the design of a web site can provid a more usabl site for the visitor to the site . the addit benefit of use these time-honor techniqu is the creation of a web site that will be easier to maintain by the develop staff

system design techniques
structured programming
Internet Web site design


Bistability of harmonically forced relaxation oscillations

Abstract: Relaxation oscillations appear in processes which involve transitions between two states characterized by fast and slow time scales. When a relaxation oscillator is coupled to an external periodic force its entrainment by the force results in a response which can include multiple periodicities and bistability. The prototype of these behaviors is the harmonically driven van der Pol equation which displays regions in the parameter space of the driving force amplitude where stable orbits of periods 2n+or-1 coexist, flanked by regions of periods 2n+1 and 2n-1. The parameter regions of such bistable orbits are derived analytically for the closely related harmonically driven Stoker-Haag piecewise discontinuous equation. The results are valid over most of the control parameter space of the system. Also considered are the reasons for the more complicated dynamics featuring regions of high multiple periodicity which appear like noise between ordered periodic regions. Since this system mimics in detail the less analytically tractable forced van der Pol equation, the results suggest extensions to situations where forced relaxation oscillations are a component of the operating mechanisms

bistabl of harmon forc relax oscil
 relax oscil appear in process which involv transit between two state character by fast and slow time scale . when a relax oscil is coupl to an extern period forc it entrain by the forc result in a respons which can includ multipl period and bistabl . the prototyp of these behavior is the harmon driven van der pol equat which display region in the paramet space of the drive forc amplitud where stabl orbit of period 2n+or-1 coexist , flank by region of period 2n+1 and 2n-1 . the paramet region of such bistabl orbit are deriv analyt for the close relat harmon driven stoker-haag piecewis discontinu equat . the result are valid over most of the control paramet space of the system . also consid are the reason for the more complic dynam featur region of high multipl period which appear like nois between order period region . sinc thi system mimic in detail the less analyt tractabl forc van der pol equat , the result suggest extens to situat where forc relax oscil are a compon of the oper mechan


A three-source model for the calculation of head scatter factors

Abstract: Accurate determination of the head scatter factor S/sub c/ is an important issue, especially for intensity modulated radiation therapy, where the segmented fields are often very irregular and much less than the collimator jaw settings. In this work, we report an S/sub c/ calculation algorithm for symmetric, asymmetric, and irregular open fields shaped by the tertiary collimator (a multileaf collimator or blocks) at different source-to-chamber distance. The algorithm was based on a three-source model, in which the photon radiation to the point of calculation was treated as if it originated from three effective sources: one source for the primary photons from the target and two extra-focal photon sources for the scattered photons from the primary collimator and the flattening filter, respectively. The field mapping method proposed by Kim et al. [Phys. Med. Biol. 43, 1593-1604 (1998)] was extended to two extra-focal source planes and the scatter contributions were integrated over the projected areas (determined by the detector's eye view) in the three source planes considering the source intensity distributions. The algorithm was implemented using Microsoft Visual C/C++ in the MS Windows environment. The only input data required were head scatter factors for symmetric square fields, which are normally acquired during machine commissioning. A large number of different fields were used to evaluate the algorithm and the results were compared with measurements. We found that most of the calculated S/sub c/'s agreed with the measured values to within 0.4%. The algorithm can also be easily applied to deal with irregular fields shaped by a multileaf collimator that replaces the upper or lower collimator jaws

a three-sourc model for the calcul of head scatter factor
 accur determin of the head scatter factor s / sub c/ is an import issu , especi for intens modul radiat therapi , where the segment field are often veri irregular and much less than the collim jaw set . in thi work , we report an s / sub c/ calcul algorithm for symmetr , asymmetr , and irregular open field shape by the tertiari collim ( a multileaf collim or block ) at differ source-to-chamb distanc . the algorithm wa base on a three-sourc model , in which the photon radiat to the point of calcul wa treat as if it origin from three effect sourc : one sourc for the primari photon from the target and two extra-foc photon sourc for the scatter photon from the primari collim and the flatten filter , respect . the field map method propos by kim et al . [ phi . med . biol . 43 , 1593 - 1604 ( 1998 ) ] wa extend to two extra-foc sourc plane and the scatter contribut were integr over the project area ( determin by the detector 's eye view ) in the three sourc plane consid the sourc intens distribut . the algorithm wa implement use microsoft visual c / c++ in the ms window environ . the onli input data requir were head scatter factor for symmetr squar field , which are normal acquir dure machin commiss . a larg number of differ field were use to evalu the algorithm and the result were compar with measur . we found that most of the calcul s / sub c/ 's agre with the measur valu to within 0.4 % . the algorithm can also be easili appli to deal with irregular field shape by a multileaf collim that replac the upper or lower collim jaw

three-source model
head scatter factors
intensity modulated radiation therapy
segmented fields
fields
fields
collimator jaw settings
calculation algorithm
symmetric
asymmetric
irregular open fields
tertiary collimator
multileaf collimator
blocks
source-to-chamber distance
photon radiation
target
extra-focal photon sources
scattered photons
primary collimator
flattening filter
field mapping method
extra-focal source planes
source intensity distributions
MS Windows environment
input data
symmetric square fields
machine commissioning
lower collimator jaws
upper collimator jaws

P P P P P P P P P P P P P P P P P P P P P P P P P P P P P R


Virtual projects at Halden [Reactor Project]

Abstract: The Halden man-machine systems (MMS) programme for 2002 is intended to address issues related to human factors, control room design, computer-based support system areas and system safety and reliability. The Halden MMS programme is intended to address extensive experimental work in the human factors, control room design and computer-based support system areas. The work is based on experiments and demonstrations carried out in the experimental facility HAMMLAB. Pilot-versions of several operator aids are adopted and integrated to the HAMMLAB simulators and demonstrated in a full dynamic setting. The Halden virtual reality laboratory has recently become an integral and important part of the programme

virtual project at halden [ reactor project ]
 the halden man-machin system ( mm ) programm for 2002 is intend to address issu relat to human factor , control room design , computer-bas support system area and system safeti and reliabl . the halden mm programm is intend to address extens experiment work in the human factor , control room design and computer-bas support system area . the work is base on experi and demonstr carri out in the experiment facil hammlab . pilot-vers of sever oper aid are adopt and integr to the hammlab simul and demonstr in a full dynam set . the halden virtual realiti laboratori ha recent becom an integr and import part of the programm

human factors
control room design
computer-based support system
safety
reliability
virtual reality
Halden Reactor Project
man-machine systems programme


Mathematical model of functioning of an insurance company with allowance for advertising expenses

Abstract: A mathematical model of the functioning of an insurance company with allowance for advertising expenses is suggested. The basic characteristics of the capital of the company and the advertising efficiency are examined in the case in which the advertising expenses are proportional to the capital

mathemat model of function of an insur compani with allow for advertis expens
 a mathemat model of the function of an insur compani with allow for advertis expens is suggest . the basic characterist of the capit of the compani and the advertis effici are examin in the case in which the advertis expens are proport to the capit

mathematical model
capital
insurance company functioning
advertising expenses allowance


Valuing corporate debt: the effect of cross-holdings of stock and debt

Abstract: We have developed a simple approach to valuing risky corporate debt when corporations own securities issued by other corporations. We assume that corporate debt can be valued as an option on corporate business asset value, and derive payoff functions when there exist cross-holdings of stock or debt between two firms. Next we show that payoff functions with multiple cross-holdings can be solved by the contraction principle. The payoff functions which we derive provide a number of insights about the risk structure of company cross-holdings. First, the Modigliani-Miller theorem can obtain when there exist cross-holdings between firms. Second, by establishing cross-shareholdings each of stock holders distributes a part of its payoff values to the bond holder of the other's firm, so that both firms can decrease credit risks by cross-shareholdings. In the numerical examples, we show that the correlation in firms can be a critical condition for reducing credit risk by cross-holdings of stock using Monte Carlo simulation. Moreover, we show we can calculate the default spread easily when complicated cross-holdings exist, and find which shares are beneficial or disadvantageous

valu corpor debt : the effect of cross-hold of stock and debt
 we have develop a simpl approach to valu riski corpor debt when corpor own secur issu by other corpor . we assum that corpor debt can be valu as an option on corpor busi asset valu , and deriv payoff function when there exist cross-hold of stock or debt between two firm . next we show that payoff function with multipl cross-hold can be solv by the contract principl . the payoff function which we deriv provid a number of insight about the risk structur of compani cross-hold . first , the modigliani-mil theorem can obtain when there exist cross-hold between firm . second , by establish cross-sharehold each of stock holder distribut a part of it payoff valu to the bond holder of the other 's firm , so that both firm can decreas credit risk by cross-sharehold . in the numer exampl , we show that the correl in firm can be a critic condit for reduc credit risk by cross-hold of stock use mont carlo simul . moreov , we show we can calcul the default spread easili when complic cross-hold exist , and find which share are benefici or disadvantag

securities
option
corporate business asset value
payoff functions
multiple cross-holdings
Modigliani-Miller theorem
cross-shareholdings
bond holder
credit risks
correlation
Monte Carlo simulation
risky corporate debt valuation
stock holdings
debt holdings


Digital rights (and wrongs)

Abstract: Attempting to grasp the many conflicts and proposed safeguards for intellectual property is extremely difficult. Legal, political, economic, and cultural issues-both domestic and international-loom large, almost dwarfing the daunting technological challenges. Solutions devised by courts and legislatures and regulatory agencies are always late out of the blocks and fall ever farther behind. Recently proposed legislation only illustrates the depth and complexity of the problem

digit right ( and wrong )
 attempt to grasp the mani conflict and propos safeguard for intellectu properti is extrem difficult . legal , polit , econom , and cultur issues-both domest and international-loom larg , almost dwarf the daunt technolog challeng . solut devis by court and legislatur and regulatori agenc are alway late out of the block and fall ever farther behind . recent propos legisl onli illustr the depth and complex of the problem

intellectual property
cultural issues
economic issues
political issues
legal issues


Improving the frequency stability of microwave oscillators by utilizing the dual-mode sapphire-loaded cavity resonator

Abstract: The design and experimental testing of a novel control circuit to stabilize the temperature of a sapphire-loaded cavity whispering gallery resonator-oscillator and improve its medium-term frequency stability is presented. Finite-element software was used to predict frequencies and quality factors of WGE/sub 7,0,0/ and the WGH/sub 9,0,0/ modes near 9 GHz, and separated in frequency by approximately 80 MHz. Calculations show that the novel temperature control circuits from the difference frequency can result in a frequency stability of better than one part in 10/sup 13/ at 270 K. Also, we present details on the best way to couple orthogonally to two modes of similar frequency but different polarization

improv the frequenc stabil of microwav oscil by util the dual-mod sapphire-load caviti reson
 the design and experiment test of a novel control circuit to stabil the temperatur of a sapphire-load caviti whisper galleri resonator-oscil and improv it medium-term frequenc stabil is present . finite-el softwar wa use to predict frequenc and qualiti factor of wge / sub 7,0,0/ and the wgh / sub 9,0,0/ mode near 9 ghz , and separ in frequenc by approxim 80 mhz . calcul show that the novel temperatur control circuit from the differ frequenc can result in a frequenc stabil of better than one part in 10 / sup 13/ at 270 k. also , we present detail on the best way to coupl orthogon to two mode of similar frequenc but differ polar


A robust H/sub infinity / control approach for induction motors

Abstract: This paper deals with the robustness and stability of an induction motor control structure against internal and external disturbances. In the proposed control scheme, we have used an H/sub infinity / controller with field orientation and input-output linearization to achieve the above-specified features. Simulation results are included to illustrate the control approach performances

a robust h / sub infin / control approach for induct motor
 thi paper deal with the robust and stabil of an induct motor control structur against intern and extern disturb . in the propos control scheme , we have use an h / sub infin / control with field orient and input-output linear to achiev the above-specifi featur . simul result are includ to illustr the control approach perform

robust H/sub infinity / control
robustness
stability
induction motors control
external disturbances
field orientation
input-output linearization
internal disturbances


A new approach to the d-MC problem

Abstract: Many real-world systems are multi-state systems composed of multi-state components in which the reliability can be computed in terms of the lower bound points of level d, called d-Mincuts (d-MCs). Such systems (electric power, transportation, etc.) may be regarded as flow networks whose arcs have independent, discrete, limited and multi-valued random capacities. In this paper, all MCs are assumed to be known in advance, and the authors focused on how to verify each d-MC candidate before using d-MCs to calculate the network reliability. The proposed algorithm is more efficient than existing algorithms. The algorithm runs in O(p sigma mn) time, a significant improvement over the previous O(p sigma m/sup 2/) time bounds based on max-flow/min-cut, where p and or are the number of MCs and d-MC candidates, respectively. It is simple, intuitive and uses no complex data structures. An example is given to show how all d-MC candidates are found and verified by the proposed algorithm. Then the reliability of this example is computed

a new approach to the d-mc problem
 mani real-world system are multi-st system compos of multi-st compon in which the reliabl can be comput in term of the lower bound point of level d , call d-mincut ( d-mc ) . such system ( electr power , transport , etc . ) may be regard as flow network whose arc have independ , discret , limit and multi-valu random capac . in thi paper , all mc are assum to be known in advanc , and the author focus on how to verifi each d-mc candid befor use d-mc to calcul the network reliabl . the propos algorithm is more effici than exist algorithm . the algorithm run in o(p sigma mn ) time , a signific improv over the previou o(p sigma m / sup 2/ ) time bound base on max-flow / min-cut , where p and or are the number of mc and d-mc candid , respect . it is simpl , intuit and use no complex data structur . an exampl is given to show how all d-mc candid are found and verifi by the propos algorithm . then the reliabl of thi exampl is comput

d-MC problem
multi-state systems
multi-state components
d-Mincuts
flow networks
time bounds
max-flow/min-cut
reliability computation
failure analysis algorithm


Hybrid broadcast for the video-on-demand service

Abstract: Multicast offers an efficient means of distributing video contents/programs to multiple clients by batching their requests and then having them share a server's video stream. Batching customers' requests is either client-initiated or server-initiated. Most advanced client-initiated video multicasts are implemented by patching. Periodic broadcast, a typical server-initiated approach, can be entirety-based or segment-based. This paper focuses on the performance of the VoD service for popular videos. First, we analyze the limitation of conventional patching when the customer request rate is high. Then, by combining the advantages of each of the two broadcast schemes, we propose a hybrid broadcast scheme for popular videos, which not only lowers the service latency but also improves clients' interactivity by using an active buffering technique. This is shown to be a good compromise for both lowering service latency and improving the VCR-like interactivity

hybrid broadcast for the video-on-demand servic
 multicast offer an effici mean of distribut video content / program to multipl client by batch their request and then have them share a server 's video stream . batch custom ' request is either client-initi or server-initi . most advanc client-initi video multicast are implement by patch . period broadcast , a typic server-initi approach , can be entirety-bas or segment-bas . thi paper focus on the perform of the vod servic for popular video . first , we analyz the limit of convent patch when the custom request rate is high . then , by combin the advantag of each of the two broadcast scheme , we propos a hybrid broadcast scheme for popular video , which not onli lower the servic latenc but also improv client ' interact by use an activ buffer techniqu . thi is shown to be a good compromis for both lower servic latenc and improv the vcr-like interact

video-on-demand
multicast
conventional patching
customer request rate
hybrid broadcast scheme
interactivity
quality-of-service
scheduling


Impossible choice [web hosting service provider]

Abstract: Selecting a telecoms and web hosting service provider has become a high-stakes game of chance

imposs choic [ web host servic provid ]
 select a telecom and web host servic provid ha becom a high-stak game of chanc

web hosting service provider
selection
IT managers
customer service


Using k-nearest-neighbor classification in the leaves of a tree

Abstract: We construct a hybrid (composite) classifier by combining two classifiers in common use - classification trees and k-nearest-neighbor (k-NN). In our scheme we divide the feature space up by a classification tree, and then classify test set items using the k-NN rule just among those training items in the same leaf as the test item. This reduces somewhat the computational load associated with k-NN, and it produces a classification rule that performs better than either trees or the usual k-NN in a number of well-known data sets

use k-nearest-neighbor classif in the leav of a tree
 we construct a hybrid ( composit ) classifi by combin two classifi in common use - classif tree and k-nearest-neighbor ( k-nn ) . in our scheme we divid the featur space up by a classif tree , and then classifi test set item use the k-nn rule just among those train item in the same leaf as the test item . thi reduc somewhat the comput load associ with k-nn , and it produc a classif rule that perform better than either tree or the usual k-nn in a number of well-known data set

k-nearest-neighbor classification
classification trees
k-NN rule
computational load
data sets
tree leaves
hybrid composite classifier
feature space division


An intelligent information gathering method for dynamic information mediators

Abstract: The Internet is spreading into our society rapidly and is becoming one of the information infrastructures that are indispensable for our daily life. In particular, the WWW is widely used for various purposes such as sharing personal information, academic research, business work, and electronic commerce, and the amount of available information is increasing rapidly. We usually utilize information sources on the Internet as individual stand-alone sources, but if we can integrate them, we can add more value to each of them. Hence, information mediators, which integrate information distributed on the Internet, are drawing attention. In this paper, under the assumption that the information sources to be integrated are updated frequently and asynchronously, we propose an information gathering method that constructs an answer to a query from a user, accessing information sources to be integrated properly within an allowable time period. The proposed method considers the reliability of data in the cache and the quality of answer in order to efficiently access information sources and to provide appropriate answers to the user. As evaluation, we show the effectiveness of the proposed method by using an artificial information integration problem, in which some parameters can be modified, and a real-world flight information service compared with a conventional FIFO information gathering method

an intellig inform gather method for dynam inform mediat
 the internet is spread into our societi rapidli and is becom one of the inform infrastructur that are indispens for our daili life . in particular , the www is wide use for variou purpos such as share person inform , academ research , busi work , and electron commerc , and the amount of avail inform is increas rapidli . we usual util inform sourc on the internet as individu stand-alon sourc , but if we can integr them , we can add more valu to each of them . henc , inform mediat , which integr inform distribut on the internet , are draw attent . in thi paper , under the assumpt that the inform sourc to be integr are updat frequent and asynchron , we propos an inform gather method that construct an answer to a queri from a user , access inform sourc to be integr properli within an allow time period . the propos method consid the reliabl of data in the cach and the qualiti of answer in order to effici access inform sourc and to provid appropri answer to the user . as evalu , we show the effect of the propos method by use an artifici inform integr problem , in which some paramet can be modifi , and a real-world flight inform servic compar with a convent fifo inform gather method


Formalising optimal feature weight setting in case based diagnosis as linear programming problems

Abstract: Many approaches to case based reasoning (CBR) exploit feature weight setting algorithms to reduce the sensitivity to distance functions. We demonstrate that optimal feature weight setting in a special kind of CBR problems can be formalised as linear programming problems. Therefore, the optimal weight settings can be calculated in polynomial time instead of searching in exponential weight space using heuristics to get sub-optimal settings. We also demonstrate that our approach can be used to solve classification problems

formalis optim featur weight set in case base diagnosi as linear program problem
 mani approach to case base reason ( cbr ) exploit featur weight set algorithm to reduc the sensit to distanc function . we demonstr that optim featur weight set in a special kind of cbr problem can be formalis as linear program problem . therefor , the optim weight set can be calcul in polynomi time instead of search in exponenti weight space use heurist to get sub-optim set . we also demonstr that our approach can be use to solv classif problem

optimal feature weight setting
case based diagnosis
linear programming
case based reasoning
distance functions
polynomial time
searching
exponential weight space
heuristics
classification


Schema evolution in data warehouses

Abstract: We address the issues related to the evolution and maintenance of data warehousing systems, when underlying data sources change their schema capabilities. These changes can invalidate views at the data warehousing system. We present an approach for dynamically adapting views according to schema changes arising on source relations. This type of maintenance concerns both the schema and the data of the data warehouse. The main issue is to avoid the view recomputation from scratch especially when views are defined from multiple sources. The data of the data warehouse is used primarily in organizational decision-making and may be strategic. Therefore, the schema of the data warehouse can evolve for modeling new requirements resulting from analysis or data-mining processing. Our approach provides means to support schema evolution of the data warehouse independently of the data sources

schema evolut in data warehous
 we address the issu relat to the evolut and mainten of data wareh system , when underli data sourc chang their schema capabl . these chang can invalid view at the data wareh system . we present an approach for dynam adapt view accord to schema chang aris on sourc relat . thi type of mainten concern both the schema and the data of the data warehous . the main issu is to avoid the view recomput from scratch especi when view are defin from multipl sourc . the data of the data warehous is use primarili in organiz decision-mak and may be strateg . therefor , the schema of the data warehous can evolv for model new requir result from analysi or data-min process . our approach provid mean to support schema evolut of the data warehous independ of the data sourc

schema evolution
data warehouses
data sources
source relations
organizational decision-making
system maintenance
containment
structural view maintenance
view adaptation
SQL query
data analysis


Gender benders [women in computing profession]

Abstract: As a minority in the upper levels of the computing profession, women are sometimes mistreated through ignorance or malice. Some women have learned to respond with wit and panache

gender bender [ women in comput profess ]
 as a minor in the upper level of the comput profess , women are sometim mistreat through ignor or malic . some women have learn to respond with wit and panach


Active pitch control in larger scale fixed speed horizontal axis wind turbine systems. I. linear controller design

Abstract: This paper reviews and addresses the principles of linear controller design of the fixed speed wind turbine system in above rated wind speed, using pitch angle control of the blades and applying modern control theory. First, the nonlinear equations of the system are built in under some reasonable suppositions. Then, the nonlinear equations are linearised at set operating point and digital simulation results are shown in this paper. Finally, a linear quadratic optimal feedback controller is designed and the dynamics of the closed circle system are simulated with digital calculation. The advantages and disadvantages of the assumptions and design method are also discussed. Because of the inherent characteristics of the linear system control theory, the performance of the linear controller is not sufficient for operating wind turbines, as is discussed

activ pitch control in larger scale fix speed horizont axi wind turbin system . i. linear control design
 thi paper review and address the principl of linear control design of the fix speed wind turbin system in abov rate wind speed , use pitch angl control of the blade and appli modern control theori . first , the nonlinear equat of the system are built in under some reason supposit . then , the nonlinear equat are linearis at set oper point and digit simul result are shown in thi paper . final , a linear quadrat optim feedback control is design and the dynam of the close circl system are simul with digit calcul . the advantag and disadvantag of the assumpt and design method are also discuss . becaus of the inher characterist of the linear system control theori , the perform of the linear control is not suffici for oper wind turbin , as is discuss


Web content extraction. A WhizBang! approach

Abstract: The extraction technology that Whizbang uses consists of a unique approach to scouring the Web for current, very specific forms of information. FlipDog, for example, checks company Web sites for hyperlinks to pages that list job opportunities. It then crawls to the deeper page and, using the WhizBang! Extraction Framework, extracts the key elements of the postings, such as job title, name of employer, job category, and job function. Click on a job and you are transferred to the company Web site to view the job description as it appears there

web content extract . a whizbang ! approach
 the extract technolog that whizbang use consist of a uniqu approach to scour the web for current , veri specif form of inform . flipdog , for exampl , check compani web site for hyperlink to page that list job opportun . it then crawl to the deeper page and , use the whizbang ! extract framework , extract the key element of the post , such as job titl , name of employ , job categori , and job function . click on a job and you are transfer to the compani web site to view the job descript as it appear there

Web content extraction
FlipDog
company Web sites
WhizBang! Extraction Framework
job description
job-hunting site


Implementation of DIMSIMs for stiff differential systems

Abstract: Some issues related to the implementation of diagonally implicit multistage integration methods for stiff differential systems are discussed. They include reliable estimation of the local discretization error, construction of continuous interpolants, solution of nonlinear systems of equations by simplified Newton iterations, choice of initial stepsize and order, and step and order changing strategy. Numerical results are presented which indicate that an experimental Matlab code based on type 2 methods of order one, two and three outperforms ode15s code from Matlab ODE suite on problems whose Jacobian has eigenvalues which are close to the imaginary axis

implement of dimsim for stiff differenti system
 some issu relat to the implement of diagon implicit multistag integr method for stiff differenti system are discuss . they includ reliabl estim of the local discret error , construct of continu interpol , solut of nonlinear system of equat by simplifi newton iter , choic of initi stepsiz and order , and step and order chang strategi . numer result are present which indic that an experiment matlab code base on type 2 method of order one , two and three outperform ode15 code from matlab ode suit on problem whose jacobian ha eigenvalu which are close to the imaginari axi


Look who's talking [voice recognition]

Abstract: Voice recognition could be the answer to the problem of financial fraud, but in the world of biometric technology, money talks

look who 's talk [ voic recognit ]
 voic recognit could be the answer to the problem of financi fraud , but in the world of biometr technolog , money talk

voice recognition
financial fraud
biometric
cost


Quadratic Newton iteration for systems with multiplicity

Abstract: Newton's iterator is one of the most popular components of polynomial equation system solvers, either from the numeric or symbolic point of view. This iterator usually handles smooth situations only (when the Jacobian matrix associated to the system is invertible). This is often a restrictive factor. Generalizing Newton's iterator is still an open problem: How to design an efficient iterator with a quadratic convergence even in degenerate cases? We propose an answer for an m-adic topology when the ideal m can be chosen generic enough: compared to a smooth case we prove quadratic convergence with a small overhead that grows with the square of the multiplicity of the root

quadrat newton iter for system with multipl
 newton 's iter is one of the most popular compon of polynomi equat system solver , either from the numer or symbol point of view . thi iter usual handl smooth situat onli ( when the jacobian matrix associ to the system is invert ) . thi is often a restrict factor . gener newton 's iter is still an open problem : how to design an effici iter with a quadrat converg even in degener case ? we propos an answer for an m-adic topolog when the ideal m can be chosen gener enough : compar to a smooth case we prove quadrat converg with a small overhead that grow with the squar of the multipl of the root

quadratic Newton iteration
systems with multiplicity
Newton's iterator
polynomial equation system solvers
Jacobian matrix
quadratic convergence
m-adic topology


When the unexpected happens [disaster planning in banks]

Abstract: A business disruption can be as simple as a power failure or as complex as a terrorist attack. Regardless, you will need to have a plan to minimize interruptions to both your bank and your customers. Marketers have a role in this readiness process

when the unexpect happen [ disast plan in bank ]
 a busi disrupt can be as simpl as a power failur or as complex as a terrorist attack . regardless , you will need to have a plan to minim interrupt to both your bank and your custom . market have a role in thi readi process

disaster planning
planning
banks
recovery
public relations
emergency management


Selective representing and world-making

Abstract: We discuss the thesis of selective representing-the idea that the contents of the mental representations had by organisms are highly constrained by the biological niches within which the organisms evolved. While such a thesis has been defended by several authors elsewhere, our primary concern here is to take up the issue of the compatibility of selective representing and realism. We hope to show three things. First, that the notion of selective representing is fully consistent with the realist idea of a mind-independent world. Second, that not only are these two consistent, but that the latter (the realist conception of a mind-independent world) provides the most powerful perspective from which to motivate and understand the differing perceptual and cognitive profiles themselves. Third, that the (genuine and important) sense in which organism and environment may together constitute an integrated system of scientific interest poses no additional threat to the realist conception

select repres and world-mak
 we discuss the thesi of select representing-th idea that the content of the mental represent had by organ are highli constrain by the biolog nich within which the organ evolv . while such a thesi ha been defend by sever author elsewher , our primari concern here is to take up the issu of the compat of select repres and realism . we hope to show three thing . first , that the notion of select repres is fulli consist with the realist idea of a mind-independ world . second , that not onli are these two consist , but that the latter ( the realist concept of a mind-independ world ) provid the most power perspect from which to motiv and understand the differ perceptu and cognit profil themselv . third , that the ( genuin and import ) sens in which organ and environ may togeth constitut an integr system of scientif interest pose no addit threat to the realist concept

selective representing
world-making
mental representations
organisms
realism
mind-independent world
cognitive profiles


Dynamics and control of initialized fractional-order systems

Abstract: Due to the importance of historical effects in fractional-order systems, this paper presents a general fractional-order system and control theory that includes the time-varying initialization response. Previous studies have not properly accounted for these historical effects. The initialization response, along with the forced response, for fractional-order systems is determined. The scalar fractional-order impulse response is determined, and is a generalization of the exponential function. Stability properties of fractional-order systems are presented in the complex w-plane, which is a transformation of the s-plane. Time responses are discussed with respect to pole positions in the complex w-plane and frequency response behavior is included. A fractional-order vector space representation, which is a generalization of the state space concept, is presented including the initialization response. Control methods for vector representations of initialized fractional-order systems are shown. Finally, the fractional-order differintegral is generalized to continuous order-distributions which have the possibility of including all fractional orders in a transfer function

dynam and control of initi fractional-ord system
 due to the import of histor effect in fractional-ord system , thi paper present a gener fractional-ord system and control theori that includ the time-vari initi respons . previou studi have not properli account for these histor effect . the initi respons , along with the forc respons , for fractional-ord system is determin . the scalar fractional-ord impuls respons is determin , and is a gener of the exponenti function . stabil properti of fractional-ord system are present in the complex w-plane , which is a transform of the s-plane . time respons are discuss with respect to pole posit in the complex w-plane and frequenc respons behavior is includ . a fractional-ord vector space represent , which is a gener of the state space concept , is present includ the initi respons . control method for vector represent of initi fractional-ord system are shown . final , the fractional-ord differintegr is gener to continu order-distribut which have the possibl of includ all fraction order in a transfer function

dynamics
control
initialized fractional-order systems
initialization response
forced response
impulse response
exponential function
vector space representation
state space concept
fractional-order differintegral
transfer function


Computing 2002: democracy, education, and the future

Abstract: Computer scientists, computer engineers, information technologists, and their collective products have grown and changed in quantity, quality, and nature. In the first decade of this new century, it should become apparent to everyone that the computing and information fields, broadly defined, will have a profound impact on every element of every person's life. The author considers how women and girls of the world have been neither educated for computing nor served by computing. Globally, women's participation in computer science grew for a while, then dropped precipitously. Computing, science, engineering, and society will suffer if this decline continues, because women have different perspectives on technology, what it is important for, how it should be built, which projects should be funded, and so on. To create a positive future, to assure that women equally influence the future, computing education must change

comput 2002 : democraci , educ , and the futur
 comput scientist , comput engin , inform technologist , and their collect product have grown and chang in quantiti , qualiti , and natur . in the first decad of thi new centuri , it should becom appar to everyon that the comput and inform field , broadli defin , will have a profound impact on everi element of everi person 's life . the author consid how women and girl of the world have been neither educ for comput nor serv by comput . global , women 's particip in comput scienc grew for a while , then drop precipit . comput , scienc , engin , and societi will suffer if thi declin continu , becaus women have differ perspect on technolog , what it is import for , how it should be built , which project should be fund , and so on . to creat a posit futur , to assur that women equal influenc the futur , comput educ must chang

democracy
future
women
girls
society
computer science education
gender issues


Reply to Carreira-Perpinan and Goodhill [mathematics in biology]

Abstract: In a paper by Carreira-Perpinan and Goodhill (see ibid., vol.14, no.7, p.1545-60, 2002) the authors apply mathematical arguments to biology. Swindale et al. think it is inappropriate to apply the standards of proof required in mathematics to the acceptance or rejection of scientific hypotheses. To give some examples, showing that data are well described by a linear model does not rule out an infinity of other possible models that might give better descriptions of the data. Proving in a mathematical sense that the linear model was correct would require ruling out all other possible models, a hopeless task. Similarly, to demonstrate that two DNA samples come from the same individual, it is sufficient to show a match between only a few regions of the genome, even though there remains a very large number of additional comparisons that could be done, any one of which might potentially disprove the match. This is unacceptable in mathematics, but in the real world, it is a perfectly reasonable basis for belief

repli to carreira-perpinan and goodhil [ mathemat in biolog ]
 in a paper by carreira-perpinan and goodhil ( see ibid . , vol.14 , no.7 , p.1545 - 60 , 2002 ) the author appli mathemat argument to biolog . swindal et al . think it is inappropri to appli the standard of proof requir in mathemat to the accept or reject of scientif hypothes . to give some exampl , show that data are well describ by a linear model doe not rule out an infin of other possibl model that might give better descript of the data . prove in a mathemat sens that the linear model wa correct would requir rule out all other possibl model , a hopeless task . similarli , to demonstr that two dna sampl come from the same individu , it is suffici to show a match between onli a few region of the genom , even though there remain a veri larg number of addit comparison that could be done , ani one of which might potenti disprov the match . thi is unaccept in mathemat , but in the real world , it is a perfectli reason basi for belief

biology
mathematical arguments
scientific hypotheses
linear model
DNA
genome
hypothesis testing
cortical maps
neural nets


Automatic multilevel thresholding for image segmentation by the growing time adaptive self-organizing map

Abstract: In this paper, a Growing TASOM (Time Adaptive Self-Organizing Map) network called "GTASOM" along with a peak finding process is proposed for automatic multilevel thresholding. The proposed GTASOM is tested for image segmentation. Experimental results demonstrate that the GTASOM is a reliable and accurate tool for image segmentation and its results outperform other thresholding methods

automat multilevel threshold for imag segment by the grow time adapt self-organ map
 in thi paper , a grow tasom ( time adapt self-organ map ) network call " gtasom " along with a peak find process is propos for automat multilevel threshold . the propos gtasom is test for imag segment . experiment result demonstr that the gtasom is a reliabl and accur tool for imag segment and it result outperform other threshold method


Efficient feasibility testing for dial-a-ride problems

Abstract: Dial-a-ride systems involve dispatching a vehicle to satisfy demands from a set of customers who call a vehicle-operating agency requesting that an item tie picked up from a specific location and delivered to a specific destination. Dial-a-ride problems differ from other routing and scheduling problems, in that they typically involve service-related constraints. It is common to have maximum wait time constraints and maximum ride time constraints. In the presence of maximum wait time and maximum ride time restrictions, it is not clear how to efficiently determine, given a sequence of pickups and deliveries, whether a feasible schedule exists. We demonstrate that this, in fact, can be done in linear time

effici feasibl test for dial-a-rid problem
 dial-a-rid system involv dispatch a vehicl to satisfi demand from a set of custom who call a vehicle-oper agenc request that an item tie pick up from a specif locat and deliv to a specif destin . dial-a-rid problem differ from other rout and schedul problem , in that they typic involv service-rel constraint . it is common to have maximum wait time constraint and maximum ride time constraint . in the presenc of maximum wait time and maximum ride time restrict , it is not clear how to effici determin , given a sequenc of pickup and deliveri , whether a feasibl schedul exist . we demonstr that thi , in fact , can be done in linear time

feasibility testing
dial-a-ride problems
dispatching
vehicle-operating agency
routing
scheduling
service-related constraints
maximum wait time constraints
maximum ride time constraints


A new high resolution color flow system using an eigendecomposition-based adaptive filter for clutter rejection

Abstract: We present a new signal processing strategy for high frequency color flow mapping in moving tissue environments. A new application of an eigendecomposition-based clutter rejection filter is presented with modifications to deal with high blood-to-clutter ratios (BCR). Additionally, a new method for correcting blood velocity estimates with an estimated tissue motion profile is detailed. The performance of the clutter filter and velocity estimation strategies is quantified using a new swept-scan signal model. In vivo color flow images are presented to illustrate the potential of the system for mapping blood flow in the microcirculation with external tissue motion

a new high resolut color flow system use an eigendecomposition-bas adapt filter for clutter reject
 we present a new signal process strategi for high frequenc color flow map in move tissu environ . a new applic of an eigendecomposition-bas clutter reject filter is present with modif to deal with high blood-to-clutt ratio ( bcr ) . addit , a new method for correct blood veloc estim with an estim tissu motion profil is detail . the perform of the clutter filter and veloc estim strategi is quantifi use a new swept-scan signal model . in vivo color flow imag are present to illustr the potenti of the system for map blood flow in the microcircul with extern tissu motion


Pool halls, chips, and war games: women in the culture of computing

Abstract: Computers are becoming ubiquitous in our society and they offer superb opportunities for people in jobs and everyday life. But there is a noticeable sex difference in use of computers among children. This article asks why computers are more attractive to boys than to girls and offers a cultural framework for explaining the apparent sex differences. Although the data are fragmentary, the world of computing seems to be more consistent with male adolescent culture than with feminine values and goals. Furthermore, both arcade and educational software is designed with boys in mind. These observations lead us to speculate that computing is neither inherently difficult nor uninteresting to girls, but rather that computer games and other software might have to be designed differently for girls. Programs to help teachers instill computer efficacy in all children also need to be developed

pool hall , chip , and war game : women in the cultur of comput
 comput are becom ubiquit in our societi and they offer superb opportun for peopl in job and everyday life . but there is a notic sex differ in use of comput among children . thi articl ask whi comput are more attract to boy than to girl and offer a cultur framework for explain the appar sex differ . although the data are fragmentari , the world of comput seem to be more consist with male adolesc cultur than with feminin valu and goal . furthermor , both arcad and educ softwar is design with boy in mind . these observ lead us to specul that comput is neither inher difficult nor uninterest to girl , but rather that comput game and other softwar might have to be design differ for girl . program to help teacher instil comput efficaci in all children also need to be develop

women
culture of computing
sex difference
children
male adolescent culture
educational software
computer games
teachers


A study of computer attitudes of non-computing students of technical colleges in Brunei Darussalam

Abstract: The study surveyed 268 non-computing students among three technical colleges in Brunei Darussalam. The study validated an existing instrument to measure computer attitudes of non-computing students, and identified factors that contributed to the formation of their attitudes. The findings show that computer experience and educational qualification are associated with students' computer attitudes. In contrast, variables such as gender, age, ownership of a personal computer (PC), geographical location of institution, and prior computer training appeared to have no impact on computer attitudes

a studi of comput attitud of non-comput student of technic colleg in brunei darussalam
 the studi survey 268 non-comput student among three technic colleg in brunei darussalam . the studi valid an exist instrument to measur comput attitud of non-comput student , and identifi factor that contribut to the format of their attitud . the find show that comput experi and educ qualif are associ with student ' comput attitud . in contrast , variabl such as gender , age , ownership of a person comput ( pc ) , geograph locat of institut , and prior comput train appear to have no impact on comput attitud

computer attitudes
technical colleges
survey
computer experience
educational qualification
gender
age
computer training
noncomputing students
personal computer ownership
educational computing
end user computing


A fundamental investigation into large strain recovery of one-way shape memory alloy wires embedded in flexible polyurethanes

Abstract: Shape memory alloys (SMAs) are being embedded in or externally attached to smart structures because of the large amount of actuation deformation and force that these materials are capable of producing when they are heated. Previous investigations have focused primarily on using single or opposing SMA wires exhibiting the two-way shape memory effect (SME) because of the simplicity with which the repeatable actuation behavior of the structure can be predicted. This repeatable actuation behavior is achieved at the expense of reduced levels of recoverable deformation. Alternatively, many potential smart structure applications will employ multiple SMA wires exhibiting a permanent one-way SME to simplify fabrication and increase the recoverable strains in the structure. To employ the one-way wires, it is necessary to investigate how they affect the recovery of large strains when they are embedded in a structure. In this investigation, the large strain recovery of a one-way SMA wire embedded in a flexible polyurethane is characterized using the novel deformation measurement technique known as digital image correlation. These results are compared with a simple actuation model and a three-dimensional finite element analysis of the structure using the Brinson model for describing the thermomechanical behavior of the SMA. Results indicate that the level of actuation strain in the structure is substantially reduced by the inelastic behavior of the one-way SMA wires, and there are significant differences between the deformations of the matrix material adjacent to the SMA wires and in the region surrounding it. The transformation behavior of the SMA wires was also determined to be volume preserving, which had a significant effect on the transverse strain fields

a fundament investig into larg strain recoveri of one-way shape memori alloy wire embed in flexibl polyurethan
 shape memori alloy ( sma ) are be embed in or extern attach to smart structur becaus of the larg amount of actuat deform and forc that these materi are capabl of produc when they are heat . previou investig have focus primarili on use singl or oppos sma wire exhibit the two-way shape memori effect ( sme ) becaus of the simplic with which the repeat actuat behavior of the structur can be predict . thi repeat actuat behavior is achiev at the expens of reduc level of recover deform . altern , mani potenti smart structur applic will employ multipl sma wire exhibit a perman one-way sme to simplifi fabric and increas the recover strain in the structur . to employ the one-way wire , it is necessari to investig how they affect the recoveri of larg strain when they are embed in a structur . in thi investig , the larg strain recoveri of a one-way sma wire embed in a flexibl polyurethan is character use the novel deform measur techniqu known as digit imag correl . these result are compar with a simpl actuat model and a three-dimension finit element analysi of the structur use the brinson model for describ the thermomechan behavior of the sma . result indic that the level of actuat strain in the structur is substanti reduc by the inelast behavior of the one-way sma wire , and there are signific differ between the deform of the matrix materi adjac to the sma wire and in the region surround it . the transform behavior of the sma wire wa also determin to be volum preserv , which had a signific effect on the transvers strain field


Bisimulation minimization and symbolic model checking

Abstract: State space minimization techniques are crucial for combating state explosion. A variety of explicit-state verification tools use bisimulation minimization to check equivalence between systems, to minimize components before composition, or to reduce a state space prior to model checking. Experimental results on bisimulation minimization in symbolic model checking contexts, however, are mixed. We explore bisimulation minimization as an optimization in symbolic model checking of invariance properties. We consider three bisimulation minimization algorithms. From each, we produce a BDD-based model checker for invariant properties and compare this model checker to a conventional one based on backwards reachability. Our comparisons, both theoretical and experimental, suggest that bisimulation minimization is not viable in the context of invariance verification, because performing the minimization requires as many, if not more, computational resources as model checking the unminimized system through backwards reachability

bisimul minim and symbol model check
 state space minim techniqu are crucial for combat state explos . a varieti of explicit-st verif tool use bisimul minim to check equival between system , to minim compon befor composit , or to reduc a state space prior to model check . experiment result on bisimul minim in symbol model check context , howev , are mix . we explor bisimul minim as an optim in symbol model check of invari properti . we consid three bisimul minim algorithm . from each , we produc a bdd-base model checker for invari properti and compar thi model checker to a convent one base on backward reachabl . our comparison , both theoret and experiment , suggest that bisimul minim is not viabl in the context of invari verif , becaus perform the minim requir as mani , if not more , comput resourc as model check the unminim system through backward reachabl

bisimulation minimization
symbolic model checking
state space minimization techniques
state explosion
explicit-state verification tools
experimental results
optimization
invariance properties
backwards reachability
invariance verification
BDD
binary decision diagram


A new identification approach for FIR models

Abstract: The identification of stochastic discrete systems disturbed with noise is discussed in this brief. The concept of general prediction error (GPE) criterion is introduced for the time-domain estimate with optimal frequency estimation (OFE) introduced for the frequency-domain estimate. The two estimation methods are combined to form a new identification algorithm, which is called the empirical frequency-domain optimal parameter (EFOP) estimate, for the finite impulse response (FIR) model interfered by noise. The algorithm theoretically provides the global optimum of the model frequency-domain estimate. Some simulation examples are given to illustrate the new identification method

a new identif approach for fir model
 the identif of stochast discret system disturb with nois is discuss in thi brief . the concept of gener predict error ( gpe ) criterion is introduc for the time-domain estim with optim frequenc estim ( ofe ) introduc for the frequency-domain estim . the two estim method are combin to form a new identif algorithm , which is call the empir frequency-domain optim paramet ( efop ) estim , for the finit impuls respons ( fir ) model interf by nois . the algorithm theoret provid the global optimum of the model frequency-domain estim . some simul exampl are given to illustr the new identif method

empirical frequency-domain optimal parameter estimate


Remember e-commerce? Yeah, well, it's still here

Abstract: Sandy Kemper, the always outspoken CEO of successful e-commerce company eScout, offers his views on the purported demise of "commerce" in e-commerce, and what opportunities lie ahead for those bankers bold enough to act in a market turned tentative by early excesses

rememb e-commerc ? yeah , well , it 's still here
 sandi kemper , the alway outspoken ceo of success e-commerc compani escout , offer hi view on the purport demis of " commerc " in e-commerc , and what opportun lie ahead for those banker bold enough to act in a market turn tent by earli excess


Loop restructuring for data I/O minimization on limited on-chip memory embedded processors

Abstract: In this paper, we propose a framework for analyzing the flow of values and their reuse in loop nests to minimize data traffic under the constraints of limited on-chip memory capacity and dependences. Our analysis first undertakes fusion of possible loop nests intra-procedurally and then performs loop distribution. The analysis discovers the closeness factor of two statements which is a quantitative measure of data traffic saved per unit memory occupied if the statements were under the same loop nest over the case where they are under different loop nests. We then develop a greedy algorithm which traverses the program dependence graph to group statements together under the same loop nest legally to promote maximal reuse per unit of memory occupied. We implemented our framework in Petit, a tool for dependence analysis and loop transformations. We compared our method with one based on tiling of fused loop nest and one based on a greedy strategy to purely maximize reuse. We show that our methods work better than both of these strategies in most cases for processors such as TMS320Cxx, which have a very limited amount of on-chip memory. The improvements in data I/O range from 10 to 30 percent over tiling and from 10 to 40 percent over maximal reuse for JPEG loops

loop restructur for data i / o minim on limit on-chip memori embed processor
 in thi paper , we propos a framework for analyz the flow of valu and their reus in loop nest to minim data traffic under the constraint of limit on-chip memori capac and depend . our analysi first undertak fusion of possibl loop nest intra-procedur and then perform loop distribut . the analysi discov the close factor of two statement which is a quantit measur of data traffic save per unit memori occupi if the statement were under the same loop nest over the case where they are under differ loop nest . we then develop a greedi algorithm which travers the program depend graph to group statement togeth under the same loop nest legal to promot maxim reus per unit of memori occupi . we implement our framework in petit , a tool for depend analysi and loop transform . we compar our method with one base on tile of fuse loop nest and one base on a greedi strategi to pure maxim reus . we show that our method work better than both of these strategi in most case for processor such as tms320cxx , which have a veri limit amount of on-chip memori . the improv in data i / o rang from 10 to 30 percent over tile and from 10 to 40 percent over maxim reus for jpeg loop

loop restructuring
data I/O minimization
on-chip memory
embedded processors
data traffic
closeness factor
program dependence graph
Petit
fused loop nest
loop fusion
data locality
DSP


Women in computing history

Abstract: Exciting inventions, innovative technology, human interaction, and intriguing politics fill computing history. However, the recorded history is mainly composed of male achievements and involvements, even though women have played substantial roles. This situation is not unusual. Most science fields are notorious for excluding, undervaluing, or overlooking the accomplishments of their female scientists. As Lee points out, it is up to the historians and others to remedy this imbalance. Steps have been taken towards this goal through publishing biographies on women in technology, and through honoring the pioneers with various awards such as the GHC'97 Pioneering Awards, the WITI Hall of Fame, and the AWC Lovelace Award. A few online sites contain biographies of women in technology. However, even with these resources, many women who have contributed significantly to computer science are still to be discovered

women in comput histori
 excit invent , innov technolog , human interact , and intrigu polit fill comput histori . howev , the record histori is mainli compos of male achiev and involv , even though women have play substanti role . thi situat is not unusu . most scienc field are notori for exclud , undervalu , or overlook the accomplish of their femal scientist . as lee point out , it is up to the historian and other to remedi thi imbal . step have been taken toward thi goal through publish biographi on women in technolog , and through honor the pioneer with variou award such as the ghc'97 pioneer award , the witi hall of fame , and the awc lovelac award . a few onlin site contain biographi of women in technolog . howev , even with these resourc , mani women who have contribut significantli to comput scienc are still to be discov


International customers, suppliers, and document delivery in a fee-based information service

Abstract: The Purdue University Libraries library fee-based information service, the Technical Information Service (TIS), works with both international customers and international suppliers to meet its customers' needs for difficult and esoteric document requests. Successful completion of these orders requires the ability to verify fragmentary citations; ascertain documents' availability; obtain pricing information; calculate inclusive cost quotes; meet customers' deadlines; accept international payments; and ship across borders. While international orders make tip a small percent of the total workload, these challenging and rewarding orders meet customers' needs and offer continuous improvement opportunities to the staff

intern custom , supplier , and document deliveri in a fee-bas inform servic
 the purdu univers librari librari fee-bas inform servic , the technic inform servic ( ti ) , work with both intern custom and intern supplier to meet it custom ' need for difficult and esoter document request . success complet of these order requir the abil to verifi fragmentari citat ; ascertain document ' avail ; obtain price inform ; calcul inclus cost quot ; meet custom ' deadlin ; accept intern payment ; and ship across border . while intern order make tip a small percent of the total workload , these challeng and reward order meet custom ' need and offer continu improv opportun to the staff

Purdue University Libraries fee-based information service


Craigslist: virtual community maintains human touch

Abstract: If it works why change it? This might have been the thought on the minds of dot com executives back when Internet businesses were booming, and most of the Web content was free. Web sites were overflowing with advertisements of every kind and size. Now that dot com principals know better, Web ads are no longer the only path to revenue generation. Community portals, however, never seemed to have many ads to begin with, and their content stayed truer to who they served. Many of them started off as simple places for users to list announcements, local events, want ads, real estate, and mingle with other local users. The author saw the need for San Franciscans to have a place to do all of that for free, without any annoying advertising, and ended up offering much more to his community with the creation of craigslist. "[Polling users] was a good way for us to connect with our members, this is the way to operate successfully in situations like these - your members come first."

craigslist : virtual commun maintain human touch
 if it work whi chang it ? thi might have been the thought on the mind of dot com execut back when internet busi were boom , and most of the web content wa free . web site were overflow with advertis of everi kind and size . now that dot com princip know better , web ad are no longer the onli path to revenu gener . commun portal , howev , never seem to have mani ad to begin with , and their content stay truer to who they serv . mani of them start off as simpl place for user to list announc , local event , want ad , real estat , and mingl with other local user . the author saw the need for san franciscan to have a place to do all of that for free , without ani annoy advertis , and end up offer much more to hi commun with the creation of craigslist . " [ poll user ] wa a good way for us to connect with our member , thi is the way to oper success in situat like these - your member come first . "

craigslist
virtual community
Internet businesses
Web content
revenue generation
community portals
announcements
local events
want ads
real estate
San Francisco Bay community


Differential algebraic systems anew

Abstract: It is proposed to figure out the leading term in differential algebraic systems more precisely. Low index linear systems with those properly stated leading terms are considered in detail. In particular, it is asked whether a numerical integration method applied to the original system reaches the inherent regular ODE without conservation, i.e., whether the discretization and the decoupling commute in some sense. In general one cannot expect this commutativity so that additional difficulties like strong stepsize restrictions may arise. Moreover, abstract differential algebraic equations in infinite-dimensional Hilbert spaces are introduced, and the index notion is generalized to those equations. In particular, partial differential algebraic equations are considered in this abstract formulation

differenti algebra system anew
 it is propos to figur out the lead term in differenti algebra system more precis . low index linear system with those properli state lead term are consid in detail . in particular , it is ask whether a numer integr method appli to the origin system reach the inher regular ode without conserv , i.e. , whether the discret and the decoupl commut in some sens . in gener one can not expect thi commut so that addit difficulti like strong stepsiz restrict may aris . moreov , abstract differenti algebra equat in infinite-dimension hilbert space are introduc , and the index notion is gener to those equat . in particular , partial differenti algebra equat are consid in thi abstract formul


Creating Web-based listings of electronic journals without creating extra work

Abstract: Creating up-to-date listings of electronic journals is challenging due to frequent changes in titles available and in URLs for electronic journal titles. However, many library users may want to browse Web pages which contain listings of electronic journals arranged by title and/or academic disciplines. This case study examines the development of a system which automatically exports data from the online catalog and incorporates it into dynamically-generated Web sites. These sites provide multiple access points for journals, include Web-based interfaces enabling subject specialists to manage the list of titles which appears in their subject area. Because data are automatically extracted from the catalog, overlap in updating titles and URLs is avoided. Following the creation of this system, usage of electronic journals dramatically increased and feedback has been positive. Future challenges include developing more frequent updates and motivating subject specialists to more regularly monitor new titles

creat web-bas list of electron journal without creat extra work
 creat up-to-d list of electron journal is challeng due to frequent chang in titl avail and in url for electron journal titl . howev , mani librari user may want to brows web page which contain list of electron journal arrang by titl and/or academ disciplin . thi case studi examin the develop of a system which automat export data from the onlin catalog and incorpor it into dynamically-gener web site . these site provid multipl access point for journal , includ web-bas interfac enabl subject specialist to manag the list of titl which appear in their subject area . becaus data are automat extract from the catalog , overlap in updat titl and url is avoid . follow the creation of thi system , usag of electron journal dramat increas and feedback ha been posit . futur challeng includ develop more frequent updat and motiv subject specialist to more regularli monitor new titl

Web-based listings
electronic journals
URL
library
Web pages
case study
online catalog
Web sites
feedback
technical services
public services partnerships


A digital fountain approach to asynchronous reliable multicast

Abstract: The proliferation of applications that must reliably distribute large, rich content to a vast number of autonomous receivers motivates the design of new multicast and broadcast protocols. We describe an ideal, fully scalable protocol for these applications that we call a digital fountain. A digital fountain allows any number of heterogeneous receivers to acquire content with optimal efficiency at times of their choosing. Moreover, no feedback channels are needed to ensure reliable delivery, even in the face of high loss rates. We develop a protocol that closely approximates a digital fountain using two new classes of erasure codes that for large block sizes are orders of magnitude faster than standard erasure codes. We provide performance measurements that demonstrate the feasibility of our approach and discuss the design, implementation, and performance of an experimental system

a digit fountain approach to asynchron reliabl multicast
 the prolifer of applic that must reliabl distribut larg , rich content to a vast number of autonom receiv motiv the design of new multicast and broadcast protocol . we describ an ideal , fulli scalabl protocol for these applic that we call a digit fountain . a digit fountain allow ani number of heterogen receiv to acquir content with optim effici at time of their choos . moreov , no feedback channel are need to ensur reliabl deliveri , even in the face of high loss rate . we develop a protocol that close approxim a digit fountain use two new class of erasur code that for larg block size are order of magnitud faster than standard erasur code . we provid perform measur that demonstr the feasibl of our approach and discuss the design , implement , and perform of an experiment system

digital fountain
asynchronous reliable multicast
autonomous receivers
broadcast protocols
scalable protocol
heterogeneous receivers
optimal efficiency
high loss rates
erasure codes
large block size
performance measurements
multicast protocol
experimental system performance
Internet
FEC codes
forward error correction
RS codes
Tornado codes
Luby transform codes
bulk data distribution
IP multicast
simulation results
interoperability
content distribution methods
Reed-Solomon codes
decoder

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


The development and evaluation of SHOKE2000: the PCI-based FPGA card

Abstract: This paper describes a PCI-based FPGA card, SHOKE2000, which was developed in order to study reconfigurable computing. Since the latest field programmable gate arrays (FPGA) consist of input/output (I/O) configurable blocks as well as internal configurable logic blocks, they not only realize various user logic circuits but also connect with popular I/O standards easily. These features enable FPGA to connect several devices with different interfaces, and thus new reconfigurable systems would be realizable by connecting the FPGA with devices such as digital signal processors (DSP) and analog devices. This paper describes the basic functions of SHOKE2000, which was developed for realizing hybrid reconfigurable systems consisting of FPGA, DSP, and analog devices. We also present application examples of SHOKE2000, including a simple image recognition application, a distributed shared memory computer cluster, and teaching materials for computer education

the develop and evalu of shoke2000 : the pci-bas fpga card
 thi paper describ a pci-bas fpga card , shoke2000 , which wa develop in order to studi reconfigur comput . sinc the latest field programm gate array ( fpga ) consist of input / output ( i / o ) configur block as well as intern configur logic block , they not onli realiz variou user logic circuit but also connect with popular i / o standard easili . these featur enabl fpga to connect sever devic with differ interfac , and thu new reconfigur system would be realiz by connect the fpga with devic such as digit signal processor ( dsp ) and analog devic . thi paper describ the basic function of shoke2000 , which wa develop for realiz hybrid reconfigur system consist of fpga , dsp , and analog devic . we also present applic exampl of shoke2000 , includ a simpl imag recognit applic , a distribut share memori comput cluster , and teach materi for comput educ