The Experts below are selected from a list of 33774 Experts worldwide ranked by ideXlab platform
Arnaud De La Fortelle - One of the best experts on this subject based on the ideXlab platform.
-
ITSC - Priority-based coordination of autonomous and Legacy vehicles at intersection
17th International IEEE Conference on Intelligent Transportation Systems (ITSC), 2014Co-Authors: Xiangjun Qian, Fabien Moutarde, Jean Gregoire, Arnaud De La FortelleAbstract:Recently, researchers have proposed various intersection management techniques that enable autonomous vehicles to cross the intersection without traffic lights or stop signs. In particular, a priority-based coordination system with provable collision-free and deadlock-free features has been presented. In this paper, we extend the priority-based approach to Support Legacy vehicles without compromising above-mentioned features. We make the hypothesis that Legacy vehicles are able to keep a safe distance from their leading vehicles. Then we explore some special configurations of system that ensures the safe crossing of Legacy vehicles. We implement the extended system in a realistic traffic simulator SUMO. Simulations are performed to demonstrate the safety of the system.
-
Autonomous Intersection Management for Mixed Traffic Flow.
2014Co-Authors: Xiangjun Qian, Fabien Moutarde, Jean Gregoire, Arnaud De La FortelleAbstract:Recently, researchers have proposed various autonomous intersection management techniques that enable autonomous vehicles to cross the intersection without traffic lights or stop signs. In particular, a priority-based coordination system with provable collision-free and deadlock-free features has been presented. In this paper, we extend the priority-based approach to Support Legacy vehicles without compromising above-mentioned features. We make the hypothesis that Legacy vehicles are able to keep a safe distance from their leading vehicles. Then we explore some special configurations of system that ensures the safe crossing of Legacy vehicles. We implement the extended system in a realistic traffic simulator SUMO. Simulations are performed to demonstrate the safety and efficiency of the system.
-
Priority-based coordination of autonomous and Legacy vehicles at intersection
2014 17th IEEE International Conference on Intelligent Transportation Systems ITSC 2014, 2014Co-Authors: Xiangjun Qian, Fabien Moutarde, Jean Gregoire, Arnaud De La FortelleAbstract:Recently, researchers have proposed various autonomous intersection management techniques that enable autonomous vehicles to cross the intersection without traffic lights or stop signs. In particular, a priority-based coordination system with provable collision-free and deadlock-free features has been presented. In this paper, we extend the priority-based approach to Support Legacy vehicles without compromising above-mentioned features. We make the hypothesis that Legacy vehicles are able to keep a safe distance from their leading vehicles. Then we explore some special configurations of system that ensures the safe crossing of Legacy vehicles. We implement the extended system in a realistic traffic simulator SUMO. Simulations are performed to demonstrate the safety of the system.
Kenichi Matsumoto - One of the best experts on this subject based on the ideXlab platform.
-
Identifying Services in Procedural Programs for Migrating Legacy System to Service Oriented Architecture
International Journal of Information Systems in The Service Sector, 2011Co-Authors: Masahide Nakamur, Hiroshi Igaki, Takahiro Kimura, Kenichi MatsumotoAbstract:In order to Support Legacy migration to the service-oriented architecture (SOA), this paper presents a pragmatic method that derives candidates of services from procedural programs. In the SOA, every service is supposed to be a process (procedure) with (1) open interface, (2) self-containedness, and (3) coarse granularity for business. Such services are identified from the source code and its data flow diagram (DFD), by analyzing data and control dependencies among processes. Specifically, first the DFD must be obtained with reverse-engineering techniques. For each layer of the DFD, every data flow is classified into three categories. Using the data category and control among procedures, four types of dependency are categorized. Finally, six rules are applied that aggregate mutually dependent processes and extract them as a service. A case study with a liquor shop inventory control system extracts service candidates with various granularities.
-
extracting service candidates from procedural programs based on process dependency analysis
Asia-Pacific Services Computing Conference, 2009Co-Authors: Masahide Nakamura, Hiroshi Igaki, Takahiro Kimura, Kenichi MatsumotoAbstract:To Support Legacy migration to service-oriented architecture (SOA), this paper presents a method that derives candidates of SOA services from procedural programs. In SOA, every service is supposed to be a process (procedure) with (1) open interface, (2) self-containedness, (3) coarse granularity for business. We identify such services from the source code and its data flow diagram (DFD), by analyzing data and control dependency among processes. Specifically, we first obtain the DFD with reverse-engineering techniques. For each layer of the DFD we classify every data flow into three categories. Using the data category and control among procedures, we characterize four types of dependency. We finally apply six rules that aggregate mutually dependent procedures and extract them as a service. A case study with a liquor shop inventory control system extracts service candidates with various granularity.
-
APSCC - Extracting service candidates from procedural programs based on process dependency analysis
2009 IEEE Asia-Pacific Services Computing Conference (APSCC), 2009Co-Authors: Masahide Nakamura, Hiroshi Igaki, Takahiro Kimura, Kenichi MatsumotoAbstract:To Support Legacy migration to service-oriented architecture (SOA), this paper presents a method that derives candidates of SOA services from procedural programs. In SOA, every service is supposed to be a process (procedure) with (1) open interface, (2) self-containedness, (3) coarse granularity for business. We identify such services from the source code and its data flow diagram (DFD), by analyzing data and control dependency among processes. Specifically, we first obtain the DFD with reverse-engineering techniques. For each layer of the DFD we classify every data flow into three categories. Using the data category and control among procedures, we characterize four types of dependency. We finally apply six rules that aggregate mutually dependent procedures and extract them as a service. A case study with a liquor shop inventory control system extracts service candidates with various granularity.
Vijay Ganesh - One of the best experts on this subject based on the ideXlab platform.
-
EuroS&P - Reasoning about Probabilistic Defense Mechanisms against Remote Attacks
2017 IEEE European Symposium on Security and Privacy (EuroS&P), 2017Co-Authors: Martín Ochoa, Sebastian Banescu, Cynthia Disenfeld, Gilles Barthe, Vijay GaneshAbstract:Despite numerous countermeasures proposed by practitioners andresearchers, remote control-flow alteration of programs withmemory-safety vulnerabilities continues to be a realisticthreat. Guaranteeing that complex software is completely free of memory-safety vulnerabilities is extremely expensive. Probabilistic countermeasures that depend on random secret keys are interesting, because they are an inexpensive way to raise the bar for attackers who aim to exploit memory-safety vulnerabilities. Moreover, some countermeasures even Support Legacy systems. However, it is unclear how to quantify and compare the effectiveness of different probabilistic countermeasures or combinations of such countermeasures. In this paper we propose a methodology to rigorously derive security boundsfor probabilistic countermeasures. We argue that by representingsecurity notions in this setting as events in probabilistic games, similarly as done with cryptographic security definitions, concreteand asymptotic guarantees can be obtained against realisticattackers. These guarantees shed light on the effectiveness of singlecountermeasures and their composition and allow practitioners to moreprecisely gauge the risk of an attack.
-
Reasoning about Probabilistic Defense Mechanisms against Remote Attacks
arXiv: Cryptography and Security, 2017Co-Authors: Martín Ochoa, Sebastian Banescu, Cynthia Disenfeld, Gilles Barthe, Vijay GaneshAbstract:Despite numerous countermeasures proposed by practitioners and researchers, remote control-flow alteration of programs with memory-safety vulnerabilities continues to be a realistic threat. Guaranteeing that complex software is completely free of memory-safety vulnerabilities is extremely expensive. Probabilistic countermeasures that depend on random secret keys are interesting, because they are an inexpensive way to raise the bar for attackers who aim to exploit memory-safety vulnerabilities. Moreover, some countermeasures even Support Legacy systems. However, it is unclear how to quantify and compare the effectiveness of different probabilistic countermeasures or combinations of such countermeasures. In this paper we propose a methodology to rigorously derive security bounds for probabilistic countermeasures. We argue that by representing security notions in this setting as events in probabilistic games, similarly as done with cryptographic security definitions, concrete and asymptotic guarantees can be obtained against realistic attackers. These guarantees shed light on the effectiveness of single countermeasures and their composition and allow practitioners to more precisely gauge the risk of an attack.
Jodi Forlizzi - One of the best experts on this subject based on the ideXlab platform.
-
engaging with death online an analysis of systems that Support Legacy making bereavement and remembrance
Designing Interactive Systems, 2016Co-Authors: Rebecca Gulotta, David Gerritsen, Aisling Kelliher, Jodi ForlizziAbstract:Death is an inevitable part of life, but digital systems have been slow to address the complex issues that arise when a person passes away. As digital systems have become an increasingly important part people's lives, so too have these systems begun to play a role in a number of practices related to death, such as Legacy-making, bereavement, and remembrance. In this paper, we conduct a survey of seventy-five digital systems designed to Support these practices. Building on prior work, we analyzed these systems to derive findings that articulate how digital technologies reflect how people think about and engage with death. Based on these findings, we generated strategies designed to help system designers grapple with the complex needs that result from navigating death online.
-
Conference on Designing Interactive Systems - Engaging with Death Online: An Analysis of Systems that Support Legacy-Making, Bereavement, and Remembrance
Proceedings of the 2016 ACM Conference on Designing Interactive Systems - DIS '16, 2016Co-Authors: Rebecca Gulotta, David Gerritsen, Aisling Kelliher, Jodi ForlizziAbstract:Death is an inevitable part of life, but digital systems have been slow to address the complex issues that arise when a person passes away. As digital systems have become an increasingly important part people's lives, so too have these systems begun to play a role in a number of practices related to death, such as Legacy-making, bereavement, and remembrance. In this paper, we conduct a survey of seventy-five digital systems designed to Support these practices. Building on prior work, we analyzed these systems to derive findings that articulate how digital technologies reflect how people think about and engage with death. Based on these findings, we generated strategies designed to help system designers grapple with the complex needs that result from navigating death online.
Xiangjun Qian - One of the best experts on this subject based on the ideXlab platform.
-
ITSC - Priority-based coordination of autonomous and Legacy vehicles at intersection
17th International IEEE Conference on Intelligent Transportation Systems (ITSC), 2014Co-Authors: Xiangjun Qian, Fabien Moutarde, Jean Gregoire, Arnaud De La FortelleAbstract:Recently, researchers have proposed various intersection management techniques that enable autonomous vehicles to cross the intersection without traffic lights or stop signs. In particular, a priority-based coordination system with provable collision-free and deadlock-free features has been presented. In this paper, we extend the priority-based approach to Support Legacy vehicles without compromising above-mentioned features. We make the hypothesis that Legacy vehicles are able to keep a safe distance from their leading vehicles. Then we explore some special configurations of system that ensures the safe crossing of Legacy vehicles. We implement the extended system in a realistic traffic simulator SUMO. Simulations are performed to demonstrate the safety of the system.
-
Autonomous Intersection Management for Mixed Traffic Flow.
2014Co-Authors: Xiangjun Qian, Fabien Moutarde, Jean Gregoire, Arnaud De La FortelleAbstract:Recently, researchers have proposed various autonomous intersection management techniques that enable autonomous vehicles to cross the intersection without traffic lights or stop signs. In particular, a priority-based coordination system with provable collision-free and deadlock-free features has been presented. In this paper, we extend the priority-based approach to Support Legacy vehicles without compromising above-mentioned features. We make the hypothesis that Legacy vehicles are able to keep a safe distance from their leading vehicles. Then we explore some special configurations of system that ensures the safe crossing of Legacy vehicles. We implement the extended system in a realistic traffic simulator SUMO. Simulations are performed to demonstrate the safety and efficiency of the system.
-
Priority-based coordination of autonomous and Legacy vehicles at intersection
2014 17th IEEE International Conference on Intelligent Transportation Systems ITSC 2014, 2014Co-Authors: Xiangjun Qian, Fabien Moutarde, Jean Gregoire, Arnaud De La FortelleAbstract:Recently, researchers have proposed various autonomous intersection management techniques that enable autonomous vehicles to cross the intersection without traffic lights or stop signs. In particular, a priority-based coordination system with provable collision-free and deadlock-free features has been presented. In this paper, we extend the priority-based approach to Support Legacy vehicles without compromising above-mentioned features. We make the hypothesis that Legacy vehicles are able to keep a safe distance from their leading vehicles. Then we explore some special configurations of system that ensures the safe crossing of Legacy vehicles. We implement the extended system in a realistic traffic simulator SUMO. Simulations are performed to demonstrate the safety of the system.
