On Nonnegative Solutions of Fractional q-Linear Time-Varying Dynamic Systems with Delayed Dynamics

This paper is devoted to the investigation of nonnegative solutions and the stability and asymptotic properties of the solutions of fractional differential dynamic linear time-varying systems involving delayed dynamics with delays. The dynamic systems are described based on q-calculus and Caputo fractional derivatives on any order.

Invariant-free deduction systems for temporal logic

In this thesis we propose a new approach to deduction methods for temporal logic. Our proposal is based on an inductive definition of eventualities that is different from the usual one. On the basis of this non-customary inductive definition for eventualities, we first provide dual systems of tableaux and sequents for Propositional Linear-time Temporal Logic (PLTL). Then, we adapt the deductive approach introduced by means of these dual tableau and sequent systems to the resolution framework and we present a clausal temporal resolution method for PLTL. Finally, we make use of this new clausal temporal resolution method for establishing logical foundations for declarative temporal logic programming languages. The key element in the deduction systems for temporal logic is to deal with eventualities and hidden invariants that may prevent the fulfillment of eventualities. Different ways of addressing this issue can be found in the works on deduction systems for temporal logic. Traditional tableau systems for temporal logic generate an auxiliary graph in a first pass.Then, in a second pass, unsatisfiable nodes are pruned. In particular, the second pass must check whether the eventualities are fulfilled. The one-pass tableau calculus introduced by S. Schwendimann requires an additional handling of information in order to detect cyclic branches that contain unfulfilled eventualities. Regarding traditional sequent calculi for temporal logic, the issue of eventualities and hidden invariants is tackled by making use of a kind of inference rules (mainly, invariant-based rules or infinitary rules) that complicates their automation. A remarkable consequence of using either a two-pass approach based on auxiliary graphs or aone-pass approach that requires an additional handling of information in the tableau framework, and either invariant-based rules or infinitary rules in the sequent framework, is that temporal logic fails to carry out the classical correspondence between tableaux and sequents. In this thesis, we first provide a one-pass tableau method TTM that instead of a graph obtains a cyclic tree to decide whether a set of PLTL-formulas is satisfiable. In TTM tableaux are classical-like. For unsatisfiable sets of formulas, TTM produces tableaux whose leaves contain a formula and its negation. In the case of satisfiable sets of formulas, TTM builds tableaux where each fully expanded open branch characterizes a collection of models for the set of formulas in the root. The tableau method TTM is complete and yields a decision procedure for PLTL. This tableau method is directly associated to a one-sided sequent calculus called TTC. Since TTM is free from all the structural rules that hinder the mechanization of deduction, e.g. weakening and contraction, then the resulting sequent calculus TTC is also free from this kind of structural rules. In particular, TTC is free of any kind of cut, including invariant-based cut. From the deduction system TTC, we obtain a two-sided sequent calculus GTC that preserves all these good freeness properties and is finitary, sound and complete for PLTL. Therefore, we show that the classical correspondence between tableaux and sequent calculi can be extended to temporal logic. The most fruitful approach in the literature on resolution methods for temporal logic, which was started with the seminal paper of M. Fisher, deals with PLTL and requires to generate invariants for performing resolution on eventualities. In this thesis, we present a new approach to resolution for PLTL. The main novelty of our approach is that we do not generate invariants for performing resolution on eventualities. Our method is based on the dual methods of tableaux and sequents for PLTL mentioned above. Our resolution method involves translation into a clausal normal form that is a direct extension of classical CNF. We first show that any PLTL-formula can be transformed into this clausal normal form. Then, we present our temporal resolution method, called TRS-resolution, that extends classical propositional resolution. Finally, we prove that TRS-resolution is sound and complete. In fact, it finishes for any input formula deciding its satisfiability, hence it gives rise to a new decision procedure for PLTL. In the field of temporal logic programming, the declarative proposals that provide a completeness result do not allow eventualities, whereas the proposals that follow the imperative future approach either restrict the use of eventualities or deal with them by calculating an upper bound based on the small model property for PLTL. In the latter, when the length of a derivation reaches the upper bound, the derivation is given up and backtracking is used to try another possible derivation. In this thesis we present a declarative propositional temporal logic programming language, called TeDiLog, that is a combination of the temporal and disjunctive paradigms in Logic Programming. We establish the logical foundations of our proposal by formally defining operational and logical semantics for TeDiLog and by proving their equivalence. Since TeDiLog is, syntactically, a sublanguage of PLTL, the logical semantics of TeDiLog is supported by PLTL logical consequence. The operational semantics of TeDiLog is based on TRS-resolution. TeDiLog allows both eventualities and always-formulas to occur in clause heads and also in clause bodies. To the best of our knowledge, TeDiLog is the first declarative temporal logic programming language that achieves this high degree of expressiveness. Since the tableau method presented in this thesis is able to detect that the fulfillment of an eventuality is prevented by a hidden invariant without checking for it by means of an extra process, since our finitary sequent calculi do not include invariant-based rules and since our resolution method dispenses with invariant generation, we say that our deduction methods are invariant-free.

Hyers-Ulam-Rassias Stability of Functional Differential Systems with Point and Distributed Delays

This paper investigates stability and asymptotic properties of the error with respect to its nominal version of a nonlinear time-varying perturbed functional differential system subject to point, finite-distributed, and Volterra-type distributed delays associated with linear dynamics together with a class of nonlinear delayed dynamics. The boundedness of the error and its asymptotic convergence to zero are investigated with the results being obtained based on the Hyers-Ulam-Rassias analysis.

Convergence Properties and Fixed Points of Two General Iterative Schemes with Composed Maps in Banach Spaces with Applications to Guaranteed Global Stability

This paper investigates the boundedness and convergence properties of two general iterative processes which involve sequences of self-mappings on either complete metric or Banach spaces. The sequences of self-mappings considered in the first iterative scheme are constructed by linear combinations of a set of self-mappings, each of them being a weighted version of a certain primary self-mapping on the same space. The sequences of self-mappings of the second iterative scheme are powers of an iteration-dependent scaled version of the primary self-mapping. Some applications are also given to the important problem of global stability of a class of extended nonlinear polytopic-type parameterizations of certain dynamic systems.

Properties of convergence of a class of iterative processes generated by sequences of self-mappings with applications to switched dynamic systems

This article investigates the convergence properties of iterative processes involving sequences of self-mappings of metric or Banach spaces. Such sequences are built from a set of primary self-mappings which are either expansive or non-expansive self-mappings and some of the non-expansive ones can be contractive including the case of strict contractions. The sequences are built subject to switching laws which select each active self-mapping on a certain activation interval in such a way that essential properties of boundedness and convergence of distances and iterated sequences are guaranteed. Applications to the important problem of stability of dynamic switched systems are also given.

Stability of Switched Feedback Time-Varying Dynamic Systems Based on the Properties of the Gap Metric for Operators

The stabilization of dynamic switched control systems is focused on and based on an operator-based formulation. It is assumed that the controlled object and the controller are described by sequences of closed operator pairs (L, C) on a Hilbert space H of the input and output spaces and it is related to the existence of the inverse of the resulting input-output operator being admissible and bounded. The technical mechanism addressed to get the results is the appropriate use of the fact that closed operators being sufficiently close to bounded operators, in terms of the gap metric, are also bounded. That philosophy is followed for the operators describing the input-output relations in switched feedback control systems so as to guarantee the closed-loop stabilization.

Asymptotic Hyperstability of a Class of Linear Systems under Impulsive Controls Subject to an Integral Popovian Constraint

This paper is focused on the study of the important property of the asymptotic hyperstability of a class of continuous-time dynamic systems. The presence of a parallel connection of a strictly stable subsystem to an asymptotically hyperstable one in the feed-forward loop is allowed while it has also admitted the generation of a finite or infinite number of impulsive control actions which can be combined with a general form of nonimpulsive controls. The asymptotic hyperstability property is guaranteed under a set of sufficiency-type conditions for the impulsive controls.

Emergence of Cooperation in Heterogeneous Population: A Discrete-Time Replicator Dynamics Analysis

The emergence of cooperation is analyzed in heterogeneous populations where individuals can be classified in two groups according to their phenotypic appearance. Phenotype recognition is assumed for all individuals: individuals are able to identify the type of every other individual, but fail to recognize their own type, and thus behave under partial information conditions. The interactions between individuals are described by 2 × 2 symmetric games where individuals can either cooperate or defect. The evolution of such populations is studied in the framework of evolutionary game by means of the replicator dynamics. Overlapping generations are considered, so the replicator equations are formulated in discrete-time form. The well-posedness conditions of the system are derived. Depending on the parameters of the game, a restriction may exist for the generation length. The stability analysis of the dynamical system is carried out and a detailed description of the behavior of trajectories starting from the interior of the state-space is given. We find that, provided the conditions of well-posedness are verified, the linear stability of monomorphic states in the discrete-time replicator coincides with the one of the continuous case. Specific from the discrete-time case, a relaxed restriction for the generation length is derived, for which larger time-steps can be used without compromising the well-posedness of the replicator system.

Sliding mode position control for real-time control of induction motors

A sliding mode position control for high-performance real-time applications of induction motors in developed in this work. The design also incorporates a simple flux estimator in order to avoid the flux sensors. Then, the proposed control scheme presents a low computational cost and therefore can be implemented easily in a real-time applications using a low cost DSP-processor. The stability analysis of the controller under parameter uncertainties and load disturbances in provided using Lyapunov stability theory. Finally, simulated and experimental results show that the proposed controller with the proposed observer provides a good trajectory tracking and that this scheme is robust with respect to plant parameter variations and external load disturbances.

Some experiments on solving multistage stochastic mixed 0-1 programs with time stochastic dominance constraints

In this work we extend to the multistage case two recent risk averse measures for two-stage stochastic programs based on first- and second-order stochastic dominance constraints induced by mixed-integer linear recourse. Additionally, we consider Time Stochastic Dominance (TSD) along a given horizon. Given the dimensions of medium-sized problems augmented by the new variables and constraints required by those risk measures, it is unrealistic to solve the problem up to optimality by plain use of MIP solvers in a reasonable computing time, at least. Instead of it, decomposition algorithms of some type should be used. We present an extension of our Branch-and-Fix Coordination algorithm, so named BFC-TSD, where a special treatment is given to cross scenario group constraints that link variables from different scenario groups. A broad computational experience is presented by comparing the risk neutral approach and the tested risk averse strategies. The performance of the new version of the BFC algorithm versus the plain use of a state-of-the-artMIP solver is also reported.

A Data Dropout Compensation Algorithm Based on the Iterative Learning Control Methodology for Discrete-Time Systems

This paper deals with the convergence of a remote iterative learning control system subject to data dropouts. The system is composed by a set of discrete-time multiple input-multiple output linear models, each one with its corresponding actuator device and its sensor. Each actuator applies the input signals vector to its corresponding model at the sampling instants and the sensor measures the output signals vector. The iterative learning law is processed in a controller located far away of the models so the control signals vector has to be transmitted from the controller to the actuators through transmission channels. Such a law uses the measurements of each model to generate the input vector to be applied to its subsequent model so the measurements of the models have to be transmitted from the sensors to the controller. All transmissions are subject to failures which are described as a binary sequence taking value 1 or 0. A compensation dropout technique is used to replace the lost data in the transmission processes. The convergence to zero of the errors between the output signals vector and a reference one is achieved as the number of models tends to infinity.

Self-reported sitting time and physical activity: interactive associations with mental well-being and productivity in office employees

Background: Little is known about how sitting time, alone or in combination with markers of physical activity (PA), influences mental well-being and work productivity. Given the need to develop workplace PA interventions that target employees' health related efficiency outcomes; this study examined the associations between self-reported sitting time, PA, mental well-being and work productivity in office employees. Methods: Descriptive cross-sectional study. Spanish university office employees (n = 557) completed a survey measuring socio-demographics, total and domain specific (work and travel) self-reported sitting time, PA (International Physical Activity Questionnaire short version), mental well-being (Warwick-Edinburg Mental Well-Being Scale) and work productivity (Work Limitations Questionnaire). Multivariate linear regression analyses determined associations between the main variables adjusted for gender, age, body mass index and occupation. PA levels (low, moderate and high) were introduced into the model to examine interactive associations. Results: Higher volumes of PA were related to higher mental well-being, work productivity and spending less time sitting at work, throughout the working day and travelling during the week, including the weekends (p < 0.05). Greater levels of sitting during weekends was associated with lower mental well-being (p < 0.05). Similarly, more sitting while travelling at weekends was linked to lower work productivity (p < 0.05). In highly active employees, higher sitting times on work days and occupational sitting were associated with decreased mental well-being (p < 0.05). Higher sitting times while travelling on weekend days was also linked to lower work productivity in the highly active (p < 0.05). No significant associations were observed in low active employees. Conclusions: Employees' PA levels exerts different influences on the associations between sitting time, mental well-being and work productivity. The specific associations and the broad sweep of evidence in the current study suggest that workplace PA strategies to improve the mental well-being and productivity of all employees should focus on reducing sitting time alongside efforts to increase PA.

Dietary animal and plant protein intakes and their associations with obesity and cardio-metabolic indicators in European adolescents: the HELENA cross-sectional study

Background: Previous studies suggest that dietary protein might play a beneficial role in combating obesity and its related chronic diseases. Total, animal and plant protein intakes and their associations with anthropometry and serum biomarkers in European adolescents using one standardised methodology across European countries are not well documented. Objectives: To evaluate total, animal and plant protein intakes in European adolescents stratified by gender and age, and to investigate their associations with cardio-metabolic indicators (anthropometry and biomarkers). Methods: The current analysis included 1804 randomly selected adolescents participating in the HELENA study (conducted in 2006-2007) aged 12.5-17.5 y (47% males) who completed two non-consecutive computerised 24-h dietary recalls. Associations between animal and plant protein intakes, and anthropometry and serum biomarkers were examined with General linear Model multivariate analysis. Results: Average total protein intake exceeded the recommendations of World Health Organization and European Food Safety Authority. Mean total protein intake was 96 g/d (59% derived from animal protein). Total, animal and plant protein intakes (g/d) were significantly lower in females than in males and total and plant protein intakes were lower in younger participants (12.5-14.9 y). Protein intake was significantly lower in underweight subjects and higher in obese ones; the direction of the relationship was reversed after adjustments for body weight (g/(kg.d)). The inverse association of plant protein intakes was stronger with BMI z-score and body fat percentage (BF%) compared to animal protein intakes. Additionally, BMI and BF% were positively associated with energy percentage of animal protein. Conclusions: This sample of European adolescents appeared to have adequate total protein intake. Our findings suggest that plant protein intakes may play a role in preventing obesity among European adolescents. Further longitudinal studies are needed to investigate the potential beneficial effects observed in this study in the prevention of obesity and related chronic diseases.