Results 51 to 60 of about 80,587 (266)
Advanced Engineering Materials, EarlyView.This article presents the design, modeling, and characterization of air‐pressure–actuated programmable vibroacoustic metamaterials (PVAMM). The study focuses on leveraging air pressure to dynamically tune resonance frequencies for effective noise attenuation.
William Kaal +2 more
wiley +1 more source
Edge-Preserving Stereo Matching Using Minimum Spanning Tree
IEEE Access, 2019 Despite that the accuracy and efficiency of stereo matching technology have significantly improved in the past decades, the issue of edge-blurring remains a challenge to most of the existing approaches.
Congxuan Zhang +5 more
doaj +1 more source
Linear verification for spanning trees [PDF]
Combinatorica, 1984 The paper deals with the following special problem: (Q) Given an n- element set \(E=(e_ 1,...,e_ n)\), and a list of m subsets of \(\{\) 1,...,n\(\}\), \(L=(S_ 1,...,S_ m)\). Find the maxima \(M_ i=\max_{j\in S_ i}e_ j,\) \(i=1,...,m\). For the solution of the problem an algorithm is proposed which finds all maxima in linear time when only the total ...
openaire +2 more sources
Towards Defect Phase Diagrams: From Research Data Management to Automated Workflows
Advanced Engineering Materials, EarlyView.A research data management infrastructure is presented for the systematic integration of heterogeneous experimental and simulation data required for defect phase diagrams. The approach combines openBIS with a companion application for large‐object storage, automated metadata extraction, provenance tracking and federated data access, thereby supporting ...
Khalil Rejiba +5 more
wiley +1 more source
Optimasi Jaringan dengan Spanning Tree untuk Congestion Management
ComTech, 2014 A proper network optimization is needed to deal with problems on the network and to minimize latency in the data flow in a dense network. The data stream is directed into the right channels so that the optimal network speed and latency can be minimized.
Mayliana Mayliana
doaj +1 more source
, 2018 We introduce and study a game variant of the classical spanning-tree problem. Our spanning-tree game is played between two players, min and max, who alternate turns in jointly constructing a spanning tree of a given connected weighted graph G. Starting with the empty graph, in each turn a player chooses an edge that does not close a cycle in the forest
Dan Hefetz +3 more
openaire +3 more sources
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 +3 more
wiley +1 more source
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 +5 more
wiley +1 more source
Packing of rigid spanning subgraphs and spanning trees
Journal of Combinatorial Theory, Series B, 2014 We prove that every (6k + 2l, 2k)-connected simple graph contains k rigid and l connected edge-disjoint spanning subgraphs. This implies a theorem of Jackson and Jordán [4] and a theorem of Jordán [6] on packing of rigid spanning subgraphs. Both these results are generalizations of the classical result of Lovász and Yemini [9] saying that every 6 ...
Cheriyan, Joseph +2 more
openaire +4 more sources
Spanning Trees in Dense Graphs [PDF]
Combinatorics, Probability and Computing, 2001 In this paper we prove the following almost optimal theorem. For any δ > 0, there exist constants c and n0 such that, if n [ges ] n0, T is a tree of order n and maximum degree at most cn/log n, and G is a graph of order n and minimum degree at least (1/2 + δ)n, then T is a subgraph of G.
János Komlós +2 more
openaire +2 more sources