Results 241 to 250 of about 295,692 (316)
From Intrinsic Resin Properties to Interlaminar Fracture Toughness of CFRP: Crack-Tip Deformation, Transfer Mechanisms, and Loading-Mode Dependence. [PDF]
Li X +8 more
europepmc +1 more source
Design guidelines for self-healing materials in soft electronics. [PDF]
Park CB, Chang G, Chong J, Kang J.
europepmc +1 more source
Some of the next articles are maybe not open access.
Related searches:
Related searches:
Fracture toughness in shales using nano-indentation
Journal of Petroleum Science and Engineering, 2020Fracture toughness property is often ignored but has a significant impact on the hydraulic fracture design, i.e. length and height. It represents the resistance of the rock to hydraulic fracturing and is a direct indicator of rock fracability.
Ishank Gupta +2 more
exaly +2 more sources
, 2021
Fracture toughness, is a critical aspect of a component’s strength and structural integrity. In additive manufacturing (AM) of polymers and polymer composites, the fracture toughness of the manufactured part is influenced by the bonding between the ...
S. Sharafi +3 more
semanticscholar +1 more source
Fracture toughness, is a critical aspect of a component’s strength and structural integrity. In additive manufacturing (AM) of polymers and polymer composites, the fracture toughness of the manufactured part is influenced by the bonding between the ...
S. Sharafi +3 more
semanticscholar +1 more source
Journal of Graph Theory, 2007
AbstractSpider graphs are the intersection graphs of subtrees of subdivisions of stars. Thus, spider graphs are chordal graphs that form a common superclass of interval and split graphs. Motivated by previous results on the existence of Hamilton cycles in interval, split and chordal graphs, we show that every 3/2‐tough spider graph is hamiltonian.
Tomás Kaiser +2 more
openaire +1 more source
AbstractSpider graphs are the intersection graphs of subtrees of subdivisions of stars. Thus, spider graphs are chordal graphs that form a common superclass of interval and split graphs. Motivated by previous results on the existence of Hamilton cycles in interval, split and chordal graphs, we show that every 3/2‐tough spider graph is hamiltonian.
Tomás Kaiser +2 more
openaire +1 more source
, 2020
The hierarchical martensitic features in ultra-high strength stainless steel (UHSSS), including the prior austenite grains, martensite packets, blocks and laths with the descending size, were refined to various extents by employing different ...
Haiwen Luo +3 more
semanticscholar +1 more source
The hierarchical martensitic features in ultra-high strength stainless steel (UHSSS), including the prior austenite grains, martensite packets, blocks and laths with the descending size, were refined to various extents by employing different ...
Haiwen Luo +3 more
semanticscholar +1 more source
Low–interfacial toughness materials for effective large-scale deicing
Science, 2019Easy ice removal The accumulation of ice on a surface can lead to hazardous conditions, such as on the surface of an airplane wing or the side of a tall building.
Kevin Golovin +3 more
semanticscholar +1 more source
On the impact toughness of gradient-structured metals
Acta Materialia, 2020Gradient-structured (GS) materials are capable of displaying high strength without compromising ductility, which can result in damage-tolerant structures.
Yan Lin +5 more
semanticscholar +1 more source
A tough product for a tough application
World Pumps, 2020One of the harshest and most complex operating applications is oil & gas production, where numerous liquid-handling functions need to be completed reliably and flawlessly for full optimisation. This article looks at why peristaltic (hose) pumps excel in this environment.
openaire +1 more source
A model of hardness and fracture toughness of solids
Journal of Applied Physics, 2019Hardness and fracture toughness are some of the most important mechanical properties. Here, we propose a simple model that uses only the elastic properties to calculate the hardness and fracture toughness. Its accuracy is checked by comparison with other
E. Mazhnik, A. Oganov
semanticscholar +1 more source

