On the second-order sliding mode control of nonlinear systems with uncertain control direction

This note deals with the implementation of a second-order sliding mode control algorithm for a class of nonlinear systems in which the sign of the high-frequency gain, though constant, is unknown. A specific second-order sliding mode control algorithm, the “Suboptimal” algorithm, is properly modified in order to face the uncertainty in the control direction. It is shown that after a finite time the uncertain sign is identified and the standard finite time convergence takes place from that time on. Simulation results are provided.     

The space of EDF deadlines: the exact region and a convex approximation

It is well known that the performance of computer controlled systems is heavily affected by delays and jitter occurring in the control loops, which are mainly caused by the interference introduced by other concurrent activities. A common approach adopted to reduce delay and jitter in periodic task systems is to decrease relative deadlines as much as possible, but without jeopardizing the schedulability of the task set. In this paper, we formally characterize the region of admissible deadlines so that the system designer can appropriately select the desired values to maximize a given performance index defined over the task set. Finally we also provide a sufficient region of feasible deadlines which is proved to be convex.

Iso-Kinematic Maps from statistical analysis of PS-InSAR data of Piemonte, NW Italy: Comparison with geological kinematic trends

SAR interferometry based on Permanent Scatterers (PS-InSAR™) is used here to study the present crustal mobility of a large area of NW Italy, in the Piemonte region.Thirty-eight satellite scenes (ERS SAR), taken from May 1992 to January 2001, were analysed for detecting more than 2 million PS on the study area. Continuous velocity surface maps (Iso-Kinematic Maps: IKM) were obtained from geo-statistical and spatial cluster techniques (Hot Spot analysis) of PS “short-period” data, to identify relative ground motions and to compare them with “long-period” tectonic mobility trends, i.e. those inferred at regional scale over geological times (some million years).The comparison was made by individuation of homogeneous kinematic areas, represented in the IKM, and characterization of the boundaries between them (Iso-Kinematic Boundaries: IKB). The IKB were used as tools to asses if the PS-InSAR data on present-day crustal mobility could fit with the distribution of real tectonic structures or field geological elements.IKM were drawn for uplifting geological sectors of Piemonte (Maritime Alps, Gran Paradiso, Langhe) where moderate to very low seismicity is recorded, and gravitational instabilities of rock mass on mountain slopes are widespread. The land sectors have been chosen in order to test the suitability of IKM in very different geo-morphological conditions.Different types of correspondence between the IKM and the geological kinematic trend were found:

-

a first type in which the kinematic trend of short-period (a decade of years, i.e. the PS-InSAR detection time span) is in agreement with a long-period tectonic trend (some million years) and seem to be driven by well known faults subparallel to the IKB. These kinematic trends can be hidden by the slope movement due to gravitational instabilities;

-

a second type in which the kinematic trend of short-period does not strictly correspond to the long-period trend, but can be considered as minor-order, uplifting-subsidence cycles, even if in contrast with the long-period kinematic trend. Alternatively, the short-period kinematic trends could reflect the action of deep-seated geological forces or structures, not yet known or inferable (at least with the recorded PS-InSAR velocities) on the basis of the available geological data and models.

     

Constraint-based deductive model checking

We show that constraint logic programming (CLP) can serve as a conceptual basis and as a practical implementation platform for the model checking of infinite-state systems. CLP programs are logical formulas (built up from constraints) that have both a logical interpretation and an operational semantics. Our contributions are: (1) a translation of concurrent systems (imperative programs) into CLP programs with the same operational semantics; and (2) a deductive method for verifying safety and liveness properties of the systems which is based on the logical interpretation of the CLP programs produced by the translation. We have implemented the method in a CLP system and verified well-known examples of infinite-state programs over integers, using linear constraints here as opposed to Presburger arithmetic as in previous solutions. Published online: 18 July 2001     

A hypergraph model for constraint logic programming and applications to bus drivers' scheduling

In a previous paper, a hypergraph model for the satisfiability of Datalog formulas was proposed. Here, we extend that approach in order to deal with a class ofconstraint logic programming (CLP) formulas, that is, Datalog formulas in the presence of constraints. A CLP formula is represented by means of a weighted hypergraph and the problem of evaluating this formula is reduced to a sequence of shortest path computations on hypergraphs. To evaluate the performance of this approach, the bus drivers' scheduling problem is formulated as the problem of checking the satisfiability of a CLP formula and it is solved by means of the hypergraph-based algorithm embedded within a local search procedure. Preliminary experimental results are quite encouraging and suggest that the proposed approach may provide an efficient way to tackle hard real-life combinatorial problems.This research was partially supported by the Progetto Finalizzato Trasporti 2 of the Italian National Research Council, under Contract No. 91.02479.PF74.     

Introducing QoS awareness in distributed programming: QTcl

A number of distributed applications require communication services with quality of service (QoS) guarantees. Building global‐scale distributed systems with predictable properties is one of the great challenges for computer systems engineering in the new century. Work undertaken within the Internet Engineering Task Force has led to the definition of novel architectural models for the Internet with QoS support. According to these models, the network has to be appropriately configured in order to provide applications with the required performance guarantees. In next‐generation networks, enabling applications to interact with the underlying QoS services is of primary importance. Hence, several special‐purpose application programming interfaces (APIs) have been defined to let applications negotiate QoS parameters across QoS‐capable networks. However, so far, none of these APIs are available in different operating environments. We believe that such features should be embedded in programming environments for distributed applications. In this work we present how we included QoS control features in Tcl, a programming language that has been widely adopted for the development of distributed multimedia applications. Our work has led to the implementation of QTcl, an extended Tcl interpreter that provides programmers with a new set of primitives, in full compliance with the standard SCRAPI programming interface for the RSVP protocol. QTcl in highly portable, in that it enables standard QoS negotiation to be performed in a seamless fashion on the most common operating systems. Copyright © 2003 John Wiley & Sons, Ltd.     

Focusing qualitative simulation using temporal logic: theoretical foundations

We illustrate TeQsim, a qualitative simulator for continuous dynamical systems that combines the expressive power of qualitative differential equations with temporal logic to constrain and refine the resulting predicted behaviors. Temporal logic is used to specify constraints that restrict the simulation to a region of the state space and to specify trajectories for input variables. A propositional linear‐time temporal logic is adopted, which is extended to a three valued logic that allows a formula to be conditionally entailed when quantitative information specified in the formula can be applied to a behavior to refine it. We present a formalization of the logic with correctness and completeness results for the adopted model checking algorithm. We show an example of the simulation of a non‐autonomous dynamical system and illustrate possible application tasks, ranging from simulation to monitoring and control of continuous dynamical systems, where TeQsim can be applied. This revised version was published online in June 2006 with corrections to the Cover Date.     

Integration of XML Schemas at various “severity” levels

This paper presents a novel approach for the integration of a set of eXtensible Markup Language (XML) Schemas. The proposed approach is specialized for XML, almost automatic, semantic and “light”. Further, an original peculiarity is that it is parametric w.r.t. a “severity” level against which the integration task is performed. The paper describes the approach in all details, illustrates various theoretical results, presents the experiments we have performed for testing it and, finally, compares it with various related approaches already proposed in the literature.