This paper presents a scientific basis for the description of the causes of damage within an irreversible thermodynamic framework and the effects of damage as observable variables that signify degradation of structural integrity. The approach relies on the fundamentals of irreversible thermodynamics and specifically the notion of entropy generation as a measure of degradation and damage. We fir...

in the present research, damage mechanisms during room temperature uniaxial tensile testing of two different modern high strength dual phase steels,dp780 and dp980, were studied. detailed microstructural characterization of the strained and sectioned samples was performed by scanning electron microscopy (sem). the results revealed that interface decohesion, especially at the triple junctions of...

The paper shows that there is no finite set of forbidden minors which characterizes classes of independence models that are representable by Gaussian, discrete and binary distributions, respectively. In addition, a way to prove the nonexistence of a finite characterization for any other class of independence models is suggested. MSC 2000: 60A99, 68T30, 94A15

The contents of this report reflect the views of the authors, who are responsible for the facts and the accuracy of the information presented herein. This document is disseminated under the sponsorship of Centers Program in the interest of information exchange. UCF and the U.S. Government assumes no liability for the contents or use thereof.

In this paper, we obtain a forbidden-minor characterization of the class of binary gammoids M such that, for every pair of elements x, y of M, both the splitting matroid Mx,y and the element splitting matroid M ′ x,y are binary gammoids.

A connected edge-colored graphG is said to be rainbow-connected if any two distinct vertices of G are connected by a path whose edges have pairwise distinct colors, and the rainbow connection number rc(G) ofG is the minimum number of colors that can make G rainbow-connected. We consider families F of connected graphs for which there is a constant kF such that every connected F-free graph G with...