Numerical approximation of nonlinear BVPs by means of BVMs

Abstract: Boundary Value Methods (BVMs) would seem to be suitable candidates for the solution of nonlinear Boundary Value Problems (BVPs). They have been successfully used for solving linear BVPs together with a mesh selection strategy based on the conditioning of the linear systems. Our aim is to extend this approach so as to use them for the numerical approximation of nonlinear problems. For this reason, we consider the quasi-linearization technique that is an application of the Newton method to the nonlinear differential equation. Consequently, each iteration requires the solution of a linear BVP. In order to guarantee the convergence to the solution of the continuous nonlinear problem, it is necessary to determine how accurately the linear BVPs must be solved. For this goal, suitable stopping criteria on the residual and on the error for each linear BVP are given. Numerical experiments on stiff problems give rather satisfactory results, showing that the experimental code, called TOM, that uses a class of BVMs and the quasi-linearization technique, may be competitive with well known solvers for BVPs

numer approxim of nonlinear bvp by mean of bvm
 boundari valu method ( bvm ) would seem to be suitabl candid for the solut of nonlinear boundari valu problem ( bvp ) . they have been success use for solv linear bvp togeth with a mesh select strategi base on the condit of the linear system . our aim is to extend thi approach so as to use them for the numer approxim of nonlinear problem . for thi reason , we consid the quasi-linear techniqu that is an applic of the newton method to the nonlinear differenti equat . consequ , each iter requir the solut of a linear bvp . in order to guarante the converg to the solut of the continu nonlinear problem , it is necessari to determin how accur the linear bvp must be solv . for thi goal , suitabl stop criteria on the residu and on the error for each linear bvp are given . numer experi on stiff problem give rather satisfactori result , show that the experiment code , call tom , that use a class of bvm and the quasi-linear techniqu , may be competit with well known solver for bvp

numerical approximation
BVMs
boundary value methods
nonlinear boundary value problems
mesh selection strategy
quasi-linearization technique
Newton method
nonlinear differential equation
stopping criteria
stiff problems


Mobile banking's tough sell

Abstract: Banks are having to put their mobile-commerce projects on hold because the essential technology to make the services usable, in particular GPRS (general packet radio service) hasn't become widely available. It is estimated that by the end of 2002, only 5 per cent of adults will have GPRS phones. This will have a knock-on effect for other technologies such as clickable icons and multimedia messaging. In fact banking via WAP (wireless application protocol) has proved to be a frustrating and time-consuming process for the customer. Financial firms' hopes for higher mobile usage are stymied by the fact that improvements to the systems won't happen as fast as they want and the inadequacies of the system go beyond immature technology. Financial services institutions should not wait for customers to become au fait with their WAP. Instead they should be the ones "driving the traffic"

mobil bank 's tough sell
 bank are have to put their mobile-commerc project on hold becaus the essenti technolog to make the servic usabl , in particular gpr ( gener packet radio servic ) ha n't becom wide avail . it is estim that by the end of 2002 , onli 5 per cent of adult will have gpr phone . thi will have a knock-on effect for other technolog such as clickabl icon and multimedia messag . in fact bank via wap ( wireless applic protocol ) ha prove to be a frustrat and time-consum process for the custom . financi firm ' hope for higher mobil usag are stymi by the fact that improv to the system wo n't happen as fast as they want and the inadequaci of the system go beyond immatur technolog . financi servic institut should not wait for custom to becom au fait with their wap . instead they should be the one " drive the traffic "

banking
mobile-commerce
GPRS
wireless application protocol


Look into the future of content management

Abstract: Predictions of consolidation in the Content Management (CM) vendor arena have appeared in nearly every major industry prognosis over the past two years. Gartner Group, for example, recently reiterated its prediction that half the CM vendors in existence in mid-2001 would leave the marketplace by the end of 2002. Analysts consistently advise prospective CM buyers to tread carefully because their vendor may not stick around. But fortunately, the story goes, fewer vendor choices will finally bring greater clarity and sharper differentiators to this otherwise very messy product landscape. In fact, the number of CM vendors continues to rise. Industry growth has come through greater demand among CM buyers, but also expanding product functionality as well as successful partnerships. The marketplace certainly cannot sustain its current breadth of vendors in the long run, yet it remains unclear when and how any serious industry consolidation will occur. In the meantime, evolving business models and feature sets have created just the kind of clearer segmentation and transparent product differences that were supposed to emerge following an industry contraction

look into the futur of content manag
 predict of consolid in the content manag ( cm ) vendor arena have appear in nearli everi major industri prognosi over the past two year . gartner group , for exampl , recent reiter it predict that half the cm vendor in exist in mid-2001 would leav the marketplac by the end of 2002 . analyst consist advis prospect cm buyer to tread care becaus their vendor may not stick around . but fortun , the stori goe , fewer vendor choic will final bring greater clariti and sharper differenti to thi otherwis veri messi product landscap . in fact , the number of cm vendor continu to rise . industri growth ha come through greater demand among cm buyer , but also expand product function as well as success partnership . the marketplac certainli can not sustain it current breadth of vendor in the long run , yet it remain unclear when and how ani seriou industri consolid will occur . in the meantim , evolv busi model and featur set have creat just the kind of clearer segment and transpar product differ that were suppos to emerg follow an industri contract

content management
product functionality
partnerships
industry consolidation
enterprise systems


LAN-based building maintenance and surveillance robot

Abstract: The building and construction industry is the major industry of Hong Kong as in many developed countries around the world. After the commissioning of a high-rise building or a large estate, substantial manpower, both inside the management centre under a standby manner, as well as surveillance for security purposes around the whole building, is required for daily operation to ensure a quality environment for the occupants. If the surveillance job can be done by robots, the efficiency can be highly enhanced, resulting in a great saving of manpower and the improved safety of the management staff as a by-product. Furthermore, if the robot can retrieve commands from the building management system via a local area network (LAN), further savings in manpower can be achieved in terms of first-line fault attendance by human management staff. This paper describes the development of a robot prototype here in Hong Kong, which can handle some daily routine maintenance works and surveillance responsibilities. The hardware structure of the robot and its on-board devices are described. Real-time images captured by a camera on the robot with pan/tilt/zoom functions can be transmitted back to the central management office via a local area network. The interface between the robot and the building automation system (BAS) of the building is discussed. This is the first key achievement of this project with a strong implication on reducing the number of human staff to manage a modem building. Teleoperation of the robot via the Internet or intranet is also possible, which is the second achievement of this project. Finally, the robot can identify its physical position inside the building by a landmark recognition method based on standard CAD drawings, which is the third achievement of this project. The main goal of this paper is not the description of some groundbreaking technology in robotic development. It is mainly intended to convince building designers and managers to incorporate robotic systems when they are managing modem buildings to save manpower and improve efficiency

lan-bas build mainten and surveil robot
 the build and construct industri is the major industri of hong kong as in mani develop countri around the world . after the commiss of a high-ris build or a larg estat , substanti manpow , both insid the manag centr under a standbi manner , as well as surveil for secur purpos around the whole build , is requir for daili oper to ensur a qualiti environ for the occup . if the surveil job can be done by robot , the effici can be highli enhanc , result in a great save of manpow and the improv safeti of the manag staff as a by-product . furthermor , if the robot can retriev command from the build manag system via a local area network ( lan ) , further save in manpow can be achiev in term of first-lin fault attend by human manag staff . thi paper describ the develop of a robot prototyp here in hong kong , which can handl some daili routin mainten work and surveil respons . the hardwar structur of the robot and it on-board devic are describ . real-tim imag captur by a camera on the robot with pan / tilt / zoom function can be transmit back to the central manag offic via a local area network . the interfac between the robot and the build autom system ( ba ) of the build is discuss . thi is the first key achiev of thi project with a strong implic on reduc the number of human staff to manag a modem build . teleoper of the robot via the internet or intranet is also possibl , which is the second achiev of thi project . final , the robot can identifi it physic posit insid the build by a landmark recognit method base on standard cad draw , which is the third achiev of thi project . the main goal of thi paper is not the descript of some groundbreak technolog in robot develop . it is mainli intend to convinc build design and manag to incorpor robot system when they are manag modem build to save manpow and improv effici


Basin configuration of a six-dimensional model of an electric power system

Abstract: As part of an ongoing project on the stability of massively complex electrical power systems, we discuss the global geometric structure of contacts among the basins of attraction of a six-dimensional dynamical system. This system represents a simple model of an electrical power system involving three machines and an infinite bus. Apart from the possible occurrence of attractors representing pathological states, the contacts between the basins have a practical importance, from the point of view of the operation of a real electrical power system. With the aid of a global map of basins, one could hope to design an intervention strategy to boot the power system back into its normal state. Our method involves taking two-dimensional sections of the six-dimensional state space, and then determining the basins directly by numerical simulation from a dense grid of initial conditions. The relations among all the basins are given for a specific numerical example, that is, choosing particular values for the parameters in our model

basin configur of a six-dimension model of an electr power system
 as part of an ongo project on the stabil of massiv complex electr power system , we discuss the global geometr structur of contact among the basin of attract of a six-dimension dynam system . thi system repres a simpl model of an electr power system involv three machin and an infinit bu . apart from the possibl occurr of attractor repres patholog state , the contact between the basin have a practic import , from the point of view of the oper of a real electr power system . with the aid of a global map of basin , one could hope to design an intervent strategi to boot the power system back into it normal state . our method involv take two-dimension section of the six-dimension state space , and then determin the basin directli by numer simul from a dens grid of initi condit . the relat among all the basin are given for a specif numer exampl , that is , choos particular valu for the paramet in our model


Coarse-grained reduction and analysis of a network model of cortical response: I. Drifting grating stimuli

Abstract: We present a reduction of a large-scale network model of visual cortex developed by McLaughlin, Shapley, Shelley, and Wielaard. The reduction is from many integrate-and-fire neurons to a spatially coarse-grained system for firing rates of neuronal subpopulations. It accounts explicitly for spatially varying architecture, ordered cortical maps (such as orientation preference) that vary regularly across the cortical layer, and disordered cortical maps (such as spatial phase preference or stochastic input conductances) that may vary widely from cortical neuron to cortical neuron. The result of the reduction is a set of nonlinear spatiotemporal integral equations for "phase-averaged" firing rates of neuronal subpopulations across the model cortex, derived asymptotically from the full model without the addition of any extra phenomological constants. This reduced system is used to study the response of the model to drifting grating stimuli - where it is shown to be useful for numerical investigations that reproduce, at far less computational cost, the salient features of the point-neuron network and for analytical investigations that unveil cortical mechanisms behind the responses observed in the simulations of the large-scale computational model. For example, the reduced equations clearly show (1) phase averaging as the source of the time-invariance of cortico-cortical conductances, (2) the mechanisms in the model for higher firing rates and better orientation selectivity of simple cells which are near pinwheel centers, (3) the effects of the length-scales of cortico-cortical coupling, and (4) the role of noise in improving the contrast invariance of orientation selectivity

coarse-grain reduct and analysi of a network model of cortic respons : i. drift grate stimuli
 we present a reduct of a large-scal network model of visual cortex develop by mclaughlin , shapley , shelley , and wielaard . the reduct is from mani integrate-and-fir neuron to a spatial coarse-grain system for fire rate of neuron subpopul . it account explicitli for spatial vari architectur , order cortic map ( such as orient prefer ) that vari regularli across the cortic layer , and disord cortic map ( such as spatial phase prefer or stochast input conduct ) that may vari wide from cortic neuron to cortic neuron . the result of the reduct is a set of nonlinear spatiotempor integr equat for " phase-averag " fire rate of neuron subpopul across the model cortex , deriv asymptot from the full model without the addit of ani extra phenomolog constant . thi reduc system is use to studi the respons of the model to drift grate stimuli - where it is shown to be use for numer investig that reproduc , at far less comput cost , the salient featur of the point-neuron network and for analyt investig that unveil cortic mechan behind the respons observ in the simul of the large-scal comput model . for exampl , the reduc equat clearli show ( 1 ) phase averag as the sourc of the time-invari of cortico-cort conduct , ( 2 ) the mechan in the model for higher fire rate and better orient select of simpl cell which are near pinwheel center , ( 3 ) the effect of the length-scal of cortico-cort coupl , and ( 4 ) the role of nois in improv the contrast invari of orient select


New age computing [autonomic computing]

Abstract: Autonomic computing (AC), sometimes called self-managed computing, is the name chosen by IBM to describe the company's new initiative aimed at making computing more reliable and problem-free. It is a response to a growing realization that the problem today with computers is not that they need more speed or have too little memory, but that they crash all too often. This article reviews current initiatives being carried out in the AC field by the IT industry, followed by key challenges which require to be addressed in its development and implementation

new age comput [ autonom comput ]
 autonom comput ( ac ) , sometim call self-manag comput , is the name chosen by ibm to describ the compani 's new initi aim at make comput more reliabl and problem-fre . it is a respons to a grow realiz that the problem today with comput is not that they need more speed or have too littl memori , but that they crash all too often . thi articl review current initi be carri out in the ac field by the it industri , follow by key challeng which requir to be address in it develop and implement

new age computing
autonomic computing
AC
self-managed computing
IBM initiative
computing reliability
problem-free computing
computer speed
computer memory
computer crash
IT industry initiatives
AC requirements
AC development
AC implementation
open standards
self-healing computing
adaptive algorithms


Mammogram synthesis using a 3D simulation. I. Breast tissue model and image acquisition simulation

Abstract: A method is proposed for generating synthetic mammograms based upon simulations of breast tissue and the mammographic imaging process. A computer breast model has been designed with a realistic distribution of large and medium scale tissue structures. Parameters controlling the size and placement of simulated structures (adipose compartments and ducts) provide a method for consistently modeling images of the same simulated breast with modified position or acquisition parameters. The mammographic imaging process is simulated using a compression model and a model of the X-ray image acquisition process. The compression model estimates breast deformation using tissue elasticity parameters found in the literature and clinical force values. The synthetic mammograms were generated by a mammogram acquisition model using a monoenergetic parallel beam approximation applied to the synthetically compressed breast phantom

mammogram synthesi use a 3d simul . i. breast tissu model and imag acquisit simul
 a method is propos for gener synthet mammogram base upon simul of breast tissu and the mammograph imag process . a comput breast model ha been design with a realist distribut of larg and medium scale tissu structur . paramet control the size and placement of simul structur ( adipos compart and duct ) provid a method for consist model imag of the same simul breast with modifi posit or acquisit paramet . the mammograph imag process is simul use a compress model and a model of the x-ray imag acquisit process . the compress model estim breast deform use tissu elast paramet found in the literatur and clinic forc valu . the synthet mammogram were gener by a mammogram acquisit model use a monoenerget parallel beam approxim appli to the synthet compress breast phantom


Image reconstruction from fan-beam projections on less than a short scan

Abstract: This work is concerned with 2D image reconstruction from fan-beam projections. It is shown that exact and stable reconstruction of a given region-of-interest in the object does not require all lines passing through the object to be measured. Complete (non-truncated) fan-beam projections provide sufficient information for reconstruction when 'every line passing through the region-of-interest intersects the vertex path in a non-tangential way'. The practical implications of this condition are discussed and a new filtered-backprojection algorithm is derived for reconstruction. Experiments with computer-simulated data are performed to support the mathematical results

imag reconstruct from fan-beam project on less than a short scan
 thi work is concern with 2d imag reconstruct from fan-beam project . it is shown that exact and stabl reconstruct of a given region-of-interest in the object doe not requir all line pass through the object to be measur . complet ( non-trunc ) fan-beam project provid suffici inform for reconstruct when ' everi line pass through the region-of-interest intersect the vertex path in a non-tangenti way ' . the practic implic of thi condit are discuss and a new filtered-backproject algorithm is deriv for reconstruct . experi with computer-simul data are perform to support the mathemat result

fan-beam projections
2D image reconstruction
region-of-interest
vertex path
filtered-backprojection algorithm
exact stable reconstruction
X-ray computed tomography
short-scan condition
Hilbert transform
Radon transform
rebinning formula
convolution
linear interpolation
3D head phantom


Analysis and operation of hybrid active filter for harmonic elimination

Abstract: This paper presents a hybrid active filter topology and its control to suppress the harmonic currents from entering the power source. The adopted hybrid active filter consists of one active filter and one passive filter connected in series. By controlling the equivalent output voltage of active filter, the harmonic currents generated by the nonlinear load are blocked and flowed into the passive filter. The power rating of the converter is reduced compared with the pure active filters to filter the harmonic currents. The harmonic current detecting approach and DC-link voltage regulation are proposed to obtain equivalent voltage of active filter. The effectiveness of the adopted topology and control scheme has been verified by the computer simulation and experimental results in a scaled-down laboratory prototype

analysi and oper of hybrid activ filter for harmon elimin
 thi paper present a hybrid activ filter topolog and it control to suppress the harmon current from enter the power sourc . the adopt hybrid activ filter consist of one activ filter and one passiv filter connect in seri . by control the equival output voltag of activ filter , the harmon current gener by the nonlinear load are block and flow into the passiv filter . the power rate of the convert is reduc compar with the pure activ filter to filter the harmon current . the harmon current detect approach and dc-link voltag regul are propos to obtain equival voltag of activ filter . the effect of the adopt topolog and control scheme ha been verifi by the comput simul and experiment result in a scaled-down laboratori prototyp

hybrid active filter
active filter
harmonic elimination
harmonic currents
passive filter
equivalent output voltage
nonlinear load
DC-link voltage regulation
computer simulation
scaled-down laboratory prototype
harmonic currents suppression
converter power rating reduction
active filter equivalent voltage
voltage source inverter


The web services agenda

Abstract: Even the most battle-scarred of CIOs have become excited at the prospect of what web services can do for their businesses. But there are still some shortcomings to be addressed

the web servic agenda
 even the most battle-scar of cio have becom excit at the prospect of what web servic can do for their busi . but there are still some shortcom to be address

web services
transaction support
security


More than the money [software project]

Abstract: Experiences creating budgets for large software projects have taught manufacturers that it is not about the money - it is about what one really needs. Before a company can begin to build a budget for a software. project, it has to have a good understanding of what business issues need to be addressed and what the business objectives are. This step is critical because it defines the business goals, outlines the metrics for success, sets the scope for the project, and defines the criteria for selecting the right software

more than the money [ softwar project ]
 experi creat budget for larg softwar project have taught manufactur that it is not about the money - it is about what one realli need . befor a compani can begin to build a budget for a softwar . project , it ha to have a good understand of what busi issu need to be address and what the busi object are . thi step is critic becaus it defin the busi goal , outlin the metric for success , set the scope for the project , and defin the criteria for select the right softwar

software projects
budgeting
manufacturing industry
management
software requirements


The changing landscape for multi access portals

Abstract: Discusses the factors that have made life difficult for consumer portal operators in recent years causing them, like others in the telecommunications, media and technology sector, to take a close look at their business models following the dot.com crash and the consequent reassessment of Internet-related project financing by the venture capital community. While the pressure is on to generate income from existing customers and users, portal operators must reach new markets and find realistic revenue streams. This search for real revenues has led to a move towards charging for content, a strategy being pursued by a large number of horizontal portal players, including MSN and Terra Lycos. This trend is particularly noticeable in China, where Chinadotcom operates a mainland portal and plans a range of fee-based services, including electronic mail. The nature of advertising itself is changing, with portals seeking blue-chip sponsorship and marketing deals that span a number of years. Players are struggling to redefine and reinvent themselves as a result of the changing environment and even the term "portal" is believed to be obsolete, partly due to its dot.com crash associations. Multi-access portals are expected to dominate the consumer sector, becoming bigger and better overall than their predecessors and playing a more powerful role in the consumer environment

the chang landscap for multi access portal
 discuss the factor that have made life difficult for consum portal oper in recent year caus them , like other in the telecommun , media and technolog sector , to take a close look at their busi model follow the dot.com crash and the consequ reassess of internet-rel project financ by the ventur capit commun . while the pressur is on to gener incom from exist custom and user , portal oper must reach new market and find realist revenu stream . thi search for real revenu ha led to a move toward charg for content , a strategi be pursu by a larg number of horizont portal player , includ msn and terra lyco . thi trend is particularli notic in china , where chinadotcom oper a mainland portal and plan a rang of fee-bas servic , includ electron mail . the natur of advertis itself is chang , with portal seek blue-chip sponsorship and market deal that span a number of year . player are struggl to redefin and reinvent themselv as a result of the chang environ and even the term " portal " is believ to be obsolet , partli due to it dot.com crash associ . multi-access portal are expect to domin the consum sector , becom bigger and better overal than their predecessor and play a more power role in the consum environ

consumer portal operators
revenue streams
fee-based services
advertising
blue-chip sponsorship
multi-access portals


The Internet, knowledge and the academy

Abstract: As knowledge is released from the bounds of libraries, as research becomes no longer confined to the academy, and education/certification is available, any time/any place, the university and the faculty must redefine themselves. Liberal studies, once the core, and currently eschewed in favor of science and technology, will be reborn in those institutions that can rise above the mundane and embrace an emerging "third culture"

the internet , knowledg and the academi
 as knowledg is releas from the bound of librari , as research becom no longer confin to the academi , and educ / certif is avail , ani time / ani place , the univers and the faculti must redefin themselv . liber studi , onc the core , and current eschew in favor of scienc and technolog , will be reborn in those institut that can rise abov the mundan and embrac an emerg " third cultur "

Internet
knowledge
academy
education
certification
university
faculty
liberal studies


The decision procedure for profitability of investment projects using the internal rate of return of single-period projects

Abstract: The internal rate of return (IRR) criterion is often used to evaluate profitability of investment projects. In this paper, we focus on a single-period project which consists of two types of cash flows; an investment at one period and a return at a succeeding period, and a financing at one period and a repayment at a succeeding period. We decompose the given investment project into a series of the single-period projects. From the viewpoint of the single-period project, we point out the applicability issue of the IRR criterion, namely the IRR criterion cannot be applied in which a project is composed of both investment type and financing type. Investigating the properties of a series of the single-period projects, we resolve the applicability issue of the IRR criterion and propose the decision procedure for profitability judgment toward any type of investment project based on the comparison between the IRR and the capital cost. We develop a new algorithm to obtain the value of the project investment rate (PIR) for the given project, which is a function of the capital cost, only using the standard IRR computing routine. This outcome is a theoretical breakthrough to widen the utilization of IRR in practical applications

the decis procedur for profit of invest project use the intern rate of return of single-period project
 the intern rate of return ( irr ) criterion is often use to evalu profit of invest project . in thi paper , we focu on a single-period project which consist of two type of cash flow ; an invest at one period and a return at a succeed period , and a financ at one period and a repay at a succeed period . we decompos the given invest project into a seri of the single-period project . from the viewpoint of the single-period project , we point out the applic issu of the irr criterion , name the irr criterion can not be appli in which a project is compos of both invest type and financ type . investig the properti of a seri of the single-period project , we resolv the applic issu of the irr criterion and propos the decis procedur for profit judgment toward ani type of invest project base on the comparison between the irr and the capit cost . we develop a new algorithm to obtain the valu of the project invest rate ( pir ) for the given project , which is a function of the capit cost , onli use the standard irr comput routin . thi outcom is a theoret breakthrough to widen the util of irr in practic applic

decision procedure
profitability
internal rate of return
single-period projects
cash flows
IRR criterion
project investment rate
PIR
investment project profitability
investment project decomposition


To classify or not to classify, that is the question?

Abstract: In addressing classification issues, the librarian needs to decide what best suits the purpose and requirements of the user group and the organisation they work in. The author has used the well-established Moys Classification Scheme. This gives the level of detail required for current stock and allows for the incorporation of new material as the firm's specialisations develop. The scheme is widely used in other firms as well as in the local law society library, so it will be familiar to many users

to classifi or not to classifi , that is the question ?
 in address classif issu , the librarian need to decid what best suit the purpos and requir of the user group and the organis they work in . the author ha use the well-establish moy classif scheme . thi give the level of detail requir for current stock and allow for the incorpor of new materi as the firm 's specialis develop . the scheme is wide use in other firm as well as in the local law societi librari , so it will be familiar to mani user

Moys Classification Scheme
law society library


Application of artificial intelligence to search ground-state geometry of clusters

Abstract: We introduce a global optimization procedure, the neural-assisted genetic algorithm (NAGA). It combines the power of an artificial neural network (ANN) with the versatility of the genetic algorithm. This method is suitable to solve optimization problems that depend on some kind of heuristics to limit the search space. If a reasonable amount of data is available, the ANN can "understand" the problem and provide the genetic algorithm with a selected population of elements that will speed up the search for the optimum solution. We tested the method in a search for the ground-state geometry of silicon clusters. We trained the ANN with information about the geometry and energetics of small silicon clusters. Next, the ANN learned how to restrict the configurational space for larger silicon clusters. For Si/sub 10/ and Si/sub 20/, we noticed that the NAGA is at least three times faster than the "pure" genetic algorithm. As the size of the cluster increases, it is expected that the gain in terms of time will increase as well

applic of artifici intellig to search ground-stat geometri of cluster
 we introduc a global optim procedur , the neural-assist genet algorithm ( naga ) . it combin the power of an artifici neural network ( ann ) with the versatil of the genet algorithm . thi method is suitabl to solv optim problem that depend on some kind of heurist to limit the search space . if a reason amount of data is avail , the ann can " understand " the problem and provid the genet algorithm with a select popul of element that will speed up the search for the optimum solut . we test the method in a search for the ground-stat geometri of silicon cluster . we train the ann with inform about the geometri and energet of small silicon cluster . next , the ann learn how to restrict the configur space for larger silicon cluster . for si / sub 10/ and si / sub 20/ , we notic that the naga is at least three time faster than the " pure " genet algorithm . as the size of the cluster increas , it is expect that the gain in term of time will increas as well

artificial intelligence
ground-state geometry
global optimization procedure
neural-assisted genetic algorithm
artificial neural network
population
optimum solution
silicon clusters
Si/sub 10/
Si/sub 20/
atomic clusters
cluster size


Simple nonlinear dual-window operator for edge detection

Abstract: We propose a nonlinear edge detection technique based on a two-concentric-circular-window operator. We perform a preliminary selection of edge candidates using a standard gradient and use the dual-window operator to reveal edges as zero-crossing points of a simple difference function depending only on the minimum and maximum values in the two windows. Comparisons with other well-established techniques are reported in terms of visual appearance and computational efficiency. They show that detected edges are surely comparable with Canny's and Laplacian of Gaussian algorithms, with a noteworthy reduction in terms of computational load

simpl nonlinear dual-window oper for edg detect
 we propos a nonlinear edg detect techniqu base on a two-concentric-circular-window oper . we perform a preliminari select of edg candid use a standard gradient and use the dual-window oper to reveal edg as zero-cross point of a simpl differ function depend onli on the minimum and maximum valu in the two window . comparison with other well-establish techniqu are report in term of visual appear and comput effici . they show that detect edg are sure compar with canni 's and laplacian of gaussian algorithm , with a noteworthi reduct in term of comput load

nonlinear dual-window operator
edge detection
nonlinear edge detection technique
two-concentric-circular-window operator
standard gradient
zero-crossing points
difference function
maximum values
computational efficiency
detected edges
Gaussian algorithms
computational load
dual window operator
minimum values
Laplacian algorithms
Canny's algorithms
nonlinear processing


Local search with constraint propagation and conflict-based heuristics

Abstract: Search algorithms for solving CSP (Constraint Satisfaction Problems) usually fall into one of two main families: local search algorithms and systematic algorithms. Both families have their advantages. Designing hybrid approaches seems promising since those advantages may be combined into a single approach. In this paper, we present a new hybrid technique. It performs a local search over partial assignments instead of complete assignments, and uses filtering techniques and conflict-based techniques to efficiently guide the search. This new technique benefits from both classical approaches: a priori pruning of the search space from filtering-based search and possible repair of early mistakes from local search. We focus on a specific version of this technique: tabu decision-repair. Experiments done on open-shop scheduling problems show that our approach competes well with the best highly specialized algorithms

local search with constraint propag and conflict-bas heurist
 search algorithm for solv csp ( constraint satisfact problem ) usual fall into one of two main famili : local search algorithm and systemat algorithm . both famili have their advantag . design hybrid approach seem promis sinc those advantag may be combin into a singl approach . in thi paper , we present a new hybrid techniqu . it perform a local search over partial assign instead of complet assign , and use filter techniqu and conflict-bas techniqu to effici guid the search . thi new techniqu benefit from both classic approach : a priori prune of the search space from filtering-bas search and possibl repair of earli mistak from local search . we focu on a specif version of thi techniqu : tabu decision-repair . experi done on open-shop schedul problem show that our approach compet well with the best highli special algorithm

search algorithms
CSP
Constraint Satisfaction Problems
local search algorithms
systematic algorithms
partial assignments
filtering techniques
tabu decision-repair


The set of just-in-time management strategies: an assessment of their impact on plant-level productivity and input-factor substitutability using variable cost function estimates

Abstract: Many manufacturers in the automobile industry around the world have adopted the just-in-time (JIT) set of management strategies in an effort to improve productivity, efficiency and product quality. The paper provides empirical evidence that supports the idea that JIT manufacturing environments are, in fact, more productive than their non-JIT counterparts. Plant-level cross-sectional data from auto-parts manufacturing firms are used to estimate variable cost functions for a JIT group as well as for a non-JIT group of plants. Differences in cost function characteristics between the two groups are examined and discussed

the set of just-in-tim manag strategi : an assess of their impact on plant-level product and input-factor substitut use variabl cost function estim
 mani manufactur in the automobil industri around the world have adopt the just-in-tim ( jit ) set of manag strategi in an effort to improv product , effici and product qualiti . the paper provid empir evid that support the idea that jit manufactur environ are , in fact , more product than their non-jit counterpart . plant-level cross-sect data from auto-part manufactur firm are use to estim variabl cost function for a jit group as well as for a non-jit group of plant . differ in cost function characterist between the two group are examin and discuss

just-in-time management strategies
plant-level productivity
input-factor substitutability
variable cost function estimates
automobile industry
JIT
efficiency
product quality
auto-parts manufacturing firms


Access to information for blind and visually impaired clients

Abstract: This article guides I&R providers in establishing effective communication techniques for working with visually impaired consumers. The authors discuss common causes of vision impairment and the functional implications of each and offer information on disability etiquette and effective voice, accessible media and in-person communication. There is an overview of assistive technologies used by people who are visually impaired-to facilitate written and electronic communications as well as low-tech solutions for producing large-print and Braille materials in-house. Providers who implement these communication techniques will be well equipped to serve visually-impaired consumers, and consumers will be more likely to avail themselves of these services when providers make them easily accessible

access to inform for blind and visual impair client
 thi articl guid i&r provid in establish effect commun techniqu for work with visual impair consum . the author discuss common caus of vision impair and the function implic of each and offer inform on disabl etiquett and effect voic , access media and in-person commun . there is an overview of assist technolog use by peopl who are visual impaired-to facilit written and electron commun as well as low-tech solut for produc large-print and braill materi in-hous . provid who implement these commun techniqu will be well equip to serv visually-impair consum , and consum will be more like to avail themselv of these servic when provid make them easili access

visually impaired clients
communication techniques
disability etiquette
effective voice
accessible media
in-person communication
assistive technologies
electronic communications
Braille materials
information access
blind clients
information and referral systems
written communications
large-print materials


A unifying co-operative Web caching architecture

Abstract: Network caching of objects has become a standard way of reducing network traffic and latency in the Web. However, Web caches exhibit poor performance with a hit rate of about 30%. A solution to improve this hit rate is to have a group of proxies form co-operation where objects can be cached for later retrieval. A cooperative cache system includes protocols for hierarchical and transversal caching. The drawback of such a system lies in the resulting network load due to the number of messages that need to be exchanged to locate an object. This paper proposes a new co-operative Web caching architecture, which unifies previous methods of Web caching. Performance results shows that the architecture achieve up to 70% co-operative hit rate and accesses the cached object in at most two hops. Moreover, the architecture is scalable with low traffic and database overhead

a unifi co-op web cach architectur
 network cach of object ha becom a standard way of reduc network traffic and latenc in the web . howev , web cach exhibit poor perform with a hit rate of about 30 % . a solut to improv thi hit rate is to have a group of proxi form co-oper where object can be cach for later retriev . a cooper cach system includ protocol for hierarch and transvers cach . the drawback of such a system lie in the result network load due to the number of messag that need to be exchang to locat an object . thi paper propos a new co-op web cach architectur , which unifi previou method of web cach . perform result show that the architectur achiev up to 70 % co-op hit rate and access the cach object in at most two hop . moreov , the architectur is scalabl with low traffic and databas overhead

co-operative Web caching architecture
network caching
cooperative cache system
protocols
transversal caching
network load
co-operative hit rate
network traffic reduction
network latency reduction
hierarchical caching
scalable architecture
low traffic overhead
low database overhead
Web browser
World Wide Web


Implementing: it's all about processes

Abstract: Looks at how the key to successful technology deployment can be found in a set of four basic disciplines

implement : it 's all about process
 look at how the key to success technolog deploy can be found in a set of four basic disciplin

vendor-supplied hardware integration services

vendor-supplied software integration services


Harmless delays in Cohen-Grossberg neural networks

Abstract: Without assuming monotonicity and differentiability of the activation functions and any symmetry of interconnections, we establish some sufficient conditions for the globally asymptotic stability of a unique equilibrium for the Cohen-Grossberg (1983) neural network with multiple delays. Lyapunov functionals and functions combined with the Razumikhin technique are employed. The criteria are all independent of the magnitudes of the delays, and thus the delays under these conditions are harmless

harmless delay in cohen-grossberg neural network
 without assum monoton and differenti of the activ function and ani symmetri of interconnect , we establish some suffici condit for the global asymptot stabil of a uniqu equilibrium for the cohen-grossberg ( 1983 ) neural network with multipl delay . lyapunov function and function combin with the razumikhin techniqu are employ . the criteria are all independ of the magnitud of the delay , and thu the delay under these condit are harmless

harmless delays
Cohen-Grossberg neural networks
monotonicity
differentiability
activation functions
interconnections
globally asymptotic stability
multiple delays
Lyapunov functionals
Razumikhin technique


Option pricing formulas based on a non-Gaussian stock price model

Abstract: Options are financial instruments that depend on the underlying stock. We explain their non-Gaussian fluctuations using the nonextensive thermodynamics parameter q. A generalized form of the Black-Scholes (BS) partial differential equation (1973) and some closed-form solutions are obtained. The standard BS equation (q = 1) which is used by economists to calculate option prices requires multiple values of the stock volatility (known as the volatility smile). Using q = 1.5 which well models the empirical distribution of returns, we get a good description of option prices using a single volatility

option price formula base on a non-gaussian stock price model
 option are financi instrument that depend on the underli stock . we explain their non-gaussian fluctuat use the nonextens thermodynam paramet q. a gener form of the black-schol ( bs ) partial differenti equat ( 1973 ) and some closed-form solut are obtain . the standard bs equat ( q = 1 ) which is use by economist to calcul option price requir multipl valu of the stock volatil ( known as the volatil smile ) . use q = 1.5 which well model the empir distribut of return , we get a good descript of option price use a singl volatil

Black-Scholes partial differential equation


Modeling and simulation of adaptive available bit rate voice over asynchronous transfer mode networks

Abstract: This article presents a modeling and simulation methodology to analyze the performance of voice quality when sent over the available bit rate service in asynchronous transfer mode networks. Sources can modify the rate at which they send traffic to the network based on the feedback carried in the resource management cells. This is achieved by changing the encoding level. As the contention increases to network resources-bandwidth in this case-sources start reducing the rate at which they generate and send traffic. The efficiency of the scheme under different scheduling/drop policies and other operating conditions and environments is evaluated using simulation modeling. Furthermore, sensitivity analysis is applied to different parameters, such as queue size and averaging interval length, to investigate their impact on the performance metrics. Results show that limiting the load to 41% of the link capacity results in an acceptable quality

model and simul of adapt avail bit rate voic over asynchron transfer mode network
 thi articl present a model and simul methodolog to analyz the perform of voic qualiti when sent over the avail bit rate servic in asynchron transfer mode network . sourc can modifi the rate at which they send traffic to the network base on the feedback carri in the resourc manag cell . thi is achiev by chang the encod level . as the content increas to network resources-bandwidth in thi case-sourc start reduc the rate at which they gener and send traffic . the effici of the scheme under differ schedul / drop polici and other oper condit and environ is evalu use simul model . furthermor , sensit analysi is appli to differ paramet , such as queue size and averag interv length , to investig their impact on the perform metric . result show that limit the load to 41 % of the link capac result in an accept qualiti

modeling
simulation
adaptive available bit rate voice
voice quality
traffic
feedback
resource management cells
encoding level
scheduling/drop policies
queue size
averaging interval length
performance metrics
link capacity
performance analysis
bandwidth contention
ATM networks


Copyright management in the digital age

Abstract: Listening to and buying music online is becoming increasingly popular with consumers. So much so that Merrill Lynch forecasts the value of the online music market will explode from $8 million in 2001 to $1,409 million in 2005. But online delivery is not without problems; the issue of copyright management in particular has become a serious thorn in the side for digital content creators. Martin Brass, ex- music producer and senior industry consultant at Syntegra, explains

copyright manag in the digit age
 listen to and buy music onlin is becom increasingli popular with consum . so much so that merril lynch forecast the valu of the onlin music market will explod from $ 8 million in 2001 to $ 1,409 million in 2005 . but onlin deliveri is not without problem ; the issu of copyright manag in particular ha becom a seriou thorn in the side for digit content creator . martin brass , ex- music produc and senior industri consult at syntegra , explain

digital age
digital content creators
online music delivery
music industry
Internet
Napster


On average depth of decision trees implementing Boolean functions

Abstract: The article considers the representation of Boolean functions in the form of decision trees. It presents the bounds on average time complexity of decision trees for all classes of Boolean functions that are closed over substitution, and the insertion and deletion of unessential variables. The obtained results are compared with the results developed by M.Ju. Moshkov (1995) that describe the worst case time complexity of decision trees

on averag depth of decis tree implement boolean function
 the articl consid the represent of boolean function in the form of decis tree . it present the bound on averag time complex of decis tree for all class of boolean function that are close over substitut , and the insert and delet of unessenti variabl . the obtain result are compar with the result develop by m.ju . moshkov ( 1995 ) that describ the worst case time complex of decis tree

average depth
decision trees
Boolean functions
average time complexity
worst case time complexity


Schedulability analysis of real-time traffic in WorldFIP networks: an integrated approach

Abstract: The WorldFIP protocol is one of the profiles that constitute the European fieldbus standard EN-50170. It is particularly well suited to be used in distributed computer-controlled systems where a set of process variables must be shared among network devices. To cope with the real-time requirements of such systems, the protocol provides communication services based on the exchange of periodic and aperiodic identified variables. The periodic exchanges have the highest priority and are executed at run time according to a cyclic schedule. Therefore, the respective schedulability can be determined at pre-run-time when building the schedule table. Concerning the aperiodic exchanges, the situation is different since their priority is lower and they are bandied according to a first-come-first-served policy. In this paper, a response-time-based schedulability analysis for the real-time traffic is presented. Such analysis considers both types of traffic in an integrated way, according to their priorities. Furthermore, a fixed-priorities-based policy is also used to schedule the periodic traffic. The proposed analysis represents an improvement relative to previous work and it can be evaluated online as part of a traffic online admission control. This feature is of particular importance when a planning scheduler is used, instead of the typical offline static scheduler, to allow online changes to the set of periodic process variables

schedul analysi of real-tim traffic in worldfip network : an integr approach
 the worldfip protocol is one of the profil that constitut the european fieldbu standard en-50170 . it is particularli well suit to be use in distribut computer-control system where a set of process variabl must be share among network devic . to cope with the real-tim requir of such system , the protocol provid commun servic base on the exchang of period and aperiod identifi variabl . the period exchang have the highest prioriti and are execut at run time accord to a cyclic schedul . therefor , the respect schedul can be determin at pre-run-tim when build the schedul tabl . concern the aperiod exchang , the situat is differ sinc their prioriti is lower and they are bandi accord to a first-come-first-serv polici . in thi paper , a response-time-bas schedul analysi for the real-tim traffic is present . such analysi consid both type of traffic in an integr way , accord to their prioriti . furthermor , a fixed-priorities-bas polici is also use to schedul the period traffic . the propos analysi repres an improv rel to previou work and it can be evalu onlin as part of a traffic onlin admiss control . thi featur is of particular import when a plan schedul is use , instead of the typic offlin static schedul , to allow onlin chang to the set of period process variabl

real-time traffic schedulability analysis


Integrate-and-fire neurons driven by correlated stochastic input

Abstract: Neurons are sensitive to correlations among synaptic inputs. However, analytical models that explicitly include correlations are hard to solve analytically, so their influence on a neuron's response has been difficult to ascertain. To gain some intuition on this problem, we studied the firing times of two simple integrate-and-fire model neurons driven by a correlated binary variable that represents the total input current. Analytic expressions were obtained for the average firing rate and coefficient of variation (a measure of spike-train variability) as functions of the mean, variance, and correlation time of the stochastic input. The results of computer simulations were in excellent agreement with these expressions. In these models, an increase in correlation time in general produces an increase in both the average firing rate and the variability of the output spike trains. However, the magnitude of the changes depends differentially on the relative values of the input mean and variance: the increase in firing rate is higher when the variance is large relative to the mean, whereas the increase in variability is higher when the variance is relatively small. In addition, the firing rate always tends to a finite limit value as the correlation time increases toward infinity, whereas the coefficient of variation typically diverges. These results suggest that temporal correlations may play a major role in determining the variability as well as the intensity of neuronal spike trains

integrate-and-fir neuron driven by correl stochast input
 neuron are sensit to correl among synapt input . howev , analyt model that explicitli includ correl are hard to solv analyt , so their influenc on a neuron 's respons ha been difficult to ascertain . to gain some intuit on thi problem , we studi the fire time of two simpl integrate-and-fir model neuron driven by a correl binari variabl that repres the total input current . analyt express were obtain for the averag fire rate and coeffici of variat ( a measur of spike-train variabl ) as function of the mean , varianc , and correl time of the stochast input . the result of comput simul were in excel agreement with these express . in these model , an increas in correl time in gener produc an increas in both the averag fire rate and the variabl of the output spike train . howev , the magnitud of the chang depend differenti on the rel valu of the input mean and varianc : the increas in fire rate is higher when the varianc is larg rel to the mean , wherea the increas in variabl is higher when the varianc is rel small . in addit , the fire rate alway tend to a finit limit valu as the correl time increas toward infin , wherea the coeffici of variat typic diverg . these result suggest that tempor correl may play a major role in determin the variabl as well as the intens of neuron spike train

integrate-and-fire neurons
correlated stochastic input
firing times
correlated binary variable
coefficient of variation
spike-train variability
computer simulation
output spike trains
temporal correlations
synaptic input correlations


Restoration of archival documents using a wavelet technique

Abstract: This paper addresses a problem of restoring handwritten archival documents by recovering their contents from the interfering handwriting on the reverse side caused by the seeping of ink. We present a novel method that works by first matching both sides of a document such that the interfering strokes are mapped with the corresponding strokes originating from the reverse side. This facilitates the identification of the foreground and interfering strokes. A wavelet reconstruction process then iteratively enhances the foreground strokes and smears the interfering strokes so as to strengthen the discriminating capability of an improved Canny edge detector against the interfering strokes. The method has been shown to restore the documents effectively with average precision and recall rates for foreground text extraction at 84 percent and 96 percent, respectively

restor of archiv document use a wavelet techniqu
 thi paper address a problem of restor handwritten archiv document by recov their content from the interf handwrit on the revers side caus by the seep of ink . we present a novel method that work by first match both side of a document such that the interf stroke are map with the correspond stroke origin from the revers side . thi facilit the identif of the foreground and interf stroke . a wavelet reconstruct process then iter enhanc the foreground stroke and smear the interf stroke so as to strengthen the discrimin capabl of an improv canni edg detector against the interf stroke . the method ha been shown to restor the document effect with averag precis and recal rate for foreground text extract at 84 percent and 96 percent , respect

wavelet technique
handwritten archival documents
wavelet reconstruction process
Canny edge detector
archival documents restoration
ink seepage
iterative stroke enhancement


On bivariate dependence and the convex order

Abstract: We investigate the interplay between variability (in the sense of the convex order) and dependence in a bivariate framework, extending some previous results in this area. We exploit the fact that discrete uniform distributions are dense in the space of probability measures in the topology of weak convergence to prove our central result. We also obtain a partial result in the general multivariate case. Our findings can be interpreted in terms of the impact of component variability on the mean life of correlated serial and parallel systems

on bivari depend and the convex order
 we investig the interplay between variabl ( in the sens of the convex order ) and depend in a bivari framework , extend some previou result in thi area . we exploit the fact that discret uniform distribut are dens in the space of probabl measur in the topolog of weak converg to prove our central result . we also obtain a partial result in the gener multivari case . our find can be interpret in term of the impact of compon variabl on the mean life of correl serial and parallel system

bivariate dependence
convex order
discrete uniform distributions
probability measures
topology
weak convergence
component variability
mean life
parallel systems
serial systems
bivariate probability distributions


Record makers [UK health records]

Abstract: Plans for a massive cradle-to-grave electronic records project have been revealed by the government. Is the scheme really viable?

record maker [ uk health record ]
 plan for a massiv cradle-to-grav electron record project have been reveal by the govern . is the scheme realli viabl ?

UK health records
electronic records project
integrated care records services
health care
social care


Does classicism explain universality? Arguments against a pure classical component of mind

Abstract: One of the hallmarks of human cognition is the capacity to generalize over arbitrary constituents. Marcus (Cognition 66, p.153; Cognitive Psychology 37, p. 243, 1998) argued that this capacity, called "universal generalization" (universality), is not supported by connectionist models. Instead, universality is best explained by classical symbol systems, with connectionism as its implementation. Here it is argued that universality is also a problem for classicism in that the syntax-sensitive rules that are supposed to provide causal explanations of mental processes are either too strict, precluding possible generalizations; or too lax, providing no information as to the appropriate alternative. Consequently, universality is not explained by a classical theory

doe classic explain univers ? argument against a pure classic compon of mind
 one of the hallmark of human cognit is the capac to gener over arbitrari constitu . marcu ( cognit 66 , p.153 ; cognit psycholog 37 , p. 243 , 1998 ) argu that thi capac , call " univers gener " ( univers ) , is not support by connectionist model . instead , univers is best explain by classic symbol system , with connection as it implement . here it is argu that univers is also a problem for classic in that the syntax-sensit rule that are suppos to provid causal explan of mental process are either too strict , preclud possibl gener ; or too lax , provid no inform as to the appropri altern . consequ , univers is not explain by a classic theori

classicism
universality
classical component of mind
human cognition
universal generalization
connectionist models
classical symbol systems
syntax-sensitive rules
causal explanations
mental processes


Using fractional order adjustment rules and fractional order reference models in model-reference adaptive control

Abstract: This paper investigates the use of Fractional Order Calculus (FOC) in conventional Model Reference Adaptive Control (MRAC) systems. Two modifications to the conventional MRAC are presented, i.e., the use of fractional order parameter adjustment rule and the employment of fractional order reference model. Through examples, benefits from the use of FOC are illustrated together with some remarks for further research

use fraction order adjust rule and fraction order refer model in model-refer adapt control
 thi paper investig the use of fraction order calculu ( foc ) in convent model refer adapt control ( mrac ) system . two modif to the convent mrac are present , i.e. , the use of fraction order paramet adjust rule and the employ of fraction order refer model . through exampl , benefit from the use of foc are illustr togeth with some remark for further research

fractional order adjustment rules
fractional order reference models
model-reference adaptive control
FOC
MRAC
fractional calculus


On M/D/1 queue with deterministic server vacations

Abstract: We study a single server vacation queue with Poisson arrivals, deterministic service of constant duration b (> 0) and deterministic vacations of constant duration d (> 0) and designate this model as M/D/D/1. After completion of each service, the server may take a vacation with probability p or may continue working in the system with probability 1 - p. We obtain time-dependent as well as steady state probability generation functions for the number in the system. For the steady state we obtain explicitly the mean number and the mean waiting time for the system and for the queue. All known results of the M/D/1 queue are derived as a special case. Finally, a numerical illustration is discussed

on m / d/1 queue with determinist server vacat
 we studi a singl server vacat queue with poisson arriv , determinist servic of constant durat b ( > 0 ) and determinist vacat of constant durat d ( > 0 ) and design thi model as m / d / d/1 . after complet of each servic , the server may take a vacat with probabl p or may continu work in the system with probabl 1 - p. we obtain time-depend as well as steadi state probabl gener function for the number in the system . for the steadi state we obtain explicitli the mean number and the mean wait time for the system and for the queue . all known result of the m / d/1 queue are deriv as a special case . final , a numer illustr is discuss

time-dependent probability generation functions


Cool and green [air conditioning]

Abstract: In these days of global warming, air conditioning engineers need to specify not just for the needs of the occupants, but also to maximise energy efficiency. Julian Brunnock outlines the key areas to consider for energy efficient air conditioning systems

cool and green [ air condit ]
 in these day of global warm , air condit engin need to specifi not just for the need of the occup , but also to maximis energi effici . julian brunnock outlin the key area to consid for energi effici air condit system


From powder to perfect parts

Abstract: GKN Sinter Metals has increased productivity and quality by automating the powder metal lines that produce its transmission parts

from powder to perfect part
 gkn sinter metal ha increas product and qualiti by autom the powder metal line that produc it transmiss part

GKN Sinter Metals
automating
powder metal lines
conveyors
gentle transfer units
robotic systems


Autonomous detection of crack initiation using surface-mounted piezotransducers

Abstract: In this paper we report on the application of an in situ health monitoring system, comprising an array of piezoceramic wafer elements, to the detection of fatigue degradation in metallic specimens exposed to cyclic loading. Lamb waves, transmitted through a beam test coupon, are sensed using small surface-mounted piezotransducer elements, and the signals are then autonomously analysed for indications relating to the onset of structural degradation. The experimental results confirm the efficacy of the approach and provide a demonstration of good robustness under realistic loading conditions, emphasizing the great potential for developing an automated in situ structural health monitoring system for application to fatigue-prone operational structures, such as aircraft

autonom detect of crack initi use surface-mount piezotransduc
 in thi paper we report on the applic of an in situ health monitor system , compris an array of piezoceram wafer element , to the detect of fatigu degrad in metal specimen expos to cyclic load . lamb wave , transmit through a beam test coupon , are sens use small surface-mount piezotransduc element , and the signal are then autonom analys for indic relat to the onset of structur degrad . the experiment result confirm the efficaci of the approach and provid a demonstr of good robust under realist load condit , emphas the great potenti for develop an autom in situ structur health monitor system for applic to fatigue-pron oper structur , such as aircraft


Optimal control using the transport equation: the Liouville machine

Abstract: Transport theory describes the scattering behavior of physical particles such as photons. Here we show how to connect this theory to optimal control theory and to adaptive behavior of agents embedded in an environment. Environments and tasks are defined by physical boundary conditions. Given some task, we compute a set of probability densities on continuous state and action and time. From these densities we derive an optimal policy such that for all states the most likely action maximizes the probability of reaching a predefined goal state. Liouville's conservation theorem tells us that the conditional density at time t, state s, and action a must equal the density at t + dt, s + ds, a + da. Discretization yields a linear system that can be solved directly and whose solution corresponds to an optimal policy. Discounted reward schemes are incorporated naturally by taking the Laplace transform of the equations. The Liouville machine quickly solves rather complex maze problems

optim control use the transport equat : the liouvil machin
 transport theori describ the scatter behavior of physic particl such as photon . here we show how to connect thi theori to optim control theori and to adapt behavior of agent embed in an environ . environ and task are defin by physic boundari condit . given some task , we comput a set of probabl densiti on continu state and action and time . from these densiti we deriv an optim polici such that for all state the most like action maxim the probabl of reach a predefin goal state . liouvil 's conserv theorem tell us that the condit densiti at time t , state s , and action a must equal the densiti at t + dt , s + ds , a + da . discret yield a linear system that can be solv directli and whose solut correspond to an optim polici . discount reward scheme are incorpor natur by take the laplac transform of the equat . the liouvil machin quickli solv rather complex maze problem

optimal control
transport equation
Liouville machine
scattering behavior
physical particles
adaptive behavior
embedded agents


Formula-dependent equivalence for compositional CTL model checking

Abstract: We present a polytime computable state equivalence that is defined with respect to a given CTL formula. Since it does not attempt to preserve all CTL formulas, like bisimulation does, we can expect to compute coarser equivalences. This equivalence can be used to reduce the complexity of model checking a system of interacting FSM. Additionally, we show that in some cases our techniques can detect if a formula passes or fails, without forming the entire product machine. The method is exact and fully automatic, and handles full CTL

formula-depend equival for composit ctl model check
 we present a polytim comput state equival that is defin with respect to a given ctl formula . sinc it doe not attempt to preserv all ctl formula , like bisimul doe , we can expect to comput coarser equival . thi equival can be use to reduc the complex of model check a system of interact fsm . addit , we show that in some case our techniqu can detect if a formula pass or fail , without form the entir product machin . the method is exact and fulli automat , and handl full ctl

formula-dependent equivalence
CTL model checking
polytime computable state equivalence
CTL formula
interacting FSM
compositional minimization
coarse equivalence
complexity reduction
automatic method
formal design verification
computation tree logic


How does attitude impact IT implementation: a study of small business owners

Abstract: According to previous studies, attitude towards information technology (IT) among small business owners appears to be a key factor in achieving high quality IT implementations. In an effort to extend this stream of research, we conducted case studies with small business owners and learned that high quality IT implementations resulted with owners who had positive or negative attitudes toward IT, but not with owners who had uncertain attitudes. Owners with apolar attitude, either positive or negative, all took action to temper the uncertainty and risk surrounding the use of new IT in their organization. In contrast, owners with uncertain attitudes did not make mitigating attempts to reduce uncertainty and risk. A consistent finding among those with high quality IT implementations was an entrepreneurial, or shared, management style. It is proposed, based on case study data, that small business owners with an uncertain attitude towards IT might experience higher quality IT results in their organizations through practicing a more entrepreneurial, or shared, management style. The study provides insights for both computer specialists and small business owners planning IT implementations

how doe attitud impact it implement : a studi of small busi owner
 accord to previou studi , attitud toward inform technolog ( it ) among small busi owner appear to be a key factor in achiev high qualiti it implement . in an effort to extend thi stream of research , we conduct case studi with small busi owner and learn that high qualiti it implement result with owner who had posit or neg attitud toward it , but not with owner who had uncertain attitud . owner with apolar attitud , either posit or neg , all took action to temper the uncertainti and risk surround the use of new it in their organ . in contrast , owner with uncertain attitud did not make mitig attempt to reduc uncertainti and risk . a consist find among those with high qualiti it implement wa an entrepreneuri , or share , manag style . it is propos , base on case studi data , that small busi owner with an uncertain attitud toward it might experi higher qualiti it result in their organ through practic a more entrepreneuri , or share , manag style . the studi provid insight for both comput specialist and small busi owner plan it implement

small business owners
negative attitudes
uncertain attitude
risk
organization
management style
computer specialists
planning
information technology implementation
positive attitudes


Methods for outlier detection in prediction

Abstract: If a prediction sample is different from the calibration samples, it can be considered as an outlier in prediction. In this work, two techniques, the use of uncertainty estimation and the convex hull method are studied to detect such prediction outliers. Classical techniques (Mahalanobis distance and X-residuals), potential functions and robust techniques are used for comparison. It is concluded that the combination of the convex hull method and uncertainty estimation offers a practical way for detecting outliers in prediction. By adding the potential function method, inliers can also be detected

method for outlier detect in predict
 if a predict sampl is differ from the calibr sampl , it can be consid as an outlier in predict . in thi work , two techniqu , the use of uncertainti estim and the convex hull method are studi to detect such predict outlier . classic techniqu ( mahalanobi distanc and x-residu ) , potenti function and robust techniqu are use for comparison . it is conclud that the combin of the convex hull method and uncertainti estim offer a practic way for detect outlier in predict . by ad the potenti function method , inlier can also be detect

outlier detection
prediction sample
calibration samples
uncertainty estimation
convex hull method
Mahalanobis distance
X-residuals
potential functions
robust techniques
inliers


A mechanism for inferring approximate solutions under incomplete knowledge based on rule similarity

Abstract: This paper proposes an inference method which can obtain an approximate solution even if the knowledge stored in the problem-solving system is incomplete. When a rule needed for solving the problem does not exist, the problem can be solved by using rules similar to the existing rules. In an implementation using the SLD procedure, a resolution is executed between a subgoal and a rule if an atom of the subgoal is similar to the consequence atom of the rule. Similarities between atoms are calculated using a knowledge base of words with account of the reasoning situation, and the reliability of the derived solution is calculated based on these similarities. If many solutions are obtained, they are grouped into classes of similar solutions and a representative solution is then selected for each class. The proposed method was verified experimentally by solving simple problems

a mechan for infer approxim solut under incomplet knowledg base on rule similar
 thi paper propos an infer method which can obtain an approxim solut even if the knowledg store in the problem-solv system is incomplet . when a rule need for solv the problem doe not exist , the problem can be solv by use rule similar to the exist rule . in an implement use the sld procedur , a resolut is execut between a subgoal and a rule if an atom of the subgoal is similar to the consequ atom of the rule . similar between atom are calcul use a knowledg base of word with account of the reason situat , and the reliabl of the deriv solut is calcul base on these similar . if mani solut are obtain , they are group into class of similar solut and a repres solut is then select for each class . the propos method wa verifi experiment by solv simpl problem

approximate solution
incomplete knowledge
rule similarity
inference method
SLD procedure
consequence atom
reasoning
reliability
representative solution
problem solving
subgoal atom
word knowledge base
common sense knowledge


Post-projected Runge-Kutta methods for index-2 differential-algebraic equations

Abstract: A new projection technique for Runge-Kutta methods applied to index-2 differential-algebraic equations is presented in which the numerical approximation is projected only as part of the output process. It is shown that for methods that are strictly stable at infinity, the order of convergence is unaffected compared to standard projected methods. Gauss methods, for which this technique is of special interest when some symmetry is to be preserved, are studied in more detail

post-project runge-kutta method for index-2 differential-algebra equat
 a new project techniqu for runge-kutta method appli to index-2 differential-algebra equat is present in which the numer approxim is project onli as part of the output process . it is shown that for method that are strictli stabl at infin , the order of converg is unaffect compar to standard project method . gauss method , for which thi techniqu is of special interest when some symmetri is to be preserv , are studi in more detail


An accurate COG defuzzifier design using Lamarckian co-adaptation of learning and evolution

Abstract: This paper proposes a design technique of optimal center of gravity (COG) defuzzifier using the Lamarckian co-adaptation of learning and evolution. The proposed COG defuzzifier is specified by various design parameters such as the centers, widths, and modifiers of MFs. The design parameters are adjusted with the Lamarckian co-adaptation of learning and evolution, where the learning performs a local search of design parameters in an individual COG defuzzifier, but the evolution performs a global search of design parameters among a population of various COG defuzzifiers. This co-adaptation scheme allows to evolve much faster than the non-learning case and gives a higher possibility of finding an optimal solution due to its wider searching capability. An application to the truck backer-upper control problem of the proposed co-adaptive design method of COG defuzzifier is presented. The approximation ability and control performance are compared with those of the conventionally simplified COG defuzzifier in terms of the fuzzy logic controller's approximation error and the average tracing distance, respectively

an accur cog defuzzifi design use lamarckian co-adapt of learn and evolut
 thi paper propos a design techniqu of optim center of graviti ( cog ) defuzzifi use the lamarckian co-adapt of learn and evolut . the propos cog defuzzifi is specifi by variou design paramet such as the center , width , and modifi of mf . the design paramet are adjust with the lamarckian co-adapt of learn and evolut , where the learn perform a local search of design paramet in an individu cog defuzzifi , but the evolut perform a global search of design paramet among a popul of variou cog defuzzifi . thi co-adapt scheme allow to evolv much faster than the non-learn case and give a higher possibl of find an optim solut due to it wider search capabl . an applic to the truck backer-upp control problem of the propos co-adapt design method of cog defuzzifi is present . the approxim abil and control perform are compar with those of the convent simplifi cog defuzzifi in term of the fuzzi logic control 's approxim error and the averag trace distanc , respect

learning
evolution
local search
fuzzy logic controller
optimal center of gravity defuzzifier


Portal payback

Abstract: The benefits of deploying a corporate portal are well-documented: access to applications and content is centralised, so users do not spend hours searching for information; the management of disparate applications is also centralised, and by allowing users to access 'self-service' applications in areas such as human resources and procurement, organisations spend less time on manual processing tasks. But how far can prospective customers rely on the ROI figures presented to them by portal technology vendors? In particular, how reliable are the 'ROI calculators' these vendors supply on their web sites?

portal payback
 the benefit of deploy a corpor portal are well-docu : access to applic and content is centralis , so user do not spend hour search for inform ; the manag of dispar applic is also centralis , and by allow user to access ' self-servic ' applic in area such as human resourc and procur , organis spend less time on manual process task . but how far can prospect custom reli on the roi figur present to them by portal technolog vendor ? in particular , how reliabl are the ' roi calcul ' these vendor suppli on their web site ?

corporate portal
ROI calculator
web sites
return on investment
metrics


A modified Fieller interval for the interval estimation of effective doses for a logistic dose-response curve

Abstract: Interval estimation of the gamma % effective dose ( mu /sub gamma / say) is often based on the asymptotic variance of the maximum likelihood estimator (delta interval) or Fieller's theorem (Fieller interval). Sitter and Wu (1993) compared the delta and Fieller intervals for the median effective dose ( mu /sub 50/) assuming a logistic dose-response curve. Their results indicated that although Fieller intervals are generally superior to delta intervals, they appear to be conservative. Here an adjusted form of the Fieller interval for mu /sub gamma / termed an adjusted Fieller (AF) interval is introduced. A comparison of the AF interval with the delta and Fieller intervals is provided and the properties of these three interval estimation methods are investigated

a modifi fieller interv for the interv estim of effect dose for a logist dose-respons curv
 interv estim of the gamma % effect dose ( mu /sub gamma / say ) is often base on the asymptot varianc of the maximum likelihood estim ( delta interv ) or fieller 's theorem ( fieller interv ) . sitter and wu ( 1993 ) compar the delta and fieller interv for the median effect dose ( mu /sub 50/ ) assum a logist dose-respons curv . their result indic that although fieller interv are gener superior to delta interv , they appear to be conserv . here an adjust form of the fieller interv for mu /sub gamma / term an adjust fieller ( af ) interv is introduc . a comparison of the af interv with the delta and fieller interv is provid and the properti of these three interv estim method are investig

modified Fieller interval
interval estimation
effective doses
logistic dose-response curve
asymptotic variance
maximum likelihood estimator
delta interval
Fieller's theorem
median effective dose


Estimation of the vanishing point for automatic driving system using a cross ratio

Abstract: This paper proposes a new method to estimate the vanishing point used as the vehicle heading, which is essential in automatic driving systems. The proposed method uses a cross ratio comprised of a ratio of lengths from four collinear points for extracting the edges that shape the vanishing point. Then, lines that intersect at one point are fitted to the edges in a Hough space. Consequently, the vanishing point is estimated robustly even when the lane markings are occluded by other vehicles. In the presence of lane markings, the road boundaries are also estimated at the same time. Experimental results from images of a real road scene show the effectiveness of the proposed method

estim of the vanish point for automat drive system use a cross ratio
 thi paper propos a new method to estim the vanish point use as the vehicl head , which is essenti in automat drive system . the propos method use a cross ratio compris of a ratio of length from four collinear point for extract the edg that shape the vanish point . then , line that intersect at one point are fit to the edg in a hough space . consequ , the vanish point is estim robustli even when the lane mark are occlud by other vehicl . in the presenc of lane mark , the road boundari are also estim at the same time . experiment result from imag of a real road scene show the effect of the propos method

automatic driving system
automatic driving system
cross ratio
collinear points
Hough space
lane markings
real road scene
vanishing point estimation
automatic driving systems


An approach to developing computational supports for reciprocal tutoring

Abstract: This study presents a novel approach to developing computational supports for reciprocal tutoring. Reciprocal tutoring is a collaborative learning activity, where two participants take turns to play the role of a tutor and a tutee. The computational supports include scaffolding tools for the tutor and a computer-simulated virtual participant. The approach, including system architecture, implementations of scaffolding tools for the tutor and of a virtual participant is presented herein. Furthermore, a system for reciprocal tutoring is implemented as an example of the approach

an approach to develop comput support for reciproc tutor
 thi studi present a novel approach to develop comput support for reciproc tutor . reciproc tutor is a collabor learn activ , where two particip take turn to play the role of a tutor and a tute . the comput support includ scaffold tool for the tutor and a computer-simul virtual particip . the approach , includ system architectur , implement of scaffold tool for the tutor and of a virtual particip is present herein . furthermor , a system for reciproc tutor is implement as an exampl of the approach

reciprocal tutoring computational support


How much should publishers spend on technology?

Abstract: A study confirms that spending on publishing-specific information technology (IT) resources is growing much faster than IT spending for general business activities, at least among leading publishers in the scientific, technical and medical (STM) market. The survey asked about information technology funding and staffing levels-past, present and future-and also inquired about activities in content management, Web delivery, computer support and customer relationship management. The results provide a starting point for measuring information technology growth and budget allocations in this publishing segment

how much should publish spend on technolog ?
 a studi confirm that spend on publishing-specif inform technolog ( it ) resourc is grow much faster than it spend for gener busi activ , at least among lead publish in the scientif , technic and medic ( stm ) market . the survey ask about inform technolog fund and staf levels-past , present and future-and also inquir about activ in content manag , web deliveri , comput support and custom relationship manag . the result provid a start point for measur inform technolog growth and budget alloc in thi publish segment

publishing
IT spending
content management
Web delivery
computer support
customer relationship management
budget


Continuous-time linear systems: folklore and fact

Abstract: We consider a family of continuous input-output maps representing linear time-invariant systems that take a set of signals into itself. It is shown that this family contains maps whose impulse response is the zero function, but which take certain inputs into nonzero outputs. It is shown also that this family contains members whose input-output properties are not described by their frequency domain response functions, and that the maps considered need not even commute

continuous-tim linear system : folklor and fact
 we consid a famili of continu input-output map repres linear time-invari system that take a set of signal into itself . it is shown that thi famili contain map whose impuls respons is the zero function , but which take certain input into nonzero output . it is shown also that thi famili contain member whose input-output properti are not describ by their frequenc domain respons function , and that the map consid need not even commut

linear systems
continuous input-output maps
time-invariant systems
impulse response
zero function
frequency domain response
commutation
continuous-time systems
signal processing


A new voltage-vector selection algorithm in direct torque control of induction motor drives

Abstract: AC drives based on direct torque control of induction machines allow high dynamic performance to be obtained with very simple control schemes. The drive behavior, in terms of current, flux and torque ripple, is dependent on the utilised voltage vector selection strategy and the operating conditions. In this paper a new voltage vector selection algorithm, which allows a sensible reduction of the RMS value of the stator current ripple without increasing the average value of the inverter switching frequency and without the need of a PWM pulse generator block is presented Numerical simulations have been carried out to validate the proposed method

a new voltage-vector select algorithm in direct torqu control of induct motor drive
 ac drive base on direct torqu control of induct machin allow high dynam perform to be obtain with veri simpl control scheme . the drive behavior , in term of current , flux and torqu rippl , is depend on the utilis voltag vector select strategi and the oper condit . in thi paper a new voltag vector select algorithm , which allow a sensibl reduct of the rm valu of the stator current rippl without increas the averag valu of the invert switch frequenc and without the need of a pwm puls gener block is present numer simul have been carri out to valid the propos method

voltage-vector selection algorithm
direct torque control
induction motor drives
AC drives
high dynamic performance
torque ripple
voltage vector selection strategy
operating conditions
RMS value
stator current ripple
inverter switching frequency
torque variations
flux variations
4-poles induction motor
steady-state operation
dynamic behavior
torque step response
220 V
50 Hz
4 kW


Recognizing groups G/sub 2/(3/sup n/) by their element orders

Abstract: It is proved that a finite group that is isomorphic to a simple non-Abelian group G = G/sub 2/(3/sup n/) is, up to isomorphism, recognized by a set omega (G) of its element orders, that is, H approximately= G if omega (H) = omega (G) for some finite group H

recogn group g / sub 2/(3 / sup n/ ) by their element order
 it is prove that a finit group that is isomorph to a simpl non-abelian group g = g / sub 2/(3 / sup n/ ) is , up to isomorph , recogn by a set omega ( g ) of it element order , that is , h approximately= g if omega ( h ) = omega ( g ) for some finit group h


An effective feedback control mechanism for DiffServ architecture

Abstract: As a scalable QoS (Quality of Service) architecture, Diffserv (Differentiated Service) mainly consists of two components: traffic conditioning at the edge of the Diffserv domain and simple packet forwarding inside the DiffServ domain. DiffServ has many advantages such as flexibility, scalability and simplicity. But when providing AF (Assured Forwarding) services, DiffServ has some problems such as unfairness among aggregated flows or among micro-flows belonging to an aggregated flow. In this paper, a feedback mechanism for AF aggregated flows is proposed to solve this problem. Simulation results show that this mechanism does improve the performance of DiffServ. First, it can improve the fairness among aggregated flows and make DiffServ more friendly toward TCP (Transmission Control Protocol) flows. Second, it can decrease the buffer requirements at the congested router and thus obtain lower delay and packet loss rate. Third, it also keeps almost the same link utility as in normal DiffServ. Finally, it is simple and easy to be implemented

an effect feedback control mechan for diffserv architectur
 as a scalabl qo ( qualiti of servic ) architectur , diffserv ( differenti servic ) mainli consist of two compon : traffic condit at the edg of the diffserv domain and simpl packet forward insid the diffserv domain . diffserv ha mani advantag such as flexibl , scalabl and simplic . but when provid af ( assur forward ) servic , diffserv ha some problem such as unfair among aggreg flow or among micro-flow belong to an aggreg flow . in thi paper , a feedback mechan for af aggreg flow is propos to solv thi problem . simul result show that thi mechan doe improv the perform of diffserv . first , it can improv the fair among aggreg flow and make diffserv more friendli toward tcp ( transmiss control protocol ) flow . second , it can decreas the buffer requir at the congest router and thu obtain lower delay and packet loss rate . third , it also keep almost the same link util as in normal diffserv . final , it is simpl and easi to be implement

feedback control
Diffserv
QoS
traffic conditioning
AF
packet forwarding
fairness
feedback mechanism
TCP
QoS architecture


On the discretization of double-bracket flows

Abstract: This paper extends the method of Magnus series to Lie-algebraic equations originating in double-bracket flows. We show that the solution of the isospectral flow Y' = [[Y,N],Y], Y(O) = Y/sub 0/ in Sym(n), can be represented in the form Y(t) = e/sup Omega (t)/Y/sub 0/e/sup - Omega (1)/, where the Taylor expansion of Omega can be constructed explicitly, term-by-term, identifying individual expansion terms with certain rooted trees with bicolor leaves. This approach is extended to other Lie-algebraic equations that can be appropriately expressed in terms of a finite "alphabet"

on the discret of double-bracket flow
 thi paper extend the method of magnu seri to lie-algebra equat origin in double-bracket flow . we show that the solut of the isospectr flow y ' = [ [ y , n],i ] , y(o ) = y / sub 0/ in sym(n ) , can be repres in the form y(t ) = e / sup omega ( t)/i / sub 0 / e / sup - omega ( 1)/ , where the taylor expans of omega can be construct explicitli , term-by-term , identifi individu expans term with certain root tree with bicolor leav . thi approach is extend to other lie-algebra equat that can be appropri express in term of a finit " alphabet "

Magnus series
Lie-algebraic equations
isospectral flow
Taylor expansion
bicolor leaves
double-bracket flows discretization


Data allocation on wireless broadcast channels for efficient query processing

Abstract: Data broadcast is an excellent method for efficient data dissemination in the mobile computing environment. The application domain of data broadcast will be widely expanded in the near future, where the client is expected to perform complex queries or transactions on the broadcast data. To reduce the access latency for processing the complex query, it is beneficial to place the data accessed in a query close to each other on the broadcast channel. In this paper, we propose an efficient algorithm to determine the allocation of the data on the broadcast channel such that frequently co-accessed data are not only allocated close to each other, but also in a particular order which optimizes the performance of query processing. Our mechanism is based on the well-known problem named optimal linear ordering. Experiments are performed to justify the benefit of our approach

data alloc on wireless broadcast channel for effici queri process
 data broadcast is an excel method for effici data dissemin in the mobil comput environ . the applic domain of data broadcast will be wide expand in the near futur , where the client is expect to perform complex queri or transact on the broadcast data . to reduc the access latenc for process the complex queri , it is benefici to place the data access in a queri close to each other on the broadcast channel . in thi paper , we propos an effici algorithm to determin the alloc of the data on the broadcast channel such that frequent co-access data are not onli alloc close to each other , but also in a particular order which optim the perform of queri process . our mechan is base on the well-known problem name optim linear order . experi are perform to justifi the benefit of our approach

wireless broadcast channels
query processing
mobile computing
access latency
database broadcasting
access time
tuning time
broadcast program


Action aggregation and defuzzification in Mamdani-type fuzzy systems

Abstract: Discusses the issues of action aggregation and defuzzification in Mamdani-type fuzzy systems. The paper highlights the shortcomings of defuzzification techniques associated with the customary interpretation of the sentence connective 'and' by means of the set union operation. These include loss of smoothness of the output characteristic and inaccurate mapping of the fuzzy response. The most appropriate procedure for aggregating the outputs of different fuzzy rules and converting them into crisp signals is then suggested. The advantages in terms of increased transparency and mapping accuracy of the fuzzy response are demonstrated

action aggreg and defuzzif in mamdani-typ fuzzi system
 discuss the issu of action aggreg and defuzzif in mamdani-typ fuzzi system . the paper highlight the shortcom of defuzzif techniqu associ with the customari interpret of the sentenc connect ' and ' by mean of the set union oper . these includ loss of smooth of the output characterist and inaccur map of the fuzzi respons . the most appropri procedur for aggreg the output of differ fuzzi rule and convert them into crisp signal is then suggest . the advantag in term of increas transpar and map accuraci of the fuzzi respons are demonstr

action aggregation
defuzzification
Mamdani-type fuzzy systems
sentence connective
set union operation
fuzzy response
fuzzy rules
crisp signals
transparency
mapping accuracy