Results 71 to 80 of about 55,995 (279)

Meta‐Rod Mechanical Metamaterials With Programmable Reconfiguration

open access: yesAdvanced Functional Materials, EarlyView.
Existing mechanical metamaterials achieve programmable large deformations in planar square or cubic configurations, restricted by required complex boundary conditions. This research proposes a 1D metamaterial, Meta‐rod, with linear, bending, twisting, area, and volume deformation modes.
Atharva Pande, Lyes Kadem, Hang Xu
wiley   +1 more source

Generalized MacMahon G(q) as q-deformed CFT Correlation Function

open access: yes, 2008
Using $\Gamma_{\pm}(z) $ vertex operators of the $c=1$ two dimensional conformal field theory, we give a 2d-quantum field theoretical derivation of the conjectured d- dimensional MacMahon function G$_{d}(q) $. We interpret this function G$_{d}(q) $ as a $
Aganagic   +40 more
core   +1 more source

A New Threshold Switching Device With Tunable Negative Differential Resistance Based on ErMnO3 Polymorphs

open access: yesAdvanced Functional Materials, EarlyView.
Polymorph engineering in ErMnO3 enables low‐voltage, forming‐free threshold switching with tunable negative differential resistance. Conducting orthorhombic regions embedded in an insulating hexagonal matrix provide controlled Joule‐heating‐enhanced Poole–Frenkel transport. The hexagonal phase prevents excessive heating and breakdown.
Rong Wu   +8 more
wiley   +1 more source

Conditional resolvability in graphs: a survey

open access: yesInternational Journal of Mathematics and Mathematical Sciences, 2004
For an ordered set W={w1,w2,…,wk} of vertices and a vertex v in a connected graph G, the code of v with respect to W is the k-vector cW(v)=(d(v,w1),d(v,w2),…,d(v,wk)), where d(x,y) represents the distance between the vertices x and y.
Varaporn Saenpholphat, Ping Zhang
doaj   +1 more source

Multimodal Correlation Feature Processing Method Based on Hypergraph [PDF]

open access: yesJisuanji gongcheng, 2017
Features are usually considered as independent of each other in traditional pattern recognition methods.The neglect of the correlation among multimodal features is part of the reason for recognition error.Aiming at integrating multimodal features,this ...
LUO Yong’en,HU Jicheng,XU Qian
doaj   +1 more source

A New Perspective on Clustered Planarity as a Combinatorial Embedding Problem

open access: yes, 2014
The clustered planarity problem (c-planarity) asks whether a hierarchically clustered graph admits a planar drawing such that the clusters can be nicely represented by regions.
C. Gutwenger   +15 more
core   +1 more source

The Cuttlebone Blueprint for Multifunctional Metamaterials: Design Taxonomy, Functional Decoupling, and Future Horizons

open access: yesAdvanced Functional Materials, EarlyView.
Cuttlebone‐inspired metamaterials exploit a septum‐wall architecture to achieve excellent mechanical and functional properties. This review classifies existing designs into direct biomimetic, honeycomb‐type, and strut‐type architectures, summarizes governing design principles, and presents a decoupled design framework for interpreting multiphysical ...
Xinwei Li, Zhendong Li
wiley   +1 more source

Gluing affine Yangians with bi-fundamentals

open access: yesJournal of High Energy Physics, 2020
The affine Yangian of gl 1 $$ {\mathfrak{gl}}_1 $$ is isomorphic to the universal enveloping algebra of W 1 + ∞ $$ {\mathcal{W}}_{1+\infty } $$ and can serve as a building block in the construction of new vertex operator algebras. In [1], a two-parameter
Wei Li
doaj   +1 more source

Local Out-Tournaments with Upset Tournament Strong Components I: Full and Equal {0,1}-Matrix Ranks [PDF]

open access: yes, 2010
A digraph D is a local out-tournament if the outset of every vertex is a tournament. Here, we use local out-tournaments, whose strong components are upset tournaments, to explore the corresponding ranks of the adjacency matrices.
Derby, Jason M.   +2 more
core   +1 more source

Vertex partitioning of a class of digraphs [PDF]

open access: yesMathématiques et sciences humaines, 2002
A vertex subset V' of a digraph is a pseudo sink set if its out-degree is low. The research of a pseudo sink set in a digraph is a high complexity combinatory problem. We show, for a particular family of digraphs, that a clustering of the vertex set fitted with a well chosen metric allows to reveal pseudo sink sets by their aggregation in a first ...
Ferre, Louis, Jouve, Bertrand
openaire   +2 more sources

Home - About - Disclaimer - Privacy