Results 211 to 220 of about 230,604 (269)
Metasurface‐Enabled Active‐Like Passive Radar
A programmable space‐time‐coding metasurface embeds distinct spatiotemporal tags into ambient wireless signals, allowing passive radar to operate in an active‐like manner. By enabling code‐correlated reconstruction under interference, the approach supports robust real‐time UAV tracking in complex environments and points to intelligent, low‐power ...
Mingyi Li +7 more
wiley +1 more source
Reverse Weak Polarity‐Induced Ordered Layer Control strategy, optimizing the design of layered structures, has been successfully designed. By leveraging inhomogeneous field of units to replace isotropic fields of metal cations, polar layers realize controllable layer stacking via a “layer→linker→layer” polarity transfer.
Lingli Wu +7 more
wiley +1 more source
To overcome two‐dimensional modulation bottlenecks, Hadamard Matrix Slicing Single‐Pixel Imaging (HMS‐SPI) establishes an efficient one‐dimensional imaging paradigm. By slicing the traditional Hadamard matrix into one‐dimensional encoding vectors and spatially expanding them, the required measurement patterns decrease by a factor of N.
Xiaoxue Li +8 more
wiley +1 more source
A Plug‐and‐Play Platform for Customizing Multivalent Degraders and Degrader‐Drug Conjugates
Membrane proteins remain challenging targets for conventional TPD approaches. Here, the authors develop UPTAB, a modular platform leveraging ultrahigh‐affinity orthogonal Im/CL protein pairs for lysosomal degradation of membrane proteins. Mono‐targeted (Type‐I), dual‐targeted (Type‐II), and tri‐targeted (Type‐III) UPTABs enable simultaneous degradation
Mengqing Zhao +7 more
wiley +1 more source
Geometry‐Controlled Assembly of Self‐Standing Nanorods With Undisturbed Plasmonics
This study reports a geometry‐driven assembly strategy to vertically align Au@Ag core–shell nanorods on PS beads. This well‐defined architecture enables the preservation of the intrinsic optical response of individual nanorods. Thus, demonstrate a highly reproducible SERS enhancement with exceptional uniformity.
Yoel Negrin‐Montecelo +5 more
wiley +1 more source
Some of the next articles are maybe not open access.
Related searches:
Related searches:
Graphs and Combinatorics, 2011
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
L. Sunil Chandran +2 more
openaire +3 more sources
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
L. Sunil Chandran +2 more
openaire +3 more sources
SIAM Journal on Algebraic Discrete Methods, 1983
The authors present a number of results on comparison of the topological bandwidth of a graph to other graphical invariant, such as cutwidth, modified cutwidth, search number, and node search number. For binary trees of order n, a 0(n log n) algorithm to compute their topological bandwidth is obtained.
Fillia Makedon +2 more
openaire +2 more sources
The authors present a number of results on comparison of the topological bandwidth of a graph to other graphical invariant, such as cutwidth, modified cutwidth, search number, and node search number. For binary trees of order n, a 0(n log n) algorithm to compute their topological bandwidth is obtained.
Fillia Makedon +2 more
openaire +2 more sources
Adaptive bandwidth binning for bandwidth management
Computer Networks, 2019Abstract In this paper, we present a novel bandwidth management scheme that we call adaptive bandwidth binning (ABB). ABB is presented in the context of a DOCSIS cable network, but it has obvious applicability to downstream service on any shared medium access network in which all downstream traffic is scheduled by a single headend device such as a ...
Gongbing Hong +2 more
openaire +1 more source
Algorithmica, 2001
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Edward G. Coffman Jr. +1 more
openaire +2 more sources
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Edward G. Coffman Jr. +1 more
openaire +2 more sources
Computing, 1983
The main results of this paper establish relationships between the bandwidth of a graphG — which is the minimum over all layouts ofG in a line of the maximum distance between images of adjacent vertices ofG — and the ease of playing various pebble games onG.
Arnold L. Rosenberg, Ivan Hal Sudborough
openaire +2 more sources
The main results of this paper establish relationships between the bandwidth of a graphG — which is the minimum over all layouts ofG in a line of the maximum distance between images of adjacent vertices ofG — and the ease of playing various pebble games onG.
Arnold L. Rosenberg, Ivan Hal Sudborough
openaire +2 more sources

