Results 1  10
of
247
Eddies: Continuously Adaptive Query Processing
 In SIGMOD
, 2000
"... In large federated and sharednothing databases, resources can exhibit widely fluctuating characteristics. Assumptions made at the time a query is submitted will rarely hold throughout the duration of query processing. As a result, traditional static query optimization and execution techniques are i ..."
Abstract

Cited by 343 (20 self)
 Add to MetaCart
In large federated and sharednothing databases, resources can exhibit widely fluctuating characteristics. Assumptions made at the time a query is submitted will rarely hold throughout the duration of query processing. As a result, traditional static query optimization and execution techniques are ineffective in these environments. In this paper we introduce a query processing mechanism called an eddy, which continuously reorders operators in a query plan as it runs. We characterize the moments of symmetry during which pipelined joins can be easily reordered, and the synchronization barriers that require inputs from different sources to be coordinated. By combining eddies with appropriate join algorithms, we merge the optimization and execution phases of query processing, allowing each tuple to have a flexible ordering of the query operators. This flexibility is controlled by a combination of fluid dynamics and a simple learning algorithm. Our initial implementation demonstrates prom...
On The Computational Power Of Neural Nets
 JOURNAL OF COMPUTER AND SYSTEM SCIENCES
, 1995
"... This paper deals with finite size networks which consist of interconnections of synchronously evolving processors. Each processor updates its state by applying a "sigmoidal" function to a linear combination of the previous states of all units. We prove that one may simulate all Turing Machines by su ..."
Abstract

Cited by 156 (26 self)
 Add to MetaCart
This paper deals with finite size networks which consist of interconnections of synchronously evolving processors. Each processor updates its state by applying a "sigmoidal" function to a linear combination of the previous states of all units. We prove that one may simulate all Turing Machines by such nets. In particular, one can simulate any multistack Turing Machine in real time, and there is a net made up of 886 processors which computes a universal partialrecursive function. Products (high order nets) are not required, contrary to what had been stated in the literature. Nondeterministic Turing Machines can be simulated by nondeterministic rational nets, also in real time. The simulation result has many consequences regarding the decidability, or more generally the complexity, of questions about recursive nets.
Monotone control systems
, 2002
"... Monotone systems constitute one of the most important classes of dynamical systems used in mathematical biology modeling. The objective of this paper is to extend the notion of monotonicity to systems with inputs and outputs, a necessary first step in trying to understand interconnections, especiall ..."
Abstract

Cited by 89 (32 self)
 Add to MetaCart
Monotone systems constitute one of the most important classes of dynamical systems used in mathematical biology modeling. The objective of this paper is to extend the notion of monotonicity to systems with inputs and outputs, a necessary first step in trying to understand interconnections, especially including feedback loops, built up out of monotone components. Basic definitions and theorems are provided, as well as an application to the study of a model of one of the cell’s most important subsystems.
Effective Synthesis of Switching Controllers for Linear Systems
, 2000
"... In this work we suggest a novel methodology for synthesizing switching controllers for continuous and hybrid systems whose dynamics are defined by linear differential equations. We formulate the synthesis problem as finding the conditions upon which a controller should switch the behavior of the sys ..."
Abstract

Cited by 78 (8 self)
 Add to MetaCart
In this work we suggest a novel methodology for synthesizing switching controllers for continuous and hybrid systems whose dynamics are defined by linear differential equations. We formulate the synthesis problem as finding the conditions upon which a controller should switch the behavior of the system from one "mode" to another in order to avoid a set of bad states, and propose an abstract algorithm which solves the problem by an iterative computation of reachable states. We have implemented a concrete version of the algorithm, which uses a new approximation scheme for reachability analysis of linear systems.
Adaptive Query Processing: Technology in Evolution
 IEEE DATA ENGINEERING BULLETIN
, 2000
"... As query engines are scaled and federated, they must cope with highly unpredictable and changeable environments. In the Telegraph project, we are attempting to architect and implement a continuously adaptive query engine suitable for globalarea systems, massive parallelism, and sensor networks. To ..."
Abstract

Cited by 77 (9 self)
 Add to MetaCart
As query engines are scaled and federated, they must cope with highly unpredictable and changeable environments. In the Telegraph project, we are attempting to architect and implement a continuously adaptive query engine suitable for globalarea systems, massive parallelism, and sensor networks. To set the stage for our research, we present a survey of prior work on adaptive query processing, focusing on three characterizations of adaptivity: the frequency of adaptivity, the effects of adaptivity, and the extent of adaptivity. Given this survey, we sketch directions for research in the Telegraph project.
Turing Computability With Neural Nets
 Applied Mathematics Letters
, 1991
"... . This paper shows the existence of a finite neural network, made up of sigmoidal neurons, which simulates a universal Turing machine. It is composed of less than 10 5 synchronously evolving processors, interconnected linearly. Highorder connections are not required. 1. Introduction This paper a ..."
Abstract

Cited by 60 (13 self)
 Add to MetaCart
. This paper shows the existence of a finite neural network, made up of sigmoidal neurons, which simulates a universal Turing machine. It is composed of less than 10 5 synchronously evolving processors, interconnected linearly. Highorder connections are not required. 1. Introduction This paper addresses the question: What ultimate limitations, if any, are imposed by the use of neural nets as computing devices? In particular, and ignoring issues of training and practicality of implementation, one would like to know if every problem that can be solved by a digital computer is also solvable in principle using a net. This question has been asked before in the literature. Indeed, Jordan Pollack ([7]) showed that a certain recurrent net model which he called a "neuring machine," for "neural Turing" is universal. In his model, all neurons synchronously update their states according to a quadratic combination of past activation values. In general, one calls highorder nets those in...
A general result on the stabilization of linear systems using bounded controls
 IEEE Transactions on Automatic Control
, 1994
"... We present two constructions of controllers that globally stabilize linear systems subject to control saturation. We allow essentially arbitrary saturation functions. The only conditions imposed on the system are the obvious necessary ones, namely that no eigenvalues of the uncontrolled system have ..."
Abstract

Cited by 60 (8 self)
 Add to MetaCart
We present two constructions of controllers that globally stabilize linear systems subject to control saturation. We allow essentially arbitrary saturation functions. The only conditions imposed on the system are the obvious necessary ones, namely that no eigenvalues of the uncontrolled system have positive real part and that the standard stabilizability rank condition hold. One of the constructions is in terms of a ”neuralnetwork type ” onehidden layer architecture, while the other one is in terms of cascades of linear maps and saturations.
Remarks on input to output stability
 Proceedings of the IEEE Conference on Decision and Control
, 1999
"... This paper deals with concepts of output stability. Inspired in part by regulator theory, several variants are considered, which differ from each other in the requirements imposed upon transient behavior. The main results provide a comparison among the various notions, all of which specialize to inp ..."
Abstract

Cited by 54 (14 self)
 Add to MetaCart
This paper deals with concepts of output stability. Inspired in part by regulator theory, several variants are considered, which differ from each other in the requirements imposed upon transient behavior. The main results provide a comparison among the various notions, all of which specialize to input to state stability (iss) when the output equals the complete state.
Asymptotic Controllability Implies Feedback Stabilization
 IEEE Trans. Autom. Control
, 1999
"... It is shown that every asymptotically controllable system can be globally stabilized by means of some (discontinuous) feedback law. The stabilizing strategy is based on pointwise optimization of a smoothed version of a controlLyapunov function, iteratively sending trajectories into smaller and smal ..."
Abstract

Cited by 53 (7 self)
 Add to MetaCart
It is shown that every asymptotically controllable system can be globally stabilized by means of some (discontinuous) feedback law. The stabilizing strategy is based on pointwise optimization of a smoothed version of a controlLyapunov function, iteratively sending trajectories into smaller and smaller neighborgoods of a desired equilibrium. A major technical problem, and one of contributions of the present paper, concerns the precise meaning of "solution" when using a discontinuous controller. I. Introduction A longstanding open question in nonlinear control theory concerns the relationship between asymptotic controllability to the origin in R n of a nonlinear system x = f(x; u) (1) by an "open loop" control u : [0; +1) ! U and the existence of a feedback control k : R n ! U which stabilizes trajectories of the system x = f(x; k(x)) (2) with respect to the origin. For the special case of linear control systems x = Ax + Bu, this relationship is well understood: asymptotic cont...
Forward completeness, unboundedness observability, and their Lyapunov characterizations
 Systems & Control Letters
, 1999
"... Universit`a di Firenze, Via di Santa Marta 3, ..."