The Infona portal uses cookies, i.e. strings of text saved by a browser on the user's device. The portal can access those files and use them to remember the user's data, such as their chosen settings (screen view, interface language, etc.), or their login data. By using the Infona portal the user accepts automatic saving and using this information for portal operation purposes. More information on the subject can be found in the Privacy Policy and Terms of Service. By closing this window the user confirms that they have read the information on cookie usage, and they accept the privacy policy and the way cookies are used by the portal. You can change the cookie settings in your browser.
The following topics are dealt with: genetic algorithm; evolutionary programming; neural network; information security; intelligence control algorithm; data mining; e-learning and quantum computing.
Improved genetic algorithm was used to improve the performance of FBG sensors in a wavelength-division multiplexed sensor network. Simulation and experiment shows that compute speed and capability of multiplexing are enhanced, and the measurement range of sensors in FBG sensor network is increased while using improved genetic algorithms with proper parameters.
The geometric concepts of outer containing cylinder for space finite points have frequently been introduced into the evaluation of molding error of cylinder surface in the operation of mechanical manufacturing and mold processing. Since space finite points obviously consists of numerous outer containing cylinders, a mathematical model is built to find the minimum outer containing cylinder in this...
In order to solve problem of the speed of convergence and early-maturing of the serial genetic algorithm, people begin to study the parallel genetic algorithm. However most researcher devoted to study the single way parallel genetic algorithm (PGA), while solving some combination optimizing problem, have made good result, but as to the more complicated combination optimizing problem, all have certain...
Since the amount of spatial data grows rapidly during recent years, high dimensionality of the domain attributes presents a further obstacle for a number of rule-induction algorithms that would have the potential for automating knowledge acquisition. This paper attempts to tackle the problem by attribute reduction. Firstly, the problem of attribute reduction can be converted into a 0-1 combinatorial...
A multi-objective evolutionary algorithm with extended minimal generation gap (MGG) model and distance-based density measure is given, which we call DMOEA. DMOEA employs a new technique to estimate the distance between two individuals in the objective space, further, finds the K nearest neighbors on either side of certain individual along one focused objective, calculates the sum of the distances...
Present a content integrity service for objects in a digital museum, especially for objects stored in long-term digital archives. The goal of the service is to demonstrate that the information in the archive is authentic and has not been unintentionally or maliciously altered even after its bit representation in the archive has undergone one or more transformations. The service is based on one-way...
Flexible job scheduling is considered a NP-hard problem (FJS). A hybrid algorithm based on Genetic Algorithm (GA) and Simulated Annealing (SA) is proposed, which is used to schedule the tasks. A two dimensional matrix encoding is adopted, row operator and column operator are advanced accordingly, column crossover operator and column mutation are chosen by considering the Constraints. Elitist selection...
The paper presents a model of the real world vehicle routing and dispatching problem. In real world, vehicle travel speeds are varying with period of time and can not be expressed as exact values. So the time-dependent and fuzzy travel speeds are introduced into the model. A dispatching period is divided into some time slices and each time slice is designated a triangular fuzzy speed. The travel time...
The application level multicast overlay network (ON) is composed by the hosts based on the physics unicast links between them. The initial ON is a completely connectivity network, which make the multicast tree construction and routing is lower efficiency. For improving the ON routing performance, the ON links should be selected. Based on a new presented ON link selection model with reliability and...
This paper is mainly devoted to identify an evolutionary approach based on search strategy, namely multiobjective evolutionary algorithm for indoor positioning (MEIP). Each subproblem is optimized by information from its several neighboring subproblems, which makes MEIP lower computational complexity at each generation and be capable of determining the user position with high accuracy. Experimental...
Niche genetic algorithm (NGA) is superior to genetic algorithm (GA) in multiple hump function optimization. NGA could search all global optimums of multiple hump function in a running. It is a class of parallel evolutionary method which suppresses genetic drift by forming stable subpopulations to maintain population diversity. To algorithm population diversity plays an important role to avoid trapping...
Web service-flow having dynamic, distributed and flexible characteristics makes the on-line management differ from the classical workflow. This management of Web service-flow should not only run the service-flow accurately, but should also evolve it dynamically and be sure to provide a nice combination every time. At first,this paper extends the definition of WSF with a candidate set of services,...
As an effective global optimization method, genetic algorithm has been used in real practice very widely. When it is used in real practice, its slow convergence and poor stability have become the main problems. In order to overcome these problems, from the creation of the initial population, immune selection operation, improved genetic operators, et al, an improved fast immunized genetic algorithm...
Set the date range to filter the displayed results. You can set a starting date, ending date or both. You can enter the dates manually or choose them from the calendar.