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 brief paper, a simple and fast computational method, the Planar Visibility Graph Networks Algorithm was proposed based on the famous Visibility Graph Algorithm, which can fulfill converting two dimensional timeseries into a planar graph. The constructed planar graph inherits several properties of the series in its structure. Thereby, periodic series, random series, and chaotic series convert...
Traditional differential evolution (DE) algorithm has a tendency to suffer from premature convergence. In this paper, we proposed an improved DE based on dynamic mutation operator and opposition learning strategy. These mechanisms can expand the search area and is helpful to balance exploration and exploitation of DE. Numerical experiments demonstrate that our algorithm is effective.
The parameter establishment of differential evolution algorithm (DE) is generally determined by the experience selection method, whose shortcomings include the massive operational parameters, the difficulty in obtaining the best parameter combination, and further obstacle to improve the optimization ability of the algorithm to a great extent. The article introduces the uniform design method of differential...
Extensive use of dynamic instruction scheduling technique has made it an essential content of Computer Architecture (CA) course. Practical teaching for this content, however, is always a weak link in the teaching of CA. According to current teaching methods, teachers just explain the principle of dynamic instruction scheduling by traditional or multimedia instruction. This kind of method is far from...
Anycast is an internet addressing protocol where multiple hosts share the same IP-address. A popular architecture for modern Content Distribution Networks (CDNs) for geo-replicated HTTP-services consists of multiple layers of proxy nodes for service and co-located DNS-servers for load-balancing on different proxies. Both the proxies and the DNS-servers use anycast addressing, which offers simplicity...
In communication networks, the multi-constraint multicast communication is an important way to improve the efficiency of network operation and quality of service. Some heuristic algorithms are applied in solving multicast routing problem under multiple constraints, such as simulated annealing, genetic algorithm, ant colony algorithm and particle swarm optimization algorithm. However, these algorithms...
The waste collection vehicle routing problems with time windows and intermediate facilities (WCVRPTW-IF) is actually belong to a well-known generalization of VRP, the Multi-Depot Vehicle Routing Problem with Inter-Depot Routes (MDVRPI), which is a combinatorial optimization problem and holds a central place in reverse logistics management. in order to improve the route compactness, which is very important...
Attack graph increasingly becomes a key technique for network security analysis, however, the prevalent Attacker's Ability Monotonic Assumption (AAMA) constraint for attack graph generation could not make full use of the direction of network attack and the hierarchy of defence. As a result, using AAMA is not efficient enough in the process of attack graph generation, especially for large-scale complicated...
In this paper, it presents an effective caching algorithm based on random access with the finite storage size in distributed server architecture for networked video services. Under the general video traffic condition, it is observed that the storage size and total popular contents of edge video server affect the performance of the total video sever system, and channel bandwidth between edge video...
The collection vehicle routing problems with intermediate facilities (CVRP-IF) is actually belong to a well-known generalization of VRP, the Multi-Depot Vehicle Routing Problem with Inter-Depot Routes (MDVRPI), which is a combinatorial optimization problem and holds a central place in reverse logistics management, such as waste collection management. This paper presents an improved multiple ant colony...
Recently, the sizes of networks are always very huge, and they take on distributed nature. Aiming at this kind of network clustering problem, in the sight of local view, this paper proposes a fast network clustering algorithm in which each node is regarded as an agent, and each agent tries to maximize its local function in order to optimize network modularity defined by function Q, rather than optimize...
Recently, network based recommendation algorithms have demonstrated much better performance than the standard collaborative filtering method, and most of which have been focused on the unweighted cases even in a multigraded rating system. However, these modifications from multigraded rating data to binary data may lose information, thus hinder the expressing of user's preference and finally misleading...
This paper proposed a pursuit-evasion algorithm based on the Option method from hierarchical reinforcement learning and applied it into multi-robot pursuit-evasion game in 2D-Dynamic environment. The algorithm efficiency is studied by comparing it with Q-learning. We decompose the complex task with option method, and divide the learning process into two parts: High-level learning and Low-level learning,...
In this paper, we present an FPGA implementation of a dynamically regularized recursive least squares adaptive filtering algorithm based on dichotomous coordinate descent iterations. The algorithm is simple for finite precision implementation, requires small chip resources, and exhibits numerical stability. The proposed implementation allows significant increase in the weight update rate compared...
Peer to peer systems are distributed systems, decreasing system load is important for improving the scalability of systems. Caching is always used to achieve load balance in structured p2p systems currently, but none of the current caching algorithms take system load into consideration. We proposes a caching model for decreasing system load in structured peer to peer systems, describes how peer uses...
Algorithms based on game theory regard the equilibriums as the optimal solution for the cooperation in multi-agent system (MAS), especially the evolutionary stable equilibriums (ESE) had been studied because they can give a consistent optimal solution for the MAS and partly solve the equilibrium selection problem of game theory. However ESE is dynamic stable, so the strategy of every agent keeps on...
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.