It is known that the problem of computing the permanent of a given matrix is #P hard. However, Alexander I. Barvinok has proven that if we fix the rank of the matrix then its permanent can be computed in strongly poly...
详细信息
Direct implementations of bilateral filtering show O(r(2)) computational complexity per pixel, where r is the filter window radius. Several lower complexity methods have been developed. State-of-the-art low complexity...
详细信息
ISBN:
(纸本)9781424479948
Direct implementations of bilateral filtering show O(r(2)) computational complexity per pixel, where r is the filter window radius. Several lower complexity methods have been developed. State-of-the-art low complexityalgorithm is an O(1) bilateral filtering, in which computational cost per pixel is nearly constant for large image size. Although the overall computational complexity does not go up with the window radius, it is linearly proportional to the number of quantization levels of bilateral filtering computed per pixel in the algorithm. In this paper, we show that overall runtime depends on two factors, computing time per pixel per level and average number of levels per pixel. We explain a fundamental trade-off between these two factors, which can be controlled by adjusting block size. We establish a model to estimate run time and search for the optimal block size. Using this model, we demonstrate an average speedup of 1.2-26.0x over the pervious method for typical bilateral filtering parameters.
In this paper, we describe the cognitive radios sharing the spectrum with licensed users and its effects on operational coexistence with unlicensed users. Due to the unlicensed spectrum band growing needs and usage by...
详细信息
ISBN:
(纸本)9781424493289
In this paper, we describe the cognitive radios sharing the spectrum with licensed users and its effects on operational coexistence with unlicensed users. Due to the unlicensed spectrum band growing needs and usage by many IEEE 802.11 protocols, normal wireless radio operation sees high interference leading to high error rates on operational environments. We study the licensed bands and the characteristics of the unlicensed bands in general and more specific to radio characterization of individual radios and cognitive deployment of sensor networks and its effect on lifetime. The cognitive radio signals detection algorithm for this probabilistic model for the unlicensed users, uses a mobility model which takes into account the threshold variable ratio Eb/No and also calculates the lower-bound of the combined value of secondary user interference for overlapping frequencies with the primary user. By using simulation, we detect the primary user when the radio frequencies are known a priori and compare it when the frequencies are unknown. In our analysis we exploit the similarity measure seen at each sub-channel frequency, which are due to multiple paths of the same reflected signal by maximizing the correlated information of the correlation matrix. For the general case the co-variance matrix for blind source separation, we use ICA de-correlation methods and show that cognitive radio can efficiently identify users in complex situations. The effects of large deployment and cognitive sensor network are studied for a family of 802.15.4 radios adapting to power-aware algorithms.
The wireless transmission characteristics of RFID system is vulnerable to be attacked and theft within communication,to people adopt the physical methods and authentication encryption methods to enhance system securit...
详细信息
The wireless transmission characteristics of RFID system is vulnerable to be attacked and theft within communication,to people adopt the physical methods and authentication encryption methods to enhance system security,authentication encryption methods is more useful due to its simple *** this paper,we analysis of security vulnerabilities exist in the commonly used authentication protocol based on Hash function,on this basis bring forward a modified *** compare them in security,data storage condition and complexity of the algorithm,it can prove that the improved protocol has a very good improvement for RFID system’s overall performance,particularly in security.
Based on the classic dynamic programming solution to solve the 0-1 knapsack problem,we give an improved algorithm called ***,in order to decrease the space complexity of IKP,we combine divided-and-conquered strategy w...
详细信息
Based on the classic dynamic programming solution to solve the 0-1 knapsack problem,we give an improved algorithm called ***,in order to decrease the space complexity of IKP,we combine divided-and-conquered strategy with IKP to obtain a new algorithm *** Analysis shows that DKP has a great advantage over IKP in running time and resource ***,DKP has a better time complexity than some known algorithms for the 0-1 knapsack problem,and it has high parallel,in which way DKP can relief the tension of memory cost.
In this paper,Structure and properties of neural networks with quadratic junction are *** learning rules about the neural networks are *** this kind of neural networks,an ART-based hierarchical clustering algorithm is...
详细信息
In this paper,Structure and properties of neural networks with quadratic junction are *** learning rules about the neural networks are *** this kind of neural networks,an ART-based hierarchical clustering algorithm is *** algorithm can determine the number of clusters and clustering *** time and space complexity of the algorithm are discussed.A 2-D artificial data set is used to illustrate and compare the effectiveness of the proposed algorithm and K-means algorithm.
In order to reduce the algorithm complexity of the target coverage problem which is a NP-complete problem,we design three approaches to shorten the network *** firstly delete redundant sensor nodes,secondly remove the...
详细信息
In order to reduce the algorithm complexity of the target coverage problem which is a NP-complete problem,we design three approaches to shorten the network *** firstly delete redundant sensor nodes,secondly remove the redundant targets,and thirdly divide the target-coverage graph into independent sub-graphs,and present the construct independent sub graph algorithm(CISGA) to divide target-coverage *** results show that CISGA could reduce 30% of network scale and greatly reduce the algorithm complexity of target coverage problem.
In facing the problem of building a complex yet fast and resource efficient Enterprise Resource Planning (ERP) or Extended Resource Planning (XRP) system the first obstacle is the creation of a Bill of Materials (BoM)...
详细信息
ISBN:
(纸本)9789537138158
In facing the problem of building a complex yet fast and resource efficient Enterprise Resource Planning (ERP) or Extended Resource Planning (XRP) system the first obstacle is the creation of a Bill of Materials (BoM) algorithm, which is used to calculate material needs according to the production plan. Taking into consideration different possibilities of BoM implementation, we compared linked lists, tree structure and matrix implementation in relation to algorithm complexity. As we came to the conclusion that none of them suits the needs of modern systems, we proposed a new BoM algorithm called multiple linked list implementation. It combines the advantages of other implementations with a new approach based on two complex data structures used to represent both the data and relationships between products, parts or components used in production.
This paper presents a way of using the natural evolution process as a model for combinatorial design constructions. In spite of the fact that metaheuristic proved its efficiency on a variety of problems, there are onl...
详细信息
ISBN:
(纸本)9789537138158
This paper presents a way of using the natural evolution process as a model for combinatorial design constructions. In spite of the fact that metaheuristic proved its efficiency on a variety of problems, there are only a few known cases of implementing it on combinatorial designs. The genetic algorithm developed here was able to construct BIBDs by searching through the natural solution space without any additional constraints. Among all the obtained positive results, new simple designs with parameters 2-(14,4,6) and 2- (18, 4, 6) should be pointed out.
First, the result was proved that two matrices tensor product can be exchanged in the sense of permutation similar and this explants that the tensor product of block matrixes can be block calculated in the sense of pe...
详细信息
First, the result was proved that two matrices tensor product can be exchanged in the sense of permutation similar and this explants that the tensor product of block matrixes can be block calculated in the sense of permutation similar. Second, the convenient constructing method for the permutation matrix is given. Third, the parallel computing models of matrix tensor product are proposed. Final, the thought and process of the algorithm are showed by an example.
暂无评论