Refining schizophrenia via graph reachability in Esterel

Information security and assurance are new frontiers for collaborative design. In this context, information assurance (IA) refers to methodologies to protect engineering information by ensuring its availability, confidentiality, integrity, nonrepudiation, authentication, access control, etc. In collaborative design, IA techniques are needed to protect intellectual property, establish security privileges and create “need to know” protections on critical features. This paper provides a framework for information assurance within collaborative design based on a technique we call Role-Based Viewing. We extend upon prior work to present Hierarchical Role-Based Viewing as a more flexible and practical approach since role hierarchies naturally reflect an organization’s lines of authority and responsibility. We establish a direct correspondence between multilevel security and multiresolution surfaces where a hierarchy is represented as a weighted directed acyclic graph. The permission discovery process is formalized as a graph reachability problem and the path-cost can be used as input to a multiresolution function. By incorporating security with collaborative design, the costs and risks incurred by multiorganizational collaboration can be reduced. The authors believe that this work is the first of its kind to unite multilevel security and information clouded with geometric data, including multiresolution surfaces, in the fields of computer-aided design and collaborative engineering.

Download Full-text

BFSI-B: An improved K-hop graph reachability queries for cyber-physical systems

Information Fusion ◽

10.1016/j.inffus.2017.02.009 ◽

2017 ◽

Vol 38 ◽

pp. 35-42 ◽

Cited By ~ 11

Author(s):

Xia Xie ◽

Xiaodong Yang ◽

Xiaokang Wang ◽

Hai Jin ◽

Duoqiang Wang ◽

...

Keyword(s):

Cyber Physical Systems ◽

Physical Systems ◽

Graph Reachability ◽

Reachability Queries

Download Full-text

Algorithm for Identifying Minimum Driver Nodes Based on Structural Controllability

Mathematical Problems in Engineering ◽

10.1155/2015/192307 ◽

2015 ◽

Vol 2015 ◽

pp. 1-9 ◽

Cited By ~ 6

Author(s):

Reza Haghighi ◽

HamidReza Namazi

Keyword(s):

Large Scale ◽

Simple Graph ◽

Networked Systems ◽

Infinite Time ◽

Input Signals ◽

Graph Reachability ◽

Structural Controllability ◽

Practical Model ◽

Simulation Results ◽

The Relationship

Existing methods on structural controllability of networked systems are based on critical assumptions such as nodal dynamics with infinite time constants and availability of input signals to all nodes. In this paper, we relax these assumptions and examine the structural controllability for practical model of networked systems. We explore the relationship between structural controllability and graph reachability. Consequently, a simple graph-based algorithm is presented to obtain the minimum driver nodes. Finally, simulation results are presented to illustrate the performance of the proposed algorithm in dealing with large-scale networked systems.

Download Full-text

Implicit Landmark Path Indexing for Bounded Label Constrained Reachable Paths

International Journal of Recent Technology and Engineering - 2 ◽

10.35940/ijrte.d4273.118419 ◽

2019 ◽

Vol 8 (4) ◽

pp. 10660-10669

Keyword(s):

Directed Graphs ◽

Interaction Networks ◽

Unstructured Data ◽

Edge Label ◽

Novel Technique ◽

Proteinprotein Interaction ◽

Graph Reachability ◽

Data Graph ◽

Indexing Technique ◽

The Given

In today’s Big Data era, a graph is an essential tool that models the semi-structured or unstructured data. Graph reachability with vertex or edge constraints is one of the basic queries to extract useful information from the graph data. From the graph reachability with constraints, we obtained the information about the existence of a path between the given two vertices satisfying the vertex or edge constraints. The problem of Label Constraint Reachability (LCR) found the existence of a path between the two given vertices such that the edge-labels along the path are the subset of the given edge-label constraint. We extended the LCR queries by considering weighted directed graphs and proposed a novel technique of finding paths for LCR queries bounded by path weight. We termed these paths as bounded label constrained reachable paths (BLCRP). We extended the landmark path indexing technique [1] by incorporating the implicit paths which satisfy the user constraints but need not satisfy the minimality of edge label sets. We solved the BLCRP by using the extended landmark path indexing and BFS based query processing. We addressed the following challenges through our proposed technique of implicit landmark path indexing in the problem of BLCRP that included (1) the need to handle exponential number of edge label combinations with an additional total path weight constraint, and (2) the need to discover a technique that finds exact reachable paths between the given vertices. This problem could be applied to real network scenarios like road networks, social networks, and proteinprotein interaction networks. Our experiments and statistical analysis revealed the accuracy and efficiency of the proposed approach tested on synthetic and real datasets.

Download Full-text