نتایج جستجو برای: task graph

تعداد نتایج: 480688  

Journal: :transactions on combinatorics 2014
mostafa tavakoli f. rahbarnia m. mirzavaziri a. r. ashrafi

‎let $d_{n,m}=big[frac{2n+1-sqrt{17+8(m-n)}}{2}big]$ and‎ ‎$e_{n,m}$ be the graph obtained from a path‎ ‎$p_{d_{n,m}+1}=v_0v_1 cdots v_{d_{n,m}}$ by joining each vertex of‎ ‎$k_{n-d_{n,m}-1}$ to $v_{d_{n,m}}$ and $v_{d_{n,m}-1}$‎, ‎and by‎ ‎joining $m-n+1-{n-d_{n,m}choose 2}$ vertices of $k_{n-d_{n,m}-1}$‎ ‎to $v_{d_{n,m}-2}$‎. ‎zhang‎, ‎liu and zhou [on the maximal eccentric‎ ‎connectivity ind...

2005
Bruce N. Walker Michael A. Nees

This study examined different types of brief training for a point estimation task with auditory graphs. Participants estimated the price of a stock at a specific times in a 10-hour trading day as depicted in a sonified graph of the stock price data. Forty Georgia Tech undergraduates completed a pre-test, an experimental training session, and a post-test for the point estimation task. In an exte...

Journal: :Parallel Processing Letters 2003
Olivier Beaumont Arnaud Legrand Loris Marchal Yves Robert

We consider the execution of a complex application on a heterogeneous “grid” computing platform. The complex application consists of a suite of identical, independent problems to be solved. In turn, each problem consists of a set of tasks. There are dependences (precedence constraints) between these tasks and these dependences are organized as a tree. A typical example is the repeated execution...

2011
Seung-Hyun Jin Peter Lin Mark Hallett

We investigated the large-scale functional cortical connectivity network in focal hand dystonia (FHD) patients using graph theoretic measures to assess efficiency. High-resolution EEGs were recorded in 15 FHD patients and 15 healthy volunteers at rest and during a simple sequential finger tapping task. Mutual information (MI) values of wavelet coefficients were estimated to create an associatio...

Journal: :CoRR 2017
Niklas Ueter Georg von der Brüggen Jian-Jia Chen Jing Li Kunal Agrawal

This paper considers the scheduling of parallel realtime tasks with arbitrary-deadlines. Each job of a parallel task is described as a directed acyclic graph (DAG). In contrast to prior work in this area, where decomposition-based scheduling algorithms are proposed based on the DAG-structure and inter-task interference is analyzed as self-suspending behavior, this paper generalizes the federate...

2018
Khaled Abdelsalam Mohamed Amr Kamel

This paper presents an approach to detect behavioral design patterns from source code using static analysis techniques. It depends on the concept of Code Property Graph and enriching graph with relationships and properties specific to Design Patterns, to simplify the process of Design Pattern detection. This approach used NoSQL graph database (Neo4j) and uses graph traversal language (Gremlin) ...

Journal: :CoRR 2017
Aaqib Saeed Stojan Trajanovski

Stress can be seen as a physiological response to everyday emotional, mental and physical challenges. A long-term exposure to stressful situations can have negative health consequences, such as increased risk of cardiovascular diseases and immune system disorder. Therefore, a timely stress detection can lead to systems for better management and prevention in future circumstances. In this paper,...

Journal: :algebraic structures and their applications 0
hamid reza dorbidi university of jiroft

the order graph of a group $g$, denoted by $gamma^*(g)$, is a graph whose vertices are subgroups of $g$ and two distinct vertices $h$ and $k$ are adjacent if and only if $|h|big{|}|k|$ or $|k|big{|}|h|$. in this paper, we study the connectivity and diameter of this  graph. also we give a relation between the order graph and prime  graph of a group.

Journal: :journal of algorithms and computation 0
kristiana wijaya combinatorial mathematics research group, faculty of mathematics and natural sciences, institut teknologi bandung (itb), jalan ganesa 10 bandung 40132 indonesia lyra yulianti department of mathematics, faculty of mathematics and natural sciences, andalas university, kampus unand limau manis padang 25136 indonesia edy tri baskoro combinatorial mathematics research group, faculty of mathematics and natural sciences, institut teknologi bandung (itb), jalan ganesa 10 bandung 40132 indonesia hilda assiyatun combinatorial mathematics research group, faculty of mathematics and natural sciences, institut teknologi bandung (itb), jalan ganesa 10 bandung 40132 indonesia djoko suprijanto combinatorial mathematics research group, faculty of mathematics and natural sciences, institut teknologi bandung (itb), jalan ganesa 10 bandung 40132 indonesia

let f, g and h be non-empty graphs. the notation f → (g,h) means that if any edge of f is colored by red or blue, then either the red subgraph of f con- tains a graph g or the blue subgraph of f contains a graph h. a graph f (without isolated vertices) is called a ramsey (g,h)−minimal if f → (g,h) and for every e ∈ e(f), (f − e) 9 (g,h). the set of all ramsey (g,h)−minimal graphs is denoted by ...

Journal: :iranian journal of mathematical chemistry 2013
m. tavakoli f. rahbarnia

in this paper, we first collect the earlier results about some graph operations and then wepresent applications of these results in working with chemical graphs.

نمودار تعداد نتایج جستجو در هر سال

با کلیک روی نمودار نتایج را به سال انتشار فیلتر کنید