Conformation And C-N Rotational Barrier Of Dithiocarbamate Esters Nmr And Molecular-Orbital Studies

The variable temperature proton and ambient temperature carbon-13 NMR spectra of S-methyl dithiocarbamate esters have been recorded. The results of the theoretical energy calculations (CNDO/2 and EHT types) together with the experimental data have been interpreted in terms of the molecular conformations. The barrier heights for the rotation about the thioamide C—N bond are calculated using the CNDO/2 method and the results are discussed in terms of the computed charge densities and bond orders.

Construction of Stability Multipliers with Prescribed Phase Characteristics: an Improved Value for $\sigma

For a feedback system consisting of a transfer function $G(s)$ in the forward path and a time-varying gain $n(t)(0 \leqq n(t) \leqq k)$ in the feedback loop, a stability multiplier $Z(s)$ has been constructed (and used to prove stability) by Freedman [2] such that $Z(s)(G(s) + {1 / K})$ and $Z(s - \sigma )(0 < \sigma < \sigma _ * )$ are strictly positive real, where $\sigma _ * $ can be computed from a knowledge of the phase-angle characteristic of $G(i\omega ) + {1 / k}$ and the time-varying gain $n(t)$ is restricted by $\sigma _ * $ by means of an integral inequality. In this note it is shown that an improved value for $\sigma _ * $ is possible by making some modifications in his derivation. ©1973 Society for Industrial and Applied Mathematics.

Direct and Inverse Scattering for Beltrami Fields

We consider an obstacle scattering problem for linear Beltrami fields. A vector field is a linear Beltrami field if the curl of the field is a constant times itself. We study the obstacles that are of Neumann type, that is, the normal component of the total field vanishes on the boundary of the obstacle. We prove the unique solvability for the corresponding exterior boundary value problem, in other words, the direct obstacle scattering model. For the inverse obstacle scattering problem, we deduce the formulas that are needed to apply the singular sources method. The numerical examples are computed for the direct scattering problem and for the inverse scattering problem.

Sonography of paediatric appendicitis and its secondary signs

Sonographic diagnosis of appendicitis in children is an important clinical tool, often obviating the need for potentially harmful ionising radiation from computed tomography (CT) scans and unnecessary appendectomies. Established criteria do not commonly account for the sonographic secondary signs of acute appendicitis as an adjunct or corollary to an identifiably inflamed appendix. If one of, or combinations of these secondary signs are a reliable positive and/or negative indicator of the condition, diagnostic accuracy may be improved. This will be of particular importance in cases where the appendix cannot be easily identified, possibly providing referring clinicians with a less equivocal diagnosis. Acute appendicitis (AA) is the most common emergency presentation requiring surgical intervention among both adults and children. During 2010-11 in Australia 25000 appendicectomies were performed on adults and children, more than double the number of the next most common surgical procedure [1]. Ultrasound has been commonly used to diagnose AA since the 1980s, however the best imaging modality or combination of modalities to accurately and cost-effectively diagnose the condition is still debated. A study by Puylaert advocated ultrasound in all presentations [2], whereas others suggested it only as a first line modality [3–5]. Conversely, York et al state that it is not appropriate as it delays treatment [6]. CT has been shown to more accurately diagnose AA than ultrasound, however its inherent radiation risks warrant cautionary use in children [7]. Improved accuracy in the diagnosis of suspected AA using ultrasound would enable surgeons to make a decision without the need to expose children to the potentially harmful effects of CT. Secondary signs of appendicitis are well established [8], although research into their predictive values has only recently been undertaken [9,10] indicating their potential diagnostic benefit in the absence of an identifiable appendix. The purpose of this review is to examine the history of appendiceal sonography, established sonographic criteria, paediatric specific techniques and the predictive value of secondary signs.

Mining Sequential Data – in Search of Segmental Structures

Segmentation is a data mining technique yielding simplified representations of sequences of ordered points. A sequence is divided into some number of homogeneous blocks, and all points within a segment are described by a single value. The focus in this thesis is on piecewise-constant segments, where the most likely description for each segment and the most likely segmentation into some number of blocks can be computed efficiently. Representing sequences as segmentations is useful in, e.g., storage and indexing tasks in sequence databases, and segmentation can be used as a tool in learning about the structure of a given sequence. The discussion in this thesis begins with basic questions related to segmentation analysis, such as choosing the number of segments, and evaluating the obtained segmentations. Standard model selection techniques are shown to perform well for the sequence segmentation task. Segmentation evaluation is proposed with respect to a known segmentation structure. Applying segmentation on certain features of a sequence is shown to yield segmentations that are significantly close to the known underlying structure. Two extensions to the basic segmentation framework are introduced: unimodal segmentation and basis segmentation. The former is concerned with segmentations where the segment descriptions first increase and then decrease, and the latter with the interplay between different dimensions and segments in the sequence. These problems are formally defined and algorithms for solving them are provided and analyzed. Practical applications for segmentation techniques include time series and data stream analysis, text analysis, and biological sequence analysis. In this thesis segmentation applications are demonstrated in analyzing genomic sequences.

Computational Techniques for Haplotype Inference and for Local Alignment Significance

This thesis which consists of an introduction and four peer-reviewed original publications studies the problems of haplotype inference (haplotyping) and local alignment significance. The problems studied here belong to the broad area of bioinformatics and computational biology. The presented solutions are computationally fast and accurate, which makes them practical in high-throughput sequence data analysis. Haplotype inference is a computational problem where the goal is to estimate haplotypes from a sample of genotypes as accurately as possible. This problem is important as the direct measurement of haplotypes is difficult, whereas the genotypes are easier to quantify. Haplotypes are the key-players when studying for example the genetic causes of diseases. In this thesis, three methods are presented for the haplotype inference problem referred to as HaploParser, HIT, and BACH. HaploParser is based on a combinatorial mosaic model and hierarchical parsing that together mimic recombinations and point-mutations in a biologically plausible way. In this mosaic model, the current population is assumed to be evolved from a small founder population. Thus, the haplotypes of the current population are recombinations of the (implicit) founder haplotypes with some point--mutations. HIT (Haplotype Inference Technique) uses a hidden Markov model for haplotypes and efficient algorithms are presented to learn this model from genotype data. The model structure of HIT is analogous to the mosaic model of HaploParser with founder haplotypes. Therefore, it can be seen as a probabilistic model of recombinations and point-mutations. BACH (Bayesian Context-based Haplotyping) utilizes a context tree weighting algorithm to efficiently sum over all variable-length Markov chains to evaluate the posterior probability of a haplotype configuration. Algorithms are presented that find haplotype configurations with high posterior probability. BACH is the most accurate method presented in this thesis and has comparable performance to the best available software for haplotype inference. Local alignment significance is a computational problem where one is interested in whether the local similarities in two sequences are due to the fact that the sequences are related or just by chance. Similarity of sequences is measured by their best local alignment score and from that, a p-value is computed. This p-value is the probability of picking two sequences from the null model that have as good or better best local alignment score. Local alignment significance is used routinely for example in homology searches. In this thesis, a general framework is sketched that allows one to compute a tight upper bound for the p-value of a local pairwise alignment score. Unlike the previous methods, the presented framework is not affeced by so-called edge-effects and can handle gaps (deletions and insertions) without troublesome sampling and curve fitting.

Flow field and traverse times for fan forced injection of fumigant via circular or annular inlet into stored grain

Fan forced injection of phosphine gas fumigant into stored grain is a common method to treat infestation by insects. For low injection velocities the transport of fumigant can be modelled as Darcy flow in a porous medium where the gas pressure satisfies Laplace's equation. Using this approach, a closed form series solution is derived for the pressure, velocity and streamlines in a cylindrically stored grain bed with either a circular or annular inlet, from which traverse times are numerically computed. A leading order closed form expression for the traverse time is also obtained and found to be reasonable for inlet configurations close to the central axis of the grain storage. Results are interpreted for the case of a representative 6m high farm wheat store, where the time to advect the phosphine to almost the entire grain bed is found to be approximately one hour.

Automatic Path Planning and Control Design for Autonomous Landing of UAVs using Dynamic Inversion

In this paper a nonlinear control has been designed using the dynamic inversion approach for automatic landing of unmanned aerial vehicles (UAVs), along with associated path planning. This is a difficult problem because of light weight of UAVs and strong coupling between longitudinal and lateral modes. The landing maneuver of the UAV is divided into approach, glideslope and flare. In the approach UAV aligns with the centerline of the runway by heading angle correction. In glideslope and flare the UAV follows straight line and exponential curves respectively in the pitch plane with no lateral deviations. The glideslope and flare path are scheduled as a function of approach distance from runway. The trajectory parameters are calculated such that the sink rate at touchdown remains within specified bounds. It is also ensured that the transition from the glideslope to flare path is smooth by ensuring C-1 continuity at the transition. In the outer loop, the roll rate command is generated by assuring a coordinated turn in the alignment segment and by assuring zero bank angle in the glideslope and flare segments. The pitch rate command is generated from the error in altitude to control the deviations from the landing trajectory. The yaw rate command is generated from the required heading correction. In the inner loop, the aileron, elevator and rudder deflections are computed together to track the required body rate commands. Moreover, it is also ensured that the forward velocity of the UAV at the touch down remains close to a desired value by manipulating the thrust of the vehicle. A nonlinear six-DOF model, which has been developed from extensive wind-tunnel testing, is used both for control design as well as to validate it.

Positional Consensus in Multi-Agent Systems using a Broadcast Control Mechanism

In this paper a strategy for controlling a group of agents to achieve positional consensus is presented. The proposed technique is based on the constraint that every agents must be given the same control input through a broadcast communication mechanism. Although the control command is computed using state information in a global framework, the control input is implemented by the agents in a local coordinate frame. We propose a novel linear programming formulation that is computationally less intensive than earlier proposed methods. Moreover, we introduce a random perturbation input in the control command that helps us to achieve perfect consensus even for a large number of agents, which was not possible with the existing strategy in the literature. Moreover, we extend the method to achieve positional consensus at a pre-specified location. The effectiveness of the approach is illustrated through simulation results.

Rotational cut-off and anharmonicity effects on thermodynamic properties of gases at high temperatures

The exact expressions for the partition function (Q) and the coefficient of specific heat at constant volume (Cv) for a rotating-anharmonic oscillator molecule, including coupling and rotational cut-off, have been formulated and values of Q and Cv have been computed in the temperature range of 100 to 100,000 K for O2, N2 and H2 gases. The exact Q and Cv values are also compared with the corresponding rigid-rotator harmonic-oscillator (infinite rotational and vibrational levels) and rigid-rotator anharmonic-oscillator (infinite rotational levels) values. The rigid-rotator harmonic-oscillator approximation can be accepted for temperatures up to about 5000 K for O2 and N2. Beyond these temperatures the error in Cv will be significant, because of anharmonicity and rotational cut-off effects. For H2, the rigid-rotator harmonic-oscillator approximation becomes unacceptable even for temperatures as low as 2000 K.