Results 41 to 50 of about 166,225,520 (254)

Space: The Re-Visioning Frontier of Biological Image Analysis with Graph Theory, Computational Geometry, and Spatial Statistics

Mathematics, 2021
Every biological image contains quantitative data that can be used to test hypotheses about how patterns were formed, what entities are associated with one another, and whether standard mathematical methods inform our understanding of biological ...
John R. Jungck, Michael J. Pelsmajer, Camron Chappel, Dylan Taylor   +3 more
doaj   +1 more source

Is an Apple an Orange? A Large Language Model Benchmark for Candidate Term Extraction and Subclass Decisions Against Upper Ontologies in Engineering and Materials Science

Advanced Engineering Materials, EarlyView.
Building machine‐readable vocabularies for materials science is slow, expert‐driven work. This study benchmarks 13 large language models on two of its first steps: finding candidate terms in engineering articles and deciding where they belong in a class hierarchy.
Thomas Bjarsch, Maximilian Holland, Klaus Drechsler, Johannes Schilp   +3 more
wiley   +1 more source

Alternative Multiple Spanning Tree Protocol (AMSTP) for Optical Ethernet Backbones [PDF]

, 2004
The availability and affordable cost of Gigabit and 10 Gigabit Ethernet switches has impacted the deployment of metropolitan area networks (MAN) and campus networks.
García-Martínez, Alberto, Azcorra Saloña, Arturo, Azcorra, Arturo, Ibáñez, Guillermo, Ibáñez Fernández, Guillermo Agustín   +4 more
core   +2 more sources

Total number of Spanning Trees in a Graph

, 2023
Tema ovog rada su različiti načini prebrojavanja razapinjućih stabala. Prvo se predstavljaju osnovni pojmovi teorije grafova s posebnim fokusom na stabla i njihova svojstva. Zatim se predstavlja pojam razapinjućih stabala grafa.
Gaćina, Lovro
core   +2 more sources

New AI‐Assisted Approach for Expanding the Solution Space: Application to Lattice Structure Design

Advanced Engineering Materials, EarlyView.
This work introduces an innovative framework for designing structured materials by ex panding the design space through reparameterization of qualitative variables into continuous structural descriptors. Combined with machine‐learning‐based prediction and multi‐objective optimization, the approach enables the discovery of novel lattice architectures ...
G. H. Gahimbare, Y. Beideler, D. Chune, R. De Guio, T. Roland, H. Chibane   +5 more
wiley   +1 more source

On the Number of Spanning Trees in Augmented Triangular Prism Graphs

Mathematics
In computer science and graph theory, prism and antiprism graphs are crucial for network modeling, optimization, and network connectivity comprehension.
Ahmad Asiri, Salama Nagy Daoud
doaj   +1 more source

The Evaluation of the Number and the Entropy of Spanning Trees on Generalized Small-World Networks

Journal of Applied Mathematics, 2018
Spanning trees have been widely investigated in many aspects of mathematics: theoretical computer science, combinatorics, so on. An important issue is to compute the number of these spanning trees.
Raihana Mokhlissi, Dounia Lotfi, Joyati Debnath, Mohamed El Marraki, Noussaima EL Khattabi   +4 more
doaj   +1 more source

Composites of Shellac and Silver Nanowires as Flexible, Biobased, and Corrosion‐Resistant Transparent Conductive Electrodes

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, Tiago Carneiro Gomes, Eliza Ng, Simon Rondeau‐Gagné, Tricia Breen Carmichael   +4 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, Li, Miqing; id_orcid, Liu, X, Li, M, Zheng, Jinhua, Li, Miqing, Yang, Shengxiang, Zheng, J, Liu, Xiaohui   +8 more
core   +1 more source

Enumeration of spanning trees in the sequence of Dürer graphs

Open Mathematics, 2017
In this paper, we calculate the number of spanning trees in the sequence of Dürer graphs with a special feature that it has two alternate states. Using the electrically equivalent transformations, we obtain the weights of corresponding equivalent graphs ...
Li Shixing
doaj   +1 more source