The Infona portal uses cookies, i.e. strings of text saved by a browser on the user's device. The portal can access those files and use them to remember the user's data, such as their chosen settings (screen view, interface language, etc.), or their login data. By using the Infona portal the user accepts automatic saving and using this information for portal operation purposes. More information on the subject can be found in the Privacy Policy and Terms of Service. By closing this window the user confirms that they have read the information on cookie usage, and they accept the privacy policy and the way cookies are used by the portal. You can change the cookie settings in your browser.
The mobility of nodes with a purpose called as robotic-mobility is used for replenishing energy to strategic military applications. Assuming a CDS based backbone in place, we give a technique of maintaining the location of mobile node for a given topology setting. We show that using a weighted CDS reduces the maintenance of location updates for mobile node. The complexity of our mobile-node maintanence...
Designing appropriate graphs is a problem frequently occurring in several common applications ranging from designing communication and transportation networks to discovering new drugs. More often than not the graphs to be designed need to satisfy multiple, sometimes conflicting, objectives e.g. total length, cost, complexity or other shape and property limitations. In this paper we present our approach...
Workflow is the most widespread modeling technique application in the field of business and office information systems. In the previous paper introduced P-graph-based workflow modeling extended by the introduction of resource management is a systematic, fast method of optimal workflow model generation based on network synthesis with correct mathematical background. In this paper a further extension,...
In this paper, fifteen watershed algorithms are reviewed. For clarity, first we expose two graph exploring methods modified to be guidelines for understanding the approaches taken by these algorithms: the breadth-first watershed and the depth-first watershed. Both paradigms rely on the visiting order applied by the algorithms. The breadth-first is more recognizable as a seed region growing or marker...
Random key graphs are random graphs induced by the random key predistribution scheme of Eschenauer and Gligor under the assumption of full visibility. For this class of random graphs we show the existence of a zero-one law for the appearance of triangles, and identify the corresponding critical scaling. This is done by applying the method of first and second moments to the number of triangles in the...
We formulate a new approach to understanding the behavior of the min-sum algorithm by exploiting the properties of graph covers. First, we present a new, natural characterization of scaled diagonally dominant matrices in terms of graph covers; this result motivates our approach because scaled diagonal dominance is a known sufficient condition for the convergence of min-sum in the case of quadratic...
We consider n agents located on the vertices of a connected graph. Each agent v receives a signal Xv(0) ~ N(??, 1) where ?? is an unknown quantity. A natural iterative way of estimating ?? is to perform the following procedure. At iteration t + 1 let Xv(t + 1) be the average of Xv(t) and of Xw(t) among all the neighbors w of v. It is well known that this procedure converges to X(??) = 1/2|E|-1 ??...
This paper describes an extension to stochastic Kronecker graphs that provides the special structure required for searchability, by defining a ??distance??-dependent Kronecker operator. We show how this extension of Kronecker graphs can generate several existing social network models, such as the Watts-Strogatz small-world model and Kleinberg's lattice-based model. We focus on a specific example of...
This paper investigates conditions for an underdetermined linear system to have a unique nonnegative solution. A necessary condition is derived which requires the measurement matrix to have a row-span intersecting the positive orthant. For systems that satisfy this necessary condition, we provide equivalent characterizations for having a unique nonnegative solution. These conditions generalize existing...
Several authors have characterized limits of graph sequences in terms of extremal distributions on exchangeable random graphs. Parallely, information theorists and statisticians have used patterns of i.i.d. sequences as a framework to develop probability estimation techniques over large alphabets. In this brief note, we observe that measures over patterns of infinite i.i.d. sequences correspond to...
We study supermodular games on graphs as a benchmark model of cooperation in networked systems. In our model, each agent's payoff is a function of the aggregate action of its neighbors and it exhibits strategic complementarity. We study the largest Nash equilibrium which, in turn, is the Pareto optimal equilibrium in the presence of positive externalities. We show that the action of a node in the...
CSMA policies are examples of simple distributed scheduling algorithms in wireless networks. In this paper, we study the delay properties of CSMA in the limit of large networks. We first define an ideal network under which CSMA becomes memoryless in that the delay to access the channel becomes an exponential r.v. independent of the past. We then show that, in the limit of large bipartite graphs with...
In recent past a number of researchers have proposed strategies for finding test order during Integration testing of object oriented applications while minimizing the cost of stub creation. Some researchers have used graph-based approach while others have suggested solutions using genetic algorithms. This paper presents a survey of various graph-based strategies and genetic algorithm based strategies...
`Separation of Concerns' in the field of Software Engineering has been an important issue for quite some time. And this issue is very much related to Aspect Oriented Software Development. This is so because Aspects happen to be certain concerns that get interleaved with the Core-Functionalities in such a way that they become inseparable. As a result of which the programmer, who is supposed to be concerned...
Ontology is an explicit formal sharing conceptualization of one domain. Ontology maintenance is one of most important work during ontologypsilas development lifecycle. Cycle of concepts is one of the most common inconsistency errors in ontology. In this paper, we propose a method of eliminating direct super-class to detect cycle of concepts (EDS2DCC). This method firstly constructs oriented graphs...
In this paper, we formulate image annotation as a semi-supervised learning problem under multi-instance learning framework. A novel graph based semi-supervised learning approach to image annotation using multiple instances is presented, which extends the conventional semi-supervised learning to multi-instance setting by introducing the adaptive geometric relationship between two bags of instances...
In computing, ambient intelligence (AmI) (O. Zuckerman) ((P. Remagnino and G.L. Foresti)) refers to electronic environments that are sensitive and responsive to the presence of people. In an ambient intelligent world, devices work in concert to support people in carrying out their everyday life activities, tasks and rituals in easy, natural way using information and intelligence that is hidden in...
A new type of knowledge evolving model which comprises knowledge-based local world preferential attachment and degree-based node preferential deletion is studied. A series of numerical simulations of the degree distribution of the knowledge networks are presented. The results indicate that the degree distribution of the knowledge networks at first has an approximate state of scale-invariant, and then...
The performance of ad hoc networks depends on cooperation and trust among distributed nodes. To enhance security in ad hoc networks, it is important to evaluate trustworthiness of other nodes without centralized authorities. In this work, we are focusing on the evaluation of trustworthiness between two strangers in large, dynamic ad hoc networks. This novel evaluation process is modeled as a common...
This paper represents a research effort towards the formal mapping between program slicing and Z specifications. General aspects of program slicing are considered, i.e. definitions of program slicing, nodes and edges of program dependence graphs, and program slicing algorithms. With this approach, we provide not only a precise semantic basis for program slicing but also a sound mechanism for reasoning...
Set the date range to filter the displayed results. You can set a starting date, ending date or both. You can enter the dates manually or choose them from the calendar.