An efficient hybrid approach for design of automotive wheel bearings

Wheel bearings play a crucial role in the mobility of a vehicle by minimizing motive power loss and providing stability in cornering maneuvers. Detailed engineering analysis of a wheel bearing subsystem under dynamic conditions poses enormous challenges due to the nonlinearity of the problem caused by multiple factional contacts between rotating and stationary parts and difficulties in prediction of dynamic loads that wheels are subject to. Commonly used design methodologies are based on equivalent static analysis of ball or roller bearings in which the latter elements may even be represented with springs. In the present study, an advanced hybrid approach is suggested for realistic dynamic analysis of wheel bearings by combining lumped parameter and finite element modeling techniques. A validated lumped parameter representation serves as an efficient tool for the prediction of radial wheel load due to ground reaction which is then used in detailed finite element analysis that automatically accounts for contact forces in an explicit formulation.

Spatial Wavelet Approach to Local Matrix Crack Detection in Composite Beams with Ply Level Material Uncertainty

Wavelet coefficients based on spatial wavelets are used as damage indicators to identify the damage location as well as the size of the damage in a laminated composite beam with localized matrix cracks. A finite element model of the composite beam is used in conjunction with a matrix crack based damage model to simulate the damaged composite beam structure. The modes of vibration of the beam are analyzed using the wavelet transform in order to identify the location and the extent of the damage by sensing the local perturbations at the damage locations. The location of the damage is identified by a sudden change in spatial distribution of wavelet coefficients. Monte Carlo Simulations (MCS) are used to investigate the effect of ply level uncertainty in composite material properties such as ply longitudinal stiffness, transverse stiffness, shear modulus and Poisson's ratio on damage detection parameter, wavelet coefficient. In this study, numerical simulations are done for single and multiple damage cases. It is observed that spatial wavelets can be used as a reliable damage detection tool for composite beams with localized matrix cracks which can result from low velocity impact damage.

A Markov Decision Theoretic Approach to Pilot Allocation and Receive Antenna Selection

This paper considers antenna selection (AS) at a receiver equipped with multiple antenna elements but only a single radio frequency chain for packet reception. As information about the channel state is acquired using training symbols (pilots), the receiver makes its AS decisions based on noisy channel estimates. Additional information that can be exploited for AS includes the time-correlation of the wireless channel and the results of the link-layer error checks upon receiving the data packets. In this scenario, the task of the receiver is to sequentially select (a) the pilot symbol allocation, i.e., how to distribute the available pilot symbols among the antenna elements, for channel estimation on each of the receive antennas; and (b) the antenna to be used for data packet reception. The goal is to maximize the expected throughput, based on the past history of allocation and selection decisions, and the corresponding noisy channel estimates and error check results. Since the channel state is only partially observed through the noisy pilots and the error checks, the joint problem of pilot allocation and AS is modeled as a partially observed Markov decision process (POMDP). The solution to the POMDP yields the policy that maximizes the long-term expected throughput. Using the Finite State Markov Chain (FSMC) model for the wireless channel, the performance of the POMDP solution is compared with that of other existing schemes, and it is illustrated through numerical evaluation that the POMDP solution significantly outperforms them.

An automated approach to network features of protein structure ensembles

Network theory applied to protein structures provides insights into numerous problems of biological relevance. The explosion in structural data available from PDB and simulations establishes a need to introduce a standalone-efficient program that assembles network concepts/parameters under one hood in an automated manner. Herein, we discuss the development/application of an exhaustive, user-friendly, standalone program package named PSN-Ensemble, which can handle structural ensembles generated through molecular dynamics (MD) simulation/NMR studies or from multiple X-ray structures. The novelty in network construction lies in the explicit consideration of side-chain interactions among amino acids. The program evaluates network parameters dealing with topological organization and long-range allosteric communication. The introduction of a flexible weighing scheme in terms of residue pairwise cross-correlation/interaction energy in PSN-Ensemble brings in dynamical/chemical knowledge into the network representation. Also, the results are mapped on a graphical display of the structure, allowing an easy access of network analysis to a general biological community. The potential of PSN-Ensemble toward examining structural ensemble is exemplified using MD trajectories of an ubiquitin-conjugating enzyme (UbcH5b). Furthermore, insights derived from network parameters evaluated using PSN-Ensemble for single-static structures of active/inactive states of 2-adrenergic receptor and the ternary tRNA complexes of tyrosyl tRNA synthetases (from organisms across kingdoms) are discussed. PSN-Ensemble is freely available from http://vishgraph.mbu.iisc.ernet.in/PSN-Ensemble/psn_index.html.

On the feasibility of network alignment for three-source three-destination Multiple Unicast networks with delays

A transform approach to network coding was in-troduced by Bavirisetti et al. (arXiv:1103.3882v3 [cs.IT]) as a tool to view wireline networks with delays as k-instantaneous networks (for some large k). When the local encoding kernels (LEKs) of the network are varied with every time block of length k >1, the network is said to use block time varying LEKs. In this work, we propose a Precoding Based Network Alignment (PBNA) scheme based on transform approach and block time varying LEKs for three-source three-destination multiple unicast network with delays (3-S3-D MUN-D). In a recent work, Menget al. (arXiv:1202.3405v1 [cs.IT]) reduced the infinite set of sufficient conditions for feasibility of PBNA in a three-source three-destination instantaneous multiple unicast network as given by Das et al. (arXiv:1008.0235v1 [cs.IT]) to a finite set and also showed that the conditions are necessary. We show that the conditions of Meng et al. are also necessary and sufficient conditions for feasibility of PBNA based on transform approach and block time varying LEKs for 3-S3-D MUN-D.

Nucleation of a Stable Solid from Melt in the Presence of Multiple Metastable Intermediate Phases: Wetting, Ostwald's Step Rule, and Vanishing Polymorphs

In many systems, nucleation of a stable solid may occur in the presence of other (often more than one) metastable phases. These may be polymorphic solids or even liquid phases. Sometimes, the metastable phase might have a lower free energy minimum than the liquid but higher than the stable-solid-phase minimum and have characteristics in between the parent liquid and the globally stable solid phase. In such cases, nucleation of the solid phase from the melt may be facilitated by the metastable phase because the latter can ``wet'' the interface between the parent and the daughter phases, even though there may be no signature of the existence of metastable phase in the thermodynamic properties of the parent liquid and the stable solid phase. Straightforward application of classical nucleation theory (CNT) is flawed here as it overestimates the nucleation barrier because surface tension is overestimated (by neglecting the metastable phases of intermediate order) while the thermodynamic free energy gap between daughter and parent phases remains unchanged. In this work, we discuss a density functional theory (DFT)-based statistical mechanical approach to explore and quantify such facilitation. We construct a simple order-parameter-dependent free energy surface that we then use in DFT to calculate (i) the order parameter profile, (ii) the overall nucleation free energy barrier, and (iii) the surface tension between the parent liquid and the metastable solid and also parent liquid and stable solid phases. The theory indeed finds that the nucleation free energy barrier can decrease significantly in the presence of wetting. This approach can provide a microscopic explanation of the Ostwald step rule and the well-known phenomenon of ``disappearing polymorphs'' that depends on temperature and other thermodynamic conditions. Theory reveals a diverse scenario for phase transformation kinetics, some of which may be explored via modem nanoscopic synthetic methods.

A transform approach to linear network coding for acyclic networks with delay

The algebraic formulation for linear network coding in acyclic networks with each link having an integer delay is well known. Based on this formulation, for a given set of connections over an arbitrary acyclic network with integer delay assumed for the links, the output symbols at the sink nodes at any given time instant is a Fq-linear combination of the input symbols across different generations, where Fq denotes the field over which the network operates. We use finite-field discrete Fourier transform (DFT) to convert the output symbols at the sink nodes at any given time instant into a Fq-linear combination of the input symbols generated during the same generation. We call this as transforming the acyclic network with delay into n-instantaneous networks (n is sufficiently large). We show that under certain conditions, there exists a network code satisfying sink demands in the usual (non-transform) approach if and only if there exists a network code satisfying sink demands in the transform approach. Furthermore, assuming time invariant local encoding kernels, we show that the transform method can be employed to achieve half the rate corresponding to the individual source-destination mincut (which are assumed to be equal to 1) for some classes of three-source three-destination multiple unicast network with delays using alignment strategies when the zero-interference condition is not satisfied.

Network, nodes and nexus: systems approach to multitarget therapeutics

Systems biology is revealing multiple layers of regulatory networks that manifest spatiotemporal variations. Since genes and environment also influence the emergent property of a cell, the biological output requires dynamic understanding of various molecular circuitries. The metabolic networks continually adapt and evolve to cope with the changing milieu of the system, which could also include infection by another organism. Such perturbations of the functional networks can result in disease phenotypes, for instance tuberculosis and cancer. In order to develop effective therapeutics, it is important to determine the disease progression profiles of complex disorders that can reveal dynamic aspects and to develop mutitarget systemic therapies that can help overcome pathway adaptations and redundancy.

A multi-level multi-scale approach to study essential genes in Mycobacterium tuberculosis

Background: The set of indispensable genes that are required by an organism to grow and sustain life are termed as essential genes. There is a strong interest in identification of the set of essential genes, particularly in pathogens, not only for a better understanding of the pathogen biology, but also for identifying drug targets and the minimal gene set for the organism. Essentiality is inherently a systems property and requires consideration of the system as a whole for their identification. The available experimental approaches capture some aspects but each method comes with its own limitations. Moreover, they do not explain the basis for essentiality in most cases. A powerful prediction method to recognize this gene pool including rationalization of the known essential genes in a given organism would be very useful. Here we describe a multi-level multi-scale approach to identify the essential gene pool in a deadly pathogen, Mycobacterium tuberculosis. Results: The multi-level workflow analyses the bacterial cell by studying (a) genome-wide gene expression profiles to identify the set of genes which show consistent and significant levels of expression in multiple samples of the same condition, (b) indispensability for growth by using gene expression integrated flux balance analysis of a genome-scale metabolic model, (c) importance for maintaining the integrity and flow in a protein-protein interaction network and (d) evolutionary conservation in a set of genomes of the same ecological niche. In the gene pool identified, the functional basis for essentiality has been addressed by studying residue level conservation and the sub-structure at the ligand binding pockets, from which essential amino acid residues in that pocket have also been identified. 283 genes were identified as essential genes with high-confidence. An agreement of about 73.5% is observed with that obtained from the experimental transposon mutagenesis technique. A large proportion of the identified genes belong to the class of intermediary metabolism and respiration. Conclusions: The multi-scale, multi-level approach described can be generally applied to other pathogens as well. The essential gene pool identified form a basis for designing experiments to probe their finer functional roles and also serve as a ready shortlist for identifying drug targets.

mulPBA: an efficient multiple protein structure alignment method based on a structural alphabet

The increasing number of available protein structures requires efficient tools for multiple structure comparison. Indeed, multiple structural alignments are essential for the analysis of function, evolution and architecture of protein structures. For this purpose, we proposed a new web server called multiple Protein Block Alignment (mulPBA). This server implements a method based on a structural alphabet to describe the backbone conformation of a protein chain in terms of dihedral angles. This sequence-like' representation enables the use of powerful sequence alignment methods for primary structure comparison, followed by an iterative refinement of the structural superposition. This approach yields alignments superior to most of the rigid-body alignment methods and highly comparable with the flexible structure comparison approaches. We implement this method in a web server designed to do multiple structure superimpositions from a set of structures given by the user. Outputs are given as both sequence alignment and superposed 3D structures visualized directly by static images generated by PyMol or through a Jmol applet allowing dynamic interaction. Multiple global quality measures are given. Relatedness between structures is indicated by a distance dendogram. Superimposed structures in PDB format can be also downloaded, and the results are quickly obtained. mulPBA server can be accessed at www.dsimb.inserm.fr/dsimb_tools/mulpba/.

A Diffusion-Based Processor Reallocation Strategy for Tracking Multiple Dynamically Varying Weather Phenomena

Many meteorological phenomena occur at different locations simultaneously. These phenomena vary temporally and spatially. It is essential to track these multiple phenomena for accurate weather prediction. Efficient analysis require high-resolution simulations which can be conducted by introducing finer resolution nested simulations, nests at the locations of these phenomena. Simultaneous tracking of these multiple weather phenomena requires simultaneous execution of the nests on different subsets of the maximum number of processors for the main weather simulation. Dynamic variation in the number of these nests require efficient processor reallocation strategies. In this paper, we have developed strategies for efficient partitioning and repartitioning of the nests among the processors. As a case study, we consider an application of tracking multiple organized cloud clusters in tropical weather systems. We first present a parallel data analysis algorithm to detect such clouds. We have developed a tree-based hierarchical diffusion method which reallocates processors for the nests such that the redistribution cost is less. We achieve this by a novel tree reorganization approach. We show that our approach exhibits up to 25% lower redistribution cost and 53% lesser hop-bytes than the processor reallocation strategy that does not consider the existing processor allocation.

Study on ride comfort assessment of multiple occupants using lumped parameter analysis

Growing consumer expectations continue to fuel further advancements in vehicle ride comfort analysis including development of a comprehensive tool capable of aiding the understanding of ride comfort. To date, most of the work on biodynamic responses of human body in the context of ride comfort mainly concentrates on driver or a designated occupant and therefore leaves the scope for further work on ride comfort analysis covering a larger number of occupants with detailed modeling of their body segments. In the present study, governing equations of a 13-DOF (degrees-of-freedom) lumped parameter model (LPM) of a full car with seats (7-DOF without seats) and a 7-DOF occupant model, a linear version of an earlier non-linear occupant model, are presented. One or more occupant models can be coupled with the vehicle model resulting into a maximum of 48-DOF LPM for a car with five occupants. These multi-occupant models can be formulated in a modular manner and solved efficiently using MATLAB/SIMULINK for a given transient road input. The vehicle model and the occupant model are independently verified by favorably comparing computed dynamic responses with published data. A number of cases with different dispositions of occupants in a small car are analyzed using the current modular approach thereby underscoring its potential for efficient ride quality assessment and design of suspension systems.

Analytical Determination of Residual Strength and Linkup Strength for Flat Panels, with Multiple Site Damage

The problem of multiple site damage in aged airplane fuselage is handled in this paper. The analytical and numerical procedures used for the estimation of the strength of a flat panel with such multi-site damage are presented. Further, numerical results are presented on the residual strength of the panel using fracture mechanics-based approach and the stress levels when the leading crack is likely to link up with multiple site damage cracks. The presence of multiple site damage cracks in the vicinity of leading crack significantly decreases the residual strength of the panel. The model is verified using experimental data from the open literature and the predictions are in good agreement with the measured residual strength.

A Committee Machine Approach for Compressed Sensing Signal Reconstruction

Although many sparse recovery algorithms have been proposed recently in compressed sensing (CS), it is well known that the performance of any sparse recovery algorithm depends on many parameters like dimension of the sparse signal, level of sparsity, and measurement noise power. It has been observed that a satisfactory performance of the sparse recovery algorithms requires a minimum number of measurements. This minimum number is different for different algorithms. In many applications, the number of measurements is unlikely to meet this requirement and any scheme to improve performance with fewer measurements is of significant interest in CS. Empirically, it has also been observed that the performance of the sparse recovery algorithms also depends on the underlying statistical distribution of the nonzero elements of the signal, which may not be known a priori in practice. Interestingly, it can be observed that the performance degradation of the sparse recovery algorithms in these cases does not always imply a complete failure. In this paper, we study this scenario and show that by fusing the estimates of multiple sparse recovery algorithms, which work with different principles, we can improve the sparse signal recovery. We present the theoretical analysis to derive sufficient conditions for performance improvement of the proposed schemes. We demonstrate the advantage of the proposed methods through numerical simulations for both synthetic and real signals.

Analysis of composite single lap joints using numerical and experimental approach

Adhesives are widely used to execute the assembly of aerospace and automotive structures due to their ability to join dissimilar materials, reduced stress concentration, and improved fatigue resistance. The mechanical behavior of adhesive joints can be studied either using analytical models or by conducting mechanical tests. However, the complexity owing to multiple interfaces, layers with different properties, material and geometric nonlinearity and its three-dimensional nature combine to increase the difficulty in obtaining an overall system of governing equations to predict the joint behavior. On the other hand, experiments are often time consuming and expensive due to a number of parameters involved. Finite element analysis (FEA) is profoundly used in recent years to overcome these limitations. The work presented in this paper involves the finite element modeling and analysis of a composite single lap joint where the adhesive-adherend interface region was modeled using connector elements. The computed stresses were compared with the experimental stresses obtained using digital image correlation technique. The results showed an agreement. Further, the failure load predicted using FEA was found to be closer to the actual failure load obtained by mechanical tests.