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.
Finite fields were successfully used to construct algebraic low-density parity-check (LDPC) codes, especially Quasi-Cyclic LDPC codes. These LDPC codes with large minimum distances have lower error floor, linear complexity of encoding and are more practical for hard-decision algebraic decoding. In this paper, we show that finite fields can also be successfully used to construct algebraic low-density...
With the rapid development of software defined networking and network function virtualization, researchers have proposed a new cloud networking model called Network-as-a-Service (NaaS) which enables both in-network packet processing and application-specific network control. In this paper, we revisit the problem of achieving network energy efficiency in data centers and identify some new optimization...
Finding critical nodes in a network is a significant task, highly relevant to network vulnerability and security. We consider the node criticality problem as an algebraic connectivity minimization problem where the objective is to choose nodes which minimize the algebraic connectivity of the resulting network. Previous suboptimal solutions of the problem suffer from the computational complexity associated...
K-means is the most widely used clustering algorithm due to its fairly straightforward implementations in various problems. Meanwhile, when the number of clusters increase, the number of iterations also tend to slightly increase. However there are still opportunities for improvement as some studies in the literature indicate. In this study, improved implementations of k-means algorithm with a centroid...
In this paper, we study a construction of binary switch codes. A switch code is a code such that a multi-set request of information symbols can be simultaneously recovered from disjoint sets of codeword symbols. Our construction is optimal in the sense that it has the smallest codeword length given its average encoding degree, which is logarithmic in the code dimension. Moreover, the number of queries...
In this paper, we propose two new designs for the barrel shifter: i) a quantum ternary unidirectional barrel shifter (Design I) and ii) a quantum ternary bidirectional barrel shifter (Design II). We present the design of Ternary Peres Gate (TPG). The designs of ternary barrel shifters show that circuits are composed of proposed Ternary Peres Gates, Modified Fredkin Gates and Ternary Feynman Gates...
This paper presents an overview of methods for combinational, base-two logarithmic approximation using Mitchell's algorithm, piecewise-linear/quadratic error compensation schemes, and direct approximation. Optimization methods are used for computing linear segments for each compensation scheme including Hamming weight minimization and pattern recognition of segment slopes for multiplier-less error...
Computational social choice represents a new research area that brings together social choice theory and computer science. One of the most important topics in computational social choice is the use of the voting theory as part of the solutions for various problems in computer science. In this paper we propose a formal representation approach for voting methods using complexity functions. Also, using...
The ability to automatically detect faults or fault patterns to enhance system reliability is important for system administrators in reducing system failures. To achieve this objective, the message logs from cluster system are augmented with failure information, i.e., The raw log data is labelled. However, tagging or labelling of raw log data is very costly. In this paper, our objective is to detect...
In this paper a technique is proposed to simplify testing of software using dependency graphs. Dependency graphs help to highlight dependencies in the software and isolate pieces of code that would run independent of each other. By doing graph based tests, we could ensure full path coverage. Also, if defects are found, dependency graphs would help to isolate the defects to different independent parts...
This paper shows on how the real algorithms for the reduction a modulo arbitrary polynomial and fast Vandermonde transform (FVT) are realized on computer using fast Fourier transform (FFT). This real-valued FVT algorithm on the developed fast reduction polynomial algorithm is based. The realization of FVT algorithm on computer with real multiplicative complexity O(2Nlog22N) and real additive complexity...
This paper introduces a 2-D index map coding of the palette mode in screen content coding extension of the High-Efficiency Video Coding (HEVC SCC) standard to further improve the compression performance. In contrast to the current 1-D search using RUN to represent the length of matched string, we bring the block width and height to describe the arbitrary rectangle shape. We also use the block vector...
Dube and Beaudoin have proposed a technique of lossless data compression called compression via substring enumeration (CSE) for a binary source alphabet. Dube and Yokoo proved that CSE has a linear complexity both in time and in space worst-case performance for the length of string to be encoded. Dubé and Yokoo have specified appropriate predictors of the uniform and combinatorial prediction models...
Both Gaussian integers and Lucas sequences have been applied in cryptography. This paper presents the mathematical relationship between Lucas sequences and Gaussian integers. It also explores the complexity of Discrete Logarithm Problem (DLP) for Gaussian integers modulo prime by reducing it to Lucas Sequences DLP and real integer DLP. We demonstrate that the algorithms based on the Gaussian Integer...
A systolic serial squarer for unsigned numbers, which operates without zero words inserted between successive data words, outputs the full product and has immediate response, is presented. The systolic form is obtained by merging two adjacent multiplier cells, and the continuous operation is achieved by dividing the squaring procedure in two pipelined stages.
The set of objects having same characteristics are organized in groups and clusters of these objects reformed known as Data Clustering. It is an unsupervisedlearning technique for classification of data. K-means algorithm is widely used and famous algorithm for analysis of clusters. In this algorithm, n number of data points are divided into k clusters based on some similarity measurement criterion...
The recent advancements in the game theory have led to it being applied in various applications such as communication, networks, business, biology, political system etc. Precisely, Max-Min Algorithm is a decision based rule used in the game theory for deciding the next step of a player out of a set of possible steps. It can be thought of maximizing the minimum profit of the player. The assumption...
In this paper, we investigate the performance of the low-complexity algorithms based on Likelihood Ascent Search (LAS) and Tabu Search (TS) for detection in MIMO systems with channel estimation errors. Here, we briefly review the algorithms for LAS and TS and their variants and subsequently compare them for various MIMO settings. We provide the simulation results for BER performance in 2× 2, 4× 4...
Static Graphs consist of a fixed sequence of nodes and edges which does not change over time, hence lack in providing the information regarding evolution of the network. In contrast, Dynamic Graphs to a greater extent relate to real-life events and so provide complete information about the network evolution. That is why many researchers [1, 2, 3, 5, 6, 7, 8, 9 and 10] have developed interest in mining...
The Game of the Amazons is a two-player abstract territory game. It has attracted attention in game research because of its simple rules and its complexity of play. A number of Amazons-playing programs have emerged in recent years. Different search algorithms are used in Amazons programs. Minimax is one of the most commonly used Amazons search algorithms. It is usually optimized with augmentations,...
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.