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.
Evaluating an extremely useful graph property, the spectral radius (largest absolute eigenvalue of the graph adjacency matrix), for large graphs requires excessive computing resources. This problem becomes especially challenging, for instance with distributed or remote storage, when accessing the whole graph itself is expensive in terms of memory or bandwidth. One approach to tackle this challenge...
Let h: ℤ+ → ℤ+ \ {1} be such that (1) h(n) ≤ lg n for all sufficiently large n and (2) h(n) and ⌈n1/h(n)⌉ are computable from n in O(h(n) · n1+1/h(n)) time. We show that given an n-point metric space (M,d), the problem of finding argmini∈M Σj∈Md(i,j) (breaking ties arbitrarily) has a deterministic, O(h(n) · n1+1/h(n))-time, O(n1+1/h(n))-query, (2h(n))-approximation and nonadaptive algorithm. Our derivations...
This paper proposes a novel symbol-to-bit demapping algorithm for Gray-labeled phase shift keying (PSK) constellations. Unlike the Max-Log-MAP demapper, the proposed algorithm does not perform exhaustive search operations, but directly computes the soft information by exploiting the binary search and the symmetry of the Gray-labeled PSK constellations. Hence its complexity is remarkably reduced from...
The problem of achieving minimum time consensus for an N-agent system, with double integrator agents having bounded inputs, is considered. At the initial time instant, each agent has access to the state information about all the other agents. An algorithm, of O(N2) complexity, is proposed to compute the final consensus target state and minimum time to achieve this consensus. Further, local control...
The problem of counting solutions in CSP, called #CSP, is an extremely difficult problem that has many applications in Artificial Intelligence. This problem can be addressed by exact methods, but more classically it is solved by approximate methods. Here, we focus primarily on the exact counting. We show how it is possible to improve the methods based on structural decomposition by offering to enhance...
Chiastic structure is a figure of speech technique which displays symmetric structure of textual units. It is mainly used to convey an important point of speech or writing to the audience effectively. Hence, when it can be discovered computationally, it can add additional value to the understanding of the salient points of the input text. In this paper, we present an efficient linear-time algorithm...
When test sets are generated according to a coverage criterion, it is often sufficient to fix values only for some of the inputs to achieve 100% coverage. Other inputs are immaterial and the coverage is achieved with any of their values ("don't care" values). The research question is: How do these "don't care" values (which can reach up to 20% of all input values) influence the...
In the process of program analysis, the error detection usually gathers the information of the target position from the path sensitive analysis, which would include some useless dataflow information, thus leading to low analysis efficiency. In this process, the states of the target position usually are combined to solve the path explosion problem, but this would result to high time consumption and...
The main features of current real-world networks are their large sizes and structures, which show varying degrees of importance of the nodes in their surroundings. The topic of evaluating the importance of the nodes offers many different approaches that usually work with unweighted networks. We present a novel, simple and straightforward approach for the evaluation of the network's nodes with a focus...
Big data analytics is the process of examining large amounts of data of a variety of types (big data) to uncover hidden patterns, unknown correlations and other useful information. Its revolutionary potential is now universally recognized. Data complexity, heterogeneity, scale, and timeliness make data analysis a clear bottleneck in many biomedical applications, due to the complexity of the patterns...
The web has evolved in a scale free manner, with available information about different entities developing in different forms, different locations, and at massive scales. This paper addresses the cognitive limitations that information analysts typically experience as they approach the boundaries where automated analysis algorithms are sorely needed. An experiment is conducted to explore information...
Traditional Chinese Medicine (TCM) is a holistic approach to medicine which has been in use in China for thousands of years. The main treatment, Chinese Medicine Formula, is prescribed by combining sets of herbs to address the patient's syndromes and symptoms based on clinical diagnosis. Although herbs are often combined based on various classical formulas, the underlying principles for the choice...
Device-to-device networks (D2D) underlaying cellular networks have been widely recognized as one of the major approaches for ubiquitous information exchange featuring future Internet of things (IoT). In this paper, we propose an interference-aware routing for wireless D2D networks. Our objective for routing is to minimize the hop-count, which can decrease not only the delay for D2D connections, but...
There are a number of algorithms which provide methods to encrypt parts of video frames to make them unrecognizable or degraded. The proposed scheme treats the video as a sequence of ordered frames and provides an algorithm to break this order of frames by first distributing frames into n frame-sequences and then by internally scrambling these frame-sequences using proper keys. Any of these frame...
The present paper focuses on the problems of verifying compliance for global achievement and maintenance obligations. We first introduce the elements needed to identify and study compliance to these two classes of obligations in processes. Additionally, we define procedures and algorithms to efficiently deal with the identified compliance problem. We finally show that both algorithms proposed in the...
In this paper, we introduce a single image super resolution based on non-parametric local information. The basic idea of the proposed method is to use a property, which is inferred by relations between input and its lower resolution images, of an unknown high resolution image. The experimental results show the efficiency of the proposed algorithm compared to a state-of-the-art method. Besides, the...
Data process in Cloud or IoT (Internet of Things) sometimes implies continuous real-time queries as data streams. In order to acquire extreme value of data stream over time-based sliding window, traditional approaches computed the exact solution through vast space especially under ultra circumstances like high-rate or high-concurrency. In this paper, we design space-bounded synopsis data structure...
This paper propose a novel, induction based replicative patterns algorithm towards searching all routes in a unidirectional flow network. The fundamental approach is to generate all paths from a source node to sink node (destination node), represented in a two-dimensional matrix applying the proposed induction based on replicative patterns of matrix cells. It is found that, by starting a network with...
Top-k pairs queries have received significant attention by the research community. k-closest pairs queries, k-furthest pairs queries and their variants are among the most well studied special cases of the top-k pairs queries. In this paper, we present the first approach to answer a broad class of top-k pairs queries over sliding windows. Our framework handles multiple top-k pairs queries and each...
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.