Abstract—In this paper, we propose a new class of graphs called generalized recursive circulant graphs which is an extension of recursive circulant graphs. While retaining attractive properties of recursive circulant graphs, the new class of graphs achieve more flexibility in varying the number of vertices. Some network properties of recursive circulant graphs, like degree, connectivity and diameter, are adapted to the new graph class with more concise expression. In particular, we use a multidimensional vertex labeling scheme in generalized ....etc

[:=Read Full Message Here=:]

Abstract—This paper presents an online scheduling methodology for task graphs with communication edges for multiprocessor embedded systems. The proposed methodology is designed for task graphs which are dynamic in nature either due to the presence of conditional paths or due to presence of tasks whose execution times vary. We have assumed homogeneous processors with broadcast and point-to-point communication models and have presented online algorithms for them. We show that this technique adapts better to variation in task graphs at runtime a ....etc

[:=Read Full Message Here=:]

Abstract—Security risk assessment and mitigation are two vital processes that need to be executed to maintain a productive IT infrastructure. On one hand, models such as attack graphs and attack trees have been proposed to assess the cause-consequence relationships between various network states, while on the other hand, different decision problems have been explored to identify the minimum-cost hardening measures. However, these risk models do not help reason about the causal dependencies between network states. Further, the optimization for ....etc

[:=Read Full Message Here=:]

Hybrid Scheduling of Dynamic Task Graphs with Selective Duplication for Multiprocessors under Memory and Time Constraints
ABSTRACT
This paper presents a hybrid scheduling methodology for task graphs to multiprocessor embedded systems. The proposed methodology is designed for task graphs which are dynamic in nature due to the presence of conditional tasks as well as tasks whose execution times are unpredictable but bounded. We have presented the methodology as a three phase strategy in which task nodes are mapped to the processors in t ....etc

[:=Read Full Message Here=:]

would you please tell me the main goal of c-trend and who can be benifitted from c-trend and what they will do with this project ....etc

[:=Read Full Message Here=:]

Abstract.
We present a simple way of designing deterministic algorithms for problems in the data stream model via lossless expander graphs.We illustrate this by considering two problems, namely, k-sparsity testing and estimating frequency of items.
1 Introduction
We say that an n-dimensional vector f from Zn is k-sparse if it has at most k non-zero entries. The problem is to test whether f is k-sparse or no after it has been subject to a sequence of coordinate wise updates in arbitrary order, that is, f is the frequency vec ....etc

[:=Read Full Message Here=:]

C-TREND:Temporal Cluster Graphs for Identifying and Visualizing Trends in Multi-attribute Transactional Data

Organizations and firms are capturing increasingly more data about their customers, suppliers, competitors, and business environment. Most of this data is multi-attribute (multidimensional) and temporal in nature. Data mining and business intelligence techniques are often used to discover patterns in such data; however, mining temporal relationships typically is a complex task. We propose a new data analysis and visualization techniqu ....etc

[:=Read Full Message Here=:]

please tell me the main goal of c-trend and tell me who can be benifited from this and how ....etc

[:=Read Full Message Here=:]

i want the code and documentation of the project : C-Trend: Temporal Cluster Graphs For Identifying And Visualizing Trends In Multiattribute Transactional Data ....etc

[:=Read Full Message Here=:]

Signal flow graph – an additional technique that is very useful for the analysis of microwave networks in terms of transmitted and reflected waves
Consider the flow graph of an arbitrary two-port network
The flow graph gives an intuitive graphical illustration of the network behavior
A wave of amplitude a1 incident at port 1 is split:
1)…part going throughS11 and out port 1 as a reflected wave
2)… part transmitted through S21 to node b2.
3) At node b2:
- the wave goes out port 2;
- if a lo ....etc

[:=Read Full Message Here=:]