Studies on the wobble mode stability of a three-wheeled vehicle

A wobble instability is one of the major problems of a three-wheeled vehicle commonly used in India, and these instabilities are of great interest to industry and academia. In this paper, we studied this instability using a multi-body dynamic model and with experiments conducted on a prototype three-wheeled vehicle on a test track. The multi-body dynamic model of a three-wheeled vehicle is developed using the commercial software ADAMS/Car. In an initial model, all components including main structures such as the frame, the steering column and the rear forks are assumed to be rigid bodies. A linear eigenvalue analysis, which is carried out at different speeds, reveals a mode that has predominantly a steering oscillation, also called a wobble mode, with a frequency of around 5-6Hz. The analysis results shows that the damping of this mode is low but positive up to the maximum speed of the three-wheeled vehicle. However, the experimental study shows that the mode is unstable at speeds below 8.33m/s. To predict and study this instability in detail, a more refined model of the three-wheeled vehicle, with flexibilities of three important bodies, was constructed in ADAMS/Car. With flexible bodies, three modes of a steering oscillation were observed. Two of these are well damped and the other is lightly damped with negative damping at lower speeds. Simulation results with flexibility incorporated show a good match with the instability observed in the experimental studies. Further, we investigated the effect of each flexible body and found that the flexibility of the steering column is the major contributor for wobble instability and is similar to the wheel shimmy problem in aircraft.

Temperature dependent electrical behaviour of Cu2SnS3 films

The temperature dependent electrical properties of the dropcasted Cu2SnS3 films have been measured in the temperature range 140 K to 317 K. The log I versus root V plot shows two regions. The region at lower bias is due to electrode limited Schottky emission and the higher bias region is due to bulk limited Poole Frenkel emission. The ideality factor is calculated from the ln I versus V plot for different temperatures fitted with the thermionic emission model and is found to vary from 6.05 eV to 12.23 eV. This large value is attributed to the presence of defects or amorphous layer at the Ag / Cu2SnS3 interface. From the Richardson's plot the Richardson's constant and the barrier height were calculated. Owing to the inhomogeneity in the barrier heights, the Richardson's constant and the barrier height were also calculated from the modified Richardson's plot. The I-V-T curves were also fitted using the thermionic field emission model. The barrier heights were found to be higher than those calculated using thermionic emission model. From the fit of the I-V-T curves to the field emission model, field emission was seen to dominate in the low temperature range of 140 K to 177 K. The temperature dependent current graphs show two regions of different mechanisms. The log I versus 1000/T plot gives activation energies E-a1 = 0.367095 - 0.257682 eV and E-a2 = 0.038416 - 0.042452 eV. The log ( I/T-2) versus 1000/T graph gives trap depths Phi(o1) = 0.314159 - 0.204752 eV and Phi(o2) = 0.007425- 0.011163 eV. With increasing voltage the activation energy E-a1 and the trap depth Phi(o1) decrease. From the ln (IT1/ 2) versus 1/T-1/ 4 graph, the low temperature region is due to variable range hopping mechanism and the high temperature region is due to thermionic emission. (C) 2014 Author(s).

Predicting gene ontology annotations of orphan GWAS genes using protein-protein interactions

Background: The number of genome-wide association studies (GWAS) has increased rapidly in the past couple of years, resulting in the identification of genes associated with different diseases. The next step in translating these findings into biomedically useful information is to find out the mechanism of the action of these genes. However, GWAS studies often implicate genes whose functions are currently unknown; for example, MYEOV, ANKLE1, TMEM45B and ORAOV1 are found to be associated with breast cancer, but their molecular function is unknown. Results: We carried out Bayesian inference of Gene Ontology (GO) term annotations of genes by employing the directed acyclic graph structure of GO and the network of protein-protein interactions (PPIs). The approach is designed based on the fact that two proteins that interact biophysically would be in physical proximity of each other, would possess complementary molecular function, and play role in related biological processes. Predicted GO terms were ranked according to their relative association scores and the approach was evaluated quantitatively by plotting the precision versus recall values and F-scores (the harmonic mean of precision and recall) versus varying thresholds. Precisions of similar to 58% and similar to 40% for localization and functions respectively of proteins were determined at a threshold of similar to 30 (top 30 GO terms in the ranked list). Comparison with function prediction based on semantic similarity among nodes in an ontology and incorporation of those similarities in a k nearest neighbor classifier confirmed that our results compared favorably. Conclusions: This approach was applied to predict the cellular component and molecular function GO terms of all human proteins that have interacting partners possessing at least one known GO annotation. The list of predictions is available at http://severus.dbmi.pitt.edu/engo/GOPRED.html. We present the algorithm, evaluations and the results of the computational predictions, especially for genes identified in GWAS studies to be associated with diseases, which are of translational interest.

Two new atom centered fragment descriptors and scoring function enhance classification of antibacterial activity

Classification of pharmacologic activity of a chemical compound is an essential step in any drug discovery process. We develop two new atom-centered fragment descriptors (vertex indices) - one based solely on topological considerations without discriminating atomor bond types, and another based on topological and electronic features. We also assess their usefulness by devising a method to rank and classify molecules with regard to their antibacterial activity. Classification performances of our method are found to be superior compared to two previous studies on large heterogeneous data sets for hit finding and hit-to-lead studies even though we use much fewer parameters. It is found that for hit finding studies topological features (simple graph) alone provide significant discriminating power, and for hit-to-lead process small but consistent improvement can be made by additionally including electronic features (colored graph). Our approach is simple, interpretable, and suitable for design of molecules as we do not use any physicochemical properties. The singular use of vertex index as descriptor, novel range based feature extraction, and rigorous statistical validation are the key elements of this study.

Parallel Flow-Sensitive Pointer Analysis by Graph-Rewriting

Precise pointer analysis is a problem of interest to both the compiler and the program verification community. Flow-sensitivity is an important dimension of pointer analysis that affects the precision of the final result computed. Scaling flow-sensitive pointer analysis to millions of lines of code is a major challenge. Recently, staged flow-sensitive pointer analysis has been proposed, which exploits a sparse representation of program code created by staged analysis. In this paper we formulate the staged flow-sensitive pointer analysis as a graph-rewriting problem. Graph-rewriting has already been used for flow-insensitive analysis. However, formulating flow-sensitive pointer analysis as a graph-rewriting problem adds additional challenges due to the nature of flow-sensitivity. We implement our parallel algorithm using Intel Threading Building Blocks and demonstrate considerable scaling (upto 2.6x) for 8 threads on a set of 10 benchmarks. Compared to the sequential implementation of staged flow-sensitive analysis, a single threaded execution of our implementation performs better in 8 of the benchmarks.

Dielectric Impedance Studies of Poly(vinyl butyral)-Cenosphere Composite Films

In the current study, amino silane functionalized cenosphere particles was used as a reinforcing filler in poly(vinyl butyral) matrix and were made by melt blending. The changes observed in the dielectric performance of the composite films with varying weight percentage of cenosphere particle in the matrix were investigated. The dielectric property and impedance spectroscopy were evaluated as a function of applied frequency in the range of 50 Hz to 5 MHz. It is observed that, because of orientation polarization of the PVB polymer, the permittivity and impedance decrease, whereas conductivity increases. Tangent loss graph indicates that the property of the matrix is associated with geometrical fill factor and the lowest quality factor. Therefore, above 10 kHz, these composites can be considered as dielectric loss-less material. (C) 2013 Society of Plastics Engineers

Approximation of Spatio-Temporal Random Processes Using Tensor Decomposition

A new representation of spatio-temporal random processes is proposed in this work. In practical applications, such processes are used to model velocity fields, temperature distributions, response of vibrating systems, to name a few. Finding an efficient representation for any random process leads to encapsulation of information which makes it more convenient for a practical implementations, for instance, in a computational mechanics problem. For a single-parameter process such as spatial or temporal process, the eigenvalue decomposition of the covariance matrix leads to the well-known Karhunen-Loeve (KL) decomposition. However, for multiparameter processes such as a spatio-temporal process, the covariance function itself can be defined in multiple ways. Here the process is assumed to be measured at a finite set of spatial locations and a finite number of time instants. Then the spatial covariance matrix at different time instants are considered to define the covariance of the process. This set of square, symmetric, positive semi-definite matrices is then represented as a third-order tensor. A suitable decomposition of this tensor can identify the dominant components of the process, and these components are then used to define a closed-form representation of the process. The procedure is analogous to the KL decomposition for a single-parameter process, however, the decompositions and interpretations vary significantly. The tensor decompositions are successfully applied on (i) a heat conduction problem, (ii) a vibration problem, and (iii) a covariance function taken from the literature that was fitted to model a measured wind velocity data. It is observed that the proposed representation provides an efficient approximation to some processes. Furthermore, a comparison with KL decomposition showed that the proposed method is computationally cheaper than the KL, both in terms of computer memory and execution time.

Unusual eigenvalue spectrum and relaxation in the Levy-Ornstein-Uhlenbeck process

We consider the rates of relaxation of a particle in a harmonic well, subject to Levy noise characterized by its Levy index mu. Using the propagator for this Levy-Ornstein-Uhlenbeck process (LOUP), we show that the eigenvalue spectrum of the associated Fokker-Planck operator has the form (n + m mu)nu where nu is the force constant characterizing the well, and n, m is an element of N. If mu is irrational, the eigenvalues are all nondegenerate, but rational mu can lead to degeneracy. The maximum degeneracy is shown to be 2. The left eigenfunctions of the fractional Fokker-Planck operator are very simple while the right eigenfunctions may be obtained from the lowest eigenfunction by a combination of two different step-up operators. Further, we find that the acceptable eigenfunctions should have the asymptotic behavior vertical bar x vertical bar(-n1-n2 mu) as vertical bar x vertical bar -> infinity, with n(1) and n(2) being positive integers, though this condition alone is not enough to identify them uniquely. We also assert that the rates of relaxation of LOUP are determined by the eigenvalues of the associated fractional Fokker-Planck operator and do not depend on the initial state if the moments of the initial distribution are all finite. If the initial distribution has fat tails, for which the higher moments diverge, one can have nonspectral relaxation, as pointed out by Toenjes et al. Phys. Rev. Lett. 110, 150602 (2013)].

BELIEF PROPAGATION FOR OPTIMAL EDGE COVER IN THE RANDOM COMPLETE GRAPH

We apply the objective method of Aldous to the problem of finding the minimum-cost edge cover of the complete graph with random independent and identically distributed edge costs. The limit, as the number of vertices goes to infinity, of the expected minimum cost for this problem is known via a combinatorial approach of Hessler and Wastlund. We provide a proof of this result using the machinery of the objective method and local weak convergence, which was used to prove the (2) limit of the random assignment problem. A proof via the objective method is useful because it provides us with more information on the nature of the edge's incident on a typical root in the minimum-cost edge cover. We further show that a belief propagation algorithm converges asymptotically to the optimal solution. This can be applied in a computational linguistics problem of semantic projection. The belief propagation algorithm yields a near optimal solution with lesser complexity than the known best algorithms designed for optimality in worst-case settings.

Fixed-orientation equilateral triangle matching of point sets

Given a point set P and a class C of geometric objects, G(C)(P) is a geometric graph with vertex set P such that any two vertices p and q are adjacent if and only if there is some C is an element of C containing both p and q but no other points from P. We study G(del)(P) graphs where del is the class of downward equilateral triangles (i.e., equilateral triangles with one of their sides parallel to the x-axis and the corner opposite to this side below that side). For point sets in general position, these graphs have been shown to be equivalent to half-Theta(6) graphs and TD-Delaunay graphs. The main result in our paper is that for point sets P in general position, G(del)(P) always contains a matching of size at least vertical bar P vertical bar-1/3] and this bound is tight. We also give some structural properties of G(star)(P) graphs, where is the class which contains both upward and downward equilateral triangles. We show that for point sets in general position, the block cut point graph of G(star)(P) is simply a path. Through the equivalence of G(star)(P) graphs with Theta(6) graphs, we also derive that any Theta(6) graph can have at most 5n-11 edges, for point sets in general position. (C) 2013 Elsevier B.V. All rights reserved.

On the Communication Complexity of Secret Key Generation in the Multiterminal Source Model

Communication complexity refers to the minimum rate of public communication required for generating a maximal-rate secret key (SK) in the multiterminal source model of Csiszar and Narayan. Tyagi recently characterized this communication complexity for a two-terminal system. We extend the ideas in Tyagi's work to derive a lower bound on communication complexity in the general multiterminal setting. In the important special case of the complete graph pairwise independent network (PIN) model, our bound allows us to determine the exact linear communication complexity, i.e., the communication complexity when the communication and SK are restricted to be linear functions of the randomness available at the terminals.

Faster computation of the Karhunen-Loeve expansion using its domain independence property

The goal of this work is to reduce the cost of computing the coefficients in the Karhunen-Loeve (KL) expansion. The KL expansion serves as a useful and efficient tool for discretizing second-order stochastic processes with known covariance function. Its applications in engineering mechanics include discretizing random field models for elastic moduli, fluid properties, and structural response. The main computational cost of finding the coefficients of this expansion arises from numerically solving an integral eigenvalue problem with the covariance function as the integration kernel. Mathematically this is a homogeneous Fredholm equation of second type. One widely used method for solving this integral eigenvalue problem is to use finite element (FE) bases for discretizing the eigenfunctions, followed by a Galerkin projection. This method is computationally expensive. In the current work it is first shown that the shape of the physical domain in a random field does not affect the realizations of the field estimated using KL expansion, although the individual KL terms are affected. Based on this domain independence property, a numerical integration based scheme accompanied by a modification of the domain, is proposed. In addition to presenting mathematical arguments to establish the domain independence, numerical studies are also conducted to demonstrate and test the proposed method. Numerically it is demonstrated that compared to the Galerkin method the computational speed gain in the proposed method is of three to four orders of magnitude for a two dimensional example, and of one to two orders of magnitude for a three dimensional example, while retaining the same level of accuracy. It is also shown that for separable covariance kernels a further cost reduction of three to four orders of magnitude can be achieved. Both normal and lognormal fields are considered in the numerical studies. (c) 2014 Elsevier B.V. All rights reserved.

Belief propagation for minimum weight many-to-one matchings in the random complete graph

In a complete bipartite graph with vertex sets of cardinalities n and n', assign random weights from exponential distribution with mean 1, independently to each edge. We show that, as n -> infinity, with n' = n/alpha] for any fixed alpha > 1, the minimum weight of many-to-one matchings converges to a constant (depending on alpha). Many-to-one matching arises as an optimization step in an algorithm for genome sequencing and as a measure of distance between finite sets. We prove that a belief propagation (BP) algorithm converges asymptotically to the optimal solution. We use the objective method of Aldous to prove our results. We build on previous works on minimum weight matching and minimum weight edge cover problems to extend the objective method and to further the applicability of belief propagation to random combinatorial optimization problems.

Analysis of the hierarchical structure of the B. subtilis transcriptional regulatory network

The transcriptional regulation of gene expression is orchestrated by complex networks of interacting genes. Increasing evidence indicates that these `transcriptional regulatory networks' (TRNs) in bacteria have an inherently hierarchical architecture, although the design principles and the specific advantages offered by this type of organization have not yet been fully elucidated. In this study, we focussed on the hierarchical structure of the TRN of the gram-positive bacterium Bacillus subtilis and performed a comparative analysis with the TRN of the gram-negative bacterium Escherichia coli. Using a graph-theoretic approach, we organized the transcription factors (TFs) and sigma-factors in the TRNs of B. subtilis and E. coli into three hierarchical levels (Top, Middle and Bottom) and studied several structural and functional properties across them. In addition to many similarities, we found also specific differences, explaining the majority of them with variations in the distribution of s-factors across the hierarchical levels in the two organisms. We then investigated the control of target metabolic genes by transcriptional regulators to characterize the differential regulation of three distinct metabolic subsystems (catabolism, anabolism and central energy metabolism). These results suggest that the hierarchical architecture that we observed in B. subtilis represents an effective organization of its TRN to achieve flexibility in response to a wide range of diverse stimuli.

PERCOLATION ON THE INFORMATION-THEORETICALLY SECURE SIGNAL TO INTERFERENCE RATIO GRAPH

We consider a continuum percolation model consisting of two types of nodes, namely legitimate and eavesdropper nodes, distributed according to independent Poisson point processes in R-2 of intensities lambda and lambda(E), respectively. A directed edge from one legitimate node A to another legitimate node B exists provided that the strength of the signal transmitted from node A that is received at node B is higher than that received at any eavesdropper node. The strength of the signal received at a node from a legitimate node depends not only on the distance between these nodes, but also on the location of the other legitimate nodes and an interference suppression parameter gamma. The graph is said to percolate when there exists an infinitely connected component. We show that for any finite intensity lambda(E) of eavesdropper nodes, there exists a critical intensity lambda(c) < infinity such that for all lambda > lambda(c) the graph percolates for sufficiently small values of the interference parameter. Furthermore, for the subcritical regime, we show that there exists a lambda(0) such that for all lambda < lambda(0) <= lambda(c) a suitable graph defined over eavesdropper node connections percolates that precludes percolation in the graphs formed by the legitimate nodes.