A method to align the coordinate system of accelerometers to the axes of a human body: The depitch algorithm

One of the key problems in accelerometry based gait analyses is that it may not be possible to attach an accelerometer to the lower trunk so that its axes are perfectly aligned to the axes of the subject. In this paper we will present an algorithm that was designed to virtually align the axes of the accelerometer to the axes of the subject during walking sections. This algorithm is based on a physically reasonable approach and built for measurements in unsupervised settings, where the test persons are applying the sensors by themselves. For evaluation purposes we conducted a study with 6 healthy subjects and measured their gait with a manually aligned and a skewed accelerometer attached to the subject's lower trunk. After applying the algorithm the intra-axis correlation of both sensors was on average 0.89±0.1 with a mean absolute error of 0.05g. We concluded that the algorithm was able to adjust the skewed sensor node virtually to the coordinate system of the subject.     

Efficient solution of a stochastic SI epidemic system

One of the side-effects of the climate changes that are upon us is that infectious diseases are adapting, evolving and spreading to new geographic regions. It is, therefore, imperious to develop epidemic models that shed light on the interplay between the dynamics of the spread of infectious diseases and the combined effects of various vaccination and prevention regimens. With this in mind, in this work we propose a epidemic model operating on a large population; we restrict our attention to strains of infectious diseases that resist treatment. The time-dependent epidemic accounts, among others, for the effects of improved sanitation, education and vaccination. Our first main contribution is to derive the time-dependent probability mass function of the number of infected individuals in such a system. Our derivation does not use probability generating functions and partial differential equations. Instead, we develop an iterative solution that is conceptually simple and easy to implement. Somewhat surprisingly, the epidemic model also provides insight into various stochastic phenomena noticed in sociology, macroeconomics, marketing, transportation and computer science. Our second main contribution is to show, by extensive simulations, that suitably instantiated, our epidemic model be used to model phenomena describing the adoption of durable consumer goods, the spread of AIDS and the dissemination of mobile worm spread.     

Photocatalytic degradation of a phenylurea, chlortoluron, in water using an industrial titanium dioxide coated media

The degradation of an herbicide, chlortoluron, by UV/TiO₂ photocatalysis in water using industrial titanium dioxide coated non-woven paper was studied. The influence of parameters such as adsorption capacity, initial concentration and TiO₂ implementation (coated or in suspension) was investigated. The results emphasize the importance of operational conditions and reactor geometry on the kinetic degradation rate. The analysis of the first organic by-products suggests that a hydroxyl radical attack occurs on the phenyl ring and methyl groups of the chlortoluron before the opening of the aromatic ring. The fate of hetero-atoms has been investigated. The fates of the two nitrogen atoms in the molecule are different, not only did it depend on their initial oxidation degree, as both had the same oxidation degree, but also on the initial oxidation state of neighboring carbons. The chlorine atoms were completely released as chloride ions. The study of the influence of the oxygen concentration showed the importance of the oxygen mass transfer when designing an industrial photocatalytic reactor. An original calculation process was carried out to evaluate the adsorption constant of oxygen over the whole photocatalysis period and not only in the initial conditions as previously provided. This work points out the necessity of extending the understanding of the efficiency of chlortoluron removal or of the removal of various complex pesticide mixtures found in agricultural wastewater, using alternative, more industrially realistic, reactors.     

Fourier methods for quasi‐periodic oscillations

Quasi‐periodic oscillations and invariant tori play an important role in the study of forced or coupled oscillators. This paper presents two new numerical methods for the investigation of quasi‐periodic oscillations. Both algorithms can be regarded as generalizations of the averaging and the harmonic (spectral) balance methods. The algorithms are easy to implement and require only minimal a priori knowledge of the system. Most importantly, the methods do not depend on an a priori co‐ordinate transformation. The methods are applied to a number of illustrative examples from non‐linear electrical engineering and the results show that the methods are efficient and reliable. In addition, these examples show that the presented algorithms can also continue through regions of sub‐harmonic (phase‐locked) resonance even though they are designed only for the quasi‐periodic case. Copyright © 2006 John Wiley & Sons, Ltd.     

Genetic algorithms in computer aided design

Design is a complex engineering activity, in which computers are more and more involved. The design task can often be seen as an optimization problem in which the parameters or the structure describing the best quality design are sought.Genetic algorithms constitute a class of search algorithms especially suited to solving complex optimization problems. In addition to parameter optimization, genetic algorithms are also suggested for solving problems in creative design, such as combining components in a novel, creative way.Genetic algorithms transpose the notions of evolution in Nature to computers and imitate natural evolution. Basically, they find solution(s) to a problem by maintaining a population of possible solutions according to the ‘survival of the fittest’ principle. We present here the main features of genetic algorithms and several ways in which they can solve difficult design problems. We briefly introduce the basic notions of genetic algorithms, namely, representation, genetic operators, fitness evaluation, and selection. We discuss several advanced genetic algorithms that have proved to be efficient in solving difficult design problems. We then give an overview of applications of genetic algorithms to different domains of engineering design.     

Teaching meshes, subdivision and multiresolution techniques

In recent years, geometry processing algorithms that directly operate on polygonal meshes have become an indispensable tool in computer graphics, CAD/CAM applications, numerical simulations, and medical imaging. Because the demand for people that are specialized in these techniques increases steadily the topic is finding its way into the standard curricula of related lectures on computer graphics and geometric modeling and is often the subject of seminars and presentations. In this article we suggest a toolbox to educators who are planning to set up a lecture or talk about geometry processing for a specific audience. For this we propose a set of teaching blocks, each of which covers a specific subtopic. These teaching blocks can be assembled so as to fit different occasions like lectures, courses, seminars and talks and different audiences like students and industrial practitioners. We also provide examples that can be used to deepen the subject matter and give references to the most relevant work.     

Generalized notions of mind change complexity

Gold introduced the notion of learning in the limit where a class S is learnable iff there is a recursive machine M which reads the course of values of a function f and converges to a program for f whenever f is in S. An important measure for the speed of convergence in this model is the quantity of mind changes before the onset of convergence. The oldest model is to consider a constant bound on the number of mind changes M makes on any input function; such a bound is referred here as type 1. Later this was generalized to a bound of type 2 where a counter ranges over constructive ordinals and is counted down at every mind change. Although ordinal bounds permit the inference of richer concept classes than constant bounds, they still are a severe restriction. Therefore the present work introduces two more general approaches to bounding mind changes. These are based on counting by going down in a linearly ordered set (type 3) and on counting by going down in a partially ordered set (type 4). In both cases the set must not contain infinite descending recursive sequences. These four types of mind changes yield a hierarchy and there are identifiable classes that cannot be learned with the most general mind change bound of type 4. It is shown that existence of type 2 bound is equivalent to the existence of a learning algorithm which converges on every (also nonrecursive) input function and the existence of type 4 is shown to be equivalent to the existence of a learning algorithm which converges on every recursive function. A partial characterization of type 3 yields a result of independent interest in recursion theory. The interplay between mind change complexity and choice of hypothesis space is investigated. It is established that for certain concept classes, a more expressive hypothesis space can sometimes reduce mind change complexity of learning these classes. The notion of mind change bound for behaviourally correct learning is indirectly addressed by employing the above four types to restrict the number of predictive errors of commission in finite error next value learning (NV′′)—a model equivalent to behaviourally correct learning. Again, natural characterizations for type 2 and type 4 bounds are derived. Their naturalness is further illustrated by characterizing them in terms of branches of uniformly recursive families of binary trees.     

Asymptotic Coupling Coefficients of Well-separated Single-mode Optical Waveguides

Abstract

Simple general formulae for the coupling coefficients of the fundamental modes on well-separated parallel optical waveguides are derived. The calculation merely requires accurate knowledge of the propagation constants and core fields of the modes on the individual waveguides, while the far-from-core fields need not be known. Results for coupled circular fibres are identical with the asymptotic expansions of previously derived exact coupling coefficients. Analytical expressions for the coupling coefficients between the fundamental modes on identical weakly guiding channel waveguides are obtained.     

Search for Superconductivity in Ultra-dense Deuterium D(?1) at Room Temperature: Depletion of D(?1) at Field Strength >0.05 T

Ultra-dense deuterium D(?1) is expected to be both a superfluid and a superconductor as shown by recent theoretical research. Condensed D(?1) can be deposited on surfaces by a source which produces a stream of clusters. A magnetic field strongly influences the type of material formed. Very little of D(?1) and of the form D(1), which is strongly coupled to D(?1), exists on the magnet surface or within several mm from the magnet surface. Even the formation of D(?1) on the source emitter is strongly influenced by a magnetic field, with a critical field strength in the range 0.03?C0.07 T. Higher excitation levels D(2) and D(3) dominate in a magnetic field. The excitation level D(2) is now observed for the first time. The removal of D(?1) and D(1) in strong magnetic fields is proposed to be due to a Meissner effect in long D(?1) clusters by large-orbit electron motion. The lifting of long D(?1) clusters above the magnet surface is slightly larger than expected, possibly due to the coupling to D(1). The previously reported oscillation between D(?1) and D(1) in an electric field is proposed to be due to destruction of D(?1).