Fine-grained vehicle recognition using lightweight convolutional neural network with combined learning strategy
Q Zhang, L Zhuo, S Zhang, J Li… - 2018 IEEE Fourth …, 2018 - ieeexplore.ieee.org
Fine-grained vehicle recognition plays an important part in applications, such as urban traffic
management, public security, and criminal investigation. It has great challenges due to the …
management, public security, and criminal investigation. It has great challenges due to the …
Multiprocessor synchronization of periodic real-time tasks using dependency graphs
When considering recurrent real-time tasks in multiprocessor systems, access to shared
resources, via so-called critical sections, can jeopardize the schedulability of the system …
resources, via so-called critical sections, can jeopardize the schedulability of the system …
Bridging the Gap between ROS~ 2 and Classical Real-Time Scheduling for Periodic Tasks
The Robot Operating System 2 (ROS~ 2) is a widely used middleware that provides software
libraries and tools for developing robotic systems. In these systems, tasks are scheduled by …
libraries and tools for developing robotic systems. In these systems, tasks are scheduled by …
Real-time computing and the evolution of embedded system designs
Real-time computing provides insightful ways to explore the optimization in resource
usages, especially from the time point of view. Nevertheless, real-time task scheduling is …
usages, especially from the time point of view. Nevertheless, real-time task scheduling is …
Tighter bounds of speedup factor of partitioned EDF for constrained-deadline sporadic tasks
Even though earliest-deadline-first (EDF) is optimal in terms of uniprocessor schedulability, it
is co-NP-hard to precisely verify uniprocessor schedulability for constrained-deadline task …
is co-NP-hard to precisely verify uniprocessor schedulability for constrained-deadline task …
Narrowing the speedup factor gap of partitioned EDF
Schedulability is a fundamental problem in analyzing real-time systems, but it often has to be
approximated because of the intrinsic computational hardness. Partitioned earliest deadline …
approximated because of the intrinsic computational hardness. Partitioned earliest deadline …
An improved speedup factor for sporadic tasks with constrained deadlines under dynamic priority scheduling
Schedulability is a fundamental problem in real-time scheduling, but it has to be
approximated due to the intrinsic computational hardness. As the most popular algorithm for …
approximated due to the intrinsic computational hardness. As the most popular algorithm for …