Results 91 to 100 of about 1,092,292 (254)
The phase discontinuity problem—where the cyclic nature of phase angles causes catastrophic errors near the ±π boundary—is a fundamental obstacle in learning‐based reconfigurable intelligent surface (RIS) optimization. A phase‐aware hybrid CNN–LSTM framework resolves this by decomposing phase predictions into sine–cosine components, mapping circular ...
Seda Savaşçı Şen +3 more
wiley +1 more source
Origami turns a single silicone chamber into three different soft fluidic actuators. Crease angles alone decide whether it elongates, bends, or twists, and the fully folded chambers are cast monolithically in one day. Below 15 kPa, they reach 268% axial stretch, 72° bending, and 55° twist—no strain‐limiting layers, no rigid reinforcements, no vacuum ...
Alexia Le Gall +4 more
wiley +1 more source
A Metaheuristic Approach to the Graceful Labeling Problem
In graph theory, a graceful labeling of a graph G = (V, E) with n vertices and m edges is a labeling of its vertices with distinct integers between 0 and m inclusive, such that each edge is uniquely identified by the absolute difference between its ...
Houra Mahmoudzadeh, Kourosh Eshghi
core +1 more source
International Journal of Mathematical Combinatorics, Vol.5 [PDF]
The International J.Mathematical Combinatorics (ISSN 1937-1055) is a fully refereed international journal, sponsored by the MADIS of Chinese Academy of Sciences and published in USA quarterly comprising 460 pages approx.
Mao, Linfan (Editor-in-Chief)
core +1 more source
Playing in the Dark: Invisible Chess as a Laboratory for Strategic AI
This paper shows that strategic AI evaluated on perfect‐information benchmarks can be brittle in real adversarial settings. By using invisible chess as a benchmark for hidden state and deception, it argues for stricter testing, human oversight, and more cautious governance of high‐stakes AI systems.
Paolo Ciancarini
wiley +1 more source
Edge Odd Graceful Labeling of Some Ladder and Path Related Graphs
An edge odd graceful labeling of graph G with p vertices and q edges is a modular technique of edge labeling, introduced bySolairaju and Chithra in 2008 [9]. It is a bijection f from the edge set E(G) of the graph to {1, 3,…, 2q - 1} such that, when each
K Kanani Kailas, K Valani Darshana
core +1 more source
Graphic Groups, Graph Homomorphisms, and Graphic Group Lattices in Asymmetric Topology Cryptography. [PDF]
Zhao M, Wang H, Yao B.
europepmc +1 more source
This review redefines the carotid bulb (CB) as a variable geometric dilation shaped by hemodynamics and the carotid sinus (CS) as a conserved neurohistological baroreceptor field. Distinguishing these entities clarifies a century of anatomical confusion and links geometry, neurohistology, and clinical interpretation within a unified framework ...
Răzvan Costin Tudose +2 more
wiley +1 more source
vvrr1, a small RNA, post‐transcriptionally represses the transcriptional regulator LeuO, which directly inhibits the VarS/VarA two‐component system. This triggers a Csr cascade that relieves LuxO repression, ultimately modulating exopolysaccharide production to control biofilm formation and virulence in Vibrio alginolyticus.
Theerakamol Pengsakul +6 more
wiley +1 more source
Graceful Labeling on Grids in 3-Dimensions and 4-Dimensions
優美標號(Graceful labeling)最早是由Rosa在1966年提出。一個graph G上的端點標號(vertex labeling)所指的是一個vertex的函數f對應到一些數值(即標號),而G上的每一edge xy 被指定一個由f(x)和f(y)所決定的數值。如果這樣的一個f:V-->{0,1,...|E|}是單射,且指定 edge xy 的數值為|f(x)-f(y)|而所有的edge都被指定不同的數值,則f被稱為一個優美標號。 Rosa提出假說猜測所有的tree都有優美標號 ...
Chen, Yi-xian, 陳奕先
core

