Results 81 to 90 of about 57,181 (227)

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

Matched Drawings of Planar Graphs [PDF]

open access: yesJournal of Graph Algorithms and Applications, 2008
Summary: A natural way to draw two planar graphs whose vertex sets are matched is to assign each matched pair a unique \(y\)-coordinate. In this paper we introduce the concept of such matched drawings, which is a relaxation of simultaneous geometric embeddings with mapping. We study which classes of graphs allow matched drawings and show that (i) two 3-
DI GIACOMO, Emilio   +4 more
openaire   +7 more sources

What Do Large Language Models Know About Materials?

open access: yesAdvanced Engineering Materials, EarlyView.
If large language models (LLMs) are to be used inside the material discovery and engineering process, they must be benchmarked for the accurateness of intrinsic material knowledge. The current work introduces 1) a reasoning process through the processing–structure–property–performance chain and 2) a tool for benchmarking knowledge of LLMs concerning ...
Adrian Ehrenhofer   +2 more
wiley   +1 more source

Drawing graphs on few lines and few planes

open access: yesJournal of Computational Geometry, 2020
We investigate the problem of drawing graphs in 2D and 3D such that their edges (or only their vertices) can be covered by few lines or planes.  We insist on straight-line edges and crossing-free drawings.
Steven Chaplick   +5 more
doaj   +1 more source

Graph-Drawing Contest Report

open access: yes, 2007
This report describes the Thirteenth Annual Graph Drawing Contest, held in conjunction with the 2006 Graph Drawing Symposium in Karlsruhe, Germany.
Klau, Gunnar W.   +7 more
core   +1 more source

Applying Graphical Design Techniques to Graph Visualisation [PDF]

open access: yes, 2005
This paper contains details of new criteria for graph layout, based on the concepts used in graphical design. Current graph layout criteria have been shown to be effective in measuring the quality of a graph layout, but they are ad-hoc and often miss ...
Rodgers, Peter, Taylor, Martyn
core   +1 more source

Drawing Graphs with GLEE [PDF]

open access: yes, 2008
This paper describes novel methods we developed to lay out graphs using Sugiyama's scheme [16] in a tool named GLEE. The main contributions are: a heuristic for creating a graph layout with a given aspect ratio, an efficient method of edge-crossings counting while performing adjacent vertex swaps, and a simple and fast spline routing algorithm.
Lev Nachmanson   +2 more
openaire   +1 more source

NFDI MatWerk Ontology (MWO): A BFO‐Compliant Ontology for Research Data Management in Materials Science and Engineering

open access: yesAdvanced Engineering Materials, EarlyView.
This article presents the NFDI‐MatWerk Ontology (MWO), a Basic Formal Ontology‐based framework for interoperable research data management in materials science and engineering (MSE). Covering consortium structures, research data management resources, services, and instruments, MWO enables semantic integration, Findable, Accessible, Interoperable, and ...
Hossein Beygi Nasrabadi   +4 more
wiley   +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

On drawing angle graphs [PDF]

open access: yes, 1995
An Angle graph is a graph with a fixed cyclic order of edges around each vertex and an angle specified for every pair of consecutive edges incident on each vertex. We study the problem of constructing a drawing of an angle graph that preserves its angles, and present several new results.
openaire   +1 more source

Home - About - Disclaimer - Privacy