Congestion Alleviation Scheduling Technique for Car Drivers Based on Prediction of Future Congestion on Roads and Spots

ITSC2007 : IEEE Intelligent Transportation Systems Conference , Sep 30-Oct 3, 2007 , Bellevue, WA, USAIn 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

General Architecture for Hardware Implementation of Genetic Algorithm

FCCM 2006 : 14th Annual IEEE Symposium on Field-Programmable Custom Computing Machines , Apr 24-26, 2006 , Napa, CA, USAIn this paper, the authors propose a technique to flexibly implement genetic algorithms (GAs) for various problems on FPGAs. For the purpose, the authors propose a common architecture for GA. The proposed architecture allows designers to easily implement a GA as a hardware circuit consisting of parallel pipelines which execute GA operations. The proposed architecture is scalable to increase the number of parallel pipelines. The architecture is applicable to various problems and allows designers to estimate the size of resulting circuits. The authors give a model for predicting the size of resulting circuits from given parameters. Based on the proposed method, the authors have implemented a tool to facilitate GA circuit design and development. Through experiments using knapsack problem and traveling salesman problem (TSP), the authors show that the FPGA circuits synthesized based on the proposed method run much faster and consume much lower power than software implementation on a PC and the model can predict the size of the resulting circuit accurately enough

A Hardware Implementation Method of Multi-Objective Genetic Algorithms

CEC2006 : IEEE International Conference on Evolutionary Computation , Jul 16-21, 2006 , Vancouver, BC, CanadaMulti-objective genetic algorithms (MOGAs) are approximation techniques to solve multi-objective optimization problems. Since MOGAs search a wide variety of pareto optimal solutions at the same time, MOGAs require large computation power. In order to solve practical sizes of the multi objective optimization problems, it is desirable to design and develop a hardware implementation method for MOGAs with high search efficiency and calculation speed. In this paper, we propose a new method to easily implement MOGAs as high performance hardware circuits. In the proposed method, we adopt simple Minimal Generation Gap (MGG) model as the generation model, because it is easy to be pipelined. In order to preserve diversity of individuals, we need a special selection mechanism such as the niching method which takes large computation time to repeatedly compare superiority among all individuals in the population. In the proposed method, we developed a new selection mechanism which greatly reduces the number of comparisons among individuals, keeping diversity of individuals. Our method also includes a parallel execution architecture based on Island GA which is scalable to the number of concurrent pipelines and effective to keep diversity of individuals. We applied our method to multi-objective Knapsack Problem. As a result, we confirmed that our method has higher search efficiency than existing method

A personal tourism navigation system to support traveling multiple destinations with time restrictions

AINA2004 : The 18th International Conference on Advanced Information Networking and Applications , Mar 29 -31, 2004 , Fukuoka, JapanWe propose a personal navigation system (called PNS) which navigates a tourist through multiple destinations efficiently. In our PNS, a tourist can specify multiple destinations with desired arrival/stay time and preference degree. The system calculates the route including part of the destinations satisfying tourist's requirements and navigates him/her. For the above route search problem, we have developed an efficient route search algorithm using a genetic algorithm. We have designed and implemented the PNS as a client-server system so that the portable device users can use the PNS through the Internet. Experiments using general map data and PDAs show that our PNS can calculate a semioptimal route almost in real-time

Video ads dissemination through WiFi-cellular hybrid networks

PerCom2009 : The Seventh Annual IEEE International Conference on Pervasive Computing and Communications , Mar 16-20, 2009 , Dallas, TX, USAIn this paper, we propose a method for video ads dissemination through a hybrid network consisting of WiFi and cellular networks, in order to provide timely delivery of video ads with preferred content to users according to the users' contexts. In recent years, video download/streaming services for cellular phones have already become popular. Among various video delivery services, a service for disseminating video ads according to the users' contexts is expected to achieve high advertising effects. However, context-aware video ads dissemination will consume large bandwidth since the size of video ad is rather large and the same ad is required at different time from various users. We propose a new video ads dissemination method for mobile terminals which utilizes both WiFi and cellular networks. In the proposed method, a file of video ad is divided into pieces and each node exchanges the pieces with neighbor nodes using WiFi ad hoc communication so that the usage of cellular network is reduced. In order to make the method works effectively for a large number of nodes, we propose an algorithm where mobile nodes autonomously and probabilistically decide their actions without a central control. Through simulations, we confirmed that our method reduces cellular network usage by about 93% compared with a case that all nodes download video ads via cellular network, and works effectively in cases with a large number of nodes and high mobility

A Method to Plan Group Tours with Joining and Forking

SEAL2006 : Asia-Pacific Conference on Simulated Evolution and Learning , Oct 15-18, 2006 , Hefei, ChinaGroup sightseeing has some advantages in terms of required budget and so on. Some travel agents provide package tours of group sightseeing, but participants have to follow a predetermined schedule in tour, and thus there may be no plan which perfectly satisfies the tourist's expectation. In this paper, we formalize a problem to find group sightseeing schedules for each user from given users’ preferences and time restrictions corresponding to each destination. We also propose a Genetic Algorithm-based algorithm to solve the problem. We implemented and evaluated the method, and confirmed that our algorithm finds efficient routes for group sightseeing

Flexible implementation of genetic algorithms on FPGAs

FPGA '06 : ACM/SIGDA 14th international symposium on Field programmable gate arrays , Feb 22-24, 2006 , Monterey, CA, USAGenetic algorithms (GAs) are useful since they can find near optimal solutions for combinatorial optimization problems quickly. Although there are many mobile/home applications of GAs such as navigation systems, QoS routing and video encoding systems, it was difficult to apply GAs to those applications due to low computational power of mobile/home appliances. In this paper, we propose a technique to flexibly implement genetic algorithms for various problems on FPGAs. For the purpose, we propose a basic architecture which consists of several modules for GA operations to compose a GA pipeline, and a parallel architecture consisting of multiple concurrent pipelines. The proposed architectures are simple enough to be implemented on FPGAs, applicable to various problems, and easy to estimate the size of the resulting circuit. We also propose a model for predicting the size of resulting circuit from given parameters consisting of the problem size, the number of concurrent pipelines and the number of candidate solutions for GA. Based on the proposed method, we have implemented a tool to facilitate GA circuit design and development. This tool allows designers to find appropriate parameter values so that the resulting circuit can be accommodated in the target FPGA device, and to automatically obtain RTL VHDL description. Through experiments using Knapsack Problem and TSP, we show that the FPGA circuits synthesized based on the proposed method run much faster and consume much lower power than software implementation on a PC and that our model can predict the size of the resulting circuit accurately enough

Axillary artery injury combined with delayed brachial plexus palsy due to compressive hematoma in a young patient: a case report

<p>Abstract</p> <p>Introduction</p> <p>Axillary artery injury in the shoulder region following blunt trauma without association with either shoulder dislocation or fracture of the humeral neck has been previously reported. Axillary artery injury might also be accompanied with brachial plexus injury. However, delayed onset of brachial plexus palsy caused by a compressive hematoma associated with axillary injury after blunt trauma in the shoulder region has been rarely reported. In previous reports, this condition only occurred in old patients with sclerotic vessels. We present a case of a young patient who suffered axillary artery injury associated with brachial plexus palsy that occurred tardily due to compressive hematoma after blunt trauma in the shoulder region without association of either shoulder dislocation or humeral neck fracture.</p> <p>Case presentation</p> <p>A 16-year-old male injured his right shoulder in a motorbike accident. On initial physical evaluation, the pulses on the radial and ulnar arteries in the affected arm were palpable. Paralysis developed later from 2 days after the injury. Functions in the right arm became significantly impaired. Angiography showed complete occlusion of the axillary artery. Magnetic resonance imaging demonstrated a mass measuring 4 × 5 cm that was suspected to be a hematoma compressing the brachial plexus in a space between the subscapular muscle and the pectoralis minor muscle. Surgery was performed on the third day after injury. In intraoperative observations, the axillary artery was occluded with thrombus along 5 cm; a subscapular artery was ruptured; the brachial plexus was compressed by the hematoma. After evacuation of the hematoma, neurolysis of the brachial plexus, and revascularization of the axillary artery, the patient had an excellent functional recovery of the affected upper limb, postoperatively.</p> <p>Conclusion</p> <p>Surgeons should be aware that axillary artery injuries may even occur in young people after severe blunt trauma in the shoulder region and can be associated with secondary brachial plexus injury due to a hematoma. For treatment in cases with progressive nervous deficit after trauma, not only reconstruction of the injured artery but also immediate evacuation of the hematoma, and exploration of the brachial plexus are necessary to avoid irreversible neurological damage.</p

Extending k-Coverage Lifetime of Wireless Sensor Networks Using Mobile Sensor Nodes

WiMob2009 : IEEE International Conference on Wireless and Mobile Computing, Networking and Communications , Oct 12-14, 2009 , Marrakech, MoroccoOne of the important issues in wireless sensor network (WSN) is to k-cover the target sensing field and to extend its lifetime. We propose a method to k-cover the field and maximize the WSN lifetime by moving mobile sensor nodes to appropriate positions for a WSN consisting of both static and mobile sensor nodes which periodically collect environmental information. Our target problem is NP-hard. So, we propose a genetic algorithm (GA) based scheme to find a near optimal solution in practical time. In order to speed up the calculation, we devised a method to check a sufficient condition of k-coverage of the field. For the problem that nodes near the sink node have to forward the data from farther nodes, we make a tree where the amount of communication traffic is balanced among all nodes, and add this tree to the initial candidate solutions of our GAbased algorithm. Through computer simulations, we confirmed that our method achieves much longer k-coverage lifetime than conventional methods for 100 to 300 node WSNs