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 thesis presents a BP Artificial neural network prediction modeling method for forecasting the trend of Shanghai index, and then uses the genetic algorithm to optimize the BP network parameters, weight and structure. The forecasting results show that the optimization algorithm not only avoids BP algorithm into a local minimum point and the problems of slow convergence, but also overcome the GA...
The grid computational environment is very suit to meet the computational demands of large, diverse groups of tasks. And the task scheduling problem in it has been a research hotspot in recent years. Some heuristic methods have been used to optimize it and have got some good results. However, selecting the best one to use in a given environment remains a difficult problem, because comparisons are...
In computational grid environment, the task scheduling problem can be stated as finding a schedule scheme for a series of tasks to be executed on multiple resources, so that the task completion time can be minimized. There have been a lot of researches on scheduling algorithm, and heuristic approach have played very good role. For example, Genetic Algorithms, Simulated Annealing Algorithm, Ant Colony...
In this paper, a new algorithm for MRI Brain Segmentation is proposed, which is based on the AntPart algorithm [1]. This algorithm proposed partitiones the brain structure into three parts-white matter, grey matter, and cerebrospinal fluid according to the grayvalues of pixels. The main algorithm compares each pixel with the nearest class center C, all the data belonging to class C, all the data carried...
The statistical testing base on usage model is an application for cleanroom software test. This paper constitutes a usage model for the test of an embedded stream media product whose chipset is ARM926JES base on the Markov theory. And quantitative analysis for the Markov chain which is composed by states transition matrix and excitation matrix. Comparing the model's difference between usage chains...
A fragile watermarking scheme based on integer wavelet transform and chaos sequence is proposed in this paper. The novel watermarking scheme uses the quad tree structures received by the wavelet decomposition and chaos sequences to choose locations where are embedded the watermark information. The scheme has high signal-to-noise because it only embed watermark into the latest bit of node. It is suitable...
In this paper, an improved method is proposed based on the AntTree algorithm to deal with MRI brain segmentation. This algorithm uses a new tree-structure model to accelerate the calculation of segmenting the brain structure into brain structure, while matter, grey matter, and cerebrospinal fluid. The experimental results indicated that this new approach has made full usage of the pixels information...
In this paper, an improved method is proposed based on AntTree clustering algorithm to deal with MRI image. This algorithm uses a new tree-structure model to accelerate the calculation and combines greedy algorithm to update the cluster centre. Compared with K-means and FCM algorithms, the results in the experiment show that the improved AntTree clustering algorithm is a better method in image segmentation...
A large number of multi-objective optimization evolutionary algorithms(MOEAs) have been developed in the past two decades. To compare these methods rigorously, or to measure the performance of a particular MOEA quantitatively, a variety of performance measures have been proposed. In this paper, some existing widely-used performance measures are briefly reviewed and compared according different properties...
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.