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.
Recently, there have been many advances in the research underlying condensed co-change graph, but most research has focused on the discovery of the graph feature. There still few works have done with consideration that the mass unchanged artifacts profoundly effect on the clustering. This paper presents a method for constructing more accurate condensed co-change graph. By using random walk, all the...
Four group detection models (e.g. GDM, OGDM, SoDM and ComDM) are developed based on crime data features. These detection models are compared more common baseline SNA group detection algorithms. It is intended to find out, whether these four crime data specific group detection models can perform better than widely used k-core and n-clique algorithms. Two data sets which contain previously known criminal...
Mobile Social Network Analysis is the mapping and measuring of interactions and flows between people, groups, and organizations based on the usage of their mobile communication services. Social Network Analysis and Mining has been highly influenced by the online social web sites, telecom consumer data and instant messaging systems, and has widely analyzed the presence of dense communities using graph...
The automatic generation of malicious behavior pattern based on system call trace is important to malware detection. This paper studied the existing generation method of malicious behavior specification. In order to reduce the complexity of pattern generation, it constructs graph which vertex label is unique, and uses these graphs to mine the pattern. To address the issue of limitation of the minimal...
Design Pattern Detection is a part of many solutions to Software Engineering difficulties. It is a part of reengineering process and thus gives important information to the designer. Design Pattern existence improve the program understanding and software maintenance. With the help of these patterns specific design problem can be solved and object oriented design become more flexible and reusable....
Trapping sets (TSs) have been known to contribute to errors in the decoding of low-density parity-check (LDPC) codes, particularly at the high signal-to-noise ratio (SNR) region. Moreover, TSs with the same label [w; u] are considered equivalent under the automorphism of the graph of a regular code. But according to our our simulations, TSs with the same label [w; u] are producing different error...
This paper presents 2D shape matching technique using hierarchical tree structure extracted from shock graph that in turn extracted from the skeleton of the shape of interest. Object recognition and shape matching are important issues in the field of image processing. Extraction and application of skeleton of a shape is widely used in these fields. In this paper shape representation, matching and...
Here we apply the graph-theoretic concept of betweenness centrality to a class of protein repeats, e.g., Armadillo (ARM) and HEAT. The Betweenness of a node represents how often a node is traversed on the shortest path between all pairs of nodes i, j in the network and thus gives the contribution of each node in the network. These repeats are not easily detectable at the sequence level because of...
Load balancing is an important requirement for the efficient execution of parallel numerical simulations. In particular when the simulation domain changes over time, the mapping of computational tasks to processors needs to be modified accordingly. State-of-the-art libraries for this problem are based on graph repartitioning. They have a number of drawbacks, including the optimized metric and the...
What is a cloud application precisely? In this paper, we formulate a computing cloud as a kind of graph, a computing resource such as services or intellectual property access rights as an attribute of a graph node, and the use of a resource as a predicate on an edge of the graph. We also propose to model cloud computation semantically as a set of paths in a subgraph of the cloud such that every edge...
This work presents an empirical property-based model to describe Web-based vulnerability. We define a web application using a new descriptive model with pre-condition, behavior, entity and communication property sets. The vulnerable property relationship graph (VPRG) defines a vulnerability as vulnerable properties in application with relations to other properties in cause- and consequence-relationships...
Several systems have been proposed to merge ontologies for heterogeneous application domains. They give primacy to concepts and roles. In this paper, we describe an algorithm to merge two or more ontologies constructed from a common set of corpus for an application domain by different groups of ontology experts. We give primacy to instances and values to discover mismatch. Our algorithm makes distinction...
The augmented k-ary n-cube AQn,k is a recently proposed interconnection network that incorporates an extension of a k-ary n-cube Qnk inspired by the extension of a hypercube Qn to the augmented hypercube AQn (as developed by Choudom and Sunita). We extend a recent topological investigation of augmented k-ary n-cubes by proving that any augmented k-ary n-cube AQn,k is edge-pancyclic and that AQ2,k...
The dimensions of twisted cubes in the original definition of twisted cubes are only limited to odd integers. In this paper, we first extend the dimensions of twisted cubes to all the positive integers. Then, we introduce the concept of the set of restricted faulty nodes into twisted cubes. We further prove that under the condition that each node of the n-dimensional twisted cube TQn has at least...
Navigation with wireless sensor networks (WSNs) can help people escape safely from an emergency. Previous navigation algorithms attempt to find safe and efficient escape paths for individuals under various environmental dynamics but ignore possible congestion caused by the individuals rushing for the exits. Moreover, all the previous works have overlooked the fact that the emergency rescue force can...
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...
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.