Silicon debug of a PowerPC TM microprocessor using model checking When silicon is available , newly designed microprocessors are tested in specially equipped hardware laboratories , where real applications can be run at hardware speeds . However , the large volumes of code being run , plus the limited access to the internal nodes of the chip , make it very difficult to characterize the nature of any failures that occur . We describe how temporal logic model checking was used to quickly characterize a design error exhibited during hardware testing of a PowerPC microprocessor . We outline the conditions under which model checking can efficiently characterize such failures , and show how the particular error we detected could have been revealed early in the design cycle , by model checking a short and simple correctness specification . We discuss the implications of this for verification methodologies over the full design cycle

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

powerpc microprocessor
model checking
temporal logic
hardware testing
correctness specification
verification methodologies

circuit design error
computation tree logic
circuit debugging


Take it to the next level -LSB- law firm innovation -RSB- It 's called innovating . Our clients do it . Our culture worships it . Our future hinges on it . Why is it so difficult in law firms ? How can we make it easier ? Viva la difference !

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


Estimation of blocking probabilities in cellular networks with dynamic channel assignment Blocking probabilities in cellular mobile communication networks using dynamic channel assignment are hard to compute for realistic sized systems . This computational difficulty is due to the structure of the state space , which imposes strong coupling constraints amongst components of the occupancy vector . Approximate tractable models have been proposed , which have product form stationary state distributions . However , for real channel assignment schemes , the product form is a poor approximation and it is necessary to simulate the actual occupancy process in order to estimate the blocking probabilities . Meaningful estimates of the blocking probability typically require an enormous amount of CPU time for simulation , since blocking events are usually rare . Advanced simulation approaches use importance sampling -LRB- IS -RRB- to overcome this problem . We study two regimes under which blocking is a rare event : low-load and high cell capacity . Our simulations use the standard clock -LRB- SC -RRB- method . For low load , we propose a change of measure that we call static ISSC , which has bounded relative error . For high capacity , we use a change of measure that depends on the current state of the network occupancy . This is the dynamic ISSC method . We prove that this method yields zero variance estimators for single clique models , and we empirically show the advantages of this method over naive simulation for networks of moderate size and traffic loads

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

blocking probability estimation
low-load
standard clock method
static issc method
quality of service
network traffic load


Algebraic conditions for high-order convergent deferred correction schemes based on Runge-Kutta-Nystrom methods for second order boundary value problems In -LSB- T. Van Hecke , M. Van Daele , J. Comp . Appl . Math. , vol . 132 , p. 107-125 , -LRB- 2001 -RRB- -RSB- the investigation of high-order convergence of deferred correction schemes for the numerical solution of second order nonlinear two-point boundary value problems not containing the first derivative , is made . The derivation of the algebraic conditions to raise the increase of order by the deferred correction scheme was based on Taylor series expansions . In this paper we describe a more elegant way by means of P-series to obtain this necessary conditions and generalize this idea to equations of the form y '' = f -LRB- t , y , y ' -RRB-

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

second order boundary value problems
deferred correction schemes
algebraic conditions
taylor series expansions


Convergence of Runge-Kutta methods for nonlinear parabolic equations We study time discretizations of fully nonlinear parabolic differential equations . Our analysis uses the fact that the linearization along the exact solution is a uniformly sectorial operator . We derive smooth and nonsmooth-data error estimates for the backward Euler method , and we prove convergence for strongly A -LRB- v -RRB- - stable Runge-Kutta methods . For the latter , the order of convergence for smooth solutions is essentially determined by the stage order of the method . Numerical examples illustrating the convergence estimates are presented

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

runge-kutta method convergence
nonsmooth-data error estimates
data error estimates


Modeling group foraging : individual suboptimality , interference , and a kind of matching A series of agent-based models support the hypothesis that behaviors adapted to a group situation may be suboptimal -LRB- or `` irrational '' -RRB- when expressed by an isolated individual . These models focus on two areas of current concern in behavioral ecology and experimental psychology : the `` interference function '' -LRB- which relates the intake rate of a focal forager to the density of conspecifics -RRB- and the `` matching law '' -LRB- which formalizes the observation that many animals match the frequency of their response to different stimuli in proportion to the reward obtained from each stimulus type -RRB- . Each model employs genetic algorithms to evolve foraging behaviors for multiple agents in spatially explicit environments , structured at the level of situated perception and action . A second concern of the article is to extend the understanding of both matching and interference per se by modeling at this level

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

group foraging
individual suboptimality
group situation
isolated individual
behavioral ecology
experimental psychology
interference function
focal forager
matching law
genetic algorithms
multiple agents
spatially explicit environments
situated perception

agent-based models
suboptimal behavior
situated action


Do you see what I see ? -LSB- visual technology in law firms -RSB- Think of how well-done computer presentations can aid in the learning experience . They are , however , less common in client meetings , settlement conferences and the courtroom . And you have to wonder why , when the same benefits of attention focus and visual learning apply in those legal communication settings . The software and hardware components are easy to use , and they 're increasingly affordable to boot . The next time you need to convey a point to an audience -LRB- be it one person or many -RRB- , think of how you might benefit from the visual impact available through presentation software like PowerPoint . Anyone will understand you more easily when assisted by visual input , and it may make all the difference in reaching visual-focused learners

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

computer presentations
visual technology
law firms
powerpoint


Automating the compliance and supervision process New technology enables large broker/dealers to supervise and ensure compliance across multiple branches and managers

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


Controlling in between the Lorenz and the Chen systems This letter investigates a new chaotic system and its role as a joint function between two complex chaotic systems , the Lorenz and the Chen systems , using a simple variable constant controller . With the gradual tuning of the controller , the controlled system evolves from the canonical Lorenz attractor to the Chen attractor through the new transition chaotic attractor . This evolving procedure reveals the forming mechanisms of all similar and closely related chaotic systems , and demonstrates that a simple control technique can be very useful in generating and analyzing some complex chaotic dynamical phenomena

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

tuning
lorenz attractor
transition chaotic attractor

chen attractors
chen system
lorenz system


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

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

six-dimensional model
power system stability


A large deviations analysis of the transient of a queue with many Markov fluid inputs : approximations and fast simulation This article analyzes the transient buffer content distribution of a queue fed by a large number of Markov fluid sources . We characterize the probability of overflow at time t , given the current buffer level and the number of sources in the on-state . After scaling buffer and bandwidth resources by the number of sources n , we can apply large deviations techniques . The transient overflow probability decays exponentially in n . In the case of exponential on/off sources , we derive an expression for the decay rate of the rare event probability under consideration . For general Markov fluid sources , we present a plausible conjecture . We also provide the `` most likely path '' from the initial state to overflow -LRB- at time t -RRB- . Knowledge of the decay rate and the most likely path to overflow leads to -LRB- i -RRB- approximations of the transient overflow probability and -LRB- ii -RRB- efficient simulation methods of the rare event of buffer overflow . The simulation methods , based on importance sampling , give a huge speed-up compared to straightforward simulations . The approximations are of low computational complexity and are accurate , as verified by means of simulation experiments

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

large deviations analysis
markov fluid inputs
transient buffer content distribution
bandwidth resources
approximations
transient overflow probability
simulation methods
importance sampling
computational complexity

buffer resources
atm multiplexers
ip routers
queuing theory


Vehicle travel time models for AGV systems under various dispatching rules The design and evaluation of AGV-based material handling systems are highly complex because of the randomness and the large number of variables involved . Vehicle travel time is a fundamental parameter for solving various flexible manufacturing system -LRB- FMS -RRB- design problems . This article presents stochastic vehicle travel time models for AGV-based material handling systems with emphasis on the empty travel times of vehicles . Various vehicle dispatching rules examined here include the nearest vehicle selection rule and longest idle vehicle selection rule . A simulation experiment is used to evaluate and demonstrate the presented models

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

agv
material handling systems
vehicle travel time
flexible manufacturing system
fms
vehicle dispatching rules
nearest vehicle selection rule
longest idle vehicle selection rule


Cross-entropy and rare events for maximal cut and partition problems We show how to solve the maximal cut and partition problems using a randomized algorithm based on the cross-entropy method . For the maximal cut problem , the proposed algorithm employs an auxiliary Bernoulli distribution , which transforms the original deterministic network into an associated stochastic one , called the associated stochastic network -LRB- ASN -RRB- . Each iteration of the randomized algorithm for the ASN involves the following two phases : -LRB- 1 -RRB- generation of random cuts using a multidimensional Ber -LRB- p -RRB- distribution and calculation of the associated cut lengths -LRB- objective functions -RRB- and some related quantities , such as rare-event probabilities ; -LRB- 2 -RRB- updating the parameter vector p on the basis of the data collected in the first phase . We show that the Ber -LRB- p -RRB- distribution converges in distribution to a degenerated one , Ber -LRB- p/sub d / * -RRB- , p/sub d / * = -LRB- p/sub d / , / sub 1 / , p/sub d , n / -RRB- in the sense that some elements of p/sub d / * , will be unities and the rest zeros . The unity elements of p/sub d / * uniquely define a cut which will be taken as the estimate of the maximal cut . A similar approach is used for the partition problem . Supporting numerical results are given as well . Our numerical studies suggest that for the maximal cut and partition problems the proposed algorithm typically has polynomial complexity in the size of the network

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

bernoulli distribution
deterministic network
associated stochastic network
random cuts
numerical results
polynomial complexity
partition problems
randomized algorithm

cross entropy method
rare event simulation
probability
combinatorial optimization
importance sampling
maximal cut problems


Production capacity of flexible manufacturing systems with fixed production ratios Determining the production capacity of flexible manufacturing systems is a very important issue in the design of such systems . We propose an approach for determining the production capacity -LRB- i.e. the maximum production rate -RRB- of a flexible manufacturing system with several part types , dedicated pallets , and fixed production ratios among the different part types . We show that the problem reduces to the determination of a single parameter for which we propose an iterative procedure . Simulation or approximate analytical techniques can be used as the building block performance evaluation technique in the iterative procedure

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

multiple part type
single parameter determination
stability condition
numerical experiments


How to drive strategic innovation -LSB- law firms -RSB- Innovation . It has everything to do with organization and attitude . Marginal improvement is n't enough anymore . Convert your problem-solving skills into a new value for the entire firm . 10 initiatives

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


Stabilization of global invariant sets for chaotic systems : an energy based control approach This paper presents a new control approach for steering trajectories of three-dimensional nonlinear chaotic systems towards stable stationary states or time-periodic orbits . The proposed method mainly consists in a sliding mode-based control design that is extended by an explicit consideration of system energy as basis for both controller design and system stabilization . The control objective is then to regulate the energy with respect to a shaped nominal representation implicitly related to system trajectories . In this paper , we establish some theoretical results to introduce the control design approach referred to as energy based sliding mode control . Then , some capabilities of the proposed approach are illustrated through examples related to the chaotic circuit of Chua

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

stable stationary states
energy based sliding mode control
global invariant sets


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

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

bisimulation minimization
symbolic model checking
state space minimization techniques
state explosion
experimental results
optimization
invariance properties
backwards reachability
invariance verification

explicit-state verification tools
bdd
binary decision diagram


VoIP : leveraging existing cable architecture As operators prepare to enter the voice-over-IP fray , they are searching for ways to leverage their existing two-way , interactive infrastructure . There are several approaches for supporting VoIP on top of the core IP transport network . The one garnering the most interest , especially in the United States , is based on the PacketCable 1.x architecture . This article discusses the PacketCable-based approach

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

cable architecture
voip
core ip transport network
united states

voice-over-ip
two-way interactive infrastructure
packetcable 1.x architecture
packetcable-based approach


Homogenization in L/sup infinity / Homogenization of deterministic control problems with L/sup infinity / running cost is studied by viscosity solutions techniques . It is proved that the value function of an L/sup infinity / problem in a medium with a periodic micro-structure converges uniformly on the compact sets to the value function of the homogenized problem as the period shrinks to 0 . Our main convergence result extends that of Ishii -LRB- Stochastic Analysis , control , optimization and applications , pp. 305-324 , Birkhauser Boston , Boston , MA , 1999 . -RRB- to the case of a discontinuous Hamiltonian . The cell problem is solved , but , as nonuniqueness occurs , the effective Hamiltonian must be selected in a careful way . The paper also provides a representation formula for the effective Hamiltonian and gives illustrations to calculus of variations , averaging and one-dimensional problems

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

deterministic control
homogenization
value function
averaging
calculus of variations
convergence
cell problem

l/sup infinity / running cost
optimal control


OMS battle heating up as Chicago Equity ousts LongView for Macgregor Chicago Equity Partners LLC has gone into full production with Macgregor 's Financial Trading Platform . This marks a concentrated effort to achieve straight-through processing

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

chicago equity partners
macgregor
financial trading platform
longview


Modular and visual specification of hybrid systems : an introduction to HyCharts Visual description techniques are particularly important for the design of hybrid systems , because specifications of such systems usually have to be discussed between engineers from a number of different disciplines . Modularity is vital for hybrid systems not only because it allows to handle large systems , but also because it permits to think in terms of components , which is familiar to engineers . Based on two different interpretations for hierarchic graphs and on a clear hybrid computation model , we develop HyCharts . HyCharts consist of two modular visual formalisms , one for the specification of the architecture and one for the specification of the behavior of hybrid systems . The operators on hierarchic graphs enable us to give a surprisingly simple denotational semantics for many concepts known from statechart-like formalisms . Due to a very general composition operator , HyCharts can easily be composed with description techniques from other engineering disciplines . Such heterogeneous system specifications seem to be particularly appropriate for hybrid systems because of their interdisciplinary character

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

visual specification
hybrid systems
hycharts
visual description techniques
components
hierarchic graphs
hybrid computation model
denotational semantics
heterogeneous system specifications

modular specification
statechart
formal specification


A dynamic checkpoint scheduling scheme for fault tolerant distributed computing systems The selection of the optimal checkpointing interval has been a very critical issue in implementing checkpointing-recovery schemes for fault tolerant distributed systems . This paper presents a new scheme that allows a process to select the proper checkpointing interval dynamically . A process in the system evaluates the cost of checkpointing and possible rollback for each checkpointing interval and selects the proper time interval for the next checkpointing . Unlike the other schemes , the overhead incurred by both the checkpointing and rollback activities are considered for the cost evaluation , and the current communication pattern is reflected in the selection of the checkpointing interval . Moreover , the proposed scheme requires no extra message communication for the checkpointing interval selection and can easily be incorporated into the existing checkpointing coordination schemes

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

dynamic checkpoint scheduling scheme
distributed computing systems
optimal checkpointing interval
cost evaluation
communication pattern

fault tolerant computing
rollback recovery


From the DOS dog days to e-filing -LSB- law firms -RSB- The poster child for a successful e-filing venture is the Case Management and Electronic Case File system now rolling through the district and bankruptcy courts . A project of the Administrative Office of the United States Courts , CM/ECF is a loud proponent of the benefits of the PDF approach and it has a full head of steam . Present plans are for all federal courts to implement CM/ECF by 2005 . That means a radical shift in methodology and tools for a lot of lawyers . It also means that you should get cozy with Acrobat real soon

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

case management and electronic case file system


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

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

optimal control
transport equation
liouville machine
scattering behavior
physical particles
adaptive behavior


Philadelphia stock exchange taps TimesTen for database technology PHLX rolls out Equity Options AutoQuote System to traders as the first application to leverage its enhanced data architecture

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

philadelphia stock exchange
timesten
equity options autoquote system
data architecture


Extrapolation in Lie groups with approximated BCH-formula We present an extrapolation algorithm for the integration of differential equations in Lie groups which is a suitable generalization of the well-known GBS-algorithm for ODEs . Sufficiently accurate approximations to the BCH-formula are required to reach a given order . We give such approximations with a minimized number of commutators

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

approximated bch-formula
gbs-algorithm
geometric integration
extrapolation methods


Wavelet-based level-of-detail representation of 3D objects In this paper , we propose a 3D object LOD -LRB- Level of Detail -RRB- modeling system that constructs a mesh from range images and generates the mesh of various LOD using the wavelet transform . In the initial mesh generation , we use the marching cube algorithm . We modify the original algorithm to apply it to construct the mesh from multiple range images efficiently . To get the base mesh we use the decimation algorithm which simplifies a mesh with preserving the topology . Finally , when reconstructing new mesh which is similar to initial mesh we calculate the wavelet coefficients by using the wavelet transform . We solve the critical problem of wavelet-based methods - the surface crease problem - by using the mesh simplification as the base mesh generation 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 B I O O O O O O O O O B I O O O O O O O O O O B I I O O O O O O O O O O O O O O O B I O O O O O B I O O O B I O O O O O O O O O O O O O O O O O O O O O O O O B I O O O B I O O O O B I O O O O O B I I O O O O B I O O B I O O

range images
wavelet transform
marching cube algorithm
base mesh
decimation algorithm
wavelet coefficients
critical problem
surface crease problem
mesh simplification

3d object level of detail modeling system


Behavior of Runge-Kutta discretizations near equilibria of index 2 differential algebraic systems We analyze Runge-Kutta discretizations applied to index 2 differential algebraic equations -LRB- DAE 's -RRB- near equilibria . We compare the geometric properties of the numerical and the exact solutions . It is shown that projected and half-explicit Runge-Kutta methods reproduce the qualitative features of the continuous system in the vicinity of an equilibrium correctly . The proof combines cut-off and scaling techniques for index 2 differential algebraic equations with some invariant manifold results of Schropp -LRB- Geometric properties of Runge-Kutta discretizations for index 2 differential algebraic equations , Konstanzer Schriften in Mathematik und Informatik 128 -RRB- and classical results for discretized ordinary differential equations

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

runge-kutta discretizations
half-explicit runge-kutta methods
cut-off techniques


Proof that the election problem belongs to NF-completeness problems in asynchronous distributed systems This paper is about the hardness of the election problem in asynchronous distributed systems in which processes can crash but links are reliable . The hardness of the problem is defined with respect to the difficulty to solve it despite failures . It is shown that problems encountered in the system are classified as three classes of problems : F -LRB- fault-tolerant -RRB- , NF -LRB- Not fault-tolerant -RRB- and NFC -LRB- NF-completeness -RRB- . Among those , the class NFC are the hardest problems to solve . In this paper , we prove that the Election problem is the most difficult problem which belongs to the class NFC

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

election problem
asynchronous distributed systems

nf-completeness problems
distributed computing
leader election
failure detectors
fault-tolerant problems
not-fault-tolerant problems


Discreteness and relevance : a reply to Roman Poznanski In reply to Poznanski -LRB- see ibid. , p. 435 , 2002 -RRB- on discreteness and relevance , Eliasmith claims that all of the concerns voiced by Poznanski in his reply fail to offer a serious challenge to the idea that continuity is irrelevant to a good understanding of cognitive systems . Eliasmith hopes that it is evident that he does not claim that the process in neural systems is discrete , but rather that a complete characterization of the process can be discrete ; these of course are significantly different claims

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

discreteness
relevance
continuity
cognitive systems
neural systems


Pipelined broadcast with enhanced wormhole routers This paper proposes a pipelined broadcast that broadcasts a message of size m in O -LRB- m + n-1 -RRB- time in an n-dimensional hypercube . It is based on the replication tree , which is derived from reachable sets . It has greatly improved performance compared to Ho-Kao 's -LRB- 1995 -RRB- algorithm with the time of O -LRB- m -LSB- n/log -LRB- n +1 -RRB- -RSB- -RRB- . The communication in the broadcast uses an all-port wormhole router with message replication capability . This paper includes the algorithm together with performance comparisons to previous schemes in a practical implementation

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

enhanced wormhole routers
replication tree
reachable sets
performance
message replication capability
pipelined broadcast

message broadcast
n-dimensional hypercube
communication complexity
all-port wormhole router
intermediate reception


Sliding mode control of chaos in the cubic Chua 's circuit system In this paper , a sliding mode controller is applied to control the cubic Chua 's circuit system . The sliding surface of this paper used is one dimension higher than the traditional surface and guarantees its passage through the initial states of the controlled system . Therefore , using the characteristic of this sliding mode we aim to design a controller that can meet the desired specification and use less control energy by comparing with the result in the current existing literature . The results show that the proposed controller can steer Chua 's circuit system to the desired state without the chattering phenomenon and abrupt state change

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

sliding mode control
chaos
sliding surface
chattering
state change

cubic chua circuit system
match disturbance
mismatch disturbance


Efficient combinational verification using overlapping local BDDs and a hash table We propose a novel methodology that combines local BDDs -LRB- binary decision diagrams -RRB- with a hash table for very efficient verification of combinational circuits . The main purpose of this technique is to remove the considerable overhead associated with case-by-case verification of internal node pairs in typical internal correspondence based verification methods . Two heuristics based on the number of structural levels of circuitry looked at and the total number of nodes in the BDD manager are used to control the BDD sizes and introduce new cutsets based on already found equivalent nodes . We verify the ISCAS85 benchmark circuits and demonstrate significant speedup over existing methods . We also verify several hard industrial circuits and show our superiority in extracting internal equivalences

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


Design and implementation of a flexible manufacturing control system using neural network Design and implementation of a sequential controller based on the concept of artificial neural networks for a flexible manufacturing system are presented . The recurrent neural network -LRB- RNN -RRB- type is used for such a purpose . Contrary to the programmable controller , an RNN-based sequential controller is based on a definite mathematical model rather than depending on the experience and trial and error techniques . The proposed controller is also more flexible because it is not limited by the restrictions of the finite state automata theory . Adequate guidelines of how to construct an RNN-based sequential controller are presented . These guidelines are applied to different case studies . The proposed controller is tested by simulations and real-time experiments . These tests prove the successfulness of the proposed controller performances . Theoretical as well as experimental results are presented and discussed indicating that the proposed design procedure using Elman 's RNN can be effective in designing a sequential controller for event-based type manufacturing systems . In addition , the simulation results assure the effectiveness of the proposed controller to overcome the effect of noisy inputs

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

finite state automata
noisy inputs
programmable controller
recurrent neural network

elman network
flexible manufacturing systems
ladder language
pneumatic system
sequential control
learning
fms


Controlled projective synchronization in nonpartially-linear chaotic systems Projective synchronization -LRB- PS -RRB- , in which the state vectors synchronize up to a scaling factor , is usually observable only in partially linear systems . We show that PS could , by means of control , be extended to general classes of chaotic systems with nonpartial linearity . Performance of PS may also be manipulated by controlling the scaling factor to any desired value . In numerical experiments , we illustrate the applications to a Rossler system and a Chua 's circuit . The feasibility of the control for high dimensional systems is demonstrated in a hyperchaotic system

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

projective synchronization
scaling factor
rossler system
control
hyperchaotic system

nonpartially-linear chaotic systems
chua's circuit


Quantum sensitive dependence Wave functions of bounded quantum systems with time-independent potentials , being almost periodic functions , can not have time asymptotics as in classical chaos . However , bounded quantum systems with time-dependent interactions , as used in quantum control , may have continuous spectrum and the rate of growth of observables is an issue of both theoretical and practical concern . Rates of growth in quantum mechanics are discussed by constructing quantities with the same physical meaning as those involved in the classical Lyapunov exponent . A generalized notion of quantum sensitive dependence is introduced and the mathematical structure of the operator matrix elements that correspond to different types of growth is characterized

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

quantum sensitive dependence
wave functions
bounded quantum systems
periodic functions
time asymptotics
classical chaos
quantum control
classical lyapunov exponent
operator matrix elements

time-independent potentials
time-dependent interactions
quantum complexity