This paper presents a method for incremental updating on consumer electronic devices, called differential compression based on dijkstra algorithm (DDIFF). It describes the similarities between the old and new versions...
详细信息
This paper presents a method for incremental updating on consumer electronic devices, called differential compression based on dijkstra algorithm (DDIFF). It describes the similarities between the old and new versions as a directed weighted graph. In the graph, the shortest path between the start and end vertices corresponds to the minimal delta. As a result, the delta-encoding problem is reduced to the single-source shortest path problem. Experiments show that the proposed method is feasible, and average data transmission saving is as high as 69.3%. In comparison with the existing methods, DDIFF constructs the minimal patch, and the patch costs less time to apply(1).
Extensive studies regarding complete coverage problems have been conducted, but a few tackle scenarios where the mobile robot is equipped with reconfigurable modules. The reconfigurability of these robots creates oppo...
详细信息
Extensive studies regarding complete coverage problems have been conducted, but a few tackle scenarios where the mobile robot is equipped with reconfigurable modules. The reconfigurability of these robots creates opportunities to develop new navigation strategies with higher dexterity;however, it also simultaneously adds in constraints to the direction of movements. This paper aims to develop a valid navigation strategy that allows tetromino-based self-reconfigurable robots to perform complete coverage tasks. To this end, a novel graph theory-based model to simulate the workspace coverage and make use of dynamic programming technique for optimal path searching and adaptive robot morphology shifting algorithms is proposed. Moreover, the influence of algorithms starting variables on workspace coverage outcome is analyzed thoughtfully in this paper. The simulation results showed that the proposed method is capable of generating navigation paths throughout the workspace, which ensures complete workspace coverage while minimizing the total number of actions performed by the robot.
An automatic route design algorithm for intelligent ships considering environmental factors impact and navigation safety is proposed. The Delaunay Triangulation Method is used to model chart data. Safe water depth of ...
详细信息
An automatic route design algorithm for intelligent ships considering environmental factors impact and navigation safety is proposed. The Delaunay Triangulation Method is used to model chart data. Safe water depth of ship navigation calculation model is proposed, whose result is used to search the forbidden navigation areas in Delaunay Chart Model. The navigation network is created by the Tangent Based Method based on the Delaunay Chart Model. The speed of ship under environmental factors impact is recalculated which is used to modify path weight of the navigable network. The route design scheme is obtained by solving the modified network with the dijkstra algorithm. The experimental results show that the algorithm can provide the adaptive route scheme via ship size and tide height. Moreover, the environmental factors are used as variables to prove that the algorithm can consider the environmental factors and provide an economical navigation scheme.
In this study a modified Live-Wire approach is presented. A Fuzzy C-Means (FCM) clustering procedure has been implemented before the wavelet transform cost map function is defined. This shrinks the area to be searched...
详细信息
In this study a modified Live-Wire approach is presented. A Fuzzy C-Means (FCM) clustering procedure has been implemented before the wavelet transform cost map function is defined. This shrinks the area to be searched resulting in a significant reduction of the computational complexity. The method has been employed to computed tomography (CT) and magnetic resonance (MR) studies. The 2D segmentation of lungs, abdominal structures and knee joint has been performed in order to evaluate the method. Significant numerical complexity reduction of the Live-Wire algorithm as well as improvement of the object delineation with a decreased number of user interactions have been obtained. (C) 2012 Elsevier Ltd. All rights reserved.
The effectiveness of the path plan is the main factor of the evacuation affecting the amount of exposure to personnel, however, the effect of the radiation field distribution has not been fully considered in current s...
详细信息
The effectiveness of the path plan is the main factor of the evacuation affecting the amount of exposure to personnel, however, the effect of the radiation field distribution has not been fully considered in current studies. In this paper, a Minimizing Collective dose based Path-Planning method (MCPP) was proposed. Among which, the accumulative dose based dijkstra algorithm was proposed to find the optimal evacuation routes, and then the equilibrium model considering road resistance was used to formulate the optimal evacuation path plan under nuclear accidents, in which the obtained routes were reasonably arranged to evacuate all people with minimize collective dose. This paper used the Daya Bay Nuclear Power Station as an application scenario for evacuation simulation to verify the effectiveness of the method. The results showed that the path plan formulated by MCPP method could reasonably reduce personnel radiation exposure during the evacuation process. (C) 2020 Elsevier Ltd. All rights reserved.
Based on the definition of class shortest path in weighted rough graph, class shortest path algorithm in weighted rough graph is presented, which extends classical shortest path algorithm. The application in relations...
详细信息
Based on the definition of class shortest path in weighted rough graph, class shortest path algorithm in weighted rough graph is presented, which extends classical shortest path algorithm. The application in relationship mining shows effectiveness of it.
As a core of energy internet, the energy router (ER) controlled by information flows can better realise the large scale utilisation of renewable energy. In order to build a cost-effective energy internet, a modified m...
详细信息
As a core of energy internet, the energy router (ER) controlled by information flows can better realise the large scale utilisation of renewable energy. In order to build a cost-effective energy internet, a modified minimum spanning tree algorithm is proposed to optimise the cable layout among ERs, i.e. topology design. Considering the real-time and the asynchrony of power transmission in the above topology determined energy internet, an energy routing control method based on dijkstra algorithm is put forward for source-and-load pairs to find a no-congestion minimum loss path. Besides, the loss allocation and congestion managements are realised at the same time. Finally, the simulation results prove the feasibility and effectiveness of proposed optimisation algorithms.
Probabilistic key pre-distribution schemes have recently emerged as major tools of addressing secure routing challenge in wireless networks. In our previous work, we propose an algorithm capable of finding optimal sec...
详细信息
Probabilistic key pre-distribution schemes have recently emerged as major tools of addressing secure routing challenge in wireless networks. In our previous work, we propose an algorithm capable of finding optimal secure paths in overlay wireless networks. An important concern related to that algorithm is the scalability of the solution for large scale networks containing thousands of nodes. In this paper, we propose two alternative solutions for the previously formulated problem of secure overlay routing that can effectively scale to thousands of nodes. The first one is a deterministic dijkstra-based algorithm analytically proven to find the optimal path with a time complexity much lower than that of the original algorithm. The second alternative is an approximation method capable of finding a near optimal path with an accuracy of 99 percent compared to the optimal path. At the cost of a space complexity in the order O(n log(3)n), this algorithm can find the near optimal path with a linear time complexity compared to quadratic or multiplicative time complexity associated with the first algorithm proposed in this paper. Experimental results using a number of different key pre-distribution schemes confirm our analytical findings.
Uncertainty theory provides a new tool to deal with the shortest path problem with nondeterministic arc lengths. With help from the operational law of uncertainty theory, this paper gives the uncertainty distribution ...
详细信息
Uncertainty theory provides a new tool to deal with the shortest path problem with nondeterministic arc lengths. With help from the operational law of uncertainty theory, this paper gives the uncertainty distribution of the shortest path length. Also, it investigates solutions to the a-shortest path and the most shortest path in an uncertain network. It points out that there exists an equivalence relation between the alpha-shortest path in an uncertain network and the shortest path in a corresponding deterministic network, which leads to an effective algorithm to find the alpha-shortest path and the most shortest path. Roughly speaking, this algorithm can be broken down into two parts: constructing a deterministic network and then invoking the dijkstra algorithm. (C) 2011 Elsevier Ltd. All rights reserved.
In view of the problems of low routing efficiency, complex control process, and difficult network management in big data environment in the traditional integrated space-terrestrial network, in the paper, we propose a ...
详细信息
In view of the problems of low routing efficiency, complex control process, and difficult network management in big data environment in the traditional integrated space-terrestrial network, in the paper, we propose a satellite network architecture called software-defined information centric satellite networking (SDICSN) based on software-defined networking (SDN) and information-centric networking (ICN), and we design a virtual node matrix routing algorithm (VNMR) under the SDICSN architecture. The SDICSN architecture realizes the flexibility of network management and business deployment through the features of the separation of forwarding and controlling by the SDN architecture and improves the response speed of requests in the network by the centric of "content" as the ICN idea. According to the periodicity and predictability of the satellite network, the VNMR algorithm obtains the routing matrix through the relative orientation of the source and destination nodes, thus reducing the spatial complexity of the input matrix of the dijkstra algorithm and then reducing the time complexity of the routing algorithm. For forwarding information base (FIB), the mechanism of combination of event driven and polling can be quickly updated in real time. Finally, the advantages of the SDICSN architecture in routing efficiency, request delay, and request aggregation are verified by simulation.
暂无评论