Results 71 to 80 of about 1,421,171 (369)
Advanced Functional Materials, EarlyView.A multivalent antiviral platform based on honeycomb‐shaped DNA nanostructures (HC–Urumin) is developed to enhance the potency and breadth of the host defense peptide Urumin. Through spatially patterned trimeric presentation, HC–Urumin disrupts influenza A virus entry, improves cell viability, and reduces disease severity in vivo‐offering a modular and ...
Saurabh Umrao +11 more
wiley +1 more source
Clover: a clustering-oriented de novo assembler for Illumina sequences
BMC Bioinformatics, 2020 Background Next-generation sequencing technologies revolutionized genomics by producing high-throughput reads at low cost, and this progress has prompted the recent development of de novo assemblers.
Ming-Feng Hsieh +2 more
doaj +1 more source
Enumerating Grid Layouts of Graphs
Journal of Graph Algorithms and Applications, 2020 We study algorithms that generate layouts of graphs with $n$ vertices in a square grid with $\nu$ points, where adjacent vertices in the graph are also close in the grid. The problem is motivated by graph drawing and factory layout planning. In the latter application, vertices represent machines, and edges join machines that should be placed next ...
openaire +2 more sources
Advanced Functional Materials, EarlyView.A W/NbOx/Pt memristor demonstrates the coexistence of volatile, non‐volatile, and threshold switching characteristics. Volatile switching serves as a reservoir computing layer, providing dynamic short‐term processing. Non‐volatile switching, stabilized through ISPVA, improves reliable long‐term readout. Threshold switching operates as a leaky integrate
Ungbin Byun, Hyesung Na, Sungjun Kim
wiley +1 more source
Layout of Graphs with Bounded Tree-Width
, 2004 A \emph{queue layout} of a graph consists of a total order of the vertices, and a partition of the edges into \emph{queues}, such that no two edges in the same queue are nested. The minimum number of queues in a queue layout of a graph is its \emph{queue-
Albertson Michael +10 more
core +2 more sources
Artificial Intelligence as the Next Visionary in Liquid Crystal Research
Advanced Functional Materials, EarlyView.The functions of AI in the research laboratory are becoming increasingly sophisticated, allowing the entire process of hypothesis formulation, material design, synthesis, experimental design, and reiterative testing to be automated. In our work, we conceive how the incorporation of AI in the laboratory environment will transform the role and ...
Mert O. Astam +2 more
wiley +1 more source
Distributed Graph Layout for Sensor Networks [PDF]
Journal of Graph Algorithms and Applications, 2005 Summary: Sensor network applications frequently require that the sensors know their physical locations in some global coordinate system. This is usually achieved by equipping each sensor with a location measurement device, such as GPS. However, low-end systems or indoor systems, which cannot use GPS, must locate themselves based only on crude ...
Gotsman, Craig, Koren, Yehuda
openaire +2 more sources
Advanced Functional Materials, EarlyView.Cuttlebone‐inspired metamaterials exploit a septum‐wall architecture to achieve excellent mechanical and functional properties. This review classifies existing designs into direct biomimetic, honeycomb‐type, and strut‐type architectures, summarizes governing design principles, and presents a decoupled design framework for interpreting multiphysical ...
Xinwei Li, Zhendong Li
wiley +1 more source
Representing Space: A Hybrid Genetic Algorithm for Aesthetic Graph Layout [PDF]
, 1998 This paper describes a hybrid Genetic Algorithm (GA) that is used to improve the layout of a graph according to a number of aesthetic criteria.
Hobbs, M.H.W., Rodgers, Peter
core +1 more source
Column-Based Graph Layouts [PDF]
, 2013 We consider orthogonal upward drawings of directed acyclic graphs (DAGs) with nodes of uniform width but node-specific height. One way to draw such graphs is to use a layering technique as provided by the Sugiyama framework [10]. However, to avoid drawbacks of the Sugiyama framework we use the layer-free upward crossing minimization algorithm suggested
Betz, Gregor +4 more
openaire +1 more source