Search

Over the coming years, the advancement of driverless transport systems for people and goods that are designed to be used on fixed routes will revolutionize the transportation system. Therefore, for a safe transportation system, detecting and recognizing traffic signals based on computer vision has become increasingly important. Deep learning approaches, particularly convolutional neural networks, have shown exceptional performance in various computer vision applications. The goal of this research is to precisely detect and recognize traffic signs that are present on the streets using computer vision and deep learning techniques. Previous work has focused on symbol-based traffic signals, where popular single-task learning models have been trained and tested. Therefore, several comparisons have been conducted to select accurate single-task learning models. For further improvement, these models are employed in a multi-task learning approach. Indeed, multi-task learning algorithms are built by sharing the convolutional layer parameters between the different tasks. Hence, for the multi-task learning approach, different experiments have been carried out using pre-trained architectures like, for instance, InceptionResNetV2 and DenseNet201. A range of traffic signs and traffic lights are employed to validate the designed model. An accuracy of 99.07% is achieved when the entire network has been trained. To further enhance the accuracy of the model for traffic signs obtained from the street, a region of interest module is added to the multi-task learning module to accurately extract the traffic signs available in the image. To check the effectiveness of the adopted methodology, the designed model has been successfully tested in real-time on a few Riyadh highways.

In this paper, a versatile Markovian queueing system is considered. Given a fixed threshold level c , the server serves customers one a time when the queue length is less than c , and in batches of fixed size c when the queue length is greater than or equal to c . The server is subject to failure when serving either a single or a batch of customers. Service rates, failure rates, and repair rates, depend on whether the server is serving a single customer or a batch of customers. While the analytical method provides the initial probability vector, we use the entropy principle to obtain both the initial probability vector (for comparison) and the tail probability vector. The comparison shows the results obtained analytically and approximately are in good agreement, especially when the first two moments are used in the entropy approach.

A flexible single-server queueing system is considered in this paper. The server adapts to the system size by using a strategy where the service provided can be either single or bulk depending on some threshold level c . If the number of customers in the system is less than c , then the server provides service to one customer at a time. If the number of customers in the system is greater than or equal to c , then the server provides service to a group of c customers. The service times are exponential and the service rates of single and bulk service are different. While providing service to either a single or a group of customers, the server may break down and goes through a repair phase. The breakdowns follow a Poisson distribution and the breakdown rates during single and bulk service are different. Also, repair times are exponential and repair rates during single and bulk service are different. The probability generating function and linear operator approaches are used to derive the system size steady-state probabilities.