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.
Multicommodity flow-based virtual network embedding algorithm does not consider link energy, which causes waste of energy. And its high time complexity can not meet real-time requirements of online virtual network embedding. In this paper, we find the dynamic inversion phenomenon, where revenue does not rely on embedding cost. Two novel link mapping algorithms are proposed for path splitting which...
Collision free navigation in dynamic environments, where motion of moving obstacles is unknown, still presents a significant challenge. Sampling based algorithms are well known for their simplicity and are widely used in many real time motion planning problems. While many sampling based algorithms for dynamic environments exist, assumptions taken by these algorithms such as known trajectories of moving...
Program slicing has seen a plethora of applications and variations since its introduction over thirty years ago. The dominant method for computing slices involves significant complex source-code analysis to model the dependences in the code. A recently introduced alternative, Observation-Based Slicing (ORBS), sidesteps this complexity by observing the behavior of candidate slices. ORBS has several...
A computer program's dynamic instruction trace is the sequence of instructions it generates during run-time. This article presents a method for analysing dynamic instruction traces, with an application in malware detection. Instruction traces can be modelled as piecewise homogeneous Markov chains and an exact linear time method is used for detecting change points in the transition probability matrix...
Dijkstra algorithm is a classic algorithm of computing the shortest path between two points. In past the amount of urban vehicles is small, so the shortest path is the optimal one. However, with the increasing of cars, traffic congestion is serious. The path calculated by using traditional Dijkstra is still the shortest path, but it is not necessarily the optimal. Therefore, in order to solve the...
A novel optimal island partition model of the distribution system with distributed generation (DG) is proposed and a distributed islanding method based on improved dynamic programming is applied to this model. This paper changes the islanding problem into minimum spanning tree to obtain connected graph. Since the load priority, controllable/uncontrollable load, and the restrictions of power balance,...
In this paper, an algorithm is proposed to provide position data of vehicles with high accuracy and low cost. It is to use same number of satellites or same satellites number, then calculates absolute coordination of vehicles using distance between vehicles. Finally it can enhance accuracy of relative positioning in vehicles.
This paper demonstrates how we applied a constraint-based dynamic adaptation approach on CarDemo, a traffic management system. The approach allows domain experts to describe the adaptation goals as declarative constraints, and automatically plan the adaptation decisions to satisfy these constraints. We demonstrate how to utilise this approach to realise the dynamic switch of routing services of the...
The data placement issues in cloud computing platform have been extensively researched, mainly in the choice of the number of data replica, initial data placement strategy, the run-time and dynamically adjustment and routing algorithm and other aspects of the transaction request. In this paper, we design a whole framework to the method of placing data replica for analysis and description from a higher...
A novel three-stage algorithm for detection of fixations and smooth pursuit movements in high-speed eye-tracking data is proposed. In the first stage, a segmentation based on the directionality of the data is performed. In the second stage, four spatial features are computed from the data in each segment. Finally, data are classified into fixations and smooth pursuit movements based on a combination...
Opportunistic networks are lack of end-to-end paths between source nodes and destination nodes, so the communications are mainly carried out by the “store-carryforward” strategy. Selfish behaviors of rejecting packet relay requests will severely worsen the network performance. Incentive is an efficient way to reduce selfish behaviors, and hence improves the reliability and robustness of the networks...
Coverage control is one of the fundamental problems in WSN (wireless sensor network) and determines the ability to monitor the entire WSN system. Based on the Voronoi diagram and the CVT (Centralized Voronoi Tessellation) theory, and combined with the Lloyd's algorithm, we propose a dynamic covering algorithm of WSN to achieve a dynamic coverage among different areas by adjusting the geometric boundaries...
Algorithms for solving distributed constraint satisfaction problems (DisCSPs) generally assume, simplistically, that an agent represents a single variable. However, real distributed problems normally have several variables per local problem (called a complex local problem). Two major approaches of compilation and decomposition are used in solving this type of problem. In compilation, a new variable...
The Capacitated Vehicle Routing Problem (CVRP) is a well-known NP-hard problem of importance to real life applications such as transportation and logistics. The CVRP finds the best set of paths between a specific number of customers to deliver goods by a number of vehicles with a fixed capacity. In this paper, we apply a new nature inspired optimization algorithm called Intelligent Water Drops (IWD)...
This paper presents a hybrid metaheuristic for solving the Quadratic Assignment Problem (QAP). The proposed algorithm involves using the Greedy Randomized Adaptive Search Procedure (GRASP) to construct an initial solution, and then using a hybrid Simulated Annealing and Tabu Search (SA-TS) algorithm to further improve the solution. Experimental results show that the hybrid metaheuristic is able to...
In this paper, The traditional vehicle routing problem with time windows is expanded to the situation that the time window is replaced by fuzzy due time which can represent the preferences of the customers. After a simple description of fuzzy due time and the fuzzy vehicle routing problem, a multi-objective mathematical model for the problem is built. Then, an insertion heuristic-based hybrid genetic...
Particle swarm optimization algorithm is a simple and effective modern optimization algorithm, but it has the problem of being prone to premature and its convergence rate is slow. A new improved PSO algorithm is hence proposed. In the iteration of the proposed algorithm, the particles are distinguished to be active or stable according to their velocity information. For the active particles, to maintain...
The quadratic assignment problem (QAP) is a classic combinatorial optimization problem, which is of the NP-hard nature. In this paper, a hybrid artificial fish school optimization algorithm (HAFSOA) is proposed. In HAFSOA, the heuristic information is used in constructing some better initial individuals and its search ability of the global optimal solution is improved by a combination of the modified...
Classical binary or 0-1 knapsack problem is one of the most widely studied problems in combinatorial optimization. Though the optimization version of this problem is NP-hard, practical solution techniques don't require optimality. Many different heuristics and approximation algorithms have been used to solve t it. Cellular competitive decision algorithm (CCDA) is a heuristic proposed recently, which...
Among all combinatorial optimization problems, traveling salesman problem (TSP) is one of the widely studied problems. Though the optimization version of this problem is NP-hard, practical solution techniques don't require optimality. And many different heuristics and approximation algorithms are used to solve this problem. Cellular competitive decision algorithm (CCDA) is a new heuristic for solving...
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.