Background: In recent years, there has been an increase in the amount and variety of data generated in the field of healthcare, (e.g., data related to the prevalence of contagious diseases in the society). Various patterns of individuals’ relationships in the society make the analysis of the network a complex, highly important process in detecting and preventing the incidence of diseases....

In many real world problems, data sometimes comes from n agents (n≥2), multipolar information exists. For issues that are associated with uncertainty, this information can not be showed with the values of crisp, fuzzy, intuitionistic or bipolar. Graph is one of the mathematical models widely used in different sciences. Ambiguity in a graph where data depends on the n parameter can not be showed...

A new data flow graph concept is defined to be used for architectural synthesis as well as verification of a system. The graph contains only the explicit data dependencies, but any other constraints can also be described. The semantics of this graph does not impose any restriction on the scheduler, except for the explicit data dependencies. For instance, the scheduler is not forced to work on c...

Control dependences characterize how the predicates in a program govern the execution of other statements and predicates. Control dependences are defined in terms of a program’s control-flow graph; given a control-flow graph G, a corresponding control dependence graph, CDG(G), can be constructed. This paper addresses the inverse problem: we define an algorithm that, given a control dependence g...

The thesis describes a concept for the abstraction of control flow graphs, view graphs, and some of its possible applications. Many computer science applications, especially in validation and verification, are directly or indirectly based on control flow analysis. Often, certain actions in the control flow are of special interest – e.g. input and output actions. These actions define a view of t...

We, in this paper, try to represent information flow of program on the basis of slices. It is referred to slice-based information flow graph(SIFG). SIFG captures the information flow among data tokens. We can find the elementary characteristics of the information flow of program by using SIFG and increase the understanding about program.

This is the fourth in a series introducing the activity model in the Unified Modeling Language, version 2 (UML 2), and how it integrates with the action model [1]. The first article gives an overview of activities and actions [2], while the second two cover actions generally and control nodes [3][4]. The remainder of the series elaborates other specific elements. This article covers object node...

We study the urban-scale macroscopic traffic flow in city networks. Star graph is considered as network. graphs with controlled are transformed to various cell-transmission by using cell transmission method. The dynamic equations of vehicular densities on all nodes (roads) presented speed-matching model. density given nonlinear-diffusion equations. star mapped nonlinear diffusion process graphs...

This paper deals with a comparative study on testing of concurrent programs based on different techniques. The various challenges in testing concurrent programming are: defining test coverage criteria based on control flow, generating control flow graph of nondeterministic programs, investigating the applicability of sequential testing criteria to parallel program testing etc. For solving these...