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.
A robust numerical measures of lexical relatedness is significant for many applications, such as text summarization system and information retrieval researches. Standard seme-based measures of word pair relatedness are based on only the comparison of semes of the two words. This paper propose a new model called seme based graph using an extended random walk to measure explicit and implicit relatedness...
Recently, the concept of virtual backbone (VB) has been investigated to improve the efficiency of wireless networks. Since node fault is the most significant failure type in various wireless networks, many efforts are made to improve the resilience of VB by increasing node connectivity. However, in cognitive radio networks (CRNs), communication disruption among unlicensed users (cognitive users, CUs)...
With the development of intelligent algorithm, GA and PSO have become the hot spot for the study on multi-objective optimization in recently years. Information sharing is the core of PSO algorithm, Comparing with GA, PSO algorithm has less variables to adjust and is easy to achieve, so it is widely used in engineering. This paper focus on the comparation on several PSO algorithm and introduce a kind...
This paper considers the flowline manufacturing cell scheduling problem(FMCSP) with sequence dependent family setup times(SDFSTs) for makespan minimization. Based on the characteristics of this problem, hybrid harmony search (HHS) is proposed. It uses iterative optimizing algorithm to enhance the quality of the solution and applies a simple discarding strategy to avoid the algorithm converging quickly...
This article describes the Wellness Profile Model. The two decision problems related to the model called the Compatible Wellness Group with Target Member Problem and the Compatible Wellness Group Problem are defined. We propose the two polynomial-time algorithms for solving the two problems here. Our main contribution is to show that the time complexities of these two problems are in class P.
This paper presents an autonomic algorithm for constructing minimum spanning trees in a distributed system. Processes are virtually organized on a hypercube-like topology, called VCube. The spanning trees are dynamically created from any source process and regenerated transparently when processes become faulty. Any tree reconstruction is autonomously done based on the virtual topology and on fault...
An approach with decomposition on time windows is proposed to solve resource-constrained project scheduling problem (RCPSP) in this paper. This approach is to decompose the feasible space calculated by CPM of the original problem into some subspaces, which are searched using some schedule schema. Double justification is also performed in the search to improve the results. The results of experiments...
For the system with both polytopic uncertainty and bounded disturbance, an off-line approach to the dynamic output feedback robust model predictive control is considered. To reduce the on-line computational burden, a look-up table is constructed off-line for on-line searching the real-time control parameters. During the on-line searching stage, if an off-line calculated ellipsoidal region of attraction...
Grid-based path planning is a widely discussed problem. Pre-existing algorithms always find paths with unrealistic looking(such as A*) or spend lots of effort expanding redundant vertices and thus causing time and memory waste(such as A*,A* with Post-Smoothing,Basic Theta* and Angle-Propagation Theta*). In this paper, we present Block-Guided Theta*, a variation of A* which expanding vertices in a...
This paper processes the formation problem of multiple agents by assuming multiple virtual leaders. The basic idea is stated as follows: every dynamic agent is equipped with a virtual leader, and the agents reach consensus with their virtual leaders on the velocity and position through assigning stable control laws. Therefore, to solve the formation problem we just need to preset the trajectories...
In the traditional improved Particle Swarm Optimization algorithms, the search spaces of the particles are always fixed. In this paper, based on the standard particle swarm optimization (PSO) algorithm, a dynamic search space particle swarm optimization algorithm (DSPPSO) based on population entropy is proposed. The population entropy is introduced to describe the particles' location confusion degree,...
Nonlinear system identification is one of the main means of establishing dynamics model of complex electromechanical system. The recursive least-squares parameter estimation algorithm is proposed for a class of Hammerstein equations with colored noise error and output error model. The basic idea of the algorithm is a combination of the auxiliary model identification and decomposition technique, the...
This paper presents a kind of constraint to ensure first-order contiguity of Traffic Analysis Zone delineation problem. Based on k-median facility location model, a 0–1 integer programming mathematical presentation of the problem, with objective of minimizing heterogeneity, is given. The proposed model is compared with other three ones in terms of model complexity and time consuming. The other three...
An improved harmony search algorithm is presented for solving continuous optimization problems in this paper. In the proposed algorithm, an elimination principle is developed for choosing from the harmony memory, so that the harmonies with better fitness will have more opportunities to be selected in generating new harmonies. Two key control parameters, pitch adjustment rate (PAR) and bandwidth distance...
This paper analyses and studies genetic algorithm and classical clustering algorithms, and then the demand analysis and design of the personnel management system of Shenyang Administration College. The adaptive crossover probability and adaptive mutation probability are proposed, which consider the influence of every generation to algorithm and the effect of different individual fitness in every generation...
Since the traditional rapidly-exploring random tree connect (RRT-connect) algorithm cannot be applied to the problem of unmanned aerial vehicle (UAV) path planning directly, a variable probability based bidirectional RRT algorithm (VPB-RRT) is proposed. The restriction of the turning angle of UAV is joined in the process of generating random points of the programming algorithm, which makes the performance...
Community detection has become a fundamental operation in numerous graph-theoretic applications. It is used to reveal natural divisions that exist within real world networks without imposing prior size or cardinality constraints on the set of communities. Despite its potential for application, there is only limited support for community detection on large-scale parallel computers, largely owing to...
The productive allocation is one of the most important factors for the development of Chip Multi-Processor (CMP) systems. The efficiency of CMP depends on the design of Processor Allocator which is driven by allocation schemes. A good allocation algorithm should identify available processors with minimum fragmentation and in as short period of time as possible. The goal of this paper is to present...
Crowd sensing is an approach to collect many samples of a phenomena of interest by distributing the sampling across a large number of individuals. While any one individual may not provide sufficient samples, aggregating samples across many individuals may provide high-quality and high-coverage measurements of a phenomena. In this work, we propose an incentive assignment mechanism for crowd sensing...
Many of today's applications can benefit from the discovery of the most central entities in real-world networks. This paper presents a new technique that efficiently finds the k most central entities in terms of closeness centrality. Instead of computing the centrality of each entity independently, our technique shares intermediate results between centrality computations. Since the cost of each centrality...
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.