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.

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.

Explicit codes uniformly reducing repair bandwidth in distributed storage

A distributed storage setting is considered where a file of size B is to be stored across n storage nodes. A data collector should be able to reconstruct the entire data by downloading the symbols stored in any k nodes. When a node fails, it is replaced by a new node by downloading data from some of the existing nodes. The amount of download is termed as repair bandwidth. One way to implement such a system is to store one fragment of an (n, k) MDS code in each node, in which case the repair bandwidth is B. Since repair of a failed node consumes network bandwidth, codes reducing repair bandwidth are of great interest. Most of the recent work in this area focuses on reducing the repair bandwidth of a set of k nodes which store the data in uncoded form, while the reduction in the repair bandwidth of the remaining nodes is only marginal. In this paper, we present an explicit code which reduces the repair bandwidth for all the nodes to approximately B/2. To the best of our knowledge, this is the first explicit code which reduces the repair bandwidth of all the nodes for all feasible values of the system parameters.

Explicit codes minimizing repair bandwidth for distributed storage

We consider the problem of minimizing the bandwidth required to repair a failed node when data is stored across n nodes in a distributed manner, so as to facilitate reconstruction of the entire data by connecting to any k out of the n nodes. We provide explicit and optimal constructions which permit exact replication of a failed systematic node.

On the explicit determination of the polar decomposition in n-dimensional vector spaces

A method for the explicit determination of the polar decomposition (and the related problem of finding tensor square roots) when the underlying vector space dimension n is arbitrary (but finite), is proposed. The method uses the spectral resolution, and avoids the determination of eigenvectors when the tensor is invertible. For any given dimension n, an appropriately constructed van der Monde matrix is shown to play a key role in the construction of each of the component matrices (and their inverses) in the polar decomposition.

On the criteria for reverse transition in a two-dimensional boundary layer flow

Experiments on reverse transition were conducted in two-dimensional accelerated incompressible turbulent boundary layers. Mean velocity profiles, longitudinal velocity fluctuations $\tilde{u}^{\prime}(=(\overline{u^{\prime 2}})^{\frac{1}{2}})$ and the wall-shearing stress (TW) were measured. The mean velocity profiles show that the wall region adjusts itself to laminar conditions earlier than the outer region. During the reverse transition process, increases in the shape parameter (H) are accompanied by a decrease in the skin friction coefficient (Cf). Profiles of turbulent intensity (u’2) exhibit near similarity in the turbulence decay region. The breakdown of the law of the wall is characterized by the parameter \[ \Delta_p (=\nu[dP/dx]/\rho U^{*3}) = - 0.02, \] where U* is the friction velocity. Downstream of this region the decay of $\tilde{u}^{\prime}$ fluctuations occurred when the momentum thickness Reynolds number (R) decreased roughly below 400.

Explicit Codes Uniformly Reducing Repair Bandwidth in Distributed Storage

A distributed storage setting is considered where a file of size B is to be stored across n storage nodes. A data collector should be able to reconstruct the entire data by downloading the symbols stored in any k nodes. When a node fails, it is replaced by a new node by downloading data from some of the existing nodes. The amount of download is termed as repair bandwidth. One way to implement such a system is to store one fragment of an (n, k) MDS code in each node, in which case the repair bandwidth is B. Since repair of a failed node consumes network bandwidth, codes reducing repair bandwidth are of great interest. Most of the recent work in this area focuses on reducing the repair bandwidth of a set of k nodes which store the data in uncoded form, while the reduction in the repair bandwidth of the remaining nodes is only marginal. In this paper, we present an explicit code which reduces the repair bandwidth for all the nodes to approximately B/2. To the best of our knowledge, this is the first explicit code which reduces the repair bandwidth of all the nodes for all feasible values of the system parameters.

Explicit and Optimal Codes for Distributed Storage

In the distributed storage coding problem we consider, data is stored across n nodes in a network, each capable of storing � symbols. It is required that the complete data can be reconstructed by downloading data from any k nodes. There is also the key additional requirement that a failed node be regenerated by connecting to any d nodes and downloading �symbols from each of them. Our goal is to minimize the repair bandwidth d�. In this paper we provide explicit constructions for several parameter sets of interest.

Analytical solutions for protective filters based on soil-retention and permeability criteria with respect to the phenomenon of soil boiling

For the successful performance of a granular filter medium, existing design guidelines, which are based on the particle size distribution (PSD) characteristics of the base soil and filter medium, require two contradictory conditions to be satisfied, viz., soil retention and permeability. In spite of the wider applicability of these guidelines, it is well recognized that (i) they are applicable to a particular range of soils tested in the laboratory, (ii) the design procedures do not include performance-based selection criteria, and (iii) there are no means to establish the sensitivity of the important variables influencing performance. In the present work, analytical solutions are developed to obtain a factor of safety with respect to soil-retention and permeability criteria for a base soil - filter medium system subjected to a soil boiling condition. The proposed analytical solutions take into consideration relevant geotechnical properties such as void ratio, permeability, dry unit weight, effective friction angle, shape and size of soil particles, seepage discharge, and existing hydraulic gradient. The solution is validated through example applications and experimental results, and it is established that it can be used successfully in the selection as well as design of granular filters and can be applied to all types of base soils.

Explicit filtering LES for turbulent non-premixed combustion

Two models for large eddy simulation of turbulent reacting flow in homogeneous turbulence were studied. The sub-grid stress arising out of non-linearities of the Navier-Stokes equations were modeled using an explicit filtering approach. A filtered mass density function (FMDF) approach was used for closure of the sub-grid scalar fluctuations. A posteriori calculations, when compared with the results from the direct numerical simulation, indicate that the explicit filtering is adequate in representing the effect of sub-grid stress on the filtered velocity field in the absence of reaction. Discrepancies arise when reactions occur, but the FMDF approach suffices to account for sub-grid scale fluctuations of the reacting scalars, accurately.

A Hybrid Energy-insensitive Explicit Guidance Scheme for Long Range Flight Vehicles with Solid Motors

Combining the newly developed nonlinear model predictive static programming technique with null range direction concept, a novel explicit energy-insensitive guidance design method is presented in this paper for long range flight vehicles, which leads to a closed form solution of the necessary guidance command update. Owing to the closed form nature, it does not lead to computational difficulties and the proposed optimal guidance algorithm can be implemented online. The guidance law is verified in a solid motor propelled long range flight vehicle, for which coming up with an effective guidance law is more difficult as compared to a liquid engine propelled vehicle (mainly because of the absence of thrust cutoff facility). Assuming the starting point of the second stage to be a deterministic point beyond the atmosphere, the scheme guides the vehicle properly so that it completes the mission within a tight error bound. The simulation results demonstrate its ability to intercept the target, even with an uncertainty of greater than 10% in burnout time.

A family of Runge-Kutta based explicit methods for rotational dynamics

The present paper develops a family of explicit algorithms for rotational dynamics and presents their comparison with several existing methods. For rotational motion the configuration space is a non-linear manifold, not a Euclidean vector space. As a consequence the rotation vector and its time derivatives correspond to different tangent spaces of rotation manifold at different time instants. This renders the usual integration algorithms for Euclidean space inapplicable for rotation. In the present algorithms this problem is circumvented by relating the equation of motion to a particular tangent space. It has been accomplished with the help of already existing relation between rotation increments which belongs to two different tangent spaces. The suggested method could in principle make any integration algorithm on Euclidean space, applicable to rotation. However, the present paper is restricted only within explicit Runge-Kutta enabled to handle rotation. The algorithms developed here are explicit and hence computationally cheaper than implicit methods. Moreover, they appear to have much higher local accuracy and hence accurate in predicting any constants of motion for reasonably longer time. The numerical results for solutions as well as constants of motion, indicate superior performance by most of our algorithms, when compared to some of the currently known algorithms, namely ALGO-C1, STW, LIEMID[EA], MCG, SUBCYC-M.