On the Analysis and Control of a Linear Synchronous Servomotor with a Flexible Load

Industry's growing need for higher productivity is placing new demands on mechanisms connected with electrical motors, because these can easily lead to vibration problems due to fast dynamics. Furthermore, the nonlinear effects caused by a motor frequently reduce servo stability, which diminishes the controller's ability to predict and maintain speed. Hence, the flexibility of a mechanism and its control has become an important area of research. The basic approach in control system engineering is to assume that the mechanism connected to a motor is rigid, so that vibrations in the tool mechanism, reel, gripper or any apparatus connected to the motor are not taken into account. This might reduce the ability of the machine system to carry out its assignment and shorten the lifetime of the equipment. Nonetheless, it is usually more important to know how the mechanism, or in other words the load on the motor, behaves. A nonlinear load control method for a permanent magnet linear synchronous motor is developed and implemented in the thesis. The purpose of the controller is to track a flexible load to the desired velocity reference as fast as possible and without awkward oscillations. The control method is based on an adaptive backstepping algorithm with its stability ensured by the Lyapunov stability theorem. As a reference controller for the backstepping method, a hybrid neural controller is introduced in which the linear motor itself is controlled by a conventional PI velocity controller and the vibration of the associated flexible mechanism is suppressed from an outer control loop using a compensation signal from a multilayer perceptron network. To avoid the local minimum problem entailed in neural networks, the initial weights are searched for offline by means of a differential evolution algorithm. The states of a mechanical system for controllers are estimated using the Kalman filter. The theoretical results obtained from the control design are validated with the lumped mass model for a mechanism. Generalization of the mechanism allows the methods derived here to be widely implemented in machine automation. The control algorithms are first designed in a specially introduced nonlinear simulation model and then implemented in the physical linear motor using a DSP (Digital Signal Processor) application. The measurements prove that both controllers are capable of suppressing vibration, but that the backstepping method is superior to others due to its accuracy of response and stability properties.

New Algorithm for Managing Childhood Illness Using Mobile Technology (ALMANACH): A Controlled Non-Inferiority Study on Clinical Outcome and Antibiotic Use in Tanzania.

INTRODUCTION: The decline of malaria and scale-up of rapid diagnostic tests calls for a revision of IMCI. A new algorithm (ALMANACH) running on mobile technology was developed based on the latest evidence. The objective was to ensure that ALMANACH was safe, while keeping a low rate of antibiotic prescription. METHODS: Consecutive children aged 2-59 months with acute illness were managed using ALMANACH (2 intervention facilities), or standard practice (2 control facilities) in Tanzania. Primary outcomes were proportion of children cured at day 7 and who received antibiotics on day 0. RESULTS: 130/842 (15∙4%) in ALMANACH and 241/623 (38∙7%) in control arm were diagnosed with an infection in need for antibiotic, while 3∙8% and 9∙6% had malaria. 815/838 (97∙3%;96∙1-98.4%) were cured at D7 using ALMANACH versus 573/623 (92∙0%;89∙8-94∙1%) using standard practice (p<0∙001). Of 23 children not cured at D7 using ALMANACH, 44% had skin problems, 30% pneumonia, 26% upper respiratory infection and 13% likely viral infection at D0. Secondary hospitalization occurred for one child using ALMANACH and one who eventually died using standard practice. At D0, antibiotics were prescribed to 15∙4% (12∙9-17∙9%) using ALMANACH versus 84∙3% (81∙4-87∙1%) using standard practice (p<0∙001). 2∙3% (1∙3-3.3) versus 3∙2% (1∙8-4∙6%) received an antibiotic secondarily. CONCLUSION: Management of children using ALMANACH improve clinical outcome and reduce antibiotic prescription by 80%. This was achieved through more accurate diagnoses and hence better identification of children in need of antibiotic treatment or not. The building on mobile technology allows easy access and rapid update of the decision chart. TRIAL REGISTRATION: Pan African Clinical Trials Registry PACTR201011000262218.

Managing the Sick Child in the Era of Declining Malaria Transmission: Development of ALMANACH, an Electronic Algorithm for Appropriate Use of Antimicrobials.

OBJECTIVE: To review the available knowledge on epidemiology and diagnoses of acute infections in children aged 2 to 59 months in primary care setting and develop an electronic algorithm for the Integrated Management of Childhood Illness to reach optimal clinical outcome and rational use of medicines. METHODS: A structured literature review in Medline, Embase and the Cochrane Database of Systematic Review (CDRS) looked for available estimations of diseases prevalence in outpatients aged 2-59 months, and for available evidence on i) accuracy of clinical predictors, and ii) performance of point-of-care tests for targeted diseases. A new algorithm for the management of childhood illness (ALMANACH) was designed based on evidence retrieved and results of a study on etiologies of fever in Tanzanian children outpatients. FINDINGS: The major changes in ALMANACH compared to IMCI (2008 version) are the following: i) assessment of 10 danger signs, ii) classification of non-severe children into febrile and non-febrile illness, the latter receiving no antibiotics, iii) classification of pneumonia based on a respiratory rate threshold of 50 assessed twice for febrile children 12-59 months; iv) malaria rapid diagnostic test performed for all febrile children. In the absence of identified source of fever at the end of the assessment, v) urine dipstick performed for febrile children <2 years to consider urinary tract infection, vi) classification of 'possible typhoid' for febrile children >2 years with abdominal tenderness; and lastly vii) classification of 'likely viral infection' in case of negative results. CONCLUSION: This smartphone-run algorithm based on new evidence and two point-of-care tests should improve the quality of care of <5 year children and lead to more rational use of antimicrobials.

CNDOL: A fast and reliable method for the calculation of electronic properties of very large systems. Applications to retinal binding pocket in rhodopsin and gas phase porphine.

Very large molecular systems can be calculated with the so called CNDOL approximate Hamiltonians that have been developed by avoiding oversimplifications and only using a priori parameters and formulas from the simpler NDO methods. A new diagonal monoelectronic term named CNDOL/21 shows great consistency and easier SCF convergence when used together with an appropriate function for charge repulsion energies that is derived from traditional formulas. It is possible to obtain a priori molecular orbitals and electron excitation properties after the configuration interaction of single excited determinants with reliability, maintaining interpretative possibilities even being a simplified Hamiltonian. Tests with some unequivocal gas phase maxima of simple molecules (benzene, furfural, acetaldehyde, hexyl alcohol, methyl amine, 2,5 dimethyl 2,4 hexadiene, and ethyl sulfide) ratify the general quality of this approach in comparison with other methods. The calculation of large systems as porphine in gas phase and a model of the complete retinal binding pocket in rhodopsin with 622 basis functions on 280 atoms at the quantum mechanical level show reliability leading to a resulting first allowed transition in 483 nm, very similar to the known experimental value of 500 nm of "dark state." In this very important case, our model gives a central role in this excitation to a charge transfer from the neighboring Glu(-) counterion to the retinaldehyde polyene chain. Tests with gas phase maxima of some important molecules corroborate the reliability of CNDOL/2 Hamiltonians.

Fast generation of spin-squeezed states in bosonic Josephson junctions

We describe methods for the fast production of highly coherent-spin-squeezed many-body states in bosonic Josephson junctions. We start from the known mapping of the two-site Bose-Hubbard (BH) Hamiltonian to that of a single effective particle evolving according to a Schrödinger-like equation in Fock space. Since, for repulsive interactions, the effective potential in Fock space is nearly parabolic, we extend recently derived protocols for shortcuts to adiabatic evolution in harmonic potentials to the many-body BH Hamiltonian. A comparison with current experiments shows that our methods allow for an important reduction in the preparation times of highly squeezed spin states.

New kernel functions and learning methods for text and data mining

Recent advances in machine learning methods enable increasingly the automatic construction of various types of computer assisted methods that have been difficult or laborious to program by human experts. The tasks for which this kind of tools are needed arise in many areas, here especially in the fields of bioinformatics and natural language processing. The machine learning methods may not work satisfactorily if they are not appropriately tailored to the task in question. However, their learning performance can often be improved by taking advantage of deeper insight of the application domain or the learning problem at hand. This thesis considers developing kernel-based learning algorithms incorporating this kind of prior knowledge of the task in question in an advantageous way. Moreover, computationally efficient algorithms for training the learning machines for specific tasks are presented. In the context of kernel-based learning methods, the incorporation of prior knowledge is often done by designing appropriate kernel functions. Another well-known way is to develop cost functions that fit to the task under consideration. For disambiguation tasks in natural language, we develop kernel functions that take account of the positional information and the mutual similarities of words. It is shown that the use of this information significantly improves the disambiguation performance of the learning machine. Further, we design a new cost function that is better suitable for the task of information retrieval and for more general ranking problems than the cost functions designed for regression and classification. We also consider other applications of the kernel-based learning algorithms such as text categorization, and pattern recognition in differential display. We develop computationally efficient algorithms for training the considered learning machines with the proposed kernel functions. We also design a fast cross-validation algorithm for regularized least-squares type of learning algorithm. Further, an efficient version of the regularized least-squares algorithm that can be used together with the new cost function for preference learning and ranking tasks is proposed. In summary, we demonstrate that the incorporation of prior knowledge is possible and beneficial, and novel advanced kernels and cost functions can be used in algorithms efficiently.

Fast oscillatory activity in the anterior cingulate cortex: dopaminergic modulation and effect of perineuronal net loss.

Dopamine release in the prefrontal cortex plays a critical role in cognitive function such as working memory, attention and planning. Dopamine exerts complex modulation on excitability of pyramidal neurons and interneurons, and regulates excitatory and inhibitory synaptic transmission. Because of the complexity of this modulation, it is difficult to fully comprehend the effect of dopamine on neuronal network activity. In this study, we investigated the effect of dopamine on local high-frequency oscillatory neuronal activity (in β band) in slices of the mouse anterior cingulate cortex (ACC). We found that dopamine enhanced the power of these oscillations induced by kainate and carbachol, but did not affect their peak frequency. Activation of D2R and in a lesser degree D1R increased the oscillation power, while activation of D4R had no effect. These high-frequency oscillations in the ACC relied on both phasic inhibitory and excitatory transmission and functional gap junctions. Thus, dopamine released in the ACC promotes high-frequency synchronized local cortical activity which is known to favor information transfer, fast selection and binding of distributed neuronal responses. Finally, the power of these oscillations was significantly enhanced after degradation of the perineuronal nets (PNNs) enwrapping most parvalbumin interneurons. This study provides new insights for a better understanding of the abnormal prefrontal gamma activity in schizophrenia (SZ) patients who display prefrontal anomalies of both the dopaminergic system and the PNNs.

Development of phase retrieval algorithm and techniques for optical spectrum analysis

Coherent anti-Stokes Raman scattering is the powerful method of laser spectroscopy in which significant successes are achieved. However, the non-linear nature of CARS complicates the analysis of the received spectra. The objective of this Thesis is to develop a new phase retrieval algorithm for CARS. It utilizes the maximum entropy method and the new wavelet approach for spectroscopic background correction of a phase function. The method was developed to be easily automated and used on a large number of spectra of different substances.. The algorithm was successfully tested on experimental data.

Fast and economic immobilization methods described for non-commercial Pseudomonas lipases

There is an increasing interest to seek new enzyme preparations for the development of new products derived from bioprocesses to obtain alternative bio-based materials. In this context, four non-commercial lipases from Pseudomonas species were prepared, immobilized on different low-cost supports, and examined for potential biotechnological applications. Results: To reduce costs of eventual scaling-up, the new lipases were obtained directly from crude cell extracts or from growth culture supernatants, and immobilized by simple adsorption on Accurel EP100, Accurel MP1000 and Celite (R) 545. The enzymes evaluated were LipA and LipC from Pseudomonas sp. 42A2, a thermostable mutant of LipC, and LipI. 3 from Pseudomonas CR611, which were produced in either homologous or heterologous hosts. Best immobilization results were obtained on Accurel EP100 for LipA and on Accurel MP1000 for LipC and its thermostable variant. Lip I. 3, requiring a refolding step, was poorly immobilized on all supports tested ( best results for Accurel MP1000). To test the behavior of immobilized lipases, they were assayed in triolein transesterification, where the best results were observed for lipases immobilized on Accurel MP1000. Conclusions: The suggested protocol does not require protein purification and uses crude enzymes immobilized by a fast adsorption technique on low-cost supports, which makes the method suitable for an eventual scaling up aimed at biotechnological applications. Therefore, a fast, simple and economic method for lipase preparation and immobilization has been set up. The low price of the supports tested and the simplicity of the procedure, skipping the tedious and expensive purification steps, will contribute to cost reduction in biotechnological lipase-catalyzed processes.

Fast spin echo imaging of carotid artery dynamics.

PURPOSE: We propose the use of a retrospectively gated cine fast spin echo (FSE) sequence for characterization of carotid artery dynamics. The aim of this study was to compare cine FSE measures of carotid dynamics with measures obtained on prospectively gated FSE images. METHODS: The common carotid arteries in 10 volunteers were imaged using two temporally resolved sequences: (i) cine FSE and (ii) prospectively gated FSE. Three raters manually traced a common carotid artery area for all cardiac phases on both sequences. Measured areas and systolic-diastolic area changes were calculated and compared. Inter- and intra-rater reliability were assessed for both sequences. RESULTS: No significant difference between cine FSE and prospectively gated FSE areas were observed (P = 0.36). Both sequences produced repeatable cross-sectional area measurements: inter-rater intraclass correlation coefficient (ICC) = 0.88 on cine FSE images and 0.87 on prospectively gated FSE images. Minimum detectable difference (MDD) in systolic-diastolic area was 4.9 mm(2) with cine FSE and 6.4 mm(2) with prospectively gated FSE. CONCLUSION: This cine FSE method produced repeatable dynamic carotid artery measurements with less artifact and greater temporal efficiency compared with prospectively gated FSE. Magn Reson Med 74:1103-1109, 2015. © 2014 Wiley Periodicals, Inc.

Efficient total variation algorithm for fetal MRI reconstruction

Fetal MRI reconstruction aims at finding a high-resolution image given a small set of low-resolution images. It is usually modeled as an inverse problem where the regularization term plays a central role in the reconstruction quality. Literature has considered several regularization terms s.a. Dirichlet/Laplacian energy [1], Total Variation (TV)based energies [2,3] and more recently non-local means [4]. Although TV energies are quite attractive because of their ability in edge preservation, standard explicit steepest gradient techniques have been applied to optimize fetal-based TV energies. The main contribution of this work lies in the introduction of a well-posed TV algorithm from the point of view of convex optimization. Specifically, our proposed TV optimization algorithm for fetal reconstruction is optimal w.r.t. the asymptotic and iterative convergence speeds O(1/n(2)) and O(1/root epsilon), while existing techniques are in O(1/n) and O(1/epsilon). We apply our algorithm to (1) clinical newborn data, considered as ground truth, and (2) clinical fetal acquisitions. Our algorithm compares favorably with the literature in terms of speed and accuracy.

'Fast-implantable' aortic valve implantation and concomitant mitral procedures.

Concomitant aortic and mitral valve replacement or concomitant aortic valve replacement and mitral repair can be a challenge for the cardiac surgeon: in particular, because of their structure and design, two bioprosthetic heart valves or an aortic valve prosthesis and a rigid mitral ring can interfere at the level of the mitroaortic junction. Therefore, when a mitral bioprosthesis or a rigid mitral ring is already in place and a surgical aortic valve replacement becomes necessary, or when older high-risk patients require concomitant mitral and aortic procedures, the new 'fast-implantable' aortic valve system (Intuity valve, Edwards Lifesciences, Irvine, CA, USA) can represent a smart alternative to standard aortic bioprosthesis. Unfortunately, this is still controversial (risk of interference). However, transcatheter aortic valve replacements have been performed in patients with previously implanted mitral valves or mitral rings. Interestingly, we learned that there is no interference (or not significant interference) among the standard valve and the stent valve. Consequently, we can assume that a fast-implantable valve can also be safely placed next to a biological mitral valve or next to a rigid mitral ring without risks of distortion, malpositioning, high gradient or paravalvular leak. This paper describes two cases: a concomitant Intuity aortic valve and bioprosthetic mitral valve implantation and a concomitant Intuity aortic valve and mitral ring implantation.

Question Waves: A multicast query routing algorithm for social search

This paper describes Question Waves, an algorithm that can be applied to social search protocols, such as Asknext or Sixearch. In this model, the queries are propagated through the social network, with faster propagation through more trustable acquaintances. Question Waves uses local information to make decisions and obtain an answer ranking. With Question Waves, the answers that arrive first are the most likely to be relevant, and we computed the correlation of answer relevance with the order of arrival to demonstrate this result. We obtained correlations equivalent to the heuristics that use global knowledge, such as profile similarity among users or the expertise value of an agent. Because Question Waves is compatible with the social search protocol Asknext, it is possible to stop a search when enough relevant answers have been found; additionally, stopping the search early only introduces a minimal risk of not obtaining the best possible answer. Furthermore, Question Waves does not require a re-ranking algorithm because the results arrive sorted