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.
Multicast is a communication model in which a message is sent from a source to an arbitrary number of distinct destinations. Two main parameters that are used to evaluate multicast routing are the time it takes to deliver the message to all destinations and the traffic, i.e., the total number of links involved in the multicast process. It has been proved that finding an optimal multicast solution...
The logic mapping problem and the problem of finding a largest square sub-crossbar with no defects in a nano-crossbar with nonprogrammable crosspoint defects and disconnected wire defects have been known to be NP-hard. This paper shows that for nano-crossbars with only disconnected wire defects, the former remains NP-hard, while the latter can be solved in polynomial time.
We consider the operator mapping problem for in-network stream processing, i.e., the application of a tree of operators in steady-state to multiple data objects that are continuously updated at various locations in a network. Examples of in-network stream processing include the processing of data in a sensor network, or of continuous queries on distributed relational databases. Our aim is to provide...
Reuse of proven process models increases modeling efficiency and ensure the quality of process models. To provide a better support for reuse, the retrieval mechanisms of process repositories should be able to propose similar process models that ranked according to their similarity degrees to the query request. As a process model and a query request on process structure can both be viewed as rooted,...
Given a connected, weighted, undirected graph G=(V, E) and a bound D, bounded diameter minimum spanning tree problem (BDMST) seeks spanning tree on G with smallest weight in which no path between two vertices contains more than D edges. This problem is NP-hard for 4 les D les |V| - 1. This paper proposes three new multi-parent recombination operators using different methods to choose parents in genetic...
Classical ML decoders for multiple input multiple output (MIMO) systems like the sphere decoder, the Schnorr-Euchner algorithm, the Fano and the stack decoders suffer from high complexity for high number of antennas and large constellation sizes. In this paper, we propose the use of parallel processing for stack decoding, to decode signals transmitted on linear MIMO channels to reduce time consumption...
Soft-input soft-output (SISO) tree search algorithms provide a promising approach for complexity reduced iterative MIMO detection. Realizations based on depth-first search enable near max-log optimal detection at reduced but still high complexity. In this paper we introduce how SISO sphere detectors based on enhancements of single tree search and tuple search algorithms can be efficiently used in...
This paper addresses an attempt to evolve genetic algorithm by a particular modified partially mapped crossover method to make it able to solve the Traveling Salesman Problem. Which is type of NP-hard combinatorial optimization problems. The main objective is to look a better GA such that solves TSP with shortest tour. First we solve the TSP by using PMX (Goldberg and Lingle, 1985) and then a modified...
This paper deals with the problem of wrapper-based feature subset selection in classification oriented datasets with a (very) large number of attributes. In such datasets sophisticated search algorithms like beam search, branch and bound, best first, genetic algorithms, etc., become intractable in the wrapper approach due to the high number of wrapper evaluations to be carried out. One way to alleviate...
Mining frequent itemsets over online data streams, where the new data arrive and the old data will be removed with high speed, is a challenge for the computational complexity. Existing approximate mining algorithms suffer from explosive computational complexity when decreasing the error parameter, isin, which is used to control the mining accuracy. We propose a new approximate mining algorithm using...
Scientific workflow management systems are increasingly providing the ability to manage and query the provenance of data products. However, the problem of differencing the provenance of two data products produced by executions of the same specification has not been adequately addressed. Although this problem is NP-hard for general workflow specifications, an analysis of real scientific (and business)...
It is widely realized that the integration of information retrieval (IR) and database (DB) techniques provides users with a broad range of high quality services. A new challenging issue along the same direction is IR-styled m-keyword query processing in a RDBMS framework over an open-ended relational data stream. The capability of supporting m-keyword queries over a relational data stream makes it...
In this paper, the problem of A-order of binary tree is studied with the PRAM(Parallel Random Access Machine) model of parallel computation and a parallel algorithm for A-order of binary tree is proposed. The process of the parallel algorithm is proceed with detailed description and verified analysis with an application instance. The parallel algorithm of A-order of binary tree provides using and...
State-of-the-art integral-equation-based solvers rely on techniques that can perform a matrix-vector multiplication in O(N) complexity. In this work, a fast inverse of linear complexity was developed to solve a dense system of linear equations directly for the capacitance extraction of any arbitrary shaped 3D structure. The proposed direct solver has demonstrated clear advantages over state-of-the-art...
A graph G with n vertices and m edges is a Laman graph, or equivalently a generically minimally rigid graph, if m = 2n - 3 and every induced subset of k vertices spans at most 2k - 3 edges. Laman graphs play a fundamental role in rigidity theory. We discuss the verification problem: Given a graph G with n vertices, decide if it is Laman. We present an algorithm that recognizes Laman graphs in O(Tst...
The purpose of the group key management is to provide a secure key sharing scheme among the users in a group on a broadcast or a multicast environment. CRGK[1] is the centralized group key management scheme based on the Chinese remainder theorem (CRT). It optimizes the number of rekey message, user-side key computation, and number of key storage. However, CRGK is suited for a small size user group...
Many large scale systems, like grids and structured peer to peer systems, operate on a constrained topology. Since underlying networks do not expose the real topology to the applications, an algorithm should build and maintain a virtual topology for the application. This algorithm has to bootstrap the system and react to the arrival and departures of processes. In a previous article, we introduced...
ZigBee is a well accepted industrial standard for wireless sensor networks based on IEEE 802.15.4. Since aiming for the application of low data rate, low price and low power consumption, ZigBee networks have the limited resources such as computation complexity and storage space. So it is especially important to design an efficient and effective routing protocol to save the consuming energy and extend...
This article had a formalizing description to the structure of logic compound sentences (LCS) in the course of decompilation. It applied the Logic diagram to the recognition of LCS which belongs to graph theory. The recognition arithmetic overcame the shortcomings of some typical current approaches. Furthermore, this article introduced logical correlation matrices in the solution to the Logic diagrams,...
This paper proposes an optimizing nesting algorithm with heuristic search, which expresses the nesting process of rectangular blocks by building binary trees. With the combination rule and adjacency rule being applied, the algorithmic complexity can be decreased rapidly and nesting solutions can also be improved greatly to satisfy industrial demands.
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.