A study of urban traffic based on the temporal maps:the case of Guangzhou City

Temporal map is an isochronal map taking time as a measuring unit. It traces out the isochrones according to the discrepancy of the time distance between the different sites from the outside of the city and the down town, It can be clear and intuitional to show the different temporal relationships between the outside of the city and the city centre with the temporal map, The problem of traffic congestion, with its potential /br urban chaos, has increased dramatically with a growing number of vehicles and the continuing aerial expansion of Guangzhou. Both transit riders and drivers find it is a great difficulty to try to acquire the necessary information from urban spatial movements. Valuable time is lost due to the absence of good transportation information. So, the paper analyzes a case in Guangzhou communication with Geographic Information System （GIS）, and uses the most popular vehicles, including buses and taxis that are used to measure the temporal distance in the city. and then proposes the design of a new map that better reflects the status of urban communication, and attempts to change the relationship between one point and another potnt of travel, reducing the amount of time allocated to such. often complex, movements, This paper also points out the obstacles associated with Guangzhou＇s existing traffic congestion, and puts forward a strategy aimed at better d .efining the need of linking the temporal map to spatial map of Guangzhou.

Efficient Scheduling Mapping Algorithm for Row Parallel Coarse-Grained Reconfigurable Architecture

Row Parallel Coarse-Grained Reconfigurable Architecture(RPCGRA)has the advantages of maximum parallelism and programmable flexibility.Designing an efficient algorithm to map the diverse applications onto RPCGRA is difficult due to a number of RPCGRA hardware constraints.To solve this problem,the nodes of the data flow graph must be partitioned and scheduled onto the RPCGRA.In this paper,we present a Depth-First Greedy Mapping(DFGM)algorithm that simultaneously considers the communication costs and the use times of the Reconfigurable Cell Array(RCA).Compared with level breadth mapping,the performance of DFGM is better.The percentage of maximum improvement in the use times of RCA is 33%and the percentage of maximum improvement in non-original input and output times is 64.4%(Given Discrete Cosine Transfor 8(DCT8),and the area of reconfigurable processing unit is 56).Compared with level-based depth mapping,DFGM also obtains the lowest averages of use times of RCA,non-original input and output times,and the reconfigurable time.