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.
Edge contraction simplification based on DEM terrain algorithm is proposed as a new terrain simplification algorithm which is based on DEM terrain data characteristics. The algorithm introduces the gradient of triangle, and combines with gradient and the length of edges as weight of the vertex to represent the importance of a vertex. By using the vertex weight, we can constrain the region being affected...
Discernibility matrix method is an important method to design algorithm for computing the core based on information entropy. In this method, the core is found by discovering all discernibility elements of discernibility matrix. So this method is very time consuming. To improve the efficient of computing the core based on information entropy, the core of the simplified decision which is the same as...
It is well known that the circulant matrices are very important and special matrix. In recent years, various type of circulant matrices have been applied in such as signal dealing and oil exploration, and so on. In this paper, motivated by [Shen Guangxing (2004)], we give a fast algorithm for evaluating the m-th power of level-k(r1, r2, ??????, rk)-circulant matrices of type (n1, n2, ??????, nk)....
The typical algorithm of text clustering is a ldquoHard Partitionrdquo one, Actually, Chinese text is better to treat with ldquoSoft Partitionrdquo for its diversity and largeness. The fuzzy-set theory supply a powerful analyzing tool to this ldquoSoft partitionrdquo. Traditional fuzzy text clustering methods mostly are getting the fuzzy equivalent matrix or fuzzy division by iterating the matrix...
In decision making problems there may be cases in which decision makers do not have an in-depth knowledge of the problem to be solved. In such cases, more and more research has been conducted within a fuzzy or intuitionistic fuzzy framework. In this paper, we investigate the group decision making problems in which all the evaluation information provided by the decision makers is characterized by intuitionistic...
We study the average distortion introduced by quantizing compressive sensing measurements. Both uniform quantization and non-uniform quantization are considered. The asymptotic distortion-rate functions are obtained when the measurement matrix belongs to certain random matrix ensembles. Furthermore, we adapt two well-known compressive sensing reconstruction algorithms to accommodate the quantization...
In order to solve the shortcoming of computing core and attribute reduction from inconsistent decision table, in the paper, firstly, the definitions of compatible simplified decision table and compatible simplified discernibility matrix are given, and then the methods of computing core and attribute reduction are put forward. It is proved that the core and reduction acquired from the property are...
This paper presents a method to construct irregular structured low-density parity-check (LDPC) codes based on choosing different identity matrices. The parity-check matrix of the proposed code can be easily generated with the flexible parameters such as code rate, block length or sparsity. The proposed code is well structured which can provide a low-complexity implementation. The encoder of the proposed...
The multiple constant multiplication (MCM) implementation of polyphase decomposed finite impulse response (FIR) filters can be formulated as (1) one MCM block with all coefficients, (2) one MCM block for each subfilter, or (3) as a matrix MCM block. The coefficient symmetry of linear phase FIR filters, however, is not exploited in the later two formulations. In this paper, we investigate the MCM implementation...
The elements of discernibility matrix are used as the heuristic information by all the existing attribute reduction algorithms based on discernibility matrix. The time and space complexities of this kind of algorithms are O(\C\2|U\2). To lower the time and space complexities, the simplified decision table and simplified discernibility matrix is introduced, and proved that the non-empty elements of...
To the information system which possesses dynamic characteristic, the discernable matrix of S-rough set is put forward based on S-rough set attribute transfer theory, and a new fast attribute reduction algorithm is presented based on discernable matrix of S-rough set in this paper. The algorithm makes up the localization of Z.Pawlak rough set theory in disposing dynamic system knowledge discovery,...
As a growing attention is currently paid to low-cost energy-efficient radiolocation functionalities in a wide variety of wireless networks, one recurrent concern is to reduce the required processing time and the complexity of practical positioning estimators under deployment constraints (i.e. in terms of infrastructure, embedded computational capability and/or available measurements), while meeting...
In the context of MIMO communication systems, an iterative-recursive algorithm for the computation of the matrix left-pseudoinverse is proposed. Several matrix theory properties are considered for computational complexity reductions. The algorithm works properly due to the classic assumptions on the statistical characteristics of the MIMO channel elements. Considerable improvements in the algorithmic...
In this paper, we propose a novel method with low complexity for constructing quasi-cyclic LDPC codes. The algorithm chooses every circulant permutation matrix sequentially, and makes sure that the current circulant permutation matrix forms no cycles of length 4 and 6 with the existent matrices, finally a family of (3,L) QC-LDPC codes with girth at least 8 is obtained. The main complexity of the algorithm...
In this paper, we propose an efficient method for resolving the optimal discriminant vectors of generalized discriminant analysis (GDA) and point out the drawback of high computational complexity in the traditional class-incremental GDA [W. Zheng, "Class-Incremental Generalized Discriminant Analysis", Neural Computation 18, 979-1006 (2006)]. Because there is no need to compute the mean of...
State-of-the-art integral-equation based computational electromagnetic methods rely on techniques that can perform a matrix-vector multiplication in O(NlogN) operations, with N being the matrix size. In this work, a fast integral-equation-based solver was developed for solving large-scale electrodynamic problems. Both memory consumption and time complexity were shown to be O(N). The superior performance...
Visualization techniques are of increasing importance in exploring and analyzing large amounts of multidimensional data. A new visualization technique for the computation of 2-D DFT in terms of 2 times 2 Data and its analysis is presented. Since the visual representation gives direct relationship between time domain data and the frequency domain representation in terms of pictures, signal analysis...
In this paper we investigate the performance of linear interactive encoding and decoding (IED) for lossless source coding with decoder only side information. Assume that the source alphabet chi is a finite field and that the side information alphabet is finite. It is shown that there exist universal linear IED schemes which are asymptotically optimal for any stationary, ergodic source-side information...
Finding the matrix with the maximum singular value amongst a set of matrices is a common problem occurring in transmit signal processing algorithms for multiuser multiple-input multiple-output (MIMO) systems. However, computing the principal singular value of a matrix is a rather numerically complex task. Furthermore, in many practical scenarios, the number of users is large and for each user this...
Dominance-based Rough Set Approach (DRSA) is an extension of classical Rough Set Theory (RST) to deal with inconsistent problems. Approximation of class unions is the key method of DRSA and it is a very complex computing job. However, the formal work within DRSA only proposed relative definitions of the concept including approximation of class unions, but no efficient algorithm has been given. So...
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.