Microbial transformations of acyclic monoterpenes

Microbial degradation of geraniol, citronellol, linalool and their corresponding acetates, structurally modified linalool and linalyl acetate, α-terpineol and β-myrcene are presented. Oxygenative and prototropic rearrangements are normally observed during the microbial metabolism of monoterpenes. Three types of oxygenation reactions are observed, namely, (a) allylic oxygenation (b) oxygenation on a double bond and (c) addition of water across the double bond. The studies indicate commonality in the reaction types or processes occurring during the metabolism of various related monoterpenes and also establish the convergence of degradative pathways at a central catabolic intermediate.

Integral Transformations of Volterra Gaussian Processes

We study integral representations of Gaussian processes with a pre-specified law in terms of other Gaussian processes. The dissertation consists of an introduction and of four research articles. In the introduction, we provide an overview about Volterra Gaussian processes in general, and fractional Brownian motion in particular. In the first article, we derive a finite interval integral transformation, which changes fractional Brownian motion with a given Hurst index into fractional Brownian motion with an other Hurst index. Based on this transformation, we construct a prelimit which formally converges to an analogous, infinite interval integral transformation. In the second article, we prove this convergence rigorously and show that the infinite interval transformation is a direct consequence of the finite interval transformation. In the third article, we consider general Volterra Gaussian processes. We derive measure-preserving transformations of these processes and their inherently related bridges. Also, as a related result, we obtain a Fourier-Laguerre series expansion for the first Wiener chaos of a Gaussian martingale. In the fourth article, we derive a class of ergodic transformations of self-similar Volterra Gaussian processes.

Using Mathematical Morphology for Geometric Music Retrieval

The usual task in music information retrieval (MIR) is to find occurrences of a monophonic query pattern within a music database, which can contain both monophonic and polyphonic content. The so-called query-by-humming systems are a famous instance of content-based MIR. In such a system, the user's hummed query is converted into symbolic form to perform search operations in a similarly encoded database. The symbolic representation (e.g., textual, MIDI or vector data) is typically a quantized and simplified version of the sampled audio data, yielding to faster search algorithms and space requirements that can be met in real-life situations. In this thesis, we investigate geometric approaches to MIR. We first study some musicological properties often needed in MIR algorithms, and then give a literature review on traditional (e.g., string-matching-based) MIR algorithms and novel techniques based on geometry. We also introduce some concepts from digital image processing, namely the mathematical morphology, which we will use to develop and implement four algorithms for geometric music retrieval. The symbolic representation in the case of our algorithms is a binary 2-D image. We use various morphological pre- and post-processing operations on the query and the database images to perform template matching / pattern recognition for the images. The algorithms are basically extensions to classic image correlation and hit-or-miss transformation techniques used widely in template matching applications. They aim to be a future extension to the retrieval engine of C-BRAHMS, which is a research project of the Department of Computer Science at University of Helsinki.

Matrices of finite Lorentz transformations in a noncompact basis. III. Completeness relation for O(2, 1)

A parametrization of the elements of the three-dimensional Lorentz group O(2, 1), suited to the use of a noncompact O(1, 1) basis in its unitary representations, is derived and used to set up the representation matrices for the entire group. The Plancherel formula for O(2, 1) is then expressed in this basis.

Comment on "Pseudoelasticity of Cu-Zr nanowires via stress-induced martensitic phase transformations"

Recently, a novel stress-induced phase transformation in an initial < 100 >/{100} B2-CuZr nanowire has been reported for the first time [Sutrakar and Mahapatra, Mater. Lett. 63, 1289 (2009)]. Following this, a martenisitic phase transformation in Cu-Zr nanowire was shown [Cheng et al., Appl. Phys. Lett. 95, 021911 (2009)] using the same idea (Sutrakar and Mahapatra, Mater. Lett. 63, 1289 (2009)]. The pseudoelastic recovery of the bct phase of Cu-Zr by unloading has also been shown [Cheng et al., Appl. Phys. Lett. 95, 021911 (2009)]. They also tested the epitaxial bain path [Alippi et al., Phys. Rev. Lett. 78, 3892 (1997)] and reported that the bct phase in the nanowire is metastable, whereas the bulk counterpart is unstable. This aspect is re-examined in this comment with corrected results.

Geometric Representation of Graphs in Low Dimension Using Axis Parallel Boxes

An axis-parallel k-dimensional box is a Cartesian product R-1 x R-2 x...x R-k where R-i (for 1 <= i <= k) is a closed interval of the form [a(i), b(i)] on the real line. For a graph G, its boxicity box(G) is the minimum dimension k, such that G is representable as the intersection graph of (axis-parallel) boxes in k-dimensional space. The concept of boxicity finds applications in various areas such as ecology, operations research etc. A number of NP-hard problems are either polynomial time solvable or have much better approximation ratio on low boxicity graphs. For example, the max-clique problem is polynomial time solvable on bounded boxicity graphs and the maximum independent set problem for boxicity d graphs, given a box representation, has a left perpendicular1 + 1/c log n right perpendicular(d-1) approximation ratio for any constant c >= 1 when d >= 2. In most cases, the first step usually is computing a low dimensional box representation of the given graph. Deciding whether the boxicity of a graph is at most 2 itself is NP-hard. We give an efficient randomized algorithm to construct a box representation of any graph G on n vertices in left perpendicular(Delta + 2) ln nright perpendicular dimensions, where Delta is the maximum degree of G. This algorithm implies that box(G) <= left perpendicular(Delta + 2) ln nright perpendicular for any graph G. Our bound is tight up to a factor of ln n. We also show that our randomized algorithm can be derandomized to get a polynomial time deterministic algorithm. Though our general upper bound is in terms of maximum degree Delta, we show that for almost all graphs on n vertices, their boxicity is O(d(av) ln n) where d(av) is the average degree.

Shape effect on optimal geometric conditions in surface aeration systems

The performance of surface aeration systems, among other key design variables, depends upon the geometric parameters of the aeration tank. Efficient performance and scale up or scale down of the experimental results of an aeration ystem requires optimal geometric conditions. Optimal conditions refer to the conditions of maximum oxygen transfer rate, which assists in scaling up or down the system for ommercial utilization. The present work investigates the effect of an aeration tank's shape (unbaffled circular, baffled circular and unbaffled square) on oxygen transfer. Present results demonstrate that there is no effect of shape on the optimal geometric conditions for rotor position and rotor dimensions. This experimentation shows that circular tanks (baffled or unbaffled) do not have optimal geometric conditions for liquid transfer, whereas the square cross-section tank shows a unique geometric shape to optimize oxygen transfer.

Analysis of DNA sequence transformations on grids

Study of the evolution of species or organisms is essential for various biological applications. Evolution is typically studied at the molecular level by analyzing the mutations of DNA sequences of organisms. Techniques have been developed for building phylogenetic or evolutionary trees for a set of sequences. Though phylogenetic trees capture the overall evolutionary relationships among the sequences, they do not reveal fine-level details of the evolution. In this work, we attempt to resolve various fine-level sequence transformation details associated with a phylogenetic tree using cellular automata. In particular, our work tries to determine the cellular automata rules for neighbor-dependent mutations of segments of DNA sequences. We also determine the number of time steps needed for evolution of a progeny from an ancestor and the unknown segments of the intermediate sequences in the phylogenetic tree. Due to the existence of vast number of cellular automata rules, we have developed a grid system that performs parallel guided explorations of the rules on grid resources. We demonstrate our techniques by conducting experiments on a grid comprising machines in three countries and obtaining potentially useful statistics regarding evolutions in three HIV sequences. In particular, our work is able to verify the phenomenon of neighbor-dependent mutations and find that certain combinations of neighbor-dependent mutations, defined by a cellular automata rule, occur with greater than 90% probability. We also find the average number of time steps for mutations for some branches of phylogenetic tree over a large number of possible transformations with standard deviations less than 2.

A geometric approach for determining inner and exterior boundaries of workspaces of planar manipulators

In this paper a method to determine the internal and external boundaries of planar workspaces, represented with an ordered set of points, is presented. The sequence of points are grouped and can be interpreted to form a sequence of curves. Three successive curves are used for determining the instantaneous center of rotation for the second one of them. The two extremal points on the curve with respect to the instantaneous center are recognized as singular points. The chronological ordering of these singular points is used to generate the two envelope curves, which are potentially intersecting. Methods have been presented in the paper for the determination of the workspace boundary from the envelope curves. Strategies to deal with the manipulators with joint limits and various degenerate situations have also been discussed. The computational steps being completely geometric, the method does not require the knowledge about the manipulator's kinematics. Hence, it can be used for the workspace of arbitrary planar manipulators. A number of illustrative examples demonstrate the efficacy of the proposed method.

A geometric approach to stationary defect solutions in one space dimension

In this manuscript, we consider the impact of a small jump-type spatial heterogeneity on the existence of stationary localized patterns in a system of partial dierential equations in one spatial dimension...

Structural transformations in Mn2NiGa due to residual stress

Powder x-ray diffraction study of Mn2NiGa ferromagnetic shape memory alloy shows the existence of a 7M monoclinic modulated structure at room temperature (RT). The structure of Mn2NiGa is found to be highly dependent on residual stress. For higher stress, the structure is tetragonal at RT, and for intermediate stress it is 7M monoclinic. However, only when the stress is considerably relaxed, the structure is cubic, as is expected at RT since the martensitic transition temperature is 230 K.

Capturability analysis of a geometric guidance law in relative velocity space

In this paper, a relative velocity approach is used to analyze the capturability of a geometric guidance law. Point mass models are assumed for both the missile and the target. The speeds of the missile and target are assumed to remain constant throughout the engagement. Lateral acceleration, obtained from the guidance law, is applied to change the path of the missile. The kinematic equations for engagements in the horizontal plane are derived in the relative velocity space. Some analytical results for the capture region are obtained for non-maneuvering and maneuvering targets. For non-maneuvering targets it is enough for the navigation gain to be a constant to intercept the target, while for maneuvering targets a time varying navigation gain is needed for interception. These results are then verified through numerical simulations.

Manifestation of geometric frustration on magnetic and thermodynamic properties of the pyrochlores Sm2X2O7 (X=Ti,Zr)

We present here magnetization, specific heat, and Raman studies on single-crystalline specimens of the first pyrochlore member Sm2Ti2O7 of the rare-earth titanate series. Its analogous compound Sm2Zr2O7 in the rare-earth zirconate series is also investigated in the polycrystalline form. The Sm spins in Sm2Ti2O7 remain unordered down to at least T=0.5 K. The absence of magnetic ordering is attributed to very small values of exchange (θcw∼−0.26 K) and dipolar interaction (μeff∼0.15 μB) between the Sm3+ spins in this pyrochlore. In contrast, the pyrochlore Sm2Zr2O7 is characterized by a relatively large value of Sm-Sm spin exchange (θcw∼−10 K); however, long-range ordering of the Sm3+ spins is not established at least down to T=0.67 K due to frustration of the Sm3+ spins on the pyrochlore lattice. The ground state of Sm3+ ions in both pyrochlores is a well-isolated Kramers doublet. The higher-lying crystal field excitations are observed in the low-frequency region of the Raman spectra of the two compounds recorded at T=10 K. At higher temperatures, the magnetic susceptibility of Sm2Ti2O7 shows a broad maximum at T=140 K, while that of Sm2Zr2O7 changes monotonically. Whereas Sm2Ti2O7 is a promising candidate for investigating spin fluctuations on a frustrated lattice, as indicated by our data, the properties of Sm2Zr2O7 seem to conform to a conventional scenario where geometrical frustration of the spin excludes their long-range ordering.