Results 51 to 60 of about 426,579 (276)

Data-driven graph drawing techniques with applications for conveyor systems

open access: yesJournal of Mathematics in Industry, 2020
The visualization of conveyor systems in the sense of a connected graph is a challenging problem. Starting from communication data provided by the IT system, graph drawing techniques are applied to generate an appealing layout of the conveyor system ...
Simone Göttlich   +3 more
doaj   +1 more source

Fuzzy Implementation of Automatic Teaching of Hand-drawn Line Graph [PDF]

open access: yesJisuanji gongcheng, 2016
For the existing related works cannot be applied to automatic teaching of hand-drawn graph with high freedom degree,this paper proposes an automatic teaching method for fuzzy evaluation of line drawing quality based on open-loop and closed-loop line ...
CHEN Tongqian,DAI Yong,YUAN Dibo
doaj   +1 more source

Circulating tumor cell viability during and after radiotherapy mirrors treatment response in cancer patients

open access: yesMolecular Oncology, EarlyView.
Radiotherapy (RT) response depends on the DNA repair capacity of tumor and host cells. We show that circulating tumor cell (CTC) counts and apoptosis rates before and after RT predict treatment response and outcome, which can be accessed via easily accessible liquid biopsy approaches. Created in BioRender. Wikman, H.
Yvonne Goy   +10 more
wiley   +1 more source

Mycobacterial cell division arrest and smooth‐to‐rough envelope transition using CRISPRi‐mediated genetic repression systems

open access: yesFEBS Open Bio, EarlyView.
CRISPRI‐mediated gene silencing and phenotypic exploration in nontuberculous mycobacteria. In this Research Protocol, we describe approaches to control, monitor, and quantitatively assess CRISPRI‐mediated gene silencing in M. smegmatis and M. abscessus model organisms.
Vanessa Point   +7 more
wiley   +1 more source

Mental Map-Preserving Visualization through a Genetic Algorithm

open access: yesApplied Sciences, 2021
The video game industry has evolved significantly, with different genres becoming popular over time, but how to visualize such information by curating data into a form that makes it easier to identify and understand the trends is quite an interesting ...
Mojiborrahman Dehvari   +2 more
doaj   +1 more source

Recognizing and Drawing IC-planar Graphs

open access: yes, 2015
IC-planar graphs are those graphs that admit a drawing where no two crossed edges share an end-vertex and each edge is crossed at most once. They are a proper subfamily of the 1-planar graphs.
C Auer   +27 more
core   +1 more source

Single‐molecule DNA flow‐stretch assays for high‐throughput DNA–protein interaction studies

open access: yesFEBS Open Bio, EarlyView.
We describe an optimised single‐molecule DNA flow‐stretch assay that visualises DNA–protein interactions in real time. Linear DNA fragments are tethered to a surface and stretched by buffer flow for fluorescence imaging. Using λ and φX174 DNA, this protocol enhances reproducibility and accessibility, providing a versatile approach for studying diverse ...
Ayush Kumar Ganguli   +8 more
wiley   +1 more source

The maximum number of edges of bipartite 1-planar graphs with 1-disk drawings

open access: yesAKCE International Journal of Graphs and Combinatorics
A graph is 1-planar if it admits a drawing in the plane such that each edge is crossed at most once. Let G be a bipartite 1-planar graph with bipartition sets X and Y. A 1-disk [Formula: see text] drawing of G is a 1-planar drawing such that all vertices
Guiping Wang
doaj   +1 more source

PRIMAL: Page Rank-Based Indoor Mapping and Localization Using Gene-Sequenced Unlabeled WLAN Received Signal Strength

open access: yesSensors, 2015
Due to the wide deployment of wireless local area networks (WLAN), received signal strength (RSS)-based indoor WLAN localization has attracted considerable attention in both academia and industry.
Mu Zhou   +5 more
doaj   +1 more source

Bar 1-Visibility Drawings of 1-Planar Graphs

open access: yes, 2013
A bar 1-visibility drawing of a graph $G$ is a drawing of $G$ where each vertex is drawn as a horizontal line segment called a bar, each edge is drawn as a vertical line segment where the vertical line segment representing an edge must connect the ...
A.M. Dean   +13 more
core   +1 more source

Home - About - Disclaimer - Privacy