For the last two decades, intelligent transportation systems (ITS) have emerged as an efficient way of improving the performance of transportation systems, enhancing travel security, and providing more choices to travelers. A significant change in ITS in recent years is that much more data are collected from a variety of sources and can be processed into various forms for different stakeholders. The availability of a large amount of data can potentially lead to a revolution in ITS development, changing an ITS from a conventional technology-driven system into a more powerful multifunctional data-driven intelligent transportation system (D2ITS) : a system that is vision, multisource, and learning algorithm driven to optimize its performance. Furthermore, D2ITS is trending to become a privacy-aware people-centric more intelligent system. In this paper, we provide a survey on the development of D2ITS, discussing the functionality of its key components and some deployment issues associated with D2ITS Future research directions for the development of D2ITS is also presented.

Data-Driven Intelligent Transportation Systems: A Survey

http://www.nanoparticles.org/EMU/SurfMod/Wk12/JCR-05-102-313.pdf

Microencapsulation by solvent extraction/evaporation: reviewing the state of the art of microsphere preparation process technology.

Poly(lactide-co-glycolide) (PLGA) nanoparticles of different physical characteristics (size, size distribution, morphology, zeta potential) can be synthesized by controlling the parameters specific to the synthesis method employed. The aim of this review is to clearly, quantitatively and comprehensively describe the top-down synthesis techniques available for PLGA nanoparticle formation, as well as the techniques commonly used for nanoparticle characterization. Many examples are discussed in detail to provide the reader with an extensive knowledge base on the important parameters specific to the synthesis method described and ways in which these parameters can be manipulated to control the nanoparticle physical characteristics.

Synthesis and characterization of PLGA nanoparticles

A variety of important Petri net-based methods to prevent deadlocks arising in flexible manufacturing systems (FMS) are to add some control places and related arcs to strict minimal siphons (SMS) such that no siphon can be emptied. Since the number of minimal siphons grows in general exponentially with respect to a Petri net size, their disadvantages lie in that they often add too many additional places to the net, thereby making the resulting net model much more complex than the original one. This paper explores ways to minimize the new additions of places while achieving the same control purpose. It proposes for the first time the concept of elementary siphons that are a special class of siphons. The set of elementary siphons in a Petri net is generally a proper subset of the set of all SMS. Its smaller cardinality becomes evident in large Petri net models. This paper proves that by adding a control place for each elementary siphon to make sure that it is marked, deadlock can be successfully prevented. Compared with the existing methods, the new method requires a much smaller number of control places and, therefore, is suitable for large-scale Petri nets. An FMS example is used to illustrate the proposed concepts and policy, and show the significant advantage over the previous methods.

Elementary siphons of Petri nets and their application to deadlock prevention in flexible manufacturing systems

Microencapsulation by solvent evaporation: state of the art for process engineering approaches.

This paper presents a deadlock prevention method for a class of flexible manufacturing systems where deadlocks are caused by unmarked siphons in their Petri net models. This method is an iterative approach consisting of two main stages. At each iteration, a fast deadlock detection technique developed by mixed integer programming is used to find an unmarked maximal siphon. An algorithm is formalized that can efficiently obtain an unmarked minimal siphon from the maximal siphon. The first stage, called siphons control, of the proposed method is to add, for each unmarked minimal siphons, a control place to the original net with its output arcs to the sink transitions of the minimal siphon. The objective is to prevent a minimal siphon from being unmarked. The second stage, called augmented siphons control, is to add a control place to the modified net with its output arcs to the source transitions of the resultant net if the resource places are removed. The second stage is required since adding control places...

Deadlock prevention policy based on Petri nets and siphons

A siphon-based algorithm for deadlock prevention of a type of Petri nets called S3PMR, which is a subclass of S3PGR2, is presented in this correspondence. The proposed method is an iterative approach by adding two kinds of control places called ordinary control (OC) places and weighted control (WC) places to the original model to prevent siphons from being unmarked. An OC place with ordinary arcs, which optimally prevent a siphon from becoming unmarked, is employed whenever it is possible, and otherwise, the WC places that adopt a conservative policy of controlling the release of parts into the system are used. Furthermore, this algorithm is not only for the subclass Petri nets but also for S3PR, ES 3PR, S2LSPR, and S3PGR2 nets. The authors prove the liveness and reversibility of the controlled net, and hence establish the correctness of the deadlock prevention policy. Finally, numerical experiments indicate that the proposed policy appears to be more permissive than closely related approaches in the literature

A siphon-based deadlock prevention policy for flexible manufacturing systems

Deadlock prevention, deadlock detection, and deadlock avoidance strategies are used to solve the deadlock problems of flexible manufacturing systems. The theory of regions is recognized as the unique method for obtaining maximally permissive (i.e., optimal) controllers in the existing literature. All legal and live maximal behavior of a Petri net model can be preserved by using a marking/transition-separation instance (MTSI). However, obtaining them is an extremely time consuming problem. This work proposes crucial MTSIs that allow designers to employ much fewer MTSIs to deal with deadlocks. The advantage of the proposed policy is that an optimal deadlock controller can be obtained with drastically reduced computation. Experimental results, by varying the markings of given net structures, indicate that it is the most efficient policy to obtain such controllers.

Computationally Improved Optimal Deadlock Control Policy for Flexible Manufacturing Systems

Timed Petri nets (TPNs) have been utilized as visual formalism for the modeling of complex discrete-event dynamic systems. They illuminate the features in describing the properties of causality and concurrency. Moreover, it is well known that a synchronized TPN (STPN) allows us to present all of the concurrent states in a complex TPN. In this paper, we propose a new methodology to design and analyze an urban traffic network control system by using the STPN. In addition, the applications of the STPN to eight-phase, six-phase, and two-phase traffic-light control systems are modularized. The advantage of the proposed approach is the clear presentation of the behaviors of traffic lights in terms of the conditions and events that cause phase alternations. Moreover, the size of the urban traffic network control system can be easily extended with our proposed modular technique. An analysis of the control models is performed via a reachability graph method to demonstrate how the models enforce the transitions of the traffic lights.

Modular Design of Urban Traffic-Light Control Systems Based on Synchronized Timed Petri Nets

Timed Petri nets (TPNs) are useful for performance evaluation of discrete event systems due to their mathematical formalism. This paper focuses on their use to model the preemption of emergency vehicle systems. The advantage of the proposed approach is the clear presentation of traffic light behaviors in terms of conditions and events that cause the preemption of phases being changed. The resulting models allow one to identify and thus avoid urgent spectacles in such systems by conditions and events of the model that control the phase of traffic light alternations. Moreover, this work proposes a new emergency vehicle preemption policy to ensure that emergency vehicles can pass through intersections with no or less delay. The analysis is performed to demonstrate how the models enforce the phase of traffic transitions by a reachability graph with time information. The liveness and reversibility of the proposed model are verified. To our knowledge, this is the first work that employs TPNs to model an emergency vehicle preemption system and identify its urgent spectacles for the purpose of their complete avoidance. This helps advance the state-of-the-art in traffic safety related to the intersection of roadways.

Yi-Sheng Huang

Papers

Deadlock prevention policy based on Petri nets and siphons

A siphon-based deadlock prevention policy for flexible manufacturing systems

Computationally Improved Optimal Deadlock Control Policy for Flexible Manufacturing Systems

Modular Design of Urban Traffic-Light Control Systems Based on Synchronized Timed Petri Nets

Design of Traffic Safety Control Systems for Emergency Vehicle Preemption Using Timed Petri Nets