In this paper, based on a fractional order Bergman minimal model, a robust strategy for regulationof blood glucose in type 1 diabetic patients is presented. Glucose/insulin concentration in the patientbody is controlled through the injection under the patients skin by the pump. Many various con-trollers for this system have been proposed in the literature. However, most of the...

A Hidden Markov Model (HMM) is a well-studied, statistical model which, when given a sequence consisting of observable states, is used to try to estimate a sequence of hidden, or unknown, states. In addition to its extensive, theoretical mathematical role, such a model has realworld applications in a range of topics including speech recognition, financial modeling (e.g. stock market predicting)...

I would like to personally welcome all of you to the opening session of the 43rd annual meeting of the American Burn Association (ABA). This has been an exciting year of challenges, opportunities, and advancements. During the past year we have • rewritten our Association’s by-laws, • established the opportunity for long-term funding of our Department of Defense/ABA research by adding a line ite...

We compare the rst-order and the higher-order paradigms for the representation of mobility in process algebras. The prototypical calculus in the rst-order paradigm is the-calculus. By generalising its sort mechanism we derive an !-order extension, called Higher-Order-calculus (HO). We give examples of its use, including the encoding of-calculus. Surprisingly, we show that such an extension does...

We study the strategic interaction between fundamental informed trading and order-flow informed trading. In a standard two-period Kyle (1985) model, we add a “back-runner” who observes, ex post and potentially with noise, the order flow of the fundamental informed investor in the first period. Learning from orderflow information, the back-runner competes with the fundamental investor in the sec...

We present a translation function from nominal rewriting systems (NRSs) to combinatory reduction systems (CRSs), transforming closed nominal rules and ground nominal terms to CRSs rules and terms, respectively, while preserving the rewriting relation. We also provide a reduction-preserving translation in the other direction, from CRSs to NRSs, improving over a previously defined translation. Th...