Jiaxing Xu, Weihua Sun, Naoki Shibata and Minoru Ito : "GreenSwirl: Combining Traffic Signal Control and Route Guidance for Reducing Traffic Congestion," in Proc. of IEEE Vehicular Networking Conference 2014 (IEEE VNC 2014), pp. 179-186.
Serious traffic congestion is a major social problem in large cities. Inefficient setting of traffic signal cycles, especially, is one of the main causes of congestion. GreenWave is a method for controlling traffic signals which allows one-way traffic to pass through a series of intersections without being stopped by a red light. GreenWave was tested in several cities around the world, but the results were not satisfactory. Two of the problems with GreenWave are that it still stops the crossing traffic, and it forms congestion in the traffic turning into or out of the crossing streets. To solve these problems, we propose a method of controlling traffic signals, GreenSwirl, in combination with a route guidance method, GreenDrive. GreenSwirl controls traffic signals to enable a smooth flow of traffic through signals times to turn green in succession and through non-stop circular routes through the city. The GreenWave technology is extended thereby. We also use navigation systems to optimize the overall control of the city's traffic. We did a simulation using the traffic simulator SUMO and the road network of Manhattan Island in New York. We confirmed that our method shortens the average travel time by 10%-60%, even when not all cars on the road are equipped to use this system.
(Slides) P-Tour: A Personal Navigation System for TouristNaoki Shibata
http://ito-lab.naist.jp/themes/pdffiles/041019.atsu-mar.ITSWC2004.pdf
Maruyama, A., Shibata, N., Murata, Y., Yasumoto, K. and Ito, M.: P-Tour: A Personal Navigation System for Tourism, Proceedings of 11th World Congress on ITS Nagoya, pp.18-21 (October 2004)
We propose a personal navigation system for tourism called P-Tour. When a tourist specifies multiple destinations with relative importance and restrictions on arrival/staying time, P-Tour computes the nearly best schedule to visit part of those destinations. In addition to the map-based navigation, P-Tour provides temporal guidance according to the schedule, and automatically modifies the schedule when detecting the situation that the tourist cannot follow the schedule. We have developed a route search engine as a Java Servlet which can compute a semi-optimal schedule in reasonable time using techniques of genetic algorithms.
(Slides) A Method for Pedestrian Position Estimation using Inter-Vehicle Comm...Naoki Shibata
http://ito-lab.naist.jp/themes/ITS/pdfs/2-1/1.pdf
Sawa, Y., Kitani, T., Shibata, N., Yasumoto, K., Ito, M.:
A Method for Pedestrian Position Estimation using Inter-Vehicle Communication, Proc. of the 3rd IEEE Workshop on Automotive Networking and Applications (AutoNet 2008), pp. 1 - 6, DOI:10.1109/GLOCOMW.2008.ECP.57 (Dec 2008).
In this paper, we propose a method for detecting the positions of pedestrians by cooperation of multiple cars with directional antennas to support drivers for pedestrian safety. In the method, each pedestrian carries a device which periodically transmits a beacon with a unique ID, and each car passing near the pedestrian receives the beacon by a directional antenna and measures the distance and the angle of arrival.
We assume the distribution of the measurement errors to be a normal distribution, and the system calculates the existence probabilities of each pedestrian at each point. By exchanging information of the probabilities between cars, the area with high existence probability is narrowed down. In this paper, we first describe the situations where detecting positions of pedestrians greatly contribute to pedestrian safety, and then we describe the probability model used in our method, the method for calculating existence probabilities from information from multiple cars, and the protocol for exchanging the probability information between cars. We evaluated our method on QualNet simulator, and confirmed that the positions can be detected accurately enough for practical uses.
(Slides) A Technique for Information Sharing using Inter-Vehicle Communicatio...Naoki Shibata
Shinkawa, T., Terauchi, T., Kitani, T., Shibata, N., Yasumoto, K., Ito, M. and Higashino, T.: A Technique for Information Sharing using Inter-Vehicle Communication with Message Ferrying, International Workshop on Future Mobile and Ubiquitous Information Technologies (FMUIT'06).
http://mimi.naist.jp/~yasumoto/papers/FMUIT2006-shinkawa.pdf
In this paper, we propose a method to realize traffic information
sharing among cars using inter-vehicle communication.
When traffic information on a target area is retained
by ordinary cars near the area, the information may be lost
when the density of cars becomes low. In our method, we
use the message ferrying technique together with the neighboring
broadcast to mitigate this problem. We use buses
which travel through regular routes as ferries. We let buses
maintain the traffic information statistics in each area received
from its neighboring cars. We implemented the proposed
system, and conducted performance evaluation using
traffic simulator NETSTREAM. As a result, we have confirmed
that the proposed method can achieve better performance
than using only neighboring broadcast.
(Slides) A Personal Navigation System with a Schedule Planning Facility Based...Naoki Shibata
Shiraishi, T., Nagata, M., Shibata, N., Murata, Y., Yasumoto, K. and Ito, M.: A Personal Navigation System with a Schedule Planning Facility Based on Multiobjective Criteria, Proceedings of the 2nd International Conference on Mobile Computing and Ubiquitous Networking (ICMU2005), pp.104-109, (April 2005)
http://ito-lab.naist.jp/themes/pdffiles/icmu05-takayu-s.pdf
In our previous work, we have proposed a personal navigation
system called P-Tour, which facilitates tourists to compose
a schedule to visit multiple destinations taking into account
their preferences and time restrictions. In this paper,
we extend P-Tour in the following two ways: (1) allowing
users to optimize their tour schedules under multiple conflicting
criteria such as total expenses and satisfaction degrees;
and (2) navigating users to the next destination in more efficient
way. We have implemented the above extensions and
integrated them into P-Tour. Through some experiments, we
show the effectiveness of the proposed extensions.
Spot speed studies are used to determine the speed
distribution of a traffic stream at a specific location. I The data gathered in spot speed studies are used to determine vehicle speed percentiles, which are useful in making many speed-related decisions
Our project is the complete study about both Spot speed studies and Speed delay time survey. This topic is a part of Transportation Engineering. This report helps you to understand this topic in detail. This report will also help you to make project on associated topics in traffic engineering. In spot speed, We discussed regarding various methods available to perform the test, Our team practically performed test and established a speed limit zone near a school. Coming to speed delay time survey, we conducted a survey at a selected stretch and came out with solutions to the problems faced by the vehicle users using that stretch.
(Slides) P-Tour: A Personal Navigation System for TouristNaoki Shibata
http://ito-lab.naist.jp/themes/pdffiles/041019.atsu-mar.ITSWC2004.pdf
Maruyama, A., Shibata, N., Murata, Y., Yasumoto, K. and Ito, M.: P-Tour: A Personal Navigation System for Tourism, Proceedings of 11th World Congress on ITS Nagoya, pp.18-21 (October 2004)
We propose a personal navigation system for tourism called P-Tour. When a tourist specifies multiple destinations with relative importance and restrictions on arrival/staying time, P-Tour computes the nearly best schedule to visit part of those destinations. In addition to the map-based navigation, P-Tour provides temporal guidance according to the schedule, and automatically modifies the schedule when detecting the situation that the tourist cannot follow the schedule. We have developed a route search engine as a Java Servlet which can compute a semi-optimal schedule in reasonable time using techniques of genetic algorithms.
(Slides) A Method for Pedestrian Position Estimation using Inter-Vehicle Comm...Naoki Shibata
http://ito-lab.naist.jp/themes/ITS/pdfs/2-1/1.pdf
Sawa, Y., Kitani, T., Shibata, N., Yasumoto, K., Ito, M.:
A Method for Pedestrian Position Estimation using Inter-Vehicle Communication, Proc. of the 3rd IEEE Workshop on Automotive Networking and Applications (AutoNet 2008), pp. 1 - 6, DOI:10.1109/GLOCOMW.2008.ECP.57 (Dec 2008).
In this paper, we propose a method for detecting the positions of pedestrians by cooperation of multiple cars with directional antennas to support drivers for pedestrian safety. In the method, each pedestrian carries a device which periodically transmits a beacon with a unique ID, and each car passing near the pedestrian receives the beacon by a directional antenna and measures the distance and the angle of arrival.
We assume the distribution of the measurement errors to be a normal distribution, and the system calculates the existence probabilities of each pedestrian at each point. By exchanging information of the probabilities between cars, the area with high existence probability is narrowed down. In this paper, we first describe the situations where detecting positions of pedestrians greatly contribute to pedestrian safety, and then we describe the probability model used in our method, the method for calculating existence probabilities from information from multiple cars, and the protocol for exchanging the probability information between cars. We evaluated our method on QualNet simulator, and confirmed that the positions can be detected accurately enough for practical uses.
(Slides) A Technique for Information Sharing using Inter-Vehicle Communicatio...Naoki Shibata
Shinkawa, T., Terauchi, T., Kitani, T., Shibata, N., Yasumoto, K., Ito, M. and Higashino, T.: A Technique for Information Sharing using Inter-Vehicle Communication with Message Ferrying, International Workshop on Future Mobile and Ubiquitous Information Technologies (FMUIT'06).
http://mimi.naist.jp/~yasumoto/papers/FMUIT2006-shinkawa.pdf
In this paper, we propose a method to realize traffic information
sharing among cars using inter-vehicle communication.
When traffic information on a target area is retained
by ordinary cars near the area, the information may be lost
when the density of cars becomes low. In our method, we
use the message ferrying technique together with the neighboring
broadcast to mitigate this problem. We use buses
which travel through regular routes as ferries. We let buses
maintain the traffic information statistics in each area received
from its neighboring cars. We implemented the proposed
system, and conducted performance evaluation using
traffic simulator NETSTREAM. As a result, we have confirmed
that the proposed method can achieve better performance
than using only neighboring broadcast.
(Slides) A Personal Navigation System with a Schedule Planning Facility Based...Naoki Shibata
Shiraishi, T., Nagata, M., Shibata, N., Murata, Y., Yasumoto, K. and Ito, M.: A Personal Navigation System with a Schedule Planning Facility Based on Multiobjective Criteria, Proceedings of the 2nd International Conference on Mobile Computing and Ubiquitous Networking (ICMU2005), pp.104-109, (April 2005)
http://ito-lab.naist.jp/themes/pdffiles/icmu05-takayu-s.pdf
In our previous work, we have proposed a personal navigation
system called P-Tour, which facilitates tourists to compose
a schedule to visit multiple destinations taking into account
their preferences and time restrictions. In this paper,
we extend P-Tour in the following two ways: (1) allowing
users to optimize their tour schedules under multiple conflicting
criteria such as total expenses and satisfaction degrees;
and (2) navigating users to the next destination in more efficient
way. We have implemented the above extensions and
integrated them into P-Tour. Through some experiments, we
show the effectiveness of the proposed extensions.
Spot speed studies are used to determine the speed
distribution of a traffic stream at a specific location. I The data gathered in spot speed studies are used to determine vehicle speed percentiles, which are useful in making many speed-related decisions
Our project is the complete study about both Spot speed studies and Speed delay time survey. This topic is a part of Transportation Engineering. This report helps you to understand this topic in detail. This report will also help you to make project on associated topics in traffic engineering. In spot speed, We discussed regarding various methods available to perform the test, Our team practically performed test and established a speed limit zone near a school. Coming to speed delay time survey, we conducted a survey at a selected stretch and came out with solutions to the problems faced by the vehicle users using that stretch.
traffic volume studies pdf
traffic studies pdf
types of traffic engineering studies
traffic volume study report
traffic volume study
traffic impact studies
types of traffic studies
traffic safety studies
average daily traffic calculation
traffic volume formula
how to calculate adt traffic
calculating adt from peak hour
traffic volume growth factor formula
traffic growth rate calculator
aadt to peak hour volume
calculate dhv from adt
Presentation delivered at the 2015 Transportation Association of Canada (TAC) Conference & Exhibition, from September 27 to 30, during the session entitled Goods Movement - Reaching Destinations Safely and Efficiently.
Prepared by
François Bélisle, Eng., B. Sc., M.A.
Marilyne Brosseau, Eng., M.Eng.
Steve Careau, Eng.
Philippe Mytofir, techn.
Validated by:
Stephan Kellner, Eng., M.Eng.
Traffic volume study-opresentation by ahmed ferdous - 1004137-buetAhmed Ferdous Ankon
Traffic volume study-opresentation by Ahmed ferdous.......Please remind this is not a unique effort..My Classmates and specially Ahasanullah Un iversity Students were a major help...We have tried DATA ANALYSIS part to be a solo doing ..But other parts are nearly copy past from net especially from AUST ian...Hope you can do the whole on your own.....
traffic volume studies pdf
traffic studies pdf
types of traffic engineering studies
traffic volume study report
traffic volume study
traffic impact studies
types of traffic studies
traffic safety studies
average daily traffic calculation
traffic volume formula
how to calculate adt traffic
calculating adt from peak hour
traffic volume growth factor formula
traffic growth rate calculator
aadt to peak hour volume
calculate dhv from adt
Presentation delivered at the 2015 Transportation Association of Canada (TAC) Conference & Exhibition, from September 27 to 30, during the session entitled Goods Movement - Reaching Destinations Safely and Efficiently.
Prepared by
François Bélisle, Eng., B. Sc., M.A.
Marilyne Brosseau, Eng., M.Eng.
Steve Careau, Eng.
Philippe Mytofir, techn.
Validated by:
Stephan Kellner, Eng., M.Eng.
Traffic volume study-opresentation by ahmed ferdous - 1004137-buetAhmed Ferdous Ankon
Traffic volume study-opresentation by Ahmed ferdous.......Please remind this is not a unique effort..My Classmates and specially Ahasanullah Un iversity Students were a major help...We have tried DATA ANALYSIS part to be a solo doing ..But other parts are nearly copy past from net especially from AUST ian...Hope you can do the whole on your own.....
good communication system is very for the following purposes:
1-Synchronization of controller timer at each intersection for offset implementation.
2-Exchange of traffic data between controllers.
3-Malfunction reporting from each controller to the control room.
4-Incident reporting to the control room.
Intelligent Traffic Controller is designed and developed for the purpose of efficient traffic management, minimize pollution, increase current safety standards , smart toll collection system , theft detection and also to provide services to emergency vehicles.
TRAFFIC FLOW ANALYSIS & EFFICIENCY OF GEOMETRIC DESIGN OF A T-INTERSECTION, A...IAEME Publication
The major concern for a Highway Engineer in any road network system is an intersection.The heterogeneous traffic is more diverse in nature due to lane changing and lack of lane discipline characteristics of drivers’ in India. Our research is intended to check the efficiency and control of flow of traffic at “Tara Wala Pul (Bridge)-T intersection” , point out flaws (if any) in the geometric design and work out the possible solutions.
We analysis the current road congestion problem in Dhaka city. Based on our survey, we found some the possible causes and effects of traffic jam. At the end, we recommended some of the solutions that might be very effective in reducing traffic jam in Dhaka city.
Hey everyone, I presented this power point presentation in the "national science congress" held on nov-3 2012... This will be very useful for you as it is the current NEED OF THE HOUR topic...! download, present and enjoy...!
exit exam preparatiomn Login code: 92566. Do not give this code to anyone, even if they say they are from Telegram!
This code can be used to log in to your Telegram account. We never ask it for anything else.
If you didn't request this code by trying to log in on another device, simply ignore this message.
The present study has been undertaken to evaluate the delay caused to the traffic of Nagpur city and thus to implement the different strategies to reduce delay to the traffic. The existing signal timings causing delay to the traffic which can be reduce to some extent by changing the pattern of signal timings. Later the work continues with the factor of vehicle emission which can be decrease automatically if the delay reduces. Thus the signal timing data and volume data during peak hour were collected from different Junctions of , Nagpur. After work on simulation, it was found that the delay to the traffic and is reduced by some percent. Thus change in signal timing proves to be one of the strategy that can be implement in Nagpur city.
The Effects of Countdown Signals on Intersection Capacity drboon
This study presents the effects of countdown signals on the total start-up lost time of automobiles at signalized intersections based on the data collected at intersections in Bangkok, Thailand. This countdown signal is used to warn motorists in queue at the stop line during any red phase on when the green phase will be started. The data indicated that the countdown signals did not have any effects on the saturation headway of automobiles, but on the total start-up lost time. With the use of the countdown signals, the total start-up lost time was decreased from 4.3 seconds to 2.9 seconds, or was reduced by thirty-three percent. Therefore, the countdown signals may be used to increase the capacity of signalized intersections.
Circular barcode design resistant to linear motion blur (preliminary slides)Naoki Shibata
It is hard to recognize markers from a moving camera, because of motion blur. Our circular barcode design allows fairly stable recognition even with linear motion blur. Each circular barcode can contain 9 bits of data. We developed an algorithm that recognizes barcodes at 30 frames/sec from 1080P video, utilizing GPGPU.
(Paper) An Endorsement Based Mobile Payment System for a Disaster AreaNaoki Shibata
Babatunde Ojetunde, Naoki Shibata, Juntao Gao, and Minoru Ito : An Endorsement Based Mobile Payment System for A Disaster Area, in Proc. of The 29th IEEE International Conference on Advanced Information Networking and Applications (AINA-2015) (29% acceptance rate), pp.482-489, Mar. 2015. DOI:10.1109/AINA.2015.225
A payment system in a disaster area is essential for people to buy necessities such as groceries, clothing, and medical supplies. However, existing payment systems require the needed communication infrastructures (like wired networks and cellular networks) to enable transactions, so that these systems cannot be relied on in disaster areas, where these communication infrastructures may be destroyed. In this paper, we propose a mobile payment system, adopting infrastructureless mobile adhoc networks (MANETs), which allow users to shop in disaster areas while providing secure transactions. Specifically, we propose an endorsement-based scheme to guarantee each transaction and a scheme to provide monitoring based on location information, and thus achieve transaction validity and reliability. Our mobile payment system can also prevent collusion between two parties and reset and recover attacks by any user. Security is ensured by using location-based mutual monitoring by nearby users, avoiding thereby double spending in the system.
BalloonNet: A Deploying Method for a Three-Dimensional Wireless Network Surro...Naoki Shibata
Aiming at fast establishment of a wireless network around a multi-level building in a disaster area, we propose an efficient method to determine the locations of network nodes in the air. Nodes are attached to balloons outside a building and deployed in the air so that the network can be accessed from anywhere in the building. In this paper, we introduce an original radio propagation model for predicting path loss from an outdoor position to a position inside a building. In order to address the three-dimensional deployment problem, the proposed method optimizes an objective function for satisfying two goals: (1) guarantee the coverage: the target space needs to be covered by over a certain percentage by wireless network nodes, (2) minimize the number of network nodes. For solving this problem, we propose an algorithm based on a genetic algorithm. To evaluate the proposed method, we compared our method with three benchmark methods, and the results show that the proposed method requires fewer nodes than other methods.
Congestion Alleviation Scheduling Technique for Car Drivers Based on Predicti...Naoki Shibata
In arranging efficient touring to various areas in urban areas, taking into account potential congestion is needed in order to schedule the order of these visits it is important to on the roads used and at the places to be visited. A number of scheduling methods have been proposed for finding (1) a noncongested route by sharing route information among users, or (2) a schedule to alleviate congestion at specific places based on the latest congestion information. However, these methods do not suffice since they do not deal with, simultaneously, congestion on road and at sites visited. In this paper, we propose a method of finding schedules for thousands of users by predicting, in advance, both types of congestion. Using the predicted results, the method adjusts each user’s provisional schedule by changing visiting order of places, and reducing their number in keeping with each user’s preferences. We have implemented the proposed method and evaluated it by simulations. The results showed it to achieve higher user satisfaction than existing methods.
(Paper) MTcast: Robust and Efficient P2P-based Video Delivery for Heterogeneo...Naoki Shibata
In this paper, we propose a new video delivery method called MTcast (Multiple Transcode based video multicast) which achieves efficient simultaneous video delivery to multiple users with different quality requirements by relying on user nodes to transcode and forward video to other user nodes. In MTcast, each user specifies a quality requirement for a video consisting of bitrate, picture size and frame rate based on the user’s environmental resource limitation. All users can receive video with the specified quality (or near this quality) along a single delivery tree. The main characteristics of MTcast are in its scalability, high user satisfaction degree in received video quality, short startup latency and robustness against node failure. Through simulations, we have confirmed that MTcast can achieve much higher user satisfaction degree and robustness against node failure than the layered multicast method.
An Endorsement Based Mobile Payment System for A Disaster AreaNaoki Shibata
Babatunde Ojetunde, Naoki Shibata, Juntao Gao, and Minoru Ito : An Endorsement Based Mobile Payment System for A Disaster Area, to appear in Proc. of The 29th IEEE International Conference on Advanced Information Networking and Applications (AINA-2015), Mar. 2015.
A payment system in a disaster area is essential for people to buy necessities such as groceries, clothing, and medical supplies. However, existing payment systems require the needed communication infrastructures (like wired networks and cellular networks) to enable transactions, so that these systems cannot be relied on in disaster areas, where these communication infrastructures may be destroyed. In this paper, we propose a mobile payment system, adopting infrastructureless mobile adhoc networks (MANETs), which allow users to shop in disaster areas while providing secure transactions. Specifically, we propose an endorsement-based scheme to guarantee each transaction and a scheme to provide monitoring based on location information, and thus achieve transaction validity and reliability. Our mobile payment system can also prevent collusion between two parties and reset and recover attacks by any user. Security is ensured by using location-based mutual monitoring by nearby users, avoiding thereby double spending in the system.
Task Scheduling Algorithm for Multicore Processor Systems with Turbo Boost an...Naoki Shibata
Yosuke Wakisaka, Naoki Shibata, Keiichi Yasumoto, Minoru Ito, and Junji Kitamichi : Task Scheduling Algorithm for Multicore Processor Systems with Turbo Boost and Hyper-Threading, In Proc. of The 2014 International Conference on Parallel and Distributed Processing Techniques and Applications(PDPTA'14), pp. 229-235
In this paper, we propose a task scheduling algorithm for multiprocessor systems with Turbo Boost and Hyper-Threading technologies. The proposed algorithm minimizes the total computation time taking account of dynamic changes of the processing speed by the two technologies, in addition to the network contention among the processors. We constructed a clock speed model with which the changes of processing speed with Turbo Boost and Hyper-threading can be estimated for various processor usage patterns. We then constructed a new scheduling algorithm that minimizes the total execution time of a task graph considering network contention and the two technologies. We evaluated the proposed algorithm by simulations and experiments with a multiprocessor system consisting of 4 PCs. In the experiment, the proposed algorithm produced a schedule that reduces the total execution time by 36% compared to conventional methods which are straightforward extensions of an existing method.
GPGPU-Assisted Subpixel Tracking Method for Fiducial MarkersNaoki Shibata
With an aim to realizing highly accurate position estimation, we propose in this paper a method for efficiently and accurately detecting the 3D positions and poses of traditional fiducial markers with black frames in high resolution images taken by ordinary web cameras. Our tracking method can be efficiently executed utilizing GPGPU computation, and in order to realize this, we devised a connected-component labeling method suitable for GPGPU execution. In order to improve accuracy, we devised a method for detecting 2D positions of the corners of markers in subpixel accuracy. We implemented our method in Java and OpenCL, and we confirmed that the proposed method provides better detection and measurement accuracy, and recognizing from high-resolution images is beneficial for improving accuracy. We also confirmed that our method is more than two times as fast as the existing method with CPU computation.
(Paper) BalloonNet: A Deploying Method for a Three-Dimensional Wireless Netwo...Naoki Shibata
Aiming at fast establishment of a wireless network around a multi-level building in a disaster area, we propose an efficient method to determine the locations of network nodes in the air. Nodes are attached to balloons outside a building and deployed in the air so that the network can be accessed from anywhere in the building. In this paper, we introduce an original radio propagation model for predicting path loss from an outdoor position to a position inside a building. In order to address the three-dimensional deployment problem, the proposed method optimizes an objective function for satisfying two goals: (1) guarantee the coverage: the target space needs to be covered by over a certain percentage by wireless network nodes, (2) minimize the number of network nodes. For solving this problem, we propose an algorithm based on a genetic algorithm. To evaluate the proposed method, we compared our method with three benchmark methods, and the results show that the proposed method requires fewer nodes than other methods.
(Paper) Emergency Medical Support System for Visualizing Locations and Vital ...Naoki Shibata
The triage tag is used in Mass Casualty Incident (MCI) to check the priority of patients treatments and conditions. However, it is difficult to grasp a change in the patient’s information since it is a paper tag. In this paper, we propose a system using the electronic triage tag (eTriage) that facilitates emergency medical technicians to grasp patients locations and conditions through visualization. This system provides the following three views of the patients information: (1) Inter-site view which shows on a map an overview of the latest status in multiple first-aid stations including the number of technicians and patients of each triage category; (2) Intra-site view which shows detailed status of each first-aid station including the location, triage category, and vital signs of each patient on a 3D map created based on the environment mapping technique; and (3) Individual view which shows vital information of patients on a tablet PC according to its orientation using the augmented reality technique. In this paper, we describe the design and implementation of the proposed system with some preliminary evaluation results.
(Paper) A Method for Overlay Network Latency Estimation from Previous Observa...Naoki Shibata
Weihua Sun, Naoki Shibata, Keiichi Yasumoto, Masaaki Mori, "A Method for Overlay Network Latency Estimation from Previous Observation", in Proc. of The Twelfth International Conference on Networks (ICN2013), pp.95--100, 29 Jan. 2013.
Abstract—Estimation of the qualities of overlay links is useful for optimizing overlay networks on the Internet. Existing estimation methods requires sending large quantities of probe packets between two nodes, and the software for measurements have to be executed at both of the end nodes. Accurate measurements require many probe packets to be sent, and other communication can be disrupted by significantly increased network traffic. In this paper, we propose a link quality estimation method based on supervised learning from the previous observation of other similar links. Our method does not need to exchange probe packets, estimation can be quickly made to know qualities of many overlay links without wasting bandwidth and processing time on many nodes. We conducted evaluation of our method on PlanetLab, and our method showed better performance on path latency estimation than estimating results from geographical distance between the two end nodes.
(Paper) Parking Navigation for Alleviating Congestion in Multilevel Parking F...Naoki Shibata
Kenmotsu, M., Sun, W., Shibata, N., Yasumoto, K. and Ito, M. : "Parking Navigation for Alleviating Congestion in Multilevel Parking Facility," Proc. of 2012 IEEE 76th Vehicular Technology Conference (VTC2012-Fall), Sep.2012.
Abstract - Finding a vacant parking space in a large crowded parking facility takes long time. In this paper, we propose a navigation method that minimizes the parking time based on collected real-time positional information of cars. In the proposed method, a central server in the parking facility collects the information and estimates the occupancy of each parking zone. Then, the server broadcasts the occupancy data to the cars in the parking facility. Each car then computes a parking route with the shortest expected parking waiting time and shows it to the driver. We conducted simulation-based evaluations of the proposed method using a realistic model based on trace data taken from a real parking facility. We confirmed that the proposed method reduced parking waiting time by 20%–70% even with low system penetration.
Takashima, E.,Murata, Y., Shibata, N., Ito, M.: Self Adaptive Island GA, Proceedings of 2003 Congress on Evolutionary Computation (CEC 2003), Vol.2, pp.1072-1079, DOI:10.1109/CEC.2003.1299787
http://ito-lab.naist.jp/themes/pdffiles/031209.eiichi-t.cec2003.pdf
Exploration efficiency of GAs largely depends on parameter values. But, it is hard to manually adjust these values. T o cope with this problem, several adaptive GAs which automatically adjust parameters have been proposed. However , most of the existing adaptive GAs can adapt only a few parameters at the same time. Al-though several adaptive GAs can adapt multiple param-eters simultaneously , these algorithms require extremely large computation costs. In this paper , we propose Self Adaptive Island GA(SAIGA) which adapts four param-eter values simultaneously while finding a solution to a problem. SAIGA is a kind of island GA, and it adapts parameter values using a similar mechanism to meta-GA. Throughout our evaluation experiments, we con-firmed that our algorithm outperforms a simple GA us-ing De Jong's rational parameters, and has performance close to a simple GA using manually tuned parameter values.
(Paper) Efficient Evaluation Methods of Elementary Functions Suitable for SIM...Naoki Shibata
Naoki Shibata : Efficient Evaluation Methods of Elementary Functions Suitable for SIMD Computation, Journal of Computer Science on Research and Development, Proceedings of the International Supercomputing Conference ISC10., Volume 25, Numbers 1-2, pp. 25-32, DOI:10.1007/s00450-010-0108-2 (May. 2010).
http://ito-lab.naist.jp/~n-sibata/pdfs/isc10simd.pdf
http://freecode.com/projects/sleef
Data-parallel architectures like SIMD (Single Instruction Multiple Data) or SIMT (Single Instruction Multiple Thread) have been adopted in many recent CPU and GPU architectures. Although some SIMD and SIMT instruction sets include double-precision arithmetic and bitwise operations, there are no instructions dedicated to evaluating elementary functions like trigonometric functions in double precision. Thus, these functions have to be evaluated one by one using an FPU or using a software library. However, traditional algorithms for evaluating these elementary functions involve heavy use of conditional branches and/or table look-ups, which are not suitable for SIMD computation. In this paper, efficient methods are proposed for evaluating the sine, cosine, arc tangent, exponential and logarithmic functions in double precision without table look-ups, scattering from, or gathering into SIMD registers, or conditional branches. We implemented these methods using the Intel SSE2 instruction set to evaluate their accuracy and speed. The results showed that the average error was less than 0.67 ulp, and the maximum error was 6 ulps. The computation speed was faster than the FPUs on Intel Core 2 and Core i7 processors.
(Slides) A Decentralized Method for Maximizing k-coverage Lifetime in WSNsNaoki Shibata
Katsuma, R., Murata, Y., Shibata, N., Yasumoto, K., Ito, M.: "A Decentralized Method for Maximizing k-coverage Lifetime in WSNs," Proc. of The Sixth International Conference on Mobile Computing and Ubiquitous Networking (ICMU 2012), pp.16-23, May.23, 2012.
http://ito-lab.naist.jp/mediawiki/images/1/17/Icmu2012.pdf
In this paper, we propose a decentralized method for maximizing lifetime of data collection wireless sensor networks (WSNs) by making minimal number of nodes operate and putting other nodes in sleep. We divide a target field into multiple grids and make nodes in each grid locally achieve k-coverage. We can reduce energy consumption of WSN by minimizing the number of active nodes required for kcoverage. However, coverage degree is likely to go to excess beyond k near border between grids when deciding active nodes in each grid independently. To solve this problem, our method decides the minimal set of active nodes for adjoined grids at different times so that k-coverage of a grid is achieved taking into account the coverage in its neighboring grids. Through computer simulations, we confirmed that the proposed method achieved distribution of WSN processing with a small decrease of k-coverage lifetime compared to the centralized algorithm.
(Paper) Task scheduling algorithm for multicore processor system for minimiz...Naoki Shibata
Shohei Gotoda, Naoki Shibata and Minoru Ito : "Task scheduling algorithm for multicore processor system for minimizing recovery time in case of single node fault," Proceedings of IEEE International Symposium on Cluster Computing and the Grid (CCGrid 2012), pp.260-267, DOI:10.1109/CCGrid.2012.23, May 15, 2012.
In this paper, we propose a task scheduling al-gorithm for a multicore processor system which reduces the
recovery time in case of a single fail-stop failure of a multicore
processor. Many of the recently developed processors have
multiple cores on a single die, so that one failure of a computing
node results in failure of many processors. In the case of a failure
of a multicore processor, all tasks which have been executed
on the failed multicore processor have to be recovered at once.
The proposed algorithm is based on an existing checkpointing
technique, and we assume that the state is saved when nodes
send results to the next node. If a series of computations that
depends on former results is executed on a single die, we need
to execute all parts of the series of computations again in
the case of failure of the processor. The proposed scheduling
algorithm tries not to concentrate tasks to processors on a die.
We designed our algorithm as a parallel algorithm that achieves
O(n) speedup where n is the number of processors. We evaluated
our method using simulations and experiments with four PCs.
We compared our method with existing scheduling method, and
in the simulation, the execution time including recovery time in
the case of a node failure is reduced by up to 50% while the
overhead in the case of no failure was a few percent in typical
scenarios.
(Slides) Task scheduling algorithm for multicore processor system for minimiz...Naoki Shibata
Shohei Gotoda, Naoki Shibata and Minoru Ito : "Task scheduling algorithm for multicore processor system for minimizing recovery time in case of single node fault," Proceedings of IEEE International Symposium on Cluster Computing and the Grid (CCGrid 2012), pp.260-267, DOI:10.1109/CCGrid.2012.23, May 15, 2012.
In this paper, we propose a task scheduling al-gorithm for a multicore processor system which reduces the
recovery time in case of a single fail-stop failure of a multicore
processor. Many of the recently developed processors have
multiple cores on a single die, so that one failure of a computing
node results in failure of many processors. In the case of a failure
of a multicore processor, all tasks which have been executed
on the failed multicore processor have to be recovered at once.
The proposed algorithm is based on an existing checkpointing
technique, and we assume that the state is saved when nodes
send results to the next node. If a series of computations that
depends on former results is executed on a single die, we need
to execute all parts of the series of computations again in
the case of failure of the processor. The proposed scheduling
algorithm tries not to concentrate tasks to processors on a die.
We designed our algorithm as a parallel algorithm that achieves
O(n) speedup where n is the number of processors. We evaluated
our method using simulations and experiments with four PCs.
We compared our method with existing scheduling method, and
in the simulation, the execution time including recovery time in
the case of a node failure is reduced by up to 50% while the
overhead in the case of no failure was a few percent in typical
scenarios.
(Slides) A Method for Distributed Computaion of Semi-Optimal Multicast Tree i...Naoki Shibata
Takashima, E., Murata, Y., Shibata, N., Yasumoto, K. and Ito, M.: A Method for Distributed Computaion of Semi-Optimal Multicast Tree in MANET, IEEE Wireless Communications and Networking Conference (WCNC 2007), pp. 2570-2575, DOI:10.1109/WCNC.2007.478 (March 2007).
http://ito-lab.naist.jp/themes/pdffiles/070314.eiichi-t.wcnc2007.pdf
In this paper, we propose a new method to construct
a semi-optimal QoS-aware multicast tree on MANET using
distributed computation of the tree based on Genetic Algorithm
(GA). This tree is sub-optimal for a given objective (e.g.,
communication stability and power consumption), and satisfies
given QoS constraints for bandwidth and delay. In order to
increase scalability, our proposed method first divides the whole
MANET to multiple clusters, and computes a tree for each
cluster and a tree connecting all clusters. Each tree is computed
by GA in some nodes selected in the corresponding cluster.
Through experiments using network simulator, we confirmed that
our method outperforms existing on-demand multicast routing
protocol in some useful objectives.
(Slides) A demand-oriented information retrieval method on MANETNaoki Shibata
Enomoto, M., Shibata, N., Yasumoto, K., Ito, M. and Higashino, T.: A demand-oriented information retrieval method on MANET, International Workshop on Future Mobile and Ubiquitous Information Technologies (FMUIT'06).
http://ito-lab.naist.jp/themes/pdffiles/060510.makoto-e.fmuit06.pdf
In urban areas including shopping malls and stations
with many people, it is important to utilize various information
which those people have obtained. In this paper, we
propose a method for information registration and retrieval
in MANET which achieves small communication cost and
short response time. In our method, we divide the whole application
field into multiple sub-areas and classify records
into several categories so that mobile terminals in an area
holds records with a category. Each area is associated with
a category so that the number of queries for the category
becomes the largest in the area. Thus, mobile users search
records with a certain category by sending a query to nodes
in the particular area using existing protocol such as LBM
(Location-Based Multicast). Through simulations supposing
actual urban area near Osaka station, we have confirmed
that our method achieves practical communication
cost and performance for information retrieval in MANET.
(Slides) Inter-Vehicle Communication Protocol for Cooperatively Capturing and...Naoki Shibata
Kotani, K., Sun, W., Kitani, T., Shibata, N., Yasumoto, K., Ito, M.:Inter-Vehicle Communication Protocol for Cooperatively Capturing and Sharing Intersection Video, Proc. of 2nd IEEE Intelligent Vehicular Communications System Workshop (IVCS'10), (CD-ROM), Jan. 9th, 2010. DOI:10.1109/CCNC.2010.5421635 (Jan. 2010).
http://www.aist-nara.ac.jp/~sunweihua/papers-fullversion/I-10-01-02.pdf
For accident prevention at intersections, it is useful for
drivers to grasp the position of vehicles in blind spots.
This can be achieved without infrastructure if some vehicles
passing near the intersection capture and share live
video of the intersection through inter-vehicle communications.
However, such video streaming requires a congestion
control mechanism. In this paper, aiming to let a driver
grasp the situation at an intersection, we propose a method
to select vehicles that send a video in order to generate a
live bird’s-eye-view video of the intersection. In our method,
each vehicle at an intersection exchanges information with
others, such as the sub-areas of the intersection it captures,
the quality of its video, and its position and speed. Based
on the exchanged information, each vehicle autonomously
judges whether it should send its video or not. Through
simulation with a QualNet simulator, we confirm that our
method achieves a good video arrival rate and video quality
sufficient for practical use.
The increased availability of biomedical data, particularly in the public domain, offers the opportunity to better understand human health and to develop effective therapeutics for a wide range of unmet medical needs. However, data scientists remain stymied by the fact that data remain hard to find and to productively reuse because data and their metadata i) are wholly inaccessible, ii) are in non-standard or incompatible representations, iii) do not conform to community standards, and iv) have unclear or highly restricted terms and conditions that preclude legitimate reuse. These limitations require a rethink on data can be made machine and AI-ready - the key motivation behind the FAIR Guiding Principles. Concurrently, while recent efforts have explored the use of deep learning to fuse disparate data into predictive models for a wide range of biomedical applications, these models often fail even when the correct answer is already known, and fail to explain individual predictions in terms that data scientists can appreciate. These limitations suggest that new methods to produce practical artificial intelligence are still needed.
In this talk, I will discuss our work in (1) building an integrative knowledge infrastructure to prepare FAIR and "AI-ready" data and services along with (2) neurosymbolic AI methods to improve the quality of predictions and to generate plausible explanations. Attention is given to standards, platforms, and methods to wrangle knowledge into simple, but effective semantic and latent representations, and to make these available into standards-compliant and discoverable interfaces that can be used in model building, validation, and explanation. Our work, and those of others in the field, creates a baseline for building trustworthy and easy to deploy AI models in biomedicine.
Bio
Dr. Michel Dumontier is the Distinguished Professor of Data Science at Maastricht University, founder and executive director of the Institute of Data Science, and co-founder of the FAIR (Findable, Accessible, Interoperable and Reusable) data principles. His research explores socio-technological approaches for responsible discovery science, which includes collaborative multi-modal knowledge graphs, privacy-preserving distributed data mining, and AI methods for drug discovery and personalized medicine. His work is supported through the Dutch National Research Agenda, the Netherlands Organisation for Scientific Research, Horizon Europe, the European Open Science Cloud, the US National Institutes of Health, and a Marie-Curie Innovative Training Network. He is the editor-in-chief for the journal Data Science and is internationally recognized for his contributions in bioinformatics, biomedical informatics, and semantic technologies including ontologies and linked data.
Cancer cell metabolism: special Reference to Lactate PathwayAADYARAJPANDEY1
Normal Cell Metabolism:
Cellular respiration describes the series of steps that cells use to break down sugar and other chemicals to get the energy we need to function.
Energy is stored in the bonds of glucose and when glucose is broken down, much of that energy is released.
Cell utilize energy in the form of ATP.
The first step of respiration is called glycolysis. In a series of steps, glycolysis breaks glucose into two smaller molecules - a chemical called pyruvate. A small amount of ATP is formed during this process.
Most healthy cells continue the breakdown in a second process, called the Kreb's cycle. The Kreb's cycle allows cells to “burn” the pyruvates made in glycolysis to get more ATP.
The last step in the breakdown of glucose is called oxidative phosphorylation (Ox-Phos).
It takes place in specialized cell structures called mitochondria. This process produces a large amount of ATP. Importantly, cells need oxygen to complete oxidative phosphorylation.
If a cell completes only glycolysis, only 2 molecules of ATP are made per glucose. However, if the cell completes the entire respiration process (glycolysis - Kreb's - oxidative phosphorylation), about 36 molecules of ATP are created, giving it much more energy to use.
IN CANCER CELL:
Unlike healthy cells that "burn" the entire molecule of sugar to capture a large amount of energy as ATP, cancer cells are wasteful.
Cancer cells only partially break down sugar molecules. They overuse the first step of respiration, glycolysis. They frequently do not complete the second step, oxidative phosphorylation.
This results in only 2 molecules of ATP per each glucose molecule instead of the 36 or so ATPs healthy cells gain. As a result, cancer cells need to use a lot more sugar molecules to get enough energy to survive.
Unlike healthy cells that "burn" the entire molecule of sugar to capture a large amount of energy as ATP, cancer cells are wasteful.
Cancer cells only partially break down sugar molecules. They overuse the first step of respiration, glycolysis. They frequently do not complete the second step, oxidative phosphorylation.
This results in only 2 molecules of ATP per each glucose molecule instead of the 36 or so ATPs healthy cells gain. As a result, cancer cells need to use a lot more sugar molecules to get enough energy to survive.
introduction to WARBERG PHENOMENA:
WARBURG EFFECT Usually, cancer cells are highly glycolytic (glucose addiction) and take up more glucose than do normal cells from outside.
Otto Heinrich Warburg (; 8 October 1883 – 1 August 1970) In 1931 was awarded the Nobel Prize in Physiology for his "discovery of the nature and mode of action of the respiratory enzyme.
WARNBURG EFFECT : cancer cells under aerobic (well-oxygenated) conditions to metabolize glucose to lactate (aerobic glycolysis) is known as the Warburg effect. Warburg made the observation that tumor slices consume glucose and secrete lactate at a higher rate than normal tissues.
(May 29th, 2024) Advancements in Intravital Microscopy- Insights for Preclini...Scintica Instrumentation
Intravital microscopy (IVM) is a powerful tool utilized to study cellular behavior over time and space in vivo. Much of our understanding of cell biology has been accomplished using various in vitro and ex vivo methods; however, these studies do not necessarily reflect the natural dynamics of biological processes. Unlike traditional cell culture or fixed tissue imaging, IVM allows for the ultra-fast high-resolution imaging of cellular processes over time and space and were studied in its natural environment. Real-time visualization of biological processes in the context of an intact organism helps maintain physiological relevance and provide insights into the progression of disease, response to treatments or developmental processes.
In this webinar we give an overview of advanced applications of the IVM system in preclinical research. IVIM technology is a provider of all-in-one intravital microscopy systems and solutions optimized for in vivo imaging of live animal models at sub-micron resolution. The system’s unique features and user-friendly software enables researchers to probe fast dynamic biological processes such as immune cell tracking, cell-cell interaction as well as vascularization and tumor metastasis with exceptional detail. This webinar will also give an overview of IVM being utilized in drug development, offering a view into the intricate interaction between drugs/nanoparticles and tissues in vivo and allows for the evaluation of therapeutic intervention in a variety of tissues and organs. This interdisciplinary collaboration continues to drive the advancements of novel therapeutic strategies.
A brief information about the SCOP protein database used in bioinformatics.
The Structural Classification of Proteins (SCOP) database is a comprehensive and authoritative resource for the structural and evolutionary relationships of proteins. It provides a detailed and curated classification of protein structures, grouping them into families, superfamilies, and folds based on their structural and sequence similarities.
Multi-source connectivity as the driver of solar wind variability in the heli...Sérgio Sacani
The ambient solar wind that flls the heliosphere originates from multiple
sources in the solar corona and is highly structured. It is often described
as high-speed, relatively homogeneous, plasma streams from coronal
holes and slow-speed, highly variable, streams whose source regions are
under debate. A key goal of ESA/NASA’s Solar Orbiter mission is to identify
solar wind sources and understand what drives the complexity seen in the
heliosphere. By combining magnetic feld modelling and spectroscopic
techniques with high-resolution observations and measurements, we show
that the solar wind variability detected in situ by Solar Orbiter in March
2022 is driven by spatio-temporal changes in the magnetic connectivity to
multiple sources in the solar atmosphere. The magnetic feld footpoints
connected to the spacecraft moved from the boundaries of a coronal hole
to one active region (12961) and then across to another region (12957). This
is refected in the in situ measurements, which show the transition from fast
to highly Alfvénic then to slow solar wind that is disrupted by the arrival of
a coronal mass ejection. Our results describe solar wind variability at 0.5 au
but are applicable to near-Earth observatories.
Seminar of U.V. Spectroscopy by SAMIR PANDASAMIR PANDA
Spectroscopy is a branch of science dealing the study of interaction of electromagnetic radiation with matter.
Ultraviolet-visible spectroscopy refers to absorption spectroscopy or reflect spectroscopy in the UV-VIS spectral region.
Ultraviolet-visible spectroscopy is an analytical method that can measure the amount of light received by the analyte.
Earliest Galaxies in the JADES Origins Field: Luminosity Function and Cosmic ...Sérgio Sacani
We characterize the earliest galaxy population in the JADES Origins Field (JOF), the deepest
imaging field observed with JWST. We make use of the ancillary Hubble optical images (5 filters
spanning 0.4−0.9µm) and novel JWST images with 14 filters spanning 0.8−5µm, including 7 mediumband filters, and reaching total exposure times of up to 46 hours per filter. We combine all our data
at > 2.3µm to construct an ultradeep image, reaching as deep as ≈ 31.4 AB mag in the stack and
30.3-31.0 AB mag (5σ, r = 0.1” circular aperture) in individual filters. We measure photometric
redshifts and use robust selection criteria to identify a sample of eight galaxy candidates at redshifts
z = 11.5 − 15. These objects show compact half-light radii of R1/2 ∼ 50 − 200pc, stellar masses of
M⋆ ∼ 107−108M⊙, and star-formation rates of SFR ∼ 0.1−1 M⊙ yr−1
. Our search finds no candidates
at 15 < z < 20, placing upper limits at these redshifts. We develop a forward modeling approach to
infer the properties of the evolving luminosity function without binning in redshift or luminosity that
marginalizes over the photometric redshift uncertainty of our candidate galaxies and incorporates the
impact of non-detections. We find a z = 12 luminosity function in good agreement with prior results,
and that the luminosity function normalization and UV luminosity density decline by a factor of ∼ 2.5
from z = 12 to z = 14. We discuss the possible implications of our results in the context of theoretical
models for evolution of the dark matter halo mass function.
Comparative structure of adrenal gland in vertebrates
GreenSwirl: Combining Traffic Signal Control and Route Guidance for Reducing Traffic Congestion
1. Jiaxing Xu†1 , Weihua Sun†2, Naoki Shibata†1, Minoru Ito†1
†1 Nara Institute of Science and Technology, Japan
†2 Shiga University, Japan
2. We combine Traffic Signal Control and Route
Guidance so that
Reduce traffic congestion
Vehicles likely encounter green lights
Minimize the travel time of vehicles
Proposed method consists of two parts
GreenSwirl: traffic signal control method
▪ Enable smooth-flowing traffic on many circular routes
GreenDrive: route guidance method
▪ Guide of the shortest time path for individual drivers
2
The whole traffic
Vehicles
3. Background and Related Study
Proposed Method
Evaluation and Results
Conclusion and Future Work
3
4. Serious traffic congestion
The lack of carefully planned traffic
signals is one of the major reasons
4
Air pollution caused by vehicle
emissions
25% of PM2.5 pollution in Beijing comes
from exhaust gas from vehicles
In order to reduce traffic congestion
Traffic Signal Control GreenWave
Dynamic Route Guidance
5. Coordinating a series of traffic lights to
enable continuous traffic flow over several
intersections in one main direction
Principle: control the time period for green lights by
predicting the arrival time of vehicles
GreenWave Direction 5
6. GreenWave cannot be created at crossing traffic
6
GreenWave
GreenWave
GreenWave
GreenWave
7. Often red light at opposite lane
10 traffic lights were tested in
Nanjing City, China (May 19, 2014)
GreenWave
GreenWave
GreenWave
7
4km
GreenWave Direction : 4 minutes
Opposite Direction: 9 minutes
9. Control traffic signals on many direction
roads
Control the traffic and guide the vehicles to
the optimal route
Priority in a single direction
Low capacity of roads connecting to main
roads Easily causing congestion
Entering excessive vehicles Gridlock
10. Background and Related Study
Proposed Method
Evaluation and Results
Conclusion and Future Work
10
12. GreenWave is formed on many roads like huge swirls
throughout one city
A swirl is a single loop of the multiple GreenWaves formed by GreenSwirl
Vehicles can run at the legal speed limit on a swirl without
stopping unless there is traffic congestion
12
Priority Direction
PriorityDirection
Priority Direction
PriorityDirection
Swirls
No Stopping
City
Center
Smoothly running
even in crossing road
Control the entering
traffic
Control the entering
traffic
Optimize each
vehicle
13. Guiding each vehicle to the shortest time path
Estimate the travel time of each road segment
Guide some vehicles to the swirls for dispersing traffic
13
PriorityDirection
Priority Direction
PriorityDirection
PriorityDirection
PriorityDirection
Priority Direction
PriorityDirection
PriorityDirection
90s
130s
Resolve the problem in opposite lane
160s
14. 1. Set the initial travel time for all road segments
2. Guide each vehicle to the shortest time path
3. Collect travel time from all road segments and output result
4. Increase travel time by 1% for the top 1% congested road
5. Until the result ( average travel time of all vehicles) becomes
stable, output the best recommend route to vehicles
Traffic volume
balance
Congestion
14
15. Traffic data
Speed of vehicles on road segments
Two ways to collect traffic data
1. Deploy speed-detecting sensors in all road segments
2. Deploy sensors in some road segments and part of vehicles report
their speed and position to the server via communication
15
Static Data
GreenSwirl
Swirls
Road Network
GreenDrive Server
TrafficData
Route
16. 16
Current Swirls are formed manually
CenterCenter Park
Main Area
2
Determine main roads
High traffic capacity
Multi-Lane
Detect the area crowded with
vehicles
Main area
City center
Form the swirls
To disperse Vehicles
3
1
17. Background and Related Study
Proposed Method
Evaluation and Results
Conclusion and Future Work
17
18. Experiment Purposes
Evaluate the performance of GreenSwirl and GreenDrive
Evaluate the proposed method in scenarios where a part of
road segments has sensor installed for obtaining traffic data
Simulator
SUMO (Simulation of Urban Mobility)
18
19. Manhattan in New York
Map data is taken from OpenStreetMap
Many one-way streets
4km×20km
Number of streets : 870
Number of vehicles: 5000/10000/15000/20000
19
20. Synchronized Method
Default signal control method implemented in SUMO
20
GreenWave
GreenWave is used for main streets with a high traffic capacity
The default synchronized method is used for other streets
Same time
21. Shortest-Path Method
Vehicles are guided along paths of the shortest distance
DUA (dynamic user assignment) Method[1]
It works by running simulations to discover travel times
and assigning alternative routes to vehicles
Vehicles are guided along routes selected according to
calculated probabilities, to distribute all the traffic
Problems
▪ This method does not optimize the travel time for each user
▪ Some users are guided along detour paths
21
[1] Krajzewicz, Daniel, Michael Behrisch, and Yun-Pang Wang. "Comparing performance and
quality of traffic assignment techniques for microscopic road traffic simulations." DTA2008
International Symposium on Dynamic Traffic Assignment. No. EPFL-CONF-154987. 2008.
22. 800
1300
1800
2300
2800
5000 10000 15000 20000
AverageTravelTime(s)
Number of vehicles
Synchronized
GreenWave
GreenSwirl
Reduce average
travel time by 21%
compared with
GreenWave
Reduce average travel time by 10% compared with GreenWave
GreenDrive
22
23. GreenDrive 100% penetration is the best
800
1300
1800
2300
2800
3300
3800
4300
5000 10000 15000 20000
AverageTravelTime(s)
Number of vehicles
Shortest Path 100%
DUA 100%
GreenDrive 25%
GreenDrive 50%
GreenDrive 75%
GreenDrive 100%
Reduce 55%
compared to
Shortest-path
Reduce 23%
compared to
DUA
GreenSwirl
23
24. 800
1300
1800
2300
2800
3300
3800
4300
5000 10000 15000 20000
AverageTravelTime(s)
Number of vehicles
DUA 100%
GreenDrive 50%
GreenDrive 100%
GreenSwirl
24
GreenDrive 100% penetration is the best
DUA 100% penetration ≈ GreenDrive 50% penetration
25. Sensor 30%
Traffic data can be obtained from 30% of the streets
Sensor 30% + Feedback 1%
Traffic information can be obtained from 30% of the
streets and 1% of the all vehicles report their travel
information
Sensor 70%
Traffic data can be obtained from 70% of the streets
Sensor 100%
Traffic data can be obtained from all the streets
25
26. 0
500
1000
1500
2000
2500
5000 10000 15000 20000
AverageTravelTime(s)
Number of vehicles
GreenDrive_Sensor30%
GreenDrive_Sensor30%+Feedback1%
GreenDrive_Sensor70%
GreenDrive_Sensor100%
26
Less travel time as the ratio of sensors increases
Sensor 30% + Feedback 1% ≈ Sensor 70%
27. Proposed Method
GreenSwirl: traffic signal control method
GreenDrive: route guidance method
Reduce the average travel time by 10%-60% compared with the existing
methods
Future works
Evaluate the proposed method for maps of other cities
Automatic generation algorithm for GreenSwirl according to traffic data
27
center
center
center
Beijing Boston
Vehicles:50,000
Vehicles:80,000
28. Jiaxing Xu, Weihua Sun, Naoki Shibata and
Minoru Ito : "GreenSwirl: Combining Traffic
Signal Control and Route Guidance for
Reducing Traffic Congestion," in Proc. of
IEEE Vehicular Networking Conference 2014
(IEEE VNC 2014)(23% acceptance rate), pp.
179-186, 2014-12-15.
DOI:10.1109/VNC.2014.7013337 [ PDF ]
28
Editor's Notes
I am Xu Jiaxing , coming from Nara Institute of Science and Technology.
Today I’d like to present our work about GreenSwirl: Combing traffic signal control and route guidance for reducing traffic congestion
As we all know
Serious traffic congestion and associated air pollution caused by vehicle emissions are major social problems in many countries
The lack of carefully planned traffic signals ,especially, is one main cause for traffic congestion.
And it was found that 25% of PM2.5 pollution in Beijing comes from vehicle exhaust gas.
At present, There have been many ways for reducing traffic congestion such as Traffic Signal Control and Dynamic Route Guidance.
Especially, GreenWave is a traffic signal control method which was used in many countries.
GreenWave is a method for coordinating a series of traffic lights to enable continuous traffic flow over several intersections in one main direction
Principle is to control the time period for lights to be green by predicting the arrival time of vehicles.
GreenWave was tested in several cities in China, but the results were not satisfactory.
Next I will introduce the problems of GreenWave
The first problem is that GreenWave interferes with the crossing traffic .
In this illustration, GreenWave is created at the one direction road, so the cars can smoothly travel on the GreenWave roads. However GreenWave cannot be created at crossing road, crossing traffic is will be interfered when run on crossing road.
As the same with just problem , GreenWave also interferes with the opposite lane.
The cars on the GreenWave lane can always encounter the Green Light.
However The cars on the oppsite lane always encounter the red light.
This problem is confirmed by 10 traffic lights in Nanjing city of China.
The tested street is 4km and on one direction was formed the GreenWave.
The result is that vehicles can take 4 minutes to pass the street on GreenWave Direction, on the Opposite Direction will take 9 minutes. So we can see that the vehicle will travel twice time on the Opposite Direction.
http://jiangsu.china.com.cn/html/jsnews/around/289798_1.html
The last problem , Traffic congestion may be caused at both entry and exit to main roads.
First it is a matter of the Entry Congestion
When the GreenWave to generate only on the main road, so many vehicles come together to the main road.
And the roads connecting the main road always can not receive so much vehicles as the main road
When theses vehicles is about to enter the main road. The congestion occurs at the entry.
As the same reason, there is also a problem of exit congestion.
When a lot of vehicles get off the main road to normal street , at exit will cause the congestion, in addition this congestion will also spread to the main road.
Just we know problem by these examples , next I will summary the drawbacks of GreenWave and how to resolve the problem
Briefly, there are two drawbacks, the first is that GreenWave is only priority in a single direction, in order to solve it ,we can control traffic signals on many direction roads like GreenWave . The second is the traffic flow. In the normal roads connecting to the main roads has low capacity of receiving traffic . So it is easy to cause the congestion and Even the main roads formed GreenWave will also be congestion when entered excessive vehicles. What’s worse, it can cause the serious congestion Gridlock. in order to avoid the congestion by traffic flow, we can control the traffic and guide the vehicles to the optimal route. According to the two solutions, our proposed method is born at this right moment
We propose the Traffic signal control method GreenSwirl, combination with the Route Guidance method GreenDrive. The goals are to reduce traffic congestion and minimize the travel time of vehicles. I will introduce what is GreenSwirl
the traffic signal control method GreenSwirl is that GreenWave is formed on many roads like huge swirls throughout one city. a swirl is a single loop of the multiple GreenWavs fromed by GreenSwirl. On a swirl , vehicles can run with out stopping unless there is traffic congestion. And the cars can also smoothly run even in crossing road. We use another method to control the entering traffic and optimize each vehicle.
That is the rout guidance method GreenDrive.
It can guide each vehicle to the shortest time path by estimation of the travel time passing through each road segment. So that it can guide some vehicles to the swirls for dispersing traffic.
We provide two illustrations to help you to understand the image of GreenDrive.
On the left, the car want to arrive to the top-right destination, GreenDrive will guide it to route by the outside swirl.
On the right, the car want to arrive the destination on the opposite lane. This car can be provided some route by Swirls.
The travel time of these routes is estimated and GreenDrive guides the car to the shortest time path so that it can resolve the problem in opposite lane.
This is a simple image of GreenDrive, how operate the GreenDrive to control traffic and guide the shortest time path for each vehicles. Next I will introduce the details of GreenDrive
illustration
The details of GreenDrive
The first step , we set the initial travel time for all road segments, and the second step, guide each vehicle to the shortest time path by simulation. And at the third step, when the vehicles running on the roads, the travel time of all road segments will be collected. at the fourth step, We can detect the congestion roads and in order to balance the traffic ,we increase the travel time by 1% for the top 1% congested road. And repeat the number of iterations until the average travel time of vehicles becomes stable, output the best recommend route to vehicles.
We already know the image of two methods, next I will introduce how to combine them in real traffic network.
First we should have a database to save the previous traffic data also called static data and collect it regularly from road network. Second, according the static data we will form the swirls by GreenSwirl and implement it on the road network. After that, the GreenDrive Server dose the simulation by the real-time traffic data and guide the optimal route for vehicles. These vehicles will run on the road network and generate the traffic data to the static data. The traffic data is the speed of vehicles on road segments, there are two ways to collect traffic data. One is to deploy speed-detecting sensors in all road segments, another one will deploy sensors in some road segments and part of vehicles report their speed the position to the server via communication. In our proposed method is assumed to use firest way. The second way will be evaluated that if it can effect the performance of proposed method.