3,375 research outputs found
Probabilistic sizing of laminates with uncertainties
A reliability based design methodology for laminate sizing and configuration for a special case of composite structures is described. The methodology combines probabilistic composite mechanics with probabilistic structural analysis. The uncertainties of constituent materials (fiber and matrix) to predict macroscopic behavior are simulated using probabilistic theory. Uncertainties in the degradation of composite material properties are included in this design methodology. A multi-factor interaction equation is used to evaluate load and environment dependent degradation of the composite material properties at the micromechanics level. The methodology is integrated into a computer code IPACS (Integrated Probabilistic Assessment of Composite Structures). Versatility of this design approach is demonstrated by performing a multi-level probabilistic analysis to size the laminates for design structural reliability of random type structures. The results show that laminate configurations can be selected to improve the structural reliability from three failures in 1000, to no failures in one million. Results also show that the laminates with the highest reliability are the least sensitive to the loading conditions
Some Basic Issues and Applications of Switch-Mode Rectifiers on Motor Drives and Electric Vehicle Chargers
Distance-two labelings of digraphs
For positive integers , an -labeling of a digraph is a
function from into the set of nonnegative integers such that
if is adjacent to in and if
is of distant two to in . Elements of the image of are called
labels. The -labeling problem is to determine the
-number of a digraph , which
is the minimum of the maximum label used in an -labeling of . This
paper studies - numbers of digraphs. In particular, we
determine - numbers of digraphs whose longest dipath is of
length at most 2, and -numbers of ditrees having dipaths
of length 4. We also give bounds for -numbers of bipartite
digraphs whose longest dipath is of length 3. Finally, we present a linear-time
algorithm for determining -numbers of ditrees whose
longest dipath is of length 3.Comment: 12 pages; presented in SIAM Coference on Discrete Mathematics, June
13-16, 2004, Loews Vanderbilt Plaza Hotel, Nashville, TN, US
- …