Results 71 to 80 of about 63,549 (264)

Grain Refinement During Severe Plastic Deformation and Similitude of Subgrain Formation: A Molecular Dynamics Study

open access: yesAdvanced Engineering Materials, EarlyView.
Molecular dynamics is used to investigate structure refinement during severe plastic deformation. The results show similitude with experimental data. Molecular dynamics simulations of severe plastic deformation of monocrystalline and polycrystalline samples by multiaxial compression of aluminum are carried out.
Roberto B. Figueiredo
wiley   +1 more source

A method of ranking scientific publications according to their degree of importance

open access: yesУчёные записки Казанского университета: Серия Физико-математические науки
Scientific publications play a crucial role in the exchange of information among scientists. Due to ongoing technological progress and digitalization in all fields, the already large volume of scientific information, both in the form of publications and ...
A. M. Elizarov, I. G. Olgina
doaj   +1 more source

Interactive Graph Data Integration System With Spatial-Oriented Visualization and Feedback-Driven Provenance

open access: yesIEEE Access, 2019
This paper proposes new techniques in a visualization-enabled graph data quality assessment and alignment system leveraging feedback-driven provenance with goal of improving scalability, reducing execution time, and increasing relevance.
Kuldeep Reddy
doaj   +1 more source

Oriented diameter and rainbow connection number of a graph [PDF]

open access: yesDiscrete Mathematics & Theoretical Computer Science, 2014
Graph ...
Xiaolong Huang   +3 more
doaj   +1 more source

Even Orientations and Pfaffian graphs [PDF]

open access: yesBull. ICA, 2015
We give a characterization of Pfaffian graphs in terms of even orientations, extending the characterization of near bipartite non--pfaffian graphs by Fischer and Little \cite{FL}. Our graph theoretical characterization is equivalent to the one proved by Little in \cite{L73} (cf. \cite{LR}) using linear algebra arguments.
Abreu M.   +3 more
openaire   +5 more sources

Swelling‐Programmed Topographical Guidance for Dynamic Spheroid Self‐Assembly via a Mechanochemical Hydrogel Niche

open access: yesAdvanced Functional Materials, EarlyView.
A swelling‐programmed micropatterned hydrogel guides adherent cells through a controlled transition from cell–matrix anchoring to cadherin‐mediated cell–cell compaction, enabling rapid assembly of high‐viability spheroids with defined size and morphology.
Han Gyeol Nam   +8 more
wiley   +1 more source

Completing orientations of partially oriented graphs [PDF]

open access: yesJournal of Graph Theory, 2017
AbstractWe initiate a general study of what we call orientation completion problems. For a fixed class of oriented graphs, the orientation completion problem asks whether a given partially oriented graph P can be completed to an oriented graph in by orienting the (nonoriented) edges in P.
Jørgen Bang-Jensen   +2 more
openaire   +2 more sources

Multiplex Modular Nanorobotic Systems with Catalytic Activity under Magnetic Navigation

open access: yesAdvanced Functional Materials, EarlyView.
We present modular nanorobots composed of a magnetic propulsion module and different extension modules carrying functional activities, assembled via DNA base pairing. The system integrates propulsion, optical tracking, enzymatic catalysis, and cell docking in a programmable manner.
Voichita Mihali   +7 more
wiley   +1 more source

Colourings of $(m, n)$-coloured mixed graphs [PDF]

open access: yesDiscrete Mathematics & Theoretical Computer Science
A mixed graph is, informally, an object obtained from a simple undirected graph by choosing an orientation for a subset of its edges. A mixed graph is $(m, n)$-coloured if each edge is assigned one of $m \geq 0$ colours, and each arc is assigned one of ...
Gary MacGillivray   +2 more
doaj   +1 more source

Full Orientability of Graphs

open access: yesElectronic Notes in Discrete Mathematics, 2009
Abstract Let D be an acyclic orientation of a graph G. Then an arc of D is called dependent if its reversal creates a directed cycle. Let d min ( G ) ( d max ( G ) ) denote the minimum (maximum) of the number of dependent arcs over all acyclic orientations of G. A graph G is called fully orientable if G has an acyclic orientation
openaire   +1 more source

Home - About - Disclaimer - Privacy