Search Results

Noise and air pollution are among the most important problems and challenges in urban environments. Noise can cause several problems in functioning within urban settlements and may result in a variety of health problems. Continuous monitoring, ...

This article investigates cybersecurity issues related to in-vehicle communication networks. In-vehicle communication network security is evaluated based on the protection characteristics of the network components and the topology of the network. ...

Path planning with stochastic obstacles is well known researching area. The Canadian traveler problem (CTP) is a challenging stochastic optimization problem of traversing in a given graph having blocked edges and the disambiguation status of these edges ...

Security has become an important constraint in distributed real-time task system. For this paper, we give a security-critical distributed real-time task management model, then present a scheme for security-critical task management in the distributed ...

This paper presents an inter-vehicular communication (IVC)-based algorithm for real-time route guidance in urban traffic networks. The algorithm enables communication between searcher vehicle and candidate vehicles whose origin node matches the ...

This paper studies a new kind of dynamic multi-stage facility layout problem under dynamic business environment, in which new machines may be added into, or old machines may be removed from the plant. We define this problem first on the basis of unequal ...

Vehicle navigation is one of the important applications of the single-source single-target shortest path algorithm. This application frequently involves large scale networks with limited computing power and memory space. In this study, several heuristic ...

Given a closed curve with n points, based on the local integral square error and the curvature constraint criteria, this paper presents a novel two-pass O(Fn+mn^2)-time algorithm for solving the closed polygonal approximation problem where m(@?n) ...

Shortest path problems can be solved very efficiently when a directed graph is nearly acyclic. Earlier results defined a graph decomposition, now called the 1-dominator set, which consists of a unique collection of acyclic structures with each single ...

Maps are vital tools for most government agencies and consumers. However, their manual generation and updating is tedious, time consuming, and expensive. To address these concerns, we are developing automated techniques. In this paper, we restrict our ...

This paper describes the architecture and implementation of a shortest path processor, both in reconfigurable hardware and VLSI. This processor is based on the principles of recurrent spatiotemporal neural network. The processor's operation is similar ...