Results 41 to 50 of about 15,294 (116)
The main aim of the current study is to evaluate the compressive quasi-static and fatigue properties of titanium alloy (Ti6Al4V) cellular materials, with different topologies, manufactured via Laser Powder Bed Fusion (LPBF) process. The topologies herein
S. Raghavendra +6 more
semanticscholar +1 more source
ABSTRACT An inversion of a tournament T is obtained by reversing the direction of all edges with both endpoints in some set of vertices. Let inv k ( T ) be the minimum length of a sequence of inversions using sets of size at most k that result in the transitive tournament.
Raphael Yuster
wiley +1 more source
A Weighted Regularity Lemma with Applications
We prove an extension of the regularity lemma with vertex and edge weights which in principle can be applied for arbitrary graphs. The applications involve random graphs and a weighted version of the Erdős‐Stone theorem. We also provide means to handle the otherwise uncontrolled exceptional set.
Béla Csaba +2 more
wiley +1 more source
Homogeneous Multigrid for Hybrid Discretizations: Application to HHO Methods
ABSTRACT We prove the uniform convergence of the geometric multigrid V‐cycle for hybrid high‐order (HHO) and other discontinuous skeletal methods. Our results generalize previously established results for HDG methods, and our multigrid method uses standard smoothers and local solvers that are bounded, convergent, and consistent.
Daniele A. Di Pietro +4 more
wiley +1 more source
Conformal Hypergraphs: Duality and Implications for the Upper Clique Transversal Problem
ABSTRACT Given a hypergraph ℋ, the dual hypergraph of ℋ is the hypergraph of all minimal transversals of ℋ. The dual hypergraph is always Sperner, that is, no hyperedge contains another. A special case of Sperner hypergraphs are the conformal Sperner hypergraphs, which correspond to the families of maximal cliques of graphs.
Endre Boros +3 more
wiley +1 more source
A removal lemma for ordered hypergraphs
Abstract We prove a removal lemma for induced ordered hypergraphs, simultaneously generalizing Alon–Ben‐Eliezer–Fischer's removal lemma for ordered graphs and the induced hypergraph removal lemma. That is, we show that if an ordered hypergraph (V,G,<)$(V,G,<)$ has few induced copies of a small ordered hypergraph (W,H,≺)$(W,H,\prec)$ then there is a ...
Henry Towsner
wiley +1 more source
Homomorphisms and Embeddings of STRIPS Planning Models
ABSTRACT Determining whether two STRIPS planning instances are isomorphic is the simplest form of comparison between planning instances. It is also a particular case of the problem concerned with finding an isomorphism between a planning instance P$$ P $$ and a sub‐instance of another instance P′$$ {P}^{\prime } $$. One application of such a mapping is
Arnaud Lequen +2 more
wiley +1 more source
Transference for loose Hamilton cycles in random 3‐uniform hypergraphs
Abstract A loose Hamilton cycle in a hypergraph is a cyclic sequence of edges covering all vertices in which only every two consecutive edges intersect and do so in exactly one vertex. With Dirac's theorem in mind, it is natural to ask what minimum d$$ d $$‐degree condition guarantees the existence of a loose Hamilton cycle in a k$$ k $$‐uniform ...
Kalina Petrova, Miloš Trujić
wiley +1 more source
Inverse Fuzzy‐Directed Graph With an Application in Traffic Flow Problem
The fuzzy‐directed graph is an efficient tool to deal with the directional relationships among the nodes that possess imprecise and uncertain information. To handle the membership value of the edges that provide greater effect when two nodes are combined, we introduce inverse fuzzy‐directed graph (IFDG) GDI.
R. Keerthana +4 more
wiley +1 more source
The role of complementary learning systems in learning and consolidation in a quasi-regular domain.
We examine the role of off-line memory consolidation processes in the learning and retention of a new quasi-regular linguistic system similar to the English past tense.
Jelena Mirković +3 more
semanticscholar +1 more source

