Results 71 to 80 of about 20,159 (298)

Normal‐Appearing White Matter Injury Mediates Chronic Deep Venous Hypoxia and Disease Progression in Multiple Sclerosis

open access: yesAnnals of Clinical and Translational Neurology, EarlyView.
ABSTRACT Objective To explore how cerebral hypoxia and Normal‐Appearing White Matter (NAWM) integrity affect MS lesion burden and clinical course. Methods Seventy‐nine MS patients, including 13 clinically isolated syndrome (CIS) patients and 66 relapsing–remitting multiple sclerosis (RRMS) patients, and 44 healthy controls (HCs) were recruited from ...
Xinli Wang   +8 more
wiley   +1 more source

Halogen Bonding in (Z)-2-Iodocinnamaldehyde

open access: yesMolecules, 2013
Based on the bulkiness of the iodine atom, a non-planar conformation was expected for the title compound. Instead, its molecular structure is planar, as experimentally determined using single crystal X-ray diffraction, and confirmed theoretically by DFT ...
Miriam Rossi   +3 more
doaj   +1 more source

Constrained Planarity in Practice -- Engineering the Synchronized Planarity Algorithm

open access: yes, 2023
In the constrained planarity setting, we ask whether a graph admits a planar drawing that additionally satisfies a given set of constraints. These constraints are often derived from very natural problems; prominent examples are Level Planarity, where ...
Fink, Simon D., Rutter, Ignaz
core   +1 more source

Planar Solid‐State Nanopores Toward Scalable Nanofluidic Integration Based on CMOS Technology

open access: yesAdvanced Engineering Materials, EarlyView.
We present a scalable silicon‐based fabrication strategy for planar solid‐state nanopores to enable their integration with complex nanofluidic systems. Prototype devices demonstrate normal voltage‐current characteristics, good noise performance, and appreciable streaming currents. Our CMOS‐compatible fabrication process offers precise geometric control
Ngan Hoang Pham   +7 more
wiley   +1 more source

On the Planarity of Generalized Line Graphs

open access: yesTheory and Applications of Graphs, 2019
One of the most familiar derived graphs is the line graph. The line graph $L(G)$ of a graph $G$ is that graph whose vertices are the edges of $G$ where two vertices of $L(G)$ are adjacent if the corresponding edges are adjacent in~$G$.
Khawlah H. Alhulwah   +2 more
doaj   +1 more source

On the Lightweight Potential of Laser Additive Manufactured NiTi Triply Periodic Minimal Sheet Lattices

open access: yesAdvanced Engineering Materials, EarlyView.
This study explores the lightweight potential of laser additive‐manufactured NiTi triply periodic minimal surface sheet lattices. It systematically investigates the effects of relative density and unit cell size on surface quality, deformation recovery, compression behavior, and energy absorption.
Haoming Mo   +3 more
wiley   +1 more source

Additional PC-Tree Planarity Conditions

open access: yes, 2004
Recent research efforts have produced new algorithms for solving planarity-related problems. One such method performs vertex addition using the PC-tree data structure, which is similar to but simpler than the well-known PQ-tree.
Boyer, John M., John M. Boyer
core   +1 more source

Tailored Hierarchical Porous Copper Architectures via Three Dimensional Printing and Pressure‐less Sintering for Next‐Generation Lithium‐Metal Batteries

open access: yesAdvanced Engineering Materials, EarlyView.
A hierarchical porous copper current collector is fabricated via three‐dimensional printing combined with pressureless sintering to stabilize lithium metal anodes. The interconnected architecture lowers local current density, guides uniform Li deposition within pores, and suppresses dendrite growth.
Alok Kumar Mishra, Mukul Shukla
wiley   +1 more source

On the planarity of line Mycielskian graph of a graph

open access: yesRatio Mathematica, 2020
The line Mycielskian graph of a graph G, denoted by Lμ(G) is defined as the graph obtained from L(G) by adding q+1 new vertices E' = ei' : 1 ≤  i ≤  q and e, then for 1 ≤  i ≤  q , joining ei' to the neighbours of ei  and  to e.
Keerthi G. Mirajkar   +1 more
doaj   +1 more source

Clustered Level Planarity

open access: yes, 2004
Planarity is an important concept in graph drawing. It is generally accepted that planar drawings are well understandable. Recently, several variations of planarity have been studied for advanced graph concepts such as k-level graphs and clustered graphs.
Michael Forster, Christian Bachmaier
core   +1 more source

Home - About - Disclaimer - Privacy