Minimum weight design of fiber-reinforced laminated composite structures with maximum stress and Tsai-Wu failure criteria

In this article, a minimum weight design of carbon/epoxy laminates is carried out using genetic algorithms. New failure envelopes have been developed by the combination of two commonly used phenomenological failure criteria, namely Maximum Stress (MS) and Tsai-Wu (TW) are used to obtain the minimum weight of the laminate. These failure envelopes are the most conservative failure envelope (MCFE) and the least conservative failure envelope (LCFE). Uniaxial and biaxial loading conditions are considered for the study and the differences in the optimal weight of the laminate are compared for the MCFE and LCFE. The MCFE can be used for design of critical load-carrying composites, while the LCFE could be used for the design of composite structures where weight reduction is much more important than safety such as unmanned air vehicles.

New Approximation Algorithms for Minimum Cycle Bases of Graphs

We consider the problem of computing an approximate minimum cycle basis of an undirected non-negative edge-weighted graph G with m edges and n vertices; the extension to directed graphs is also discussed. In this problem, a {0,1} incidence vector is associated with each cycle and the vector space over F-2 generated by these vectors is the cycle space of G. A set of cycles is called a cycle basis of G if it forms a basis for its cycle space. A cycle basis where the sum of the weights of the cycles is minimum is called a minimum cycle basis of G. Cycle bases of low weight are useful in a number of contexts, e.g. the analysis of electrical networks, structural engineering, chemistry, and surface reconstruction. Although in most such applications any cycle basis can be used, a low weight cycle basis often translates to better performance and/or numerical stability. Despite the fact that the problem can be solved exactly in polynomial time, we design approximation algorithms since the performance of the exact algorithms may be too expensive for some practical applications. We present two new algorithms to compute an approximate minimum cycle basis. For any integer k >= 1, we give (2k - 1)-approximation algorithms with expected running time O(kmn(1+2/k) + mn((1+1/k)(omega-1))) and deterministic running time O(n(3+2/k) ), respectively. Here omega is the best exponent of matrix multiplication. It is presently known that omega < 2.376. Both algorithms are o(m(omega)) for dense graphs. This is the first time that any algorithm which computes sparse cycle bases with a guarantee drops below the Theta(m(omega) ) bound. We also present a 2-approximation algorithm with expected running time O(M-omega root n log n), a linear time 2-approximation algorithm for planar graphs and an O(n(3)) time 2.42-approximation algorithm for the complete Euclidean graph in the plane.

Length-scale-dependent ensemble-averaged conductance of a 1D disordered conductor: Conductance minimum

An exact numerical calculation of ensemble-averaged length-scale-dependent conductance for the one-dimensional Anderson model is shown to support an earlier conjecture for a conductance minimum. The numerical results can be understood in terms of the Thouless expression for the conductance and the Wigner level-spacing statistics.

On Computation of Minimum Distance of Linear Block Codes Above 1/2 Rate Coding

The minimum distance of linear block codes is one of the important parameter that indicates the error performance of the code. When the code rate is less than 1/2, efficient algorithms are available for finding minimum distance using the concept of information sets. When the code rate is greater than 1/2, only one information set is available and efficiency suffers. In this paper, we investigate and propose a novel algorithm to find the minimum distance of linear block codes with the code rate greater than 1/2. We propose to reverse the roles of information set and parity set to get virtually another information set to improve the efficiency. This method is 67.7 times faster than the minimum distance algorithm implemented in MAGMA Computational Algebra System for a (80, 45) linear block code.

Explicit and Optimal Exact-Regenerating Codes for the Minimum-Bandwidth Point in Distributed Storage

In the distributed storage setting that we consider, data is stored across n nodes in the network such that the data can be recovered by connecting to any subset of k nodes. Additionally, one can repair a failed node by connecting to any d nodes while downloading beta units of data from each. Dimakis et al. show that the repair bandwidth d beta can be considerably reduced if each node stores slightly more than the minimum required and characterize the tradeoff between the amount of storage per node and the repair bandwidth. In the exact regeneration variation, unlike the functional regeneration, the replacement for a failed node is required to store data identical to that in the failed node. This greatly reduces the complexity of system maintenance. The main result of this paper is an explicit construction of codes for all values of the system parameters at one of the two most important and extreme points of the tradeoff - the Minimum Bandwidth Regenerating point, which performs optimal exact regeneration of any failed node. A second result is a non-existence proof showing that with one possible exception, no other point on the tradeoff can be achieved for exact regeneration.

Finite data performance of MUSIC and minimum norm methods

In the direction of arrival (DOA) estimation problem, we encounter both finite data and insufficient knowledge of array characterization. It is therefore important to study how subspace-based methods perform in such conditions. We analyze the finite data performance of the multiple signal classification (MUSIC) and minimum norm (min. norm) methods in the presence of sensor gain and phase errors, and derive expressions for the mean square error (MSE) in the DOA estimates. These expressions are first derived assuming an arbitrary array and then simplified for the special case of an uniform linear array with isotropic sensors. When they are further simplified for the case of finite data only and sensor errors only, they reduce to the recent results given in [9-12]. Computer simulations are used to verify the closeness between the predicted and simulated values of the MSE.

Identification of Local Conformational Similarity in Structurally Variable Regions of Homologous Proteins Using Protein Blocks

Structure comparison tools can be used to align related protein structures to identify structurally conserved and variable regions and to infer functional and evolutionary relationships. While the conserved regions often superimpose well, the variable regions appear non superimposable. Differences in homologous protein structures are thought to be due to evolutionary plasticity to accommodate diverged sequences during evolution. One of the kinds of differences between 3-D structures of homologous proteins is rigid body displacement. A glaring example is not well superimposed equivalent regions of homologous proteins corresponding to a-helical conformation with different spatial orientations. In a rigid body superimposition, these regions would appear variable although they may contain local similarity. Also, due to high spatial deviation in the variable region, one-to-one correspondence at the residue level cannot be determined accurately. Another kind of difference is conformational variability and the most common example is topologically equivalent loops of two homologues but with different conformations. In the current study, we present a refined view of the ``structurally variable'' regions which may contain local similarity obscured in global alignment of homologous protein structures. As structural alphabet is able to describe local structures of proteins precisely through Protein Blocks approach, conformational similarity has been identified in a substantial number of `variable' regions in a large data set of protein structural alignments; optimal residue-residue equivalences could be achieved on the basis of Protein Blocks which led to improved local alignments. Also, through an example, we have demonstrated how the additional information on local backbone structures through protein blocks can aid in comparative modeling of a loop region. In addition, understanding on sequence-structure relationships can be enhanced through our approach. This has been illustrated through examples where the equivalent regions in homologous protein structures share sequence similarity to varied extent but do not preserve local structure.

Characterization of aerosol black carbon over a tropical semi-arid region of Anantapur, India

Black carbon (BC) aerosol mass concentrations measured using an aethalometer at Anantapur, a semi-arid tropical station in the southern part of peninsular India, from August 2006 to July 2007 are analyzed. Seasonal and diurnal variations of BC in relation to changes in the regional meteorological conditions have been studied along with the mass fraction of BC to the total aerosol mass concentration (M-t) and fine particle mass (FPM) concentration in different months. The data collected during the study period shows that the annual average BC mass concentration at Anantapur is 1.97 +/- 0.12 mu g m(-3). Seasonal variations of BC aerosol mass concentration showed high during the dry (winter and summer) seasons and low during the post-monsoon followed by the monsoon seasons. Diurnal variations of BC aerosols attain a gradual build up in BC concentration from morning and a sharp peak occurs between 07:00 and 09:00 h almost an hour after local sunrise and a broad nocturnal peak from 19:00 to 21:00 h with a minimum in noon hours. The ratio of BC to the fine particle mass concentration was high during the dry season and low during the monsoon season. The regression analysis between BC mass concentration and wind speed indicates that, with increase in wind speeds the BC mass concentrations would decrease and vice-versa. Aerosol BC mass concentration shows a significant positive correlation with total mass concentration (M-t) and aerosol optical depth (ACID, tau(p)) at 500 nm. (C) 2010 Elsevier B.V. All rights reserved.

Anomalous X-ray scattering study of local structures in the superionic conducting class (CuI)(0.3)(Cu2O)(0.35)(MoO3)(0.35)

The anomalous X-ray scattering (AXS) method using Cu and Mo K absorption edges has been employed for obtaining the local structural information of superionic conducting glass having the composition (CuI)(0.3)(Cu2O)(0.35)(MoO3)(0.35). The possible atomic arrangements in near-neighbor region of this glass were estimated by coupling the results with the least-squares analysis so as to reproduce two differential intensity profiles for Cu and Mo as well as the ordinary scattering profile. The coordination number of oxygen around Mo is found to be 6.1 at the distance of 0.187 nm. This implies that the MoO6 octahedral unit is a more probable structural entity in the glass rather than MoO4 tetrahedra which has been proposed based on infrared spectroscopy. The pre-peak shoulder observed at about 10 nm(-1) may be attributed to density fluctuation originating from the MoO6 octahedral units connected with the corner sharing linkage, in which the correlation length is about 0.8 nm. The value of the coordination number of I- around Cu+ is estimated as 4.3 at 0.261 nm, suggesting an arrangement similar to that in molten CuI.

Local polynomial convexity of the union of two totally-real surfaces at their intersection

We consider the following question: Let S (1) and S (2) be two smooth, totally-real surfaces in C-2 that contain the origin. If the union of their tangent planes is locally polynomially convex at the origin, then is S-1 boolean OR S-2 locally polynomially convex at the origin? If T (0) S (1) a (c) T (0) S (2) = {0}, then it is a folk result that the answer is yes. We discuss an obstruction to the presumed proof, and provide a different approach. When dim(R)(T0S1 boolean AND T0S2) = 1, we present a geometric condition under which no consistent answer to the above question exists. We then discuss conditions under which we can expect local polynomial convexity.

Time scales for transitions between free-energy minima of a dense hard-sphere system

Time scales associated with activated transitions between glassy metastable states of a free-energy functional appropriate for a dense hard-sphere system are calculated by using a new Monte Carlo method for the local density variables. In particular, we calculate the time the system, initially placed in a shallow glassy minimum of the free-energy, spends in the neighborhood of this minimum before making a transition to the basin of attraction of another free-energy minimum. This time scale is found to increase as the average density is increased. We find a crossover density near which this time scale increases very sharply and becomes longer than the longest times accessible in our simulation. This time scale does not show any evidence of increasing with sample size

Sensitivity Enhancement in Solid-State Separated Local Field NMR Experiments by the Use of Adiabatic Cross-Polarization

Measurement of dipolar couplings using separated local field (SLF) NMR experiment is a powerful tool for structural and dynamics studies of oriented molecules such as liquid crystals and membrane proteins in aligned lipid bilayers. Enhancing the sensitivity of such SLF techniques is of significant importance in present-day solid-state NMR methodology. The present study considers the use of adiabatic cross-polarization for this purpose, which is applied for the first time to one of the well-known SLF techniques, namely, polarization inversion spin exchange at the magic angle (PISEMA). The experiments have been carried out on a single crystal of a model peptide, and a dramatic enhancement in signal-to-noise up to 90% has been demonstrated.

RS and GIS in mapping of geomorphic records and understanding the local controls of glacial retreat from the Baspa Valley, Himachal Pradesh, India

We report here the role of remote sensing (RS) and geographical information system (GIS) in the identification of geomorphic records and understanding of the local controls on the retreat of glaciers of the Baspa Valley, Himachal Pradesh, India. The geomorphic records mapped are accumulation zone, exposed ablation zone, moraine-covered ablation zone, snout, deglaciated valley, lateral moraine, medial moraine, terminal moraine and hanging glacier. Details of these features and stages of deglaciation have been extracted from RS data and mapped in a GIS environment. Glacial geomorphic data have been generated for 22 glaciers of the Baspa Valley. The retreat of glaciers has been estimated using the glacial maxima observed on satellite images. On the basis of percentage of retreat and the critical analysis of glacial geomorphic data for 22 glaciers of the Baspa Valley, they are classified into seven categories of very low to very very high retreat. From the analysis of the above 22 glaciers, it has been found that other than global warming, the retreat of glaciers of the Baspa Valley is inversely proportional to the size of the accumulation zone and the ratio of the moraine covered ablation/exposed ablation zone.