LLE Review, Volume 125 25 Introduction Thin-film coatings for near-ultraviolet (UV), nanosecond (ns)-pulse–laser applications are usually comprised of metal oxide as the high-index component and silica oxide as the low-index material. High-resolution studies of laser-damage morphology1 reveal two important facts about ns-pulsed–laser damage in these coatings: First, metal oxide is the weakest p...

in this paper, a crack localization method for euler-bernoulli beams via an efficient static data based indicator is proposed. the crack in beams is simulated here using a triangular variation in the stiffness. static responses of a beam are obtained by the finite element modeling. in order to reduce the computational cost of damage detection method, the beam deflection is fitted through a poly...

results of damage prediction in buildings can be used as a useful tool for managing and decreasing seismic risk of earthquakes. in this study, damage spectrum and c4.5 decision tree algorithm were utilized for damage prediction in steel buildings during earthquakes. in order to prepare the damage spectrum, steel buildings were modeled as a single-degree-of-freedom (sdof) system and time-history...

The fatigue resistance of aerospace structures is degraded by the presence corrosion damage. This work characterizes micro-scale (<50 µm) morphologies and underlying microstructure AA7050 that impact crack formation. Corroded specimens were cycled to failure using a fracture surface marking spectrum. Pre-test characterization, fractography EBSD performed. No damage or metric independently corre...

The fatigue strength of structural steel components subjected to cyclic loading is often characterized in terms S-N curves derived under constant amplitude (CA) loading. However, these are load histories variable and mean stress, i.e. (VA) To take into account this condition for the design or verification components, damage accumulation models modification have been proposed literature. require...

An equitable coloring of a graph G is a proper coloring of the vertices of G such that color classes differ in size by at most one. In this note, we verify the equitable coloring conjecture [W. Meyer, Amer. Math. Monthly 80 (1973), 920–922] for some classes of graphs which are defined by forbidden induced subgraphs using known results.

A graph G on n vertices is pancyclic if G contains cycles of all lengths`for 3 ` n and G is cycle extendable if for every nonhamiltonian cycle C G there is a cycle C 0 G such that V (C) V (C 0) and jV (C 0) n V (C)j = 1. We prove that (i) every 2-connected K 1;3-free graph is pancyclic, if G is P 5-free and n 6, if G is P 6-free and n 10, or if G is P 7-free, deer-free and n 14, and (ii) every ...

A set A of vertices of a graph G is called d-scattered in G if no two d-neighborhoods of (distinct) vertices of A intersect. In other words, A is d-scattered if no two distinct vertices of A have distance at most 2d. This notion was isolated in the context of finite model theory by Gurevich and recently it played a prominent role in the study of homomorphism preservation theorems for special cl...

In this paper we propose a structural characterization for a class of bipartite graphs defined by two forbidden induced subgraphs. We show that the obtained characterization leads to polynomial-time algorithms for several problems that are NP-hard in general bipartite graphs.

An antimatroid is an accessible union-closed family of subsets of a 0nite set. A number of classes of antimatroids are closed under taking minors such as point-search antimatroids of rooted (di)graphs, line-search antimatroids of rooted (di)graphs, shelling antimatroids of rooted trees, shelling antimatroids of posets, etc. The forbidden minor characterizations are known for point-search antima...