Due to the scarcity of rational models for predicting the strength of RC beam-column sandwich joints, a modified simplified softened strut-and-tie model suggests a more rational calculation method for the effective compressive strength and the height of the joint concrete based on the simplified softened strut-and-tie. The shear strength of existing tested 15 sandwich interior joints is calcula...

The topology optimization design of structures with anisotropic constrained damping layers (ACDL) is investigated in present paper. The evolutionary structural optimization (ESO) method is employed to find the optimal layout of ACDL with aim to maximum the modal damping loss factor of the sandwich structure. Modal strain energy (MSE) method is used to calculate the damping loss factor of whole ...

–In this research manufacturing of the Kevlar-Mg AZ31B sandwich composite is done. Sandwich prepared using Kevlar fiber and Mg alloy. This manufactured by Vacuum Assisted Resin Transfer Moulding (VARTM) method. method uses vacuum pressure difference causes bonding fiber- metal surface epoxy resin. In alloy act as core material a face skin. fiber-metal will have enhanced mechanical properties th...

Sandwich composites have been used as lightweight materials in aircraft manufacturing for a long time, from balsa wood sandwich the 1930s to honeycomb and fiber-reinforced polymers sandwich. Its characteristics are considered 'perfect' material aircraft, which has high strength with low density. common floor panels. The core is usually made of Nomex or aluminum honeycomb, while skin 1 "“ 2 ply ...

A graph G = (V,E) is a chordal probe graph if its vertices can be partitioned into two sets, P (probes) and N (non-probes), where N is a stable set and such that G can be extended to a chordal graph by adding edges between non-probes. We give several characterizations of chordal probe graphs, first, in the case of a fixed given partition of the vertices into probes and non-probes, and second, i...

A graph G s = (V , E s) is a sandwich for a pair of graphs G t = (V , E t) and G = (V , E) if E t ⊆ E s ⊆ E. A sandwich problem asks for the existence of a sandwich graph having an expected property. In a seminal paper, Golumbic et al. [Graph sandwich problems, J. Algorithms 19 (1995) 449–473] present many results on sub-families of perfect graphs. We are especially interested in comparability ...