Results 71 to 80 of about 723,682 (282)
Graph-Controlled Insertion-Deletion Systems
In this article, we consider the operations of insertion and deletion working in a graph-controlled manner. We show that like in the case of context-free productions, the computational power is strictly increased when using a control graph: computational
Akihiro Takahara +27 more
core +4 more sources
Low‐consumable nickel ferrite‐based anodes for the Hall–Héroult process are compared with conventional prebaked carbon anodes using thermodynamic simulation and prospective life cycle assessment under contrasting future electricity system pathways from 2025 to 2050.
Felipe Alejandro Garcia Paz +6 more
wiley +1 more source
Time‐Dependent Oxidation and Scale Evolution of a Wrought Co/Ni‐Based Superalloy
This study shows how a new wrought Co/Ni‐based superalloy resists oxidation at 800 ∘$^\circ$C. The oxide scale changes from rough, fast‐growing spinel to a dense, protective chromia–alumina layer. Atom probe analysis reveals tiny refractory‐rich bubbles at the interface that mark the transition to long‐term, diffusion‐controlled protection ...
Cameron Crabb +6 more
wiley +1 more source
Further study on the second status connectivity index of graphs
The second status connectivity index (SSC index, for short) of a simple connected graph [Formula: see text] is defined as the sum of the terms [Formula: see text] over all edges ab of [Formula: see text], where [Formula: see text], the status of a vertex
Mahdieh Azari, Jia-Bao Liu
doaj +1 more source
Graph Operations and Neighbor Rupture Degree
In a communication network, the vulnerability parameters measure the resistance of the network to disruption of operation after the failure of certain stations or communication links.
Saadet Kandİlcİ +2 more
doaj +1 more source
Lexicographic identifying codes [PDF]
An identifying code in a graph is a set of vertices which intersects all the symmetric differences between pairs of neighbourhoods of vertices. Not all graphs have identifying codes; those that do are referred to as twin-free. In this paper, we design an
Gadouleau, Maximilien
core
Two-graph Receiver Operating Characteristic [PDF]
The command roctg allows visualizing sensitivity (Se)and specificity (Sp) curves according to the range of values of a new diagnostic test, given a “true” state of an event, the reference test. On request, several options for displaying Se and Sp estimates in, or enhancements for, the graphs are also available.
openaire +2 more sources
Tailoring Functional Properties of Ti–Ni–Cu Shape Memory Alloy Thin Films for MEMS Actuators
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
The Behavior of Tree-Width and Path-Width Under Graph Operations and Graph Transformations
Tree-width and path-width are well-known graph parameters. Many NP-hard graph problems admit polynomial-time solutions when restricted to graphs of bounded tree-width or bounded path-width. In this work, we study the behavior of tree-width and path-width
Frank Gurski, Robin Weishaupt
doaj +1 more source
A Lightweight Procedural Layer for Hybrid Experimental–Computational Workflows in Materials Science
We unveil a prototype hybrid‐workflow framework that fuses automatedcomputation with hands‐on experiments. Built atop pyiron, a lightweight, parameterized layer translates procedure descriptions into executable manual steps, syncing instrument settings, human interventions, and data capture in real‐time today.
Steffen Brinckmann +8 more
wiley +1 more source

