Establishing an urban digital cadastre : analytical reconstruction of parcel boundaries A new method for generating a spatially accurate , legally supportive and operationally efficient cadastral database of the urban cadastral reality is described . The definition and compilation of an accurate cadastral database -LRB- achieving a standard deviation smaller than 0.1 m -RRB- is based on an analytical reconstruction of cadastral boundaries rather than on the conventional field reconstruction process . The new method is based on GPS control points and traverse networks for providing the framework ; the old field books for defining the links between the various original ground features ; and a geometrical and cadastral adjustment process as the conceptual basis . A pilot project that was carried out in order to examine and evaluate the new method is described

O O B I I O B I O B 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 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 B I I O O O O O O O B I I O B I O O O O O O B I I 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 O O O O O O O O O O O O

urban digital cadastre
analytical reconstruction
parcel boundaries
urban cadastral reality
standard deviation
field reconstruction process
gps control points
traverse networks
old field books
ground features
cadastral adjustment process

spatially accurate cadastral database
land information systems
lis
geographic information systems


Parcel boundary identification with computer-assisted boundary overlay process for Taiwan The study investigates the design of a process for parcel boundary identification with cadastral map overlay using the principle of least squares . The objective of this research is to provide an objective tool for boundary identification survey . The proposed process includes an adjustment model , a weighting scheme , and other related operations . A numerical example is included

B I I O O O O O O B O 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 B I O B I I O O O O O O B I O O B I O O O O O O O O O O O

parcel boundary identification
taiwan
cadastral map overlay
objective tool
boundary identification survey
adjustment model
weighting scheme

computer assisted boundary overlay process


Exploiting structure in quantified formulas We study the computational problem `` find the value of the quantified formula obtained by quantifying the variables in a sum of terms . '' The `` sum '' can be based on any commutative monoid , the `` quantifiers '' need only satisfy two simple conditions , and the variables can have any finite domain . This problem is a generalization of the problem `` given a sum-of-products of terms , find the value of the sum '' studied by R.E. Stearns and H.B. Hunt III -LRB- 1996 -RRB- . A data structure called a `` structure tree '' is defined which displays information about `` subproblems '' that can be solved independently during the process of evaluating the formula . Some formulas have `` good '' structure trees which enable certain generic algorithms to evaluate the formulas in significantly less time than by brute force evaluation . By `` generic algorithm , '' we mean an algorithm constructed from uninterpreted function symbols , quantifier symbols , and monoid operations . The algebraic nature of the model facilitates a formal treatment of `` local reductions '' based on the `` local replacement '' of terms . Such local reductions `` preserve formula structure '' in the sense that structure trees with nice properties transform into structure trees with similar properties . These local reductions can also be used to transform hierarchical specified problems with useful structure into hierarchically specified problems having similar structure

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 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 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 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 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 B I I O O O

quantified formulas
commutative monoid
data structure
structure tree
generic algorithms
function symbols
quantifier symbols
monoid operations
hierarchically specified problems

structure exploitation
satisfiability problems
constraint satisfaction problems
dynamic programming
computational complexity


Fuzzy logic controlled shunt active power filter for power quality improvement The simulation and experimental study of a fuzzy logic controlled , three-phase shunt active power filter to improve power quality by compensating harmonics and reactive power required by a nonlinear load is presented . The advantage of fuzzy control is that it is based on a linguistic description and does not require a mathematical model of the system . The fuzzy control scheme is realised on an inexpensive dedicated micro-controller -LRB- INTEL 8031 -RRB- based system . The compensation process is based on sensing line currents only , an approach different from conventional methods , which require harmonics or reactive volt-ampere requirement of the load . The performance of the fuzzy logic controller is compared with a conventional PI controller . The dynamic behavior of the fuzzy controller is found to be better than the conventional PI controller . PWM pattern generation is based on carrierless hysteresis based current control to obtain the switching signals . Various simulation and experimental results are presented under steady state and transient conditions

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 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 B I I O O O B I I I I O O O B I O O O O O O O O O O O O O O

three-phase shunt active power filter
harmonics compensation
reactive power compensation
micro-controller
fuzzy logic control simulation
control performance


Software Technology : looking for quality accountants Software Technology wants to turn 23 years of reselling experience in the legal business into an asset in the accounting market

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

software technology
reselling
accounting market


The role of B2B engines in B2B integration architectures Semantic B2B integration architectures must enable enterprises to communicate standards-based B2B events like purchase orders with any potential trading partner . This requires not only back end application integration capabilities to integrate with e.g. enterprise resource planning -LRB- ERP -RRB- systems as the company-internal source and destination of B2B events , but also a capability to implement every necessary B2B protocol like electronic data interchange -LRB- EDI -RRB- , RosettaNet as well as more generic capabilities like Web services -LRB- WS -RRB- . This paper shows the placement and functionality of B2B engines in semantic B2B integration architectures that implement a generic framework for modeling and executing any B2B protocol . A detailed discussion shows how a B2B engine can provide the necessary abstractions to implement any standard-based B2B protocol or any trading partner specific specialization

O O O B I O O O O B I I I 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 B O O B O O O O O O O B I O O O O O O O O O O O O B I O B I I 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 O O O O O O O O B I O O

b2b engines
semantic b2b integration architectures
purchase orders
trading partner
edi
rosettanet
web services
modeling

standards-based b2b event communication
erp systems


Performance , design and control of a series-parallel -LRB- CL/sup 2 / - type -RRB- resonant DC/DC converter The three-element resonant network has various topological alternatives , one of which , a prospective compound topology , is investigated in detail . The converter uses one capacitor -LRB- C -RRB- and two inductors -LRB- L/sup 2 / -RRB- , to form a compound type CL/sup 2 / network . Various advantages and limitations of the converter are detailed , and a new design procedure for such converters is also introduced . The converter may be controlled by varying the switching frequency or by pulse-width modulation . An experimental prototype has been produced and an excellent performance in the lagging power-factor mode has been confirmed

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 B 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 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 B O O O O O O O O

capacitor
inductors
design procedure
switching frequency
performance

series-parallel resonant dc/dc power converter


The XML typechecking problem When an XML document conforms to a given type -LRB- e.g. a DTD or an XML schema type -RRB- it is called a valid document . Checking if a given XML document is valid is called the validation problem , and is typically performed by a parser -LRB- hence , validating parser -RRB- , more precisely it is performed right after parsing , by the same program module . In practice however , XML documents are often generated dynamically , by some program : checking whether all XML documents generated by the program are valid WRT a given type is called the typechecking problem . While a validation analyzes an XML document , a type checker analyzes a program , and the problem 's difficulty is a function of the language in which that program is expressed . The XML typechecking problem has been investigated recently and the XQuery Working Group adopted some of these techniques for typechecking XQuery . All these techniques , however , have limitations which need to be understood and further explored and investigated . We define the XML typechecking problem , and present current approaches to typechecking , discussing their limitations

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 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 O O O O O O O O O O O O O O O O O O O O O O O O O O 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 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 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 O O O O O O O O O O O

xml typechecking problem
xml document
validation
xquery


The n-tier hub technology During 2001 , the Enterprise Engineering Laboratory at George Mason University was contracted by the Boeing Company to develop an eHub capability for aerospace suppliers in Taiwan . In a laboratory environment , the core technology was designed , developed , and tested , and now a large first-tier aerospace supplier in Taiwan is commercializing the technology . The project objective was to provide layered network and application services for transporting XML-based business transaction flows across multi-tier , heterogeneous data processing environments . This paper documents the business scenario , the eHub application , and the network transport mechanisms that were used to build the n-tier hub . In contrast to most eHubs , this solution takes the point of view of suppliers , pushing data in accordance with supplier requirements ; hence , enhancing the probability of supplier adoption . The unique contribution of this project is the development of an eHub that meets the needs of small and medium enterprises -LRB- SMEs -RRB- and first-tier suppliers

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 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 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 B I 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 B I 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

aerospace suppliers
boeing company
taiwan
business scenario
network transport mechanisms
supplier adoption
small and medium enterprises

multi-tier heterogeneous data processing environments


A formal model of correctness in a cadastre A key issue for cadastral systems is the maintenance of their correctness . Correctness is defined to be the proper correspondence between the valid legal situation and the content of the cadastre . This correspondence is generally difficult to achieve , since the cadastre is not a complete representation of all aspects influencing the legal situation in reality . The goal of the paper is to develop a formal model comprising representations of the cadastre and of reality that allows the simulation and investigation of cases where this correspondence is potentially violated . For this purpose the model consists of two parts , the first part represents the valid legal situation and the second part represents the cadastre . This makes it feasible to mark the differences between reality and the cadastre . The marking together with the two parts of the model facilitate the discussion of issues in `` real-world '' cadastral systems where incorrectness occurs . In order to develop a formal model , the paper uses the transfer of ownership of a parcel between two persons as minimal case study . The foundation for the formalization is a modern version of the situation calculus . The focus moves from the analysis of the cadastre to the preparation of a conceptual and a formalized model and the implementation of a prototype

O B I O O O O B 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 B O 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 O 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 B I O O O O O O B 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 B I 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 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 B O O O O O O O O B I O O O O O O

cadastre
cadastral systems
legal situation
formal model
transfer of ownership
minimal case study
situation calculus
formalized model

formal correctness model
correctness maintenance


Business data management for business-to-business electronic commerce Business-to-business electronic commerce -LRB- B2B EC -RRB- opens up new possibilities for trade . For example , new business partners from around the globe can be found , their offers can be compared , even complex negotiations can be conducted electronically , and a contract can be drawn up and fulfilled via an electronic marketplace . However , sophisticated data management is required to provide such facilities . In this paper , the results of a multi-national project on creating a business-to-business electronic marketplace for small and medium-sized enterprises are presented . Tools for information discovery , protocol-based negotiations , and monitored contract enactment are provided and based on a business data repository . The repository integrates heterogeneous business data with business communication . Specific problems such as multilingual nature , data ownership , and traceability of contracts and related negotiations are addressed and it is shown that the present approach provides efficient business data management for B2B EC

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 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 B I O O O O O B I I O O O O O O B I I O O O O B I I 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 O O O O O O O B I I O O O

business data management
electronic marketplace
information discovery
monitored contract enactment
business data repository
heterogeneous business data
business communication
data ownership
traceability


Supply chain infrastructures : system integration and information sharing The need for supply chain integration -LRB- SCI -RRB- methodologies has been increasing as a consequence of the globalization of production and sales , and the advancement of enabling information technologies . In this paper , we describe our experience with implementing and modeling SCIs . We present the integration architecture and the software components of our prototype implementation . We then discuss a variety of information sharing methodologies . Then , within the framework of a multi-echelon supply chain process model spanning multiple organizations , we summarize research on the benefits of intraorganizational knowledge sharing , and we discuss performance scalability

B I I O B I O B I O O O B I I O O O O O O O O O O O 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 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 B I O O O O O O O O B I I O O O O B I

supply chain integration
supply chain infrastructures
system integration
information sharing
globalization
production
sales
software components
multiple organizations
intraorganizational knowledge sharing
performance scalability


On the expected value of the minimum assignment The minimum k-assignment of an m * n matrix X is the minimum sum of k entries of X , no two of which belong to the same row or column . Coppersmith and Sorkin conjectured that if X is generated by choosing each entry independently from the exponential distribution with mean 1 , then the expected value of its minimum k-assignment is given by an explicit formula , which has been proven only in a few cases . In this paper we describe our efforts to prove the Coppersmith-Sorkin conjecture by considering the more general situation where the entries x/sub ij / of X are chosen independently from different distributions . In particular , we require that x/sub ij / be chosen from the exponential distribution with mean 1/r/sub i/c/sub j / . We conjecture an explicit formula for the expected value of the minimum k-assignment of such X and give evidence for this formula

O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O 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 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

minimum k-assignment
m * n matrix
rational function
bipartite graph


Semantic B2B integration : issues in ontology-based approaches Solving queries to support e-commerce transactions can involve retrieving and integrating information from multiple information resources . Often , users do n't care which resources are used to answer their query . In such situations , the ideal solution would be to hide from the user the details of the resources involved in solving a particular query . An example would be providing seamless access to a set of heterogeneous electronic product catalogues . There are many problems that must be addressed before such a solution can be provided . In this paper , we discuss a number of these problems , indicate how we have addressed these and go on to describe the proof-of-concept demonstration system we have developed

B I I O O O O O O B 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 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 O O O O O O O O O O O O O O O O O O O O O O O O O O O O

e-commerce transactions
information integration
information retrieval
ontology-based approaches


Anticipating the further development of cadastral systems Although the paper recognises the merits of the evolution of cadastral systems towards an increased capability over time , it promotes a radical introduction or overhaul of existing cadastral systems . It encourages the development of a capability to cope with some key drivers of major change . These have been identified as globalisation , the advent of fully automated cadastral environments , improved decentralised methods of governance and greatly improved service delivery of future cadastral systems to a wide range of users . The paper promotes the registration of title supported by government guarantee as an effective means for rapidly introducing cadastral systems to facilitate globally competitive land markets in developing countries . In developing automated environments for cadastral systems , the need to completely re-engineer and redesign cadastral systems to meet basic cadastral principles and responsiveness to individual user needs is promoted . In this environment , highly decentralised cadastral operations and administration combined with light regulatory control are advocated as a future governance strategy . With regard to the level of services to users , an emphasis on recognising and serving the future needs of users is seen as essential . International and national professional and user organisations involved in land administration are seen as an important vehicle for developing strategies and providing evaluation to guide the over-arching development of cadastral systems around the world

O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O 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 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 B I O O O O O O O O O O O B I I I O B I 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 B I O O O O O O O B I I I O O O O B I 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 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

cadastral systems development
decentralised governance
future user needs
professional organisations


Asymptotic analysis of -LRB- 3 , 2 , 1 -RRB- - Shell Sort We analyze the -LRB- 3 , 2 , 1 -RRB- - Shell Sort algorithm under the usual random permutation model

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

shell sort
algorithm
random permutation
asymptotic analysis

sorting
moderate-sized lists
additive functional
local limit theorem
markov chain
poissonization


Property testers for dense Constraint Satisfaction programs on finite domains Many NP-hard languages can be `` decided '' in subexponential time if the definition of `` decide '' is relaxed only slightly . Rubinfeld and Sudan introduced the notion of property testers , probabilistic algorithms that can decide , with high probability , if a function has a certain property or if it is far from any function having this property . Goldreich , Goldwasser , and Ron constructed property testers with constant query complexity for dense instances of a large class of graph problems . Since many graph problems can be viewed as special cases of the Constraint Satisfaction Problem on Boolean domains , it is natural to try to construct property testers for more general cases of the Constraint Satisfaction Problem . In this paper , we give explicit constructions of property testers using a constant number of queries for dense instances of Constraint Satisfaction Problems where the constraints have constant arity and the variables assume values in some domain of finite size

B I 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 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 O O B I O B I I O B I O O O O O B I 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 B I 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 B I O B I O O O O O O O O O O O O O O O O O O

property testers
probabilistic algorithms
constant query complexity
constraint satisfaction
dense instances
subexponential time
graph problems

np-hard languages
randomized sampling
constraint satisfaction problem


Fast , accurate and stable simulation of power electronic systems using virtual resistors and capacitors Simulation of power electronic circuits remains a problem due to the high level of stiffness brought about by the modelling of switches as biresistors i.e. very low turn-on resistance and very high turn-off resistance . The merits and drawbacks of two modelling methods that address this problem are discussed . A modelling solution for ensuring numerically stable , accurate and fast simulation of power electronic systems is proposed . The solution enables easy connectivity between power electronic elements in the simulation model . It involves the modelling of virtual capacitance at switching nodes to soften voltage discontinuity due to the switch current suddenly going to zero . Undesirable ringing effects that may arise due to the interaction between the virtual capacitance and circuit inductance are eliminated by modelling virtual damping resistors in parallel to inductors that are adjacent to switching elements . A midpoint configuration method is also introduced for modelling shunt capacitors . A DC traction system is simulated using this modelling strategy and the results are included . Simulation results obtained using this modelling strategy are validated by comparison with the established mesh analysis technique of modelling . The simulation performance is also compared with the Power System Blockset commercial software

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 O O O O O O 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 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 O O O O O O O O O O O O O O O O

virtual resistors
switching nodes
ringing effects
dc traction system
mesh analysis technique

power electronic systems simulation
virtual capacitors
turn-on resistance
high turn-off resistance
switch modelling
voltage discontinuity softening
power system blockset software
computer simulation


Bandwidth vs. gains design of H/sub infinity / tracking controllers for current-fed induction motors Describes a systematic procedure for designing speed and rotor flux norm tracking H/sub infinity / . controllers with unknown load torque disturbances for current-fed induction motors . A new effective design tool is developed to allow selection of the control gains so as to adjust the disturbances ' rejection capability of the controllers in the face of the bandwidth requirements of the closed-loop system . Application of the proposed design procedure is demonstrated in a case study , and the results of numerical simulations illustrate the satisfactory performance achievable even in presence of rotor resistance uncertainty

O O O O O O O O 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 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 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

unknown load torque disturbances
design tool
bandwidth requirements

h/sub infinity / tracking controllers
current-fed induction motors
speed controllers
rotor flux norm controllers
disturbances rejection capability
closed-loop system
feedback linearization
observers


Decentralized adaptive output feedback stabilization for a class of interconnected systems with unknown bound of uncertainties The problem of adaptive decentralized stabilization for a class of linear time-invarying large-scale systems with nonlinear interconnectivity and uncertainties is discussed . The bounds of uncertainties are assumed to be unknown . For such uncertain dynamic systems , an adaptive decentralized controller is presented . The resulting closed-loop systems are asymptotically stable in theory . Moreover , an adaptive decentralized control scheme is given . The scheme ensures the closed-loop systems exponentially practically stable and can be used in practical engineering . Finally , simulations show that the control scheme is effective

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 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

adaptive decentralized stabilization
uncertain dynamic systems

closed-loop systems
robust control
large scale systems


Cultural differences in developers ' perceptions of information systems success factors : Japan vs. the United States The study examined the perceptions of information systems -LRB- IS -RRB- developers from Japan and the United States regarding the strategies that are considered most important for successful implementation of an IS . The results of principal component analysis revealed that the IS strategies could be reduced to five components : -LRB- 1 -RRB- characteristics of the team members , -LRB- 2 -RRB- characteristics of the project leader , -LRB- 3 -RRB- management/user input , -LRB- 4 -RRB- proper technology , and -LRB- 5 -RRB- communication . The results indicated that there was a significant difference in the perceptions of Japanese and US developers with respect to the importance of the five components . Japanese developers perceived the project leader as the most crucial component for determining the success of an IS project . Team member characteristics was viewed as the least important by Japanese developers . On the other hand , developers from the US viewed communications as the most critical component . Project leader characteristics were perceived to be the least important by US developers . The results were discussed in terms of cultural differences

B I O O O O O B I I I O B O O B I O O O O O O O O O O O O O B O O B 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 O O O O O 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 O O O O O O O O O O O O O O O O O O O O O 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 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 O O O O O O O O O O O O O O O O O O B I

cultural differences
information systems success factors
japan
united states
principal component analysis
team member characteristics
project leader characteristics
proper technology
communication
is project

information systems developer perceptions


Stability and L/sub 2 / gain properties of LPV systems Stability and L/sub 2 / gain properties of linear parameter-varying systems are obtained under assumed bounds on either the maximum or average value of the parameter rate

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 O O O O O O O O O O B I

l/sub 2/ gain properties
linear parameter-varying systems
gromwall-bellman inequality
gain scheduled control


A phytography of WALDMEISTER The architecture of the WALDMEISTER prover for unit equational deduction is based on a strict separation of active and passive facts . After an inspection of the system 's proof procedure , the representation of each of the central data structures is outlined , namely indexing for the active facts , compression for the passive facts , successor sets for the hypotheses , and minimal recording of inference steps for the proof object . In order to cope with large search spaces , specialized redundancy criteria are employed , and the empirically gained control knowledge is integrated to ease the use of the system . The paper concludes with a quantitative comparison of the WALDMEISTER versions over the years , and a view of the future prospects

O B O B O O O O B O 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 B I O O O O B O O B I O O O O B I O O O O O B O O O O O B O O O O O O O O O O O B I 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 B O O O O O O O O O O B I

waldmeister
unit equational deduction
passive facts
active facts
data structures
indexing
hypotheses
phytography
inference
large search spaces
redundancy
future prospects

theorem prover
cade atp system competition


Practice management goes remote -LSB- accounting -RSB- There 's a lot of life in accounting practice management software , a valuable category that has been subject to much change in the last few years . Web-based time tracking grows in popularity . Looks at CCH ProSystem fx Practice , CMS Open Solutions 6 , Creative Solutions Practice , Time Matters , CPASoftware Visual Practice Management , and Abak

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 O O O O O O O B I I I O B I I I O B I I O B I O B I I I O O B

accounting practice management software
cch prosystem fx practice
cms open solutions 6
creative solutions practice
time matters
cpasoftware visual practice management
abak


On trajectory and force tracking control of constrained mobile manipulators with parameter uncertainty Studies the trajectory and force tracking control problem of mobile manipulators subject to holonomic and nonholonomic constraints with unknown inertia parameters . Adaptive controllers are proposed based on a suitable reduced dynamic model , the defined reference signals and the mixed tracking errors . The proposed controllers not only ensure the entire state of the system to asymptotically converge to the desired trajectory but also ensure the constraint force to asymptotically converge to the desired force . A detailed numerical example is presented to illustrate the developed methods

O O O B I I O B I I O B I O O O O B I I O O O O O O O O B I O O O O O B I O O O O O O B I I 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

force tracking control
constrained mobile manipulators
parameter uncertainty
nonholonomic constraints
adaptive controllers
reduced dynamic model
mixed tracking errors

trajectory control
holonomic constraints
asymptotic convergence
position control
mobile robots


Max and min limiters If A contained in omega , n > or = 2 , and the function max -LRB- -LCB- x/sub 1 / , ... , x/sub n / -RCB- intersection A -RRB- is partial recursive , it is easily seen that A is recursive . In this paper , we weaken this hypothesis in various ways -LRB- and similarly for `` min '' in place of `` max '' -RRB- and investigate what effect this has on the complexity of A . We discover a sharp contrast between retraceable and co-retraceable sets , and we characterize sets which are the union of a recursive set and a co-r.e. , retraceable set . Most of our proofs are noneffective . Several open questions are raised

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 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 O O O O O O O O O O O O O O O O O O O


Observer-based strict positive real -LRB- SPR -RRB- feedback control system design Presents theory for stability analysis and design for a class of observer-based feedback control systems . Relaxation of the controllability and observability conditions imposed in the Yakubovich-Kalman-Popov lemma can be made for a class of nonlinear systems described by a linear time-invariant system with a feedback-connected cone-bounded nonlinear element . It is shown how a circle-criterion approach can be used to design an observer-based state feedback control which yields a closed-loop system with specified robustness characteristics . The approach is relevant for design with preservation of stability when a cone-bounded nonlinearity is introduced in the feedback loop . Important applications are to be found in nonlinear control with high robustness requirements

O O O O O O O O B I 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 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 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

control system design
stability analysis
nonlinear systems
state feedback control
robustness characteristics

observer-based strict positive real feedback control system


Analysis of nonlinear time-delay systems using modules over non-commutative rings The theory of non-commutative rings is introduced to provide a basis for the study of nonlinear control systems with time delays . The left Ore ring of non-commutative polynomials defined over the field of a meromorphic function is suggested as the framework for such a study . This approach is then generalized to a broader class of nonlinear systems with delays that are called generalized Roesser systems . Finally , the theory is applied to analyze nonlinear time-delay systems . A weak observability is defined and characterized , generalizing the well-known linear result . Properties of closed submodules are then developed to obtain a result on the accessibility of such systems

O O O O O O B O B I O O O B I O O O O O O O O O O B I I O O O O O B I I 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 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

modules
noncommutative rings
nonlinear control systems
left ore ring
noncommutative polynomials
meromorphic function
generalized roesser systems
weak observability


Human face detection in visual scenes using neural networks This paper presents a neural network based face detection system . Our objective is to design a system that can detect human faces in visual scenes at high searching speed and accuracy . We used a neural network with a simple structure but trained using face and non-face samples preprocessed by several methods -LRB- position normalization , histogram equalization , etc. -RRB- to attain high accuracy , then pruned the size of the neural network so that it could run faster and reduced the total search area of a target visual scene using the skin color detector . Skin color detection assumes that faces reside only in skin color regions . The system design is made up of two parts : the face detecting system that detects the faces , and the searching speed improving system . Speed improvement is achieved by reducing the face locator network size using the structural learning with knowledge and by reducing the face search area using the skin color detection system . Faster training of the neural networks was also achieved using variable step sizes

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 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 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 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

neural network
visual scene
skin color detector
face detecting system

backpropagation
self organizing maps
down-sampling
human face recognition
merging overlapping detections


TPTP , CASC and the development of a semantically guided theorem prover The first-order theorem prover SCOTT has been through a series of versions over some ten years . The successive provers , while retaining the same underlying technology , have used radically different algorithms and shown wide differences of behaviour . The development process has depended heavily on experiments with problems from the TPTP library and has been sharpened by participation in CASC each year since 1997 . We outline some of the difficulties inherent in designing and refining a theorem prover as complex as SCOTT , and explain our experimental methodology . While SCOTT is not one of the systems which have been highly optimised for CASC , it does help to illustrate the influence of both CASC and the TPTP library on contemporary theorem proving research

O O B O O O O O B I I 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 I 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 B O O O O B I O O B 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 B I O O O O O

tptp library
casc
semantically guided theorem prover
scott
experimental methodology

semantically constrained otter
proof searches
first-order theorem prover


Estimation of an N-L-N Hammerstein-Wiener model Estimation of a single-input single-output block-oriented model is studied . The model consists of a linear block embedded between two static nonlinear gains . Hence , it is called an N-L-N Hammerstein-Wiener model . First , the model structure is motivated and the disturbance model is discussed . The paper then concentrates on parameter estimation . A relaxation iteration scheme is proposed by making use of a model structure in which the error is bilinear-in-parameters . This leads to a simple algorithm which minimizes the original loss function . The convergence and consistency of the algorithm are studied . In order to reduce the variance error , the obtained linear model is further reduced using frequency weighted model reduction . A simulation study is used to illustrate the method

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 B I 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 B I 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 B O B O O O O O O O O O O O B I O O O O O O O O O B I I I O O O O O O O O O O

linear block
static nonlinear gains
model structure
disturbance model
parameter estimation
relaxation iteration scheme
convergence
consistency
variance error
frequency weighted model reduction


Technology in distance education : a global perspective to alternative delivery mechanisms Technology is providing a positive impact on delivery mechanisms employed in distance education at the university level . Some institutions are incorporating distance education as a way to extend the classroom . Other institutions are investigating new delivery mechanisms , which support a revised perspective on education . These latter institutions are revising their processes for interacting with students , and taking a more `` learner centered '' approach to the delivery of education . This article discusses the impact of technology on the delivery mechanisms employed in distance education . A framework is proposed here , which presents a description of alternative modes of generic delivery mechanisms . It is suggested that those institutions , which adopt a delivery mechanism employing an asynchronous mode , can gain the most benefit from technology . This approach seems to represent the only truly innovative use of technology in distance education . The approach creates a student-oriented environment while maintaining high levels of interaction , both of which are factors that contribute to student satisfaction with their overall educational experience

O O B I O O 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 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 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 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

distance education
student satisfaction
global perspective
asynchronous mode

educational technology
university education
learner centered approach


Switching controller design via convex polyhedral Lyapunov functions We propose a systematic switching control design method for a class of nonlinear discrete time hybrid systems . The novelty of the adopted approach is in the fact that unlike conventional control the control burden is shifted to a logical level thus creating the need for the development of new analysis/design methods

B I I O B I I I 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 O O O O O O O

switching controller design
convex polyhedral lyapunov functions
nonlinear discrete time hybrid systems


Tracking with sensor failures Studies the reliability with sensor failures of the asymptotic tracking problem for linear time invariant systems using the factorization approach . The plant is two-output and the compensator is two-degree-of-freedom . Necessary and sufficient conditions are presented for the general problem and a simple solution is given for problems with stable plants

O O B I O O B O B I O O B I I O B I I I O O B I 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

sensor failures
reliability
asymptotic tracking problem
linear time invariant systems
factorization approach
necessary and sufficient conditions

two-output plant
two-degree-of-freedom compensator


Towards the globalisation of the IS/IT function The IS/IT function has recently emerged from the peripheral aspects of the finance department to the centre of critical organisational change . There is an increasing dependency on its activities as systems extend beyond supporting the internal efficiency of the organisation to augmenting global performance . The growth of wide and local networks has resulted in communication possibilities that were not possible a few years ago . E-commerce challenges the achievements of the IS/IT function and is very prominent in the globalisation of modern organisations . The complexity and diversity of electronic exchange is also well documented -LRB- Hackney et al. , 2000 -RRB- . This has a number of impacts on the development and implementation of IS/IT solutions for organisations involved in international trade . It is a conjecture that the IS/IT function is critically important for the alignment of the business to meet the demands of global competition , through building internal marketing strategies and creating knowledge based communities . There is clear evidence that IS/IT can lead to improved business performance and potentially for sustained competitive advantage . This is obviously true through the advent of new and emerging technologies such as the Internet

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 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 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 B I 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 O O O O O O O O O O O B

globalisation
electronic exchange
international trade
internal marketing strategies
knowledge based communities
internet

is/it function
local area networks
wide area networks
e-commerce


Stabilization of positive systems with first integrals Positive systems possessing first integrals are considered . These systems frequently occur in applications . The paper is devoted to two stabilization problems . The first is concerned with the design of feedbacks to stabilize a given level set . Secondly , it is shown that the same feedback allows us to globally stabilize an equilibrium point if it is asymptotically stable with respect to initial conditions in its level set . Two examples are provided and the results are compared with those in the literature

O O B I O B I 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 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

positive systems
first integrals
equilibrium point

feedbacks design
global stabilization
asymptotic stability
chemical reactors


Strong completeness of lattice-valued logic This paper shows strong completeness of the system L for lattice valued logic given by S. Titani -LRB- 1999 -RRB- , in which she formulates a lattice-valued set theory by introducing the logical implication which represents the order relation on the lattice . Syntax and semantics concerned are described and strong completeness is proved

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 B I O O O O B O B O O O O B I O O

strong completeness
order relation
semantics
syntax

lattice-valued set theory
lattice-valued logic


Design of a stroke dependent damper for the front axle suspension of a truck using multibody system dynamics and numerical optimization A stroke dependent damper is designed for the front axle suspension of a truck . The damper supplies extra damping for inward deflections rising above 4 cm . In this way the damper should reduce extreme suspension deflections without deteriorating the comfort of the truck . But the question is which stroke dependent damping curve yields the best compromise between suspension deflection working space and comfort . Therefore an optimization problem is defined to minimize the maximum inward suspension deflection subject to constraints on the chassis acceleration for three typical road undulations . The optimization problem is solved using sequential linear programming -LRB- SLP -RRB- and multibody dynamics simulation software . Several optimization runs have been carried out for a small two degree of freedom vehicle model and a large full-scale model of the truck semi-trailer combination . The results show that the stroke dependent damping can reduce large deflections at incidental road disturbances , but that the optimum stroke dependent damping curve is related to the acceleration bound . By means of vehicle model simulation and numerical optimization we have been able to quantify this trade-off between suspension deflection working space and truck comfort

O O O B I I O O B I I O O O O B I I O B I O B I I O O O O B I I O O O O O O O O B O B I 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 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 O O O B I 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 B O O O O O B I I O O O O O O O B O O O O O B I O O O O B I I O B I O O O O O O O O O O O O O O B I

stroke dependent damper
front axle suspension
multibody system dynamics
numerical optimization
inward deflections
extreme suspension deflections
chassis acceleration
road undulations
sequential linear programming
damping
incidental road disturbances
acceleration bound
vehicle model simulation
truck comfort

full-scale model
truck semi-trailer combination


Information systems project failure : a comparative study of two countries Many organizations , regardless of size , engage in at least one , and often many information system projects each year . Many of these projects consume massive amounts of resources , and may cost as little as a few thousand dollars to ten , and even hundreds of millions of dollars . Needless to say , the investment of time and resources into these ventures are of significant concern to chief information officers -LRB- CIOs -RRB- , executives staff members , project managers , and others in leadership positions . This paper describes the results of a survey performed between Australia and the United States regarding factors leading to IS project failure . The findings suggest that , among other things , end user involvement and executive management leadership are key indicators influencing IS project failure

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 O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O 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 O O O O O O O O O O O O O B I I O B I I O O O O O O O

information systems project failure
australia
united states
end user involvement
executive management leadership


The diameter of a long-range percolation graph We consider the following long-range percolation model : an undirected graph with the node set -LCB- 0 , 1 , ... , N -RCB- / sup d / , has edges -LRB- x , y -RRB- selected with probability approximately = beta / | | x - y | | / sup s / if | | x - y | | > 1 , and with probability 1 if | | x - y | | = 1 , for some parameters beta , s > 0 . This model was introduced by who obtained bounds on the diameter of this graph for the one-dimensional case d = 1 and for various values of s , but left cases s = 1 , 2 open . We show that , with high probability , the diameter of this graph is Theta -LRB- log N/log log N -RRB- when s = d , and , for some constants 0 < eta / sub 1 / < eta / sub 2 / < 1 , it is at most N/sup eta 2 / when s = 2d , and is at least N/sup eta 1 / when d = 1 , s = 2 , beta < 1 or when s > 2d . We also provide a simple proof that the diameter is at most log/sup O -LRB- 1 -RRB- / N with high probability , when d < s < 2d , established previously in Benjamini and Berger -LRB- 2001 -RRB-

O O O O O B O O O O O O B 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 O O O O 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 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 B O O O O O O O O O O O O O O O O O

undirected graph
probability
percolation

long-range percolation model
positive probability
networks
random graph


Tax forms : CD or not CD ? The move from CD to the Web looks unstoppable . Besides counting how many thousands of electronic tax forms they offer , vendors are rapidly moving those documents to the Web

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

atx forms zillion forms
cch perform plus h
kleinrock forms library plus
nelco laserlibrarian ii
ria eform
stf services superform
universal tax systems forms complete


L/sub 2 / model reduction and variance reduction We examine certain variance properties of model reduction . The focus is on L/sub 2 / model reduction , but some general results are also presented . These general results can be used to analyze various other model reduction schemes . The models we study are finite impulse response -LRB- FIR -RRB- and output error -LRB- OE -RRB- models . We compare the variance of two estimated models . The first one is estimated directly from data and the other one is computed by reducing a high order model , by L/sub 2 / model reduction . In the FIR case we show that it is never better to estimate the model directly from data , compared to estimating it via L/sub 2 / model reduction of a high order FIR model . For OE models we show that the reduced model has the same variance as the directly estimated one if the reduced model class used contains the true system

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 O O O O O O O O O O O O O O O O O O O

l/sub 2/ model reduction
finite impulse response models
fir models
output error models
identification


Account aggregation : shaping up portfolios CPA providers of financial planning services are providing clients with a unified view of their investments

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

financial planning services
account aggregation


Closed-loop persistent identification of linear systems with unmodeled dynamics and stochastic disturbances The essential issues of time complexity and probing signal selection are studied for persistent identification of linear time-invariant systems in a closed-loop setting . By establishing both upper and lower bounds on identification accuracy as functions of the length of observation , size of unmodeled dynamics , and stochastic disturbances , we demonstrate the inherent impact of unmodeled dynamics on identification accuracy , reduction of time complexity by stochastic averaging on disturbances , and probing capability of full rank periodic signals for closed-loop persistent identification . These findings indicate that the mixed formulation , in which deterministic uncertainty of system dynamics is blended with random disturbances , is beneficial to reduction of identification complexity

O O O O O O O B I O B I 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 B I O B I O O O O O O O O O O B I O O B I O O O O O O O B I O B I O O O B I 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 O O O O O O O O O O O O O O

unmodeled dynamics
lower bounds
identification accuracy
full rank periodic signals
stochastic disturbances
time complexity
probing signal selection

closed-loop persistent identification
linear time-invariant systems
upper bounds


The dynamics of a railway freight wagon wheelset with dry friction damping We investigate the dynamics of a simple model of a wheelset that supports one end of a railway freight wagon by springs with linear characteristics and dry friction dampers . The wagon runs on an ideal , straight and level track with constant speed . The lateral dynamics in dependence on the speed is examined . We have included stick-slip and hysteresis in our model of the dry friction and assume that Coulomb 's law holds during the slip phase . It is found that the action of dry friction completely changes the bifurcation diagram , and that the longitudinal component of the dry friction damping forces destabilizes the wagon

O B O O B I I I O B 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 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 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 B I O O O O B I O O B I I O O O O

dynamics
railway freight wagon wheelset
dry friction damping
linear characteristics
hysteresis
bifurcation diagram
longitudinal component


Global comparison of stages of growth based on critical success factors With increasing globalization of business , the management of IT in international organizations is faced with the complex task of dealing with the difference between local and international IT needs . This study evaluates , and compares , the level of IT maturity and the critical success factors -LRB- CSFs -RRB- in selected geographic regions , namely , Norway , Australia/New Zealand , North America , Europe , Asia/Pacific , and India . The results show that significant differences in the IT management needs in these geographic regions exist , and that the IT management operating in these regions must balance the multiple critical success factors for achieving an optimal local-global mix for business success

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 B I I 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 B O O O O B I O B O O O O B 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 B I I O O O O O O O B I

it management
international it needs
it maturity
critical success factors
norway
north america
europe
india
business success

business globalization
local it needs
australia
new zealand
asia/pacific
optimal local-global mix


On the distribution of Lachlan nonsplitting bases We say that a computably enumerable -LRB- c.e. -RRB- degree b is a Lachlan nonsplitting base -LRB- LNB -RRB- , if there is a computably enumerable degree a such that a > b , and for any c.e. degrees w , v < or = a , if a < or = wVvV b then either a < or = wV b or a < or = vV b . In this paper we investigate the relationship between bounding and nonbounding of Lachlan nonsplitting bases and the high/low hierarchy . We prove that there is a non-Low/sub 2 / c.e. degree which bounds no Lachlan nonsplitting base

O O O O O O O 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 O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O

lachlan nonsplitting bases distribution
turing degrees


E - a brainiac theorem prover We describe the superposition-based theorem prover E. E is a sound and complete prover for clausal first order logic with equality . Important properties of the prover include strong redundancy elimination criteria , the DISCOUNT loop proof procedure , a very flexible interface for specifying search control heuristics , and an efficient inference engine . We also discuss the strengths and weaknesses of the system

O O O B I I 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 O O O B I I I O O B B I I 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 O O

brainiac theorem prover
clausal first order logic
equality
strong redundancy elimination criteria
discount
loop proof procedure
search control heuristics
inference engine

casc
superposition-based theorem prover
e automatic theorem prover
rewriting
completeness
soundness
cade atp system competitions


Robustness of trajectories with finite time extent The problem of estimating perturbation bounds of finite trajectories is considered . The trajectory is assumed to be generated by a linear system with uncertainty characterized in terms of integral quadratic constraints . It is shown that such perturbation bounds can be obtained as the solution to a nonconvex quadratic optimization problem , which can be addressed using Lagrange relaxation . The result can be used in robustness analysis of hybrid systems and switched dynamical systems

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


An algorithm combining neural networks with fundamental parameters An algorithm combining neural networks with the fundamental parameters equations -LRB- NNFP -RRB- is proposed for making corrections for non-linear matrix effects in x-ray fluorescence analysis . In the algorithm , neural networks were applied to relate the concentrations of components to both the measured intensities and the relative theoretical intensities calculated by the fundamental parameter equations . The NNFP algorithm is compared with the classical theoretical correction models , including the fundamental parameters approach , the Lachance-Traill model , a hyperbolic function model and the COLA algorithm . For an alloy system with 15 measured elements , in most cases , the prediction errors of the NNFP algorithm are lower than those of the fundamental parameters approach , the Lachance-Traill model , the hyperbolic function model and the COLA algorithm separately . If there are the serious matrix effects , such as matrix effects among Cr , Fe and Ni , the NNFP algorithm generally decreased predictive errors as compared with the classical models , except for the case of Cr by the fundamental parameters approach . The main reason why the NNFP algorithm has generally a better predictive ability than the classical theoretical correction models might be that neural networks can better calibrate the non-linear matrix effects in a complex multivariate system

O B O B I O B I O B O B I O O B I O O O O O O O O O O B I I O O O O O O O B O B I O O O O O O O O O O O O B O O O O B O O O O O O O O O B O O O O O B I I O O O B I O O O O O O O B I I O O O B O O O B I 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 O O O O O B I I O O O B O O O O O O O O O O O O O O O B O B O B O O O B 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 O O O O B O O O O O O O O O B I I O O O B I O O O O B I I O O B I I

algorithm
neural networks
fundamental parameters
nonlinear matrix effects
intensities
theoretical correction models
hyperbolic function model
alloy system
cr
fe
ni
complex multivariate system

fundamental parameters equations
x-ray fluorescence analysis
nnfp algorithm
lachance-traill model
cola algorithm


Closed-loop model set validation under a stochastic framework Deals with probabilistic model set validation . It is assumed that the dynamics of a multi-input multi-output -LRB- MIMO -RRB- plant is described by a model set with unstructured uncertainties , and identification experiments are performed in closed loop . A necessary and sufficient condition has been derived for the consistency of the model set with both the stabilizing controller and closed-loop frequency domain experimental data -LRB- FDED -RRB- . In this condition , only the Euclidean norm of a complex vector is involved , and this complex vector depends linearly on both the disturbances and the measurement errors . Based on this condition , an analytic formula has been derived for the sample unfalsified probability -LRB- SUP -RRB- of the model set . Some of the asymptotic statistical properties of the SUP have also been briefly discussed . A numerical example is included to illustrate the efficiency of the suggested method in model set quality evaluation

O O O O O O B I 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 B I 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 B I 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 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 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

stochastic framework
probabilistic model set validation
unstructured uncertainties
necessary and sufficient condition
stabilizing controller
euclidean norm
complex vector
asymptotic statistical properties


Doubly invariant equilibria of linear discrete-time games The notion of doubly invariant -LRB- DI -RRB- equilibrium is introduced . The concept extends controlled and robustly controlled invariance notions to the context of two-person dynamic games . Each player tries to keep the state in a region of state space independently of the actions of the rival player . The paper gives existence conditions , criteria and algorithms for the determination of DI equilibria of linear dynamic games in discrete time . Two examples illustrate the results . The first one is in the area of fault-tolerant controller synthesis . The second is an application to macroeconomics

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 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 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 B

doubly invariant equilibria
robustly controlled invariance
state space
existence conditions
macroeconomics

linear discrete-time games
two-person dynamic games
fault-tolerant controller synthesis


The development of CASC -LSB- automated theorem proving -RSB- Researchers who make theoretical advances also need some way to demonstrate that an advance really does have general , overall positive consequences for system performance . For this it is necessary to evaluate the system on a set of problems that is sufficiently large and diverse to be somehow representative of the intended application area as a whole . It is only a small step from system evaluation to a communal system competition . The CADE ATP System Competition -LRB- CASC -RRB- has been run annually since 1996 . Any competition is difficult to design and organize in the first instance , and to then run over the years . In order to obtain the full benefits of a competition , a thoroughly organized event , with an unambiguous and motivated design , is necessary . For some issues relevant to the CASC design , inevitable constraints have emerged . For other issues there have been several choices , and decisions have had to be made . This paper describes the evolution of CASC , paying particular attention to its design , design changes , and organization

O O O B 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 O O O O O O O O O O O O B I O O O O O O O B I I I 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 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

casc
system performance
system evaluation
cade atp system competition
automated theorem proving

automated deduction
ai
artificial intelligence
classical first order logic


On the design of gain-scheduled trajectory tracking controllers -LSB- AUV application -RSB- A new methodology is proposed for the design of trajectory tracking controllers for autonomous vehicles . The design technique builds on gain scheduling control theory . An application is made to the design of a trajectory tracking controller for a prototype autonomous underwater vehicle -LRB- AUV -RRB- . The effectiveness and advantages of the new control laws derived are illustrated in simulation using a full set of non-linear equations of motion of the vehicle

O 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 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 B I O O O O O O O O O O B I I I O O O

autonomous vehicles
gain scheduling control theory
autonomous underwater vehicle
control laws
nonlinear equations of motion

gain-scheduled trajectory tracking controller design


Control of a thrust-vectored flying wing : a receding horizon - LPV approach This paper deals with the application of receding horizon methods to hover and forward flight models of an experimental tethered flying wing developed at Caltech . The dynamics of the system are representative of a vertical landing and take off aircraft , such as a Harrier around hover , or a thrust-vectored aircraft such as F18-HARV or X-31 in forward flight . The adopted control methodology is a hybrid of receding horizon techniques and control Lyapunov function -LRB- CLF -RRB- - based ideas . First , a CLF is generated using quasi-LPV methods and then , by using the CLF as the terminal cost in the receding horizon optimization , stability is guaranteed . The main advantage of this approach is that stability can be guaranteed without imposing constraints in the on-line optimization , allowing the problem to be solved in a more efficient manner . Models of the experimental set-up are obtained for the hover and forward flight modes . Numerical simulations for different time horizons are presented to illustrate the effectiveness of the discussed methods . Specifically , it is shown that a mere upper bound on the cost-to-go is not an appropriate choice for a terminal cost , when the horizon length is short . Simulation results are presented using experimentally verified model parameters

O O 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 B I I O O B 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 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 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 O O O O 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 O O O O O O O O O O

forward flight models
tethered flying wing
caltech
harrier around hover
receding horizon techniques
receding horizon optimization
numerical simulations
terminal cost

thrust-vectored flying wing control
receding horizon-lpv approach
hover flight models
vertical landing take off aircraft
thrust-vectored aircraft
f18-harv
x-31
control lyapunov function-based ideas
quasi-lpv methods
stability guarantee
nonlinear system


Engineering plug-in software components to support collaborative work Many software applications require co-operative work support , including collaborative editing , group awareness , versioning , messaging and automated notification and co-ordination agents . Most approaches hard-code such facilities into applications , with fixed functionality and limited ability to reuse groupware implementations . We describe our recent work in seamlessly adding such capabilities to component-based applications via a set of collaborative work-supporting plug-in software components . We describe a variety of applications of this technique , along with descriptions of the novel architecture , user interface adaptation and implementation techniques for the collaborative work-supporting components that we have developed . We report on our experiences to date with this method of supporting collaborative work enhancement of component-based systems , and discuss the advantages of our approach over conventional techniques

O O O O O O O O O B I O O O O O O B I O B I O B O B 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 O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O

software applications
collaborative editing
group awareness
versioning
messaging
automated notification
groupware

co-operative work support
plug-in software components
collaborative work tools


Sliding mode dynamics in continuous feedback control for distributed discrete-event scheduling A continuous feedback control approach for real-time scheduling of discrete events is presented motivated by the need for control theoretic techniques to analyze and design such systems in distributed manufacturing applications . These continuous feedback control systems exhibit highly nonlinear and discontinuous dynamics . Specifically , when the production demand in the manufacturing system exceeds the available resource capacity then the control system `` chatters '' and exhibits sliding modes . This sliding mode behavior is advantageously used in the scheduling application by allowing the system to visit different schedules within an infinitesimal region near the sliding surface . In the paper , an analytical model is developed to characterize the sliding mode dynamics . This model is then used to design controllers in the sliding mode domain to improve the effectiveness of the control system to `` search '' for schedules with good performance . Computational results indicate that the continuous feedback control approach can provide near-optimal schedules and that it is computationally efficient compared to existing scheduling techniques

B I 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 B I I O O 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 B 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 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 B I I O O O O O O O O O O O O O O O O

sliding mode dynamics
continuous feedback control
control theoretic techniques
distributed manufacturing applications
production demand
resource capacity

distributed discrete-event scheduling
real-time scheduling
highly nonlinear discontinuous dynamics


Optimization-based design of fixed-order controllers for command following For discrete-time scalar systems , we propose an approach for designing feedback controllers of fixed order to minimize an upper bound on the peak magnitude of the tracking error to a given command input . The work makes use of linear programming to design over a class of closed-loop systems proposed for the rejection of non-zero initial conditions and bounded disturbances . We incorporate performance robustness in the form of a guaranteed upper bound on the peak magnitude of the tracking error under plant coprime factor uncertainty

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 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 O O O B I O O O O O B I I O O O O O O B I O O B I I

command following
feedback controllers
tracking error
linear programming
performance robustness
guaranteed upper bound
coprime factor uncertainty

optimization-based design
fixed-order controllers
discrete-time scalar systems
closed-loop systems


Strong and weak points of the MUSCADET theorem prover-examples from CASC-JC MUSCADET is a knowledge-based theorem prover based on natural deduction . It has participated in CADE Automated theorem proving System Competitions . The results show its complementarity with regard to resolution-based provers . This paper presents some of its crucial methods and gives some examples of MUSCADET proofs from the last competition -LRB- CASC-JC in IJCAR 2001 -RRB-

O O O O O O B O O O O B O O O O O O O B I O O O O 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 O O O O O O O B O O O O O O O O O O O

cade automated theorem proving system competitions

casc-jc
knowledge-based theorem prover
resolution-based provers


Sampled-data implementation of a gain scheduled controller A continuous-time gain-scheduled controller must be transformed to a corresponding discrete-time controller for sampled-data implementation . We show that certain linearization properties of a continuous-time gain scheduled controller are inherited by its sampled-data implementation . We also show that a similar relationship exists for multi-rate gain scheduled controllers arising in flight control applications

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 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 B I I

gain scheduled controller
linearization properties
flight control applications


Identification of linear parameter varying models We consider identification of a certain class of discrete-time nonlinear systems known as linear parameter varying system . We assume that inputs , outputs and the scheduling parameters are directly measured , and a form of the functional dependence of the system coefficients on the parameters is known . We show how this identification problem can be reduced to a linear regression , and provide compact formulae for the corresponding least mean square and recursive least-squares algorithms . We derive conditions on persistency of excitation in terms of the inputs and scheduling parameter trajectories when the functional dependence is of polynomial type . These conditions have a natural polynomial interpolation interpretation , and do not require the scheduling parameter trajectories to vary slowly . This method is illustrated with a simulation example using two different parameter trajectories

B O B I I 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 B I O O B I O O O O O O O O O O B 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 O O O O B I I O O O O O O B I I O O O O O O O O O O O O O O O B I

linear parameter varying models
identification
scheduling parameters
functional dependence
system coefficients
linear regression
scheduling parameter trajectories
polynomial interpolation interpretation
parameter trajectories

discrete-time nonlinear systems
least mean square algorithms
recursive least-squares algorithms
persistency of excitation conditions
time-varying systems


Robust L/sub 2 / disturbance attenuation for nonlinear systems with input dynamical uncertainty Deals with the problem of robust L/sub 2 / disturbance attenuation for nonlinear systems with input dynamical uncertainty . The input dynamical uncertainty is restricted to be minimum-phase and relative degree zero . A sufficient condition . is given such that the nonlinear system satisfies the L/sub 2 / gain performance and input-to-state stable property . Using this condition , a design approach is given for a smooth state feedback control law that solves the robust L/sub 2 / disturbance attenuation problem , and the approach is extended to a more general case where the nominal system has higher relative degree . Finally , a numerical example is given to demonstrate the proposed approach

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 B I O B I I 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 B I 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 B I O O O O O O O O O O O O O O O O O

nonlinear systems
input dynamical uncertainty
sufficient condition
design approach
smooth state feedback control law
nominal system

robust l/sub 2/ disturbance attenuation
l/sub 2/ gain performance
input-to-state stable property
robust control


Non-asymptotic confidence ellipsoids for the least-squares estimate We consider the finite sample properties of least-squares system identification , and derive non-asymptotic confidence ellipsoids for the estimate . The shape of the confidence ellipsoids is similar to the shape of the ellipsoids derived using asymptotic theory , but unlike asymptotic theory , they are valid for a finite number of data points . The probability that the estimate belongs to a certain ellipsoid has a natural dependence on the volume of the ellipsoid , the data generating mechanism , the model order and the number of data points available

B I I O O O O O O O B I I 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 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 B I I O O B I O O O O B I O

nonasymptotic confidence ellipsoids
finite sample properties
probability
data generating mechanism
model order
data points

least-squares estimate
least-squares system identification


Simulation and transient testing of numerical relays A hybrid and practical solution for relay evaluation is presented . Two main issues are taken into account : power system simulation and relay simulation , both of which consist of different stages . System simulation is carried out by means of EMTP and is complemented by additional features , such as filtering for location and determination of fault parameters that allow comparing simulated and actual fault records to improve and guarantee a correct system simulation . Relay simulation includes filtering algorithms , all the relaying units , and the decision logic . Playing simulated or real faults over the actual relay and comparing simulated and real responses can check for correct relay simulation

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 B I I O B I 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 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 O B 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 B I

relay evaluation
power system simulation
relay simulation
emtp
numerical relays
filtering
decision logic
real faults

fault location
filtering algorithms
simulated faults
relay testing


Robust control of nonlinear systems with parametric uncertainty Probabilistic robustness analysis and synthesis for nonlinear systems with uncertain parameters are presented . Monte Carlo simulation is used to estimate the likelihood of system instability and violation of performance requirements subject to variations of the probabilistic system parameters . Stochastic robust control synthesis searches the controller design parameter space to minimize a cost that is a function of the probabilities that design criteria will not be satisfied . The robust control design approach is illustrated by a simple nonlinear example . A modified feedback linearization control is chosen as controller structure , and the design parameters are searched by a genetic algorithm to achieve the tradeoff between stability and performance robustness

B I O B I O B I B I I O O O B I O B I 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 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 B I 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

robust control
nonlinear systems
parametric uncertainty
probabilistic robustness analysis
uncertain parameters
monte carlo simulation
system instability
modified feedback linearization control
genetic algorithm

probabilistic robustness synthesis
performance requirements violation
stochastic control synthesis
input-to-state stability


The design and implementation of VAMPIRE We describe VAMPIRE : a high-performance theorem prover for first-order logic . As our description is mostly targeted to the developers of such systems and specialists in automated reasoning , it focuses on the design of the system and some key implementation features . We also analyze the performance of the prover at CASC-JC

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 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

high-performance theorem prover
first-order logic
performance evaluation
casc-jc
resolution theorem proving


User-appropriate tyre-modelling for vehicle dynamics in standard and limit situations When modelling vehicles for the vehicle dynamic simulation , special attention must be paid to the modelling of tyre forces and - torques , according to their dominant influence on the results . This task is not only about sufficiently exact representation of the effective forces but also about user-friendly and practical relevant applicability , especially when the experimental tyre-input-data is incomplete or missing . This text firstly describes the basics of the vehicle dynamic tyre model , conceived to be a physically based , semi-empirical model for application in connection with multi-body-systems -LRB- MBS -RRB- . On the basis of tyres for a passenger car and a heavy truck the simulated steady state tyre characteristics are shown together and compared with the underlying experimental values . The possibility to link the tyre model TMeasy to any MBS-program is described , as far as it supports the ` Standard Tyre Interface ' . As an example , the simulated and experimental data of a heavy truck doing a standardized driving manoeuvre are compared

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 O O O O O O O O O O O O O O O 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 B I I I 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 B I I O O O O O O O O O O O O O B I O O B I I O O

tyre modelling
standard situations
tyre torques
semi-empirical model
multi-body-systems


Analysis of exclusively kinetic two-link underactuated mechanical systems Analysis of exclusively kinetic two-link underactuated mechanical systems is undertaken . It is first shown that such systems are not full-state feedback linearizable around any equilibrium point . Also , the equilibrium points for which the system is small-time locally controllable -LRB- STLC -RRB- is at most a one-dimensional submanifold . A concept less restrictive than STLC , termed the small-time local output controllability -LRB- STLOC -RRB- is introduced , the satisfaction of which guarantees that a chosen configuration output can be controlled at its desired value . It is shown that the class of systems considered is STLOC , if the inertial coupling between the input and output is nonzero . Also , in such a case , the system is nonminimum phase . An example section illustrates all the results presented

O O O O O O O O O O O O O O O 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 O O O O O O B I O O O O O O O O O


The art of the cross-sell -LSB- accounting software -RSB- With the market for accounting software nearing saturation , vendors are training resellers in the subtleties of the cross-sell . The rewards can be great . The key is knowing when to focus , and when to partner

O O O O O O B I 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 O O O O O O


FC + + : Functional tools for object-oriented tasks FC + + is a library for programming functionally in C++ . Compared to other C++ functional programming libraries , FC + + is distinguished by its powerful type system which allows the manipulation of parametrically polymorphic functions -LRB- e.g. , passing them as arguments to other functions and returning them as results -RRB- . In this paper , we show how FC + + can be used in common object-oriented programming tasks . We demonstrate FC + + implementations of several common design patterns -LRB- Adapter , Builder , Command , and more -RRB- . Compared to conventional C++ implementations of these patterns , our implementations are either simpler -LRB- in that fewer classes/dependencies are needed -RRB- , more efficient , or more type-safe -LRB- thanks to parametric polymorphism and type inference -RRB-

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 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 B I O O O O

library
functional programming
parametric polymorphism


Negotiating the semantics of agent communication languages This article presents a formal framework and outlines a method that autonomous agents can use to negotiate the semantics of their communication language at run-time . Such an ability is needed in open multi-agent systems so that agents can ensure they understand the implications of the utterances that are being made and so that they can tailor the meaning of the primitives to best fit their prevailing circumstances . To this end , the semantic space framework provides a systematic means of classifying the primitives along multiple relevant dimensions . This classification can then be used by the agents to structure their negotiation -LRB- or semantic fixing -RRB- process so that they converge to the mutually agreeable semantics that are necessary for coherent social interactions

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 O O O O O O O O O O O O O O O O O O O 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 B I

autonomous agents
communication language
semantic fixing
semantic space
social interactions


Integrated process control using an in situ sensor for etch The migration to tighter geometries and more complex process sequence integration schemes requires having the ability to compensate for upstream deviations from target specifications . Doing so ensures that-downstream process sequences operate on work-in-progress that is well within control . Because point-of-use visibility of work-in-progress quality has become of paramount concern in the industry 's drive to reduce scrap and improve yield , controlling trench depth has assumed greater importance . An integrated , interferometric based , rate monitor for etch-to-depth and spacer etch applications has been developed for controlling this parameter . This article demonstrates that the integrated rate monitor , using polarization and digital signal processing , enhances control etch-to-depth processes and can also be implemented as a predictive endpoint in a wafer manufacturing environment for dual damascene trench etch and spacer etch applications

B I I 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 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 I I 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 O O O O O O O B I I O B I I I O B I I

interferometric in situ etch sensor
process predictive endpoint
ic geometry
upstream deviation compensation
downstream process sequences
point-of-use visibility
work-in-progress quality
scrap reduction
yield improvement
trench depth control
interferometry
integrated etch rate monitor


Solution of a Euclidean combinatorial optimization problem by the dynamic-programming method A class of Euclidean combinatorial optimization problems is selected that can be solved by the dynamic programming method . The problem of allocation of servicing enterprises is solved as an example

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 O O O O O O O O O O O O O

euclidean combinatorial optimization problem


Trends in agent communication language Agent technology is an exciting and important new way to create complex software systems . Agents blend many of the traditional properties of AI programs - knowledge-level reasoning , flexibility , proactiveness , goal-directedness , and so forth - with insights gained from distributed software engineering , machine learning , negotiation and teamwork theory , and the social sciences . An important part of the agent approach is the principle that agents -LRB- like humans -RRB- can function more effectively in groups that are characterized by cooperation and division of labor . Agent programs are designed to autonomously collaborate with each other in order to satisfy both their internal goals and the shared external demands generated by virtue of their participation in agent societies . This type of collaboration depends on a sophisticated system of inter-agent communication . The assumption that inter-agent communication is best handled through the explicit use of an agent communication language -LRB- ACL -RRB- underlies each of the articles in this special issue . In this introductory article , we will supply a brief background and introduction to the main topics in agent communication

O O B I I 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 B I I O B I O B O B 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 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 O O O O O O O O O O O O O O O O O O O O O O O O O O O

agent technology
ai programs
agent communication language
agent societies
distributed software engineering
machine learning
negotiation
teamwork
social sciences

inter-agent communication
kqml
semantics
conversations


Pulmonary perfusion patterns and pulmonary arterial pressure Uses artificial intelligence methods to determine whether quantitative parameters describing the perfusion image can be synthesized to make a reasonable estimate of the pulmonary arterial -LRB- PA -RRB- pressure measured at angiography . Radionuclide perfusion images were obtained in 120 patients with normal chest radiographs who also underwent angiographic PA pressure measurement within 3 days of the radionuclide study . An artificial neural network -LRB- ANN -RRB- was constructed from several image parameters describing statistical and boundary characteristics of the perfusion images . With use of a leave-one-out cross-validation technique , this method was used to predict the PA systolic pressure in cases on which the ANN had not been trained . A Pearson correlation coefficient was determined between the predicted and measured PA systolic pressures . ANN predictions correlated with measured pulmonary systolic pressures -LRB- r = 0.846 , P < .001 -RRB- . The accuracy of the predictions was not influenced by the presence of pulmonary embolism . None of the 51 patients with predicted PA pressures of less than 29 mm Hg had pulmonary hypertension at angiography . All 13 patients with predicted PA pressures greater than 48 mm Hg had pulmonary hypertension at angiography . Meaningful information regarding PA pressure can be derived from noninvasive radionuclide perfusion scanning . The use of image analysis in concert with artificial intelligence methods helps to reveal physiologic information not readily apparent at visual image inspection

B I I O O O O O B I I 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 B O B I I O O O O B 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 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 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 O O 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 B I O B O O O B O O O O O O O O O O B I O B O O O O O O O O O O B I I I O O O O B I O O O B I I O O O B I O O O O B I I

angiographic pulmonary arterial pressure measurement


Explicit solutions for transcendental equations A simple method to formulate an explicit expression for the roots of any analytic transcendental function is presented . The method is based on Cauchy 's integral theorem and uses only basic concepts of complex integration . A convenient method for numerically evaluating the exact expression is presented . The application of both the formulation and evaluation of the exact expression is illustrated for several classical root finding problems

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 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 B I O

transcendental equations
complex integration
root finding

analytic functions
cauchy integral theorem
singularity
polynomial
fourier transform


New Jersey African American women writers and their publications : a study of identification from written and oral sources This study examines the use of written sources , and personal interviews and informal conversations with individuals from New Jersey 's religious , political , and educational community to identify African American women writers in New Jersey and their intellectual output . The focus on recognizing the community as an oral repository of history and then tapping these oral sources for collection development and acquisition purposes is supported by empirical and qualitative evidence . Findings indicate that written sources are so limited that information professionals must rely on oral sources to uncover local writers and their publications

B I I I I I 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 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 B I O B 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 B I O O O

new jersey african american women writers


Simulation of ecological and economical structural-type functions An optimization approach to the simulation of ecological and economical structural-type functions is proposed . A methodology for construction of such functions is created in an explicit analytical form

B 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 B I I

economical structural-type functions
optimisation approach


Toward a formalism for conversation protocols using joint intention theory Conversation protocols are used to achieve certain goals or to bring about certain states in the world . Therefore , one may identify the landmarks or the states that must be brought about during the goal-directed execution of a protocol . Accordingly , the landmarks , characterized by propositions that are true in the state represented by that landmark , are the most important aspect of a protocol . Families of conversation protocols can be expressed formally as partially ordered landmarks after the landmarks necessary to achieve a goal have been identified . Concrete protocols represented as joint action expressions can , then , be derived from the partially ordered landmarks and executed directly by joint intention interpreters . This approach of applying Joint Intention theory to protocols also supports flexibility in the actions used to get to landmarks , shortcutting protocol execution , automatic exception handling , and correctness criterion for protocols and protocol compositions

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 O O O O O O O O O O O O O O O O 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 B I O B I I O O B I O O O O O

conversation protocols
protocol execution
automatic exception handling
correctness criterion

multi-agent interactions
finite state machines