79 -
Bernardo Hernandez PhD student at then Department of Automatic Control
, Systems Engineering
2015
This paper presents a new approach to deal with the dual problem of system identification and regulation. The main feature consists of breaking the control input to the system into a regulator part and a persistently exciting part. The former is used
to regulate the plant using a robust MPC formulation, in which the latter is treated as a bounded additive disturbance. The identification process is executed by a simple recursive least squares algorithm. In order to guarantee sufficient excitation for the identification, an additional non-convex constraint is enforced over the persistently exciting part.
Dynamic programming languages, such as PHP, JavaScript, and Python, provide built-in data structures including associative arrays and objects with similar semantics-object properties can be created at run-time and accessed via arbitrary expressions.
While a high level of security and safety of applications written in these languages can be of a particular importance (consider a web application storing sensitive data and providing its functionality worldwide), dynamic data structures pose significant challenges for data-flow analysis making traditional static verification methods both unsound and imprecise. In this paper, we propose a sound and precise approach for value and points-to analysis of programs with associative arrays-like data structures, upon which data-flow analyses can be built. We implemented our approach in a web-application domain-in an analyzer of PHP code.
102 -
Harsh Beohar
, Mohammad Reza Mousavi (Center for Research on Embeddedn Systems Halmstad University
2014
A major challenge in testing software product lines is efficiency. In particular, testing a product line should take less effort than testing each and every product individually. We address this issue in the context of input-output conformance testin
g, which is a formal theory of model-based testing. We extend the notion of conformance testing on input-output featured transition systems with the novel concept of spinal test suites. We show how this concept dispenses with retesting the common behavior among different, but similar, products of a software product line.
Over the last years, analyses performed on a stochastic model of catalytic reaction networks have provided some indications about the reasons why wet-lab experiments hardly ever comply with the phase transition typically predicted by theoretical mode
ls with regard to the emergence of collectively self-replicating sets of molecule (also defined as autocatalytic sets, ACSs), a phenomenon that is often observed in nature and that is supposed to have played a major role in the emergence of the primitive forms of life. The model at issue has allowed to reveal that the emerging ACSs are characterized by a general dynamical fragility, which might explain the difficulty to observe them in lab experiments. In this work, the main results of the various analyses are reviewed, with particular regard to the factors able to affect the generic properties of catalytic reactions network, for what concerns, not only the probability of ACSs to be observed, but also the overall activity of the system, in terms of production of new species, reactions and matter.
The Wivace 2013 Electronic Proceedings in Theoretical Computer Science (EPTCS) contain some selected long and short articles accepted for the presentation at Wivace 2013 - Italian Workshop on Artificial Life and Evolutionary Computation, which was he
ld at the University of Milan-Bicocca, Milan, on the 1st and 2nd of July, 2013.
We present a graphical and dynamic framework for binding and execution of business) process models. It is tailored to integrate 1) ad hoc processes modeled graphically, 2) third party services discovered in the (Inter)net, and 3) (dynamically) synthe
sized process chains that solve situation-specific tasks, with the synthesis taking place not only at design time, but also at runtime. Key to our approach is the introduction of type-safe stacked second-order execution contexts that allow for higher-order process modeling. Tamed by our underlying strict service-oriented notion of abstraction, this approach is tailored also to be used by application experts with little technical knowledge: users can select, modify, construct and then pass (component) processes during process execution as if they were data. We illustrate the impact and essence of our framework along a concrete, realistic (business) process modeling scenario: the development of Springers browser-based Online Conference Service (OCS). The most advanced feature of our new framework allows one to combine online synthesis with the integration of the synthesized process into the running application. This ability leads to a particularly flexible way of implementing self-adaption, and to a particularly concise and powerful way of achieving variability not only at design time, but also at runtime.
In this paper we extend and prove in detail the Finite Rank Theorem for connection matrices of graph parameters definable in Monadic Second Order Logic with counting (CMSOL) from B. Godlin, T. Kotek and J.A. Makowsky (2008) and J.A. Makowsky (2009).
We demonstrate its vast applicability in simplifying known and new non-definability results of graph properties and finding new non-definability results for graph parameters. We also prove a Feferman-Vaught Theorem for the logic CFOL, First Order Logic with the modular counting quantifiers.
73 -
P. Di Cintio (1 Max Planck Institute for then Physics of Complex Systems
, Dresden - 2 Astronomy Dept.
2011
The process of relaxation of a system of particles interacting with long-range forces is relevant to many areas of Physics. For obvious reasons, in Stellar Dynamics much attention has been paid to the case of 1/r^2 force law. However, recently the in
terest in alternative gravities emerged, and significant differences with respect to Newtonian gravity have been found in relaxation phenomena. Here we begin to explore this matter further, by using a numerical model of spherical shells interacting with an 1/r^alpha force law obeying the superposition principle. We find that the virialization and phase-mixing times depend on the exponent alpha, with small values of alpha corresponding to longer relaxation times, similarly to what happens when comparing for N-body simulations in classical gravity and in Modified Newtonian Dynamics.
This paper presents accurate absolute positions from a 24 GHz Very Long Baseline Array (VLBA) search for compact extragalactic sources in an area where the density of known calibrators with precise coordinates is low. The goals were to identify addit
ional sources suitable for use as phase calibrators for galactic sources, determine their precise positions, and produce radio images. In order to achieve these goals, we developed a new software package, PIMA, for determining group delays from wide-band data with much lower detection limit. With the use of PIMA we have detected 327 sources out of 487 targets observed in three 24 hour VLBA experiments. Among the 327 detected objects, 176 are within 10 degrees of the Galactic plane. This VGaPS catalogue of source positions, plots of correlated flux density versus projected baseline length, contour plots, as well as weighted CLEAN images and calibrated visibility data in FITS format, are available on the Web at http://astrogeo.org/vgaps. Approximately one half of objects from the 24 GHz catalogue were observed at dual band 8.6 GHz and 2.3 GHz experiments. Position differences at 24 GHz versus 8.6/2.3 GHz for all but two objects on average are strictly within reported uncertainties. We found that for two objects with complex structure positions at different frequencies correspond to different components of a source.
We analyze the behavior of quantum dynamical entropies production from sequences of quantum approximants approaching their (chaotic) classical limit. The model of the quantized hyperbolic automorphisms of the 2-torus is examined in detail and a semi-
classical analysis is performed on it using coherent states, fulfilling an appropriate dynamical localization property. Correspondence between quantum dynamical entropies and the Kolmogorov-Sinai invariant is found only over time scales that are logarithmic in the quantization parameter.
