Serwis Infona wykorzystuje pliki cookies (ciasteczka). Są to wartości tekstowe, zapamiętywane przez przeglądarkę na urządzeniu użytkownika. Nasz serwis ma dostęp do tych wartości oraz wykorzystuje je do zapamiętania danych dotyczących użytkownika, takich jak np. ustawienia (typu widok ekranu, wybór języka interfejsu), zapamiętanie zalogowania. Korzystanie z serwisu Infona oznacza zgodę na zapis informacji i ich wykorzystanie dla celów korzytania z serwisu. Więcej informacji można znaleźć w Polityce prywatności oraz Regulaminie serwisu. Zamknięcie tego okienka potwierdza zapoznanie się z informacją o plikach cookies, akceptację polityki prywatności i regulaminu oraz sposobu wykorzystywania plików cookies w serwisie. Możesz zmienić ustawienia obsługi cookies w swojej przeglądarce.
This study aims to reduce the statistical uncertainty of the correlation coefficient matrix in the mean-variance model of Markowitz. A filtering algorithm based on minimum spanning tree (MST) is proposed. Daily data of the 30 stocks of the Hang Seng Index (HSI) and Dow Jones Index (DJI) from 2004 to 2009 are selected as the base dataset. The proposed algorithm is compared with the Markowitz method...
A new edge detection method (CEED (Contrast Enhancement Edge Detection)) using neighborhood contrast is proposed in this paper, which does not utilize template operator. The edge detection frame for contrast enhancement is established and the corresponding algorithm is given. After defining the contrast evaluation function and edge structure candidate set, the contrast matrix of original image is...
This study's objective is to solve visualization problem of hierarchical structure for the index. The problem is formulated as determining the midpoint of the memory function and constructing the circulation modules. The time complexity of visualization algorithm is analyzed with the way of incremental expression. Through using the MATLAB to draw hierarchical structure of the index of the sample stocks...
This study's objective is to assess the performance of the common Prim and the Kruskal of the minimum spanning tree in building up super metric space. We proposed the use of complexity analysis and experimental methods to assess these two methods. After the analysis of the sample data of Shanghai and Shenzhen 300 index daily from the second half of 2005 to the second half of 2007, The results showed...
This study's objective is to solve performance evaluation problem of PC cluster in processing seismic data intensive computing. The objective of performance evaluation is determining the relationship between the number of PC node and the scale of tasks to be processed to decide whether the transaction of seismic data processing should be transformed from mainframe computer to PC cluster platform....
This study's objective is to solve discovering knowledge issue from data of brain function image for recognition of Chinese words. The concern is formulated as data mining. In particular, this paper presented an association rules data-mining model based on software architecture. The model is characterized by transparent conversions between heterogeneous data formats using MDI (metadata information),...
This study's objective is to solve mining knowledge issue from different sources of distributed, formatted or unformatted data with diverse data semantics. The issue is formulated as data mining in knowledge grid. In particular, this paper presented a DM-GRID (data mining in grid) model based on software architecture of a novel infrastructure for distributed and high-performance data mining in knowledge...
This study's objective is to solve the dynamic linkages and mechanism problem between exchange rates and stock prices. This paper examines the relationship between RMB-Dollar exchange rates and 5 market indexes and 19 industrial indexes of China stock market by cointegration test and Granger causality test. The empirical results show a significant long-term equilibrium between stock prices and exchange...
This paper presents an economic-based resource allocation algorithm - mix optimization algorithm to meet user requirements in proportional resource sharing grid environment. The mix optimization algorithm is targeted to minimize two objectives, i.e., competing users 'processing cost and competing users' executing time with budget and deadline constraints, using multi-objective programming method....
Podaj zakres dat dla filtrowania wyświetlonych wyników. Możesz podać datę początkową, końcową lub obie daty. Daty możesz wpisać ręcznie lub wybrać za pomocą kalendarza.