Results 111 to 120 of about 1,421,171 (369)
Printed 2.5D‐Microstructures with Material‐Specific Functionalization for Tunable Biosensing
The 2.5D‐MiSENSE platform integrates a microstructured biosensor with an in‐line milking pipeline to enable real‐time detection of mastitis biomarkers during active milk flow. The system uses a 2.5D microengineered surface and patterned electrodes to enhance milk–sensor interaction.
Matin Ataei Kachouei +2 more
wiley +1 more source
In this paper we survey the recent results and open questions about some graph layout problems.
openaire +3 more sources
On graph-based design of floor layouts
Knowledge-based tools assisting the designer in engineering represent further improvement of expert systems. The present paper shows how such software can be developed in the particular domain of floor layout design for buildings.
Adam Borkowski +2 more
doaj +1 more source
Graph layout for applications in compiler construction [PDF]
We address graph visualization from the viewpoint of compiler construction. Most data structures in compilers are large, dense graphs such as annotated control flow graph, syntax trees, dependency graphs.
Sander, Georg
core +1 more source
Circularly Polarized Structural Color Pigments Tunable Across the Full Visible Spectrum
By infusing black dye into spherical shells of polymerized cholesteric liquid crystal, blue, green and red omnidirectional retroreflectors of circularly polarized structural color are achieved. They can be laid out on arbitrary surfaces without any need for index matching binder to define graphical information for robots and Augmented Reality devices ...
Deniz Işınsu Avşar +1 more
wiley +1 more source
Sub-exponential Time Parameterized Algorithms for Graph Layout Problems on Digraphs with Bounded Independence Number. [PDF]
Misra P, Saurabh S, Sharma R, Zehavi M.
europepmc +1 more source
The term layout problem was introduced in the context of Very Large-Scale Integration (VLSI) circuit design. Their main objective is to project an original graph onto a predefined host graph with a well-known topology, such as a path, cycle, or grid graph, among others.
Sergio Cavero +3 more
openaire +1 more source
Graph Exploration With Embedding-Guided Layouts
Node-link diagrams are widely used to visualize graphs. Most graph layout algorithms only use graph topology for aesthetic goals (e.g., minimize node occlusions and edge crossings) or use node attributes for exploration goals (e.g., preserve visible communities).
Leixian Shen +3 more
openaire +3 more sources
Graph Layout with Versatile Boundary Constraints
Graph layouts are in general data dependent and help to reveal structural and attribute relationships in the data set. However, there are situations when one may wish to alter the layout e.g. to emphasize parts of the data set or for aesthetic reasons. This paper strives to meet that need for the case of force-directed graph layout algorithms.
Zhang, Yani, Pang, Alex
openaire +2 more sources
Improving Layered Graph Layouts with Edge Bundling [PDF]
We show how to improve the Sugiyama scheme by edge bundling. Our method modifies the layout produced by the Sugiyama scheme by bundling some of the edges together. The bundles are created by a new algorithm based on minimizing the total ink needed to draw the graph edges.
Pupyrev, S. +2 more
openaire +3 more sources

