1,605 research outputs found
Overview of Federal wind energy program
The objectives and strategies of the Federal wind energy program are described. Changes in the program structure and some of the additions to the program are included. Upcoming organizational changes and some budget items are discussed, with particular emphasis on recent significant events regarding new approvals
Parametric trace expressions for runtime verification of Java-like programs
Parametric trace expressions are a formalism expressly designed for parametric runtime verification (RV) which has been introduced and successfully employed in the context of runtime monitoring of multiagent systems. Trace expressions are built on the general notion of event type, which allows them to be adopted in different contexts. In this paper we show how trace expressions can be used for conveniently specifying the expected behavior of a Java-like program to be monitored at runtime. Furthermore, we investigate the basic properties of the primitive operators on which trace expressions are coinductively defined in terms of a labeled transition system; this provides a basis for formal reasoning about equivalence of trace expressions and for adopting useful optimization techniques to speed up runtime verification
Coinductive subtyping for abstract compilation of object-oriented languages into Horn formulas
In recent work we have shown how it is possible to define very precise type
systems for object-oriented languages by abstractly compiling a program into a
Horn formula f. Then type inference amounts to resolving a certain goal w.r.t.
the coinductive (that is, the greatest) Herbrand model of f.
Type systems defined in this way are idealized, since in the most interesting
instantiations both the terms of the coinductive Herbrand universe and goal
derivations cannot be finitely represented. However, sound and quite expressive
approximations can be implemented by considering only regular terms and
derivations. In doing so, it is essential to introduce a proper subtyping
relation formalizing the notion of approximation between types.
In this paper we study a subtyping relation on coinductive terms built on
union and object type constructors. We define an interpretation of types as set
of values induced by a quite intuitive relation of membership of values to
types, and prove that the definition of subtyping is sound w.r.t. subset
inclusion between type interpretations. The proof of soundness has allowed us
to simplify the notion of contractive derivation and to discover that the
previously given definition of subtyping did not cover all possible
representations of the empty type
Leave-one-out prediction error of systolic arterial pressure time series under paced breathing
In this paper we show that different physiological states and pathological
conditions may be characterized in terms of predictability of time series
signals from the underlying biological system. In particular we consider
systolic arterial pressure time series from healthy subjects and Chronic Heart
Failure patients, undergoing paced respiration. We model time series by the
regularized least squares approach and quantify predictability by the
leave-one-out error. We find that the entrainment mechanism connected to paced
breath, that renders the arterial blood pressure signal more regular, thus more
predictable, is less effective in patients, and this effect correlates with the
seriousness of the heart failure. The leave-one-out error separates controls
from patients and, when all orders of nonlinearity are taken into account,
alive patients from patients for which cardiac death occurred
Some Results on the Boundary Control of Systems of Conservation Laws
This note is concerned with the study of the initial boundary value problem
for systems of conservation laws from the point of view of control theory,
where the initial data is fixed and the boundary data are regarded as control
functions. We first consider the problem of controllability at a fixed time for
genuinely nonlinear Temple class systems, and present a description of the set
of attainable configurations of the corresponding solutions in terms of
suitable Oleinik-type estimates. We next present a result concerning the
asymptotic stabilization near a constant state for general systems.
Finally we show with an example that in general one cannot achieve exact
controllability to a constant state in finite time.Comment: 10 pages, 4 figures, conferenc
Quantum and Classical Glass Transitions in
When performed in the proper low field, low frequency limits, measurements of
the dynamics and the nonlinear susceptibility in the model Ising magnet in
transverse field, , prove the existence
of a spin glass transition for = 0.167 and 0.198. The classical behavior
tracks for the two concentrations, but the behavior in the quantum regime at
large transverse fields differs because of the competing effects of quantum
entanglement and random fields.Comment: 5 pages, 5 figures. Updated figure 3 with corrected calibration
information for thermometr
Equality of Corecursive Streams Defined by Finitary Equational Systems
In recent work, non-regular streams have been defined corecursively, by representing them with finitary equational systems built on top of various operators, besides the standard constructor. With finitary equational systems based only on the stream constructor, one can use the free theory of regular (a.k.a. rational) trees to get a sound and complete procedure to decide whether two streams are equal. However, this is not the case if one allows other operators in equations, since the underlying equational theory becomes non-trivial, hence equality of regular trees is too strong to guarantee termination of corecursive functions defined even only with the constructor and tail operators. To overcome this problem, we provide a weaker definition of equality between streams denoted by finitary equational systems built on different stream operators, including tail operator and constructor, and prove its soundness
Enhancing Expressivity of Checked Corecursive Streams
We propose a novel approach to stream definition and manipulation. Our solution is based on two key ideas. Regular corecursion, which avoids non termination by detecting cyclic calls, is enhanced, by allowing in equations defining streams other operators besides the stream constructor. In this way, some non-regular streams are definable. Furthermore, execution includes a runtime check to ensure that the stream generated by a function call is well-defined, in the sense that access to an arbitrary index always succeeds. We extend the technique beyond the simple stream operators considered in previous work, notably by adding an interleaving combinator which has a non-trivial recursion scheme
Corecursive featherweight Java revisited
We describe a Java-like calculus which supports cyclic data structures, and offers a mechanism of flexible regular corecursion for their manipulation. The calculus enhances an earlier proposal by a more sophisticated reduction semantics, which filters out, by an additional check, some spurious results which were obtained in the previous model
- …