Results 71 to 80 of about 96,099 (217)
Inverse Design of Mirror‐Symmetric Disordered Systems for Broadband Perfect Transmission
Laser &Photonics Reviews, Volume 20, Issue 11, 5 June 2026.This work introduces an inverse design approach to achieve broadband perfect wave transmission in mirror‐symmetric disordered media. Leveraging symmetry simplifies optimization and enables control of multiple reflectionless states. Experiments in microwave waveguides confirm the design of exceptional points, bandpass filters, and broadband quasi ...
Zhazira Zhumabay +4 more
wiley +1 more source
Note on the upper bound of the rainbow index of a graph [PDF]
, 2014 A path in an edge-colored graph $G$, where adjacent edges may be colored the same, is a rainbow path if every two edges of it receive distinct colors. The rainbow connection number of a connected graph $G$, denoted by $rc(G)$, is the minimum number of ...
Cai, Qingqiong, Li, Xueliang, Zhao, Yan
core
Rapid Communications in Mass Spectrometry, EarlyView.ABSTRACT Rationale Ions trapped within a Penning cell (ICR) travel periodic orbits whose frequencies are dependent on their mass‐to‐charge ratio and the value of the magnetic field passing through the trap. Fourier transformation (FT‐ICR) decomposes the signal induced in the detection circuit by the rotation of the ions in the cell after the ...
Patrick Arpino, Michel Heninger
wiley +1 more source
Redefining Optimal Coverage Path Planning for FLS‐Equipped AUVs With Deep Reinforcement Learning
Journal of Field Robotics, EarlyView.ABSTRACT Autonomous Underwater Vehicles (AUVs) have emerged as indispensable tools for a variety of subsea tasks, from habitat monitoring and seabed mapping to infrastructure inspection and mine countermeasures. A fundamental challenge in this field is Coverage Path Planning (CPP), the problem of ensuring complete and efficient area coverage.
Lorenzo Cecchi +3 more
wiley +1 more source
River Research and Applications, EarlyView.ABSTRACT Regulated rivers represent complex hydrological systems where groundwater–surface water interactions are governed by natural conditions and human interventions. This study investigates the spatiotemporal dynamics of groundwater–surface water exchanges in the Nechako River, British Columbia (Canada), using numerical simulations.
Milad Fakhari +4 more
wiley +1 more source
Note on minimally $k$-rainbow connected graphs [PDF]
, 2012 An edge-colored graph $G$, where adjacent edges may have the same color, is {\it rainbow connected} if every two vertices of $G$ are connected by a path whose edge has distinct colors.
Li, Hengzhe +3 more
core
Optical‐controlled magnon transport based on spin crossover switched molecular magnets
Smart Molecules, EarlyView.A cyanide‐bridged W(V)–Fe(II) spin‐crossover single crystal was integrated into a magnon transport device, enabling reversible optical control of magnon transport through photo‐switched spin states. Abstract Molecule‐based devices that combine the advantages of fast time response and extremely low manipulation/transmission energy consumption of light ...
Yu‐Jing Gao +5 more
wiley +1 more source
Rainbow Connection Number of Dense Graphs
Discussiones Mathematicae Graph Theory, 2013 An edge-colored graph G is rainbow connected, if any two vertices are connected by a path whose edges have distinct colors. The rainbow connection number of a connected graph G, denoted rc(G), is the smallest number of colors that are needed in order to ...
Li Xueliang +2 more
doaj +1 more source
On strong rainbow connection number [PDF]
, 2010 A path in an edge-colored graph, where adjacent edges may be colored the same, is a rainbow path if no two edges of it are colored the same. For any two vertices $u$ and $v$ of $G$, a rainbow $u-v$ geodesic in $G$ is a rainbow $u-v$ path of length $d(u,v)
Li, Xueliang, Sun, Yuefang
core
CAAI Transactions on Intelligence Technology, EarlyView.ABSTRACT Large language models (LLMs) have made remarkable advances in natural language processing, demonstrating great potential in modelling structured sequences. However, adapting these capabilities to machine gaming tasks such as Go remains challenging due to limitations in strategy generalisation and optimisation efficiency.
Xiali Li +5 more
wiley +1 more source