Many applications of wireless sensor networks (WSN) require information about the geographical location of each sensor node. Self-organization and localization capabilities are one of the most important requirements in sensor networks. This paper provides an overview of centralized distance-based algorithms for estimating the positions of nodes in a sensor network. We discuss and compare three approaches: semidefinite programming, simulated annealing and two-phase stochastic optimization-a hybrid scheme that we have proposed. We analyze the properties of all listed methods and report the results of numerical tests. Particular attention is paid to our technique-the two-phase method-that uses a combination of trilateration, and stochastic optimization for performing sensor localization. We describe its performance in the case of centralized and distributed implementations.
2
Dostęp do pełnego tekstu na zewnętrznej witrynie WWW
The paper considers the forecasting of the Warsaw Stock Exchange price index WIG20 by applying a state space wavelet network model of the index price. The approach can be applied to the development of tools for predicting changes of other economic indicators, especially stock exchange indices. The paper presents a general state space wavelet network model and the underlying principles. The model is applied to produce one session ahead and five sessions ahead adaptive predictors of the WIG20 index prices. The predictors are validated based on real data records to produce promising results. The state space wavelet network model may also be used as a forecasting tool for a wide range of economic and non-economic indicators, such as goods and row materials prices, electricity/fuel consumption or currency exchange rates.
3
Dostęp do pełnego tekstu na zewnętrznej witrynie WWW
The paper deals with the issue of reducing the dimension and size of a data set (random sample) for exploratory data analysis procedures. The concept of the algorithm investigated here is based on linear transformation to a space of a smaller dimension, while retaining as much as possible the same distances between particular elements. Elements of the transformation matrix are computed using the metaheuristics of parallel fast simulated annealing. Moreover, elimination of or a decrease in importance is performed on those data set elements which have undergone a significant change in location in relation to the others. The presented method can have universal application in a wide range of data exploration problems, offering flexible customization, possibility of use in a dynamic data environment, and comparable or better performance with regards to the principal component analysis. Its positive features were verified in detail for the domain's fundamental tasks of clustering, classification and detection of atypical elements (outliers).
JavaScript jest wyłączony w Twojej przeglądarce internetowej. Włącz go, a następnie odśwież stronę, aby móc w pełni z niej korzystać.