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

Distance-two labelings of digraphs

For positive integers $j\ge k$, an $L(j,k)$-labeling of a digraph $D$ is a function $f$ from $V(D)$ into the set of nonnegative integers such that $|f(x)-f(y)|\ge j$ if $x$ is adjacent to $y$ in $D$ and $|f(x)-f(y)|\ge k$ if $x$ is of distant two to $y$ in $D$. Elements of the image of $f$ are called labels. The $L(j,k)$-labeling problem is to determine the $\vec{\lambda}_{j,k}$-number $\vec{\lambda}_{j,k}(D)$ of a digraph $D$, which is the minimum of the maximum label used in an $L(j,k)$-labeling of $D$. This paper studies $\vec{\lambda}_{j,k}$- numbers of digraphs. In particular, we determine $\vec{\lambda}_{j,k}$- numbers of digraphs whose longest dipath is of length at most 2, and $\vec{\lambda}_{j,k}$-numbers of ditrees having dipaths of length 4. We also give bounds for $\vec{\lambda}_{j,k}$-numbers of bipartite digraphs whose longest dipath is of length 3. Finally, we present a linear-time algorithm for determining $\vec{\lambda}_{j,1}$-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

Investigation of inverterless control of interior permanent-magnet alternators

Copyright © 2006 IEEEThis paper investigates the performance and control of a low-cost 6-kW concept demonstrator of an "inverterless" automotive alternator. This is based on a switched-mode rectifier (SMR) combined with a high-flux interior permanent-magnet (PM) machine. Duty cycle control of the SMR is described and the theoretical predictions are compared with open-loop experimental results. The efficiency of the concept demonstrator is examined as a function of speed and load. Control issues regarding automotive operation are discussed.Chong-Zhi Liaw, David M. Whaley, Wen L. Soong and Nesimi Ertugru

Probabilistic Simulation of Stress Concentration in Composite Laminates

A computational methodology is described to probabilistically simulate the stress concentration factors (SCF's) in composite laminates. This new approach consists of coupling probabilistic composite mechanics with probabilistic finite element structural analysis. The composite mechanics is used to probabilistically describe all the uncertainties inherent in composite material properties, whereas the finite element is used to probabilistically describe the uncertainties associated with methods to experimentally evaluate SCF's, such as loads, geometry, and supports. The effectiveness of the methodology is demonstrated by using is to simulate the SCF's in three different composite laminates. Simulated results match experimental data for probability density and for cumulative distribution functions. The sensitivity factors indicate that the SCF's are influenced by local stiffness variables, by load eccentricities, and by initial stress fields

Copper(I) Complexes of Heterocyclic Thiourea Ligands

The coordination of heterocyclic thiourea ligands (L = N-(2-pyridyl)-N′-phenylthiourea (1), N-(2-pyridyl)-N′-methylthiourea (2), N-(3-pyridyl)-N′-phenylthiourea (3), N-(3-pyridyl)-N′-methylthiourea (4), N-(4-pyridyl)-N′-phenylthiourea (5), N-(2-pyrimidyl)-N′-phenylthiourea (6), N-(2-pyrimidyl)-N′-methylthiourea (7), N-(2-thiazolyl)-N′-methylthiourea (8), N-(2-benzothiazolyl)-N′-methylthiourea (9), N,N′-bis(2-pyridyl)thiourea (10) and N,N′-bis(3-pyridyl)thiourea (11)) with CuX (X = Cl, Br, I, NO3) has been investigated. CuX:L product stoichiometries of 1:1–1:5 were found, with 1:1 being most common. X-ray structures of four 3-coordinate mononuclear CuXL2 complexes (CuCl(6)2, CuCl(7)2, CuBr(6)2, and CuBr(9)2) are reported. In contrast, CuBr(1)2 is a 1D sulfur-bridged polymer. CuIL structures (L = 7, 8) are 1D chains with corner-sharing Cu2(μ-I)2 and Cu2(μ-S)2 units, and CuCl(10) is a 2D network having μ-Cl and N-/S-bridging L. Two [CuL2]NO3 structures are reported: a mononuclear 4-coordinate copper complex with chelating ligands (L = 10) and a 1D link-chain with N-/S-bridging L (L = 3). Two ligand oxidative cyclizations were encountered during crystallization. CuI crystallized with 6 to produce zigzag ladder polymer [(CuI)2(12)]·½CH3CN (12 = N-(pyrimidin-2-yl)benzo[d]thiazol-2-amine) and CuNO3 crystallized with 10 to form [Cu2(NO3)(13)2(MeCN)]NO3 (13 = dipyridyltetraazathiapentalene)

The fcc-bcc crystallographic orientation relationship in AlxCoCrFeNi high-entropy alloys

This paper concentrates on the crystallographic-orientation relationship between the various phases in the Al-Co-Cr-Fe-Ni high-entropy alloys. Two types of orientation relationships of bcc phases (some with ordered B2 structures) and fcc matrix were observed in Al0.5CoCrFeNi and Al0.7CoCrFeNi alloys at room temperature: (1 -1 0)(bcc)//(200)(fcc), [CM](bcc)//[001](fcc), (b) (1 -1 1)B2//(2 - 2 0)(fcc), [011]B2//[11 root 2](fcc). (C) 2016 Elsevier B.V. All rights reserved.</p