This paper designs to develop a transportable disaster response system named "DroneGo" through the deployment of drones,medical packages and containers to solve the problem of medical relief in the face of h...
详细信息
This paper designs to develop a transportable disaster response system named "DroneGo" through the deployment of drones,medical packages and containers to solve the problem of medical relief in the face of hurricane in Puerto ***,this paper aims to carry as many medical packages as *** the requirements of medical packages in disaster areas and the upper limit of the volume of ISO containers as constraints,adorned fleet and a set of medical packages meeting the requirements of Puerto Rico's hurricane scenario are obtained by using the integer programming ***,two optimal locations for the DroneGo disaster response system container were determined using the non-linear optimization,so as to be able to perform medical supply delivery and video reconnaissance on the road ***,simulated annealing algorithm and shortest path algorithm are adopted to plan the delivery route,schedule and flight plan of the *** on the analysis of the above problems,this paper establishes a viable "DroneGo" transportable disaster response ***,in case of future hurricane disasters exceeding the scale of existing disasters,the system established in this paper can still meet the medical relief needs brought by disasters after some minor adjustments.
This paper deals with Dijkstra's shortest path algorithm and with the possibilities of speeding-up this algorithm. This algorithm is a breadth-first-search algorithm. The search spreads circularly around the sourc...
详细信息
ISBN:
(纸本)9781607506881;9781607506874
This paper deals with Dijkstra's shortest path algorithm and with the possibilities of speeding-up this algorithm. This algorithm is a breadth-first-search algorithm. The search spreads circularly around the source node in order to find the shortestpath from the source node to other nodes. Each following iteration is based on the results of the previous iteration, therefore parallelization of such an algorithm is complicated. The parallel Dijkstra algorithm, proposed in this paper, is based on the bidirectional Dijkstra algorithm and popular multicore technology. Such a technology enables to create a parallel algorithm based on the shared memory and most of the time for data synchronization thereby is saved. The proposed algorithm has been tested using the real road network data. The proposed parallel algorithm is almost 3 times faster than the standard Dijkstra algorithm.
In this paper, software met 3.0 is applied to generate topology, which randomly generates dynamic topology nodes. Based on dynamic shortest path algorithms put forward by ***, Xiaobin et al, we analyzed the time effic...
详细信息
ISBN:
(纸本)9783037851494
In this paper, software met 3.0 is applied to generate topology, which randomly generates dynamic topology nodes. Based on dynamic shortest path algorithms put forward by ***, Xiaobin et al, we analyzed the time efficiency of dynamic and static shortest path algorithms, the different time efficiency inner dynamic shortest path algorithms, and the relationship of time efficiency between topology and dynamic shortest path algorithms. The result shows that Xiaobin algorithm is statistically better than Narvaez algorithm about 20-30 percent. Dynamic algorithms are not always better than static algorithms considering the amount of changed topology. Dynamic and static algorithms are roughly same when the amount of changed topology holds 10 percent. Dynamic algorithms perform better when less than 10 percent, otherwise static algorithms will be better. The time efficiency of dynamic algorithms is related to special topology.
Ball-end milling is widely used in five-axis high-speed machining. The abrupt change of tool orientations or rotary axes movements will scrap the workpiece. This research presents a smoothing method of rotary axes mov...
详细信息
Ball-end milling is widely used in five-axis high-speed machining. The abrupt change of tool orientations or rotary axes movements will scrap the workpiece. This research presents a smoothing method of rotary axes movements within the feasible domains of the rotary-axes space. Most existing smoothing methods of tool orientation or rotary axes movements employ the Dijkstra's shortest path algorithm. However, this algorithm requires extensive computations if the number of the cutter locations is large or the sampling resolution in the feasible regions is high. Moreover, jumps in the results obtained with the Dijkstra's shortest path algorithm may occur, because the optimization problem has to be converted from a continuous problem into a discrete problem when using this algorithm. The progressive iterative approximation (PIA) method incorporating smoothness terms is established as a gradient-based optimization method to smooth the rotary axes movements in this research. Then a gradient-based differential evolution (DE) algorithm, combining the global exploration feature of the DE algorithm and the local searching ability of the gradient-based optimization method, is developed to solve the smoothing model. The validity and effectiveness of the proposed approach are confirmed by numerical examples.
The automatic extraction of the vertebra's shape from dynamic magnetic resonance imaging (MRI) could improve understanding of clinical conditions and their diagnosis. It is hypothesized that the shape of the sacra...
详细信息
The automatic extraction of the vertebra's shape from dynamic magnetic resonance imaging (MRI) could improve understanding of clinical conditions and their diagnosis. It is hypothesized that the shape of the sacral curve is related to the development of some gynecological conditions such as pelvic organ prolapse (POP). POP is a critical health condition for women and consists of pelvic organs dropping from their normal position. Dynamic MRI is used for assessing POP and to complement clinical examination. Studies have shown some evidence on the association between the shape of the sacral curve and the development of POP. However, the sacral curve is currently extracted manually limiting studies to small datasets and inconclusive evidence. A method composed of an adaptive shortest path algorithm that enhances edge detection and linking, and an improved curve fitting procedure is proposed to automate the identification and segmentation of the sacral curve on MRI. The proposed method uses predetermined pixels surrounding the sacral curve that are found through edge detection to decrease computation time compared to other model-based segmentation algorithms. Moreover, the proposed method is fully automatic and does not require user input or training. Experimental results show that the proposed method can accurately identify sacral curves for nearly 91% of dynamic MRI cases tested in this study. The proposed model is robust and can be used to effectively identify bone structures on MRI. (C) 2017 Society of Photo-Optical Instrumentation Engineers (SPIE)
Internet of things (IoT) for Smart cities has been gradually bringing a sea of technological changes in our day to day life, which in turn helps to make our life more comfortable. Sensing and timely disseminating the ...
详细信息
Internet of things (IoT) for Smart cities has been gradually bringing a sea of technological changes in our day to day life, which in turn helps to make our life more comfortable. Sensing and timely disseminating the information to the base station is the main feature in Internet of Things enabled applications. This function is carried out by the base layer of IoT paradigm and it is consisted of wireless sensor networks (WSNs). In this paper, we propose a WSN-IoT paradigm for real-time applications. The main focus is to find the means of providing information as early as possible to receiver which is prerequisite in smart cities. In this paper, routing is based on the shortestpath which is selected using TOPSIS optimization and achieves balance between performance and energy consumption with regard to four criteria's: 1) Least distance of selected nodes from the base station, 2) Residual Energy, 3) minimum Euclidean distance between mth selected node and 4) next optimum nth node in the transmission range and number of neighboring nodes. Finally, Simulations are conducted in MATLAB in order to demonstrate how the proposed method would work to locate the best node in each cycle and confirm its effectiveness.
Range anxiety is one of the main obstacles to the wide diffusion of electric vehicles. Better understanding of the vehicle's energy consumption and driving range may help reduce electric vehicles drivers' stre...
详细信息
ISBN:
(纸本)9781509048045
Range anxiety is one of the main obstacles to the wide diffusion of electric vehicles. Better understanding of the vehicle's energy consumption and driving range may help reduce electric vehicles drivers' stress. This work proposes a model-based predictive strategy to estimate the energy driving range of an electric vehicle. The estimation takes into account the specific vehicle parameters, as well as the topology of the road network in which the vehicle operates and the real-time traffic conditions. A macroscopic version of the energy consumption model of the electric vehicle is presented in order to use the aggregated real-time data available on typical maps web-services. The road network is modeled as a weighted directed graph adapted to the proposed energy consumption model. The energy driving range is finally obtained by means of an optimal path search algorithm suitable for online use. The driving range thus obtained offers improved precision and reliability as compared to the average-consumption-based and distance-based strategies.
Routing system has been implemented in the outdoor routing and the indoor routing. There are significant differences that make indoor routing is more complex than outdoor routing, which is the outdoor routing implemen...
详细信息
ISBN:
(纸本)9783319623924;9783319623917
Routing system has been implemented in the outdoor routing and the indoor routing. There are significant differences that make indoor routing is more complex than outdoor routing, which is the outdoor routing implements two dimensional spaces, while at the indoor routing allows the routing of the three dimensional spaces that represent multi-level building. This research concern about the prototype development of the inter-building routing system. The construction of this prototype needs to consider both outdoor and indoor routing. shortest path algorithms could be implemented after the construction of three dimensional spaces spatial data structure in order to inform the users about the shortest route between two points in indoor spaces.
According to existed switched system theorem,packet-loss rate determines the stability of *** the core purpose to provide low packet-loss rate for distributed networked control systems（NCSs） under constraint communi...
详细信息
ISBN:
(纸本)9781538629185
According to existed switched system theorem,packet-loss rate determines the stability of *** the core purpose to provide low packet-loss rate for distributed networked control systems（NCSs） under constraint communication environment,the transmission optimization problem is discussed from global communication ***,network induced delay is described as time-correlative function by auto-regressive-moving-average（ARMA） model,and the future delay is predicted by the obtained delay ***,the widely cited shortest-path-of-time-dependent-network（SPTDN） algorithm is discussed and improved through inserting waiting-time before packets are sent to next node in a path,in order to obtain earlier arrival time than *** the notion of earliest-arrival time（EAT） is proposed to measure the quality of communication path,the online EAT algorithm is designed to search for future EAT and the corresponding path from the global network *** from the dynamic EAT path,packets arrive at destination as early as possible,it decreases packet-loss rate,hence EAT path ensures the stability of distributed NCSs from the view of global ***,the experiment proves the validity and effectiveness of the proposed approach.
The Internet is growing in a rapid pace and, as a natural result of this development, more aspects of daily life have relocated to the Internet. The Internet of Things, IoT, is a way of connecting devices over the Int...
详细信息
The Internet is growing in a rapid pace and, as a natural result of this development, more aspects of daily life have relocated to the Internet. The Internet of Things, IoT, is a way of connecting devices over the Internet, enabling them to collect and distribute data. Smart grids are one of the primary applications of IoT and, in the past few years, comprehensive research has been conducted on smart grid heat management systems. This thesis proposes a smart grid heat management system based on a model for the temperature change and a graph model, together with a shortest path algorithm in order to achieve financial savings. The proposed model for temperature and the graph model make use of energy prices and weather fore- casts, provided by Nord Pool and SMHI, respectively. The system is evaluated and analyzed in terms of financial savings in relation to the intermittent heating method used today, as well as in terms of performance, as it will be deployed on a microprocessor. The performance is evaluated by comparing memory usage and execution time by using A* search and Dijkstra's algorithm. The findings of the thesis suggests that it is possible to create a smart grid heat manage- ment system and achieve a decrease in energy costs, in relation to the intermittent heating method, of approximately 2.5%.
暂无评论