Results 121 to 130 of about 783,181 (348)
Large‐Area Flat Optics Color Routing in Tilted Arrays of 2D Semiconductor Nanostripes
Advanced Optical Materials, EarlyView.We develop a scalable flat optics platform exploiting self‐organised ion‐beam sputtering and maskless glancing‐angle deposition to fabricate centimetre‐scale arrays of tilted MoS2 nanostripes. The engineered geometry activates Rayleigh anomalies, guided modes, and Mie resonances, enabling highly directional color routing and enhanced light harvesting ...
Simone Di Marco +7 more
wiley +1 more source
Perfect Circle's Plant in Richmond, Indiana
, 1940 Luvena Dethridge sang in concerts while holding various jobs. After working at Reid Memorial Hospital as a cook, laundress, and maid, she worked as a piston inspector for the Perfect Circle plant in Richmond in the 1940s. A contract for a concert in 1945
Perfect Circle Company
core
A characterization of star-perfect graphs
AKCE International Journal of Graphs and CombinatoricsMotivated by Berge perfect graphs, we define star-perfect graphs and characterize them. For a finite simple graph G(V, E), let [Formula: see text] denote the minimum number of induced stars contained in G such that the union of their vertex sets is V(G),
G Ravindra +3 more
doaj +1 more source
Grounding Large Language Models for Robot Task Planning Using Closed‐Loop State Feedback
Advanced Robotics Research, EarlyView.BrainBody‐Large Language Model (LLM) introduces a hierarchical, feedback‐driven planning framework where two LLMs coordinate high‐level reasoning and low‐level control for robotic tasks. By grounding decisions in real‐time state feedback, it reduces hallucinations and improves task reliability.
Vineet Bhat +4 more
wiley +1 more source
Distance perfectness of graphs
Discussiones Mathematicae Graph Theory, 1999 The author introduces a new generalization of perfect graphs. It turns out that the analogue of the weak perfect graph theorem is not true for this generalization. A subset \(Q\) of the vertex set \(V\) of a graph \(G\) is a \(k\)-distance clique in \(G\) if \(d_G(x,y)\leq k\) for any \(x,y\in Q\) and \(\langle Q\rangle_G\), the subgraph of \(G ...
openaire +1 more source
Advanced Robotics Research, EarlyView.This study explores how information processing is distributed between brains and bodies through a codesign approach. Using the “backpropagation through soft body” framework, brain–body coupling agents are developed and analyzed across several tasks in which output is generated through the agents’ physical dynamics.
Hiroki Tomioka +3 more
wiley +1 more source
On the perfect graph conjecture
Discrete Mathematics, 1976 We prove the following theorem: If every, odd cycle of length ≥5 has at least two chords, then the graph is perfect. This generalizes a result of Gallai and Suranyi and also a result of Olaru and Sachs.
openaire +2 more sources
Advanced Robotics Research, EarlyView.An enhanced universal gripper combining rigid mechanics with self‐adaptable fingers is presented for industrial automation. The novel six‐bar linkage with integrated compliant pad eliminates mechanical interference while enabling passive shape adaptation.
Muhammad Usman Khalid +7 more
wiley +1 more source
A structure theorem for graphs with no cycle with a unique chord and its consequences [PDF]
We give a structural description of the class C of graphs that do not contain a cycle with a unique chord as an induced subgraph. Our main theorem states that any connected graph in C is a either in some simple basic class or has a decomposition.
Nicolas Trotignon, Kristina Vuskovic
core
New Results on Minimal Strongly Imperfect Graphs [PDF]
Scientific Annals of Computer Science, 2008 The characterization of strongly perfect graphs by a restricted list of forbidden induced subgraphs has remained an open question for a long time. The minimal strongly imperfect graphs which are simultaneous imperfect are only odd holes and odd antiholes
V. Anastasoaei, E. Olaru
doaj