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.
Range reduction is widely used in the element function library and high performance computing applications. A new rang reduction algorithm and an improved one based on the Payne and Hanek Algorithm are proposed. Using the 64-bit integer arithmetic unit, all the intermediate computation is optimized for its Parallelism, table size and throughput, and the improved one base on it debases the complexity,...
The presence of design flaws in a software system has a negative impact on the quality of the software, as they indicate violations of design practices and principles, which make a software system harder to understand, maintain, and evolve. Software defects are tangible effects of poor software quality. In this paper we study the relationship between software defects and a number of design flaws....
Many trust evaluation models have been proposed for P2P networks recently. While in these models, nodes usually need to record all nodes' trust, or the time complexity is high. In our paper, we propose a trust evaluation model based on resistive network. In which, nodes only need to record their neighbors' trust and the time complexity is lower. The experiments and analysis show that, on the premise...
Why are n-player games much more complex than two-player games? Is it much more difficult to cooperate or to compete? n-player Cherries is the n-player version of Cherries, a two-player combinatorial game. Because of queer games, i.e., games where no player has a winning strategy, cooperation is a key-factor in n-player games and, as a consequence, n-player Cherries played on a set of rows is PSPACE-complete.
In multiprogramming environment, where two processes may compete for a finite number of instances of the same resource type, occurrence of deadlock between them is very usual situation. Key task is to get the appropriate recovery from deadlock such that every process get fair result and resources must not preempted from same process every time. This paper proposes a payoff matrix approach that resolve...
Based on the classic dynamic programming solution to solve the 0-1 knapsack problem, we give an improved algorithm called IKP. Further, in order to decrease the space complexity of IKP, we combine divided-and-conquered strategy with IKP to obtain a new algorithm DKP. Our Analysis shows that DKP has a great advantage over IKP in running time and resource cost. Moreover, DKP has a better time complexity...
In mathematics science, subtraction is rather simple computation of arithmetic. However, no matter what advanced computer in the world, and no matter what backward calculator (such as abacus in China etc.) in people's hand, to get difference of subtraction is always a NP problem in all the time. Such as capacities of numbers Minuend and Subtrahend, symbols (±) of number value (positive number or negative...
In order to establish 3D solid model in geological fields, the key question is to obtain complete ore grade attribute data. Traditional forecasting methods such as neural networks, support vector machine (SVM) are adopted frequently. However, these methods are lack of necessary probability information and can not acquire the uncertainty of forecasts. In this paper, a new forecasting model is proposed...
A virtual view rendering oriented fast algorithm is proposed to reduce computational complexity of multiview depth video coding. Firstly, the depth image is divided into depth-continuity and depth-discontinuity regions by a macroblock deviation factor. Then, imbalance macroblock mode distribution of depth-continuity regions and effect of image quality degradation in depth-discontinuity regions on...
Mutual information (MI) is a well accepted similarity measure for image registration. However, MI based registration faces the challenges of high computational complexity, low registration efficiency and high likelihood of being trapped into local optima due to an absence of spatial information. In this paper, we propose a new multiscale registration framework based upon an edge preserving total variation...
We consider an off-line modified delayed-start LPT algorithm that optimally schedules the first longest 7 jobs and the remaining jobs according to the LPT rule on two identical parallel machines. We show that this algorithm has a sharper tight worst-case ratio bound 1+1/81 than the traditional LPT algorithm for the sum of squares of machine completion times minimization problem.
The JPEG that applies discrete cosine transform (DCT) is one of the most popular image compression methods. Enhancement in the compressed domain offers two major advantages, including low computational complexity and storage space. To enhance an image in compression domain, the main issue is to develop an effective technique that limits the introduction of blocking artifacts. In this paper, we propose...
A method which Using DEM file and JAVA 3D to generate three-dimensional terrain, apply the ray method to pick up, archive the point pick up in three-dimensional terrain. Using binary search idea, and get the time complexity O(NlogN) algorithm in three-dimensional pick up.
H.264 video coding standard can achieve considerably higher coding efficiency than previous standards. However, this comes at a cost in considerably increased complexity at the encoder and thus increases the difficulty in hardware implementation. The computation complexity is mainly due to motion estimation in combination of variable block sizes and multi-reference frames. With the initialized searching...
Wireless sensor networks consist of various sensor nodes which operate in a memory, energy and bandwidth constrained environment. Target tracking is an important application in wireless sensor networks and in this paper we propose an energy aware target tracking (EATT) algorithm. Energy efficiency is obtained due to the novel concept of tracking being performed in a collaborative manner by different...
The conventional matrix inversion method for weighted geometric dilution of precision (WGDOP) calculation has a large amount of operation. This paper employs an artificial neural network approach, namely, the resilient back-propagation (Rprop) method to implement WGDOP. We also present two novel architectures to implement the Rprop-based WGDOP. Simulation results show that the proposed architectures...
Digital watermarking is an important technical measure for Intellectual property right protection. Due to the short lifetime of battery of portable device, reducing the energy consumption in this type of the device is sorely needed. In this paper, we proposed an energy efficient, low complexity, robust and secure watermarking algorithm in DS-CDMA communication. In this method, we spread multiple watermarks...
This paper proposes a new computationally efficient method for two-dimensional (2-D) direction-of-arrivals (DOAs) estimation of multiple correlated narrowband signals impinging on an L-shaped sensor array structured by two uniform linear arrays (ULAs). In the proposed method, the azimuth and elevation angles are estimated independently from the cross-correlation matrices between the received data...
Power control has been extensively studied as an important way of mitigating interference and providing minimum signal to interference plus noise ratio (SINR) guarantees. Such formulation of power control is well-motivated in cellular PCS and UMTS, as both voice and streaming media require guaranteed short-term rates. A key difficulty is that the problem can easily become infeasible, implying that...
Bayesian filtering appears in many signal processing problems, reason which has attracted the attention of many researchers to develop efficient algorithms, yet computationally affordable. Ranging from Kalman Filter (KF) to particle filters, there is a plethora of alternatives depending on model assumptions. We focus our interest into a recently developed algorithm known as the square-root Quadrature...
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.