A digital-driving system for smart vehicles In the wake of the computer and information technology revolutions , vehicles are undergoing dramatic changes in their capabilities and how they interact with drivers . Although some vehicles can decide to either generate warnings for the human driver or control the vehicle autonomously , they must usually make these decisions in real time with only incomplete information . So , human drivers must still maintain control over the vehicle . I sketch a digital driving behavior model . By simulating and analyzing driver behavior during different maneuvers such as lane changing , lane following , and traffic avoidance , researchers participating in the Beijing Institute of Technology 's digital-driving project will be able to examine the possible correlations or causal relations between the smart vehicle , IVISs , the intelligent road-traffic-information network , and the driver . We aim to successfully demonstrate that a digital-driving system can provide a direction for developing human-centered smart vehicles

O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O B O O B I O B I O O B I O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O

maneuvers
traffic avoidance
lane following
lane changing

intelligent road traffic information network


Uniform hyperbolic polynomial B-spline curves This paper presents a new kind of uniform splines , called hyperbolic polynomial B-splines , generated over the space Omega = span -LCB- sinh t , cosh t , t/sup k-3 / , t/sup k-3 / , t/sup k-4 / , ... , t 1 -RCB- in which k is an arbitrary integer larger than or equal to 3 . Hyperbolic polynomial B-splines share most of the properties of B-splines in polynomial space . We give subdivision formulae for this new kind of curve and then prove that they have variation diminishing properties and the control polygons of the subdivisions converge . Hyperbolic polynomial B-splines can handle freeform curves as well as remarkable curves such as the hyperbola and the catenary . The generation of tensor product surfaces using these new splines is straightforward . Examples of such tensor product surfaces : the saddle surface , the catenary cylinder , and a certain kind of ruled surface are given

O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O B I O O O O O O O O O O O O O O O O O O O O O O O B I O O O O O O O O O O O O O O O O O B I O O B O O O O O O O B I O O O O O O O O B O O B O O O O O O O O O O O O O O O O O O O O O O B I O O B O O O O O O O B I O O

arbitrary integer
subdivision formulae
control polygons
subdivisions
freeform curves
hyperbola
catenary
saddle surface
ruled surface

uniform hyperbolic polynomial b-spline curves


Web ad explosion Financed by advertising dollars from big names , online marketers are embracing more aggressive tactics


A systematic review of the efficacy of telemedicine for making diagnostic and management decisions We conducted a systematic review of the literature to evaluate the efficacy of telemedicine for making diagnostic and management decisions in three classes of application : office/hospital-based , store-and-forward , and home-based telemedicine . We searched the MEDLINE , EMBASE , CINAHL and HealthSTAR databases and printed resources , and interviewed investigators in the field . We excluded studies where the service did not historically require face-to-face encounters -LRB- e.g. radiology or pathology diagnosis -RRB- . A total of 58 articles met the inclusion criteria . The articles were summarized and graded for the quality and direction of the evidence . There were very few high-quality studies . The strongest evidence for the efficacy of telemedicine for diagnostic and management decisions came from the specialties of psychiatry and dermatology . There was also reasonable evidence that general medical history and physical examinations performed via telemedicine had relatively good sensitivity and specificity . Other specialties in which some evidence for efficacy existed were cardiology and certain areas of ophthalmology . Despite the widespread use of telemedicine in most major medical specialties , there is strong evidence in only a few of them that the diagnostic and management decisions provided by telemedicine are comparable to face-to-face care

O O O O O O O B O O O O O O O O O O O O O O O O O O O B O O O O O O O O O O O O O O O O O O B O O O O B O B O B O B O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O B O O O O O O O O O O B O B O O O O O O O O O O O O O O O B O O O O O O O O O O O O O O O O O B O O O O B O O O O O O B O O O O O O O O O O O O O O O O O O O O O O O O B O O O O O

telemedicine medline embase cinahl healthstar psychiatry dermatology cardiology ophthalmology

medical diagnosis
management decision making
literature review


Linear tense logics of increasing sets We provide an extension of the language of linear tense logic with future and past connectives F and P , respectively , by a modality that quantifies over the points of some set which is assumed to increase in the course of time . In this way we obtain a general framework for modelling growth qualitatively . We develop an appropriate logical system , prove a corresponding completeness and decidability result and discuss the various kinds of flow of time in the new context . We also consider decreasing sets briefly

O O O O O O O O O O O O O O B I I O B I I I O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O B I O O O O B O B O O O O O O O O O O O O O O O O O O B I O

linear tense logic
future and past connectives
logical system
completeness
decidability
decreasing sets


Designing human-centered distributed information systems Many computer systems are designed according to engineering and technology principles and are typically difficult to learn and use . The fields of human-computer interaction , interface design , and human factors have made significant contributions to ease of use and are primarily concerned with the interfaces between systems and users , not with the structures that are often more fundamental for designing truly human-centered systems . The emerging paradigm of human-centered computing -LRB- HCC -RRB- - which has taken many forms-offers a new look at system design . HCC requires more than merely designing an artificial agent to supplement a human agent . The dynamic interactions in a distributed system composed of human and artificial agents-and the context in which the system is situated-are indispensable factors . While we have successfully applied our methodology in designing a prototype of a human-centered intelligent flight-surgeon console at NASA Johnson Space Center , this article presents a methodology for designing human-centered computing systems using electronic medical records -LRB- EMR -RRB- systems

O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O B I O O B I O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O B I I I O O O O O O O O O O O O O O O O O O O

interface design
human factors
nasa johnson space center

human-centered distributed information systems design

human-centered intelligent flight surgeon console


Research into telehealth applications in speech-language pathology A literature review was conducted to investigate the extent to which telehealth has been researched within the domain of speech-language pathology and the outcomes of this research . A total of 13 studies were identified . Three early studies demonstrated that telehealth was feasible , although there was no discussion of the cost-effectiveness of this process in terms of patient outcomes . The majority of the subsequent studies indicated positive or encouraging outcomes resulting from telehealth . However , there were a number of shortcomings in the research , including a lack of cost-benefit information , failure to evaluate the technology itself , an absence of studies of the educational and informational aspects of telehealth in relation to speech-language pathology , and the use of telehealth in a limited range of communication disorders . Future research into the application of telehealth to speech-language pathology services must adopt a scientific approach , and have a well defined development and evaluation framework that addresses the effectiveness of the technique , patient outcomes and satisfaction , and the cost-benefit relationship

O O B I O O O O B I O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O B I O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O B I O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O B I O O O O O O O

telehealth applications
literature review
patient outcomes
communication disorders

speech-language pathology
telemedicine
cost-effectiveness
cost-benefit analysis
patient satisfaction


Rats , robots , and rescue In early May , media inquiries started arriving at my office at the Center for Robot-Assisted Search and Rescue -LRB- www.crasar.org -RRB- . Because I 'm CRASAR 's director , I thought the press was calling to follow up on the recent humanitarian award given to the center 's founder , John Blitch , for successfully using small , backpackable robots at the World Trade Center disaster . Instead , I found they were asking me to comment on the `` roborats '' study in the 2 May 2002 Nature . In this study , rats with medial force brain implants underwent operant conditioning to force them into a form of guided behavior , one aspect of which was thought useful for search and rescue . The article 's closing comment suggested that a guided rat could serve as both a mobile robot and a biological sensor . Although a roboticist by training , I 'm committed to any technology that will help save lives while reducing the risk to rescuers . But rats ?

O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O B I O O O O O B I O O B I O O O O O O O O O O O O O O O O O O O O O O O O O O O O

mobile robot
biological sensor
guided rat


Asymptotic expansions for the zeros of certain special functions We derive asymptotic expansions for the zeros of the cosine-integral Ci -LRB- x -RRB- and the Struve function H/sub 0 / -LRB- x -RRB- , and extend the available formulae for the zeros of Kelvin functions . Numerical evidence is provided to illustrate the accuracy of the expansions

B I O O B O O O O O O B I O O B O O O O O O O O O B I O O O O O O O O O O O O O O B O B I O O O O O O O O B O O O

asymptotic expansions
zeros
struve function
kelvin functions
accuracy


Technology on social issues of videoconferencing on the Internet : a survey Constant advances in audio/video compression , the development of the multicast protocol as well as fast improvement in computing devices -LRB- e.g. higher speed , larger memory -RRB- have set forth the opportunity to have resource demanding videoconferencing -LRB- VC -RRB- sessions on the Internet . Multicast is supported by the multicast backbone -LRB- Mbone -RRB- , which is a special portion of the Internet where this protocol is being deployed . Mbone VC tools are steadily emerging and the user population is growing fast . VC is a fascinating application that has the potential to greatly impact the way we remotely communicate and work . Yet , the adoption of VC is not as fast as one could have predicted . Hence , it is important to examine the factors that affect a widespread adoption of VC . This paper examines the enabling technology and the social issues . It discusses the achievements and identifies the future challenges . It suggests an integration of many emerging multimedia tools into VC in order to enhance its versatility for more effectiveness

O O B I O B O O B O O O O O O O O O O O O O B I O O O O O O O O O O O O O O O O O O O O O O O O O B O O O O O O B O O O O O O B I O B O O O O O O O O O B O O O O O O O B O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O B I O O O O O O O O O O O O O O O O O O B O O O O O O O O O O O O

videoconferencing
internet
multicast protocol
multicast backbone
mbone
multimedia
social issues


Generic simulation approach for multi-axis machining . Part 2 : model calibration and feed rate scheduling For Part 1 see ibid . vol .124 -LRB- 2002 -RRB- . This is the second part of a two-part paper presenting a new methodology for analytically simulating multi-axis machining of complex sculptured surfaces . The first section of this paper offers a detailed explanation of the model calibration procedure . A new methodology is presented for accurately determining the cutting force coefficients for multi-axis machining . The force model presented in Part 1 is reformulated so that the cutting force coefficients account for the effects of feed rate , cutting speed , and a complex cutting edge design . Experimental results are presented for the calibration procedure . Model verification tests were conducted with these cutting force coefficients . These tests demonstrate that the predicted forces are within 5 % of experimentally measured forces . Simulated results are also shown for predicting dynamic cutting forces and static/dynamic tool deflection . The second section of the paper discusses how the modeling methodology can be applied for feed rate scheduling in an industrial application . A case study for process optimization of machining an airfoil-like surface is used for demonstration . Based on the predicted instantaneous chip load and/or a specified force constraint , the feed rate scheduling is utilized to increase the metal removal rate . The feed rate scheduling implementation results in a 30 % reduction in machining time for the airfoil-like surface

B I O O O O O O O O B I O B I I O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O B I I O O O O O O O O O O O O O B I O O O O O O O O O O O B I I O O O O O B I O O O O O O O O O B I I O O O O O O O O O O O O O O B I I O O O O O O O O O O O O O O O O O B I I O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O B I I O O O O O O O O O O B O O O O O O O O O O O O O O O O O O O O O O O O B I I O O O O O B I I O O B I I O O O O O O O O O O O O O O

generic simulation
model calibration
complex sculptured surfaces
cutting force coefficients
force model
cutting edge design
metal removal rate
optimization
feed rate scheduling


Verifying concurrent systems with symbolic execution Current techniques for interactively proving temporal properties of concurrent systems translate transition systems into temporal formulas by introducing program counter variables . Proofs are not intuitive , because control flow is not explicitly considered . For sequential programs symbolic execution is a very intuitive , interactive proof strategy . In this paper we adopt this technique for parallel programs . Properties are formulated in interval temporal logic . An implementation in the interactive theorem prover KIV has shown that this technique offers a high degree of automation and allows simple , local invariants

O B I O B I O O O O O B I O B I O B I O B I O O B I I O O O O O O O O O O O O O O O B I B I O O O O O O O O O O O O O O O O O B I O O O O O O O O O O O O O B I I I O O O O O O O O O O O O O O O B I

symbolic execution
temporal properties
concurrent systems
transition systems
temporal formulas
program counter variables
sequential programs
parallel programs
interactive theorem prover kiv
local invariants


Content all clear -LSB- workflow & content management -RSB- Graeme Muir of SchlumbergerSema cuts through the confusion between content , document and records management

O O O O O O B I O O O O B O O O O O O O O O B I

schlumbergersema
content management
records management


A note on multi-index polynomials of Dickson type and their applications in quantum optics We discuss the properties of a new family of multi-index Lucas type polynomials , which are often encountered in problems of intracavity photon statistics . We develop an approach based on the integral representation method and show that this class of polynomials can be derived from recently introduced multi-index Hermite like polynomials

O O O O O O O O O O O O B I O O O O O O O O O O B I I O O O O O O O O B I I O O O O O O O O B I O O O O O O O O O O O O O O O O O O

lucas type polynomials
quantum optics
intracavity photon statistics
integral representation

multi-index polynomials
generating functions


A numerical C/sup 1 / - shadowing result for retarded functional differential equations This paper gives a numerical C/sup 1 / - shadowing between the exact solutions of a functional differential equation and its numerical approximations . The shadowing result is obtained by comparing exact solutions with numerical approximation which do not share the same initial value . Behavior of stable manifolds of functional differential equations under numerics will follow from the shadowing result

O O O O O O O O O B I I I O O O O O O O O O O O O B I O O O O O O O B I O O O O O O O O B I O O O O O O O O O O O O O O B I O O O O O O O O O O O O


No-go areas ? -LSB- content management -RSB- Alex Fry looks at how content management systems can be used to ensure website access for one important customer group , the disabled

O O O O O O O O O O O O B I I O O O O O B I O O O O O O O B

disabled
content management systems
website access


Contentment management Andersen 's William Yarker and Richard Young outline the route to a successful content management strategy


Using extended logic programming for alarm-correlation in cellular phone networks Alarm correlation is a necessity in large mobile phone networks , where the alarm bursts resulting from severe failures would otherwise overload the network operators . We describe how to realize alarm-correlation in cellular phone networks using extended logic programming . To this end , we describe an algorithm and system solving the problem , a model of a mobile phone network application , and a detailed solution for a specific scenario

O B I I O O O B I I O O O O O O B I I I O O O O O O O O O O O O O B I O O O O O O O O B I I O B I I O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O

extended logic programming
cellular phone networks
large mobile phone networks
network operators


Automatic extraction of eye and mouth fields from a face image using eigenfeatures and ensemble networks This paper presents a novel algorithm for the extraction of the eye and mouth -LRB- facial features -RRB- fields from 2D gray level images . Eigenfeatures are derived from the eigenvalues and eigenvectors of the binary edge data set constructed from eye and mouth fields . Such eigenfeatures are ideal features for finely locating fields efficiently . The eigenfeatures are extracted from a set of the positive and negative training samples for facial features and are used to train a multilayer perceptron -LRB- MLP -RRB- whose output indicates the degree to which a particular image window contains the eyes or the mouth within itself . An ensemble network consisting of a multitude of independent MLPs was used to enhance the generalization performance of a single MLP . It was experimentally verified that the proposed algorithm is robust against facial size and even slight variations of the pose

O O O O O O O O O O O O B O O O O O O O O O O O O O O O O O O O O O O O B I I I O B O O O O B O B O O B I I I O O O O O O O O B O O O O O O O O O O B O O O O O O O O O O B I O O O O O O O O O B I O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O B O O O O O O O O O O O O O O O O O O O O O O O O O O

2d gray level images
eigenvalues
eigenvectors
binary edge data set
training samples
multilayer perceptron
generalization
eigenfeatures

eye field extraction
mouth field extraction
face feature extraction
experiment
ensemble neural networks


A second order characteristic finite element scheme for convection-diffusion problems A new characteristic finite element scheme is presented for convection-diffusion problems . It is of second order accuracy in time increment , symmetric , and unconditionally stable . Optimal error estimates are proved in the framework of L/sup 2 / - theory . Numerical results are presented for two examples , which show the advantage of the scheme

O B I I I I I O O O O O O O O O O O O O O O O O O B I I O O O O O O O O O O B I I O O O O O O O O O O O O O O O O O O O O O O O O O O O

convection-diffusion problems
l/sup 2/ -theory


Adaptive thinning for bivariate scattered data This paper studies adaptive thinning strategies for approximating a large set of scattered data by piecewise linear functions over triangulated subsets . Our strategies depend on both the locations of the data points in the plane , and the values of the sampled function at these points - adaptive thinning . All our thinning strategies remove data points one by one , so as to minimize an estimate of the error that results by the removal of a point from the current set of points -LRB- this estimate is termed `` anticipated error '' -RRB- . The thinning process generates subsets of `` most significant '' points , such that the piecewise linear interpolants over the Delaunay triangulations of these subsets approximate progressively the function values sampled at the original scattered points , and such that the approximation errors are small relative to the number of points in the subsets . We design various methods for computing the anticipated error at reasonable cost , and compare and test the performance of the methods . It is proved that for data sampled from a convex function , with the strategy of convex triangulation , the actual error is minimized by minimizing the best performing measure of anticipated error . It is also shown that for data sampled from certain quadratic polynomials , adaptive thinning is equivalent to thinning which depends only on the locations of the data points - nonadaptive thinning . Based on our numerical tests and comparisons , two practical adaptive thinning algorithms are proposed for thinning large data sets , one which is more accurate and another which is faster

B I O O B I O O O B I O O O O O O O B I O B I I O B I O O O O O O O O O O O O O O O O O O O O O O O O O O O B I O O O O O O O O O O O O O O O O O O O O B O O O O O O O O O O O O O O O O O O O O O B O O O O O O O O O O O O O O O O O O O O O O O B I O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O B O O O O O O O O O O O O O O O O O O O O O O O B I O O O O O O O O O O B O O O O O O O O O O B O O O O O O O O O O O O O O B I O O O O O O O O O O O O O O O O O O O O O O O O O O O O B I O O O O O O O O O O O O O O O O O O O

adaptive thinning
scattered data
piecewise linear functions
triangulated subsets
error
delaunay triangulations
convex function


A distance between elliptical distributions based in an embedding into the Siegel group This paper describes two different embeddings of the manifolds corresponding to many elliptical probability distributions with the informative geometry into the manifold of positive-definite matrices with the Siegel metric , generalizing a result published previously elsewhere . These new general embeddings are applicable to a wide class of elliptical probability distributions , in which the normal , t-Student and Cauchy are specific examples . A lower bound for the Rao distance is obtained , which is itself a distance , and , through these embeddings , a number of statistical tests of hypothesis are derived

O O O B I O O O O O O B I O O O O O O O O O O O O B I I O O B I O O O O O O O O O O O O O O O O O O O O O O O O O O O O O B I I O O O O O O O O O O O O O O B I O O O O O O O O O O O O O O O O O O O O O O O O O O O O

elliptical distributions
siegel group
informative geometry
elliptical probability distributions
lower bound

manifolds embeddings
positive-definite matrices


Asymptotic normality for the K/sub phi / - divergence goodness-of-fit tests In this paper for a wide class of goodness-of-fit statistics based K/sub phi / - divergences , the asymptotic normality is established under the assumption n/m/sub n / to a in -LRB- 0 , infinity -RRB- , where n denotes sample size and m/sub n / the number of cells . This result is extended to contiguous alternatives to study asymptotic efficiency

B I O O O O O O O O O O O O O O O O O O O O O O O O O O O B I O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O B I

asymptotic normality
asymptotic efficiency

k/sub phi /-divergence goodness-of-fit tests


On the convergence of the Bermudez-Moreno algorithm with constant parameters A. Bermudez and C. Moreno -LRB- 1981 -RRB- presented a duality numerical algorithm for solving variational inequalities of the second kind . The performance of this algorithm strongly depends on the choice of two constant parameters . Assuming a further hypothesis of the inf-sup type , we present here a convergence theorem that improves on the one presented by A. Bermudez and C. Moreno . We prove that the convergence is linear , and we give the expression of the asymptotic error constant and the explicit form of the optimal parameters , as a function of some constants related to the variational inequality . Finally , we present some numerical examples that confirm the theoretical results

O O O O O O O O B I O O O O O O O O O O B I I O O B I O O O O O O O O O O O O O O O O O B I O O O O O O O O O O O O O O B I O O O O O O O O O O O O O O O O O O O O O O O O O O O O B I I O O O O O O B I O O O O O O O O O O O O O O O O O O O O O O O O O

duality numerical algorithm
variational inequalities
convergence theorem
asymptotic error constant
optimal parameters
constant parameters


Dedekind zeta-functions and Dedekind sums In this paper we use Dedekind zeta functions of two real quadratic number fields at -1 to denote Dedekind sums of high rank . Our formula is different from that of Siegel 's -LRB- 1969 -RRB- . As an application , we get a polynomial representation of zeta / sub K / -LRB- -1 -RRB- = zeta / sub K / -LRB- -1 -RRB- = 1/45 -LRB- 26n/sup 3 / - 41n + or - 9 -RRB- , n identical to + or-2 -LRB- mod 5 -RRB- , where K = Q -LRB- square root -LRB- 5q -RRB- -RRB- , prime q = 4n/sup 2 / + 1 , and the class number of quadratic number field K/sub 2 / = Q -LRB- square root q -RRB- is 1

O O O B I O O O O O O O O O O B I I I O O O O B I O O O O O O O O O O O O O O O O O O O O O O O O B I O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O

dedekind sums
real quadratic number fields
polynomial representation


Ant colony optimization and stochastic gradient descent We study the relationship between the two techniques known as ant colony optimization -LRB- ACO -RRB- and stochastic gradient descent . More precisely , we show that some empirical ACO algorithms approximate stochastic gradient descent in the space of pheromones , and we propose an implementation of stochastic gradient descent that belongs to the family of ACO algorithms . We then use this insight to explore the mutual contributions of the two techniques

B I I O B I I O O O O O O O O O O B I I O O O O B I I O O O O O O O O B I I O B I I O O O O B O O O O O O O B I I O O O O O O O O O O O O O O O O O O O O O O O

ant colony optimization
stochastic gradient descent
empirical aco algorithms
pheromones

combinatorial optimization
heuristic
reinforcement learning
social insects
swarm intelligence
artificial life
local search algorithms


Quadratic interpolation on spheres Riemannian quadratics are C/sup 1 / curves on Riemannian manifolds , obtained by performing the quadratic recursive deCastlejeau algorithm in a Riemannian setting . They are of interest for interpolation problems in Riemannian manifolds , such as trajectory-planning for rigid body motion . Some interpolation properties of Riemannian quadratics are analysed when the ambient manifold is a sphere or projective space , with the usual Riemannian metrics

B I O O O O O O O O O O B I O O O O O O O O O O O O O O O O O O O O O O B I O O O O O B I I O O O O O O O O O O O B I O O O O O O O O O O O O

quadratic interpolation
riemannian manifolds
rigid body motion
ambient manifold

trajectory-planning
corner-cutting
parallel translation
approximation theory


The AT89C51/52 flash memory programmers When faced with a plethora of applications to design , it 's essential to have a versatile microcontroller in hand . The author describes the AT89C51/52 microcontrollers . To get you started , he 'll describe his inexpensive microcontroller programmer

O O B I I O O O O O O O O O O O O O O O O O O O O O O O O O O B O O O O O O O O O O O B I

flash memory programmers
microcontrollers
microcontroller programmer


Average optimization of the approximate solution of operator equations and its application In this paper , a definition of the optimization of operator equations in the average case setting is given . And the general result about the relevant optimization problem is obtained . This result is applied to the optimization of approximate solution of some classes of integral equations

O B O O O O O B I O O O O O O O O O O O B O B I O O B I I O O O O O O O O O O B O O O O O O O O O O B O O O O O O O B I

operator equations
optimization
average case setting
integral equations


Neural and neuro-fuzzy integration in a knowledge-based system for air quality prediction We propose a unified approach for integrating implicit and explicit knowledge in neurosymbolic systems as a combination of neural and neuro-fuzzy modules . In the developed hybrid system , a training data set is used for building neuro-fuzzy modules , and represents implicit domain knowledge . The explicit domain knowledge on the other hand is represented by fuzzy rules , which are directly mapped into equivalent neural structures . The aim of this approach is to improve the abilities of modular neural structures , which are based on incomplete learning data sets , since the knowledge acquired from human experts is taken into account for adapting the general neural architecture . Three methods to combine the explicit and implicit knowledge modules are proposed . The techniques used to extract fuzzy rules from neural implicit knowledge modules are described . These techniques improve the structure and the behavior of the entire system . The proposed methodology has been applied in the field of air quality prediction with very encouraging results . These experiments show that the method is worth further investigation

O O O O O O O O O B I I O O O O O O O O O O O O B I O O O O O O O O O O O O B I O O B I I O O O O O O O O O O O O O O O O O O O O O O O O B I O O O O O O O O O O O O O O O O O O O O O O O O O O O O O B I O O O O O O O O O O O O O O O O O O B I O O O O O O O O O O O O O O O O O O O B I O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O B I I O O O O O O B O O O O O O O O

air quality prediction
neurosymbolic systems
hybrid system
training data set
fuzzy rules
incomplete learning
neural architecture
experiments

implicit domain knowledge representation


Numerical solution of forward and backward problem for 2-D heat conduction equation For a two-dimensional heat conduction problem , we consider its initial boundary value problem and the related inverse problem of determining the initial temperature distribution from transient temperature measurements . The conditional stability for this inverse problem and the error analysis for the Tikhonov regularization are presented . An implicit inversion method , which is based on the regularization technique and the successive over-relaxation -LRB- SOR -RRB- iteration process , is established . Due to the explicit difference scheme for a direct heat problem developed in this paper , the inversion process is very efficient , while the application of SOR technique makes our inversion convergent rapidly . Numerical results illustrating our method are also given

O O O O O O O O O B I O O O O B I O O O O O B I I I O O O B I O O O B I I O B I I O O B I O O B I O O B I O O B I O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O

heat conduction
initial boundary value problem
inverse problem
initial temperature distribution
transient temperature measurements
conditional stability
tikhonov regularization
error analysis

successive over-relaxation iteration process


Fuzzy non-homogeneous Markov systems In this paper the theory of fuzzy logic and fuzzy reasoning is combined with the theory of Markov systems and the concept of a fuzzy non-homogeneous Markov system is introduced for the first time . This is an effort to deal with the uncertainty introduced in the estimation of the transition probabilities and the input probabilities in Markov systems . The asymptotic behaviour of the fuzzy Markov system and its asymptotic variability is considered and given in closed analytic form . Moreover , the asymptotically attainable structures of the system are estimated also in a closed analytic form under some realistic assumptions . The importance of this result lies in the fact that in most cases the traditional methods for estimating the probabilities can not be used due to lack of data and measurement errors . The introduction of fuzzy logic into Markov systems represents a powerful tool for taking advantage of the symbolic knowledge that the experts of the systems possess

B I I I O O O O O O B I O B I O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O B O O O O O O B I O O B I O O O O O O O O O O O O O O B I O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O B I O O O O B I O O O O O O O O O O O O B I O O O O O O O

fuzzy nonhomogeneous markov systems
fuzzy logic
fuzzy reasoning
uncertainty
transition probabilities
input probabilities
asymptotic variability
measurement errors
symbolic knowledge


Natural language from artificial life This article aims to show that linguistics , in particular the study of the lexico-syntactic aspects of language , provides fertile ground for artificial life modeling . A survey of the models that have been developed over the last decade and a half is presented to demonstrate that ALife techniques have a lot to offer an explanatory theory of language . It is argued that this is because much of the structure of language is determined by the interaction of three complex adaptive systems : learning , culture , and biological evolution . Computational simulation , informed by theoretical linguistics , is an appropriate response to the challenge of explaining real linguistic data in terms of the processes that underpin human language

B I O B I O O O O O O B O O O O O O O O O O O O O O O O B I O O O O O O O O O O O O O O O O O O O O O O O B O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O B I O B O B O O B I O B I O O O O B O O O O O O O O O O O O O O O O O O O O O O

natural language
linguistics
alife
adaptive systems
learning
culture
biological evolution
computational simulation
artificial life


Records role in e-business Records management standards are now playing a key role in e-business strategy


Generic simulation approach for multi-axis machining . Part 1 : modeling methodology This paper presents a new methodology for analytically simulating multi-axis machining of complex sculptured surfaces . A generalized approach is developed for representing an arbitrary cutting edge design , and the local surface topology of a complex sculptured surface . A NURBS curve is used to represent the cutting edge profile . This approach offers the advantages of representing any arbitrary cutting edge design in a generic way , as well as providing standardized techniques for manipulating the location and orientation of the cutting edge . The local surface topology of the part is defined as those surfaces generated by previous tool paths in the vicinity of the current tool position . The local surface topology of the part is represented without using a computationally expensive CAD system . A systematic prediction technique is then developed to determine the instantaneous tool/part interaction during machining . The methodology employed here determines the cutting edge in-cut segments by determining the intersection between the NURBS curve representation of the cutting edge and the defined local surface topology . These in-cut segments are then utilized for predicting instantaneous chip load , static and dynamic cutting forces , and tool deflection . Part 1 of this paper details the modeling methodology and demonstrates the capabilities of the simulation for machining a complex surface

O O O O O O O O O O O O O O O O O O O O O O O O B I I O O O O O O O O O O O O O O O O O B I O O O O O O O B I O O O O O B I I O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O B I O O O O O O O O O O O O O O O O O O O O O O O O B I O O O O O O O O O O O O O O B I O O O O O O O O O O O O O O O O O O O O O O O O O O O O O B I O O O O O O O O O B I O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O

complex sculptured surfaces
systematic prediction
cutting edge profile
surface topology
nurbs curve

multiple axis machining
generic modeling
tool path specification
complex surface machining


A heuristic approach to resource locations in broadband networks In broadband networks , such as ATM , the importance of dynamic migration of data resources is increasing because of its potential to improve performance especially for transaction processing . In environments with migratory data resources , it is necessary to have mechanisms to manage the locations of each data resource . In this paper , we present an algorithm that makes use of system state information and heuristics to manage locations of data resources in a distributed network . In the proposed algorithm , each site maintains information about state of other sites with respect to each data resource of the system and uses it to find : -LRB- 1 -RRB- a subset of sites likely to have the requested data resource ; and -LRB- 2 -RRB- the site where the data resource is to be migrated from the current site . The proposed algorithm enhances its effectiveness by continuously updating system state information stored at each site . It focuses on reducing the overall average time delay needed by the transaction requests to locate and access the migratory data resources . We evaluated the performance of the proposed algorithm and also compared it with one of the existing location management algorithms , by simulation studies under several system parameters such as the frequency of requests generation , frequency of data resource migrations , network topology and scale of network . The experimental results show the effectiveness of the proposed algorithm in all cases

O O O O B I O B I O B I O O O B O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O B O O O O O O O O B I O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O B I I O B I O O O O O O O O O O O O O O O O O O

broadband networks
atm
resource locations
heuristics
distributed network
data resource migrations
network topology


A comparison theorem for the iterative method with the preconditioner -LRB- I + S/sub max / -RRB- A.D. Gunawardena et al. -LRB- 1991 -RRB- have reported the modified Gauss-Seidel method with a preconditioner -LRB- I + S -RRB- . In this article , we propose to use a preconditioner -LRB- I + S/sub max / -RRB- instead of -LRB- I + S -RRB- . Here , S/sub max / is constructed by only the largest element at each row of the upper triangular part of A. By using the lemma established by M. Neumann and R.J. Plemmons -LRB- 1987 -RRB- , we get the comparison theorem for the proposed method . Simple numerical examples are also given

O B I O O B I O O B O O O O O O O O O O O O O O O O O O O O O O B O O O O O O O O O O O O O O O B O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O B I O O O O O O O O O O O

iterative method
preconditioner
comparison theorem


The numerical solution of an evolution problem of second order in time on a closed smooth boundary We consider an initial value problem for the second-order differential equation with a Dirichlet-to-Neumann operator coefficient . For the numerical solution we carry out semi-discretization by the Laguerre transformation with respect to the time variable . Then an infinite system of the stationary operator equations is obtained . By potential theory , the operator equations are reduced to boundary integral equations of the second kind with logarithmic or hypersingular kernels . The full discretization is realized by Nystrom 's method which is based on the trigonometric quadrature rules . Numerical tests confirm the ability of the method to solve these types of nonstationary problems

O O O O O B I O O O O O O O B I I O O O B I I O O O O O O O O O O O O O O O O O O O O O B I O O O O O O O O O O O O O B I I O O O O O O O O O O O O O B I I O O O O O O O B I O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O

initial value problem
evolution problem
closed smooth boundary
laguerre transformation
hypersingular kernels
boundary integral equations
stationary operator equations


Regularity of some ` incomplete ' Pal-type interpolation problems In this paper the regularity of nine Pal-type interpolation problems is proved . In the literature interpolation on the zeros of the pair W/sub n / / sup -LRB- alpha -RRB- / -LRB- z -RRB- = -LRB- z + alpha -RRB- / sup n / + -LRB- 1 + alpha z -RRB- / sup n / , v/sub n / / sup -LRB- alpha -RRB- / -LRB- z -RRB- = -LRB- z + alpha -RRB- / sup n / - -LRB- 1 + alpha z -RRB- / sup n / with 0 < alpha < 1 has been studied . Here the nodes form a subset of these sets of zeros

O O O O O O O O O O O O O O O O O O O O O O O O O O O O B O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O B


Holding on -LSB- workflow & content management -RSB- Marc Fresko of Cornwell Management Consultants says ` think ahead ' when developing your electronic records management policy

O O O O O O O O O O O B I I O O O O O O O O B I I I

cornwell management consultants
electronic records management policy


Uniform supersaturated design and its construction Supersaturated designs are factorial designs in which the number of main effects is greater than the number of experimental runs . In this paper , a discrete discrepancy is proposed as a measure of uniformity for supersaturated designs , and a lower bound of this discrepancy is obtained as , a benchmark of design uniformity . A construction method for uniform supersaturated designs via resolvable balanced incomplete block designs is also presented along with the investigation of properties of the resulting designs . The construction method shows a strong link between these two different kinds of designs

B I I O O O O O O B I O O O O O O O O O O O O O B I O O O O O O B I O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O B I I I I O O O O O O O O O O O O O O O O O O O O O O O O O O O O


Determinantal solutions of solvable chaotic systems It is shown that two solvable chaotic systems , the arithmetic-harmonic mean -LRB- ARM -RRB- algorithm and the Ulam-von Neumann -LRB- UvN -RRB- map , have determinantal solutions . An additional formula for certain determinants and Riccati difference equations play a key role in both cases . Two infinite hierarchies of solvable chaotic systems are presented which have determinantal solutions

B I O B I I O O O O O B I I O O O O O O O O O O O O O O O O O O B I O O O O O O B O B I I O O O O O O O O O O O O B I I O O O O B I

determinantal solutions
solvable chaotic systems
determinants
riccati difference equations

arithmetic-harmonic mean algorithm
ulam-von neumann map
chebyshev polynomial


An interactive self-replicator implemented in hardware Self-replicating loops presented to date are essentially worlds unto themselves , inaccessible to the observer once the replication process is launched . We present the design of an interactive self-replicating loop of arbitrary size , wherein the user can physically control the loop 's replication and induce its destruction . After introducing the BioWall , a reconfigurable electronic wall for bio-inspired applications , we describe the design of our novel loop and delineate its hardware implementation in the wall

O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O B O O B I I O O O O O O O O O O O O O O O B I O O O

biowall
reconfigurable electronic wall
hardware implementation

interactive self-replicator
interactive self-replicating loop
bio-inspired applications
self-replication
field programmable gate array
cellular automata
reconfigurable computing
artificial life


Necessary conditions of optimality for impulsive systems on Banach spaces We present necessary conditions of optimality for optimal control problems arising in systems governed by impulsive evolution equations on Banach spaces . Basic notations and terminologies are first presented and necessary conditions of optimality are presented . Special cases are discussed and we present an application to the classical linear quadratic regulator problem

B I O B O B I O B I O O B I O B O B I O O O O O O B I I O B I O O O O O O O O O B I O B O O O O O O O O O O O O O O O B I I O

linear quadratic regulator
optimality
impulsive systems
optimal control
impulsive evolution equations
banach spaces
necessary conditions


L/sub p / boundedness of -LRB- C , 1 -RRB- means of orthonormal expansions for general exponential weights Let I be a finite or infinite interval , and let W : I to -LRB- 0 , infinity -RRB- . Assume that W/sup 2 / is a weight , so that we may define orthonormal polynomials corresponding to W/sup 2 / . For f : R to R , let s/sub m / -LSB- f -RSB- denote the mth partial sum of the orthonormal expansion of f with respect to these polynomials . We investigate boundedness in weighted L/sub p / spaces of the -LRB- C , 1 -RRB- means 1/n / sub m = 1 / Sigma / sup n/s/sub m / -LSB- f -RSB- . The class of weights W/sup 2 / considered includes even and noneven exponential weights

O O O B O O O O O O O O B I O B I I O O O O O O B I O O O O O O O O O O O O O O O O O O O O O O O O O O O B I O O O O O O O O O O O O O O O O O O O O O O B I I O O O O O O O O O O O O O O B O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O

boundedness
orthonormal expansions
general exponential weights
infinite interval
orthonormal polynomials
mth partial sum


New projection-type methods for monotone LCP with finite termination In this paper we establish two new projection-type methods for the solution of the monotone linear complementarity problem -LRB- LCP -RRB- . The methods are a combination of the extragradient method and the Newton method , in which the active set strategy is used and only one linear system of equations with lower dimension is solved at each iteration . It is shown that under the assumption of monotonicity , these two methods are globally and linearly convergent . Furthermore , under a nondegeneracy condition they have a finite termination property . Finally , the methods are extended to solving the monotone affine variational inequality problem

O O O O B I O B I O O O O O O O O O O O O O O B I I I O O O O O O O O O O O B I O O B I O O O O B I I O O O O O B I I I O O O O O O O B O O O O O O O O O B O O O O O O O O O O O O O O B I O O O B I O O O O O O O O O O O B I I I I

projection-type methods
convergence
matrix
vector


Riccati-based preconditioner for computing invariant subspaces of large matrices This paper introduces and analyzes the convergence properties of a method that computes an approximation to the invariant subspace associated with a group of eigenvalues of a large not necessarily diagonalizable matrix . The method belongs to the family of projection type methods . At each step , it refines the approximate invariant subspace using a linearized Riccati 's equation which turns out to be the block analogue of the correction used in the Jacobi-Davidson method . The analysis conducted in this paper shows that the method converges at a rate quasi-quadratic provided that the approximate invariant subspace is close to the exact one . The implementation of the method based on multigrid techniques is also discussed and numerical experiments are reported

O O O O B I O B I O O O O O O O O O O O O O O O O O O O O O O O O B O O O O O B I O O O O O O O O B I I O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O B I O O O O O O O O

invariant subspaces
large matrices
eigenvalues
diagonalizable matrix
projection type methods
multigrid techniques

riccati-based preconditioner
jacobi-davidson method


Orthogonality of the Jacobi polynomials with negative integer parameters It is well known that the Jacobi polynomials P/sub n / / sup -LRB- alpha , beta -RRB- / -LRB- x -RRB- are orthogonal with respect to a quasi-definite linear functional whenever alpha , beta , and alpha + beta + 1 are not negative integer numbers . Recently , Sobolev orthogonality for these polynomials has been obtained for alpha a negative integer and beta not a negative integer and also for the case alpha = beta negative integer numbers . In this paper , we give a Sobolev orthogonality for the Jacobi polynomials in the remainder cases

B O O B I O B I I O O O O O O B I O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O B O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O B O O B I O O O O

orthogonality
jacobi polynomials
negative integer parameters

quasi-definite linear functional
sobolev orthogonality


Differential calculus for p-norms of complex-valued vector functions with applications For complex-valued n-dimensional vector functions t to s -LRB- t -RRB- , supposed to be sufficiently smooth , the differentiability properties of the mapping t to | | s -LRB- t -RRB- | | / sub p / at every point t = t/sub 0 / epsilon R/sub 0 / / sup + / : = -LCB- t epsilon R | t > or = 0 -RCB- are investigated , where | | . | | / sub p / is the usual vector norm in C/sup n / resp . R/sup n / , for p epsilon -LSB- 1 , o infinity -RSB- . Moreover , formulae for the first three right derivatives D/sub + / / sup k / | | s -LRB- t -RRB- | | / sub p / , k = 1 , 2,3 are determined . These formulae are applied to vibration problems by computing the best upper bounds on | | s -LRB- t -RRB- | | / sub p / in certain classes of bounds . These results can not be obtained by the methods used so far . The systematic use of the differential calculus for vector norms , as done here for the first time , could lead to major advances also in other branches of mathematics and other sciences

B I O O O O B I O O O O O B I O O O O O O O O O O O O O O O O O O B O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O B I O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O B I O B I O O O O O O O O O O O O O O O O O O O O O O O

differential calculus
vector functions
mapping
vibration problems
vector norms


Pontryagin maximum principle of optimal control governed by fluid dynamic systems with two point boundary state constraint We study the optimal control problem subject to the semilinear equation with a state constraint . We prove certain theorems and give examples of state constraints so that the maximum principle holds . The main difficulty of the problem is to make the sensitivity analysis of the state with respect to the control caused by the unboundedness and nonlinearity of an operator

B I I O B I O O O O O O O O O O O O O O B I O O O O B I O O O O O O O O O O O O O B I O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O

pontryagin maximum principle
optimal control
semilinear equation
state constraints


View from the top -LSB- workflow & content management -RSB- International law firm Linklaters has installed a global document and content management system that is accessible to clients and which has helped it move online

O O O O O O O B I O B I I B O O O O O O B I O O O O O O O O O O O O B

international law firm
linklaters
content management
online


Connection management for QoS service on the Web The current Web service model treats all requests equivalently , both while being processed by servers and while being transmitted over the network . For some uses , such as multiple priority schemes , different levels of service are desirable . We propose application-level TCP connection management mechanisms for Web servers to provide two different levels of Web service , high and low service , by setting different time-outs for inactive TCP connections . We evaluated the performance of the mechanism under heavy and light loading conditions on the Web server . Our experiments show that , though heavy traffic saturates the network , high level class performance is improved by as much as 25-28 % . Therefore , this mechanism can effectively provide QoS guaranteed services even in the absence of operating system and network supports

B I O O O O O O O O B I I O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O B I O O O O O O O O O O O O O O O O O O O O O O O O B I O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O

connection management
web service model
tcp connections

internet
time-outs
quality of service
telecommunication traffic
client server system
web transaction


Stability of Runge-Kutta methods for delay integro-differential equations We study stability of Runge-Kutta -LRB- RK -RRB- methods for delay integro-differential equations with a constant delay on the basis of the linear equation du/dt = Lu -LRB- t -RRB- + Mu -LRB- t - tau -RRB- + K integral / sub t - tau / / sup t / u -LRB- theta -RRB- d theta , where L , M , K are constant complex matrices . In particular , we show that the same result as in the case K = 0 -LRB- Koto , 1994 -RRB- holds for this test equation , i.e. , every A-stable RK method preserves the delay-independent stability of the exact solution whenever a step-size of the form h = tau / m is used , where m is a positive integer

B O O O O O O O O O B O O O O O O O O O O O O B I O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O B O O O O O O O O O O O O O O O O O O O O O O O O

runge-kutta methods
delay integro-differential equations


RISCy business . Part 1 : RISC projects by Cornell students The author looks at several projects that Cornell University students entered in the Atmel Design 2001 contest . Those covered include a vertical plotter ; BiLines , an electronic game ; a wireless Internet pager ; Cooking Coach ; Barbie 's zip drive ; and a model train controller

O O O O O O B I O B I O O O O O O O O O O O O O O O O O O O O O O B I O B O O B I O O B I I O B I O O O O O O O O B I I

risc projects
cornell students
vertical plotter
bilines
electronic game
wireless internet pager
cooking coach
model train controller

atmel's design logic 2001 contest
barbie's zip drive


The simulated emergence of distributed environmental control in evolving microcosms This work continues investigation into Gaia theory -LRB- Lovelock , The ages of Gaia , Oxford University Press , 1995 -RRB- from an artificial life perspective -LRB- Downing , Proceedings of the 7th International Conference on Artificial Life , p. 90-99 , MIT Press , 2000 -RRB- , with the aim of assessing the general compatibility of emergent distributed environmental control with conventional natural selection . Our earlier system , GUILD -LRB- Downing and Zvirinsky , Artificial Life , 5 , p.291-318 , 1999 -RRB- , displayed emergent regulation of the chemical environment by a population of metabolizing agents , but the chemical model underlying those results was trivial , essentially admitting all possible reactions at a single energy cost . The new model , METAMIC , utilizes abstract chemistries that are both -LRB- a -RRB- constrained to a small set of legal reactions , and -LRB- b -RRB- grounded in basic fundamental relationships between energy , entropy , and biomass synthesis/breakdown . To explore the general phenomena of emergent homeostasis , we generate 100 different chemistries and use each as the basis for several METAMIC runs , as part of a Gaia hunt . This search discovers 20 chemistries that support microbial populations capable of regulating a physical environmental factor within their growth-optimal range , despite the extra metabolic cost . Case studies from the Gaia hunt illustrate a few simple mechanisms by which real biota might exploit the underlying chemistry to achieve some control over their physical environment . Although these results shed little light on the question of Gaia on Earth , they support the possibility of emergent environmental control at the microcosmic level

O B I O O O O O B I O O O O O B I O O O O O O O O O O O O O O O O B I O O O O O O O O O O O B I O O O O O O O O O O O O O O O O O O O B I I I O O B I O O O O O O O O O O O B I O O O O O O O O O O O O O O O O O O O B I O O O B I O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O B I O O O O O O O O O O O O O O O O O O O O O B I O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O B I O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O

guild system
metamic model
genetic algorithms
artificial chemistry
artificial metabolisms


Self-validating integration and approximation of piecewise analytic functions Let an analytic or a piecewise analytic function on a compact interval be given . We present algorithms that produce enclosures for the integral or the function itself . Under certain conditions on the representation of the function , this is done with the minimal order of numbers of operations . The integration algorithm is implemented and numerical comparisons to non-validating integration software are presented

O O O O O B I I O O O O O O O O O O B I O O O O O O O O B O O O O O O O O O O O O O O O O O O O O O O O B I O O O O O O B I O O O O O O O O O O O

compact interval
enclosures
minimal order
integration algorithm
piecewise analytic functions

self-validating integration
self-validating approximation
complex interval arithmetic


An intelligent system combining different resource-bounded reasoning techniques In this paper , PRIMES -LRB- Progressive Reasoning and Intelligent multiple MEthods System -RRB- , a new architecture for resource-bounded reasoning that combines a form of progressive reasoning and the so-called multiple methods approach is presented . Each time-critical reasoning unit is designed in such a way that it delivers an approximate result in time whenever an overload or a failure prevents the system from producing the most accurate result . Indeed , reasoning units use approximate processing based on two salient features . First , an incremental processing unit constructs an approximate solution quickly and then refines it incrementally . Second , a multiple methods approach proposes different alternatives to solve the problem , each of them being selected according to the available resources . In allowing several resource-bounded reasoning paradigms to be combined , we hope to extend their actual scope to cover more real-world application domains

O O O O O O O O O O O O B O B I O B I I I O O O O O O O O O O O O O B I O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O B I O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O

intelligent multiple methods system
approximate processing
primes
progressive reasoning

resource-bounded reasoning techniques
time-critical reasoning unit
complex systems
real-time performance


The open-source HCS project Despite the rumors , the HCS II project is not dead . In fact , HCS has been licensed and is now an open-source project . In this article , the author brings us up to speed on the HCS II project 's past , present , and future . The HCS II is an expandable , standalone , network-based -LRB- RS-485 -RRB- , intelligent-node , industrial-oriented supervisory control -LRB- SC -RRB- system intended for demanding home control applications . The HCS incorporates direct and remote digital inputs and outputs , direct and remote analog inputs and outputs , real time or Boolean decision event triggering , X10 transmission and reception , infrared remote control transmission and reception , remote LCDs , and a master console . Its program is compiled on a PC with the XPRESS compiler and then downloaded to the SC where it runs independently of the PC

O O O O O O O O O B I O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O B I O O O O O O O O O O B I O O O O O O O O O O O O O O O O O O O O O O O B I O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O

supervisory control system
network-based


Cutting through the confusion -LSB- workflow & content management -RSB- Information management vendors are rushing to re-position themselves and put a portal spin on their products , says ITNET 's Graham Urquhart . The result is confusion , with a range of different definitions and claims clouding the true picture

O O O O O B O O O O O O O O O O O O O O O O O O O O O O B O O O O O O O O O O O O O O O O O O O O O


On lag windows connected with Jacobi polynomials Lag windows whose corresponding spectral windows are Jacobi polynomials or sums of Jacobi polynomials are introduced . The bias and variance of their spectral density estimators are investigated and their window bandwidth and characteristic exponent are determined

O B I O O B I B I O O B I O B I O O O B I O O O O O O O O O B I I O O O O B I O B I O O

lag windows
jacobi polynomials
spectral windows
spectral density estimators
window bandwidth
characteristic exponent


Comments on some recent methods for the simultaneous determination of polynomial zeros In this note we give some comments on the recent results concerning a simultaneous method of the fourth-order for finding complex zeros in circular interval arithmetic . The main discussion is directed to a rediscovered iterative formula and its modification , presented recently in Sun and Kosmol , -LRB- 2001 -RRB- . The presented comments include some critical parts of the papers Petkovic , Trickovic , Herceg , -LRB- 1998 -RRB- and Sun and Kosmol , -LRB- 2001 -RRB- which treat the same subject

O O O O O O O O O O B B O O O O O O O O O O O O O O O O O O O O O B O B I I O O O O O O O O O B I O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O

polynomial
zeros
circular interval arithmetic
iterative formula


Hot controllers Over the last few years , the semiconductor industry has put much emphasis on ways to improve the accuracy of thermal mass flow controllers -LRB- TMFCs -RRB- . Although issues involving TMFC mounting orientation and pressure effects have received much attention , little has been done to address the effect of changes in ambient temperature or process gas temperature . Scientists and engineers at Qualiflow have succeeded to solve the problem using a temperature correction algorithm for digital TMFCs . Using an in situ environmental temperature compensation technique , we calculated correction factors for the temperature effect and obtained satisfactory results with both the traditional sensor and the new , improved thin-film sensors

O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O B I I O O O O O O B I I I I O O O O O O O O O O O O O O O O O O O O O O O O O O

semiconductor manufacturing
process gas flow
thermal mass flow controller


Self-reproduction in three-dimensional reversible cellular space Due to inevitable power dissipation , it is said that nano-scaled computing devices should perform their computing processes in a reversible manner . This will be a large problem in constructing three-dimensional nano-scaled functional objects . Reversible cellular automata -LRB- RCA -RRB- are used for modeling physical phenomena such as power dissipation , by studying the dissipation of garbage signals . We construct a three-dimensional self-inspective self-reproducing reversible cellular automaton by extending the two-dimensional version SR/sub 8 / . It can self-reproduce various patterns in three-dimensional reversible cellular space without dissipating garbage signals

O O O O O O O O O B I O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O B I I O O O O O O O O O O O B I O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O

power dissipation
reversible cellular automata

3d self-inspective self-reproducing cellular automata


Solution of a class of two-dimensional integral equations The two-dimensional integral equation 1 / pi integral integral / sub D / -LRB- phi -LRB- r , theta -RRB- / R/sup 2 / -RRB- dS = f -LRB- r/sub 0 / , theta / sub 0 / -RRB- defined on a circular disk D : r/sub 0 / < or = a , 0 < or = theta / sub 0 / < or = 2 pi , is considered in the present paper . Here R in the kernel denotes the distance between two points P -LRB- r , theta -RRB- and P/sub 0 / -LRB- r/sub 0 / , theta / sub 0 / -RRB- in D , and 0 < alpha < 2 or 2 < alpha < 4 . Based on some known results of Bessel functions , integral representations of the kernel are established for 0 < alpha < 2 and 2 < alpha < 4 , respectively , and employed to solve the corresponding two-dimensional integral equation . The solutions of the weakly singular integral equation for 0 < alpha < 2 and of the hypersingular integral equation for 2 < alpha < 4 are obtained , respectively

O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O B I O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O B O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O B I O B I O O B O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O B I I I O O O O O O O O O B I I O O O O O O O O O O

circular disk
kernel
bessel functions
integral representations
weakly singular integral equation
hypersingular integral equation


Driving the NKK Smartswitch .2 . Graphics and text Whether your message is one of workplace safety or world peace , the long nights of brooding over ways to tell the world are over . Part 1 described the basic interface to drive the Smartswitch . Part 2 adds the bells and whistles to allow both text and messages to be placed anywhere on the screen . It considers character generation , graphic generation and the user interface

O O B I O O O O B O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O B O B O O O O O O O O O O B I O B I O O B I

nkk smartswitch
text
messages
character generation
graphic generation
user interface


A geometric process equivalent model for a multistate degenerative system In this paper , a monotone process model for a one-component degenerative system with k +1 states -LRB- k failure states and one working state -RRB- is studied . We show that this model is equivalent to a geometric process -LRB- GP -RRB- model for a two-state one component system such that both systems have the same long-run average cost per unit time and the same optimal policy . Furthermore , an explicit expression for the determination of an optimal policy is derived

O B I I I O O B I I O O O O O B I I O O O O O O O O O O O B I O O B I O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O B I O O O O O O O O O O O B I O O

multistate degenerative system
geometric process equivalent model
monotone process model
failure states
working state
optimal policy

one-component degenerative system
two-state one component system
long-run average cost
replacement policy
renewal reward process


SPARC ignites scholarly publishing During the past several years , initiatives which bring together librarians , researchers , university administrators and independent publishers have re-invigorated the scholarly publishing marketplace . These initiatives take advantage of electronic technology and show great potential for restoring science to scientists . The author outlines SPARC -LRB- the Scholarly Publishing and Academic Resources Coalition -RRB- , an initiative to make scientific journals more accessible

B O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O B O O B I I I I I O O O B O O O O O O

scholarly publishing and academic resources coalition

electronic publishing
scientific journal access


Effectiveness of user testing and heuristic evaluation as a function of performance classification For different levels of user performance , different types of information are processed and users will make different types of errors . Based on the error 's immediate cause and the information being processed , usability problems can be classified into three categories . They are usability problems associated with skill-based , rule-based and knowledge-based levels of performance . In this paper , a user interface for a Web-based software program was evaluated with two usability evaluation methods , user testing and heuristic evaluation . The experiment discovered that the heuristic evaluation with human factor experts is more effective than user testing in identifying usability problems associated with skill-based and rule-based levels of performance . User testing is more effective than heuristic evaluation in finding usability problems associated with the knowledge-based level of performance . The practical application of this research is also discussed in the paper

O O B I O B I O O O O B I O O O O B I O O O O O O O O O O O O O O O O O O O O O O O O O O O O O B O O O O O O O O O O B O O O O O O O O O O O O O O O O O B I O O O O O O O O O B O O O B I O B I O O B O O O B I O O O O O O O O B I O O B O O O O O O O O O O B I O O O O B I O O B O O O O O O O O O O O O O O O O O O O O O

user testing
heuristic evaluation
performance classification
user performance
usability
user interface
experiment

knowledge-based performance levels
skill-based performance levels
web-based software
human factors
rule-based performance levels


Data mining business intelligence for competitive advantage Organizations have lately realized that just processing transactions and/or information faster and more efficiently no longer provides them with a competitive advantage vis-a-vis their competitors for achieving business excellence . Information technology -LRB- IT -RRB- tools that are oriented towards knowledge processing can provide the edge that organizations need to survive and thrive in the current era of fierce competition . Enterprises are no longer satisfied with business information system -LRB- s -RRB- ; they require business intelligence system -LRB- s -RRB- . The increasing competitive pressures and the desire to leverage information technology techniques have led many organizations to explore the benefits of new emerging technology , data warehousing and data mining . The paper discusses data warehouses and data mining tools and applications

B I B I O B I B O O O O O O O O O O O O O O O O O O O B I O O O O O O O O B I O O O O O O O O B I O O O O O B O O O O O O O O O O O O O O O O O O O B I I O O O O O O B I O O O O O O O O O O O O O O B I O O O O B O O O O O O O O O O O O B I O O O O B I O B I O O O

business intelligence
competitive advantage
organizations
information technology
knowledge processing
business information system
data warehouses
data mining


Modeling undesirable factors in efficiency evaluation Data envelopment analysis -LRB- DEA -RRB- measures the relative efficiency of decision making units -LRB- DMUs -RRB- with multiple performance factors which are grouped into outputs and inputs . Once the efficient frontier is determined , inefficient DMUs can improve their performance to reach the efficient frontier by either increasing their current output levels or decreasing their current input levels . However , both desirable -LRB- good -RRB- and undesirable -LRB- bad -RRB- factors may be present . For example , if inefficiency exists in production processes where final products are manufactured with a production of wastes and pollutants , the outputs of wastes and pollutants are undesirable and should be reduced to improve the performance . Using the classification invariance property , we show that the standard DEA model can be used to improve the performance via increasing the desirable outputs and decreasing the undesirable outputs . The method can also be applied to situations when some inputs need to be increased to improve the performance . The linearity and convexity of DEA are preserved through our proposal

O O O O B I B I I O O O O O O O O B I I O O O O B I I O O O O O O O O O O B I O O O O O O O O O O O O B I O O O O B I I O O O B I I O O O O O O O O O O O O O O O O O O O O O O O O O B I O O O O O O O O O B O B O O O O B O B O O O O O O O O O O O O O B I I O O O O O O O O O O O O O O O O O O B I O O O B I O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O

data envelopment analysis
decision making units
multiple performance factors
efficient frontier
current output levels
current input levels
production processes
wastes
pollutants
classification invariance property
desirable outputs
undesirable outputs
efficiency evaluation

final product manufacture
linear programming
undesirable factor modeling


Adaptive array antenna based on radial basis function network as multiuser detection for WCDMA An adaptive array antenna is proposed based on the radial basis function -LRB- RBF -RRB- network as a multiuser detector for a WCDMA system . The proposed system calculates the optimal combining weight coefficients using sample matrix inversion with a common correlation matrix algorithm and obtains the channel response vector using the RBF output signal

B I I O O B I I I O B I O O O B I I O O O O O O O O O O O O O O O O O O O O O O O O O O B I I I O B I I O O O B I I O O O B I I O O O O O

adaptive array antenna
radial basis function network
multiuser detection
optimal combining weight coefficients
sample matrix inversion
correlation matrix algorithm
channel response vector

w-cdma
rbf network
wideband code division multiple access


Simple ... But complex FlexPro 5.0 , from Weisang and Co. , is one of those products which aim to serve an often ignored range of data users : those who , in FlexPro 's words , are interested in documenting , analysing and archiving data in the simplest way possible . The online help system is clearly designed to promote the product in this market segment , with a very clear introduction from first principles and a hands-on tutorial , and the live project to which it was applied was selected with this in mind

O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O B I I O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O

flexpro 5.0
data archiving
data analysis
data documentation
hands-on tutorial


What 's best practice for open access ? The business of publishing journals is in transition . Nobody knows exactly how it will work in the future , but everybody knows that the electronic publishing revolution will ensure it wo n't work as it does now . This knowledge has provoked a growing sense of nervous anticipation among those concerned , some edgy and threatened by potential changes to their business , others excited by the prospect of change and opportunity . The paper discusses the open publishing model for dissemination of research

O O O O O B I O O B O O O O O O O O O O O O O O O O O O O O O O O B I O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O B O O O O O O O O O O O O O O O B I I O O O O

open access
electronic publishing
business
open publishing model

journal publishing
research dissemination


Convergence of finite element approximations and multilevel linearization for Ginzburg-Landau model of d-wave superconductors In this paper , we consider the finite element approximations of a recently proposed Ginzburg-Landau-type model for d-wave superconductors . In contrast to the conventional Ginzburg-Landau model the scalar complex valued order-parameter is replaced by a multicomponent complex order-parameter and the free energy is modified according to the d-wave paring symmetry . Convergence and optimal error estimates and some super-convergent estimates for the derivatives are derived . Furthermore , we propose a multilevel linearization procedure to solve the nonlinear systems . It is proved that the optimal error estimates and super-convergence for the derivatives are preserved by the multi-level linearization algorithm

O O O O O O B I O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O B I O O O O O O O O O O O O O O O O O O O O O O O O O O O O O B I O O O O B I O O O O O O O O O O O O O O O O O O B I O

nonlinear systems
free energy
multilevel linearization

ginzburg-landau model
d-wave
superconductivity
finite element method
error estimation
two-grid method


Development and validation of user-adaptive navigation and information retrieval tools for an intranet portal organizational memory information system Based on previous research and properties of organizational memory , a conceptual model for navigation and retrieval functions in an intranet portal organizational memory information system was proposed , and two human-centred features -LRB- memory structure map and history-based tool -RRB- were developed to support user 's navigation and retrieval in a well-known organizational memory . To test two hypotheses concerning the validity of the conceptual model and two human-centred features , an experiment was conducted with 30 subjects . Testing of the two hypotheses indicated the following : -LRB- 1 -RRB- the memory structure map 's users showed 29 % better performance in navigation , and -LRB- 2 -RRB- the history-based tool 's users outperformed by 34 % in identifying information . The results of the study suggest that a conceptual model and two human-centred features could be used in a user-adaptive interface design to improve user 's performance in an intranet portal organizational memory information system

O O O O O O O B I I O O B I B I I I O O O O O O O O O O O B I O O O O O O O B I B I I I O O O O O O O O B I I O O O O O O O O O O O O O O O O O O O O O O O O O O O O B I O O O O O O B O O O O O O O O O O O O O O O O O O O B I I O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O B I O O O O O O O O O O O O O O O O O O O B I B I I I

user-adaptive navigation
human factors
history-based tool
user-adaptive interface design
user performance


International news sites in English Web access to news sites all over the world allows us the opportunity to have an electronic news stand readily available and stocked with a variety of foreign -LRB- to us -RRB- news sites . A large number of currently available foreign sites are English-language publications or English language versions of non-North American sites . These sites are quite varied in terms of quality , coverage , and style . Finding them can present a challenge . Using them effectively requires critical-thinking skills that are a part of media awareness or digital literacy

B I I O O B I O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O B I O B I

web access
international news sites
media awareness
digital literacy

english-language publications
non north american sites
critical-thinking skills


New hub gears up for algorithmic exchange Warwick University in the UK is on the up and up . Sometimes considered a typical 1960s , middle-of-the-road redbrick institution-not known for their distinction the 2001 UK Research Assessment Exercise -LRB- RAE -RRB- shows its research to be the fifth most highly-rated in the country , with outstanding standards in the sciences . This impressive performance has rightly given Warwick a certain amount of muscle , which it is flexing rather effectively , aided by a snappy approach to making things happen that leaves some older institutions standing . The result is a brand new Centre for Scientific Computing -LRB- CSC -RRB- , launched within a couple of years of its initial conception

O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O

warwick university centre for scientific computing


Taming the paper tiger -LSB- paperwork organization -RSB- Generally acknowledged as a critical problem for many information professionals , the massive flow of documents , paper trails , and information needs efficient and dependable approaches for processing and storing and finding items and information

O O O O O B I O O O O O O O O O B I O O O O O O O O O O O O O O O O O O O O O O O O O O

paperwork organization
information professionals

information processing
information storage
information retrieval


48 Gbit/s InP DHBT MS-DFF with very low time jitter A master-slave D-type flip-flop -LRB- MS DFF -RRB- fabricated in a self-aligned InP DHBT technology is presented . The packaged circuit shows full-rate clock operation at 48 Gbit/s . Very low time jitter and good retiming capabilities are observed . Layout aspects , packaging and measurement issues are discussed in particular

O O B O O O O B I I O O O O O O O O O O O O B I I O O O O B I O O O O O O O O O B I I O O B I O O O B I O O O O O O O O O

inp dhbt technology
low time jitter
packaged circuit
retiming capabilities
layout aspects
inp

dhbt ms-dff
master-slave d-type flip-flop
self-aligned dhbt technology
48 gbit/s


Solving the multiple competitive facilities location problem In this paper we propose five heuristic procedures for the solution of the multiple competitive facilities location problem . A franchise of several facilities is to be located in a trade area where competing facilities already exist . The objective is to maximize the market share captured by the franchise as a whole . We perform extensive computational tests and conclude that a two-step heuristic procedure combining simulated annealing and an ascent algorithm provides the best solutions

O O B I I I I O O O O O O B I O O O O O B I I I I O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O B I O O O O O O O O B I O O B I O O O O

facilities franchise
market share maximization
two-step heuristic procedure


Single and multi-interval Legendre tau - methods in time for parabolic equations In this paper , we take the parabolic equation with periodic boundary conditions as a model to present a spectral method with the Fourier approximation in spatial and single/multi-interval Legendre Petrov-Galerkin methods in time . For the single interval spectral method in time , we obtain the optimal error estimate in L/sup 2 / - norm . For the multi-interval spectral method in time , the L/sup 2 / - optimal error estimate is valid in spatial . Numerical results show the efficiency of the methods

O O O O O O O O O O O O O O O O O O O B I O B I I O O O O O O O O O O B I O O O O O O O O O O O O O B I I O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O

parabolic equation
interval spectral method
periodic boundary conditions
fourier approximation

interval decomposition
error analysis
optimal error estimation
legendre petrov-galerkin method
partial differential equations


Boolean operators and the naive end-user : moving to AND Since so few end-users make use of Boolean searching , it is obvious that any effective solution needs to take this reality into account . The most important aspect of a technical solution should be that it does not require any effort on the part of users . What is clearly needed is for search engine designers and programmers to take account of the information-seeking behavior of Internet users . Users must be able to enter a series of words at random and have those words automatically treated as a carefully constructed Boolean AND search statement

B I O O O O O O O O O O O O O O O B I O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O B O O O O O O O O O O O O O O O O O O O O O O O O O O O O

boolean operators
boolean searching
internet

and operator
search engine design
information-seeking behavior


Optimal learning for patterns classification in RBF networks The proposed modifying of the structure of the radial basis function -LRB- RBF -RRB- network by introducing the weight matrix to the input layer -LRB- in contrast to the direct connection of the input to the hidden layer of a conventional RBF -RRB- so that the training space in the RBF network is adaptively separated by the resultant decision boundaries and class regions is reported . The training of this weight matrix is carried out as for a single-layer perceptron together with the clustering process . In this way the network is capable of dealing with complicated problems , which have a high degree of interference in the training data , and achieves a higher classification rate over the current classifiers using RBF

B I O O O O B I O O O O O O O O O O O O O O O O O O O O O O B I O O O O O O O O O O O O O O O O O O O O O O B I O O O O O O O O O O B I O B I O O O O O O O O O O O O O O O O O O O O B I O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O

optimal learning
rbf networks
input layer
training space
decision boundaries
class regions
clustering process

pattern classification
radial basis function network
weight matrix training
single-layer perceptron
classification rate improvement


A transmission line fault-location system using the wavelet transform This paper describes the locating system of line-to-ground faults on a power transmission line by using a wavelet transform . The possibility of the location with the surge generated by a fault has been theoretically proposed . In order to make the method practicable , the authors realize very fast processors . They design the wavelet transform and location chips , and construct a very fast fault location system by processing the measured data in parallel . This system is realized by a computer with three FPGA processor boards on a PCI bus . The processors are controlled by UNIX and the system has a graphical user interface with an X window system

O O O O O O O B I O O O O O O O O O O O O O O O O O B I O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O B I O O O O O O O O O O O O O O O O O O O O O O O O O O O O O B I I O O B I O O O O O O B O O O O O O O O O O B I I

wavelet transform
fpga processor boards
pci bus
unix
x window system

power transmission line fault-location system


Recovering lost efficiency of exponentiation algorithms on smart cards At the RSA cryptosystem implementation stage , a major security concern is resistance against so-called side-channel attacks . Solutions are known but they increase the overall complexity by a non-negligible factor -LRB- typically , a protected RSA exponentiation is 133 % slower -RRB- . For the first time , protected solutions are proposed that do not penalise the running time of an exponentiation

O O O O B I O B I O O B I I I O O O B O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O

smart cards
exponentiation algorithms
rsa cryptosystem implementation stage
security

side-channel attack resistance
public-key encryption


Maple 8 keeps everyone happy The author is impressed with the upgrade to the mathematics package Maple 8 , finding it genuinely useful to scientists and educators . The developments Waterloo Maple class as revolutionary include a student calculus package , and Maplets . The first provides a high-level command set for calculus exploration and plotting -LRB- removing the need to work with , say , plot primitives -RRB- . The second is a package for hand-coding custom graphical user interfaces -LRB- GUIs -RRB- using elements such as check boxes , radio buttons , slider bars and pull-down menus . When called , a Maplet launches a runtime Java environment that pops up a window-analogous to a Java applet-to perform a programmed routine , if required passing the result back to the Maple worksheet

O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O B I I O O O O O O O O O O O O B I O O O O O O O O O O O O O O O O O O O O O O O O O O O O B O O O O O O O O O O O O O O O O O O O O O B O O B I I O O O O O O O O O O O O O O O O O O O O O O O O

student calculus package
calculus exploration
guis
maplet
runtime java environment

maple 8 mathematics package
high-level command set
calculus plotting


Modifier formula on mean square convergence of LMS algorithm In describing the mean square convergence of the LMS algorithm , the update formula based on independence assumption will bring explicit errors , especially when step-size is large . A modifier formula that describes the convergence well , is proposed . Simulations support the proposed formula in different conditions

B I O B I I O B I O O O B I I O O B I O O B I O O B I O O O O O O O O O O O O B I O O O O O O O O O O O O O O O O O

lms algorithm
mean square convergence
update formula
independence assumption
modifier formula


Electronic books : reports of their death have been exaggerated E-books will survive , but not in the consumer market - at least not until reading devices become much cheaper and much better in quality -LRB- which is not likely to happen soon -RRB- . Library Journal 's review of major events of the year 2001 noted that two requirements for the success of E-books were development of a sustainable business model and development of better reading devices . The E-book revolution has therefore become more of an evolution . We can look forward to further developments and advances in the future

B I O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O B I O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O


One structure for fractional delay filter with small number of multipliers A wide-bandwidth , high-resolution fractional delay filter -LRB- FDF -RRB- structure with a small number of multipliers per output sample and a short coefficient computing time is presented . The proposal is based on the use of a frequency FDF design method up to only half of the Nyquist frequency , in a multirate structure

O O O B I I O O O O B O O O O B I I O O O O O O O O O B O O O O O B I I I O O O O O O O O O O O O O O O O O O O O O O O O O O O B I

fractional delay filter
multipliers
short coefficient computing time
multirate structure

wide-bandwidth filter
high-resolution filter
finite impulse response filter
fir filter
frequency domain design method


Rate allocation for video transmission over lossy correlated networks A novel rate allocation algorithm for video transmission over lossy networks subject to bursty packet losses is presented . A Gilbert-Elliot model is used at the encoder to drive the selection of coding parameters . Experimental results using the H. 26L test model show a significant performance improvement with respect to the assumption of independent packet losses

O O O B I O B I I O O B I I O B I O O O O O B I I O O O O O O O O O O O O O O O O B I O O O O O O O O O O O O O O O O O O O O O O O

rate allocation algorithm
video transmission
lossy correlated networks
bursty packet losses
coding parameters

gilbert-elliot model
h.26l test model
video coding


Genetic algorithm for input/output selection in MIMO systems based on controllability and observability indices A time domain optimisation algorithm using a genetic algorithm in conjunction with a linear search scheme has been developed to find the smallest or near-smallest subset of inputs and outputs to control a multi-input-multi-output system . Experimental results have shown that this proposed algorithm has a very fast convergence rate and high computation efficiency

B I O O O O B I O O O O B I O B I I I O O B I O O O O B I I O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O B I I O O B I I

genetic algorithm
mimo systems
observability indices
time domain optimisation algorithm
linear search scheme
very fast convergence
high computation efficiency

input/output selection
controllability indices
near-smallest subset
smallest subset
multi-input-multi-output system
multivariable control systems


The chemical brotherhood It has always been more difficult for chemistry to keep up in the Internet age but a new language could herald a new era for the discipline . The paper discusses CML , or chemical mark-up language . The eXtensible Mark-up Language provides a universal format for structured documents and data on the Web and so offers a way for scientists and others to carry a wide range of information types across the net in a transparent way . All that is needed is an XML browser

O O O O O O O O O O B O O O O O B O O O O O O O O O O O O O O O O O B O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O B I

chemical mark-up language
extensible mark-up language
structured document format
world wide web


The development and evaluation of a fuzzy logic expert system for renal transplantation assignment : Is this a useful tool ? Allocating donor kidneys to patients is a complex , multicriteria decision-making problem which involves not only medical , but also ethical and political issues . In this paper , a fuzzy logic expert system approach was proposed as an innovative way to deal with the vagueness and complexity faced by medical doctors in kidney allocation decision making . A pilot fuzzy logic expert system for kidney allocation was developed and evaluated in comparison with two existing allocation algorithms : a priority sorting system used by multiple organ retrieval and exchange -LRB- MORE -RRB- in Canada and a point scoring systems used by united network for organ sharing -LRB- UNOS -RRB- in US . Our simulated experiment based on real data indicated that the fuzzy logic system can represent the expert 's thinking well in handling complex tradeoffs , and overall , the fuzzy logic derived recommendations were more acceptable to the expert than those from the MORE and UNOS algorithms

O O O O O O B I I I O B I I O O O O O O O O B I O O O O O O O O O O O O O O O O O O O O O O O O O O O B I I I O O O O O O O O O O O O O O O O O O O B I I I O O O B I I I O O O O O O O O O O O O O O O O B I I O O O O O O O O O O O O O O B I I O O B I I I I O O O O O O O B I O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O

renal transplantation assignment
fuzzy logic expert system
donor kidneys
kidney allocation decision making
priority sorting system
point scoring systems
united network for organ sharing
simulated experiment

multicriteria decision-making problem
multiple organ retrieval exchange
complex tradeoff handling


Wavelet collocation methods for a first kind boundary integral equation in acoustic scattering In this paper we consider a wavelet algorithm for the piecewise constant collocation method applied to the boundary element solution of a first kind integral equation arising in acoustic scattering . The conventional stiffness matrix is transformed into the corresponding matrix with respect to wavelet bases , and it is approximated by a compressed matrix . Finally , the stiffness matrix is multiplied by diagonal preconditioners such that the resulting matrix of the system of linear equations is well conditioned and sparse . Using this matrix , the boundary integral equation can be solved effectively

O O O O O O O B I I O B I O O O O O O B I O O B I I O O O O B I I O O O O O O O O B I O O O B I O O O O O O O O O O O O O O O O O O O O O O O O B I O O O O O O O O O O O O O O B I O O O O O O O O O O O B I I O O O O

piecewise constant collocation
wavelet algorithm
boundary element solution
boundary integral equation
acoustic scattering
stiffness matrix
linear equations

first kind integral operators
wavelet transform
computational complexity