Comparison of the spine kinematics by defining lumbar as single and multi-segmental in completing critical daily task

The change of the spinal curvature in completing a variety of daily tasks is essential to independent living. There is still a lack of studies highlighting the lumbar segmental contribution during sit-to-stand (STS) and stand-to-flexion (STF) usingnon-invasive study. The purpose of this study is to compare the spine kinematics by defining lumbar as a single and multi-segmental during continuous daily motion in healthy Asian adults using a non-invasive approach. During STS, most subjects implementedkyphotic lumbar curve during the early stage of motion which revealed poor posture implementation and significant differences in the lumbar kinematics which were only noticeable at specific phases between both approaches. A significant difference in multi-segmental behaviour was observed only at the end of the motion. All three segments displayed different time responses during the transition from kyphotic to lordotic curve. Passive/delayed behavior within the lower lumbar segment was observed between 0-50% of motion completion. During STF, statistically significant differences were found between assuming lumbar as a single and multi-segment in all phases. This in vitro study identified characteristic motion patterns in the lumbar spine during daily motions. The results provided a clear description of the healthy spinal condition of adults and may serve to identify specific multi-segmental contribution

Control of chaos in nonlinear circuits and systems

Nonlinear circuits and systems, such as electronic circuits (Chapter 5), power converters (Chapter 6), human brains (Chapter 7), phase lock loops (Chapter 8), sigma delta modulators (Chapter 9), etc, are found almost everywhere. Understanding nonlinear behaviours as well as control of these circuits and systems are important for real practical engineering applications. Control theories for linear circuits and systems are well developed and almost complete. However, different nonlinear circuits and systems could exhibit very different behaviours. Hence, it is difficult to unify a general control theory for general nonlinear circuits and systems. Up to now, control theories for nonlinear circuits and systems are still very limited. The objective of this book is to review the state of the art chaos control methods for some common nonlinear circuits and systems, such as those listed in the above, and stimulate further research and development in chaos control for nonlinear circuits and systems. This book consists of three parts. The first part of the book consists of reviews on general chaos control methods. In particular, a time-delayed approach written by H. Huang and G. Feng is reviewed in Chapter 1. A master slave synchronization problem for chaotic Lur’e systems is considered. A delay independent and delay dependent synchronization criteria are derived based on the H performance. The design of the time delayed feedback controller can be accomplished by means of the feasibility of linear matrix inequalities. In Chapter 2, a fuzzy model based approach written by H.K. Lam and F.H.F. Leung is reviewed. The synchronization of chaotic systems subject to parameter uncertainties is considered. A chaotic system is first represented by the fuzzy model. A switching controller is then employed to synchronize the systems. The stability conditions in terms of linear matrix inequalities are derived based on the Lyapunov stability theory. The tracking performance and parameter design of the controller are formulated as a generalized eigenvalue minimization problem which is solved numerically via some convex programming techniques. In Chapter 3, a sliding mode control approach written by Y. Feng and X. Yu is reviewed. Three kinds of sliding mode control methods, traditional sliding mode control, terminal sliding mode control and non-singular terminal sliding mode control, are employed for the control of a chaotic system to realize two different control objectives, namely to force the system states to converge to zero or to track desired trajectories. Observer based chaos synchronizations for chaotic systems with single nonlinearity and multi-nonlinearities are also presented. In Chapter 4, an optimal control approach written by C.Z. Wu, C.M. Liu, K.L. Teo and Q.X. Shao is reviewed. Systems with nonparametric regression with jump points are considered. The rough locations of all the possible jump points are identified using existing kernel methods. A smooth spline function is used to approximate each segment of the regression function. A time scaling transformation is derived so as to map the undecided jump points to fixed points. The approximation problem is formulated as an optimization problem and solved via existing optimization tools. The second part of the book consists of reviews on general chaos controls for continuous-time systems. In particular, chaos controls for Chua’s circuits written by L.A.B. Tôrres, L.A. Aguirre, R.M. Palhares and E.M.A.M. Mendes are discussed in Chapter 5. An inductorless Chua’s circuit realization is presented, as well as some practical issues, such as data analysis, mathematical modelling and dynamical characterization, are discussed. The tradeoff among the control objective, the control energy and the model complexity is derived. In Chapter 6, chaos controls for pulse width modulation current mode single phase H-bridge inverters written by B. Robert, M. Feki and H.H.C. Iu are discussed. A time delayed feedback controller is used in conjunction with the proportional controller in its simple form as well as in its extended form to stabilize the desired periodic orbit for larger values of the proportional controller gain. This method is very robust and easy to implement. In Chapter 7, chaos controls for epileptiform bursting in the brain written by M.W. Slutzky, P. Cvitanovic and D.J. Mogul are discussed. Chaos analysis and chaos control algorithms for manipulating the seizure like behaviour in a brain slice model are discussed. The techniques provide a nonlinear control pathway for terminating or potentially preventing epileptic seizures in the whole brain. The third part of the book consists of reviews on general chaos controls for discrete-time systems. In particular, chaos controls for phase lock loops written by A.M. Harb and B.A. Harb are discussed in Chapter 8. A nonlinear controller based on the theory of backstepping is designed so that the phase lock loops will not be out of lock. Also, the phase lock loops will not exhibit Hopf bifurcation and chaotic behaviours. In Chapter 9, chaos controls for sigma delta modulators written by B.W.K. Ling, C.Y.F. Ho and J.D. Reiss are discussed. A fuzzy impulsive control approach is employed for the control of the sigma delta modulators. The local stability criterion and the condition for the occurrence of limit cycle behaviours are derived. Based on the derived conditions, a fuzzy impulsive control law is formulated so that the occurrence of the limit cycle behaviours, the effect of the audio clicks and the distance between the state vectors and an invariant set are minimized supposing that the invariant set is nonempty. The state vectors can be bounded within any arbitrary nonempty region no matter what the input step size, the initial condition and the filter parameters are. The editors are much indebted to the editor of the World Scientific Series on Nonlinear Science, Prof. Leon Chua, and to Senior Editor Miss Lakshmi Narayan for their help and congenial processing of the edition

The 1st Advanced Manufacturing Student Conference (AMSC21) Chemnitz, Germany 15–16 July 2021

The Advanced Manufacturing Student Conference (AMSC) represents an educational format designed to foster the acquisition and application of skills related to Research Methods in Engineering Sciences. Participating students are required to write and submit a conference paper and are given the opportunity to present their findings at the conference. The AMSC provides a tremendous opportunity for participants to practice critical skills associated with scientific publication. Conference Proceedings of the conference will benefit readers by providing updates on critical topics and recent progress in the advanced manufacturing engineering and technologies and, at the same time, will aid the transfer of valuable knowledge to the next generation of academics and practitioners. *** The first AMSC Conference Proceeding (AMSC21) addressed the following topics: Advances in “classical” Manufacturing Technologies, Technology and Application of Additive Manufacturing, Digitalization of Industrial Production (Industry 4.0), Advances in the field of Cyber-Physical Systems, Virtual and Augmented Reality Technologies throughout the entire product Life Cycle, Human-machine-environment interaction and Management and life cycle assessment.:- Advances in “classical” Manufacturing Technologies - Technology and Application of Additive Manufacturing - Digitalization of Industrial Production (Industry 4.0) - Advances in the field of Cyber-Physical Systems - Virtual and Augmented Reality Technologies throughout the entire product Life Cycle - Human-machine-environment interaction - Management and life cycle assessmen

Improving multifrontal solvers by means of algebraic Block Low-Rank representations

We consider the solution of large sparse linear systems by means of direct factorization based on a multifrontal approach. Although numerically robust and easy to use (it only needs algebraic information: the input matrix A and a right-hand side b, even if it can also digest preprocessing strategies based on geometric information), direct factorization methods are computationally intensive both in terms of memory and operations, which limits their scope on very large problems (matrices with up to few hundred millions of equations). This work focuses on exploiting low-rank approximations on multifrontal based direct methods to reduce both the memory footprints and the operation count, in sequential and distributed-memory environments, on a wide class of problems. We first survey the low-rank formats which have been previously developed to efficiently represent dense matrices and have been widely used to design fast solutions of partial differential equations, integral equations and eigenvalue problems. These formats are hierarchical (H and Hierarchically Semiseparable matrices are the most common ones) and have been (both theoretically and practically) shown to substantially decrease the memory and operation requirements for linear algebra computations. However, they impose many structural constraints which can limit their scope and efficiency, especially in the context of general purpose multifrontal solvers. We propose a flat format called Block Low-Rank (BLR) based on a natural blocking of the matrices and explain why it provides all the flexibility needed by a general purpose multifrontal solver in terms of numerical pivoting for stability and parallelism. We compare BLR format with other formats and show that BLR does not compromise much the memory and operation improvements achieved through low-rank approximations. A stability study shows that the approximations are well controlled by an explicit numerical parameter called low-rank threshold, which is critical in order to solve the sparse linear system accurately. Details on how Block Low-Rank factorizations can be efficiently implemented within multifrontal solvers are then given. We propose several Block Low-Rank factorization algorithms which allow for different types of gains. The proposed algorithms have been implemented within the MUMPS (MUltifrontal Massively Parallel Solver) solver. We first report experiments on standard partial differential equations based problems to analyse the main features of our BLR algorithms and to show the potential and flexibility of the approach; a comparison with a Hierarchically SemiSeparable code is also given. Then, Block Low-Rank formats are experimented on large (up to a hundred millions of unknowns) and various problems coming from several industrial applications. We finally illustrate the use of our approach as a preconditioning method for the Conjugate Gradient

Amélioration des solveurs multifrontaux à l'aide de représentations algébriques rang-faible par blocs

We consider the solution of large sparse linear systems by means of direct factorization based on a multifrontal approach. Although numerically robust and easy to use (it only needs algebraic information: the input matrix A and a right-hand side b, even if it can also digest preprocessing strategies based on geometric information), direct factorization methods are computationally intensive both in terms of memory and operations, which limits their scope on very large problems (matrices with up to few hundred millions of equations). This work focuses on exploiting low-rank approximations on multifrontal based direct methods to reduce both the memory footprints and the operation count, in sequential and distributed-memory environments, on a wide class of problems. We first survey the low-rank formats which have been previously developed to efficiently represent dense matrices and have been widely used to design fast solutions of partial differential equations, integral equations and eigenvalue problems. These formats are hierarchical (H and Hierarchically Semiseparable matrices are the most common ones) and have been (both theoretically and practically) shown to substantially decrease the memory and operation requirements for linear algebra computations. However, they impose many structural constraints which can limit their scope and efficiency, especially in the context of general purpose multifrontal solvers. We propose a flat format called Block Low-Rank (BLR) based on a natural blocking of the matrices and explain why it provides all the flexibility needed by a general purpose multifrontal solver in terms of numerical pivoting for stability and parallelism. We compare BLR format with other formats and show that BLR does not compromise much the memory and operation improvements achieved through low-rank approximations. A stability study shows that the approximations are well controlled by an explicit numerical parameter called low-rank threshold, which is critical in order to solve the sparse linear system accurately. Details on how Block Low-Rank factorizations can be efficiently implemented within multifrontal solvers are then given. We propose several Block Low-Rank factorization algorithms which allow for different types of gains. The proposed algorithms have been implemented within the MUMPS (MUltifrontal Massively Parallel Solver) solver. We first report experiments on standard partial differential equations based problems to analyse the main features of our BLR algorithms and to show the potential and flexibility of the approach; a comparison with a Hierarchically SemiSeparable code is also given. Then, Block Low-Rank formats are experimented on large (up to a hundred millions of unknowns) and various problems coming from several industrial applications. We finally illustrate the use of our approach as a preconditioning method for the Conjugate Gradient.Nous considérons la résolution de très grands systèmes linéaires creux à l'aide d'une méthode de factorisation directe appelée méthode multifrontale. Bien que numériquement robustes et faciles à utiliser (elles ne nécessitent que des informations algébriques : la matrice d'entrée A et le second membre b, même si elles peuvent exploiter des stratégies de prétraitement basées sur des informations géométriques), les méthodes directes sont très coûteuses en termes de mémoire et d'opérations, ce qui limite leur applicabilité à des problèmes de taille raisonnable (quelques millions d'équations). Cette étude se concentre sur l'exploitation des approximations de rang-faible dans la méthode multifrontale, pour réduire sa consommation mémoire et son volume d'opérations, dans des environnements séquentiel et à mémoire distribuée, sur une large classe de problèmes. D'abord, nous examinons les formats rang-faible qui ont déjà été développé pour représenter efficacement les matrices denses et qui ont été utilisées pour concevoir des solveur rapides pour les équations aux dérivées partielles, les équations intégrales et les problèmes aux valeurs propres. Ces formats sont hiérarchiques (les formats H et HSS sont les plus répandus) et il a été prouvé, en théorie et en pratique, qu'ils permettent de réduire substantiellement les besoins en mémoire et opération des calculs d'algèbre linéaire. Cependant, de nombreuses contraintes structurelles sont imposées sur les problèmes visés, ce qui peut limiter leur efficacité et leur applicabilité aux solveurs multifrontaux généraux. Nous proposons un format plat appelé Block Rang-Faible (BRF) basé sur un découpage naturel de la matrice en blocs et expliquons pourquoi il fournit toute la flexibilité nécéssaire à son utilisation dans un solveur multifrontal général, en terme de pivotage numérique et de parallélisme. Nous comparons le format BRF avec les autres et montrons que le format BRF ne compromet que peu les améliorations en mémoire et opération obtenues grâce aux approximations rang-faible. Une étude de stabilité montre que les approximations sont bien contrôlées par un paramètre numérique explicite appelé le seuil rang-faible, ce qui est critique dans l'optique de résoudre des systèmes linéaires creux avec précision. Ensuite, nous expliquons comment les factorisations exploitant le format BRF peuvent être efficacement implémentées dans les solveurs multifrontaux. Nous proposons plusieurs algorithmes de factorisation BRF, ce qui permet d'atteindre différents objectifs. Les algorithmes proposés ont été implémentés dans le solveur multifrontal MUMPS. Nous présentons tout d'abord des expériences effectuées avec des équations aux dérivées partielles standardes pour analyser les principales propriétés des algorithms BRF et montrer le potentiel et la flexibilité de l'approche ; une comparaison avec un code basé sur le format HSS est également fournie. Ensuite, nous expérimentons le format BRF sur des problèmes variés et de grande taille (jusqu'à une centaine de millions d'inconnues), provenant de nombreuses applications industrielles. Pour finir, nous illustrons l'utilisation de notre approche en tant que préconditionneur pour la méthode du Gradient Conjugué

Industrial and Technological Applications of Power Electronics Systems

The Special Issue "Industrial and Technological Applications of Power Electronics Systems" focuses on: - new strategies of control for electric machines, including sensorless control and fault diagnosis; - existing and emerging industrial applications of GaN and SiC-based converters; - modern methods for electromagnetic compatibility. The book covers topics such as control systems, fault diagnosis, converters, inverters, and electromagnetic interference in power electronics systems. The Special Issue includes 19 scientific papers by industry experts and worldwide professors in the area of electrical engineering

Q-Griffithsin interactions and utility for the prevention and treatment of Mucosal infections.

Griffithsin (GRFT) is a carbohydrate binding agent (lectin) that was originally identified in the red alga Griffithsia sp. Q-Griffithsin (Q-GRFT) is an oxidation stable analog of GRFT. GRFT has demonstrated inhibitory activity against HIV-1, Coronaviruses, Hepatitis C, influenza and Ebola viruses. The broad-spectrum activity suggests the potential utility of this lectin in a wide range of viral infections. However, the lectin’s activity in mucosal infections has not been extensively studied. Using in vitro, ex vivo and in vivo assays, we have demonstrated that Q-GRFT maintains the ability to bind glycosylated ligands following incubation in murine, macaque and human rectal fluids. Additionally, we demonstrated the first reported in vitro findings of antifungal activity by Q-GRFT. Furthermore, in murine prophylaxis and therapeutic infection models, Q-GRFT was efficacious against vaginal candidiasis. In response to the ongoing COVID-19 pandemic, we have demonstrated that in engineered human cornea and airway epithelia, repeated topical application resulted in Q-GRFT accumulation in mucosal tissues. In addition, in a human cadaver study, intranasal administration resulted in adequate drug dispersion on the nasal, nasopharyngeal and oropharyngeal cavities, with the drug detected in fluids collected from these anatomic sites. These findings support the development of a protocol for a Phase 1a first-in-human intranasal Q-GRFT administration to evaluate safety, tolerability, and pharmacokinetics of the drug product for pre-exposure prophylaxis against coronaviruses. Altogether, these data demonstrated Q-GRFT’s stability in the mucosal environment and support its incorporation in multipurpose STI prevention modalities given the novel antifungal activity. Epithelial accumulation and ability to detect Q-GRFT in nasal specimens supports the feasibility of successfully performing the Phase 1a study and future drug development as a prophylaxis against coronaviruses

Computational Sleep Behaviour Analysis and Application

Sleep affects a person’s health and is, therefore, assessed if health problems arise. Sleep behaviour is monitored for abnormalities in order to determine if any treatments, such as medication or behavioural changes (modifications to sleep habits), are necessary. Assessments are typically done using two methods: polysomnography over short periods and four-week retrospective questionnaires. These standard methods, however, cannot measure current sleep status continuously and unsupervised over long periods of time in the same way home-based sleep behaviour assessment can. In this work, we investigate the ability of sleep behaviour assessment using IoT devices in a natural home environment, which potential has not been investigated fully, to enable early abnormality detection and facilitate self-management. We developed a framework that incorporates different facets and perspectives to introduce focus and support in sleep behaviour assessment. The framework considers users’ needs, various available technologies, and factors that influence sleep behaviours. Sleep analysis approaches are incorporated to increase the reliability of the system. This assessment is strengthened by utilising sleep stage detection and sleep position recognition. This includes, first, the extraction and integration of influence factors of sleep stage recognition methods to create a fine-grained personalised approach and, second, the detection of common but more complex sleep positions, including leg positions. The relations between medical conditions and sleep are assessed through interviews with doctors and users on various topics, including treatment satisfaction and technology acceptance. The findings from these interviews led to the investigation of sleep behaviour as a diagnostic indicator. Changes in sleep behaviour are assessed alongside medical knowledge using data mining techniques to extract information about disease development; the following diseases were of interest: sleep apnoea, hypertension, diabetes, and chronic kidney disease. The proposed framework is designed in a way that allows it to be integrated into existing smart home environments. We believe that our framework provides promising building blocks for reliable sleep behaviour assessment by incorporating newly developed sleep analysis approaches. These approaches include a modular layered sleep behaviour assessment framework, a sleep regularity algorithm, a user-dependent visualisation concept, a higher-granularity sleep position analysis approach, a fine-grained sleep stage detection approach, a personalised sleep parameter extraction process, in-depth understanding on sleep and chronic disease relations, and a sleep-wake behaviour-based chronic disease detection method.This work has been supported by the European Union’s Horizon 2020 research and innovation program under the Marie Skłodowska-Curie grant agreement No. 676157