The Experts below are selected from a list of 7611 Experts worldwide ranked by ideXlab platform
Stan Matwin - One of the best experts on this subject based on the ideXlab platform.
-
mining the software change repository of a legacy Telephony System
International Conference on Software Engineering, 2004Co-Authors: Jelber Sayyadshirabad, Timothy C Lethbridge, Stan MatwinAbstract:Ability to predict whether a change in one file may require a change in another can be extremely helpful to a software maintainer. Software change repositories store historic changes applied to a software System. They therefore inherently contain a wealth of information regarding (hidden) interactions between different components of the System, including the files that have changed together in the past. Data mining techniques can be employed to learn from this software change experience. We will report on our research into mining the software change repository of a legacy System to learn a relation that maps file pairs to a value indicating whether changing one may require a change in the other.
-
MSR - Mining the Software Change Repository of a Legacy Telephony System.
"International Workshop on Mining Software Repositories (MSR 2004)" W17S Workshop - 26th International Conference on Software Engineering, 2004Co-Authors: Jelber Sayyad-shirabad, Timothy C Lethbridge, Stan MatwinAbstract:Ability to predict whether a change in one file may require a change in another can be extremely helpful to a software maintainer. Software change repositories store historic changes applied to a software System. They therefore inherently contain a wealth of information regarding (hidden) interactions between different components of the System, including the files that have changed together in the past. Data mining techniques can be employed to learn from this software change experience. We will report on our research into mining the software change repository of a legacy System to learn a relation that maps file pairs to a value indicating whether changing one may require a change in the other.
Jelber Sayyadshirabad - One of the best experts on this subject based on the ideXlab platform.
-
mining the software change repository of a legacy Telephony System
International Conference on Software Engineering, 2004Co-Authors: Jelber Sayyadshirabad, Timothy C Lethbridge, Stan MatwinAbstract:Ability to predict whether a change in one file may require a change in another can be extremely helpful to a software maintainer. Software change repositories store historic changes applied to a software System. They therefore inherently contain a wealth of information regarding (hidden) interactions between different components of the System, including the files that have changed together in the past. Data mining techniques can be employed to learn from this software change experience. We will report on our research into mining the software change repository of a legacy System to learn a relation that maps file pairs to a value indicating whether changing one may require a change in the other.
Timothy C Lethbridge - One of the best experts on this subject based on the ideXlab platform.
-
mining the software change repository of a legacy Telephony System
International Conference on Software Engineering, 2004Co-Authors: Jelber Sayyadshirabad, Timothy C Lethbridge, Stan MatwinAbstract:Ability to predict whether a change in one file may require a change in another can be extremely helpful to a software maintainer. Software change repositories store historic changes applied to a software System. They therefore inherently contain a wealth of information regarding (hidden) interactions between different components of the System, including the files that have changed together in the past. Data mining techniques can be employed to learn from this software change experience. We will report on our research into mining the software change repository of a legacy System to learn a relation that maps file pairs to a value indicating whether changing one may require a change in the other.
-
MSR - Mining the Software Change Repository of a Legacy Telephony System.
"International Workshop on Mining Software Repositories (MSR 2004)" W17S Workshop - 26th International Conference on Software Engineering, 2004Co-Authors: Jelber Sayyad-shirabad, Timothy C Lethbridge, Stan MatwinAbstract:Ability to predict whether a change in one file may require a change in another can be extremely helpful to a software maintainer. Software change repositories store historic changes applied to a software System. They therefore inherently contain a wealth of information regarding (hidden) interactions between different components of the System, including the files that have changed together in the past. Data mining techniques can be employed to learn from this software change experience. We will report on our research into mining the software change repository of a legacy System to learn a relation that maps file pairs to a value indicating whether changing one may require a change in the other.
Reza Farahbakhsh - One of the best experts on this subject based on the ideXlab platform.
-
P2P IP Telephony over wireless ad-hoc networks
Peer-to-Peer Networking and Applications, 2012Co-Authors: Mehdi Mani, Winston Khoon Guan Seah, Noel Crespi, Reza FarahbakhshAbstract:This paper presents a new strategy to form P2P IP Telephony overlay for wireless ad-hoc networks. In the proposed strategy a structured P2P System is considered where some nodes, called super-nodes, with higher capacity form the overlay and provide registry and call routing services. As selection and admission of new super-nodes in wireless ad-hoc networks is more challenging than backbone networks, we define the strategies to select and admit new super-nodes into the overlay. On one hand, scarce resources and fluctuating link quality demand additional criteria than just node computing resources for super-nodes selection. On the other hand, the indiscriminate increase in super-node number can raise the call session setup delay and degrade the quality. This is due to the relaying of packets across multiple wireless links. In this paper, we first define the criteria to select super-nodes and then the major part of the paper is dedicated to defining the required strategies to admit new super-nodes. Our admission strategies add new super-nodes to the System whenever they are required. Since the strategy does not simply admit all eligible super-node candidates, this ensures control over the number of super-nodes and keeps the session setup delay within to the required service level threshold. We define a queuing network to model our System and evaluate the efficacy of our admission strategies with intensive simulations. Furthermore, we have implemented a P2P IP Telephony System that operates on wireless ad-hoc networks and validated the performance of our admission strategies on this real platform.
-
P2P IP Telephony over wireless ad-hoc networks : a smart approach on super node admission
Peer-to-Peer Networking and Applications, 2012Co-Authors: Mehdi Mani, Noel Crespi, Winston Seah, Reza FarahbakhshAbstract:This paper presents a new strategy to form P2P IP Telephony overlay for wireless ad-hoc networks. In the proposed strategy a structured P2P System is considered where some nodes, called super-nodes, with higher capacity form the overlay and provide registry and call routing services. As selection and admission of new super-nodes in wireless ad-hoc networks is more challenging than backbone networks, we define the strategies to select and admit new super-nodes into the overlay. On one hand, scarce resources and fluctuating link quality demand additional criteria than just node computing resources for super-nodes selection. On the other hand, the indiscriminate increase in super-node number can raise the call session setup delay and degrade the quality. This is due to the relaying of packets across multiple wireless links. In this paper, we first define the criteria to select super-nodes and then the major part of the paper is dedicated to defining the required strategies to admit new super-nodes. Our admission strategies add new super-nodes to the System whenever they are required. Since the strategy does not simply admit all eligible super-node candidates, this ensures control over the number of super-nodes and keeps the session setup delay within to the required service level threshold. We define a queuing network to model our System and evaluate the efficacy of our admission strategies with intensive simulations. Furthermore, we have implemented a P2P IP Telephony System that operates on wireless ad-hoc networks and validated the performance of our admission strategies on this real platform.
Chris J. Mitchell - One of the best experts on this subject based on the ideXlab platform.
-
STM - Retrofitting Mutual Authentication to GSM Using RAND Hijacking
Security and Trust Management, 2016Co-Authors: Mohammed Shafiul Alam Khan, Chris J. MitchellAbstract:As has been widely discussed, the GSM mobile Telephony System only offers unilateral authentication of the mobile phone to the network; this limitation permits a range of attacks. While adding support for mutual authentication would be highly beneficial, changing the way GSM serving networks operate is not practical. This paper proposes a novel modification to the relationship between a Subscriber Identity Module (SIM) and its home network which allows mutual authentication without changing any of the existing mobile infrastructure, including the phones; the only necessary changes are to the authentication centres and the SIMs. This enhancement, which could be deployed piecemeal in a completely transparent way, not only addresses a number of serious vulnerabilities in GSM but is also the first proposal explicitly designed to enhance GSM authentication that could be deployed without modifying any of the existing network infrastructure.
-
Retrofitting mutual authentication to GSM using RAND hijacking
arXiv: Cryptography and Security, 2016Co-Authors: Mohammed Shafiul Alam Khan, Chris J. MitchellAbstract:As has been widely discussed, the GSM mobile Telephony System only offers unilateral authentication of the mobile phone to the network; this limitation permits a range of attacks. While adding support for mutual authentication would be highly beneficial, changing the way GSM serving networks operate is not practical. This paper proposes a novel modification to the relationship between a Subscriber Identity Module (SIM) and its home network which allows mutual authentication without changing any of the existing mobile infrastructure, including the phones; the only necessary changes are to the authentication centres and the SIMs. This enhancement, which could be deployed piecemeal in a completely transparent way, not only addresses a number of serious vulnerabilities in GSM but is also the first proposal for enhancing GSM authentication that possesses such transparency properties.
