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.
For the drawbacks of application in general function optimization using Ant Colony Optimization (ACO), ant's move method and pheromone updating strategy is modified on ACO. And typical problems are used to demonstrate its validation. The results show that after modification, the convergence process is quicker and the approach is found to give accuracy. At the end of this paper, the parameters selection...
In order to further ease the disaster of computing costs in multi-objective optimization problem, we've put forward a kind of multi-objective genetic algorithm based on clustering. The algorithm uses the fuzzy c-means clustering control the similar individuals gathered in a class and for each class construct non-dominated set with arena's principle, so that we can use faster speed to choose the non-dominated...
We study the problem of asymptotically stabilizing a switched linear control system using sampled and quantized measurements of its state. The switching is assumed to be slow enough in the sense of combined dwell time and average dwell time, each individual mode is assumed to be stabilizable, and the available data rate is assumed to be large enough. Our encoding and control strategy is rooted in...
This paper investigates the consensus problems in directed networks under communication constraints. Each agent has a real-valued state but can only exchange finitely many bits information with its neighbors at each time step. Based on dynamic difference encoding and decoding, a distributed algorithm is proposed to achieve quantized consensus asymptotically with as few as only one bit information...
We investigate the error floor performance of Luby Transform (LT) codes over the additive white Gaussian noise channel. We first derive a lower bound on the bit error rate for an LT code, which we subsequently use to show that the corresponding error floor is predominantly caused by low-degree variable nodes. Based on this observation, we propose a modified encoding scheme for LT codes that provides...
This paper considers the generalized assignment problem (GAP). It is well-known NP-hard combinatorial optimization problem that is interesting in itself and also appears as a sub problem in other problems of practical importance. Line-up competition Differential Evolution algorithm for the GAP is proposed. The algorithm uses integer-coding structure, and introduces the idea of line-up competition...
The addition of stereoscopic navigation to an image-based virtual environment is a desirable enhancement. This can be implemented by sampling the scene with a number of stereoscopic panoramas. In this regard, clusters of panoramas in a known spatial arrangement can be used to render omnistereoscopic views. However, slight misalignments between panoramas introduced by single-shot panoramic cameras...
In order to solve the contradiction between the transmission and storage requirements of massive electric physical information in smart grid and relative shortage of communication resources, this paper puts forward an novel encoding method based on Least Mean Square (LMS) adaptive filtering theory and Adaptive Differential Pulse Code Modulation (ADPCM) system in G.726 international standard proposed...
Genetic algorithms (GAs) are vital members within the family biologically inspired algorithms. It has been proven that the performance of GAs is largely affected by the type of encoding schemes used to encode optimization problems. Binary and real encoding schemes are the most popular ones. However, it is still controversial to decide the superiority of one of them for GAs performance. Therefore,...
Reduce the number of network coding links is beneficial to control the complexity of optical multicast networks and to maximize network throughput. Since this is a NP-complete problem, we seek a method for finding the excellent solutions. This paper is concerned with the design of a flexible immune algorithm which is suitable for the majority optical multicast network. In this algorithm, we modified...
In the analysis of iterative coding systems it is often necessary to compare two densities and to measure how close they are. Sometimes it is convenient to compare their entropy or their Battacharyya parameter. But sometimes a more powerful measure is required. The Wasserstein metric is a convenient choice. We derive some basic properties of the Wasserstein metric which are important in the context...
The practical and theoretical importance of network localization has determined a great focus from the scientific community. In recent years several schemes have been proposed to solve the localization problem under certain constraints. Here, we apply the particle swarm optimization (PSO) paradigm to the problem of constructing optimally localizable networks. Alternative solutions which yield non-optimal...
The traditional genetic algorithm works with a fixed probability of genetic operators. It brings inconvenience to the individual adaptive, where the population is easy to get evolved into a stagnant state, resulting in local convergence. In this paper, progressive optimization is introduced to perform 5 times of improvement on crossover operator and mutation operator. The other part of the research...
To solve the problem that it is difficult to construct an exact mathematic model for the electro-hydraulic position servo system of a pump-controlled cylinder with nonlinearity and time-varying property, HHGA-RBFNN is proposed. Each chromosome only contains three parameters including the number of hidden nodes, center and width of radial basis function; so that the complexity of proposed algorithm...
The Support Vector Machine method has a good learning and generalization ability. Unfortunately, there are no comprehensive theories to guide the parameter selection of the SVM, which largely limits its application. In order to get the optimal parameters automatically, researchers have tried a variety of methods. Using genetic algorithms to optimize parameters of an SVM Classifier has become one of...
Although possible security threats were taken into consideration when IPv6 was formulated, attacks, especially distributed denial-of-service (DDoS), still exist in IPv6 network. This makes IP trace back schemes very relevant to the security of IPv6 network. As many current IP trace back schemes are designed according to IPv4, they can not be directly used in IPv6 network. A modified Deterministic...
Witness generation is a fundamental model checker feature, but generating shortest witnesses for an EG CTL formula has long been a difficult problem of both theoretical and practical relevance. We propose a symbolic approach to shortest EG witness generation based on edge-valued multi-way decision diagrams. We employ a fix point symbolic iteration to compute the transitive closure enhanced with distance...
In order to solve the problems such as blindfold search, slower convergence, and sometimes unsuccessfully search in the present genetic algorithms used for intelligent test paper generation, this paper introduces an improved genetic algorithm for intelligent test paper generation. This algorithm generates optimized initial chromosome group and controlling crossing and variation recurring to test paper...
This paper analyzes the nature of university curriculum problems (Time table Problem TTP), as well as the strengths and weaknesses of the problem solving, and evaluate some time table problem's arithmetic performance. The basic algorithm including greedy algorithm, simulated annealing algorithm, genetic algorithm and the improved genetic search algorithm by author. This thesis discover the use of...
In this paper, feature fitness evaluation method is proposed for accelerating the speed of evolution in symbolic regression. Through analyzing the feature of curve or surface which train data represents, vertex and inflection points are extracted from the train data. According to the feature data and diversity of population, the test data for evolution of genetic programming (GP) are generated dynamically...
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.