Results 1 to 10 of about 6,766 (248)
Stacks, Queues and Tracks: Layouts of Graph Subdivisions [PDF]
A k-stack layout (respectively, k-queuelayout) of a graph consists of a total order of the vertices, and a partition of the edges into k sets of non-crossing (non-nested) edges with respect to the vertex ordering.
Vida Dujmović, David R. Wood
doaj +4 more sources
The Parameterized Complexity Of Extending Stack Layouts
An $\ell$-page stack layout (also known as an $\ell$-page book embedding) of a graph is a linear order of the vertex set together with a partition of the edge set into $\ell$ stacks (or pages), such that the endpoints of no two edges on the same stack ...
Thomas Depian +3 more
doaj +5 more sources
Cooling-System Configurations of a Dual-Stack Fuel-Cell System for Medium-Duty Trucks
Presently, hydrogen-fuel-cell medium-duty trucks utilize two or more modular proton exchange membrane fuel-cell stacks due to package space and economic concerns.
Younghyeon Kim +2 more
exaly +3 more sources
Stack Layout Randomization with Minimal Rewriting of Android Binaries
Stack-based attacks typically require that attackers have a good understanding of the stack layout of the victim program. In this paper, we leverage specific features on ARM architecture and propose a practical technique that introduces randomness to the stack layout when an Android application executes.
Guojun Peng, Huanguo Zhang, Debin Gao
exaly +4 more sources
Multi-Frequency Vibration Suppression Based on an Inertial Piezoelectric Actuator Applied in Indoor Substations [PDF]
This paper addresses the suppression of multi-frequency line spectrum vibrations during the operation of indoor substations through the development of an active vibration isolation scheme based on a piezoelectric stack inertial actuator.
Xiaohan Li +5 more
doaj +2 more sources
Stack and Queue Layouts of Posets [PDF]
Summary: The stacknumber (queuenumber) of a poset is defined as the stacknumber (queuenumber) of its Hasse diagram viewed as a directed acyclic graph. Upper bounds on the queuenumber of a poset are derived in terms of its jumpnumber, its length, its width, and the queuenumber of its covering graph.
Lenwood S. Heath, Sriram V. Pemmaraju
openaire +4 more sources
Compiler-supported Program Stack Space Layout Runtime Randomization Method [PDF]
Multi-variant execution is one of the most popular active defense technologies.MVX identifies attack behavior by running a set of functionally equivalent heterogeneous variants parallelly and detecting inconsistent state transitions between different ...
ZHU Pengzhe, YAO Yuan, LIU Zijing, XI Ruicheng
doaj +1 more source
A \emph(k,t)-track layout of a graph G consists of a (proper) vertex t-colouring of G, a total order of each vertex colour class, and a (non-proper) edge k-colouring such that between each pair of colour classes no two monochromatic edges cross.
Vida Dujmović +2 more
doaj +3 more sources
Topological Stack-Queue Mixed Layouts of Graphs
exaly +2 more sources
On Linear Layouts of Graphs [PDF]
In a total order of the vertices of a graph, two edges with no endpoint in common can be crossing, nested, or disjoint. A k-stack (respectively, k-queue, k-arch) layout of a graph consists of a total order of the vertices, and a partition of the
Vida Dujmović, David R. Wood
doaj +2 more sources

