In this paper, an improved genetic algorithm with annealing selection is developed and implemented to minimize the weight of triangulation of a large set of points in a plane. New encoding mechanism is introduced and ...
详细信息
In this paper, an improved genetic algorithm with annealing selection is developed and implemented to minimize the weight of triangulation of a large set of points in a plane. New encoding mechanism is introduced and genetic operators based on it are presented. Especially, annealing selection is imported to prevent the premature convergence of traditional genetic algorithm.
In this paper, a Generalized Stochastic Petri Net (GSPN) model is constructed to analyze the performance of LEO satellite networks in the case of packet loss. Furthermore, the impact of delay and packet loss on the pe...
详细信息
In this paper, a Generalized Stochastic Petri Net (GSPN) model is constructed to analyze the performance of LEO satellite networks in the case of packet loss. Furthermore, the impact of delay and packet loss on the performance of LEO satellite networks is also analyzed with SPNP6.0 software package. Numerical results show that packet loss probability decreases, and the time delay becomes bigger as buffer size of LEO satellite networks increases.
In this paper, a new analytic method for modeling and evaluating mobile ad hoc networks (MANET) is proposed. Petri nets technique is introduced into MANET and a packet-flow parallel scheduling scheme is presented usin...
详细信息
In this paper, a new analytic method for modeling and evaluating mobile ad hoc networks (MANET) is proposed. Petri nets technique is introduced into MANET and a packet-flow parallel scheduling scheme is presented using Stochastic Petri Nets (SPN). The flowing of tokens is used in graphics mode to characterize dynamical features of sharing a single wireless channel. Through SPN reachability analysis and isomorphic continuous time Markov process equations, some network parameters, such as channel efficiency, one-hop transmission delay, can be obtained. comp.red with conventional performance evaluation methods, the above parameters are mathematical expressions inst.ad of test results from a simulator.
The development of physicomathematical models for calculating the kinetics of aerosols and the unit for removing particles under conditions of accidents at a nuclear power station, the software for implementing these ...
The development of physicomathematical models for calculating the kinetics of aerosols and the unit for removing particles under conditions of accidents at a nuclear power station, the software for implementing these models, their integration into the KUPOL-M thermohydraulic code in the ASTRA-C program system, and their testing and initial verification are presented.
Macro cells, IP blocks, and pre-routed nets are often regarded as obstacles in VLSI routing phase. Obstacle-avoiding rectilinear Steiner minimum tree (OARSMT) algorithms are often used to meet the needs of practical r...
详细信息
Macro cells, IP blocks, and pre-routed nets are often regarded as obstacles in VLSI routing phase. Obstacle-avoiding rectilinear Steiner minimum tree (OARSMT) algorithms are often used to meet the needs of practical routing applications. However, OARSMT algorithms with multi-terminal nets routing still can not satisfy the requirements of practical applications. This paper presents a 3-step heuristic, named FORst, to tackle the OARSMT problem. In Step1, we partition all terminals into some subsets in the presence of obstacles. Then in Step2, we connect terminals in each connected graph with one or more trees, respectively. In Step3, we connect the forest consisting of trees constructed in Step2 into a comp.eted Steiner tree spanning all terminals while avoiding all obstacles. Two algorithms, called ACO-RSMT and GFST-RSMT, are proposed to construct OARSMT in a connected graph in Step2, which are suitable for different situations. This algorithm has been implemented and tested on cases with typical obstacles. The experimental results show that FORst is with great efficiency and can get good performance. Moreover, it can tackle large scale nets among comp.ex obstacles, such as a net with 1000 terminals in the presence of 100 rectangular obstacles.
The paper discusses the circle images-based image conformity with the lens-distortion correction. Due to finding matched points between images taken from the same point, it may avoid the problems of lighting changes a...
详细信息
The paper discusses the circle images-based image conformity with the lens-distortion correction. Due to finding matched points between images taken from the same point, it may avoid the problems of lighting changes and occlusion and aspect changes. It is easier than in the general point-matching problem. The paper has three main contributions: (1) At first we combine the radial distortion correction method with image conformity problem. (2) The paper presents the optimal objection function of projective transformation and lens-distortion parameters and derives the linear formulate of the optimal objection function. (3) The projective transformation and lens-distortion parameters are comp.ted simultaneously with the nonlinear optimal method.
A comp.nsation factor was proposed, which could describe the relations between the neutral speech and the speech under stress. And the stress comp.nsation factor also considered both the shift of means and the differe...
详细信息
A comp.nsation factor was proposed, which could describe the relations between the neutral speech and the speech under stress. And the stress comp.nsation factor also considered both the shift of means and the differences of the variances caused by the stress. Based on the parameters initialized by k-means method, the final results of the comp.nsation factor were estimated by the EM algorithm. Through the comp.nsation factor, the performance of a recognition system can be enhanced. Under the G-force stress, the proposed method can get 32.3% improvement for a small-vocabulary speaker-dependent system.
The method of producing reversible n-bit to n-bit integer transforms was discussed. They are suited for hardware-based implementations, as keeping the coefficients to n bits simplifies the design of custom hardware, a...
详细信息
The method of producing reversible n-bit to n-bit integer transforms was discussed. They are suited for hardware-based implementations, as keeping the coefficients to n bits simplifies the design of custom hardware, and could be adaptated easily on preexisting hardware with limited channel width. The Table-Lookup Haar (TLHaar) is an approximation of the Haar integer wavelet transform (Haar IWT). The Haar IWT using averaging and differencing produces a low-pass value L and a high-pass value H , by taking two integer data values A and B, because of the difference a sign bit must be stored for nonzero H, whereas TLHaar eliminates the need for sign bits.
Generalization by the Neural Networks is an added advantage that can provide very good robustness and disturbance rejection properties. By providing a sufficient number of training samples (inputs and their correspond...
详细信息
ISBN:
(纸本)9728865007
Generalization by the Neural Networks is an added advantage that can provide very good robustness and disturbance rejection properties. By providing a sufficient number of training samples (inputs and their corresponding outputs), a network can deal with some inputs it has never seen before. This ability makes them very interesting for control applications because not only they can learn comp.icated control junctions but they are able to respond to changing or unexpected environments. Aircraft landing system provides one such scenario wherein the flight conditions change quite dramatically over the path of descent. The present work discusses the training of a neural network to imitate a robust controller for auto-landing of an aircraft. The comp.risons with the robust controller indicate the additional advantages of the neural network.
The problem of performing n tasks on p asynchronous or undependable processors is a basic problem in distributed comp.ting. This paper considers an abstraction of this problem called Write-All: using p processors writ...
详细信息
ISBN:
(纸本)9781581138405
The problem of performing n tasks on p asynchronous or undependable processors is a basic problem in distributed comp.ting. This paper considers an abstraction of this problem called Write-All: using p processors write 1's into all locations of an array of size n. In this problem writing 1 abstracts the notion of performing a simple task. Despite substantial research, there is a dearth of efficient deterministic asynchronous algorithms for Write-All. Efficiency of algorithms is measured in terms of work that accounts for all local steps performed by the processors in solving the problem. Thus an optimal algorithm would have work ΘO(n), however it is known that optimality cannot be achieved when p = Ω(n). The quest then is to obtain work-optimal solutions for this problem using a non-trivial, comp.red to n, number of processors p. Recently it was shown that optimality can be achieved using a non-trivial number M of processors, where M = 4√n/log n. The new result in this paper significantly extends the range of processors for which optimality is achieved. The result shows that optimality can be achieved using close to M2 processors;more precisely, using (M log M)2-Ε processors, for any Ε > 0. Additionally, the new result uses only the atomic read/write memory, without resorting to using the test-and-set primitive that was necessary in the previous solution. This paper presents the algorithm and gives its analysis showing that the work comp.exity of the algorithm is O(n + p2+Ε), which is optimal when p = O(n1/(2+Ε)), while all prior deterministic algorithms require super-linear work when p = Ω(n1/4).
暂无评论