Results 101 to 110 of about 1,075,663 (288)
Multicarrier CDMA (MC-CDMA) has become a promising candidate for future wireless multimedia communications for its robustness to frequency-selective fading and its flexibility for handling multiple data rates.
Ibars Christian +2 more
doaj +1 more source
Entropy‐Driven Design of Low‐Melting‐Point Alloys via Compositionally Complex Strategy
Conventional low‐melting‐point alloys (LMPAs) are limited by a narrow compositional space and inherent property trade‐offs. This review presents an entropy‐driven design strategy that overcomes these limitations, ushering in a new class of low‐melting‐point compositionally complex alloys (LMCCAs).
Yinghui Shang +6 more
wiley +1 more source
Hypergraph burning, matchings, and zero forcing
Lazy burning is a recently introduced variation of burning where only one set of vertices is chosen to burn in the first round. In hypergraphs, lazy burning spreads when all but one vertex in a hyperedge is burned. The lazy burning number is the minimum number of initially burned vertices that eventually burns all vertices.
Anthony Bonato +4 more
openaire +2 more sources
Investigating the Low‐Temperature Phase Stability of the Binary Ta–W System
Atomistic simulations show that the binary Ta–W system forms ordered intermetallic phases, B2‐TaW and D03‐TaW3, as 0 K ground states. Configurational entropy, however, lowers the free energy of the disordered bcc solid solution, which becomes the stable phase above about 400 K.
Klemens Lechner +7 more
wiley +1 more source
DDPG-Based Optimization for Zero-Forcing Transmission in UAV-Relay Massive MIMO Networks
This study explores the advantages of employing an unmanned aerial vehicle (UAV) in a massive multiple-input multiple-output (MIMO) network with zero-forcing processing at the base station (BS).
Mai T. P. Le +3 more
doaj +1 more source
We initiate the study of transmission zero forcing, a variant of the well-studied zero forcing graph parameter. In this variant, a subset of vertices is assigned an initial unit weight, and these vertices can increase the weight of a neighbor subject to the zero forcing color change rule at a rate determined by the transmission proportion.
Berliner, Adam H. +5 more
openaire +2 more sources
Complexity and Computation of Connected Zero Forcing
Zero forcing is an iterative graph coloring process whereby a colored vertex with a single uncolored neighbor forces that neighbor to be colored. It is NP-hard to find a minimum zero forcing set - a smallest set of initially colored vertices which forces the entire graph to be colored. We show that the problem remains NP-hard when the initially colored
openaire +3 more sources
Elastic–Plastic Modeling and Experimental Characterization of Granular Jamming Actuators
Granular jamming enables rapid switching between soft and rigid mechanical states. Here, a reduced‐order elastic‐perfectly‐plastic beam framework captures pressure‐dependent loading, unloading, residual deformation, and hysteresis in jammed beams, while matching three‐point bending experiments across materials and geometries. The framework links design
Saheli Patel +2 more
wiley +1 more source
Low Complexity Wireless Powered Information Transfer Strategy for Multiuser MIMO Systems
In this paper, the minimum achievable rate maximization problem for wireless-powered multiple users is investigated. Zero-forcing (ZF)-based precoding is considered for information transmission (IT) in the uplink from multi-antenna users to a multi ...
Jihoon Choi, Jingon Joung
doaj +1 more source
Particle morphology controls the balance between printability and electrical connectivity in low‐temperature AgCu/Ag metallization pastes. Flake‐shaped AgCu particles form extended low‐resistance contacts, whereas spherical particles favor processability at high metal loading. Fine Ag particles further tune void filling and conductive‐network formation
O. Mhirsi +3 more
wiley +1 more source

