Results 161 to 170 of about 168,763 (311)

Map Generalization as a Graph Drawing Problem

open access: yes, 1995
A map may be regarded as a plane graph drawing; and, with the growth of the field of computer cartography, a map is increasingly treated as a straight-line plane graph drawing.
Alan Saalfeld, Saalfeld, Alan
core   +1 more source

Towards Defect Phase Diagrams: From Research Data Management to Automated Workflows

open access: yesAdvanced Engineering Materials, EarlyView.
A research data management infrastructure is presented for the systematic integration of heterogeneous experimental and simulation data required for defect phase diagrams. The approach combines openBIS with a companion application for large‐object storage, automated metadata extraction, provenance tracking and federated data access, thereby supporting ...
Khalil Rejiba   +5 more
wiley   +1 more source

Cliques in Graphs Excluding a Complete Graph Minor [PDF]

open access: yes, 2015
This paper considers the following question: What is the maximum number of k-cliques in an n-vertex graph with no Kt-minor? This question generalises the extremal function for Kt-minors, which corresponds to the k = 2 case.
David R. Wood, Wood, David R.
core  

Fostering Innovation: Streamlining Magnetocaloric Materials Research by Digitalization

open access: yesAdvanced Engineering Materials, EarlyView.
Magnetocaloric cooling (MCE) is an environmentally friendly refrigeration method with great potential. Optimizing MCE materials involves the preparation and screening of large quantities of samples, which in turn generates a large amount of data. A digitalization approach is presented that uses ontologies, knowledge graphs, and digital workflows to ...
Simon Bekemeier   +17 more
wiley   +1 more source

Exploring the chemodiversity of antimicrobial minalemines from Didemnum granulatum by neutral loss graph

open access: yesScientific Reports
In this study, we report on the identification of the active antimicrobial principles from the tunicate Didemnum granulatum. Two new natural products, minalemines G (1) and H (2), were isolated and their structures were elucidated.
Vítor F. Freire   +11 more
doaj   +1 more source

Tailoring Functional Properties of Ti–Ni–Cu Shape Memory Alloy Thin Films for MEMS Actuators

open access: yesAdvanced Engineering Materials, EarlyView.
A comprehensive study of critical parameters required to develop well‐performing Ti–Ni–Cu thin film shape memory alloy microactuators is provided. Materials science and device integration aspects are integrated by addressing structural and physical relationships using complementary characterization techniques as well as a practical fabrication solution
Elaheh Akbarnejad   +6 more
wiley   +1 more source

Centered colorings in minor-closed graph classes

open access: yes
International audienceA vertex coloring $φ$ of a graph $G$ is $p$-centered if for every connected subgraph $H$ of $G$, either $φ$ uses more than $p$ colors on $H$, or there is a color that appears exactly once on $H$.
La, Xuan Hoang   +3 more
core   +1 more source

Knowledge graph representation of the mappings between seizure semiology and epileptogenic zones

open access: yesScientific Reports
Precise epileptogenic zone (EZ) localization remains challenging for epilepsy surgery planning. While seizure semiology provides valuable localization information, subjective interpretation and inter-observer variability limit clinical utility.
Shihao Yang   +14 more
doaj   +1 more source

Recycling of NiTi Shape Memory Alloys: Fundamental and Technological Aspects of a Vacuum Induction Melting Processing Route

open access: yesAdvanced Engineering Materials, EarlyView.
The present study investigates recycling of NiTi shape memory alloys via vacuum induction melting. An ingot was synthesized from elemental Ni and Ti and subjected to three subsequent remelting cycles. Remelting increases process durations and impurity levels and adversely affects microstructures and functional properties.
Sakia Sophia Noorzayee   +7 more
wiley   +1 more source

Square Roots of Minor Closed Graph Classes

open access: yes, 2011
Let G be a graph class. The square root of G contains all graphs whose square belong in G. We prove that if G is non-trivial and minor closed, then all graphs in its square root have carving-width bounded by some constant depending only on G.
Thilikos, D.M., Nestoridis, N.V.
core  

Home - About - Disclaimer - Privacy