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.
This work focuses on developing cool store's thermal mapping system based on the neuro Wireless Sensor Network (nWSN). The network intelligence is taken care of by the sensor network embedded neural net. The target application of the architecture development is for cool stores with emphasis on meat storage. The meat quality is a significant characteristic within the cold chain management. Temperature...
Skeleton is a fundamental shape feature of 3D mesh, and it can be used in many areas, such as model search, shape analysis, and mesh deformation. This paper presents a novel skeleton extraction method based on mesh segmentation. Firstly, the mesh is cut off by Dijkstras Algorithm and the number of segments N, then the relevant sub-meshes centers are connected to constitute the skeleton. At last, the...
An efficient solution for a single-source problem called Thorup's algorithm has been proposed, whose computational complexity, O(N), is smaller than that of Dijkstra's algorithm, O(N log N). In this paper, we compare the performance of Dijkstra's algorithm and Thorup's algorithm for large-scale network simulation. Through extensive experiments, we show that Thorup's algorithm is slightly faster with...
This paper presents an approach to the shortest path problem in time-dependent multimodal networks. The approach derives, from the initial graph, a more simplified and non-time-dependent structure, called abstract graph, by using ant colony optimization. Then, a time-dependent Dijkstra's algorithm is used to compute the shortest path on the new structure. This approach improves two previous solutions...
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.