Visualizing correlations, i.e., the tendency of uncertain data values at different spatial positions to change contrarily or according to each other, allows inferring on the possible variations of structures in the data. Visualizing global correlation structures, however, is extremely challenging, since it is not clear how the visualization of complicated long-range dependencies can be integrat...

let $r$ be a commutative ring with identity. let $g(r)$ denote the maximal graph associated to $r$, i.e., $g(r)$ is a graph with vertices as the elements of $r$, where two distinct vertices $a$ and $b$ are adjacent if and only if there is a maximal ideal of $r$ containing both. let $gamma(r)$ denote the restriction of $g(r)$ to non-unit elements of $r$. in this paper we study the various graphi...

this paper is concerned with the consensus tracking problem of high order mimo nonlinear multi-agent systems. the agents must follow a leader node in presence of unknown dynamics and uncertain external disturbances. the communication network topology of agents is assumed to be a fixed undirected graph. a distributed adaptive control method is proposed to solve the consensus problem utilizing re...

In this paper, a distributed output regulation problem is formulated for a class of uncertain nonlinear multi-agent systems subject to local disturbances. The formulation is given to study a leader-following problem when the leader contains unknown inputs and its dynamics is different from those of the followers. Based on the conventional output regulation assumptions and graph theory, distribu...

The objective of a static scheduling algorithm is to minimize the overall execution time of the program, represented by a directed task graph, by assigning the nodes to the processors. However, sometimes it is very difficult to estimate the execution time of several parts of a program and the communication delays under different circumstances. In this paper, an uncertain intelligent scheduling ...

In this study, the graphical exploration of a novel hybrid, that is, possibility picture fuzzy hypersoft graph ( popfhs -graph) is accomplished. The id="M2"> -graph more flexible and reliable in sense it has ability to tackle limitations soft regarding entitlement multiargument approximate mapping degree-based sett...

Many studies have been conducted on seeking the efficient solution for subgraph similarity search over certain (deterministic) graphs due to its wide application in many fields, including bioinformatics, social network analysis, and Resource Description Framework (RDF) data management. All these works assume that the underlying data are certain. However, in reality, graphs are often noisy and u...

In diagnosis, the notion of observation varies according to the class of considered systems. In discrete-event systems, an observation usually consists of a sequence, or a set of sequences, of totally ordered observable events. This paper extends the concept of discrete-event observation in several ways. First, observable events (messages) may be uncertain in nature, both in behavioral models a...

Collaborative ltering (CF) aims at predicting the user interest for a given item. In CF systems a set of users ratings is used to predict the rating of a given user on a given item using the ratings of a set of users who have already rated the item and whose preferences are similar to those of the user. In this paper we propose to use a framework based on uncertain graphs in order to deal with ...