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.
Because the implicit Runge-Kutta method is hard to use, in addition, there is the lack of precision analysis for the implicit Runge-Kutta methods, three classic four-stage implicit Runge-Kutta methods are used to compare their calculation accuracy and the sensitivity of calculation step, these results provided reference for the selection of four-stage implicit Runge-Kutta methods.
A recently introduced data density based approach to clustering, known as Data Density based Clustering has been presented which automatically determines the number of clusters. By using the Recursive Density Estimation for each point the number of calculations is significantly reduced in offline mode and, further, the method is suitable for online use. The Data Density based Clustering method however...
A novel hardware Gaussian noise generator based on the Box-Muller method and the Coordinate Rotation Digital Computer (CORDIC) Algorithm is presented. The main novelties of this work are using Modified CORDIC Algorithm with Domain Folding (MDF-CORDIC) algorithm and expanding the range of convergence of the CORDIC algorithm to improve the operation accuracy for the elementary functions involved in...
Wireless Sensor Network as an important technology of Internet of things' development, is more and more widely used in various research fields. This paper mainly researches the part of localization application based on wireless sensor network, focuses on DV-Hop localization algorithm, and gives its algorithm simulation and analysis of the simulation results. Also this paper improves the algorithm...
Least Square (LS) estimation is a simple but not good enough for localization method which is widely used for target position estimation. The time difference of arrival (TDOA) location based on LS method needs to select a reference sensor to obtain a series of equations. Thus, the measured error of the selected first sensor will certainly influence the location accuracy. In our article, an algorithm...
The efficiency of solar power systems, either concentrating or non-concentrating, can be increased by incorporating a tracking system. The tracking controller requires the position of sun in the sky which can be obtained by using a sun position algorithm that calculates sun position in a certain coordinate system. This papers presents a method to calculate the sun position which could be useful in...
Most of the traditional indoor location algorithms based on the distance loss model always filter the received signal strength, and then we can use the distance loss model to infer the distance between the nodes and achieve location eventually. The accuracy of the traditional indoor location algorithm is very unstable due to multipath propagation effects and complex signal attenuation law in the indoor...
The wall distance is a parameter which must be specified in solving the Reynolds-Averaged Navier-Stokes equations with turbulence model. In this work, a layer-by-layer fast marching algorithm has been proposed to calculate the minimum distance from a flow field grid cell to the wall, for both structured and hybrid-unstructured meshes. The main principle of the algorithm is to consider the scattered...
A variety of measurement methods have been developed to obtain positions of nodes in wireless networks. However, most of existing positioning methods can only use limited types of measurement. These algorithms fail to exploit arbitrary measurement methods to improve the accuracy of positioning. In this paper, we propose a high-accuracy positioning algorithm which can utilize unlimited types of measurement...
Approximate computing is a promising approach in the design of low-power digital systems. There are two main approaches in approximate computing: the first relies on lowering the supply voltage level on specific computational blocks, while the second relies on completely truncating specific computational blocks. The second option is more aggressive; however, it is deterministic and leads to better...
In this paper, we propose a procedure for computing the dissimilarity measure of finite general type-2 fuzzy sets, represented as sequences of vertical slices. Through representing general type-2 fuzzy sets as a sequence of objects, we compute their overall dissimilarity value using suited matching algorithms for generalized sequences. The evaluation of the proposed matching algorithm is performed...
This paper focus on the use of local and global structures for fingerprint minutiae matching, we propose a set of modifications and improvements that increase the speed and accuracy. Reducing the number of minutiae pairs and descriptors are the principal amelioration in the local matching step, in the global matching step, we add more minutiae pairs to align the input fingerprint with the template...
Wireless sensor networks (WSNs) are widely used in many environments and adverse terrains. Location estimation of sensor nodes is still a crucial area of research because of new localization requirements. One of the main hurdles facing sensor localization in WSNs is accuracy. Many localization algorithms and techniques have been proposed to estimate the position of nodes. In this paper, we consider...
This paper proposes a two-stage algorithm to track the global maximum power point (GMPP) in non-uniform irradiance conditions. It uses randomly selected sample points on the P-V curve and corresponding power contours on the I-V curve to narrow down the search interval. Simulation results have demonstrated that the proposed method could successfully track the GMPP and consumes little time. Thus, it...
The positioning and orientation system consists of three-axis generating coils and three-axis sensor coils in quasi-static magnetic field. The three-axis generating coils are fixed orthogonally and excited by the alternating current (AC) signals with different frequencies. They create the magnetic field that is equivalent to that generated by three orthogonal magnetic dipoles. Using the amplitude...
The localization of nodes is essential for many applications in wireless sensor networks (WSN). Compared with the range-based localization schemes, the range-free ones are more suitable for WSN because of their low-cost and ease for implementation. DV-Hop is considered as one of the pioneering range-free localization methods. In this paper, we propose a new algorithm named Advanced DV-Hop (ADV-Hop)...
Linear least squares (LLS) estimation is a low complexity but sub-optimum method for estimating the location of a mobile terminal (MT) from some measured distances. It requires selecting one of the known fixed terminals (FTs) as a reference FT for obtaining a linear set of expressions. In this paper, a new method for selecting the reference FT is proposed, which selects the reference FT based on the...
Iterative Closest Point (ICP) is a widely exploited method for point registration that is based on binary point-to-point assignments, whereas the Expectation Conditional Maximization (ECM) algorithm tries to solve the problem of point registration within the framework of maximum likelihood with point-to-cluster matching. In this paper, by fulfilling the implementation of both algorithms as well as...
The solution of multi-output LS-SVR machines follows from solving a set of linear equations. Compared with ε-intensive SVR, it loses the advantage of a sparse decomposition. In order to limit the number of support vectors and reduce the computation cost, this paper presents a decremental recursive algorithm for multi-output LS-SVR machines. This algorithm removes one sample one time and large-scale...
In this paper we deal with the problem of feature selection by introducing a new approach based on Gravitational Search Algorithm (GSA). The proposed algorithm combines the optimization behavior of GSA together with the speed of Optimum-Path Forest (OPF) classifier in order to provide a fast and accurate framework for feature selection. Experiments on datasets obtained from a wide range of applications,...
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.