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.
Recently, inspired by the human brainstorming process, a new kind of metaheuristic algorithm, called brain storm optimization (BSO) algorithm was proposed for global optimization. Experimental results have shown its excellent performance when solving optimization problems. In order to further improve the search ability of the BSO, this paper proposes an improved BSO (IBSO) algorithm by introducing...
Fixed-outline floorplanning is a hot issue in physical design, and it is more complicated than outline-free floorplanning since it considers the chip fixed-outline constraints. In this paper, an improved simulated annealing algorithm (ISA) is proposed to solve fixed-outline floorplanning. In case ISA encounters premature convergence, it randomly generates a new floorplan which is independent of the...
This study proposes a novel chaotic cuckoo search (CCS) optimization method by introducing chaotic theory into cuckoo search (CS) algorithm. In CCS, chaos characteristics are combined with the CS with the intention of further enhancing its performance. Further, the elitism scheme is incorporated into CCS in order to preserve the best cuckoos. In the CCS method, twelve chaotic maps are applied to tune...
This paper presents a statistical interior tomography (SIT) approach making use of compressed sensing (CS) theory. With the projection data modeled by the Poisson distribution, an objective function with a total variation (TV) regularization term is formulated in the maximization of a posteriori (MAP) framework to solve the interior problem. An alternating minimization method is used to optimize the...
Conventional image edge detection algorithms generate the information undetected and artificial information problems. In order to detect the image edge more effectively, an improved method based on grey model (GM) is brought forward. The neighborhood pixels of target pixel are selected to build the model. These data are preprocessed by translation transformation and logarithmic transformation. The...
In order to meet the special requirements of Direct Anonymous Attestation (DAA), this paper proposed a new security Hash Function. It follows the design principles of MD algorithm and SHA algorithm, makes full use of logic transformation and function iteration method. This algorithm can make the arbitrary length message into a hash of the message digest with 1712-bit. It is in line with the one-way,...
In kernel-based algorithms, Mercer kernel techniques have been used for improving the separability of input patterns. Although designed to tackle the problem of curse of dimensionality, non-accelerated kernel-based clustering algorithms fail to provide enough time efficiency for practical applications, such as medical image segmentation. For improving the time efficiency of kernel-based clustering,...
A mathematical symbol recognition approach based on ISOETRP Clustering Algorithm is proposed in this paper. Mathematical symbol is one kind of special image symbols, different from ordinary text character in several aspects. For this point, firstly, one special features extraction algorithm is proposed, then two kinds of Classifier are used, one is Minimum Distance Classifier, another is Tree Classifier...
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.