Results 71 to 80 of about 111,097 (310)

Fine-grained Meta-Theorems for Vertex Integrity [PDF]

Logical Methods in Computer Science
Vertex Integrity is a graph measure which sits squarely between two more well-studied notions, namely vertex cover and tree-depth, and that has recently gained attention as a structural graph parameter.
Michael Lampis, Valia Mitsou
doaj   +1 more source

Microstructural Evolution and Vacancy Defect Formation in Mn–Mo–Ni RPV Steel Under Low Cycle Fatigue: Insights From EBSD and PALS

Advanced Engineering Materials, EarlyView.
Low‐cycle fatigue damage in Mn–Mo–Ni reactor pressure vessel steel is examined using a combined electron backscatter diffraction and positron annihilation lifetime spectroscopy approach. The study correlates texture evolution, dislocation substructure development, and vacancy‐type defect formation across uniform, necked, and fracture regions, providing
Apu Sarkar, Dhanadeep Dutta, G. Bharat Reddy   +2 more
wiley   +1 more source

Parameterized Algorithmics for Computational Social Choice: Nine Research Challenges [PDF]

, 2014
Computational Social Choice is an interdisciplinary research area involving Economics, Political Science, and Social Science on the one side, and Mathematics and Computer Science (including Artificial Intelligence and Multiagent Systems) on the other ...
Bredereck, Robert, Chen, Jiehua, Faliszewski, Piotr, Guo, Jiong, Niedermeier, Rolf, Woeginger, Gerhard J.   +5 more
core   +3 more sources

Canonical kernels versus constructible kernels [PDF]

Rocky Mountain Journal of Mathematics, 2019
no ...
openaire   +4 more sources

EBSD Study of Creep‐Induced Lattice Misorientation in MgO‐Particle‐Reinforced Austenitic Steel Composites

Advanced Engineering Materials, EarlyView.
Creep experiments at 900°C on coarse‐grained steel‐ceramic composites containing recycled magnesia reveal that higher ceramic volume fractions significantly enhance the creep resistance. Detailed EBSD investigations identify subgrain formation in the steel matrix as the dominant deformation mechanism.
Moritz Müller, Amaya Compart, Mahnaz Mehdizadehlima, Serhii Yaroshevskyi, Christos G. Aneziris, Horst Biermann, Anja Weidner   +6 more
wiley   +1 more source

Additive Gaussian Process Regression for Predictive Design of High‐Performance, Printable Silicones

Advanced Engineering Materials, EarlyView.
A chemistry‐aware design framework for tuning printable polydimethylsiloxane (PDMS) for vat photopolymerization (VPP) is developed using additive Gaussian process (GP) modeling. Polymer network mechanics informs variable groupings, feasible formulation constraints, and interaction variables.
Roxana Carbonell, Martha Leach, Hongtao Song, Carolyn Seepersad   +3 more
wiley   +1 more source

Seebeck and Nernst coefficients of a magnetized hot QCD medium with number conserving kernel [PDF]

, 2022
Salman Ahamad Khan, Binoy Krishna Patra
openalex   +1 more source

Productivity‐Driven Optimization of Laser Powder Bed Fusion Parameters for IN718 Superalloy: Process Control, Microstructure, and Mechanical Properties

Advanced Engineering Materials, EarlyView.
This study demonstrates how optimizing laser power, scanning speed, and hatching distance in laser powder bed fusion can boost the productivity of Inconel 718 manufacturing by up to 29% while maintaining mechanical integrity. The work delivers a validated process window and cost–time analysis, offering industry‐ready guidelines for efficient additive ...
Amir Behjat, Guido Barale, John Stavridis, Ehsan Norouzi, Jin‐Yoo Suh, Dong‐Ik Kim, Luca Iuliano, Abdollah Saboori   +7 more
wiley   +1 more source

Multimodal Data‐Driven Microstructure Characterization

Advanced Engineering Materials, EarlyView.
A self‐consistent autonomous workflow for EBSP‐based microstructure segmentation by integrating PCA, GMM clustering, and cNMF with information‐theoretic parameter selection, requiring no user input. An optimal ROI size related to characteristic grain size is identified.
Qi Zhang, Santiago Benito, Özge Özgün, Sebastian Weber, Markus Stricker   +4 more
wiley   +1 more source

Even Kernels

The Electronic Journal of Combinatorics, 1994
Given a graph $G = (V,E)$, an even kernel is a nonempty independent subset $V' \subseteq V$, such that every vertex of $G$ is adjacent to an even number (possibly 0) of vertices in $V'$. It is proved that the question of whether a graph has an even kernel is NP-complete. The motivation stems from combinatorial game theory.
openaire   +2 more sources