Stack layouts and queue layouts of undirected graphs have been used to model problems in fault tolerant computing and in parallel process scheduling. However, problems in parallel process scheduling are more accurately modeled by stack and queue layouts of directed acyclic graphs (dags). A stack layout of a dag is similar to a stack layout of an undirected graph, with the additional requirement...

The least common ancestor on two vertices, denoted , , is a well defined operation in a directed acyclic graph (dag) . We introduce , a natural extension of , for any set of vertices. Given such a set , one can iterate in order to obtain an increasing set sequence. being finite, this sequence has always a limit which defines a closure operator. Two equivalent definitions of this operator are gi...

This research addresses a high-speed computation method for the Kleene Star of the weighted adjacency matrix in max-plus algebraic system. We focus on systems whose precedence constraints are represented by a directed acyclic graph (DAG), and implement on a Cell Broadband EngineTM (CBE) processor. Using the implementation on a Sony Playstation3TM (PS3) equipped with a CBE processor, we attempt ...

Information sharing in vehicular networks has great potential for the future Internet of Vehicles (IoV). and roadside units (RSUs) can exchange perceptual information driving experience to enable intelligent transportation applications such as autonomous road condition analysis. However, ensuring secure efficient among vehicles is challenging. While traditional blockchain guarantee tamper-proof...

Grid computing is a distributed computing taken to next evolutionary level. In this work, a static methodology has been adopted for defining the weights of the computational tasks and communicating edges. Also, we defined the execution time (makespan) as the total time between the finish time of exit task and start time of the entry task in the given Directed Acyclic Graph (DAG). The algorithm ...

In vehicular edge computing (VEC), tasks and data collected by sensors on the vehicles can be offloaded to roadside units (RSUs) equipped with a set of servers through wireless transmission. These may dependent each other modeled as directed acyclic graph (DAG). The DAG scheduling problem is aimed at minimize length (makespan), i.e., maximum finish time all tasks. conventional heuristic algorit...

Searching for the Multiple Longest Common Subsequences (MLCS) of multiple sequences is a classical NP-hard problem, which has been used in many applications. One of the most effective exact approaches for the MLCS problem is based on dominant point graph, which is a kind of directed acyclic graph (DAG). However, the time and space efficiency of the leading dominant point graph based approaches ...

MOTIVATION The total order of the genes or markers on a chromosome inherent in its representation as a signed per-mutation must often be weakened to a partial order in the case of real data. This is due to lack of resolution (where several genes are mapped to the same chromosomal position) to missing data from some of the datasets used to compile a gene order, and to conflicts between these dat...

Deep learning methods have achieved amazing results in sequential input, prediction and image classification. In this study, we propose transformation of time series crude oil price by incorporating 2-D Directed Acyclic Graph to Convolutional Neural Network (DAG) based on processing properties. Crude is converted into images, utilizing 10 distinctive technical indicators. Geometric Brownian Mot...