Evaluation of the determinism of the actuator sensor interface (ASI) on programmable logic controllers (PLC), personal computers (PC) and real-time operating systems (RTOS)

The purpose of this study was to evaluate the determinism of the AS-lnterface network and the 3 main families of control systems, which may use it, namely PLC, PC and RTOS. During the course of this study the PROFIBUS and Ethernet field level networks were also considered in order to ensure that they would not introduce unacceptable latencies into the overall control system. This research demonstrated that an incorrectly configured Ethernet network introduces unacceptable variable duration latencies into the control system, thus care must be exercised if the determinism of a control system is not to be compromised. This study introduces a new concept of using statistics and process capability metrics in the form of CPk values, to specify how suitable a control system is for a given control task. The PLC systems, which were tested, demonstrated extremely deterministic responses, but when a large number of iterations were introduced in the user program, the mean control system latency was much too great for an AS-I network. Thus the PLC was found to be unsuitable for an AS-I network if a large, complex user program Is required. The PC systems, which were tested were non-deterministic and had latencies of variable duration. These latencies became extremely exaggerated when a graphing ActiveX was included in the control application. These PC systems also exhibited a non-normal frequency distribution of control system latencies, and as such are unsuitable for implementation with an AS-I network. The RTOS system, which was tested, overcame the problems identified with the PLC systems and produced an extremely deterministic response, even when a large number of iterations were introduced in the user program. The RTOS system, which was tested, is capable of providing a suitable deterministic control system response, even when an extremely large, complex user program is required.

Architektur für verteilte, fehlertolerante Sensor-Aktor-Systeme

Magdeburg, Univ., Fak. für Informatik, Diss., 2011

Sudden Cardiac Death in Brazil: A Community-Based Autopsy Series (2006-2010)

Background: Sudden cardiac death (SCD) is a sudden unexpected event, from a cardiac cause, that occurs in less than one hour after the symptoms onset, in a person without any previous condition that would seem fatal or who was seen without any symptoms 24 hours before found dead. Although it is a relatively frequent event, there are only few reliable data in underdeveloped countries. Objective: We aimed to describe the features of SCD in Ribeirão Preto, Brazil (600,000 residents) according to Coroners’ Office autopsy reports. Methods: We retrospectively reviewed 4501 autopsy reports between 2006 and 2010, to identify cases of SCD. Specific cause of death as well as demographic information, date, location and time of the event, comorbidities and whether cardiopulmonary resuscitation (CPR) was attempted were collected. Results: We identified 899 cases of SCD (20%); the rate was 30/100000 residents per year. The vast majority of cases of SCD involved a coronary artery disease (CAD) (64%) and occurred in men (67%), between the 6th and the 7th decades of life. Most events occurred during the morning in the home setting (53.3%) and CPR was attempted in almost half of victims (49.7%). The most prevalent comorbidity was systemic hypertension (57.3%). Chagas’ disease was present in 49 cases (5.5%). Conclusion: The majority of victims of SCD were men, in their sixties and seventies and the main cause of death was CAD. Chagas’ disease, an important public health problem in Latin America, was found in about 5.5% of the cases.

Wideband impedance spectrum analyzer with arbitry fine frequency resolution for in situ sensor applications

Magdeburg, Univ., Fak. für Elektrotechnik und Informationstechnik, Diss., 2009

Steuerung eines zweibeinigen Schreitroboters mit einem elastischen Sensor-Aktor-System

Magdeburg, Univ., Fak. für Elektrotechnik und Informationstechnik, Diss., 2012

Dominance of positivity of the Green's function associated to a perturbed polyharmonic dirichlet boundary value problem by pointwise estimates

Magdeburg, Univ., Fak. für Mathematik, Diss., 2015

Optimal control of a Stefan problem with gradient-based methods in FEniCS

Otto-von-Guericke-Universität Magdeburg, Fakultät für Mathematik, Masterarbeit, 2016

The orthogonal subcategory problem in homotopy theory

It is known that, in a locally presentable category, localization exists with respect to every set of morphisms, while the statement that localization with respect to every (possibly proper) class of morphisms exists in locally presentable categories is equivalent to a large-cardinal axiom from set theory. One proves similarly, on one hand, that homotopy localization exists with respect to sets of maps in every cofibrantly generated, left proper, simplicial model category M whose underlying category is locally presentable. On the other hand, as we show in this article, the existence of localization with respect to possibly proper classes of maps in a model category M satisfying the above assumptions is implied by a large-cardinal axiom called Vopënka's principle, although we do not know if the reverse implication holds. We also show that, under the same assumptions on M, every endofunctor of M that is idempotent up to homotopy is equivalent to localization with respect to some class S of maps, and if Vopënka's principle holds then S can be chosen to be a set. There are examples showing that the latter need not be true if M is not cofibrantly generated. The above assumptions on M are satisfied by simplicial sets and symmetric spectra over simplicial sets, among many other model categories.

Periodic orbits of the planar collision restricted 3-body problem

Using the continuation method we prove that the circular and the elliptic symmetric periodic orbits of the planar rotating Kepler problem can be continued into periodic orbits of the planar collision restricted 3–body problem. Additionally, we also continue to this restricted problem the so called “comets orbits”.

Polynomial-time complexity for instances of the endomorphism problem in free groups

We say the endomorphism problem is solvable for an element W in a free group F if it can be decided effectively whether, given U in F, there is an endomorphism Φ of F sending W to U. This work analyzes an approach due to C. Edmunds and improved by C. Sims. Here we prove that the approach provides an efficient algorithm for solving the endomorphism problem when W is a two- generator word. We show that when W is a two-generator word this algorithm solves the problem in time polynomial in the length of U. This result gives a polynomial-time algorithm for solving, in free groups, two-variable equations in which all the variables occur on one side of the equality and all the constants on the other side.