A Cyber-ITS Framework for Massive Traffic Data Analysis Using Cyber Infrastructure
Identifieur interne : 000650 ( Pmc/Corpus ); précédent : 000649; suivant : 000651A Cyber-ITS Framework for Massive Traffic Data Analysis Using Cyber Infrastructure
Auteurs : Yingjie Xia ; Jia Hu ; Michael D. FontaineSource :
- The Scientific World Journal [ 1537-744X ] ; 2013.
Abstract
Traffic data is commonly collected from widely deployed sensors in urban areas. This brings up a new research topic, data-driven intelligent transportation systems (ITSs), which means to integrate heterogeneous traffic data from different kinds of sensors and apply it for ITS applications. This research, taking into consideration the significant increase in the amount of traffic data and the complexity of data analysis, focuses mainly on the challenge of solving data-intensive and computation-intensive problems. As a solution to the problems, this paper proposes a Cyber-ITS framework to perform data analysis on Cyber Infrastructure (CI), by nature parallel-computing hardware and software systems, in the context of ITS. The techniques of the framework include data representation, domain decomposition, resource allocation, and parallel processing. All these techniques are based on data-driven and application-oriented models and are organized as a component-and-workflow-based model in order to achieve technical interoperability and data reusability. A case study of the Cyber-ITS framework is presented later based on a traffic state estimation application that uses the fusion of massive Sydney Coordinated Adaptive Traffic System (SCATS) data and GPS data. The results prove that the Cyber-ITS-based implementation can achieve a high accuracy rate of traffic state estimation and provide a significant computational speedup for the data fusion by parallel computing.
Url:
DOI: 10.1155/2013/462846
PubMed: 23766690
PubMed Central: 3671550
Links to Exploration step
PMC:3671550Le document en format XML
<record><TEI><teiHeader><fileDesc><titleStmt><title xml:lang="en">A Cyber-ITS Framework for Massive Traffic Data Analysis Using Cyber Infrastructure</title><author><name sortKey="Xia, Yingjie" sort="Xia, Yingjie" uniqKey="Xia Y" first="Yingjie" last="Xia">Yingjie Xia</name><affiliation><nlm:aff id="I1">Hangzhou Institute of Service Engineering, Hangzhou Normal University, 222 Wenyi Road, Hangzhou 310012, China</nlm:aff></affiliation><affiliation><nlm:aff id="I2">Department of Civil and Environmental Engineering, University of Virginia, 351 McCormick Road, Charlottesville, VA 22903, USA</nlm:aff></affiliation></author><author><name sortKey="Hu, Jia" sort="Hu, Jia" uniqKey="Hu J" first="Jia" last="Hu">Jia Hu</name><affiliation><nlm:aff id="I2">Department of Civil and Environmental Engineering, University of Virginia, 351 McCormick Road, Charlottesville, VA 22903, USA</nlm:aff></affiliation></author><author><name sortKey="Fontaine, Michael D" sort="Fontaine, Michael D" uniqKey="Fontaine M" first="Michael D." last="Fontaine">Michael D. Fontaine</name><affiliation><nlm:aff id="I2">Department of Civil and Environmental Engineering, University of Virginia, 351 McCormick Road, Charlottesville, VA 22903, USA</nlm:aff></affiliation></author></titleStmt><publicationStmt><idno type="wicri:source">PMC</idno><idno type="pmid">23766690</idno><idno type="pmc">3671550</idno><idno type="url">http://www.ncbi.nlm.nih.gov/pmc/articles/PMC3671550</idno><idno type="RBID">PMC:3671550</idno><idno type="doi">10.1155/2013/462846</idno><date when="2013">2013</date><idno type="wicri:Area/Pmc/Corpus">000650</idno></publicationStmt><sourceDesc><biblStruct><analytic><title xml:lang="en" level="a" type="main">A Cyber-ITS Framework for Massive Traffic Data Analysis Using Cyber Infrastructure</title><author><name sortKey="Xia, Yingjie" sort="Xia, Yingjie" uniqKey="Xia Y" first="Yingjie" last="Xia">Yingjie Xia</name><affiliation><nlm:aff id="I1">Hangzhou Institute of Service Engineering, Hangzhou Normal University, 222 Wenyi Road, Hangzhou 310012, China</nlm:aff></affiliation><affiliation><nlm:aff id="I2">Department of Civil and Environmental Engineering, University of Virginia, 351 McCormick Road, Charlottesville, VA 22903, USA</nlm:aff></affiliation></author><author><name sortKey="Hu, Jia" sort="Hu, Jia" uniqKey="Hu J" first="Jia" last="Hu">Jia Hu</name><affiliation><nlm:aff id="I2">Department of Civil and Environmental Engineering, University of Virginia, 351 McCormick Road, Charlottesville, VA 22903, USA</nlm:aff></affiliation></author><author><name sortKey="Fontaine, Michael D" sort="Fontaine, Michael D" uniqKey="Fontaine M" first="Michael D." last="Fontaine">Michael D. Fontaine</name><affiliation><nlm:aff id="I2">Department of Civil and Environmental Engineering, University of Virginia, 351 McCormick Road, Charlottesville, VA 22903, USA</nlm:aff></affiliation></author></analytic><series><title level="j">The Scientific World Journal</title><idno type="eISSN">1537-744X</idno><imprint><date when="2013">2013</date></imprint></series></biblStruct></sourceDesc></fileDesc><profileDesc><textClass></textClass></profileDesc></teiHeader><front><div type="abstract" xml:lang="en"><p>Traffic data is commonly collected from widely deployed sensors in urban areas. This brings up a new research topic, data-driven intelligent transportation systems (ITSs), which means to integrate heterogeneous traffic data from different kinds of sensors and apply it for ITS applications. This research, taking into consideration the significant increase in the amount of traffic data and the complexity of data analysis, focuses mainly on the challenge of solving data-intensive and computation-intensive problems. As a solution to the problems, this paper proposes a Cyber-ITS framework to perform data analysis on Cyber Infrastructure (CI), by nature parallel-computing hardware and software systems, in the context of ITS. The techniques of the framework include data representation, domain decomposition, resource allocation, and parallel processing. All these techniques are based on data-driven and application-oriented models and are organized as a component-and-workflow-based model in order to achieve technical interoperability and data reusability. A case study of the Cyber-ITS framework is presented later based on a traffic state estimation application that uses the fusion of massive Sydney Coordinated Adaptive Traffic System (SCATS) data and GPS data. The results prove that the Cyber-ITS-based implementation can achieve a high accuracy rate of traffic state estimation and provide a significant computational speedup for the data fusion by parallel computing.</p></div></front><back><div1 type="bibliography"><listBibl><biblStruct><analytic><author><name sortKey="Zhang, J" uniqKey="Zhang J">J Zhang</name></author><author><name sortKey="Wang, Fy" uniqKey="Wang F">FY Wang</name></author><author><name sortKey="Wang, K" uniqKey="Wang K">K Wang</name></author><author><name sortKey="Lin, W" uniqKey="Lin W">W Lin</name></author><author><name sortKey="Xu, X" uniqKey="Xu X">X Xu</name></author><author><name sortKey="Chen, C" uniqKey="Chen C">C Chen</name></author></analytic></biblStruct><biblStruct><analytic><author><name sortKey="Xia, Y" uniqKey="Xia Y">Y Xia</name></author><author><name sortKey="Wu, C" uniqKey="Wu C">C Wu</name></author><author><name sortKey="Kong, Q" uniqKey="Kong Q">Q Kong</name></author><author><name sortKey="Shan, Z" uniqKey="Shan Z">Z Shan</name></author><author><name sortKey="Kuang, L" uniqKey="Kuang L">L Kuang</name></author></analytic></biblStruct><biblStruct><analytic><author><name sortKey="Xia, Y" uniqKey="Xia Y">Y Xia</name></author><author><name sortKey="Shan, Z" uniqKey="Shan Z">Z Shan</name></author><author><name sortKey="Kuang, L" uniqKey="Kuang L">L Kuang</name></author><author><name sortKey="Shi, X" uniqKey="Shi X">X Shi</name></author></analytic></biblStruct><biblStruct><analytic><author><name sortKey="Gross, F" uniqKey="Gross F">F Gross</name></author><author><name sortKey="Eccles, K" uniqKey="Eccles K">K Eccles</name></author><author><name sortKey="Nabors, D" uniqKey="Nabors D">D Nabors</name></author></analytic></biblStruct><biblStruct><analytic><author><name sortKey="Hasan, S" uniqKey="Hasan S">S Hasan</name></author><author><name sortKey="Choudhury, Cf" uniqKey="Choudhury C">CF Choudhury</name></author><author><name sortKey="Ben Akiva, Me" uniqKey="Ben Akiva M">ME Ben-Akiva</name></author><author><name sortKey="Emmonds, A" uniqKey="Emmonds A">A Emmonds</name></author></analytic></biblStruct><biblStruct><analytic><author><name sortKey="Chang, Th" uniqKey="Chang T">TH Chang</name></author><author><name sortKey="Hsu, Cs" uniqKey="Hsu C">CS Hsu</name></author><author><name sortKey="Wang, C" uniqKey="Wang C">C Wang</name></author><author><name sortKey="Yang, Lk" uniqKey="Yang L">LK Yang</name></author></analytic></biblStruct><biblStruct><analytic><author><name sortKey="Kesting, A" uniqKey="Kesting A">A Kesting</name></author><author><name sortKey="Treiber, M" uniqKey="Treiber M">M Treiber</name></author></analytic></biblStruct><biblStruct><analytic><author><name sortKey="El Faouzi, Ne" uniqKey="El Faouzi N">NE El Faouzi</name></author><author><name sortKey="Lefevre, E" uniqKey="Lefevre E">E Lefevre</name></author></analytic></biblStruct><biblStruct><analytic><author><name sortKey="Kong, Qj" uniqKey="Kong Q">QJ Kong</name></author><author><name sortKey="Li, Z" uniqKey="Li Z">Z Li</name></author><author><name sortKey="Chen, Y" uniqKey="Chen Y">Y Chen</name></author><author><name sortKey="Liu, Y" uniqKey="Liu Y">Y Liu</name></author></analytic></biblStruct><biblStruct><analytic><author><name sortKey="Qiu, Tz" uniqKey="Qiu T">TZ Qiu</name></author><author><name sortKey="Lu, Xy" uniqKey="Lu X">XY Lu</name></author><author><name sortKey="Chow, Ahf" uniqKey="Chow A">AHF Chow</name></author><author><name sortKey="Shladover, Se" uniqKey="Shladover S">SE Shladover</name></author></analytic></biblStruct><biblStruct><analytic><author><name sortKey="Kim, K" uniqKey="Kim K">K Kim</name></author><author><name sortKey="Pant, P" uniqKey="Pant P">P Pant</name></author><author><name sortKey="Yamashita, Ey" uniqKey="Yamashita E">EY Yamashita</name></author></analytic></biblStruct><biblStruct><analytic><author><name sortKey="Van Lint, Jwc" uniqKey="Van Lint J">JWC Van Lint</name></author></analytic></biblStruct><biblStruct><analytic><author><name sortKey="Niittymaki, J" uniqKey="Niittymaki J">J Niittymaki</name></author><author><name sortKey="Kikuchi, S" uniqKey="Kikuchi S">S Kikuchi</name></author></analytic></biblStruct><biblStruct><analytic><author><name sortKey="Xia, Y" uniqKey="Xia Y">Y Xia</name></author><author><name sortKey="Ye, Z" uniqKey="Ye Z">Z Ye</name></author><author><name sortKey="Fang, Y" uniqKey="Fang Y">Y Fang</name></author><author><name sortKey="Zhang, T" uniqKey="Zhang T">T Zhang</name></author></analytic></biblStruct><biblStruct><analytic><author><name sortKey="Wang, S" uniqKey="Wang S">S Wang</name></author><author><name sortKey="Armstrong, Mp" uniqKey="Armstrong M">MP Armstrong</name></author></analytic></biblStruct><biblStruct><analytic><author><name sortKey="Xia, Y" uniqKey="Xia Y">Y Xia</name></author><author><name sortKey="Kuang, L" uniqKey="Kuang L">L Kuang</name></author><author><name sortKey="Li, X" uniqKey="Li X">X Li</name></author></analytic></biblStruct><biblStruct><analytic><author><name sortKey="Aiken, R" uniqKey="Aiken R">R Aiken</name></author><author><name sortKey="Carey, M" uniqKey="Carey M">M Carey</name></author><author><name sortKey="Carpenter, B" uniqKey="Carpenter B">B Carpenter</name></author></analytic></biblStruct><biblStruct><analytic><author><name sortKey="O Earbhaill, Ea" uniqKey="O Earbhaill E">EA O’Cearbhaill</name></author><author><name sortKey="O Ahony, M" uniqKey="O Ahony M">M O’Mahony</name></author></analytic></biblStruct><biblStruct><analytic><author><name sortKey="Krishnan, R" uniqKey="Krishnan R">R Krishnan</name></author><author><name sortKey="Hodge, V" uniqKey="Hodge V">V Hodge</name></author><author><name sortKey="Austin, J" uniqKey="Austin J">J Austin</name></author><author><name sortKey="Polak, Jw" uniqKey="Polak J">JW Polak</name></author></analytic></biblStruct><biblStruct><analytic><author><name sortKey="Wang, F Y" uniqKey="Wang F">F-Y Wang</name></author></analytic></biblStruct><biblStruct><analytic><author><name sortKey="Xia, Y" uniqKey="Xia Y">Y Xia</name></author><author><name sortKey="Fang, Y" uniqKey="Fang Y">Y Fang</name></author><author><name sortKey="Ye, Z" uniqKey="Ye Z">Z Ye</name></author></analytic></biblStruct><biblStruct><analytic><author><name sortKey="Goldreich, O" uniqKey="Goldreich O">O Goldreich</name></author></analytic></biblStruct><biblStruct><analytic><author><name sortKey="Wang, S" uniqKey="Wang S">S Wang</name></author><author><name sortKey="Armstrong, Mp" uniqKey="Armstrong M">MP Armstrong</name></author></analytic></biblStruct><biblStruct><analytic><author><name sortKey="Jackins, Cl" uniqKey="Jackins C">CL Jackins</name></author><author><name sortKey="Tanimoto, Sl" uniqKey="Tanimoto S">SL Tanimoto</name></author></analytic></biblStruct><biblStruct><analytic><author><name sortKey="Braun, Td" uniqKey="Braun T">TD Braun</name></author><author><name sortKey="Siegel, Hj" uniqKey="Siegel H">HJ Siegel</name></author><author><name sortKey="Beck, N" uniqKey="Beck N">N Beck</name></author></analytic></biblStruct><biblStruct><analytic><author><name sortKey="Tchrakian, T" uniqKey="Tchrakian T">T Tchrakian</name></author><author><name sortKey="Basu, B" uniqKey="Basu B">B Basu</name></author><author><name sortKey="O Mahony, M" uniqKey="O Mahony M">M O'Mahony</name></author></analytic></biblStruct><biblStruct><analytic><author><name sortKey="Fox, Gc" uniqKey="Fox G">GC Fox</name></author><author><name sortKey="Gannon, D" uniqKey="Gannon D">D Gannon</name></author></analytic></biblStruct><biblStruct><analytic><author><name sortKey="Giacobbe, M" uniqKey="Giacobbe M">M Giacobbe</name></author><author><name sortKey="Puliafito, A" uniqKey="Puliafito A">A Puliafito</name></author><author><name sortKey="Villari, M" uniqKey="Villari M">M Villari</name></author></analytic></biblStruct><biblStruct><analytic><author><name sortKey="Shafer, G" uniqKey="Shafer G">G Shafer</name></author></analytic></biblStruct><biblStruct><analytic><author><name sortKey="Smets, P" uniqKey="Smets P">P Smets</name></author><author><name sortKey="Kennes, R" uniqKey="Kennes R">R Kennes</name></author></analytic></biblStruct><biblStruct><analytic><author><name sortKey="Xia, Y" uniqKey="Xia Y">Y Xia</name></author><author><name sortKey="Liu, Y" uniqKey="Liu Y">Y Liu</name></author><author><name sortKey="Ye, Z" uniqKey="Ye Z">Z Ye</name></author><author><name sortKey="Wu, W" uniqKey="Wu W">W Wu</name></author><author><name sortKey="Zhu, M" uniqKey="Zhu M">M Zhu</name></author></analytic></biblStruct></listBibl></div1></back></TEI><pmc article-type="research-article"><pmc-dir>properties open_access</pmc-dir>
<front><journal-meta><journal-id journal-id-type="nlm-ta">ScientificWorldJournal</journal-id><journal-id journal-id-type="iso-abbrev">ScientificWorldJournal</journal-id><journal-id journal-id-type="publisher-id">TSWJ</journal-id><journal-title-group><journal-title>The Scientific World Journal</journal-title></journal-title-group><issn pub-type="epub">1537-744X</issn><publisher><publisher-name>Hindawi Publishing Corporation</publisher-name></publisher></journal-meta><article-meta><article-id pub-id-type="pmid">23766690</article-id><article-id pub-id-type="pmc">3671550</article-id><article-id pub-id-type="doi">10.1155/2013/462846</article-id><article-categories><subj-group subj-group-type="heading"><subject>Research Article</subject></subj-group></article-categories><title-group><article-title>A Cyber-ITS Framework for Massive Traffic Data Analysis Using Cyber Infrastructure</article-title></title-group><contrib-group><contrib contrib-type="author"><contrib-id contrib-id-type="orcid">0000-0002-4642-2503</contrib-id><name><surname>Xia</surname><given-names>Yingjie</given-names></name><xref ref-type="aff" rid="I1"><sup>1</sup></xref><xref ref-type="aff" rid="I2"><sup>2</sup></xref><xref ref-type="corresp" rid="cor1">*</xref></contrib><contrib contrib-type="author"><contrib-id contrib-id-type="orcid">0000-0002-1350-6030</contrib-id><name><surname>Hu</surname><given-names>Jia</given-names></name><xref ref-type="aff" rid="I2"><sup>2</sup></xref></contrib><contrib contrib-type="author"><name><surname>Fontaine</surname><given-names>Michael D.</given-names></name><xref ref-type="aff" rid="I2"><sup>2</sup></xref></contrib></contrib-group><aff id="I1"><sup>1</sup>Hangzhou Institute of Service Engineering, Hangzhou Normal University, 222 Wenyi Road, Hangzhou 310012, China</aff><aff id="I2"><sup>2</sup>Department of Civil and Environmental Engineering, University of Virginia, 351 McCormick Road, Charlottesville, VA 22903, USA</aff><author-notes><corresp id="cor1">*Yingjie Xia: <email>xiayingjie@zju.edu.cn</email></corresp><fn fn-type="other"><p>Academic Editors: A. Chatzigeorgiou and A. Puliafito</p></fn></author-notes><pub-date pub-type="collection"><year>2013</year></pub-date><pub-date pub-type="epub"><day>16</day><month>5</month><year>2013</year></pub-date><volume>2013</volume><elocation-id>462846</elocation-id><history><date date-type="received"><day>11</day><month>2</month><year>2013</year></date><date date-type="accepted"><day>1</day><month>5</month><year>2013</year></date></history><permissions><copyright-statement>Copyright © 2013 Yingjie Xia et al.</copyright-statement><copyright-year>2013</copyright-year><license license-type="open-access"><license-p>This is an open access article distributed under the Creative Commons Attribution License, which permits unrestricted use, distribution, and reproduction in any medium, provided the original work is properly cited.</license-p></license></permissions><abstract><p>Traffic data is commonly collected from widely deployed sensors in urban areas. This brings up a new research topic, data-driven intelligent transportation systems (ITSs), which means to integrate heterogeneous traffic data from different kinds of sensors and apply it for ITS applications. This research, taking into consideration the significant increase in the amount of traffic data and the complexity of data analysis, focuses mainly on the challenge of solving data-intensive and computation-intensive problems. As a solution to the problems, this paper proposes a Cyber-ITS framework to perform data analysis on Cyber Infrastructure (CI), by nature parallel-computing hardware and software systems, in the context of ITS. The techniques of the framework include data representation, domain decomposition, resource allocation, and parallel processing. All these techniques are based on data-driven and application-oriented models and are organized as a component-and-workflow-based model in order to achieve technical interoperability and data reusability. A case study of the Cyber-ITS framework is presented later based on a traffic state estimation application that uses the fusion of massive Sydney Coordinated Adaptive Traffic System (SCATS) data and GPS data. The results prove that the Cyber-ITS-based implementation can achieve a high accuracy rate of traffic state estimation and provide a significant computational speedup for the data fusion by parallel computing.</p></abstract></article-meta></front><body><sec id="sec1"><title>1. Introduction</title><p>The quantity and quality of sensor data collected dedicatedly for transportation systems have increased tremendously in the past few decades. This trend will continue in the foreseeable future and leads to a new research direction on traffic data analysis in intelligent transportation systems (ITS). Intelligent data analysis, supported by mathematical algorithms, is becoming an important tool for scientific discovery and decision making in many fields, for example, bioinformatics, geographic information systems, and ecology. By integrating intelligent data analysis into ITS, a research direction named data-driven ITS emerges to focus on algorithmic and intelligent analysis on multisensor heterogeneous traffic data. This new direction leads to a revolution in ITS development, which adopts vision, multi-source, and learning-based traffic data processing algorithms for performance optimization [<xref ref-type="bibr" rid="B1">1</xref>]. In recent years, data-driven ITS is becoming more feasible in ITS since a variety of traffic sensors are widely deployed in the urban and suburban areas.</p><p>As data size and algorithmic complexity increase, data-driven ITS faces significant challenges in terms of solving computation-intensive problems. These problems lead to excessive lag in the execution time of the applications. A solution is proposed to migrate computation-intensive ITS applications from the conventional single-CPU architecture to the emerging Cyber Infrastructure (CI). CI is by nature a parallel-computing architecture and software environment, which is urgently needed by applications that must be run in real time.</p><p>In this paper, a new Cyber ITS framework is proposed to synergistically integrate data analysis algorithms into ITS and realize efficient processing of massive traffic data sets using CI. This framework is urgently needed for the following reasons: (i) ITS demands transformative breakthroughs to solve computationally intensive data processing problems; (ii) CI is now increasingly accessible to ITS and data analysis [<xref ref-type="bibr" rid="B2">2</xref>]; and (iii) some theoretical investigation on using CI for ITS has been conducted [<xref ref-type="bibr" rid="B3">3</xref>]. Cyber-ITS is technically designed to provide a traffic data and operation sharing framework based on parallel computing techniques. The framework is also designed following the component-and-workflow-based model, which enables different applications to assemble their relevant functionality components into workflows.</p><p>The rest of the paper is organized as follows. The next section reviews the past research relating data-driven ITS and CI. The design of the new Cyber-ITS framework is then introduced, and a case study of traffic state estimation using parallelized traffic data fusion is presented. Afterwards, the accuracy and efficiency tests are conducted on the studied case. Finally, conclusions and recommendations for future research are discussed.</p></sec><sec id="sec2"><title>2. Related Work</title><p>Conventional ITS is evolving into data-driven ITS, which focuses on processing data collected from multiple traffic sensors. Depending on the types of data and the fashion that the data is processed, the data-driven ITS is categorized into three types: vision-driven ITS, multisource-driven ITS, and learning-driven ITS. Vision-driven ITS takes video cameras as traffic sensors, which collect data for some representative applications, such as traffic object detection [<xref ref-type="bibr" rid="B4">4</xref>] and recognition [<xref ref-type="bibr" rid="B5">5</xref>], traffic behavior analysis [<xref ref-type="bibr" rid="B6">6</xref>], and vehicle trajectory construction [<xref ref-type="bibr" rid="B7">7</xref>]. However, vision-driven ITS suffers from some constraints, for example, weather, brightness, and camera positions. Therefore, to overcome the weakness of vision-driven ITS, multisource-driven ITS proposes to use multiple types of sensors, so that different kinds of sensor, can compensate each other's weaknesses. For example, the loop detectors deployed in-pavement are robust to environmental constraints, but have the drawbacks of a high failure ratio and potential inaccurate calculation of traffic state [<xref ref-type="bibr" rid="B8">8</xref>]. On the contrary, probe vehicles (e.g. GPS data) can provide true point-to-point travel times, but small sample size could result in poor statistical representation, and probes could be subject to errors in the map-matching process [<xref ref-type="bibr" rid="B9">9</xref>]. Multisource-driven ITS fuses heterogeneous data from video sensors, loop detectors, and probe vehicles to improve the accuracy and completeness of traffic data [<xref ref-type="bibr" rid="B10">10</xref>]. No matter what kinds of traffic sensors are used, it is always required to have the corresponding learning-based analytical tools to process data. This leads to the learning-driven ITS. Some commonly used learning algorithms, including rough set theory [<xref ref-type="bibr" rid="B11">11</xref>], online learning [<xref ref-type="bibr" rid="B12">12</xref>], fuzzy logic [<xref ref-type="bibr" rid="B13">13</xref>], are used to extract intrinsic rules from historical and real-time traffic data. These kinds of work always run into challenges of computational efficiency when dealing with large data sets. Luckily, this problem can be effectively solved by algorithmic parallelization executed on CI resources [<xref ref-type="bibr" rid="B14">14</xref>].</p><p>CI has been widely adopted in computer systems for its improved computing capability and cost effectiveness. Multinode, many-core, and general purpose graphics processing unit (GPGPU) are three major architectures of CI. Above the underlying hardware, the application-oriented techniques, such as data decomposition [<xref ref-type="bibr" rid="B15">15</xref>] to generate multiple computing tasks, task scheduling to allocate computing nodes, nodes communication for tasks interaction, and computation synchronization [<xref ref-type="bibr" rid="B16">16</xref>] for results collection are leveraged to support computation-intensive and data-intensive problems solving. These techniques are integrated as a piece of middleware, which delivers interoperable and reusable services for efficient use of CI resources [<xref ref-type="bibr" rid="B17">17</xref>].</p><p>Recently, some research on the combination of data-driven ITS and CI has been published, such as parallel implementation of transportation network models [<xref ref-type="bibr" rid="B18">18</xref>], computationally efficient online identification of traffic control intervention measures [<xref ref-type="bibr" rid="B19">19</xref>], parallel traffic control and management [<xref ref-type="bibr" rid="B20">20</xref>], and Message Passing Interface (MPI)-based parallelized fusion for traffic state estimation [<xref ref-type="bibr" rid="B21">21</xref>]. However, these studies are just for specific applications and cannot be extended to build a generic framework. Nevertheless, current applications all show the need for data sharing and applications integration. Therefore, this research seeks to develop Cyber ITS as a framework that can perform heterogeneous data analysis on CI in the context of ITS.</p></sec><sec id="sec3"><title>3. Cyber-ITS Framework</title><p>The Cyber-ITS framework is designed to synthesize CI and data analysis in the context of ITS, as shown in <xref ref-type="fig" rid="fig1">Figure 1</xref>. These three fields are interlinked on computational intensity, which plays a central role in the framework. On the technique level, a collection of technical tools are equipped to complete the tasks of data representation, domain decomposition, resources allocation, and parallel processing based on the computational intensity. These tools, such as ITS computational domain, octree-based decomposition, and max-min tasks scheduling, can improve the computing performance of traffic data analysis by parallel computing. The techniques are organized as the models on the outside layer in <xref ref-type="fig" rid="fig1">Figure 1</xref>, such as data-driven, application-oriented, and component-and-workflow-based models. The details about computational intensity, techniques, and models of the Cyber-ITS framework are specified as follows.</p><sec id="sec3.1"><title>3.1. Computational Intensity</title><p>Computational intensity is fundamental to the Cyber-ITS framework. The definition of computational intensity is derived from the traditional computational complexity theory, which focuses on assessing the algorithmic complexity in theoretical computer science [<xref ref-type="bibr" rid="B22">22</xref>]. However, the complexity theory only evaluates the algorithmic structure without adequately capturing the spatiotemporal characteristics of ITS data analysis. These characteristics, such as spatiotemporal clustering, neighborhood, autocorrelation, and interaction dynamics of massive traffic data, need to be considered in the transformed computational intensity and therefore can reinforce the algorithmic complexity in evaluating computing time, memory, and input/output (I/O).</p><p>Again, computational intensity is the most important measurement in this framework. Supposing a computation-intensive ITS application needs to be completed in real time, it can be parallelized to execute on CI. The parallelization work first requires the application to be divided into multiple computing tasks. Since the efficiency of parallel computing is determined by the agreement between tasks loads and CI computing capabilities, the computational intensity is regarded as the right measurement that can quantify tasks loads during the task division. The details about the computational intensity will be specified in a case study later in this paper.</p></sec><sec id="sec3.2"><title>3.2. Techniques</title><sec id="sec3.2.1"><title>3.2.1. Data Representation</title><p>Before addressing computational intensity, the explicit data representation which takes into account the characteristics of data and operations needs to be investigated. The Cyber-ITS framework adopts an ITS computational domain theory to formally represent heterogeneous data collected from multiple types of traffic sensors. ITS computational domain, which is derived from the idea of spatial computational domain [<xref ref-type="bibr" rid="B23">23</xref>], can project different types of traffic data from a high-dimensional data space to a three-dimensional spatiotemporal domain <italic>D</italic> = (<italic>c</italic><sub><italic>i</italic>,<italic>j</italic>,<italic>k</italic></sub>) consisting of a large amount of cells. For example, as shown in <xref ref-type="fig" rid="fig2">Figure 2</xref>, to represent traffic data from Sydney Coordinated Adaptive Traffic System (SCATS) detector loops and GPS probe vehicles, the cell <italic>c</italic><sub><italic>i</italic>,<italic>j</italic>,<italic>k</italic></sub> can be defined as a vector <<italic>s</italic>, <italic>v</italic>, <italic>f</italic>> at position (<italic>i</italic>, <italic>j</italic>, <italic>k</italic>). <italic>s</italic> denotes the sensor type which has two values: 0 and 1, 0 standing for SCATS and 1 standing for GPS. <italic>v</italic> and <italic>f</italic> denote the speed and flow of a road segment, respectively. The coordinates (<italic>i</italic>, <italic>j</italic>, <italic>k</italic>) indicate the discretized time and location indices of a road segment in the respective <italic>x</italic><sub><italic>t</italic></sub>, <italic>y</italic><sub><italic>lx</italic></sub>, and <italic>z</italic><sub><italic>ly</italic></sub> axes.</p></sec><sec id="sec3.2.2"><title>3.2.2. Domain Decomposition</title><p>When an application using data in the ITS computational domain requires CI resources for parallel computing, the domain first needs to be decomposed into subdomains to create multiple computing tasks. To maximize the efficiency of CI recourses, it is necessary to assure that the work loads are balanced among subdomains. The load balance of these subdomains can be achieved by using a technique called octree [<xref ref-type="bibr" rid="B24">24</xref>]. The octree would recursively divide a domain or subdomain into eight smaller subdomains until certain criterion on computational intensity achieving a threshold is met. In the octree-based ITS computational domain decomposition, computing time, memory, I/O, or their combination are the candidate criteria. The threshold is determined by dividing the computational intensity of the whole computational domain by the maximum number of CI computing nodes. A demonstration of octree-based domain decomposition is shown in <xref ref-type="fig" rid="fig3">Figure 3</xref>.</p></sec><sec id="sec3.2.3"><title>3.2.3. Resource Allocation and Parallel Processing</title><p>The subdomains generated from octree-based domain decomposition enable multiple computing tasks to be created from one single data-driven ITS application. These subdomains are then assigned to CI resources. As one of the most popular CI resources, a cluster computer consisting of a set of loosely connected computing nodes is commonly designed as a homogeneous architecture. Therefore, in the cluster computer the parallel processing on ITS computational domain can be implemented by simply allocating computing nodes to computing tasks on subdomains one by one. If the number of tasks is greater than the number of nodes, some algorithms are required to make the computing tasks scheduled to each node as load balanced as possible. For example, the max-min scheduling algorithm [<xref ref-type="bibr" rid="B25">25</xref>] combines a high-loaded task with a low-loaded task as one task package scheduled to one cluster node. This algorithm can avoid generating the weakest link in a chain of computational intensity assigned to each computing node and improve the efficiency of parallel processing in the Cyber-ITS framework.</p></sec></sec><sec id="sec3.3"><title>3.3. Models</title><sec id="sec3.3.1"><title>3.3.1. Data-Driven and Application-Oriented Models</title><p>The aforementioned techniques of the Cyber-ITS framework are used in data-driven and application-oriented models. Diverse data-driven ITS applications share the same formally represented traffic data and utilize the corresponding methodology to process the data. For example, traffic state estimation [<xref ref-type="bibr" rid="B2">2</xref>] and real-time traffic flow forecasting [<xref ref-type="bibr" rid="B26">26</xref>] are two Cyber-ITS-based applications on ITS computational domain utilizing SCATS and GPS data. For traffic state estimation, the fusion of heterogeneous traffic data is adopted to combine the strength of different traffic sensors and compensates for their corresponding deficiencies. The fusion process consists of four steps: data smoothing, traffic state features estimation, features fusion, and decision making [<xref ref-type="bibr" rid="B3">3</xref>]. All four steps are involved with the data processing on the ITS computational domain. For real-time traffic flow forecasting, SCATS and GPS data are first transformed to estimate the flow as the historical data. These data construct the covariance data matrix, which is used in the modal functions of spectral analysis. This method can predict the traffic flow of 1 hour and 15 minutes in the future within 15 minutes. The process of traffic flow forecasting consists of three steps: traffic flow estimation, covariance matrix construction, and online prediction by spectral analysis [<xref ref-type="bibr" rid="B26">26</xref>]. Similar to the previous traffic state estimation, all these three steps relate to the data processing on ITS computational domain. A common portal system of these two Cyber-ITS-based applications is shown in <xref ref-type="fig" rid="fig4">Figure 4</xref>. The portal system can provide basic input and output interfaces for the applications.</p></sec><sec id="sec3.3.2"><title>3.3.2. Component-and-Workflow-Based Model</title><p>Diverse data-driven ITS applications not only share common formally represented data but also reuse several processing modules, for example, the features estimation in both traffic state estimation and traffic flow forecasting. The Cyber-ITS framework adopts a component-based model to encapsulate all processing modules as components. Some commonly used components are categorized as: (i) high-performance computing components encompassing CI-based parallel computing for ITS and data analysis; (ii) data-related components interacting with high-performance computing components to evaluate the computational intensity and process massive traffic data; (iii) collaboration components provide collaborative support for interactions management among different applications. These components can guide the implementation of data-driven ITS applications based on the Cyber-ITS framework.</p><p>The interoperable and reusable components can compose workflow to develop Cyber-ITS-based applications [<xref ref-type="bibr" rid="B27">27</xref>]. The workflow is based on flexible and scalable composition of individual components following common interfaces and standards [<xref ref-type="bibr" rid="B28">28</xref>]. For the example of traffic state estimation, the workflow is composed of high-performance computing components and data-related components to realize the capabilities of high-performance computing, traffic data processing, and features fusion. These components also need to be configured and managed in the specific contexts of ITS applications.</p></sec></sec></sec><sec id="sec4"><title>4. Case Study in Traffic State Estimation</title><sec id="sec4.1"><title>4.1. Introduction</title><p>One typical data-driven ITS application, traffic state estimation by fusing SCATS and GPS data, is chosen as a case to study the implementation of the Cyber-ITS framework. The aforementioned four steps of traffic state estimation are flowcharted in <xref ref-type="fig" rid="fig5">Figure 5</xref>.</p><p>The data smoothing is first performed using Kalman filters to reduce the impact of noise on the collected data [<xref ref-type="bibr" rid="B9">9</xref>]. Then, the estimation algorithms are adopted to transform the filtered SCATS and GPS source data into traffic state features [<xref ref-type="bibr" rid="B14">14</xref>], such as speed and flow rate. These features are used to construct the ITS computational domain. Afterwards, the features from different kinds of sensors on one road segment are fused by Dempster-Shafer (D-S) evidence theory [<xref ref-type="bibr" rid="B29">29</xref>], which can overcome the conflict of estimated traffic states from different sensors. D-S evidence theory is a mathematical theory mostly used when combining evidence from different sources. The theory uses the belief function to express the probabilities of various combinations of evidence as degrees of belief. In traffic state estimation, the evidence is just the discretized values of traffic state estimated by different sensors, such as “congested,” “medium,” and “smooth.” The algorithm of D-S evidential fusion on the discretized traffic state of a cell in the computational domain is shown as follows:
<disp-formula id="EEq1"><label>(1)</label><mml:math id="M1"><mml:mtable><mml:mtr><mml:mtd><mml:maligngroup></mml:maligngroup><mml:mi>m</mml:mi><mml:mrow><mml:mo>(</mml:mo><mml:mrow><mml:msub><mml:mrow><mml:mi>s</mml:mi></mml:mrow><mml:mrow><mml:mi>t</mml:mi></mml:mrow></mml:msub></mml:mrow><mml:mo>)</mml:mo></mml:mrow><mml:malignmark></mml:malignmark><mml:mo>=</mml:mo><mml:msub><mml:mrow><mml:mi>m</mml:mi></mml:mrow><mml:mrow><mml:mn mathvariant="normal">1</mml:mn></mml:mrow></mml:msub><mml:mrow><mml:mo>(</mml:mo><mml:mrow><mml:msub><mml:mrow><mml:mi>s</mml:mi></mml:mrow><mml:mrow><mml:mn mathvariant="normal">1</mml:mn><mml:mo>,</mml:mo><mml:mi>t</mml:mi></mml:mrow></mml:msub></mml:mrow><mml:mo>)</mml:mo></mml:mrow><mml:mo>⊕</mml:mo><mml:msub><mml:mrow><mml:mi>m</mml:mi></mml:mrow><mml:mrow><mml:mn mathvariant="normal">2</mml:mn></mml:mrow></mml:msub><mml:mrow><mml:mo>(</mml:mo><mml:mrow><mml:msub><mml:mrow><mml:mi>s</mml:mi></mml:mrow><mml:mrow><mml:mn mathvariant="normal">2</mml:mn><mml:mo>,</mml:mo><mml:mi>t</mml:mi></mml:mrow></mml:msub></mml:mrow><mml:mo>)</mml:mo></mml:mrow><mml:mo>⋯</mml:mo><mml:mo>⊕</mml:mo><mml:msub><mml:mrow><mml:mi>m</mml:mi></mml:mrow><mml:mrow><mml:mi>X</mml:mi></mml:mrow></mml:msub><mml:mrow><mml:mo>(</mml:mo><mml:mrow><mml:msub><mml:mrow><mml:mi>s</mml:mi></mml:mrow><mml:mrow><mml:mi>X</mml:mi><mml:mo>,</mml:mo><mml:mi>t</mml:mi></mml:mrow></mml:msub></mml:mrow><mml:mo>)</mml:mo></mml:mrow></mml:mtd></mml:mtr><mml:mtr><mml:mtd><mml:maligngroup></mml:maligngroup><mml:malignmark></mml:malignmark><mml:mo>=</mml:mo><mml:mfrac><mml:mrow><mml:mrow><mml:msub><mml:mo stretchy="false">∑</mml:mo><mml:mrow><mml:mrow><mml:msubsup><mml:mo stretchy="false">⋂</mml:mo><mml:mrow><mml:mi>i</mml:mi><mml:mo>=</mml:mo><mml:mn mathvariant="normal">1</mml:mn></mml:mrow><mml:mrow><mml:mi>X</mml:mi></mml:mrow></mml:msubsup><mml:mrow><mml:msub><mml:mrow><mml:mi>s</mml:mi></mml:mrow><mml:mrow><mml:mi>i</mml:mi><mml:mo>,</mml:mo><mml:mi>t</mml:mi></mml:mrow></mml:msub><mml:mo>=</mml:mo><mml:msub><mml:mrow><mml:mi>s</mml:mi></mml:mrow><mml:mrow><mml:mi>t</mml:mi></mml:mrow></mml:msub></mml:mrow></mml:mrow></mml:mrow></mml:msub><mml:mrow><mml:mrow><mml:mo>(</mml:mo><mml:mrow><mml:mrow><mml:msubsup><mml:mo stretchy="false">∏</mml:mo><mml:mrow><mml:mi>i</mml:mi><mml:mo>=</mml:mo><mml:mn mathvariant="normal">1</mml:mn></mml:mrow><mml:mrow><mml:mi>X</mml:mi></mml:mrow></mml:msubsup><mml:mrow><mml:msub><mml:mrow><mml:mi>m</mml:mi></mml:mrow><mml:mrow><mml:mi>i</mml:mi></mml:mrow></mml:msub><mml:mrow><mml:mo>(</mml:mo><mml:mrow><mml:msub><mml:mrow><mml:mi>s</mml:mi></mml:mrow><mml:mrow><mml:mi>i</mml:mi><mml:mo>,</mml:mo><mml:mi>t</mml:mi></mml:mrow></mml:msub></mml:mrow><mml:mo>)</mml:mo></mml:mrow></mml:mrow></mml:mrow></mml:mrow><mml:mo>)</mml:mo></mml:mrow></mml:mrow></mml:mrow></mml:mrow><mml:mrow><mml:mn mathvariant="normal">1</mml:mn><mml:mo>−</mml:mo><mml:mrow><mml:msub><mml:mo stretchy="false">∑</mml:mo><mml:mrow><mml:mrow><mml:msubsup><mml:mo stretchy="false">⋂</mml:mo><mml:mrow><mml:mi>i</mml:mi><mml:mo>=</mml:mo><mml:mn mathvariant="normal">1</mml:mn></mml:mrow><mml:mrow><mml:mi>X</mml:mi></mml:mrow></mml:msubsup><mml:mrow><mml:msub><mml:mrow><mml:mi>s</mml:mi></mml:mrow><mml:mrow><mml:mi>i</mml:mi><mml:mo>,</mml:mo><mml:mi>t</mml:mi></mml:mrow></mml:msub><mml:mo>=</mml:mo><mml:mi mathvariant="normal">Φ</mml:mi></mml:mrow></mml:mrow></mml:mrow></mml:msub><mml:mrow><mml:mrow><mml:mo>(</mml:mo><mml:mrow><mml:mrow><mml:msubsup><mml:mo stretchy="false">∏</mml:mo><mml:mrow><mml:mi>i</mml:mi><mml:mo>=</mml:mo><mml:mn mathvariant="normal">1</mml:mn></mml:mrow><mml:mrow><mml:mi>X</mml:mi></mml:mrow></mml:msubsup><mml:mrow><mml:msub><mml:mrow><mml:mi>m</mml:mi></mml:mrow><mml:mrow><mml:mi>i</mml:mi></mml:mrow></mml:msub><mml:mrow><mml:mo>(</mml:mo><mml:mrow><mml:msub><mml:mrow><mml:mi>s</mml:mi></mml:mrow><mml:mrow><mml:mi>i</mml:mi><mml:mo>,</mml:mo><mml:mi>t</mml:mi></mml:mrow></mml:msub></mml:mrow><mml:mo>)</mml:mo></mml:mrow></mml:mrow></mml:mrow></mml:mrow><mml:mo>)</mml:mo></mml:mrow></mml:mrow></mml:mrow></mml:mrow></mml:mfrac><mml:mo>,</mml:mo></mml:mtd></mml:mtr></mml:mtable></mml:math></disp-formula><disp-formula id="EEq2"><label>(2)</label><mml:math id="EEq2EAAA0NB0ACCCA"><mml:mtable><mml:mtr><mml:mtd><mml:msub><mml:mrow><mml:mi>m</mml:mi></mml:mrow><mml:mrow><mml:mi>i</mml:mi></mml:mrow></mml:msub><mml:mrow><mml:mo>(</mml:mo><mml:mrow><mml:msub><mml:mrow><mml:mi>s</mml:mi></mml:mrow><mml:mrow><mml:mi>i</mml:mi><mml:mo>,</mml:mo><mml:mi>t</mml:mi></mml:mrow></mml:msub></mml:mrow><mml:mo>)</mml:mo></mml:mrow><mml:mo>=</mml:mo><mml:mfrac><mml:mrow><mml:msub><mml:mrow><mml:mi>n</mml:mi></mml:mrow><mml:mrow><mml:mi>i</mml:mi><mml:mo>,</mml:mo><mml:mi>t</mml:mi></mml:mrow></mml:msub><mml:mrow><mml:mo>(</mml:mo><mml:mrow><mml:mi>s</mml:mi><mml:mo>,</mml:mo><mml:mi>d</mml:mi></mml:mrow><mml:mo>)</mml:mo></mml:mrow></mml:mrow><mml:mrow><mml:msub><mml:mrow><mml:mi>n</mml:mi></mml:mrow><mml:mrow><mml:mi>i</mml:mi><mml:mo>,</mml:mo><mml:mi>t</mml:mi></mml:mrow></mml:msub><mml:mrow><mml:mo>(</mml:mo><mml:mrow><mml:mi>d</mml:mi></mml:mrow><mml:mo>)</mml:mo></mml:mrow></mml:mrow></mml:mfrac><mml:mo>,</mml:mo></mml:mtd></mml:mtr></mml:mtable></mml:math></disp-formula>where <italic>m</italic>(<italic>s</italic><sub><italic>t</italic></sub>) denotes basic probability assignment (BPA) of the specified traffic state <italic>s</italic> as the fusion result at time <italic>t</italic>, and <italic>m</italic><sub><italic>i</italic></sub>(<italic>s</italic><sub><italic>i</italic>,<italic>t</italic></sub>), <italic>i</italic> = 1,2,…, <italic>X</italic> represents the BPA of this state from <italic>i</italic>th sensor at time <italic>t</italic>. The <italic>m</italic><sub><italic>i</italic></sub>(<italic>s</italic><sub><italic>i</italic>,<italic>t</italic></sub>) of one cell can be estimated by calculating the proportion which divides the number of its neighboring cells <italic>n</italic><sub><italic>i</italic>,<italic>t</italic></sub>(<italic>s</italic>, <italic>d</italic>) within a specified distance <italic>d</italic> and having that state <italic>s</italic> by the number of all neighboring cells within <italic>d</italic>. Traffic state is determined following a typical decision rule in D-S evidence theory, maximum degree of belief [<xref ref-type="bibr" rid="B30">30</xref>].</p></sec><sec id="sec4.2"><title>4.2. Parallelized Fusion</title><p>As the amount of SCATS and GPS data is relatively high in the context of ITS applications, it is a great challenge to complete the data fusion on a real-time basis. In this study, data are collected from downtown Shanghai, where 2077 road segments are included. The GPS data are gathered from 8172 taxis belonging to Jinjiang and Bashi taxi companies, and the SCATS data are from 1836 loop detectors deployed on around 200 road intersections. All the collected data are uploaded to the server once every 2 minutes. The total number of SCATS and GPS data records during 10 minutes exceeds 50000; hence, it would take more than one hour to execute the aforementioned four steps of fusing traffic features by sequential computing. However, the real-time nature of the computation requires the calculation to take less than 10 minutes. Therefore, as a solution, data-centric parallelization of D-S evidential fusion is proposed to improve computing performance.</p><p>The parallelization process consists of (i) evaluating the computational intensity of data fusion by calculating CPU cycles; (ii) octree-based decomposition of the computational domain into subdomains according to the CPU cycle threshold; and (iii) scheduling subdomains to the computing nodes of a cluster computer for parallelized D-S evidential fusion. Specifically, as the computational intensity evaluation, the CPU cycles of data fusion on one road segment are counted as follows:
<disp-formula id="EEq3"><label>(3)</label><mml:math id="M2"><mml:mtable><mml:mtr><mml:mtd><mml:maligngroup></mml:maligngroup><mml:msub><mml:mrow><mml:mi>N</mml:mi></mml:mrow><mml:mrow><mml:msub><mml:mrow><mml:mtext>CPU</mml:mtext></mml:mrow><mml:mrow><mml:mtext>Cycles</mml:mtext></mml:mrow></mml:msub></mml:mrow></mml:msub><mml:malignmark></mml:malignmark><mml:mo>=</mml:mo><mml:mi>B</mml:mi><mml:mi>P</mml:mi><mml:msub><mml:mrow><mml:mi>A</mml:mi></mml:mrow><mml:mrow><mml:mtext>number</mml:mtext></mml:mrow></mml:msub><mml:mo>×</mml:mo><mml:msub><mml:mrow><mml:mi>N</mml:mi></mml:mrow><mml:mrow><mml:mtext>neighbors</mml:mtext></mml:mrow></mml:msub><mml:mo>+</mml:mo><mml:mi>B</mml:mi><mml:mi>P</mml:mi><mml:msub><mml:mrow><mml:mi>A</mml:mi></mml:mrow><mml:mrow><mml:mtext>number</mml:mtext></mml:mrow></mml:msub></mml:mtd></mml:mtr><mml:mtr><mml:mtd><mml:maligngroup></mml:maligngroup><mml:malignmark></mml:malignmark><mml:mo>×</mml:mo><mml:mrow><mml:mo>(</mml:mo><mml:mrow><mml:mn mathvariant="normal">2</mml:mn><mml:mo>×</mml:mo><mml:mi>B</mml:mi><mml:mi>P</mml:mi><mml:msub><mml:mrow><mml:mi>A</mml:mi></mml:mrow><mml:mrow><mml:msup><mml:mrow><mml:mtext>number</mml:mtext></mml:mrow><mml:mrow><mml:mn mathvariant="normal">2</mml:mn></mml:mrow></mml:msup></mml:mrow></mml:msub><mml:mo>+</mml:mo><mml:mn mathvariant="normal">2</mml:mn><mml:mo>×</mml:mo><mml:mi>B</mml:mi><mml:mi>P</mml:mi><mml:msub><mml:mrow><mml:mi>A</mml:mi></mml:mrow><mml:mrow><mml:msup><mml:mrow><mml:mtext>number</mml:mtext></mml:mrow><mml:mrow><mml:mn mathvariant="normal">2</mml:mn></mml:mrow></mml:msup></mml:mrow></mml:msub></mml:mrow><mml:mo>)</mml:mo></mml:mrow><mml:mo>,</mml:mo></mml:mtd></mml:mtr></mml:mtable></mml:math></disp-formula>where <italic>BPA</italic><sub>number</sub> × <italic>N</italic><sub>neighbors</sub> indicates the number of CPU cycles for calculating the BPA values for all traffic states in (<xref ref-type="disp-formula" rid="EEq2">2</xref>), and two 2 × <italic>BPA</italic><sub>number<sup>2</sup></sub>, respectively, indicate the number of CPU cycles of ∑<sub>⋂<sub><italic>i</italic>=1</sub><sup><italic>X</italic></sup><italic>s</italic><sub><italic>i</italic>,<italic>t</italic></sub>=<italic>s</italic><sub><italic>t</italic></sub></sub>(∏<sub><italic>i</italic>=1</sub><sup><italic>X</italic></sup><italic>m</italic><sub><italic>i</italic></sub>(<italic>s</italic><sub><italic>i</italic>,<italic>t</italic></sub>)) and ∑<sub>⋂<sub><italic>i</italic>=1</sub><sup><italic>X</italic></sup><italic>s</italic><sub><italic>i</italic>,<italic>t</italic></sub>=Φ</sub>(∏<sub><italic>i</italic>=1</sub><sup><italic>X</italic></sup><italic>m</italic><sub><italic>i</italic></sub>(<italic>s</italic><sub><italic>i</italic>,<italic>t</italic></sub>)) in (<xref ref-type="disp-formula" rid="EEq1">1</xref>). The threshold is determined by dividing the number of CPU cycles of the whole computational domain by the number of cluster nodes [<xref ref-type="bibr" rid="B31">31</xref>], and the tasks scheduling is conducted using the max-min scheduling algorithm if the number of subdomains is greater than the number of computing nodes. In the above example, the CPU cycles of data fusion on one road segment are counted as follows:
<disp-formula id="EEq4"><label>(4)</label><mml:math id="M3"><mml:mtable><mml:mtr><mml:mtd><mml:maligngroup></mml:maligngroup><mml:msub><mml:mrow><mml:mi>N</mml:mi></mml:mrow><mml:mrow><mml:msub><mml:mrow><mml:mtext>CPU</mml:mtext></mml:mrow><mml:mrow><mml:mtext>Cycles</mml:mtext></mml:mrow></mml:msub></mml:mrow></mml:msub><mml:malignmark></mml:malignmark><mml:mo>=</mml:mo><mml:mi>B</mml:mi><mml:mi>P</mml:mi><mml:msub><mml:mrow><mml:mi>A</mml:mi></mml:mrow><mml:mrow><mml:mtext>number</mml:mtext></mml:mrow></mml:msub><mml:mo>×</mml:mo><mml:msub><mml:mrow><mml:mi>N</mml:mi></mml:mrow><mml:mrow><mml:mtext>neighbors</mml:mtext></mml:mrow></mml:msub><mml:mo>+</mml:mo><mml:mi>B</mml:mi><mml:mi>P</mml:mi><mml:msub><mml:mrow><mml:mi>A</mml:mi></mml:mrow><mml:mrow><mml:mtext>number</mml:mtext></mml:mrow></mml:msub></mml:mtd></mml:mtr><mml:mtr><mml:mtd><mml:maligngroup></mml:maligngroup><mml:malignmark></mml:malignmark><mml:mo>×</mml:mo><mml:mrow><mml:mo>(</mml:mo><mml:mrow><mml:mn mathvariant="normal">2</mml:mn><mml:mo>×</mml:mo><mml:mi>B</mml:mi><mml:mi>P</mml:mi><mml:msub><mml:mrow><mml:mi>A</mml:mi></mml:mrow><mml:mrow><mml:msup><mml:mrow><mml:mtext>number</mml:mtext></mml:mrow><mml:mrow><mml:mn mathvariant="normal">2</mml:mn></mml:mrow></mml:msup></mml:mrow></mml:msub><mml:mo>+</mml:mo><mml:mn mathvariant="normal">2</mml:mn><mml:mo>×</mml:mo><mml:mi>B</mml:mi><mml:mi>P</mml:mi><mml:msub><mml:mrow><mml:mi>A</mml:mi></mml:mrow><mml:mrow><mml:msup><mml:mrow><mml:mtext>number</mml:mtext></mml:mrow><mml:mrow><mml:mn mathvariant="normal">2</mml:mn></mml:mrow></mml:msup></mml:mrow></mml:msub></mml:mrow><mml:mo>)</mml:mo></mml:mrow></mml:mtd></mml:mtr><mml:mtr><mml:mtd><mml:maligngroup></mml:maligngroup><mml:malignmark></mml:malignmark><mml:mo>=</mml:mo><mml:mn mathvariant="normal">3</mml:mn><mml:mo>×</mml:mo><mml:msub><mml:mrow><mml:mi>N</mml:mi></mml:mrow><mml:mrow><mml:mtext>neighbors</mml:mtext></mml:mrow></mml:msub><mml:mo>+</mml:mo><mml:mn mathvariant="normal">108</mml:mn><mml:mo>,</mml:mo></mml:mtd></mml:mtr></mml:mtable></mml:math></disp-formula>where <italic>BPA</italic><sub>number</sub> is equal to 3 standing for three values of discretized traffic states. Supposing that the number of neighboring cells <italic>N</italic><sub>neighbors</sub> is set as 100, for all 2077 road segments, <italic>N</italic><sub>CPU<sub>Cycles</sub></sub> is calculated as 847416. The corresponding threshold <italic>thr</italic> is determined by
<disp-formula id="EEq5"><label>(5)</label><mml:math id="M4"><mml:mtable><mml:mtr><mml:mtd><mml:mi>t</mml:mi><mml:mi>h</mml:mi><mml:mi>r</mml:mi><mml:mo>=</mml:mo><mml:mfrac><mml:mrow><mml:mn mathvariant="normal">847416</mml:mn></mml:mrow><mml:mrow><mml:msub><mml:mrow><mml:mi>N</mml:mi></mml:mrow><mml:mrow><mml:mtext>nodes</mml:mtext></mml:mrow></mml:msub></mml:mrow></mml:mfrac><mml:mo>,</mml:mo></mml:mtd></mml:mtr></mml:mtable></mml:math></disp-formula>where <italic>N</italic><sub>nodes</sub> denotes the maximum number of computing nodes. The threshold is further used to conduct the domain decomposition.</p></sec><sec id="sec4.3"><title>4.3. Cyber-ITS-Based Implementation</title><p>The traffic state estimation is implemented fully based on the Cyber-ITS framework. Massive SCATS and GPS data are fused using the techniques including ITS computational domain, octree-based domain decomposition, max-min-based subdomains scheduling, and parallelized fusion, which, respectively, correspond to data representation, domain decomposition, resources allocation, and parallel processing in the technique level of Cyber ITS. In the model level, this implementation also follows the SCATS-and-GPS-data-driven and traffic-state-estimation-oriented model. The computational domain, domain decomposition, and task scheduling are all reusable components, which can be shared among diverse data-driven ITS applications. These reusable components are combined with other specialized data processing components to construct workflow for parallelized fusion.</p></sec></sec><sec id="sec5"><title>5. Experimental Results and Analysis</title><sec id="sec5.1"><title>5.1. Experiment Setup</title><p>The experiments on the Cyber-ITS-based traffic state estimation are conducted on a Dawning TC4000L cluster which includes 64 computing nodes equipped with Intel Xeon Dual Core 2.4 GHz CPU and 2G memory. The SCATS and GPS data are uploaded by loop detectors and taxis, respectively, every 2 minutes from 8:00 to 17:00 on the chosen 393 road segments in downtown Shanghai. The data gathered per 10 minutes are calculated as one unit. The speeds of road segments estimated from SCATS and GPS data are formally represented as a computational domain. The computational intensity of data fusion on the whole ITS computational domain is evaluated as 160344 CPU cycles. The threshold is calculated as 160344/64 = 2505.4. Therefore, the computational domain is decomposed into 71 subdomains by octree. Both accuracy and efficiency tests of speed estimation by parallelized fusion are carried out on 1, 2, 4, 8, 16, and 32 computing nodes respectively. The speed can be discretized into “congested” (<5 km/h), “medium” (5 km/h–25 km/h), and “smooth” (>25 km/h). The accuracy of the fused traffic state is compared with a ground truth developed by manually analyzing available traffic video streams. From the captured snapshots of road intersections in the video, if all the vehicles waiting in the queue of a road segment cannot pass the intersection during one period of green light, we regard the traffic state of the road segment as “congested.” If all the vehicles can pass the road intersection during a half period of green light, we regard the traffic state as “smooth.” Otherwise, we regard it as “medium”. This level of comparison is analogous to red/yellow/green traffic condition maps commonly provided on internet traveler information websites by transportation agencies.</p></sec><sec id="sec5.2"><title>5.2. Results and Analysis</title><sec id="sec5.2.1"><title>5.2.1. Accuracy Test</title><p>The accuracy test uses a metric defined as follows:
<disp-formula id="EEq6"><label>(6)</label><mml:math id="M5"><mml:mtable><mml:mtr><mml:mtd><mml:mi>A</mml:mi><mml:mo>=</mml:mo><mml:mfrac><mml:mrow><mml:msub><mml:mrow><mml:mi>n</mml:mi></mml:mrow><mml:mrow><mml:mi>c</mml:mi></mml:mrow></mml:msub></mml:mrow><mml:mrow><mml:msub><mml:mrow><mml:mi>n</mml:mi></mml:mrow><mml:mrow><mml:mtext>all</mml:mtext></mml:mrow></mml:msub></mml:mrow></mml:mfrac><mml:mo>,</mml:mo></mml:mtd></mml:mtr></mml:mtable></mml:math></disp-formula>where <italic>A</italic> denotes the accuracy rate of traffic state estimation, <italic>n</italic><sub><italic>c</italic></sub> is the number of correctly estimated states, and <italic>n</italic><sub>all</sub> is the number of states of all road segments in the whole time range. <italic>n</italic><sub><italic>c</italic></sub> is counted by comparing the discretized speed estimated from the sensors with the ground truth traffic state estimated from videos. The test cases include the traffic state estimation using SCATS data, GPS data, and their fusion. In the case that the traffic state of a road segment cannot be estimated due to sensor malfunctions or missing data, we regard the result as incorrect estimation. The experimental results on <italic>A</italic> of three test cases are shown in <xref ref-type="fig" rid="fig6">Figure 6</xref>.</p><p>As shown in <xref ref-type="fig" rid="fig6">Figure 6</xref>, the estimated traffic state using SCATS data is more accurate than that using GPS data. This is mainly caused by the smaller number of available GPS taxi probes in the sampling, which causes gaps in the network monitored by the probe vehicles. The average <italic>A</italic> of data fusion is around 0.95, which is higher than that of either SCATS or GPS. This is because of the synergistic effect of different types of traffic sensors, which can mutually compensate the loss of accuracy or data availability for each sensor. This accuracy test shows that the Cyber ITS framework can keep data availability and accuracy of the original application algorithms.</p></sec><sec id="sec5.2.2"><title>5.2.2. Efficiency Test</title><p>The efficiency test uses speedup as the metric to evaluate the acceleration performance of Cyber ITS. This metric is defined as a ratio of sequential execution time over parallel execution time in the following equation:
<disp-formula id="EEq7"><label>(7)</label><mml:math id="M6"><mml:mtable><mml:mtr><mml:mtd><mml:mi>S</mml:mi><mml:mo>=</mml:mo><mml:mfrac><mml:mrow><mml:msub><mml:mrow><mml:mi>T</mml:mi></mml:mrow><mml:mrow><mml:mn mathvariant="normal">1</mml:mn></mml:mrow></mml:msub></mml:mrow><mml:mrow><mml:msub><mml:mrow><mml:mi>T</mml:mi></mml:mrow><mml:mrow><mml:mi>n</mml:mi></mml:mrow></mml:msub></mml:mrow></mml:mfrac><mml:mo>,</mml:mo></mml:mtd></mml:mtr></mml:mtable></mml:math></disp-formula>where <italic>S</italic> denotes the speedup, <italic>T</italic><sub>1</sub> is the sequential execution time using one computing node, and <italic>T</italic><sub><italic>n</italic></sub> is the parallel execution time using <italic>n</italic> computing nodes. The experiment evaluates the computing performance of 10-minute data processing, which consists of domain decomposition, tasks scheduling, and parallelized fusion. Average execution time is calculated by running the whole process on different number of computing nodes, as listed in <xref ref-type="table" rid="tab1">Table 1</xref>. The results of speedup are also listed in <xref ref-type="table" rid="tab1">Table 1</xref>, and illustrated in <xref ref-type="fig" rid="fig7">Figure 7</xref>.</p><p>As shown in <xref ref-type="fig" rid="fig7">Figure 7</xref>, as the number of computing nodes increases from 1 to 32, the speedup increases significantly. Clearly, the parallelized process allows data fusion to occur to support real-time traffic state estimation. When only one computing node is used, the average execution time exceeds 15 minutes, which is too long to support real-time applications. When 32 computing nodes are used, the average execution time decreases to less than 2 minutes. However, it is also found that the speedup increases slower than the increment of computing nodes. For example, when the number of computing nodes increases to 32, the speedup only reaches 9.19. This nonlinear trend is caused by the sequential execution components, such as domain decomposition and tasks scheduling. These components are also regarded as the overhead part in the parallelization. In addition, assuming fixed overhead time, as more computing nodes are used, the sequential execution components bring more impact on speedup of the whole process. Nevertheless, this efficiency test clearly shows that the Cyber-ITS-based implementation can perform significant speedup by parallel computing.</p></sec></sec></sec><sec id="sec6"><title>6. Conclusions and Future Work</title><p>The general goal of this paper is to propose a Cyber-ITS framework for the synthesis of CI, ITS, and data analysis. The development of the framework is motivated by the challenge of solving computation-intensive problems on processing massive and heterogeneous traffic data in real time. The Cyber-ITS framework presents a way to transfer the data-driven ITS applications from single-CPU architectures to parallel computing architectures. This transfer requires the transformation of applications, which are based on a common design for processing massive traffic data on CI.</p><p>As the core component of Cyber-ITS, the computational intensity is used to efficiently decompose the data represented by ITS computational domain into load-balanced subdomains. Besides the computational domain and domain decomposition, the Cyber-ITS framework adopts two other techniques, CI resources allocation and parallel processing, to complete the efficient parallelization on traffic data processing. All four techniques are synergistically integrated to follow both data-driven and application-oriented models and can build a component-and-workflow-based model to interoperate and reuse functional components among diverse data-driven ITS applications.</p><p>An example of traffic state estimation by fusing SCATS and GPS data was presented to test the effectiveness of the proposed Cyber-ITS framework. The example was implemented by using parallelized D-S evidential fusion, which consists of evaluating the computational intensity in CPU cycles, octree-based domain decomposition based on the computational intensity, and max-min-based tasks scheduling for parallelized fusion. The fusion work used the discretized traffic state estimated from different sensors and calculated the probabilities of their combination for final determination. This implementation fully followed the SCATS-and-GPS-data-driven and traffic-state-estimation-oriented models.</p><p>Traffic state estimation was also examined to test the performance of the Cyber-ITS framework. Two performance metrics, accuracy rate and speedup, were defined to conduct the respective accuracy and efficiency tests. The experimental results show that the Cyber-ITS-based data fusion achieved higher accuracy rate in estimating traffic state than using any single type of traffic sensor. In addition, as more computing nodes are employed, the experiment demonstrated that the Cyber-ITS framework can facilitate significant computational speedup by parallel computing.</p><p>In future work, the research team will design a piece of scheduling middleware for the purpose of dynamically adapting to different types of CI resources employed in the Cyber-ITS framework. Further research will also focus on expanding the implementation of data-driven ITS applications based on the Cyber-ITS framework. Moreover, the common framework portal system could be improved to gain more interoperability and reusability among diverse applications. </p></sec></body><back><ack><title>Conflict of Interests</title><p>The authors do not have a direct financial relation with the commercial identities mentioned in this paper and have no conflict of interests to declare.</p></ack><ack><title>Acknowledgments</title><p>This paper draws on work supported in part by the following funds: National High Technology Research and Development Program of China (863 Program) under Grant no. 2011AA010101, National Natural Science Foundation of China under Grant no. 61002009, Key Science and Technology Program of Zhejiang Province of China under Grant no. 2012C01035-1, and Zhejiang Provincial Natural Science Foundation of China under Grant no. Z13F020026.</p></ack><ref-list><ref id="B1"><label>1</label><element-citation publication-type="journal"><person-group person-group-type="author"><name><surname>Zhang</surname><given-names>J</given-names></name><name><surname>Wang</surname><given-names>FY</given-names></name><name><surname>Wang</surname><given-names>K</given-names></name><name><surname>Lin</surname><given-names>W</given-names></name><name><surname>Xu</surname><given-names>X</given-names></name><name><surname>Chen</surname><given-names>C</given-names></name></person-group><article-title>Data-driven intelligent transportation systems: a survey</article-title><source><italic>IEEE Transactions on Intelligent Transportation Systems</italic></source><year>2011</year><volume>12</volume><issue>4</issue><fpage>1624</fpage><lpage>1639</lpage></element-citation></ref><ref id="B2"><label>2</label><element-citation publication-type="confproc"><person-group person-group-type="author"><name><surname>Xia</surname><given-names>Y</given-names></name><name><surname>Wu</surname><given-names>C</given-names></name><name><surname>Kong</surname><given-names>Q</given-names></name><name><surname>Shan</surname><given-names>Z</given-names></name><name><surname>Kuang</surname><given-names>L</given-names></name></person-group><article-title>A parallel fusion method for heterogeneous multi-sensor transportation data</article-title><conf-name>Proceedings of the 8th International Conference on Modeling Decision for Artificial Intelligence</conf-name><conf-loc>Changsha, China</conf-loc><publisher-name>Springer</publisher-name><fpage>31</fpage><lpage>42</lpage></element-citation></ref><ref id="B3"><label>3</label><element-citation publication-type="confproc"><person-group person-group-type="author"><name><surname>Xia</surname><given-names>Y</given-names></name><name><surname>Shan</surname><given-names>Z</given-names></name><name><surname>Kuang</surname><given-names>L</given-names></name><name><surname>Shi</surname><given-names>X</given-names></name></person-group><article-title>A theoretical approach for ITS data analyses using cyberinfrastructure</article-title><conf-name>Proceedings of the 1st International Conference on Transportation Information and Safety</conf-name><conf-date>2011</conf-date><conf-loc>Wuhan, China</conf-loc><publisher-name>ASCE</publisher-name><fpage>53</fpage><lpage>59</lpage></element-citation></ref><ref id="B4"><label>4</label><element-citation publication-type="journal"><person-group person-group-type="author"><name><surname>Gross</surname><given-names>F</given-names></name><name><surname>Eccles</surname><given-names>K</given-names></name><name><surname>Nabors</surname><given-names>D</given-names></name></person-group><article-title>Estimation of frequency and length of pedestrian stride in urban environments
with video sensors</article-title><source><italic>Transportation Research Record</italic></source><year>2011</year><volume>2264</volume><fpage>138</fpage><lpage>147</lpage></element-citation></ref><ref id="B5"><label>5</label><element-citation publication-type="journal"><person-group person-group-type="author"><name><surname>Hasan</surname><given-names>S</given-names></name><name><surname>Choudhury</surname><given-names>CF</given-names></name><name><surname>Ben-Akiva</surname><given-names>ME</given-names></name><name><surname>Emmonds</surname><given-names>A</given-names></name></person-group><article-title>Modeling of travel time variations on urban links in London</article-title><source><italic>Transportation Research Record</italic></source><year>2011</year><volume>2260</volume><fpage>1</fpage><lpage>7</lpage></element-citation></ref><ref id="B6"><label>6</label><element-citation publication-type="journal"><person-group person-group-type="author"><name><surname>Chang</surname><given-names>TH</given-names></name><name><surname>Hsu</surname><given-names>CS</given-names></name><name><surname>Wang</surname><given-names>C</given-names></name><name><surname>Yang</surname><given-names>LK</given-names></name></person-group><article-title>Onboard measurement and warning module for irregular vehicle behavior</article-title><source><italic>IEEE Transactions on Intelligent Transportation Systems</italic></source><year>2008</year><volume>9</volume><issue>3</issue><fpage>501</fpage><lpage>513</lpage><pub-id pub-id-type="other">2-s2.0-50649121833</pub-id></element-citation></ref><ref id="B7"><label>7</label><element-citation publication-type="journal"><person-group person-group-type="author"><name><surname>Kesting</surname><given-names>A</given-names></name><name><surname>Treiber</surname><given-names>M</given-names></name></person-group><article-title>Calibrating car-following models by using trajectory data methodological study</article-title><source><italic>Transportation Research Record</italic></source><year>2008</year><issue>2088</issue><fpage>148</fpage><lpage>156</lpage><pub-id pub-id-type="other">2-s2.0-63849322364</pub-id></element-citation></ref><ref id="B8"><label>8</label><element-citation publication-type="confproc"><person-group person-group-type="author"><name><surname>El Faouzi</surname><given-names>NE</given-names></name><name><surname>Lefevre</surname><given-names>E</given-names></name></person-group><article-title>Classifiers and distance-based evidential fusion for road travel time estimation</article-title><conf-name>Proceedings of the 4th International Conference on Multisensor, Multisource Information Fusion: Architectures, Algorithms, and Applications</conf-name><conf-date>2006</conf-date><conf-loc>Orlando, Fla, USA</conf-loc><publisher-name>SPIE</publisher-name><fpage>1</fpage><lpage>16</lpage></element-citation></ref><ref id="B9"><label>9</label><element-citation publication-type="journal"><person-group person-group-type="author"><name><surname>Kong</surname><given-names>QJ</given-names></name><name><surname>Li</surname><given-names>Z</given-names></name><name><surname>Chen</surname><given-names>Y</given-names></name><name><surname>Liu</surname><given-names>Y</given-names></name></person-group><article-title>An approach to Urban traffic state estimation by fusing multisource information</article-title><source><italic>IEEE Transactions on Intelligent Transportation Systems</italic></source><year>2009</year><volume>10</volume><issue>3</issue><fpage>499</fpage><lpage>511</lpage><pub-id pub-id-type="other">2-s2.0-70349178654</pub-id></element-citation></ref><ref id="B10"><label>10</label><element-citation publication-type="journal"><person-group person-group-type="author"><name><surname>Qiu</surname><given-names>TZ</given-names></name><name><surname>Lu</surname><given-names>XY</given-names></name><name><surname>Chow</surname><given-names>AHF</given-names></name><name><surname>Shladover</surname><given-names>SE</given-names></name></person-group><article-title>Estimation of freeway traffic density with loop detector and probe vehicle data</article-title><source><italic>Transportation Research Record</italic></source><year>2010</year><issue>2178</issue><fpage>21</fpage><lpage>29</lpage><pub-id pub-id-type="other">2-s2.0-78951496021</pub-id></element-citation></ref><ref id="B11"><label>11</label><element-citation publication-type="journal"><person-group person-group-type="author"><name><surname>Kim</surname><given-names>K</given-names></name><name><surname>Pant</surname><given-names>P</given-names></name><name><surname>Yamashita</surname><given-names>EY</given-names></name></person-group><article-title>Hit-and-run crashes: use of rough set analysis with logistic regression to capture critical attributes and determinants</article-title><source><italic>Transportation Research Record</italic></source><year>2008</year><issue>2083</issue><fpage>114</fpage><lpage>121</lpage><pub-id pub-id-type="other">2-s2.0-63849095121</pub-id></element-citation></ref><ref id="B12"><label>12</label><element-citation publication-type="journal"><person-group person-group-type="author"><name><surname>Van Lint</surname><given-names>JWC</given-names></name></person-group><article-title>Online learning solutions for freeway travel time prediction</article-title><source><italic>IEEE Transactions on Intelligent Transportation Systems</italic></source><year>2008</year><volume>9</volume><issue>1</issue><fpage>38</fpage><lpage>47</lpage><pub-id pub-id-type="other">2-s2.0-40349102104</pub-id></element-citation></ref><ref id="B13"><label>13</label><element-citation publication-type="journal"><person-group person-group-type="author"><name><surname>Niittymaki</surname><given-names>J</given-names></name><name><surname>Kikuchi</surname><given-names>S</given-names></name></person-group><article-title>Application of fuzzy logic to the control of a pedestrian crossing signal</article-title><source><italic>Transportation Research Record</italic></source><year>1998</year><issue>1651</issue><fpage>30</fpage><lpage>38</lpage><pub-id pub-id-type="other">2-s2.0-0012058003</pub-id></element-citation></ref><ref id="B14"><label>14</label><element-citation publication-type="confproc"><person-group person-group-type="author"><name><surname>Xia</surname><given-names>Y</given-names></name><name><surname>Ye</surname><given-names>Z</given-names></name><name><surname>Fang</surname><given-names>Y</given-names></name><name><surname>Zhang</surname><given-names>T</given-names></name></person-group><article-title>Parallelized extraction of traffic state estimation rules based on
bootstrapping rough set</article-title><conf-name>Ninth International Conference on Fuzzy Systems and Knowledge Discovery</conf-name><conf-date>2012</conf-date><conf-loc>Chongqing, China</conf-loc><fpage>1548</fpage><lpage>1552</lpage></element-citation></ref><ref id="B15"><label>15</label><element-citation publication-type="journal"><person-group person-group-type="author"><name><surname>Wang</surname><given-names>S</given-names></name><name><surname>Armstrong</surname><given-names>MP</given-names></name></person-group><article-title>A theoretical approach to the use of cyberinfrastructure in geographical analysis</article-title><source><italic>International Journal of Geographical Information Science</italic></source><year>2009</year><volume>23</volume><issue>2</issue><fpage>169</fpage><lpage>193</lpage><pub-id pub-id-type="other">2-s2.0-62149136702</pub-id></element-citation></ref><ref id="B16"><label>16</label><element-citation publication-type="journal"><person-group person-group-type="author"><name><surname>Xia</surname><given-names>Y</given-names></name><name><surname>Kuang</surname><given-names>L</given-names></name><name><surname>Li</surname><given-names>X</given-names></name></person-group><article-title>Accelerating geospatial analysis on GPUs using CUDA</article-title><source><italic>Journal of Zhejiang University C</italic></source><year>2011</year><volume>12</volume><issue>12</issue><fpage>990</fpage><lpage>999</lpage></element-citation></ref><ref id="B17"><label>17</label><element-citation publication-type="book"><person-group person-group-type="author"><name><surname>Aiken</surname><given-names>R</given-names></name><name><surname>Carey</surname><given-names>M</given-names></name><name><surname>Carpenter</surname><given-names>B</given-names></name><etal></etal></person-group><article-title>Network Policy and Services</article-title><source><italic>A Report of a Workshop on Middleware</italic></source><year>2000</year><issue>RFC, 2768</issue><publisher-name>The Internet Tasking Force</publisher-name></element-citation></ref><ref id="B18"><label>18</label><element-citation publication-type="journal"><person-group person-group-type="author"><name><surname>O’Cearbhaill</surname><given-names>EA</given-names></name><name><surname>O’Mahony</surname><given-names>M</given-names></name></person-group><article-title>Parallel implementation of a transportation network model</article-title><source><italic>Journal of Parallel and Distributed Computing</italic></source><year>2005</year><volume>65</volume><issue>1</issue><fpage>1</fpage><lpage>14</lpage><pub-id pub-id-type="other">2-s2.0-11444265511</pub-id></element-citation></ref><ref id="B19"><label>19</label><element-citation publication-type="confproc"><person-group person-group-type="author"><name><surname>Krishnan</surname><given-names>R</given-names></name><name><surname>Hodge</surname><given-names>V</given-names></name><name><surname>Austin</surname><given-names>J</given-names></name><name><surname>Polak</surname><given-names>JW</given-names></name></person-group><article-title>A computationally efficient method for online identification of
traffic control intervention measures</article-title><conf-name>Proceedings of the 42nd Annual Meeting of the Universities Transport Study Group</conf-name><conf-date>2010</conf-date><conf-loc>Plymouth, UK</conf-loc><fpage>1</fpage><lpage>11</lpage></element-citation></ref><ref id="B20"><label>20</label><element-citation publication-type="journal"><person-group person-group-type="author"><name><surname>Wang</surname><given-names>F-Y</given-names></name></person-group><article-title>Parallel control and management for intelligent transportation systems: concepts, architectures, and applications</article-title><source><italic>IEEE Transactions on Intelligent Transportation Systems</italic></source><year>2010</year><volume>11</volume><issue>3</issue><fpage>630</fpage><lpage>638</lpage><pub-id pub-id-type="other">2-s2.0-77956338565</pub-id></element-citation></ref><ref id="B21"><label>21</label><element-citation publication-type="confproc"><person-group person-group-type="author"><name><surname>Xia</surname><given-names>Y</given-names></name><name><surname>Fang</surname><given-names>Y</given-names></name><name><surname>Ye</surname><given-names>Z</given-names></name></person-group><article-title>MPI-based twi-extraction of traffic state evaluation rules</article-title><conf-name>Proceedings of the 4th International Conference on Cyber-Enabled Distributed Computing and Knowledge Discovery</conf-name><conf-date>2012</conf-date><conf-loc>Sanya, China</conf-loc><publisher-name>IEEE</publisher-name><fpage>1</fpage><lpage>4</lpage></element-citation></ref><ref id="B22"><label>22</label><element-citation publication-type="book"><person-group person-group-type="author"><name><surname>Goldreich</surname><given-names>O</given-names></name></person-group><source><italic>Computational Complexity: A Conceptual Perspective</italic></source><year>2008</year><publisher-loc>Cambridge, U.K</publisher-loc><publisher-name>Cambridge University Press</publisher-name></element-citation></ref><ref id="B23"><label>23</label><element-citation publication-type="other"><person-group person-group-type="author"><name><surname>Wang</surname><given-names>S</given-names></name><name><surname>Armstrong</surname><given-names>MP</given-names></name></person-group><article-title>A Theory of the Spatial Computational Domain</article-title><comment>GeoComputation, Ann Arbor, Mich, USA, 2005</comment></element-citation></ref><ref id="B24"><label>24</label><element-citation publication-type="journal"><person-group person-group-type="author"><name><surname>Jackins</surname><given-names>CL</given-names></name><name><surname>Tanimoto</surname><given-names>SL</given-names></name></person-group><article-title>Oct-trees and their use in representing three-dimensional objects</article-title><source><italic>Computer Graphics and Image Processing</italic></source><year>1980</year><volume>14</volume><issue>3</issue><fpage>249</fpage><lpage>270</lpage><pub-id pub-id-type="other">2-s2.0-0019229538</pub-id></element-citation></ref><ref id="B25"><label>25</label><element-citation publication-type="journal"><person-group person-group-type="author"><name><surname>Braun</surname><given-names>TD</given-names></name><name><surname>Siegel</surname><given-names>HJ</given-names></name><name><surname>Beck</surname><given-names>N</given-names></name><etal></etal></person-group><article-title>A comparison of eleven static heuristics for mapping a class of
independent tasks onto heterogeneous distributed computing systems</article-title><source><italic>Journal of Parallel and Distributed Computing</italic></source><year>2001</year><volume>61</volume><issue>6</issue><fpage>810</fpage><lpage>837</lpage><pub-id pub-id-type="other">2-s2.0-0038031248</pub-id></element-citation></ref><ref id="B26"><label>26</label><element-citation publication-type="journal"><person-group person-group-type="author"><name><surname>Tchrakian</surname><given-names>T</given-names></name><name><surname>Basu</surname><given-names>B</given-names></name><name><surname>O'Mahony</surname><given-names>M</given-names></name></person-group><article-title>Real-time traffic flow forecasting using spectral analysis</article-title><source><italic>IEEE Transactions on Intelligent Transportation Systems</italic></source><year>2012</year><volume>13</volume><issue>2</issue><fpage>519</fpage><lpage>526</lpage></element-citation></ref><ref id="B27"><label>27</label><element-citation publication-type="journal"><person-group person-group-type="author"><name><surname>Fox</surname><given-names>GC</given-names></name><name><surname>Gannon</surname><given-names>D</given-names></name></person-group><article-title>Special issue: workflow in grid systems</article-title><source><italic>Concurrency Computation Practice and Experience</italic></source><year>2006</year><volume>18</volume><issue>10</issue><fpage>1009</fpage><lpage>1019</lpage><pub-id pub-id-type="other">2-s2.0-33747650473</pub-id></element-citation></ref><ref id="B28"><label>28</label><element-citation publication-type="confproc"><person-group person-group-type="author"><name><surname>Giacobbe</surname><given-names>M</given-names></name><name><surname>Puliafito</surname><given-names>A</given-names></name><name><surname>Villari</surname><given-names>M</given-names></name></person-group><article-title>A service oriented system for fleet management and traffic monitoring</article-title><conf-name>Proceedings of the 15th IEEE Symposium on Computers and Communications, (ISCC '10)</conf-name><conf-date>June 2010</conf-date><conf-loc>ita</conf-loc><fpage>784</fpage><lpage>786</lpage><pub-id pub-id-type="other">2-s2.0-77956538404</pub-id></element-citation></ref><ref id="B29"><label>29</label><element-citation publication-type="book"><person-group person-group-type="author"><name><surname>Shafer</surname><given-names>G</given-names></name></person-group><source><italic>A Mathematical Theory of Evidence</italic></source><year>1976</year><publisher-loc>Princeton, NJ, USA</publisher-loc><publisher-name>Princeton University Press</publisher-name></element-citation></ref><ref id="B30"><label>30</label><element-citation publication-type="journal"><person-group person-group-type="author"><name><surname>Smets</surname><given-names>P</given-names></name><name><surname>Kennes</surname><given-names>R</given-names></name></person-group><article-title>The transferable belief model</article-title><source><italic>Artificial Intelligence</italic></source><year>1994</year><volume>66</volume><issue>2</issue><fpage>191</fpage><lpage>234</lpage><pub-id pub-id-type="other">2-s2.0-0028406490</pub-id></element-citation></ref><ref id="B31"><label>31</label><element-citation publication-type="confproc"><person-group person-group-type="author"><name><surname>Xia</surname><given-names>Y</given-names></name><name><surname>Liu</surname><given-names>Y</given-names></name><name><surname>Ye</surname><given-names>Z</given-names></name><name><surname>Wu</surname><given-names>W</given-names></name><name><surname>Zhu</surname><given-names>M</given-names></name></person-group><article-title>Quadtree-based domain decomposition for parallel map-matching on GPS data</article-title><conf-name>Proceedings of the 15th International Conference on Intelligent Transportation Systems Conference</conf-name><conf-date>2012</conf-date><conf-loc>Anchorage, Alaska, USA</conf-loc><publisher-name>IEEE</publisher-name><fpage>808</fpage><lpage>813</lpage></element-citation></ref></ref-list></back><floats-group><fig id="fig1" orientation="portrait" position="float"><label>Figure 1</label><caption><p>The Cyber-ITS framework synthesizes CI and data analysis in the context of ITS.</p></caption><graphic xlink:href="TSWJ2013-462846.001"></graphic></fig><fig id="fig2" orientation="portrait" position="float"><label>Figure 2</label><caption><p>ITS computational domain projects heterogeneous traffic data into three-dimensional space.</p></caption><graphic xlink:href="TSWJ2013-462846.002"></graphic></fig><fig id="fig3" orientation="portrait" position="float"><label>Figure 3</label><caption><p>ITS computational domain is decomposed by octree.</p></caption><graphic xlink:href="TSWJ2013-462846.003"></graphic></fig><fig id="fig4" orientation="portrait" position="float"><label>Figure 4</label><caption><p>A common portal system serves for Cyber-ITS-based traffic state estimation and traffic flow forecasting.</p></caption><graphic xlink:href="TSWJ2013-462846.004"></graphic></fig><fig id="fig5" orientation="portrait" position="float"><label>Figure 5</label><caption><p>Flowchart of traffic state estimation consists of data smoothing, features estimation, features fusion, and decision making.</p></caption><graphic xlink:href="TSWJ2013-462846.005"></graphic></fig><fig id="fig6" orientation="portrait" position="float"><label>Figure 6</label><caption><p>Accuracy rate of traffic state estimation is tested using SCATS data, GPS data, and their fusion.</p></caption><graphic xlink:href="TSWJ2013-462846.006"></graphic></fig><fig id="fig7" orientation="portrait" position="float"><label>Figure 7</label><caption><p>Speedup of parallelized process is tested on 1, 2, 4, 8, 16, and 32 computing nodes.</p></caption><graphic xlink:href="TSWJ2013-462846.007"></graphic></fig><table-wrap id="tab1" orientation="portrait" position="float"><label>Table 1</label><caption><p>Average execution time and speedup using 1, 2, 4, 8, 16, and 32 computing nodes.</p></caption><table frame="hsides" rules="groups"><thead><tr><th align="left" rowspan="1" colspan="1">Number of computing nodes</th><th align="center" rowspan="1" colspan="1">Average execution time/seconds</th><th align="center" rowspan="1" colspan="1">Speedup</th></tr></thead><tbody><tr><td align="left" rowspan="1" colspan="1">1</td><td align="center" rowspan="1" colspan="1">927.6</td><td align="center" rowspan="1" colspan="1">1</td></tr><tr><td align="left" rowspan="1" colspan="1">2</td><td align="center" rowspan="1" colspan="1">492.9</td><td align="center" rowspan="1" colspan="1">1.88</td></tr><tr><td align="left" rowspan="1" colspan="1">4</td><td align="center" rowspan="1" colspan="1">277.3</td><td align="center" rowspan="1" colspan="1">3.34</td></tr><tr><td align="left" rowspan="1" colspan="1">8</td><td align="center" rowspan="1" colspan="1">170.6</td><td align="center" rowspan="1" colspan="1">5.44</td></tr><tr><td align="left" rowspan="1" colspan="1">16</td><td align="center" rowspan="1" colspan="1">119.2</td><td align="center" rowspan="1" colspan="1">7.78</td></tr><tr><td align="left" rowspan="1" colspan="1">32</td><td align="center" rowspan="1" colspan="1">100.9</td><td align="center" rowspan="1" colspan="1">9.19</td></tr></tbody></table></table-wrap></floats-group></pmc></record>Pour manipuler ce document sous Unix (Dilib)
EXPLOR_STEP=$WICRI_ROOT/Ticri/CIDE/explor/CyberinfraV1/Data/Pmc/Corpus
HfdSelect -h $EXPLOR_STEP/biblio.hfd -nk 000650 | SxmlIndent | more
Ou
HfdSelect -h $EXPLOR_AREA/Data/Pmc/Corpus/biblio.hfd -nk 000650 | SxmlIndent | more
Pour mettre un lien sur cette page dans le réseau Wicri
{{Explor lien
|wiki= Ticri/CIDE
|area= CyberinfraV1
|flux= Pmc
|étape= Corpus
|type= RBID
|clé= PMC:3671550
|texte= A Cyber-ITS Framework for Massive Traffic Data Analysis Using Cyber Infrastructure
}}
Pour générer des pages wiki
HfdIndexSelect -h $EXPLOR_AREA/Data/Pmc/Corpus/RBID.i -Sk "pubmed:23766690" \
| HfdSelect -Kh $EXPLOR_AREA/Data/Pmc/Corpus/biblio.hfd \
| NlmPubMed2Wicri -a CyberinfraV1
| This area was generated with Dilib version V0.6.25. |  |