Results 91 to 100 of about 982,672 (306)
Minimal sensitivity perfect model matching control
[[abstract]]A simple and direct procedure for the design of a minimal sensitivity perfect model matching control system is proposed. The key observation is that, in addition to permitting of perfect model matching control, the design parameters leave a ...
Lu, H.-C., Wang, S.-S., Chen, B.-S.
core +1 more source
A simplified thermoplastic pultrusion model is developed to predict thermal fields in glass fiber/polyethylene terephthalate (GF/PET) composites with reduced computational cost. By combining effective material homogenization, validation against literature data, and Gaussian‐process‐based optimization, the study reveals how heating limits, pulling speed,
Elder Soares +3 more
wiley +1 more source
COMPUTING THE ANTI-KEKULÉ NUMBER OF CERTAIN NANOTUBES AND NANOCONES
Let G(V,E) be a connected graph. A set M subset of E is called a matching if no two edges in M have a common end-vertex. A matching M in G is perfect if every vertex of G is incident with an edge in M.
Mehar Ali MALIK, Muhammad IMRAN
doaj
Postbuild annealing systematically modifies the phase fractions and morphology of EB‐PBF processed Mo–9Si–8B. Quantitative microstructure–property correlations reveal how controlled phase evolution enhances high‐temperature compressive strength and creep resistance.
Christopher Schmidt +5 more
wiley +1 more source
A Novel Approach to Estimate the Transition Temperature via Dynamic Nanoindentation
A new dynamic nanoindentation‐based method was developed that uses the stiffness ratio as an indicator of the elastic–plastic deformation contributions at different temperatures. The approach successfully identified transition temperatures in ferritic steel and distinguished them from continuously ductile austenitic steel.
Stefan Zeiler +4 more
wiley +1 more source
A note on arbitrarily vertex decomposable graphs [PDF]
A graph \(G\) of order \(n\) is said to be arbitrarily vertex decomposable if for each sequence \((n_{1},\ldots,n_k)\) of positive integers such that \(n_{1}+\ldots+n_{k}=n\) there exists a partition \((V_{1},\ldots,V_{k})\) of the vertex set of \(G ...
Antoni Marczyk
doaj
ABSTRACT Chitosan, a polysaccharide upcycled from biowaste, has long promised sustainable, biocompatible, and antimicrobial films and devices, an appeal reinforced by its recent regulatory recognition, with several chitosan‐based antibacterial dressings gaining clearance through the Food and Drug Administration's 510(k) pathway.
Jacopo Nicoletti +16 more
wiley +1 more source
Optoelectronic synaptic devices based on solution‐processed molecular telluride GST‐225 phase‐change inks are demonstrated for three‐factor learning. A global optical signal broadcast through a silicon waveguide induces non‐volatile conductance updates exclusively in locally electrically flagged memristors.
Kevin Portner +14 more
wiley +1 more source
On two consequences of Berge–Fulkerson conjecture
The classical Berge–Fulkerson conjecture states that any bridgeless cubic graph admits a list of six perfect matchings such that each edge of belongs to two of the perfect matchings from the list.
Vahan V. Mkrtchyan, Gagik N. Vardanyan
doaj +1 more source
Perfect Matching Complexes of Polygonal Line Tiling [PDF]
The perfect matching complex of a simple graph G is a simplicial complex having facets (maximal faces) as the perfect matchings of G. This article discusses the perfect matching complex of polygonal line tiling and the $\left(2 \times n\right)$-grid ...
Chandrakar, Himanshu, Singh, Anurag
core +1 more source

