The mechanics of disc degeneration from an engineering and computational modelling viewpoint

The anatomy and microstructure of the spine and in particular the intervertebral disc are intimately linked to how they operate in vivo and how they distribute loads to the adjacent musculature and bony anatomy. The degeneration of the intervertebral discs may be characterised by a loss of hydration, loss of disc height, a granular texture and the presence of annular lesions. As such, degeneration of the intervertebral discs compromises the mechanical integrity of their components and results in adaption and modification in the mechanical means by which loads are distributed between adjacent spinal motion segments.

Computational fluid dynamics of a centrifugal heart pump as biventricular assist device(BVAD)

The results of a recent study have shown that there is a severe shortage of donor hearts to meet the demand of patients suffering from acute heart failures, and patients who received a left ventricular assist device (LVAD) have extended lives. However, some of them develop right heart failure syndrome, and these patients required a right ventricular assist device (RVAD). Hence, current research focus is in the development of a bi-ventricular assist device (Bi-VAD). Computational Fluid Dynamics (CFD) is useful for estimating blood damage for design of a Bi-VAD centrifugal heart pump to meet the demand of the left and right ventricles of a normal hearts with a flow rate of 5 lit/min and the supply pressure of 100 mmHg for the left ventricle and 20 mmHg for the right ventricle. Numerical studies have been conducted to predict pressure, flow rate, the velocity profiles, and streamlines in a continuous flow Bi-VAD using. Based on the predictions of numerical simulations, only few flow regions in the Bi-VAD exhibited signs of velocity profiles and stagnation points, thereby signifying potentially low levels of thrombogenesis.

Computational power meets human contact

This chapter traces the development of the global digital storytelling movement from its origins in California to its adoption by the BBC in the UK and its subsequent dispersal around the world. It identifies the foundational practices, uneven development and diffusion, and emergent practices internationally.

Computational approach to localization using global energy minimization

Damage localization induced by strain softening can be predicted by the direct minimization of a global energy function. This article concerns the computational strategy for implementing this principle for softening materials such as concrete. Instead of using heuristic global optimization techniques, our strategies are a hybrid of local optimization methods with a path-finding approach to ensure a global optimum. With admissible nodal displacements being independent variables, it is easy to deal with the geometric (mesh) constraint conditions. The direct search optimization methods recover the localized solutions for a range of softening lattice models which are representative of quasi-brittle structures

Mechanobiology of Bone Development and Computational Simulations

Bone is important because it provides the skeleton structural integrity and enables movement and locomotion. Its development and morphology follow its function. It adapts to changes of mechanical loading and has the ability to repair itself after damage or fracture. The processes of bone development, bone adaptation, and bone regeneration in fracture healing are regulated, in part, by mechanical stimuli that result when the bone is loaded.

Changing musical emotion : a computational rule system for modifying score and performance

When communicating emotion in music, composers and performers encode their expressive intentions through the control of basic musical features such as: pitch, loudness, timbre, mode, and articulation. The extent to which emotion can be controlled through the systematic manipulation of these features has not been fully examined. In this paper we present CMERS, a Computational Music Emotion Rule System for the control of perceived musical emotion that modifies features at the levels of score and performance in real-time. CMERS performance was evaluated in two rounds of perceptual testing. In experiment I, 20 participants continuously rated the perceived emotion of 15 music samples generated by CMERS. Three music works, each with five emotional variations were used (normal, happy, sad, angry, and tender). The intended emotion by CMERS was correctly identified 78% of the time, with significant shifts in valence and arousal also recorded, regardless of the works’ original emotion.

Computational fluid dynamics for improved bioreactor design and 3D culture

The complex relationship between the hydrodynamic environment and surrounding tissues directly impacts on the design and production of clinically useful grafts and implants. Tissue engineers have generally seen bioreactors as 'black boxes' within which tissue engineering constructs (TECs) are cultured. It is accepted that a more detailed description of fluid mechanics and nutrient transport within process equipment can be achieved by using computational fluid dynamics (CFD) technology. This review discusses applications of CFD for tissue engineering-related bioreactors -- fluid flow processes have direct implications on cellular responses such as attachment, migration and proliferation. We conclude that CFD should be seen as an invaluable tool for analyzing and visualizing the impact of fluidic forces and stresses on cells and TECs.

Automated symbolic and numeric procedure for manipulator rigid-body dynamic significance analysis and simplification

This paper describes an automated procedure for analysing the significance of each of the many terms in the equations of motion for a serial-link robot manipulator. Significance analysis provides insight into the rigid-body dynamic effects that are significant locally or globally in the manipulator's state space. Deleting those terms that do not contribute significantly to the total joint torque can greatly reduce the computational burden for online control, and a Monte-Carlo style simulation is used to investigate the errors thus introduced. The procedures described are a hybrid of symbolic and numeric techniques, and can be readily implemented using standard computer algebra packages.

Elliptic curves, group law, and efficient computation

This thesis is about the derivation of the addition law on an arbitrary elliptic curve and efficiently adding points on this elliptic curve using the derived addition law. The outcomes of this research guarantee practical speedups in higher level operations which depend on point additions. In particular, the contributions immediately find applications in cryptology. Mastered by the 19th century mathematicians, the study of the theory of elliptic curves has been active for decades. Elliptic curves over finite fields made their way into public key cryptography in late 1980’s with independent proposals by Miller [Mil86] and Koblitz [Kob87]. Elliptic Curve Cryptography (ECC), following Miller’s and Koblitz’s proposals, employs the group of rational points on an elliptic curve in building discrete logarithm based public key cryptosystems. Starting from late 1990’s, the emergence of the ECC market has boosted the research in computational aspects of elliptic curves. This thesis falls into this same area of research where the main aim is to speed up the additions of rational points on an arbitrary elliptic curve (over a field of large characteristic). The outcomes of this work can be used to speed up applications which are based on elliptic curves, including cryptographic applications in ECC. The aforementioned goals of this thesis are achieved in five main steps. As the first step, this thesis brings together several algebraic tools in order to derive the unique group law of an elliptic curve. This step also includes an investigation of recent computer algebra packages relating to their capabilities. Although the group law is unique, its evaluation can be performed using abundant (in fact infinitely many) formulae. As the second step, this thesis progresses the finding of the best formulae for efficient addition of points. In the third step, the group law is stated explicitly by handling all possible summands. The fourth step presents the algorithms to be used for efficient point additions. In the fifth and final step, optimized software implementations of the proposed algorithms are presented in order to show that theoretical speedups of step four can be practically obtained. In each of the five steps, this thesis focuses on five forms of elliptic curves over finite fields of large characteristic. A list of these forms and their defining equations are given as follows: (a) Short Weierstrass form, y2 = x3 + ax + b, (b) Extended Jacobi quartic form, y2 = dx4 + 2ax2 + 1, (c) Twisted Hessian form, ax3 + y3 + 1 = dxy, (d) Twisted Edwards form, ax2 + y2 = 1 + dx2y2, (e) Twisted Jacobi intersection form, bs2 + c2 = 1, as2 + d2 = 1, These forms are the most promising candidates for efficient computations and thus considered in this work. Nevertheless, the methods employed in this thesis are capable of handling arbitrary elliptic curves. From a high level point of view, the following outcomes are achieved in this thesis. - Related literature results are brought together and further revisited. For most of the cases several missed formulae, algorithms, and efficient point representations are discovered. - Analogies are made among all studied forms. For instance, it is shown that two sets of affine addition formulae are sufficient to cover all possible affine inputs as long as the output is also an affine point in any of these forms. In the literature, many special cases, especially interactions with points at infinity were omitted from discussion. This thesis handles all of the possibilities. - Several new point doubling/addition formulae and algorithms are introduced, which are more efficient than the existing alternatives in the literature. Most notably, the speed of extended Jacobi quartic, twisted Edwards, and Jacobi intersection forms are improved. New unified addition formulae are proposed for short Weierstrass form. New coordinate systems are studied for the first time. - An optimized implementation is developed using a combination of generic x86-64 assembly instructions and the plain C language. The practical advantages of the proposed algorithms are supported by computer experiments. - All formulae, presented in the body of this thesis, are checked for correctness using computer algebra scripts together with details on register allocations.