نتایج جستجو برای: damage characterization

تعداد نتایج: 596512  

Journal: :International Conference on Aerospace Sciences and Aviation Technology 1997

Journal: :IEEE Transactions on Nuclear Science 1989

Journal: :Transactions on Electrical and Electronic Materials 2005

Journal: :Strojniški vestnik - Journal of Mechanical Engineering 2018

Journal: :Journal of The European Ceramic Society 2021

Abstract The developing roles of damage mechanisms in the failure response SiC/SiC minicomposites was investigated by characterization microscale accumulation with respect to microstructure. A multi-modal approach combining spatially resolved acoustic emission (AE) tensile testing in-SEM (scanning electron microscope) used simultaneously examine surface (observed in-SEM) and bulk (monitored via...

B. Niroumand F. Ashrafizadeh F. Barlat N. Saeidi,

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...

Journal: :CoRR 2015
Dmitriy S. Malyshev

We completely determine the complexity status of the dominating set problem for hereditary graph classes defined by forbidden induced subgraphs with at most five vertices.

Journal: :Discrete Mathematics & Theoretical Computer Science 2000
Elena Barcucci Alberto Del Lungo Elisa Pergola Renzo Pinzani

A permutation is said to be –avoiding if it does not contain any subsequence having all the same pairwise comparisons as . This paper concerns the characterization and enumeration of permutations which avoid a set of subsequences increasing both in number and in length at the same time. Let be the set of subsequences of the form “ ”, being any permutation on . For ! the only subsequence in #" i...

Journal: :Discrete Mathematics 2015
Dmitriy S. Malyshev

We completely determine the complexity status of the 3-colorability problem for hereditary graph classes defined by two forbidden induced subgraphs with at most five vertices. © 2015 Elsevier B.V. All rights reserved.

نمودار تعداد نتایج جستجو در هر سال

با کلیک روی نمودار نتایج را به سال انتشار فیلتر کنید