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.
A robust semi-supervised method using the mode filter has been presented for learning with partially-labeled training data including label errors. The mode filter has been originally developed for smoothing images contaminated with impulsive noises. However it needs nonlinear optimization which is usually solved with iterative methods. In this paper, we propose a direct solution method with full search...
With the increasing popularity and development of e-commerce and information technology, multi-attribute bilateral matching problem has been receiving more and more attention. In this paper, multi-attribute bilateral matching problem is discussed based on the consideration of stable matching. Concepts and definitions of multi-attribute bilateral stable matching are presented firstly, followed by the...
Cellular Automata (CA) model is extensively applied to pedestrian evacuation simulation in emergency, but little research is about pedestrian behavior of orderly activities in normal situation. Based on queue theory, CA, finite state machine model and visibility graph, queuing behavior and path search algorithm are modeled. Considering the direction of queue activities, a pedestrian locomotion behavior...
Spanning subgraph is necessary for the communication in networks. For example, the malfunctioning of one or more nodes in a network in general affects both the global and the local properties of the remaining nodes, because it makes some edges unusable and destroys the connectivity of the system. In this study, we focus on the characters of a network to be fractional-r-factors, fractional (r, k)-extendable...
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...
In this paper, a bipartite scientific collaboration network is constructed to identify the vital researchers in a scientific research group. There are two kinds of vertices in the network, where one kind of vertices represent the researchers and the other ones illustrate the papers. The edges are connected to the vertices which belong to two different classes. Through the bipartite network, a model...
A basic network model N of local flow is a simple directed graph, in which transfer capacity and circulation capacity of a node in a local flow network are not detected and characterized. As a result, it is not in accord with various factual states and changes of the network commonly. An improved mathematical model NIO, called a node-separating model, was proposed in the presented paper. The NIO involves...
This paper presents that the degree of sequential diagnosability of an N-vertex Cayley graph is Ω(N/D) by generalizing a known technique of finding a lower bound for that of a CCC(cube-connected cycles), where D is the diameter of the Cayley graph. From the lower bound, it is shown that the degrees of sequential diagnosability of the N-vertex star graph and wrapped butterfly are Ω(N log log N/log...
We prove that planar graphs have poly-logarithmic queue number, thus improving upon the previous polynomial upper bound. Consequently, planar graphs admit 3D straight-line crossing-free grid drawings in small volume.
In this paper, we introduce a new partial consistency for constraint networks which is called Structural Consistency of level w and is denoted w-SC consistency. This consistency is based on a new approach. While conventional consistencies generally rely on local properties extended to the entire network, this new partial consistency considers global consistency on subproblems. These subproblems are...
Reliability and/or availability are increasingly important aspects in the design of systems, especially networks and service offerings. Optimization here is a multi-criteria process finding the right compromise between cost and quality. At the same time, results should be explored online, either as part of interactive, user-centric design tools or for Web based service negotiation. In this paper we...
In this paper, many ordinary graphs are subjected to Hamilton graph discrimination by using some necessary conditions and sufficient conditions proposed by many researchers in the past, and features of peaks (V), sides (E) and planes(r) of each graph are analyzed. In the same time, regulations including V = E and Hamilton circle divides into two planes: internal (yin) plane and external (yang) plane,...
On the basis of the modified nodal analysis, universal matrices-stamps are defined for modeling several types of current conveyor. From these stamps, the so-called Dragonfly Mason-Coates' graphs are derived for a fast hand-and-paper symbolic analysis of current-conveyor circuits.
The notion of universally utility-maximizing privacy mechanism was recently introduced by Ghosh, Rough garden, and Sundararajan [STOC 2009]. These are mechanisms that guarantee optimal utility to a large class of information consumers, simultaneously, while preserving Differential Privacy [Dwork, McSherry, Nissim, and Smith, TCC 2006]. Ghosh, Rough garden and Sundararajan have demonstrated, quite...
We present a Monte Carlo algorithm for Hamiltonicity detection in an n-vertex undirected graph running in O* (1.657n) time. To the best of our knowledge, this is the first superpolynomial improvement on the worst case runtime for the problem since the O*(2n) bound established for TSP almost fifty years ago (Bellman 1962, Held and Karp 1962). It answers in part the first open problem in Woeginger's...
Mobile agents are distributed programs which can move autonomously in a network, to perform tasks on behalf of user. Though mobile agents offer much more flexibility as compared to client-server computing, yet they have additional cost and issues such as security, reliability and fault tolerance which need to be addressed for successful adaptability of mobile agent technology for developing real life...
We give the first improvement to the space/approximation trade-off of distance oracles since the seminal result of Thorup and Zwick [STOC'01]. For unweighted graphs, our distance oracle has size O(n5/3) = O(n1.66⋯) and, when queried about vertices at distance d, returns a path of length 2d + 1. For weighted graphs with m = n2/α edges, our distance oracle has size O(n2/3√α) and returns a factor 2 approximation...
Given a weighted graph, the maximum weight matching problem (MWM) is to find a set of vertex-disjoint edges with maximum weight. In the 1960s Edmonds showed that MWMs can be found in polynomial time. At present the fastest MWM algorithm, due to Gabow and Tarjan, runs in Õ(m√n) time, where m and n are the number of edges and vertices in the graph. Surprisingly, restricted versions of the problem,...
We present a general method of designing fast approximation algorithms for cut-based minimization problems in undirected graphs. In particular, we develop a technique that given any such problem that can be approximated quickly on trees, allows approximating it almost as quickly on general graphs while only losing a poly-logarithmic factor in the approximation guarantee. To illustrate the applicability...
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.