Application of Finite-Time Stability Concepts to the Control of ATM Networks

When dealing with the stability of a system, a distinction should be made between classical Lyapunov Stability and Finite-Time Stability (FTS) (or Short-Time Stability). The concept of Lyapunov Asymptotic Stability is largely known to the control community; on the other hand a system is said to be finite-time stable if, once we fix a time-interval, its state does not exceeds some bounds during this time-interval. Often asymptotic stability is enough for practical applications, but there are some cases where large values of the state are not acceptable, for instance in the presence of saturations. In these cases, we need to check that these unacceptable values are not attained by the state; for these purposes FTS could be used. Some early results on FTS can be found in [9], [12] and [8]; more recently the concept of FTS has been revisited in the light of recent results coming from Linear Matrix Inequalities (LMIs) theory, which has allowed to find less conservative conditions guaranteeing FTS and finite time stabilization of uncertain, linear continuous-time systems (see [3]). In this note we consider the problem of applying some sufficient conditions for finite time stabilization to design the control algorithm of an ATM network described via a discrete-time system. The extended abstract is organized as follows: in Section 2 we provide a sufficient condition for finite time stabilization of a discrete time system; in Section 3 we detail the model of an ATM network; finally in Section 4 some concluding remarks and plans for the final version of the paper are given

Del Rey abaxo ninguno, y labrador más honrado García del Castañar Comedia famosa

Sign.: A4-D2Copia digital. Santiago de Compostela : Universidad de Santiago de Compostela, 201

On Subexponentials, Synthetic Connectives, and Multi-level Delimited Control

International audienceWe construct a partially-ordered hierarchy of delimited control operators similar to those of the CPS hierarchy of Danvy and Filinski. However, instead of relying on nested CPS translations, these operators are directly interpreted in linear logic extended with subexponentials (i.e., multiple pairs of ! and ?). We construct an independent proof theory for a fragment of this logic based on the principle of focusing. It is then shown that the new constraints placed on the permutation of cuts correspond to multiple levels of delimited control

Realizability Interpretation and Normalization of Typed Call-by-Need λ\lambda-calculus With Control

We define a variant of realizability where realizers are pairs of a term and a substitution. This variant allows us to prove the normalization of a simply-typed call-by-need \lambda$-$calculus with control due to Ariola et al. Indeed, in such call-by-need calculus, substitutions have to be delayed until knowing if an argument is really needed. In a second step, we extend the proof to a call-by-need \lambda$$-calculus equipped with a type system equivalent to classical second-order predicate logic, representing one step towards proving the normalization of the call-by-need classical second-order arithmetic introduced by the second author to provide a proof-as-program interpretation of the axiom of dependent choice

Extended Call-by-Push-Value: Reasoning About Effectful Programs and Evaluation Order

Traditionally, reasoning about programs under varying evaluation regimes (call-by-value, call-by-name etc.) was done at the meta-level, treating them as term rewriting systems. Levy’s call-by-push-value (CBPV) calculus provides a more powerful approach for reasoning, by treating CBPV terms as a common intermediate language which captures both call-by-value and call-by-name, and by allowing equational reasoning about changes to evaluation order between or within programs. We extend CBPV to additionally deal with call-by-need, which is non-trivial because of shared reductions. This allows the equational reasoning to also support call-by-need. As an example, we then prove that call-by-need and call-by-name are equivalent if nontermination is the only side-effect in the source language. We then show how to incorporate an effect system. This enables us to exploit static knowledge of the potential effects of a given expression to augment equational reasoning; thus a program fragment might be invariant under change of evaluation regime only because of knowledge of its effects

Relating Sequent Calculi for Bi-intuitionistic Propositional Logic

Bi-intuitionistic logic is the conservative extension of intuitionistic logic with a connective dual to implication. It is sometimes presented as a symmetric constructive subsystem of classical logic. In this paper, we compare three sequent calculi for bi-intuitionistic propositional logic: (1) a basic standard-style sequent calculus that restricts the premises of implication-right and exclusion-left inferences to be single-conclusion resp. single-assumption and is incomplete without the cut rule, (2) the calculus with nested sequents by Gore et al., where a complete class of cuts is encapsulated into special "unnest" rules and (3) a cut-free labelled sequent calculus derived from the Kripke semantics of the logic. We show that these calculi can be translated into each other and discuss the ineliminable cuts of the standard-style sequent calculus.Comment: In Proceedings CL&C 2010, arXiv:1101.520

The Contribution of National Spontaneous Reporting Systems to Detect Signals of Torsadogenicity: Issues Emerging from the ARITMO Project

Introduction: Spontaneous reporting systems (SRSs) are pivotal for signal detection, especially for rare events with a high drug-attributable component, such as torsade de pointes (TdP). Use of different national SRSs is rarely attempted because of inherent difficulties, but should be considered on the assumption that rare events are diluted in international databases. Objective: The aim was to describe TdP-related events associated with antipsychotics, H1-antihistamines and anti-infectives in three national SRSs (in Italy, Germany and France) and highlight potential signals of torsadogenicity through a combined literature evaluation. Methods: A common search strategy was applied to extract TdP-related events: (1) TdP, (2) QT interval abnormalities, (3) ventricular fibrillation/tachycardia, and (4) sudden cardiac death. Signals of disproportionate reporting (SDRs) were calculated for TdP + QT interval abnormalities and defined by a lower limit of the 95 % confidence interval of the reporting odds ratio (ROR) >1. Among SDRs with at least three cases without concomitant pro-arrhythmic drugs, we defined potential new signal of torsadogenicity as drugs with no published evidence from (a) the crediblemeds® website (http://www.crediblemeds.com, as of November 1st, 2014); (b) studies on the FDA Adverse Event Reporting System (FAERS); and (c) safety trials or pharmaco-epidemiological studies (as of December 16th, 2014). Results: Overall, 3505 cases were retrieved (1372, 1468, and 801 for France, Germany and Italy, respectively). Antipsychotics were mainly recorded in Germany (792 cases), whereas antibiotics peaked at 515 and 491 (France and Italy, respectively). Forty-one drugs met criteria for SDRs in at least one single source, of which 31 were detected only from one single SRS: 18, ten and three (French, German and Italian SRS, respectively). By contrast, only five SDRs were detected in all national data sources (amisulpride, aripiprazole, haloperidol, olanzapine, risperidone). Overall, five potential new signals of torsadogenicity were identified: flupentixol, ganciclovir, levocetirizine, oxatomide and tiapride. Conclusions: We found differences across and within national SRSs in the reporting of drug-induced TdP, which finally resulted in five potential new signals of torsadogenicity. These findings warrant targeted pharmacovigilance studies to formally assess the existence of actual drug–event associations

Antipsychotics and Torsadogenic Risk: Signals Emerging from the US FDA Adverse Event Reporting System Database

Background: Drug-induced torsades de pointes (TdP) and related clinical entities represent a current regulatory and clinical burden. Objective: As part of the FP7 ARITMO (Arrhythmogenic Potential of Drugs) project, we explored the publicly available US FDA Adverse Event Reporting System (FAERS) database to detect signals of torsadogenicity for antipsychotics (APs). Methods: Four groups of events in decreasing order of drug-attributable risk were identified: (1) TdP, (2) QT-interval abnormalities, (3) ventricular fibrillation/tachycardia, and (4) sudden cardiac death. The reporting odds ratio (ROR) with 95 % confidence interval (CI) was calculated through a cumulative analysis from group 1 to 4. For groups 1+2, ROR was adjusted for age, gender, and concomitant drugs (e.g., antiarrhythmics) and stratified for AZCERT drugs, lists I and II (http://www.azcert.org, as of June 2011). A potential signal of torsadogenicity was defined if a drug met all the following criteria: (a) four or more cases in group 1+2; (b) significant ROR in group 1+2 that persists through the cumulative approach; (c) significant adjusted ROR for group 1+2 in the stratum without AZCERT drugs; (d) not included in AZCERT lists (as of June 2011). Results: Over the 7-year period, 37 APs were reported in 4,794 cases of arrhythmia: 140 (group 1), 883 (group 2), 1,651 (group 3), and 2,120 (group 4). Based on our criteria, the following potential signals of torsadogenicity were found: amisulpride (25 cases; adjusted ROR in the stratum without AZCERT drugs = 43.94, 95 % CI 22.82-84.60), cyamemazine (11; 15.48, 6.87-34.91), and olanzapine (189; 7.74, 6.45-9.30). Conclusions: This pharmacovigilance analysis on the FAERS found 3 potential signals of torsadogenicity for drugs previously unknown for this risk