The Building Blocks of a PaaS

Traditional cloud computing providers enable developers to program and deploy applications in the cloud by using platform as a service (PaaS) providers. Despite the benefits of such an approach, this service model usually comes with a high level of the lock in effect into the service provider. The lock in effect occurs when a software developer needs to change its cloud provider. When this happens, it usually means a major application rewrite, specific for the new PaaS. This paper details the initial results of a project whose goal is to build a PaaS where vendor lock in does not occur. With this PaaS, developers wishing to deploy their applications into the cloud may continue to program using their usual development environments. There are no necessary changes required to make the application PaaS compatible. As a proof of concept, we developed an open source PaaS management application as a regular web application and then deployed it on the cloud.     

A new vertex result for robustness problems with interval matrix uncertainty

This paper¹ addresses a family of robustness problems in which the system under consideration is affected by interval matrix uncertainty. The main contribution of the paper is a new vertex result that drastically reduces the number of extreme realizations required to check robust feasibility. This vertex result allows one to solve, in a deterministic way and without introducing conservatism, the corresponding robustness problem for small and medium size problems. For example, consider quadratic stability of an autonomous n_x dimensional system. In this case, instead of checking vertices, we show that it suffices to check 2^2n_x specially constructed systems. This solution is still exponential, but this is not surprising because the problem is NP-hard. Finally, vertex extensions to multiaffine interval families and some sufficient conditions (in LMI form) for robust feasibility are presented. Some illustrative examples are also given.     

Min–Max MPC based on a network problem

In general, min–max model predictive controllers have a high computational burden. In this work, an efficient implementation of this class of controllers that can be applied to linear plants with additive uncertainties and quadratic cost functions is presented. The new approach relies on the equivalence of the maximization problem with a network problem. If a given condition is satisfied, the computational burden of the proposed implementation grows polynomially with the prediction horizon. In particular, the resulting optimization problem can be posed as a quadratic programming problem with a number of constraints and variables that grows in a quadratic manner with the prediction horizon. An alternative controller has been proposed for those systems that do not satisfy this condition. This alternative controller approximates the original one with a given bound on the error.     

MPC for tracking piecewise constant references for constrained linear systems

In this paper, a novel model predictive control (MPC) for constrained (non-square) linear systems to track piecewise constant references is presented. This controller ensures constraint satisfaction and asymptotic evolution of the system to any target which is an admissible steady-state. Therefore, any sequence of piecewise admissible setpoints can be tracked without error. If the target steady state is not admissible, the controller steers the system to the closest admissible steady state.These objectives are achieved by: (i) adding an artificial steady state and input as decision variables, (ii) using a modified cost function to penalize the distance from the artificial to the target steady state (iii) considering an extended terminal constraint based on the notion of invariant set for tracking. The control law is derived from the solution of a single quadratic programming problem which is feasible for any target. Furthermore, the proposed controller provides a larger domain of attraction (for a given control horizon) than the standard MPC and can be explicitly computed by means of multiparametric programming tools. On the other hand, the extra degrees of freedom added to the MPC may cause a loss of optimality that can be arbitrarily reduced by an appropriate weighting of the offset cost term.     

Nursing records for discharge. Report of the nursing history

The quality of care within our health care system depends upon an active and dynamic communication which bridges the different levels of care (primary and hospital) and will permit a continuity of services between the distinct parts. To insure this success, the authors propose an outpatient nursing record that will follow the patient upon his or her discharge. This record, to be called the "Discharged Patient Report", will be directed to other medical professionals so that they can be informed of previous treatments that the patient has received. Included in the report will be items such as; the previous nursing interactions that were used on the patient, how problems were resolved, possible other solutions, and health care information given to the patient. Using the report in this way will give us a great tool to know our patients and better understand how to serve them.     

An haptic-based immersive environment for shape analysis and modelling

Currently, the design of aesthetic products is a process that requires a set of activities where digital models and physical mockups play a key role. Typically, these are modified (and built) several times before reaching the desired design, increasing the development time and, consequently, the final product cost. In this paper, we present an innovative design environment for computer-aided design (CAD) surface analysis. Our system relies on a direct visuo-haptic display system, which enables users to visualize models using a stereoscopic view, and allows the evaluation of sectional curves using touch. Profile curves are rendered using an haptic device that deforms a plastic strip, thanks to a set of actuators, to reproduce the curvature of the shape co-located with the virtual model. By touching the strip, users are able to evaluate shape characteristics, such as curvature or discontinuities (rendered using sound), and to assess the surface quality. We believe that future computer-aided systems (CAS)/CAD systems based on our approach will contribute in improving the design process at industrial level. Moreover, these will allow companies to reduce the product development time by reducing the number of physical mockups necessary for the product design evaluation and by increasing the quality of the final product, allowing a wider exploration and comparative evaluation of alternatives in the given time.     

A robust constrained reference governor approach using linear matrix inequalities

The purpose of this paper is to examine and provide a solution to the output reference tracking problem for uncertain systems subject to input saturation. As well-known, input saturation and modelling errors are very common problems at industry, where control schemes are implemented without accounting for such problems. In many cases, it is sometimes difficult to modify the existing implemented control schemes being necessary to provide them with external supervisory control approaches in order to tackle problems with constraints and modelling errors. In this way, a cascade structure is proposed, combining an inner loop containing any proper controller with an outer loop where a generalized predictive controller (GPC) provides adequate references for the inner loop considering input saturations and uncertainties. Therefore, the contribution of this paper consists in providing a state space representation for the inner loop and using linear matrix inequalities (LMI) to obtain a predictive state-vector feedback in such a way that the input reference for the inner loop is calculated to satisfy robust tracking specifications considering input saturations. Hence, the final proposed solution consists in solving a regulation problem to a fixed reference value subjected to a set of constraints described by several LMI and bilinear matrix inequalities (BMI). The main contribution of the paper is that the proposed solution is a non-linear setpoint tracking approach, that is, it is allowed that the system goes into saturation facing the problem of setpoint tracking instead of regulating to the origin. An illustrative numerical example is presented.