Results 71 to 80 of about 83,874 (238)

Modeling Electrical Transport in Random Networks Composed of Metal‐Oxide Nanowires: The Transition from Junction‐Dominated to Nanowire‐Dominated Regime

open access: yesAdvanced Theory and Simulations, EarlyView.
This study proposes a model for the electrical transport properties of random networks of metal oxide nanowires. Based on the characteristic lengths and energies of nanowires, it allows for discussing the transition from the junction‐dominated to the nanowire‐dominated transport regime.
Andrea Ponzoni
wiley   +1 more source

APUD(1,1) Recognition in Polynomial Time

open access: yes, 2022
A unit disk graph is the intersection graph of a set of disk of unit radius in the Euclidean plane. In 1998, Breu and Kirkpatrick showed that the recognition problem for unit disk graphs is NP-hard. Given $k$ horizontal and $m$ vertical lines, an APUD($k,
Çağırıcı, Deniz Ağaoğlu   +1 more
core  

De Novo Reconstruction of 3D Human Facial Images from DNA Sequence

open access: yesAdvanced Science, EarlyView.
This study introduces Difface, a novel deep‐learning model for reconstructing 3D facial images only from DNA data. By integrating transformer networks, spiral convolutions, and a diffusion model, Difface directly aligns high‐dimensional SNP data with 3D facial structures.
Mingqi Jiao   +11 more
wiley   +1 more source

Enhancing Grasping Function with a Thermoresponsive Ionogel Adhesive Glove for Patients with Rheumatic Diseases

open access: yesAdvanced Science, EarlyView.
This study presents a novel portable grasp‐assist glove, weighing only 47 g. The glove integrates smart adhesive pads and a hands‐free control interface based on IMU, designed to aid rheumatic patients with impaired hand function. The system enables switchable adhesion with independent control and detection of user release intent.
Shiqiang Wang   +11 more
wiley   +1 more source

On full Steiner trees in unit disk graphs

open access: yesComputational Geometry, 2015
Given an edge-weighted graph G = ( V , E ) and a subset R of V, a Steiner tree of G is a tree which spans all the vertices in R. A full Steiner tree is a Steiner tree which has all the vertices of R as its leaves. The full Steiner tree problem is to find a full Steiner tree of G with minimum weight.
Michiel Smid   +2 more
openaire   +2 more sources

Sugar Functionalized Collagen Material for Local Modulation of Innate Immunity

open access: yesAdvanced Science, EarlyView.
Modulation of the innate immune response at the implant site can significantly influence adaptive immunity. A mannose‐functionalized collagen patch, termed the Local Immunotuning Patch (LIP), has been designed to engage mannose receptors on antigen‐presenting cells while exhibiting antibacterial properties. LIP orchestrates complex immune pathways that
Francesca Taraballi   +10 more
wiley   +1 more source

Neophytadiene, a Plant Specialized Metabolite, Mediates the Virus‐Vector‐Plant Tripartite Interactions

open access: yesAdvanced Science, EarlyView.
Tomato chlorosis virus (ToCV) infection induces production of neophytadiene, a volatile resulting from chlorophyll degradation that is highly attractive to whiteflies. OBP2, an odorant‐binding protein from insect vector B. tabaci, exhibits a strong binding affinity for neophytadiene.
Xiao‐bin Shi   +14 more
wiley   +1 more source

Improper colouring of unit disk graphs [PDF]

open access: yes, 2007
Motivated by a satellite communications problem, we consider a generalised colouring problem on unit disk graphs. A colouring is k -improper if no vertex receives the same colour as k +1 of its neighbours. The k -improper chromatic number chi_k (G) is the least number of colours needed in a k -improper colouring of a graph G.
Havet, Frédéric   +2 more
openaire   +1 more source

Approximating 2-cliques in unit disk graphs

open access: yesDiscrete Applied Mathematics, 2014
This paper studies distance-based clique relaxations in unit disk graphs arising in wireless networking applications. Namely, a 2-clique is a subset of nodes with pairwise distance at most two in the graph, and a 2-club is a subset of nodes inducing a subgraph of diameter two.
Sergiy Butenko   +2 more
openaire   +2 more sources

A Live Cell Imaging‐Compatible Bioreactor for the Interrogation of Cellular Responses to Modulated Flow Conditions

open access: yesAdvanced Science, EarlyView.
An open‐source, low‐cost 3D perfusion system integrating bioprinted scaffolds and live‐imaging overcomes 2D culture limitations. Modeling the cerebrospinal fluid‐filled subarachnoid space, it reveals flow‐dependent focal adhesion kinase activation in meningothelial cells, demonstrating a powerful platform for studying mechanobiology and creating ...
Subashree Srinivasan   +7 more
wiley   +1 more source

Home - About - Disclaimer - Privacy