Pub Date : 2019-10-01DOI: 10.1109/ds-rt47707.2019.8958705
{"title":"DS-RT 2019 Author Index","authors":"","doi":"10.1109/ds-rt47707.2019.8958705","DOIUrl":"https://doi.org/10.1109/ds-rt47707.2019.8958705","url":null,"abstract":"","PeriodicalId":377914,"journal":{"name":"2019 IEEE/ACM 23rd International Symposium on Distributed Simulation and Real Time Applications (DS-RT)","volume":"95 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2019-10-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"124671209","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Pub Date : 2019-10-01DOI: 10.1109/DS-RT47707.2019.8958660
Desheng Fu, Marcus O'Connor, Matthias Becker, H. Szczerbicka
A novel way of distributed discrete event simulation, called approximate distributed discrete event simulation, is presented in this paper. Compared with the classic simulation, the models for approximate simulation give some kind of free margin to the simulator during the execution. This can be used in some cases to reduce the overhead of the simulation, especially the execution time. Since the margin can be adjusted arbitrarily in the range, a trade-off between the simulation precision and the execution time can be achieved this way. It’s well known that the execution time of distributed discrete event simulation can’t be reduced significantly compared with a sequential simulation when the logical processes are tightly coupled and the lookahead is very short. In this study, a framework of approximate distributed discrete event simulation with some novel algorithms is developed, which is aimed to provide a longer look-ahead and further the trade-off between the simulation precision and the execution time using the free margin provided by the model.
{"title":"Approximate Distributed Discrete Event Simulation using Semi-Conservative Look-Ahead Estimation","authors":"Desheng Fu, Marcus O'Connor, Matthias Becker, H. Szczerbicka","doi":"10.1109/DS-RT47707.2019.8958660","DOIUrl":"https://doi.org/10.1109/DS-RT47707.2019.8958660","url":null,"abstract":"A novel way of distributed discrete event simulation, called approximate distributed discrete event simulation, is presented in this paper. Compared with the classic simulation, the models for approximate simulation give some kind of free margin to the simulator during the execution. This can be used in some cases to reduce the overhead of the simulation, especially the execution time. Since the margin can be adjusted arbitrarily in the range, a trade-off between the simulation precision and the execution time can be achieved this way. It’s well known that the execution time of distributed discrete event simulation can’t be reduced significantly compared with a sequential simulation when the logical processes are tightly coupled and the lookahead is very short. In this study, a framework of approximate distributed discrete event simulation with some novel algorithms is developed, which is aimed to provide a longer look-ahead and further the trade-off between the simulation precision and the execution time using the free margin provided by the model.","PeriodicalId":377914,"journal":{"name":"2019 IEEE/ACM 23rd International Symposium on Distributed Simulation and Real Time Applications (DS-RT)","volume":"19 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2019-10-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"126149642","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Pub Date : 2019-10-01DOI: 10.1109/DS-RT47707.2019.8958706
A. Chodorek, R. Chodorek, K. Wajda
In this paper we propose a flying IoT system designed to monitor parking lot. The system is composed of a flying mobile station and a terrestrial station. The mobile station consists of visual monitoring camera associated with air quality monitoring sensors, mounted on a Turnigy SK450 quad copter controlled with Pixhawk autopilot hardware. Data gathered from the monitoring system are transmitted to an IoT broker running on a Raspberry Pi 3+ microcontroller, also mounted on a drone, that aggregates data into a common flow and retransmits them to the terrestrial station. The transmission system was build according to WebRTC architecture. In order to assure separation of the production network (for transmission of application data) and the management network (for management and control purposes), two different transmission channels are used: one for the WebRTC transmission and the other for controlling the drone. The paper includes a description of the system and the results of field trials carried out on the parking lot of the AGH University of technology.
{"title":"Media and non-media WebRTC communication between a terrestrial station and a drone: the case of a flying IoT system to monitor parking","authors":"A. Chodorek, R. Chodorek, K. Wajda","doi":"10.1109/DS-RT47707.2019.8958706","DOIUrl":"https://doi.org/10.1109/DS-RT47707.2019.8958706","url":null,"abstract":"In this paper we propose a flying IoT system designed to monitor parking lot. The system is composed of a flying mobile station and a terrestrial station. The mobile station consists of visual monitoring camera associated with air quality monitoring sensors, mounted on a Turnigy SK450 quad copter controlled with Pixhawk autopilot hardware. Data gathered from the monitoring system are transmitted to an IoT broker running on a Raspberry Pi 3+ microcontroller, also mounted on a drone, that aggregates data into a common flow and retransmits them to the terrestrial station. The transmission system was build according to WebRTC architecture. In order to assure separation of the production network (for transmission of application data) and the management network (for management and control purposes), two different transmission channels are used: one for the WebRTC transmission and the other for controlling the drone. The paper includes a description of the system and the results of field trials carried out on the parking lot of the AGH University of technology.","PeriodicalId":377914,"journal":{"name":"2019 IEEE/ACM 23rd International Symposium on Distributed Simulation and Real Time Applications (DS-RT)","volume":"49 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2019-10-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"127327974","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Pub Date : 2019-10-01DOI: 10.1109/ds-rt47707.2019.8958679
{"title":"DS-RT 2019 Table of Contents","authors":"","doi":"10.1109/ds-rt47707.2019.8958679","DOIUrl":"https://doi.org/10.1109/ds-rt47707.2019.8958679","url":null,"abstract":"","PeriodicalId":377914,"journal":{"name":"2019 IEEE/ACM 23rd International Symposium on Distributed Simulation and Real Time Applications (DS-RT)","volume":"18 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2019-10-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"133910124","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Pub Date : 2019-10-01DOI: 10.1109/DS-RT47707.2019.8958668
A. D. Paola, A. Giammanco, G. Re, M. Morana
Several issues related to Smart City development require the knowledge of accurate human mobility models, such as in the case of urban development planning or evacuation strategy definition. Nevertheless, the exploitation of real data about users’ mobility results in severe threats to their privacy, since it allows to infer highly sensitive information. On the contrary, the adoption of simulation tools to handle mobility models allows to neglect privacy during the design of location-based services. In this work, we propose a simulation tool capable of generating synthetic datasets of human mobility traces; then, we exploit them to evaluate the effectiveness of algorithms which aim to detect Points of Interest visited by users of a Smart Campus. Our simulator exploits an activity-based mobility model, thus it is based on the assumption that mobility of campus users is motivated by the activities they plan to perform. It is capable of simulating the weekly repetitiveness of human behavior and to model different mobility profiles for each day of the week through a fifth-order Markov model.
{"title":"Human Mobility Simulator for Smart Applications","authors":"A. D. Paola, A. Giammanco, G. Re, M. Morana","doi":"10.1109/DS-RT47707.2019.8958668","DOIUrl":"https://doi.org/10.1109/DS-RT47707.2019.8958668","url":null,"abstract":"Several issues related to Smart City development require the knowledge of accurate human mobility models, such as in the case of urban development planning or evacuation strategy definition. Nevertheless, the exploitation of real data about users’ mobility results in severe threats to their privacy, since it allows to infer highly sensitive information. On the contrary, the adoption of simulation tools to handle mobility models allows to neglect privacy during the design of location-based services. In this work, we propose a simulation tool capable of generating synthetic datasets of human mobility traces; then, we exploit them to evaluate the effectiveness of algorithms which aim to detect Points of Interest visited by users of a Smart Campus. Our simulator exploits an activity-based mobility model, thus it is based on the assumption that mobility of campus users is motivated by the activities they plan to perform. It is capable of simulating the weekly repetitiveness of human behavior and to model different mobility profiles for each day of the week through a fifth-order Markov model.","PeriodicalId":377914,"journal":{"name":"2019 IEEE/ACM 23rd International Symposium on Distributed Simulation and Real Time Applications (DS-RT)","volume":"11 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2019-10-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"123459824","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Pub Date : 2019-10-01DOI: 10.1109/DS-RT47707.2019.8958690
M. Abadeer, S. Gorlatch
Simulating large crowds of individuals is socially important, e.g., for developing and studying evacuation or rescuing in dangerous situations. Such simulations remain complex due to the scalability challenge: simulating thousands of virtual characters is computationally expensive, especially when taking into account psychological factors and group-specific behavior that play a crucial role, e.g., in panic situations and highly crowded environments. In this paper, we make two new contributions: 1) we extend the HiDAC agent-based modeling approach with the aspects of group formation and movement, and 2) we implement our approach within the CrowdSim system, including the possibility to distribute the simulation process across several compute servers for better performance. We report experimental results on scaling the distributed simulation of a real-world evacuation scenario in a building using several compute servers.
{"title":"Distributed Simulation of Crowds with Groups in CrowdSim","authors":"M. Abadeer, S. Gorlatch","doi":"10.1109/DS-RT47707.2019.8958690","DOIUrl":"https://doi.org/10.1109/DS-RT47707.2019.8958690","url":null,"abstract":"Simulating large crowds of individuals is socially important, e.g., for developing and studying evacuation or rescuing in dangerous situations. Such simulations remain complex due to the scalability challenge: simulating thousands of virtual characters is computationally expensive, especially when taking into account psychological factors and group-specific behavior that play a crucial role, e.g., in panic situations and highly crowded environments. In this paper, we make two new contributions: 1) we extend the HiDAC agent-based modeling approach with the aspects of group formation and movement, and 2) we implement our approach within the CrowdSim system, including the possibility to distribute the simulation process across several compute servers for better performance. We report experimental results on scaling the distributed simulation of a real-world evacuation scenario in a building using several compute servers.","PeriodicalId":377914,"journal":{"name":"2019 IEEE/ACM 23rd International Symposium on Distributed Simulation and Real Time Applications (DS-RT)","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2019-10-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"130663945","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Pub Date : 2019-10-01DOI: 10.1109/DS-RT47707.2019.8958704
Insaf Sagaama, Amine Kchiche, Wassim Trojet, F. Kamoun
In recent years, the diffusion of electric vehicles(EVs) is of great importance in the road transport and automotive sectors. Reducing electricity consumption and increasing battery autonomy are actually motivating vehicle manufacturers to focus their attention on the EV concept. The evaluation of EV performance through realistic scenarios in traffic simulations is still a key issue. In fact, the road traffic Simulator Simulation of Urban Mobility (SUMO) integrates an energy model for calculating the EV energy consumption. However, this model underestimates the energy consumption values in the real world. In this paper, we intend to investigate the energy consumption models existing in the literature. Then, we assess the performance of the existing energy model in SUMO through a set of simulation scenarios. Finally, we present the main requirements for a realistic, accurate and scalable energy model to estimate the instantaneous energy consumption for EVs.
{"title":"Evaluation of the Energy Consumption Model Performance for Electric Vehicles in SUMO","authors":"Insaf Sagaama, Amine Kchiche, Wassim Trojet, F. Kamoun","doi":"10.1109/DS-RT47707.2019.8958704","DOIUrl":"https://doi.org/10.1109/DS-RT47707.2019.8958704","url":null,"abstract":"In recent years, the diffusion of electric vehicles(EVs) is of great importance in the road transport and automotive sectors. Reducing electricity consumption and increasing battery autonomy are actually motivating vehicle manufacturers to focus their attention on the EV concept. The evaluation of EV performance through realistic scenarios in traffic simulations is still a key issue. In fact, the road traffic Simulator Simulation of Urban Mobility (SUMO) integrates an energy model for calculating the EV energy consumption. However, this model underestimates the energy consumption values in the real world. In this paper, we intend to investigate the energy consumption models existing in the literature. Then, we assess the performance of the existing energy model in SUMO through a set of simulation scenarios. Finally, we present the main requirements for a realistic, accurate and scalable energy model to estimate the instantaneous energy consumption for EVs.","PeriodicalId":377914,"journal":{"name":"2019 IEEE/ACM 23rd International Symposium on Distributed Simulation and Real Time Applications (DS-RT)","volume":"79 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2019-10-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"126887741","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Computing platforms for embedded systems are increasingly being transformed into multi/many-core platforms because embedded systems have become extensive, complex, and automated. In the case of an autonomous driving system, various applications are simultaneously running, and low power consumption and large-scale calculation are required. Many-core processors with a multiple instruction, multiple data (MIMD) architecture can meet these requirements. This paper proposes a scheduling algorithm for an automotive driving system expressed in a directed acyclic graph (DAG) and we use Kalray MPPA-256 as the target many-core processor. On the basis of the architecture of Kalray MPPA-256, task processing that requires large-scale calculation and intercore communication is performed while avoiding communication contention by using a proposed grouping computational resource. In addition, we propose a scheduling method for a multi-rate DAG which is a DAG with multiple periods. This method generates a DAG task in a hyperperiod and schedules the DAG with dependency on tasks that have been released closely. The formulas for prioritization and processor selection are proposed for various generated tasks in a hyperperiod. Evaluation results show that the proposed algorithm is superior to existing DAG scheduling algorithms with regard to schedulability and deadline miss ratio.
{"title":"Multi-rate DAG Scheduling Considering Communication Contention for NoC-based Embedded Many-core Processor","authors":"Shingo Igarashi, Yuto Kitagawa, Tasuku Ishigooka, Tatsuya Horiguchi, Takuya Azumi","doi":"10.1109/DS-RT47707.2019.8958696","DOIUrl":"https://doi.org/10.1109/DS-RT47707.2019.8958696","url":null,"abstract":"Computing platforms for embedded systems are increasingly being transformed into multi/many-core platforms because embedded systems have become extensive, complex, and automated. In the case of an autonomous driving system, various applications are simultaneously running, and low power consumption and large-scale calculation are required. Many-core processors with a multiple instruction, multiple data (MIMD) architecture can meet these requirements. This paper proposes a scheduling algorithm for an automotive driving system expressed in a directed acyclic graph (DAG) and we use Kalray MPPA-256 as the target many-core processor. On the basis of the architecture of Kalray MPPA-256, task processing that requires large-scale calculation and intercore communication is performed while avoiding communication contention by using a proposed grouping computational resource. In addition, we propose a scheduling method for a multi-rate DAG which is a DAG with multiple periods. This method generates a DAG task in a hyperperiod and schedules the DAG with dependency on tasks that have been released closely. The formulas for prioritization and processor selection are proposed for various generated tasks in a hyperperiod. Evaluation results show that the proposed algorithm is superior to existing DAG scheduling algorithms with regard to schedulability and deadline miss ratio.","PeriodicalId":377914,"journal":{"name":"2019 IEEE/ACM 23rd International Symposium on Distributed Simulation and Real Time Applications (DS-RT)","volume":"159 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2019-10-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"123019529","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Pub Date : 2019-10-01DOI: 10.1109/ds-rt47707.2019.8958681
Y. Sergeyev
In this lecture, a recent computational methodology is described. It has been introduced with the intention to allow one to work with infinities and infinitesimals numerically in a unique computational framework. It is based on the principle ‘The part is less than the whole’ applied to all quantities (finite, infinite, and infinitesimal) and to all sets and processes (finite and infinite). The methodology uses as a computational device the Infinity Computer (patented in USA and EU) working numerically with infinite and infinitesimal numbers that can be written in a positional system with an infinite radix. On a number of examples (numerical differentiation, divergent series, ordinary differential equations, fractals, set theory, etc.) it is shown that the new approach can be useful from both theoretical and computational points of view. The main attention is dedicated to applications in optimization (local, global, and multi-objective). The accuracy of the obtained results is continuously compared with results obtained by traditional tools used to work with mathematical objects involving infinity. The Infinity Calculator working with infinities and infinitesimals numerically is shown during the lecture. For more information see http://www.theinfinitycomputer.com and this survey: Sergeyev Ya.D. Numerical infinities and infinitesimals: Methodology, applications, and repercussions on two Hilbert problems, EMS Surveys in Mathematical Sciences, 2017, 4(2), 219–320. For more information see http://www.theinfinitycomputer.com and this survey: Sergeyev Ya.D. Numerical infinities and infinitesimals: Methodology, applications, and repercussions on two Hilbert problems, EMS Surveys in Mathematical Sciences, 2017, 4(2), 219–320.
{"title":"The Infinity Computer for Optimization and Not Only","authors":"Y. Sergeyev","doi":"10.1109/ds-rt47707.2019.8958681","DOIUrl":"https://doi.org/10.1109/ds-rt47707.2019.8958681","url":null,"abstract":"In this lecture, a recent computational methodology is described. It has been introduced with the intention to allow one to work with infinities and infinitesimals numerically in a unique computational framework. It is based on the principle ‘The part is less than the whole’ applied to all quantities (finite, infinite, and infinitesimal) and to all sets and processes (finite and infinite). The methodology uses as a computational device the Infinity Computer (patented in USA and EU) working numerically with infinite and infinitesimal numbers that can be written in a positional system with an infinite radix. On a number of examples (numerical differentiation, divergent series, ordinary differential equations, fractals, set theory, etc.) it is shown that the new approach can be useful from both theoretical and computational points of view. The main attention is dedicated to applications in optimization (local, global, and multi-objective). The accuracy of the obtained results is continuously compared with results obtained by traditional tools used to work with mathematical objects involving infinity. The Infinity Calculator working with infinities and infinitesimals numerically is shown during the lecture. For more information see http://www.theinfinitycomputer.com and this survey: Sergeyev Ya.D. Numerical infinities and infinitesimals: Methodology, applications, and repercussions on two Hilbert problems, EMS Surveys in Mathematical Sciences, 2017, 4(2), 219–320. For more information see http://www.theinfinitycomputer.com and this survey: Sergeyev Ya.D. Numerical infinities and infinitesimals: Methodology, applications, and repercussions on two Hilbert problems, EMS Surveys in Mathematical Sciences, 2017, 4(2), 219–320.","PeriodicalId":377914,"journal":{"name":"2019 IEEE/ACM 23rd International Symposium on Distributed Simulation and Real Time Applications (DS-RT)","volume":"7 3 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2019-10-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"123628453","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Pub Date : 2019-10-01DOI: 10.1109/DS-RT47707.2019.8958685
Giuseppe Portaluri, Marialaura Tamburello, S. Giordano
We present a vertical integration of a real-time Industrial Internet of Things environment with Cloud computing functionalities. We designed our testbed to implement self-adaptive wings for motorbikes using pressure values sensed in specific locations of the motorbike as input data collected exploiting open-hardware devices called OpenMotes which communicate through a low-power, delay-constrained wireless network based on the 6LoWPAN protocol stack. Our real-time on-board unit elaborates the data, and it computes the new angle of attack of two wings. The total response time of the system is in the order of 100 ms and meets the real-time requirements that constrains our scenario. Finally, we integrate our system with Cloud functionalities that we use for storing the acquired data on a time-series database.
{"title":"From Sensors to the Cloud: a Real-Time Use-case on Vertical Integration","authors":"Giuseppe Portaluri, Marialaura Tamburello, S. Giordano","doi":"10.1109/DS-RT47707.2019.8958685","DOIUrl":"https://doi.org/10.1109/DS-RT47707.2019.8958685","url":null,"abstract":"We present a vertical integration of a real-time Industrial Internet of Things environment with Cloud computing functionalities. We designed our testbed to implement self-adaptive wings for motorbikes using pressure values sensed in specific locations of the motorbike as input data collected exploiting open-hardware devices called OpenMotes which communicate through a low-power, delay-constrained wireless network based on the 6LoWPAN protocol stack. Our real-time on-board unit elaborates the data, and it computes the new angle of attack of two wings. The total response time of the system is in the order of 100 ms and meets the real-time requirements that constrains our scenario. Finally, we integrate our system with Cloud functionalities that we use for storing the acquired data on a time-series database.","PeriodicalId":377914,"journal":{"name":"2019 IEEE/ACM 23rd International Symposium on Distributed Simulation and Real Time Applications (DS-RT)","volume":"26 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2019-10-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"127058825","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
京公网安备 11010802042870号
京ICP备2023020795号-1
扫码关注我们
求助内容：
应助结果提醒方式：