Results 61 to 70 of about 3,689,343 (292)
On the extreme complexity of certain nearly regular graphs
Theory and Applications of GraphsThe complexity of a graph is the number of its labeled spanning trees. It is demonstrated that the seven known triangle-free strongly regular graphs are graphs of maximal complexity among all graphs of the same order and degree; their complements are ...
Gregory P Constantine, Gregory C Magda
doaj +1 more source
Minimum spanning tree reconstruction using autoencoders [PDF]
, 2022 Minimum spanning trees are widely used graph structures used to find relationships between data organized in a graph. This work proposes a new approach based on neural networks, in particular, autoencoders, to extrapolate this tree from the dissimilarity
Castelletto, Riccardo
core
Advanced Engineering Materials, EarlyView.More than 10 000 metal‐coated silicon MEMS cantilevers are fabricated and characterized to build a large‐scale experimental dataset spanning multiple vibrational modes. Machine learning algorithms are benchmarked to predict resonance frequency and quality factor, with ensemble based models achieving accuracy approaching experimental uncertainty.
Sina Zare Pakzad +8 more
wiley +1 more source
ETEA: A euclidean minimum spanning tree-Based evolutionary algorithm for multiobjective optimization [PDF]
, 2013 © the Massachusetts Institute of TechnologyAbstract The Euclidean minimum spanning tree (EMST), widely used in a variety of domains, is a minimum spanning tree of a set of points in the space, where the edge weight between each pair of points is their ...
Yang, S +8 more
core +1 more source
Advanced Functional Materials, EarlyView.Shellac, a centuries‐old natural resin, is reimagined as a green material for flexible electronics. When combined with silver nanowires, shellac films deliver transparency, conductivity, and stability against humidity. These results position shellac as a sustainable alternative to synthetic polymers for transparent conductors in next‐generation ...
Rahaf Nafez Hussein +4 more
wiley +1 more source
The number of spanning trees of cyclic snakes
Indonesian Journal of CombinatoricsA cyclic snake is a connected graph formed by connecting, by means of vertex amalgamation, a certain number of copies of the cycle Cn, in such a way that the i-th copy of Cn is connected with the (i+1)-th copy, resulting in a graph with maximum degree 4.
Christian Barrientos
doaj +1 more source
Using petal-decompositions to build a low stretch spanning tree
Symposium on the Theory of Computing, 2012 We prove that any graph G=(V,E) with n points and m edges has a spanning tree T such that ∑(u,v)∈ E(G)dT(u,v) = O(m log n log log n). Moreover such a tree can be found in time O(m log n log log n).
Ittai Abraham, O. Neiman
semanticscholar +1 more source
Coordinated Architectural and Chemical Reinforcement in the Crushing Mandible of a Soldier Termite
Advanced Functional Materials, EarlyView.The crushing mandible of a soldier termite withstands substantial biting loads despite lacking mineral. Its cuticle is partitioned: convex teeth pair hardness and zinc enrichment with aligned chitin fibers for contact durability, while stiffer concave regions between teeth carry bending loads.
Andrew Tran Nguyen +16 more
wiley +1 more source
Advanced Functional Materials, EarlyView.Melanin content directly controls fungal spore mechanical properties, with pigmented spores achieving rupture forces two orders of magnitude higher than hyaline spores. Environmental stress drives this quantity‐quality tradeoff; stressed species invest energy in melanin‐reinforced, mechanically superior thick‐walled, super‐hydrophobic spores, while ...
Atul Agrawal, Steven E. Naleway
wiley +1 more source
Efficient phase unwrapping [PDF]
, 2005 In the field of optical interferometry, two-dimensional projections of light interference patterns are often analysed in order to obtain measurements of interest.
AI-Sawaf, Firas
core +3 more sources