Results 121 to 130 of about 1,064,288 (288)

Graphs of Unitary Matrices and Positive Semidefinite Zero Forcing

open access: yes, 2013
The possible zero/nonzero patterns of unitary matrices are of interest in quantum evolution and the study of quantum systems on graphs. In particular, a quantum random walk can be defined on a directed graph if and only if that graph is associated with a
Mitchell, Lon   +2 more
core   +1 more source

Elastic–Plastic Modeling and Experimental Characterization of Granular Jamming Actuators

open access: yesAdvanced Engineering Materials, EarlyView.
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

Graph Coloring, Zero Forcing, and Related Problems

open access: yes, 2017
This work was also published as a Rice University thesis/dissertation.This thesis investigates several problems related to classical and dynamic coloring of graphs, and enumeration of graph attributes.
Brimkov, Boris
core  

Rigid Linkages and Partial Zero Forcing [PDF]

open access: yes, 2018
Connections between vital linkages and zero forcing are established. Specifically, the notion of a rigid linkage is introduced as a special kind of unique linkage and it is shown that spanning forcing paths of a zero forcing process form a spanning rigid
Flagg, Mary   +10 more
core  

Interference Cancellation Techniques in Heterogeneous Networks

open access: yesFoundations of Computing and Decision Sciences, 2018
The fifth generation (5G) cellular wireless networks are heterogeneous networks that will provide higher data rates, enhanced quality-of-experience (QoE) and reduced latency. Interference is one of the main problems in such systems.
Imam Sarah, El-Mahdy Ahmed
doaj   +1 more source

Influence of Particle Shape and Size in Copper‐Based Low‐Temperature Metallization Paste for Solar Cells

open access: yesAdvanced Engineering Materials, EarlyView.
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

Investigation of Resonance Characteristics of More Than 10 000 Metal‐Coated Silicon MEMS Cantilevers Using Machine Learning

open access: yesAdvanced Engineering Materials, EarlyView.
More than 10 000 metal‐coated silicon MEMS cantilevers are fabricated and characterized to build a large‐scale experimental dataset spanning multiple vibrational modes. Machine learning algorithms are benchmarked to predict resonance frequency and quality factor, with ensemble based models achieving accuracy approaching experimental uncertainty.
Sina Zare Pakzad   +8 more
wiley   +1 more source

Fully Additive Vertical Organic Electrochemical Transistors on Renewable and Compostable Substrates Enable Ultrasensitive Bioelectronics

open access: yesAdvanced Functional Materials, EarlyView.
Fully additive vertical organic electrochemical transistors (vOECTs) with channel‐length of 226 nm on a 50 µm compostable substrate achieve >106 current modulation and ∼36 mS transconductance. Ion‐selective integration enables 1.1 mA dec−1 sensitivity and 36 µm detection limit, highlighting a scalable platform for sustainable electronics and ...
Giulia Frusconi   +3 more
wiley   +1 more source

Zero forcing in iterated line digraphs

open access: yes, 2019
Zero forcing is a propagation process on a graph, or digraph, defined in linear algebra to provide a bound for the minimum rank problem. Independently, zero forcing was introduced in physics, computer science and network science, areas where line ...
Thomas Kalinowski (21272096)   +2 more
core  

Hypergraph burning, matchings, and zero forcing

open access: yesTheoretical Computer Science
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

Home - About - Disclaimer - Privacy