Eliminating recency with self-review : the case of auditors ' ` going concern ' judgments This paper examines the use of self-review to debias recency . Recency is found in the ` going concern ' judgments of staff auditors , but is successfully eliminated by the auditor 's use of a simple self-review technique that would be extremely easy to implement in audit practice . Auditors who self-review are also less inclined to make audit report choices that are inconsistent with their going concern judgments . These results are important because the judgments of staff auditors often determine the type and extent of documentation in audit workpapers and serve as preliminary inputs for senior auditors ' judgments and choices . If staff auditors ' judgments are affected by recency , the impact of this bias may be impounded in the ultimate judgments and choices of senior auditors . Since biased judgments can expose auditors to significant costs involving extended audit procedures , legal liability and diminished reputation , simple debiasing techniques that reduce this exposure are valuable . The paper also explores some future research needs and other important issues concerning judgment debiasing in applied professional settings

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

staff auditors
audit report choices
documentation
audit workpapers
senior auditors
extended audit procedures
legal liability
diminished reputation
judgment debiasing
applied professional settings

auditor going concern judgments
recency debiasing
self-review
accountability
probability judgments


On quasi-linear PDAEs with convection : applications , indices , numerical solution For a class of partial differential algebraic equations -LRB- PDAEs -RRB- of quasi-linear type which include nonlinear terms of convection type , a possibility to determine a time and spatial index is considered . As a typical example we investigate an application from plasma physics . Especially we discuss the numerical solution of initial boundary value problems by means of a corresponding finite difference splitting procedure which is a modification of a well-known fractional step method coupled with a matrix factorization . The convergence of the numerical solution towards the exact solution of the corresponding initial boundary value problem is investigated . Some results of a numerical solution of the plasma PDAE are given

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

spatial index
plasma physics
initial boundary value problems
finite difference splitting procedure
fractional step method
matrix factorization
convection
indices
numerical solution

quasi-linear partial differential algebraic equations


Numerical simulation of information recovery in quantum computers Decoherence is the main problem to be solved before quantum computers can be built . To control decoherence , it is possible to use error correction methods , but these methods are themselves noisy quantum computation processes . In this work , we study the ability of Steane 's and Shor 's fault-tolerant recovering methods , as well as a modification of Steane 's ancilla network , to correct errors in qubits . We test a way to measure correctly ancilla 's fidelity for these methods , and state the possibility of carrying out an effective error correction through a noisy quantum channel , even using noisy error correction methods

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

numerical simulation
information recovery
quantum computers
error correction methods
noisy quantum computation processes
ancilla network
qubits
noisy quantum channel

decoherence control
fault-tolerant recovering methods
ancilla fidelity
noisy error correction methods


Variety identification of wheat using mass spectrometry with neural networks and the influence of mass spectra processing prior to neural network analysis The performance of matrix-assisted laser desorption/ionisation time-of-flight mass spectrometry with neural networks in wheat variety classification is further evaluated . Two principal issues were studied : -LRB- a -RRB- the number of varieties that could be classified correctly ; and -LRB- b -RRB- various means of preprocessing mass spectrometric data . The number of wheat varieties tested was increased from 10 to 30 . The main pre-processing method investigated was based on Gaussian smoothing of the spectra , but other methods based on normalisation procedures and multiplicative scatter correction of data were also used . With the final method , it was possible to classify 30 wheat varieties with 87 % correctly classified mass spectra and a correlation coefficient of 0.90

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

wheat variety classification
mass spectrometric data
gaussian smoothing
normalisation procedures
multiplicative scatter correction
correctly classified mass spectra
correlation coefficient
variety identification
mass spectra processing
neural network analysis


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

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

adiabatically driven stimulated raman transition


Operations that do not disturb partially known quantum states Consider a situation in which a quantum system is secretly prepared in a state chosen from the known set of states . We present a principle that gives a definite distinction between the operations that preserve the states of the system and those that disturb the states . The principle is derived by alternately applying a fundamental property of classical signals and a fundamental property of quantum ones . The principle can be cast into a simple form by using a decomposition of the relevant Hilbert space , which is uniquely determined by the set of possible states . The decomposition implies the classification of the degrees of freedom of the system into three parts depending on how they store the information on the initially chosen state : one storing it classically , one storing it nonclassically , and the other one storing no information . Then the principle states that the nonclassical part is inaccessible and the classical part is read-only if we are to preserve the state of the system . From this principle , many types of no-cloning , no-broadcasting , and no-imprinting conditions can easily be derived in general forms including mixed states . It also gives a unified view on how various schemes of quantum cryptography work . The principle helps one to derive optimum amount of resources -LRB- bits , qubits , and ebits -RRB- required in data compression or in quantum teleportation of mixed-state ensembles

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

partially known quantum states
quantum system
classical signals
hilbert space
degrees of freedom
nonclassical part
quantum cryptography
bits
qubits
ebits
quantum teleportation

secretly prepared quantum state
mixed-state ensembles


Accuracy and stability of splitting with Stabilizing Corrections This paper contains a convergence analysis for the method of stabilizing corrections , which is an internally consistent splitting scheme for initial-boundary value problems . To obtain more accuracy and a better treatment of explicit terms several extensions are regarded and analyzed . The relevance of the theoretical results is tested for convection-diffusion-reaction equations

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

stability
convergence analysis
stabilizing corrections
splitting scheme

initial-boundary value problems
convection-diffusion-reaction equations


Quantum retrodiction in open systems Quantum retrodiction involves finding the probabilities for various preparation events given a measurement event . This theory has been studied for some time but mainly as an interesting concept associated with time asymmetry in quantum mechanics . Recent interest in quantum communications and cryptography , however , has provided retrodiction with a potential practical application . For this purpose quantum retrodiction in open systems should be more relevant than in closed systems isolated from the environment . In this paper we study retrodiction in open systems and develop a general master equation for the backward time evolution of the measured state , which can be used for calculating preparation probabilities . We solve the master equation , by way of example , for the driven two-level atom coupled to the electromagnetic field

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

quantum retrodiction
probabilities
preparation events
measurement event
time asymmetry
quantum mechanics
quantum communications
cryptography
backward time evolution
open systems

driven two level atom-electromagnetic field coupling


Entangling atoms in bad cavities We propose a method to produce entangled spin squeezed states of a large number of atoms inside an optical cavity . By illuminating the atoms with bichromatic light , the coupling to the cavity induces pairwise exchange of excitations which entangles the atoms . Unlike most proposals for entangling atoms by cavity QED , our proposal does not require the strong coupling regime g/sup 2 / / kappa Gamma >> 1 , where g is the atom cavity coupling strength , kappa is the cavity decay rate , and Gamma is the decay rate of the atoms . In this work the important parameter is Ng/sup 2 / / kappa Gamma , where N is the number of atoms , and our proposal permits the production of entanglement in bad cavities as long as they contain a large number of atoms

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

entangled spin squeezed states
optical cavity
coupling
pairwise exchange
excitations
cavity qed
cavity decay rate
bad cavities

atom entanglement
bichromatic light illumination
strong coupling regime
atom cavity coupling strength


Bigger is better : the influence of physical size on aesthetic preference judgments The hypothesis that the physical size of an object can influence aesthetic preferences was investigated . In a series of four experiments , participants were presented with pairs of abstract stimuli and asked to indicate which member of each pair they preferred . A preference for larger stimuli was found on the majority of trials using various types of stimuli , stimuli of various sizes , and with both adult and 3-year-old participants . This preference pattern was disrupted only when participants had both stimuli that provided a readily accessible alternative source of preference-evoking information and sufficient attentional resources to make their preference judgments

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

aesthetic preference judgments
abstract stimuli
preference pattern
attentional resources

physical size influence
decision making
preference formation
judgment cues
adult participants
child participants
preference-evoking information


Dense coding in entangled states We consider the dense coding of entangled qubits shared between two parties , Alice and Bob . The efficiency of classical information gain through quantum entangled qubits is also considered for the case of pairwise entangled qubits and maximally entangled qubits . We conclude that using the pairwise entangled qubits can be more efficient when two parties communicate whereas using the maximally entangled qubits can be more efficient when the N parties communicate

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

dense coding
entangled states
pairwise entangled qubits
alice
bob
maximally entangled qubits

classical information gain efficiency
quantum information processing
quantum communication


Efficient allocation of knowledge in distributed business structures Accelerated business processes demand new concepts and realizations of information systems and knowledge databases . This paper presents the concept of the collaborative information space -LRB- CIS -RRB- , which supplies the necessary tools to transform individual knowledge into collective useful information . The creation of ` information objects ' in the CIS allows an efficient allocation of information in all business process steps at any time . Furthermore , the specific availability of heterogeneous , distributed data is realized by a Web-based user interface , which enables effective search by a multidimensionally hierarchical composition

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

efficient knowledge allocation
heterogeneous distributed data
web-based user interface
interactive system


Abacus , EFI and anti-virus The Extensible Firmware Interface -LRB- EFI -RRB- standard emerged as a logical step to provide flexibility and extensibility to boot sequence processes , enabling the complete abstraction of a system 's BIOS interface from the system 's hardware . In doing so , this provided the means of standardizing a boot-up sequence , extending device drivers and boot time applications ' portability to non PC-AT-based architectures , including embedded systems like Internet appliances , TV Internet set-top boxes and 64-bit Itanium platforms

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

extensible firmware interface standard
anti-virus


Quantum-controlled measurement device for quantum-state discrimination We propose a `` programmable '' quantum device that is able to perform a specific generalized measurement from a certain set of measurements depending on a quantum state of a `` program register . '' In particular , we study a situation when the programmable measurement device serves for the unambiguous discrimination between nonorthogonal states . The particular pair of states that can be unambiguously discriminated is specified by the state of a program qubit . The probability of successful discrimination is not optimal for all admissible pairs . However , for some subsets it can be very close to the optimal value

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

quantum state
program register
nonorthogonal states
program qubit

quantum-controlled measurement device
quantum-state discrimination
programmable quantum device


A static semantics for Haskell This paper gives a static semantics for Haskell 98 , a non-strict purely functional programming language . The semantics formally specifies nearly all the details of the Haskell 98 type system , including the resolution of overloading , kind inference -LRB- including defaulting -RRB- and polymorphic recursion , the only major omission being a proper treatment of ambiguous overloading and its resolution . Overloading is translated into explicit dictionary passing , as in all current implementations of Haskell . The target language of this translation is a variant of the Girard-Reynolds polymorphic lambda calculus featuring higher order polymorphism . and explicit type abstraction and application in the term language . Translated programs can thus still be type checked , although the implicit version of this system is impredicative . A surprising result of this formalization effort is that the monomorphism restriction , when rendered in a system of inference rules , compromises the principal type property

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

nonstrict purely functional programming language


Quantum learning and universal quantum matching machine Suppose that three kinds of quantum systems are given in some unknown states | f > / sup -LRB- X -RRB- N / , | g/sub 1 / > / sup -LRB- X -RRB- K / , and | g/sub 2 / > / sup -LRB- X -RRB- K / , and we want to decide which template state | g/sub 1 / > or | g/sub 2 / > , each representing the feature of the pattern class C/sub 1 / or C/sub 2 / , respectively , is closest to the input feature state | f > . This is an extension of the pattern matching problem into the quantum domain . Assuming that these states are known a priori to belong to a certain parametric family of pure qubit systems , we derive two kinds of matching strategies . The first one is a semiclassical strategy that is obtained by the natural extension of conventional matching strategies and consists of a two-stage procedure : identification -LRB- estimation -RRB- of the unknown template states to design the classifier -LRB- learning process to train the classifier -RRB- and classification of the input system into the appropriate pattern class based on the estimated results . The other is a fully quantum strategy without any intermediate measurement , which we might call as the universal quantum matching machine . We present the Bayes optimal solutions for both strategies in the case of K = 1 , showing that there certainly exists a fully quantum matching procedure that is strictly superior to the straightforward semiclassical extension of the conventional matching strategy based on the learning process

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

quantum learning
universal quantum matching machine
pattern class
pattern matching problem
quantum domain
qubit systems
matching strategies
semiclassical strategy
quantum strategy
bayes optimal solutions
quantum matching procedure
semiclassical extension
matching strategy
learning process


Choice preferences without inferences : subconscious priming of risk attitudes We present a procedure for subconscious priming of risk attitudes . In Experiment 1 , we were reliably able to induce risk-seeking or risk-averse preferences across a range of decision scenarios using this priming procedure . In Experiment 2 , we showed that these priming effects can be reversed by drawing participants ' attention to the priming event . Our results support claims that the formation of risk preferences can be based on preconscious processing , as for example postulated by the affective primacy hypothesis , rather than rely on deliberative mental operations , as posited by several current models of judgment and decision making

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

subconscious priming
risk attitudes
decision scenarios
preconscious processing
affective primacy hypothesis
deliberative mental operations
choice preferences

risk-seeking preferences
risk-averse preferences


Car-caravan snaking . 1 . The influence of pintle pin friction A brief review of knowledge of car-caravan snaking is carried out . Against the background described , a fairly detailed mathematical model of a contemporary car-trailer system is constructed and a baseline set of parameter values is given . In reduced form , the model is shown to give results in accordance with literature . The properties of the baseline combination are explored using both linear and non-linear versions of the model . The influences of damping at the pintle joint and of several other design parameters on the stability of the linear system in the neighbourhood of the critical snaking speed are calculated and discussed . Coulomb friction damping at the pintle pin is then included and simulations are used to indicate the consequent amplitude-dependent behaviour . The friction damping , especially when its level has to be chosen by the user , is shown to give dangerous characteristics , despite having some capacity for stabilization of the snaking motions . It is concluded that pintle pin friction damping does not represent a satisfactory solution to the snaking problem . The paper sets the scene for the development of an improved solution

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

pintle pin friction
mathematical model
linear system
critical snaking speed
coulomb friction damping

car-caravan snaking
car-trailer system
amplitude-dependent behaviour


Quantum-state information retrieval in a Rydberg-atom data register We analyze a quantum search protocol to retrieve phase information from a Rydberg-atom data register using a subpicosecond half-cycle electric field pulse . Calculations show that the half-cycle pulse can perform the phase retrieval only within a range of peak field values . By varying the phases of the constituent orbitals of the Rydberg wave packet register , we demonstrate coherent control of the phase retrieval process . By specially programming the phases of the orbitals comprising the initial wave packet , we show that it is possible to use the search method as a way to synthesize single energy eigenstates

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

quantum search protocol
phase information
phase retrieval
peak field values
constituent orbitals
rydberg wave packet register
coherent control
initial wave packet
search method
single energy eigenstates


Exploiting randomness in quantum information processing We consider how randomness can be made to play a useful role in quantum information processing-in particular , for decoherence control and the implementation of quantum algorithms . For a two-level system in which the decoherence channel is non-dissipative , we show that decoherence suppression is possible if memory is present in the channel . Random switching between two potentially harmful noise sources can then provide a source of stochastic control . Such random switching can also be used in an advantageous way for the implementation of quantum algorithms

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

quantum information processing
randomness
decoherence control
quantum algorithms
random switching
noise
stochastic control


A variable-stepsize variable-order multistep method for the integration of perturbed linear problems G. Scheifele -LRB- 1971 -RRB- wrote the solution of a perturbed oscillator as an expansion in terms of a new set of functions , which extends the monomials in the Taylor series of the solution . Recently , P. Martin and J.M. Ferrandiz -LRB- 1997 -RRB- constructed a multistep code based on the Scheifele technique , and it was generalized by D.J. Lopez and P. Martin -LRB- 1998 -RRB- for perturbed linear problems . However , the remarked codes are constant steplength methods , and efficient integrators must be able to change the steplength . In this paper we extend the ideas of F.T. Krogh -LRB- 1974 -RRB- from Adams methods to the algorithm proposed by Lopez and Martin , and we show the advantages of the new code in perturbed problems

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

perturbed oscillator
monomials
taylor series
multistep code
constant steplength methods
adams methods


An entanglement measure based on the capacity of dense coding An asymptotic entanglement measure for any bipartite states is derived in the light of the dense coding capacity optimized with respect to local quantum operations and classical communications . General properties and some examples with explicit forms of this entanglement measure are investigated

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

entanglement measure
dense coding capacity
bipartite states
local quantum operations
classical communications

asymptotic entanglement measure
optimization


A fuzzy logic approach to accommodate thermal stress and improve the start-up phase in combined cycle power plants Use of combined cycle power generation plant has increased dramatically over the last decade . A supervisory control approach based on a dynamic model is developed , which makes use of proportional-integral-derivative -LRB- PID -RRB- , fuzzy logic and fuzzy PID schemes . The aim is to minimize the steam turbine plant start-up time , without violating maximum thermal stress limits . An existing start-up schedule provides the benchmark by which the performance of candidate controllers is assessed . Improvements regarding possible reduced start-up times and satisfaction of maximum thermal stress restrictions have been realized using the proposed control scheme

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

combined cycle power plants
supervisory control
fuzzy logic approach
dynamic model
fuzzy pid schemes
maximum thermal stress limits

steam turbine plant start-up time minimization


Faking it : simulating dependent types in Haskell Dependent types reflect the fact that validity of data is often a relative notion by allowing prior data to affect the types of subsequent data . Not only does this make for a precise type system , but also a highly generic one : both the type and the program for each instance of a family of operations can be computed from the data which codes for that instance . Recent experimental extensions to the Haskell type class mechanism give us strong tools to relativize types to other types . We may simulate some aspects of dependent typing by making counterfeit type-level copies of data , with type constructors simulating data constructors and type classes simulating datatypes . This paper gives examples of the technique and discusses its potential

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

dependent types
haskell
precise type system
type class mechanism
dependent typing
type constructors
data constructors
datatypes

data validity
counterfeit type-level copies
functional programming


A re-examination of probability matching and rational choice In a typical probability learning task participants are presented with a repeated choice between two response alternatives , one of which has a higher payoff probability than the other . Rational choice theory requires that participants should eventually allocate all their responses to the high-payoff alternative , but previous research has found that people fail to maximize their payoffs . Instead , it is commonly observed that people match their response probabilities to the payoff probabilities . We report three experiments on this choice anomaly using a simple probability learning task in which participants were provided with -LRB- i -RRB- large financial incentives , -LRB- ii -RRB- meaningful and regular feedback , and -LRB- iii -RRB- extensive training . In each experiment large proportions of participants adopted the optimal response strategy and all three of the factors mentioned above contributed to this . The results are supportive of rational choice theory

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

probability learning task
rational choice theory
probability matching
payoff probability
response probabilities
choice anomaly
large financial incentives
extensive training
optimal response strategy
feedback


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

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


Universal simulation of Hamiltonian dynamics for quantum systems with finite-dimensional state spaces What interactions are sufficient to simulate arbitrary quantum dynamics in a composite quantum system ? Dodd et al. -LSB- Phys . Rev. A 65 , 040301 -LRB- R -RRB- -LRB- 2002 -RRB- -RSB- provided a partial solution to this problem in the form of an efficient algorithm to simulate any desired two-body Hamiltonian evolution using any fixed two-body entangling N-qubit Hamiltonian , and local unitaries . We extend this result to the case where the component systems are qudits , that is , have D dimensions . As a consequence we explain how universal quantum computation can be performed with any fixed two-body entangling N-qudit Hamiltonian , and local unitaries

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

universal simulation
hamiltonian dynamics
quantum systems
quantum dynamics
composite quantum system
local unitaries
universal quantum computation

fixed two-body entangling n-qubit hamiltonian

fixed two-body entangling n-qudit hamiltonian


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

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

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


Development of a real-time monitoring system This paper describes a pattern recognition -LRB- PR -RRB- technique , which uses learning vector quantization -LRB- LVQ -RRB- . This method is adapted for practical application to solve problems in the area of condition monitoring and fault diagnosis where a number of fault signatures are involved . In these situations , the aim is health monitoring , including identification of deterioration of the healthy condition and identification of causes of the failure in real-time . For this reason a fault database is developed which contains the collected information about various states of operation of the system in the form of pattern vectors . The task of the real-time monitoring system is to correlate patterns of unknown faults with the known fault signatures in the fault database . This will determine cause of failure and degree of deterioration of the system under test . The problem of fault diagnosis may involve a large number of patterns and large sampling time , which affects the learning stage of neural networks . The study here also aims to find a fast learning model of neural networks for instances when a high number of patterns and numerous processing elements are involved . It begins searching for an appropriate solution . The study is extended to the enforcement learning models and considers LVQ as a network emerged from the competitive learning model through enforcement training . Finally , tests show an accuracy of 92.3 per cent in the fault diagnostic capability of the technique

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

lvq
learning vector quantization
condition monitoring
fault diagnosis
fault signatures
health monitoring
fault database
pattern vectors
large sampling time
fast learning model
neural networks
competitive learning model
enforcement training
fault diagnostic capability

real-time monitoring system
pattern recognition technique
deterioration identification
real-time failure cause identification
pattern correlation
cnc machine centre
coolant system


Delayed-choice entanglement swapping with vacuum-one-photon quantum states We report the experimental realization of a recently discovered quantum-information protocol by Peres implying an apparent nonlocal quantum mechanical retrodiction effect . The demonstration is carried out by a quantum optical method by which each singlet entangled state is physically implemented by a two-dimensional subspace of Fock states of a mode of the electromagnetic field , specifically the space spanned by the vacuum and the one-photon state , along lines suggested recently by E. Knill et al. -LSB- Nature -LRB- London -RRB- 409 , 46 -LRB- 2001 -RRB- -RSB- and by M. Duan et al. -LSB- ibid . 414 , 413 -LRB- 2001 -RRB- -RSB-

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

delayed-choice entanglement
quantum-information
two-dimensional subspace
state entanglement
electromagnetic field mode
vacuum-one-photon quantum states
one-photon state
vacuum state


Mustering motivation to enact decisions : how decision process characteristics influence goal realization Decision scientists tend to focus mainly on decision antecedents , studying how people make decisions . Action psychologists , in contrast , study post-decision issues , investigating how decisions , once formed , are maintained , protected , and enacted . Through the research presented here , we seek to bridge these two disciplines , proposing that the process by which decisions are reached motivates subsequent pursuit and benefits eventual realization . We identify three characteristics of the decision process -LRB- DP -RRB- as having motivation-mustering potential : DP effort investment , DP importance , and DP confidence . Through two field studies tracking participants ' decision processes , pursuit and realization , we find that after controlling for the influence of the motivational mechanisms of goal intention and implementation intention , the three decision process characteristics significantly influence the successful enactment of the chosen decision directly . The theoretical and practical implications of these findings are considered and future research opportunities are identified

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

motivation
goal realization
decision process characteristics
action psychologists
goal intention
research opportunities
decision scientists

decision enactment
post-decision issues
motivation-mustering potential
decision process investment
decision process importance
decision process confidence


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

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

numerical approximation
nonlinear boundary value problems
boundary value methods
mesh selection strategy
newton method
nonlinear differential equation
stopping criteria
stiff problems
bvms


A hybrid model for smoke simulation A smoke simulation approach based on the integration of traditional particle systems and density functions is presented in this paper . By attaching a density function to each particle as its attribute , the diffusion of smoke can be described by the variation of particles ' density functions , along with the effect on airflow by controlling particles ' movement and fragmentation . In addition , a continuous density field for realistic rendering can be generated quickly through the look-up tables of particle 's density functions . Compared with traditional particle systems , this approach can describe smoke diffusion , and provide a continuous density field for realistic rendering with much less computation . A quick rendering scheme is also presented in this paper as a useful preview tool for tuning appropriate parameters in the smoke model

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

hybrid model
smoke simulation
density functions
continuous density field
rendering


An interlingua-based Chinese-English MT system Chinese-English machine translation is a significant and challenging problem in information processing . The paper presents an interlingua-based Chinese-English natural language translation system -LRB- ICENT -RRB- . It introduces the realization mechanism of Chinese language analysis , which contains syntactic parsing and semantic analyzing and gives the design of interlingua in details . Experimental results and system evaluation are given . The result is satisfying

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

information processing
natural language translation system
syntactic parsing
semantic analyzing

interlingua-based chinese-english machine translation system


Approximating martingales for variance reduction in Markov process simulation `` Knowledge of either analytical or numerical approximations should enable more efficient simulation estimators to be constructed . '' This principle seems intuitively plausible and certainly attractive , yet no completely satisfactory general methodology has been developed to exploit it . The authors present a new approach for obtaining variance reduction in Markov process simulation that is applicable to a vast array of different performance measures . The approach relies on the construction of a martingale that is then used as an internal control variate

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

markov process simulation
variance reduction
martingales
performance measures
internal control variate

approximating martingale-process method
complex stochastic processes
single-server queue


A min-max theorem on feedback vertex sets We establish a necessary and sufficient condition for the linear system -LCB- x : Hx > or = e , x > or = 0 -RCB- associated with a bipartite tournament to be totally dual integral , where H is the cycle-vertex incidence matrix and e is the all-one vector . The consequence is a min-max relation on packing and covering cycles , together with strongly polynomial time algorithms for the feedback vertex set problem and the cycle packing problem on the corresponding bipartite tournaments . In addition , we show that the feedback vertex set problem on general bipartite tournaments is NP-complete and approximable within 3.5 based on the min-max theorem

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

feedback vertex sets
linear system
bipartite tournament
covering cycles
strongly polynomial time algorithms
cycle packing problem
feedback vertex set problem

min-max theorem
necessary sufficient condition
totally dual integral system
cycle-vertex incidence matrix
all-one vector
np-complete problem
graphs
combinatorial optimization problems
linear programming duality theory


Simultaneous iterative reconstruction of emission and attenuation images in positron emission tomography from emission data only For quantitative image reconstruction in positron emission tomography attenuation correction is mandatory . In case that no data are available for the calculation of the attenuation correction factors one can try to determine them from the emission data alone . However , it is not clear if the information content is sufficient to yield an adequate attenuation correction together with a satisfactory activity distribution . Therefore , we determined the log likelihood distribution for a thorax phantom depending on the choice of attenuation and activity pixel values to measure the crosstalk between both . In addition an iterative image reconstruction -LRB- one-dimensional Newton-type algorithm with a maximum likelihood estimator -RRB- , which simultaneously reconstructs the images of the activity distribution and the attenuation coefficients is used to demonstrate the problems and possibilities of such a reconstruction . As result we show that for a change of the log likelihood in the range of statistical noise , the associated change in the activity value of a structure is between 6 % and 263 % . In addition , we show that it is not possible to choose the best maximum on the basis of the log likelihood when a regularization is used , because the coupling between different structures mediated by the -LRB- smoothing -RRB- regularization prevents an adequate solution due to crosstalk . We conclude that taking into account the attenuation information in the emission data improves the performance of image reconstruction with respect to the bias of the activities , however , the reconstruction still is not quantitative

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

iterative image reconstruction
one-dimensional newton-type algorithm


Blending parametric patches with subdivision surfaces In this paper the problem of blending parametric surfaces using subdivision patches is discussed . A new approach , named removing-boundary , is presented to generate piecewise-smooth subdivision surfaces through discarding the outmost quadrilaterals of the open meshes derived by each subdivision step . Then the approach is employed both to blend parametric bicubic B-spline surfaces and to fill n-sided holes . It is easy to produce piecewise-smooth subdivision surfaces with both convex and concave corners on the boundary , and limit surfaces are guaranteed to be C/sup 2 / continuous on the boundaries except for a few singular points by the removing-boundary approach . Thus the blending method is very efficient and the blending surface generated is of good effect

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

subdivision surfaces
subdivision patches
quadrilaterals

parametric surfaces blending
piecewise-smooth subdivision surfaces
parametric bicubic b-spline surfaces
piecewise smooth subdivision surfaces


Relationship between strong monotonicity property , P/sub 2 / - property , and the GUS-property in semidefinite linear complementarity problems In a recent paper on semidefinite linear complementarity problems , Gowda and Song -LRB- 2000 -RRB- introduced and studied the P-property , P/sub 2 / - property , GUS-property , and strong monotonicity property for linear transformation L : S/sup n / to S/sup n / , where S/sup n / is the space of all symmetric and real n * n matrices . In an attempt to characterize the P/sub 2 / - property , they raised the following two questions : -LRB- i -RRB- Does the strong monotonicity imply the P/sub 2 / - property ? -LRB- ii -RRB- Does the GUS-property imply the P/sub 2 / - property ? In this paper , we show that the strong monotonicity property implies the P/sub 2 / - property for any linear transformation and describe an equivalence between these two properties for Lyapunov and other transformations . We show by means of an example that the GUS-property need not imply the P/sub 2 / - property , even for Lyapunov transformations

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

p/sub 2/-property
gus-property
symmetric real matrices


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

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

head scatter factors
intensity modulated radiation therapy
segmented fields
collimator jaw settings
calculation algorithm
symmetric
fields
asymmetric
tertiary collimator
multileaf collimator
blocks
photon radiation
target
scattered photons
primary collimator
flattening filter
field mapping method
source intensity distributions
ms windows environment
input data
machine commissioning
lower collimator jaws

three-source model
irregular open fields
source-to-chamber distance
extra-focal photon sources
extra-focal source planes
symmetric square fields
upper collimator jaws


Q-learning for risk-sensitive control We propose for risk-sensitive control of finite Markov chains a counterpart of the popular Q-learning algorithm for classical Markov decision processes . The algorithm is shown to converge with probability one to the desired solution . The proof technique is an adaptation of the o.d.e. approach for the analysis of stochastic approximation algorithms , with most of the work involved used for the analysis of the specific o.d.e.s that arise

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

finite markov chains
classical markov decision processes
proof technique
stochastic approximation algorithms

risk-sensitive control
q-learning algorithm
algorithm convergence
reinforcement learning algorithms
dynamic programming
ordinary differential equations


Cooperative three - and four-player quantum games A cooperative multi-player quantum game played by 3 and 4 players has been studied . A quantum superposed operator is introduced in this work which solves the non-zero sum difficulty in previous treatments . The role of quantum entanglement of the initial state is discussed in detail

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

quantum entanglement
initial state
quantum superposed operator
nonzero sum difficulty

cooperative three-player quantum games
cooperative four-player quantum games


Semidefinite programming vs. LP relaxations for polynomial programming We consider the global minimization of a multivariate polynomial on a semi-algebraic set Omega defined with polynomial inequalities . We then compare two hierarchies of relaxations , namely , LP relaxations based on products of the original constraints , in the spirit of the RLT procedure of Sherali and Adams -LRB- 1990 -RRB- , and recent semidefinite programming -LRB- SDP -RRB- relaxations introduced by the author . The comparison is analyzed in light of recent results in real algebraic geometry on various representations of polynomials , positive on a compact semi-algebraic set

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

polynomial programming
lp relaxations
global minimization
multivariate polynomial
polynomial inequalities
real algebraic geometry
rlt procedure

semidefinite programming relaxations
reformulation linearization technique
semi-algebraic set
constraint products


Computer aided classification of masses in ultrasonic mammography Frequency compounding was recently investigated for computer aided classification of masses in ultrasonic B-mode images as benign or malignant . The classification was performed using the normalized parameters of the Nakagami distribution at a single region of interest at the site of the mass . A combination of normalized Nakagami parameters from two different images of a mass was undertaken to improve the performance of classification . Receiver operating characteristic -LRB- ROC -RRB- analysis showed that such an approach resulted in an area of 0.83 under the ROC curve . The aim of the work described in this paper is to see whether a feature describing the characteristic of the boundary can be extracted and combined with the Nakagami parameter to further improve the performance of classification . The combination of the features has been performed using a weighted summation . Results indicate a 10 % improvement in specificity at a sensitivity of 96 % after combining the information at the site and at the boundary . Moreover , the technique requires minimal clinical intervention and has a performance that reaches that of the trained radiologist . It is hence suggested that this technique may be utilized in practice to characterize breast masses

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

ultrasonic mammography
breast masses
computer aided classification
frequency compounding
benign
malignant
normalized parameters
nakagami distribution
single region of interest
normalized nakagami parameters
receiver operating characteristic
roc curve
weighted summation
specificity
sensitivity
minimal clinical intervention


Modification for synchronization of Rossler and Chen chaotic systems Active control is an effective method for making two identical Rossler and Chen systems be synchronized . However , this method works only for a certain class of chaotic systems with known parameters both in drive systems and response systems . Modification based on Lyapunov stability theory is proposed in order to overcome this limitation . An adaptive synchronization controller , which can make the states of two identical Rossler and Chen systems globally asymptotically synchronized in the presence of system 's unknown constant parameters , is derived . Especially , when some unknown parameters are positive , we can make the controller more simple , besides , the controller is independent of those positive uncertain parameters . At last , when the condition that arbitrary unknown parameters in two systems are identical constants is cancelled , we demonstrate that it is possible to synchronize two chaotic systems . All results are proved using a well-known Lyapunov stability theorem . Numerical simulations are given to validate the proposed synchronization approach

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

synchronization
chen chaotic systems
active control
response systems
lyapunov stability theory

rossler chaotic systems
adaptive synchronization controller
global asymptotic synchronization


Fuzzy business -LSB- Halden Reactor Project -RSB- The Halden Reactor Project has developed two systems to investigate how signal validation and thermal performance monitoring techniques can be improved . PEANO is an online calibration monitoring system that makes use of artificial intelligence techniques . The system has been tested in cooperation with EPRI and Edan Engineering , using real data from a US PWR plant . These tests showed that PEANO could reliably assess the performance of the process instrumentation at different plant conditions . Real cases of zero and span drifts were successfully detected by the system . TEMPO is a system for thermal performance monitoring and optimisation , which relies on plant-wide first principle models . The system has been installed on a Swedish BWR plant . Results obtained show an overall rms deviation from measured values of a few tenths of a percent , and giving goodness-of-fits in the order of 95 % . The high accuracy demonstrated is a good basis for detecting possible faults and efficiency losses in steam turbine cycles

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

halden reactor project
peano
calibration
artificial intelligence
pwr
tempo
thermal performance monitoring
bwr
steam turbine cycles

fuzzy logic
steam generators
feedwater flow


The existence condition of gamma - acyclic database schemes with MVDs constraints It is very important to use database technology for a large-scale system such as ERP and MIS . A good database design may improve the performance of the system . Some research shows that a gamma - acyclic database scheme has many good properties , e.g. , each connected join expression is monotonous , which helps to improve query performance of the database system . Thus what conditions are needed to generate a gamma - acyclic database scheme for a given relational scheme ? In this paper , the sufficient and necessary condition of the existence of gamma - acyclic , join-lossless and dependencies-preserved database schemes meeting 4NF is given

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

existence condition
database technology
connected join expression
query performance
sufficient and necessary condition
mvds constraints

large-scale system
gamma -acyclic database schemes


Computing stationary Nash equilibria of undiscounted single-controller stochastic games Given a two-person , nonzero-sum stochastic game where the second player controls the transitions , we formulate a linear complementarity problem LCP -LRB- q , M -RRB- whose solution gives a Nash equilibrium pair of stationary strategies under the limiting average payoff criterion . The matrix M constructed is of the copositive class so that Lemke 's algorithm will process it . We will also do the same for a special class of N-person stochastic games called polymatrix stochastic games

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

stationary nash equilibria
linear complementarity problem
stationary strategies
limiting average payoff criterion
polymatrix stochastic games


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

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

data extraction
internet
information source
schema
html

wrapper generation
data integration
distributed database
queries


A study on an automatic seam tracking system by using an electromagnetic sensor for sheet metal arc welding of butt joints Many sensors , such as the vision sensor and the laser displacement sensor , have been developed to automate the arc welding process . However , these sensors have some problems due to the effects of arc light , fumes and spatter . An electromagnetic sensor , which utilizes the generation of an eddy current , was developed for detecting the weld line of a butt joint in which the root gap size was zero . An automatic seam tracking system designed for sheet metal arc welding was constructed with a sensor . Through experiments , it was revealed that the system had an excellent seam tracking accuracy of the order of + or-0 .2 mm

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

sheet metal arc welding
butt joints
automatic seam tracking system
electromagnetic sensor
root gap size
seam tracking accuracy

eddy current generation
weld line detection


A 3-stage pipelined architecture for multi-view images decoder In this paper , we proposed the architecture of the decoder which implements the multi-view images decoding algorithm . The study of the hardware structure of the multi-view image processing has not been accomplished . The proposed multi-view images decoder operates in a three stage pipelined manner and extracts the depth of the pixels of the decoded image every clock . The multi-view images decoder consists of three modules , Node selector which transfers the value of the nodes repeatedly and Depth Extractor which extracts the depth of each pixel from the four values of the nodes and Affine Transformer which generates the projecting position on the image plane from the values of the pixels and the specified viewpoint . The proposed architecture is designed and simulated by the Max + PlusII design tool and the operating frequency is 30 MHz . The image can be constructed in a real time by the decoder with the proposed architecture

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

hardware structure
node selector
depth extractor
affine transformer
viewpoint
operating frequency
30 mhz

three-stage pipelined architecture
multi-view images decoder
pixel depth
max+plusii design tool


Angular disparity in ETACT scintimammography Emission tuned aperture computed tomography -LRB- ETACT -RRB- has been previously shown to have the potential for the detection of small tumors -LRB- < 1 cm -RRB- in scintimammography . However , the optimal approach to the application of ETACT in the clinic has yet to be determined . Therefore , we sought to determine the effect of the angular disparity between the ETACT projections on image quality through the use of a computer simulation . A small , spherical tumor of variable size -LRB- 5 , 7.5 or 10 mm -RRB- was placed at the center of a hemispherical breast -LRB- 15 cm diameter -RRB- . The tumor to nontumor ratio was either 5:1 or 10:1 . The detector was modeled to be a gamma camera fitted with a 4-mm-diam pinhole collimator . The pinhole-to-detector and the pinhole-to-tumor distances were 25 and 15 cm , respectively . A ray tracing technique was used to generate three sets of projections -LRB- 10 degrees , 15 degrees , and 20 degrees , angular disparity -RRB- . These data were blurred to a resolution consistent with the 4 mm pinhole . The TACT reconstruction method was used to reconstruct these three image sets . The tumor contrast and the axial spatial resolution was measured . Smaller angular disparity led to an improvement in image contrast but at a cost of degraded axial spatial resolution . The improvement in contrast is due to a slight improvement in the in-plane spatial resolution . Since improved contrast should lead to better tumor detectability , smaller angular disparity should be used . However , the difference in contrast between 10 degrees and 15 degrees was very slight and therefore a reasonable clinical choice for angular disparity is 15 degrees

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

angular disparity
small tumors
image quality
computer simulation
spherical tumor
hemispherical breast
gamma camera
pinhole collimator
ray tracing technique
image sets
axial spatial resolution
clinical choice

emission tuned aperture computed tomography scintimammography

tuned aperture computed tomography reconstruction method


Four-point wavelets and their applications Multiresolution analysis -LRB- MRA -RRB- and wavelets provide useful and efficient tools for representing functions at multiple levels of details . Wavelet representations have been used in a broad range of applications , including image compression , physical simulation and numerical analysis . In this paper , the authors construct a new class of wavelets , called four-point wavelets , based on an interpolatory four-point subdivision scheme . They are of local support , symmetric and stable . The analysis and synthesis algorithms have linear time complexity . Depending on different weight parameters w , the scaling functions and wavelets generated by the four-point subdivision scheme are of different degrees of smoothness . Therefore the user can select better wavelets relevant to the practice among the classes of wavelets . The authors apply the four-point wavelets in signal compression . The results show that the four-point wavelets behave much better than B-spline wavelets in many situations

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

multiresolution analysis
wavelet representations
image compression
physical simulation
numerical analysis
linear time complexity
weight parameters
scaling functions


Run-time data-flow analysis Parallelizing compilers have made great progress in recent years . However , there still remains a gap between the current ability of parallelizing compilers and their final goals . In order to achieve the maximum parallelism , run-time techniques were used in parallelizing compilers during last few years . First , this paper presents a basic run-time privatization method . The definition of run-time dead code is given and its side effect is discussed . To eliminate the imprecision caused by the run-time dead code , backward data-flow information must be used . Proteus Test , which can use backward information in run-time , is then presented to exploit more dynamic parallelism . Also , a variation of Proteus Test , the Advanced Proteus Test , is offered to achieve partial parallelism . Proteus Test was implemented on the parallelizing compiler AFT . In the end of this paper the program fpppp.f of Spec95fp Benchmark is taken as an example , to show the effectiveness of Proteus Test

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

parallelizing compilers
proteus test
dynamic parallelism

run-time data flow analysis
run-time privatization method
run-time dead code
backward data-flow information


Evaluating alternative manufacturing control strategies using a benchmark system This paper describes an investigation of the effects of dynamic job routing and job sequencing decisions on the performance of a distributed control system and its adaptability against disturbances . This experimental work was carried out to compare the performance of alternative control strategies in various manufacturing environments and to investigate the relationship between the ` control ' and ` controlled ' systems . The experimental test-bed presented in this paper consists of an agent-based control system -LRB- implemented in C++ -RRB- and a discrete-event simulation model . Using this test-bed , various control strategies were tested on a benchmark manufacturing system by varying production volumes -LRB- to model the production system with looser/tighter schedules -RRB- and disturbance frequencies . It was found that hybrid strategies that combine reactive agent mechanisms -LRB- and allocation strategies such as the contract net -RRB- with appropriate job sequencing heuristics provide the best performance , particularly when job congestion increases on a shop-floor

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

disturbance adaptability
agent-based control system
discrete-event simulation model
experimental test-bed


The visible cement data set With advances in x-ray microtomography , it is now possible to obtain three-dimensional representations of a material 's microstructure with a voxel size of less than one micrometer . The Visible Cement Data Set represents a collection of 3-D data sets obtained using the European Synchrotron Radiation Facility in Grenoble , France in September 2000 . Most of the images obtained are for hydrating portland cement pastes , with a few data sets representing hydrating Plaster of Paris and a common building brick . All of these data sets are being made available on the Visible Cement Data Set website at http://visiblecement.nist.gov . The website includes the raw 3-D datafiles , a description of the material imaged for each data set , example two-dimensional images and visualizations for each data set , and a collection of C language computer programs that will be of use in processing and analyzing the 3-D microstructural images . This paper provides the details of the experiments performed at the ESRF , the analysis procedures utilized in obtaining the data set files , and a few representative example images for each of the three materials investigated

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

microstructure
voxel size
european synchrotron radiation facility
hydrating portland cement pastes
plaster of paris
building brick
microstructural images
esrf

x-ray microtomography
3d representations
cement hydration
two-dimensional images


An analytic center cutting plane method for semidefinite feasibility problems Semidefinite feasibility problems arise in many areas of operations research . The abstract form of these problems can be described as finding a point in a nonempty bounded convex body Gamma in the cone of symmetric positive semidefinite matrices . Assume that Gamma is defined by an oracle , which for any given m * m symmetric positive semidefinite matrix Gamma either confirms that Y epsilon Gamma or returns a cut , i.e. , a symmetric matrix A such that Gamma is in the half-space -LCB- Y : A . Y < or = A . Y -RCB- . We study an analytic center cutting plane algorithm for this problem . At each iteration , the algorithm computes an approximate analytic center of a working set defined by the cutting plane system generated in the previous iterations . If this approximate analytic center is a solution , then the algorithm terminates ; otherwise the new cutting plane returned by the oracle is added into the system . As the number of iterations increases , the working set shrinks and the algorithm eventually finds a solution to the problem . All iterates generated by the algorithm are positive definite matrices . The algorithm has a worst-case complexity of O * -LRB- m/sup 3 / / epsilon / sup 2 / -RRB- on the total number of cuts to be used , where epsilon is the maximum radius of a ball contained by Gamma

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

worst-case complexity
maximum ball radius


WebCAD : A computer aided design tool constrained with explicit ` design for manufacturability ' rules for computer numerical control milling A key element in the overall efficiency of a manufacturing enterprise is the compatibility between the features that have been created in a newly designed part , and the capabilities of the downstream manufacturing processes . With this in mind , a process-aware computer aided design -LRB- CAD -RRB- system called WebCAD has been developed . The system restricts the freedom of the designer in such a way that the designed parts can be manufactured on a three-axis computer numerical control milling machine . This paper discusses the vision of WebCAD and explains the rationale for its development in comparison with commercial CAD/CAM -LRB- computer aided design/manufacture -RRB- systems . The paper then goes on to describe the implementation issues that enforce the manufacturability rules . Finally , certain design tools are described that aid a user during the design process . Some examples are given of the parts designed and manufactured with WebCAD

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

webcad
computer aided design tool
computer numerical control milling
manufacturability rules
design tools

design for manufacturability rules
manufacturing enterprise efficiency
process-aware cad system
three-axis cnc milling machine
cad/cam systems
internet-based cad/cam


Deterministic calculations of photon spectra for clinical accelerator targets A method is proposed to compute photon energy spectra produced in clinical electron accelerator targets , based on the deterministic solution of the Boltzmann equation for coupled electron-photon transport in one-dimensional -LRB- 1-D -RRB- slab geometry . It is shown that the deterministic method gives similar results as Monte Carlo calculations over the angular range of interest for therapy applications . Relative energy spectra computed by deterministic and 3-D Monte Carlo methods , respectively , are compared for several realistic target materials and different electron beams , and are found to give similar photon energy distributions and mean energies . The deterministic calculations typically require 1-2 mins of execution time on a Sun Workstation , compared to 2-36 h for the Monte Carlo runs

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

photon energy spectra
deterministic calculations
clinical electron accelerator targets
boltzmann equation
angular range of interest
therapy applications
relative energy spectra

coupled electron-photon transport
one-dimensional slab geometry
3-d monte carlo methods
linear accelerator
therapy planning
integrodifferential equation
pencil beam source representations


Structure of weakly invertible semi-input-memory finite automata with delay 1 Semi-input-memory finite automata , a kind of finite automata introduced by the first author of this paper for studying error propagation , are a generalization of input memory finite automata by appending an autonomous finite automaton component . In this paper , we give a characterization of the structure of weakly invertible semi-input-memory finite automata with delay 1 , in which the state graph of each autonomous finite automaton is a cycle . From a result on mutual invertibility of finite automata obtained by the authors recently , it leads to a characterization of the structure of feedforward inverse finite automata with delay 1

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

finite automata
invertibility
weakly invertible
delay 1
state graph

semi-input-memory
semi-input-memory finite automata
feedforward inverse finite automata


A combinatorial , graph-based solution method for a class of continuous-time optimal control problems The paper addresses a class of continuous-time , optimal control problems whose solutions are typically characterized by both bang-bang and `` singular '' control regimes . Analytical study and numerical computation of such solutions are very difficult and far from complete when only techniques from control theory are used . This paper solves optimal control problems by reducing them to the combinatorial search for the shortest path in a specially constructed graph . Since the nodes of the graph are weighted in a sequence-dependent manner , we extend the classical , shortest-path algorithm to our case . The proposed solution method is currently limited to single-state problems with multiple control functions . A production planning problem and a train operation problem are optimally solved 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 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 O O O O O O O O O O O O O O O O O O O O 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 B I I O O O O O O O

numerical computation
combinatorial search
multiple control functions
production planning problem
train operation problem


Does social capital determine innovation ? To what extent ? This paper deals with two questions : Does social capital determine innovation in manufacturing firms ? If it is the case , to what extent ? To deal with these questions , we review the literature on innovation in order to see how social capital came to be added to the other forms of capital as an explanatory variable of innovation . In doing so , we have been led to follow the dominating view of the literature on social capital and innovation which claims that social capital can not be captured through a single indicator , but that it actually takes many different forms that must be accounted for . Therefore , to the traditional explanatory variables of innovation , we have added five forms of structural social capital -LRB- business network assets , information network assets , research network assets , participation assets , and relational assets -RRB- and one form of cognitive social capital -LRB- reciprocal trust -RRB- . In a context where empirical investigations regarding the relations between social capital and innovation are still scanty , this paper makes contributions to the advancement of knowledge in providing new evidence regarding the impact and the extent of social capital on innovation at the two decisionmaking stages considered in this study

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

innovation
manufacturing firms
business network assets
information network assets
research network assets
participation assets
relational assets
cognitive social capital
structural social capital
reciprocal trust

two-stage decision-making process
degree of radicalness


Word spotting based on a posterior measure of keyword confidence In this paper , an approach of keyword confidence estimation is developed that well combines acoustic layer scores and syllable-based statistical language model -LRB- LM -RRB- scores . An a posteriori -LRB- AP -RRB- confidence measure and its forward-backward calculating algorithm are deduced . A zero false alarm -LRB- ZFA -RRB- assumption is proposed for evaluating relative confidence measures by word spotting task . In a word spotting experiment with a vocabulary of 240 keywords , the keyword accuracy under the AP measure is above 94 % , which well approaches its theoretical upper limit . In addition , a syllable lattice Hidden Markov Model -LRB- SLHMM -RRB- is formulated and a unified view of confidence estimation , word spotting , optimal path search , and N-best syllable re-scoring is presented . The proposed AP measure can be easily applied to various speech recognition systems as well

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

word spotting
a posterior measure
keyword confidence
acoustic layer scores
relative confidence measures
syllable lattice hidden markov model
confidence estimation
optimal path search
speech recognition systems

syllable-based statistical language model scores


Node-capacitated ring routing We consider the node-capacitated routing problem in an undirected ring network along with its fractional relaxation , the node-capacitated multicommodity flow problem . For the feasibility problem , Farkas ' lemma provides a characterization for general undirected graphs , asserting roughly that there exists such a flow if and only if the so-called distance inequality holds for every choice of distance functions arising from nonnegative node weights . For rings , this -LRB- straightforward -RRB- result will be improved in two ways . We prove that , independent of the integrality of node capacities , it suffices to require the distance inequality only for distances arising from -LRB- 0-1-2 -RRB- - valued node weights , a requirement that will be called the double-cut condition . Moreover , for integer-valued node capacities , the double-cut condition implies the existence of a half-integral multicommodity flow . In this case there is even an integer-valued multicommodity flow that violates each node capacity by at most one . Our approach gives rise to a combinatorial , strongly polynomial algorithm to compute either a violating double-cut or a node-capacitated multicommodity flow . A relation of the problem to its edge-capacitated counterpart will also be explained

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

undirected ring network
fractional relaxation
feasibility problem
undirected graphs
distance inequality
distance functions
nonnegative node weights

combinatorial strongly polynomial algorithm


A switching synchronization scheme for a class of chaotic systems In this Letter , we propose an observer-based synchronization scheme for a class of chaotic systems . This class of systems are given by piecewise-linear dynamics . By using some properties of such systems , we give a procedure to construct the gain of the observer . We prove various stability results and comment on the robustness of the proposed scheme . We also present some simulation results

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

switching synchronization scheme
chaotic systems
robustness

piecewise-linear dynamics
state observers


Optimal bandwidth utilization of all-optical ring with a converter of degree 4 In many models of all-optical routing , a set of communication paths in a network is given , and a wavelength is to be assigned to each path so that paths sharing an edge receive different wavelengths . The goal is to assign as few wavelengths as possible , in order to use the optical bandwidth efficiently . If a node of a network contains a wavelength converter , any path that passes through this node may change its wavelength . Having converters at some of the nodes can reduce the number of wavelengths required for routing . This paper presents a wavelength converter with degree 4 and gives a routing algorithm which shows that any routing with load L can be realized with L wavelengths when a node of an all-optical ring hosts such a wavelength converter . It is also proved that 4 is the minimum degree of the converter to reach the full utilization of the available wavelengths if only one node of an all-optical ring hosts a converter

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

communication paths
wavelength converter

all-optical routing
all-optical network
wavelength assignment
wavelength translation
all-optical ring


A transactional asynchronous replication scheme for mobile database systems In mobile database systems , mobility of users has a significant impact on data replication . As a result , the various replica control protocols that exist today in traditional distributed and multidatabase environments are no longer suitable . To solve this problem , a new mobile database replication scheme , the Transaction-Level Result-Set Propagation -LRB- TLRSP -RRB- model , is put forward in this paper . The conflict detection and resolution strategy based on TLRSP is discussed in detail , and the implementation algorithm is proposed . In order to compare the performance of the TLRSP model with that of other mobile replication schemes , we have developed a detailed simulation model . Experimental results show that the TLRSP model provides an efficient support for replicated mobile database systems by reducing reprocessing overhead and maintaining database consistency

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

mobile database
data replication
multidatabase


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

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

interactivity
multicast
conventional patching
customer request rate
hybrid broadcast scheme


Non-optimal universal quantum deleting machine We verify the non-existence of some standard universal quantum deleting machine . Then a non-optimal universal quantum deleting machine is constructed and we emphasize the difficulty for improving its fidelity . In a way , our results complement the universal quantum cloning machine established by Buzek and Hillery -LRB- 1996 -RRB- , and manifest some of their distinctions

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

nonoptimal universal quantum deleting machine


A note on an axiomatization of the core of market games As shown by Peleg -LRB- 1993 -RRB- , the core of market games is characterized by nonemptiness , individual rationality , superadditivity , the weak reduced game property , the converse reduced game property , and weak symmetry . It was not known whether weak symmetry was logically independent . With the help of a certain transitive 4-person TU game , it is shown that weak symmetry is redundant in this result . Hence , the core on market games is axiomatized by the remaining five properties , if the universe of players contains at least four members

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

individual rationality
weak reduced game property
converse reduced game property
weak symmetry
redundant

market game core axiomatization
nonempty games
superadditive games
transitive 4-person tu game