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.
In this paper, a fuzzy facility location model with Value at Risk (VaR) is proposed, which is a two-stage fuzzy zero-one integer programming. Since the fuzzy parameters of the location problem are continuous fuzzy variables with an infinite support, the computation of VaR is inherently an infinite-dimensional optimization problem, which can not be solved analytically. In order to solve the model,...
In this paper, an innovative optimal radiation pattern of an adaptive linear array is derived by phase-only perturbations using a Particle Swarm Optimization (PSO) algorithm. An antenna array is often made as an adaptive antenna. An optimal radiation pattern design for an adaptive antenna system is not only to suppress interference by placing a null in the direction of the interfering source but also...
We present a new algorithm for exact multiple string matching. Our algorithm is based on filtration combining BNDM and q-grams. We have tested it with experiments and compared it with other algorithms, e.g. DFA, AC_BM and MWM. The preprocessing phase of our algorithms is fast, the memory usage is fairly small, and our algorithm is considerably faster for huge sets of several thousand patterns. The...
In the framework of Fuzzy Cognitive maps theory, we propose a novel classify algorithm, which is totally different from the traditional classify algorithm. The novel classify algorithm has three main advantages: Firstly, the procedures of the proposed algorithm are more transparent and understandable, and the classify results have shown the relationship between attributes. Secondly, the predefined...
Frequent items detection is one of the valuable techniques in many applications, such as network monitor, network intrusion detection, worm virus detection, and so on. This technique has been well studied on deterministic databases. However, it is a new task on emerging uncertain database. In this paper, a new definition of frequent items detection on uncertain data is defined. Based on it, two efficient...
A DRM system scheme based on PKI is proposed and designed in this paper, which can achieve secure distribution and use of digital content. The system architecture, secure mechanism, workflow are described. At last the system simulation-testing and analysis are presented, testing and analysis results show that the scheme is feasible and effective.
Calculating the minimum (or maximum) value of functions is an important problem in optimization field. Applying the method of ant colony optimization (ACO) to solve the problem is an interesting research topic currently, and the main disadvantage is that solution is local optimal. To evade this disadvantage in some degree, in this paper, the ant feature of sensation is used. Experiment shows that...
It is a trend for paradigms of nature-inspired computing to hybrid. Inspired by the principle of immune response in the immune system, a novel incremental data clustering algorithm called IRA was proposed in previous work. It obtains high quality clustering. However, the number of clusters obtained by IRA is more than the actual ones. Therefore, the clustering algorithm based on ant colony called...
Cloud estimation of distribution particle swarm optimizer combining PSO and cloud model is introduced. In the algorithm's offspring generation scheme, new particles are generated in the cloud estimation of distribution way or in the PSO way. The innovation of the algorithm is production of cloud particles according to the cloud model theory. The cognitive population obtained during optimization is...
This paper proposes a low-computation algorithm for logarithm and square-root in fixed-point domain. The algorithm only needs 3 ~ 6 coefficients to do inner-product of vectors which have three elements. Each computation only needs three fixed-point multiplications and two fixed-point additions to accomplish logarithm and square-root operations. According to the experimental results, the relative error...
Standard BP neural network is a most representative algorithm in the neural network model. But shortcomings exist in its process of application. For example: it's hard to reach global optima, but can easily form local minimum, Low study efficiency and slow convergence rate appear because of the excessive training, the selection of the hidden layer nodes lack of theoretical guidance, in training, there...
Borrowing ideas from one-dimensional array selection sorting algorithms, we propose a sorting algorithm for two-dimensional arrays. Both theoretical analysis and experimental evaluation show that the proposed algorithm is easy to implement, and has much lower computational complexity than one-dimensional sorting algorithms, especially when arrays have large size. Furthermore, we convert the sorting...
Most P2P applications use the routing algorithm that selecting the neighbor nodes at random. This routing algorithm increases the routing hops and reduces the routing speed. To get better routing efficiency, a new routing algorithm named RHAC based on hierarchy agglomerative clustering was presented in this paper. It dynamically clusters nodes into different clusters based on the communication history...
This paper focuses on route planning, especially for unmanned aircrafts in marine environment. Firstly, new heuristic information is adopted such as threat-zone, turn maneuver and forbid-zone based on voyage heuristic information. Then, the cost function is normalized to obtain more flexible and reasonable routes. Finally, an improved sparse A* search algorithm is employed to enhance the planning...
Image completion is an important task in the field of image processing with broad applications in image and vision analysis. we consider the image completion problem arising in image restoration: part of an image has been removed, and we want to restore the image from the remaining, possibly noisy, portion. In this paper, we present a new approach based on exemplar-based completion model which combines...
A data hiding scheme with flexible hiding capacity applied in vector quantization (VQ) index tables was proposed by Chang et al. However the minimum bit rate of their scheme is 0.552. To improve the bit rate of Chang et al's method, this paper proposes a novel and efficient reversible data embedding scheme for VQ index tables. The proposed method exploits characteristics of VQ indices and uses two...
Various randomized search heuristics have been proposed for multiobjective optimization problems. We need evaluate and compare the performance of these optimizers in order to make good use of them. This paper reviews the theory and methods proposed in the past decade and summarize their characteristics based on relevant literature. However, we didn't list and analyze many methods proposed before because...
With the development of technology, calculated amount especially in seismic data processing is increasing in virtual computing environment and the data size is astonishing. In this paper, based on the seismic data and the influence factors during the calculation, we present a suitable data partitioning strategy-the PGA (Pretreatment Genetic Algorithm) algorithm. The scheduling problem in virtual computing...
For the discretization of particles in particle swarm optimization (PSO), we have proposed the family PSO (FPSO) previously. To further study the internal structure of FPSO, this paper defined two kinds of relationships between particles: equal relationship (ER) and generational relationship (GR). FPSO of equal relationship (ER-FPSO) and FPSO of generational relationship (GR-FPSO) were proposed. Simulations...
A novel particle swarm optimization algorithm for multi-objective optimization (MOO) based on fuzzy velocity updating strategy is developed and implemented in this paper. The proposed algorithm incorporates fuzzy velocity updating strategy, which can characterize to some extent the uncertainty on the true optimality of the global best position, into particle swarm optimization (PSO) so as to avoid...
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.