{"title":"Analysis of Broadband Diffusion in OECD Countries","authors":"M. Gerami, Junseok Hwang","doi":"10.1109/ICCGI.2007.16","DOIUrl":"https://doi.org/10.1109/ICCGI.2007.16","url":null,"abstract":"This article focus on broadband penetration in OECD countries. We examine statistic comparisons related to broadband deployment and economic factors in the OECD countries and compare the result for investment opportunity in these countries. With analyze the standard deviation of average monthly charge and speed of broadband will the spread range of broadband calculate and probability of their spread with the normal distribution demonstrate.","PeriodicalId":102568,"journal":{"name":"2007 International Multi-Conference on Computing in the Global Information Technology (ICCGI'07)","volume":"20 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2007-03-04","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"114299403","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}
N. Elfadel, E. I. Babekir, A. Mohammed, A. Aziz, N. Saad
{"title":"Optical CDMA; Optical Parallel Interference Cancellation Using the Lowest Threshold Value","authors":"N. Elfadel, E. I. Babekir, A. Mohammed, A. Aziz, N. Saad","doi":"10.1109/ICCGI.2007.45","DOIUrl":"https://doi.org/10.1109/ICCGI.2007.45","url":null,"abstract":"This paper presents the study of a receiver device for the optical code division multiple access (OCDMA) called the optical parallel interference cancellation (Opt-PIC). The performance of OCDMA system is known to be easily influenced by the multiple access interference (MAI) caused by other simultaneous users. To overcome this problem, there is a strong demand for the design of new detection scheme that will be efficient enough to improve the performance of the OCDMA system, while minimizing the effects of the MAI. In this paper, some studies have been conducted on the Opt-PIC specifically for the lowest threshold value. Studies have been carried out not only using the conventional method but also using a hard limiter. The results are compared to the previous techniques used to mitigate the effect of MAI.","PeriodicalId":102568,"journal":{"name":"2007 International Multi-Conference on Computing in the Global Information Technology (ICCGI'07)","volume":"81 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2007-03-04","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"123049725","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}
{"title":"A Heuristic Map-Matching Algorithm by Using Vector-Based Recognition","authors":"Dongdong Wu, T. Zhu, Weifeng Lv, Xin Gao","doi":"10.1109/ICCGI.2007.3","DOIUrl":"https://doi.org/10.1109/ICCGI.2007.3","url":null,"abstract":"The traditional map-matching algorithms mainly use two methods: the incremental method and the global method. Both of them have advantages and disadvantages of themselves: while the global map-matching algorithm produces better matching results, the incremental algorithm produces results of lower quality faster. All things considering the two traditional algorithms, this paper proposes a heuristic map-matching algorithm by using vector-based recognition. Firstly, the algorithm uses the heuristic search method which is similar to A* algorithm, and it makes use of geometric operation to form the restriction, and make the comparison between the vector formed with the vehicular GPS points and the special road network to heuristicly search and select the vehicular possible traveling routes. Secondly, it globally compares the vehicular every possible route by calculating the map-matching weight, and then chooses the optimal one. The result of testing demonstrates the efficiency of the algorithm both at accuracy and computational speed when handling the large-scale data of GPS tracking data even under the complex road network conditions.","PeriodicalId":102568,"journal":{"name":"2007 International Multi-Conference on Computing in the Global Information Technology (ICCGI'07)","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2007-03-04","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"129161526","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}
{"title":"Weakest Preconditions for Applied pi-Calculus","authors":"Decai Jiao, D. Sinclair","doi":"10.1109/ICCGI.2007.63","DOIUrl":"https://doi.org/10.1109/ICCGI.2007.63","url":null,"abstract":"In this paper, we develop a logic for reasoning about applied pi-calculus processes based on the concept of weakest precondition and Hoare's logic. We propose a set of weakest precondition (wp) rules for applied pi-calculus and give the soundness proof of these rules. The intention behind this work is to be able to provide a formal basis for analyzing properties of mobile and distributed systems formalized in applied pi- calculus. Let S be the system formalized in applied pi-calculus, its functionality is specified as Hoare triple [pre]S[post], where pre and post are precondition and post condition, respectively. By applying wp rules recursively, we can deduce the weakest precondition of system S with respect to post condition post. One possible application of this method is analyzing properties of Web Service compositions or other component-based software composition.","PeriodicalId":102568,"journal":{"name":"2007 International Multi-Conference on Computing in the Global Information Technology (ICCGI'07)","volume":"15 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2007-03-04","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"125336727","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}
{"title":"Saying, \"I Am Testing,\" is Enough to Improve the Product: An Empirical Study","authors":"P. Robillard, T. Francois-Brosseau","doi":"10.1109/ICCGI.2007.54","DOIUrl":"https://doi.org/10.1109/ICCGI.2007.54","url":null,"abstract":"We report on an empirical study performed in an industrial environment in which the impact of modifying test practices is measured. First, the efficiency of the existing test practices is measured, by analyzing the software defects using a modified version of Orthogonal Defect Classification (ODC). The study was conducted in two phases lasting seven months each. In the first phase (Phase A), defects were recorded using existing implicit testing practices. Developers were then required to make those testing activities explicit based on a simple scheme. After a few months of employing this explicit testing practice, a new defect recording phase (Phase B), which also lasted seven months, was conducted. The impacts of explicit test practices are presented in terms of the ratios of defects found by the users and the nature of the testing activities performed. Results show that even a small improvement, such as requiring testing activities to be explicit, can have a measurable positive impact on the quality of the product.","PeriodicalId":102568,"journal":{"name":"2007 International Multi-Conference on Computing in the Global Information Technology (ICCGI'07)","volume":"34 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2007-03-04","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"115963338","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}
{"title":"Identity Information Management in the Network Environment","authors":"Yanan Zhang, Jingsha He","doi":"10.1109/ICCGI.2007.27","DOIUrl":"https://doi.org/10.1109/ICCGI.2007.27","url":null,"abstract":"The proliferation of user identities in the network has made it more difficult to manage user identity information because such information is distributed in many web servers over the network. Our goal is to propose a solution to this management problem by integrating all identity information that belongs to individual users in the network. The method we propose in this paper for the integration is based on a third party server that we call Identity Management Server (IMS). It is required that each website register with the IMS so that it can bind all the identities that belong to a user in network, record every change to user identity information in each server, and facilitate server communication to unify user identity information. In this paper, we describe the architecture, the primary functions as well as the implementation of the proposed method.","PeriodicalId":102568,"journal":{"name":"2007 International Multi-Conference on Computing in the Global Information Technology (ICCGI'07)","volume":"26 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2007-03-04","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"134378356","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}
M. A. Meinagh, A. Isazadeh, M. Ayar, F. Mahmoudi, B. Zareie
{"title":"Database Replication with Availability and Consistency Guarantees through Failure-Handling","authors":"M. A. Meinagh, A. Isazadeh, M. Ayar, F. Mahmoudi, B. Zareie","doi":"10.1109/ICCGI.2007.20","DOIUrl":"https://doi.org/10.1109/ICCGI.2007.20","url":null,"abstract":"In this paper we present an approach to fault-tolerant stream processing. In contrast to previous techniques that handle node failures, our approach also tolerates network failures and network partitions. The approach is based on a principled trade-off between consistency and availability in the face of failure, that (1) ensures that all data on an input stream is processed within a specified time threshold, but (2) reduces the impact of failures by limiting if possible the number of results produced based on partially available input data, and (3) corrects these results when failures heal. Our approach is well-suited for applications such as environment monitoring, where high availability and \"real-time\" response is preferable to perfect answers. Our approach uses replication and guarantees that all processing replicas achieve state consistency, both in the absence of failures and after a failure heals. We achieve consistency in the former case by defining a data-serializing operator that ensures that the order of tuples to a downstream operator is the same at all the replicas. To achieve consistency after a failure heals, we develop approaches based on checkpoint/redo and undo/redo techniques.","PeriodicalId":102568,"journal":{"name":"2007 International Multi-Conference on Computing in the Global Information Technology (ICCGI'07)","volume":"14 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2007-03-04","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"133178904","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}
{"title":"Mining Negative and Positive Influence Rules Using Kullback-Leibler Divergence","authors":"L. N. Alachaher, S. Guillaume","doi":"10.1109/ICCGI.2007.38","DOIUrl":"https://doi.org/10.1109/ICCGI.2007.38","url":null,"abstract":"This paper describes a new method for mining negative and positive quantitative influence rules based on a coordination between a statistical dissimilarity measure (Kullback Leibler divergence) and contingency tables. This coordination identifies the significant positive and negative correlations and enables pertinent influence rules extraction.","PeriodicalId":102568,"journal":{"name":"2007 International Multi-Conference on Computing in the Global Information Technology (ICCGI'07)","volume":"24 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2007-03-04","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"130824840","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}
{"title":"On Stubborn Graph Sandwich Problems","authors":"S. Dantas, L. Faria","doi":"10.1109/ICCGI.2007.41","DOIUrl":"https://doi.org/10.1109/ICCGI.2007.41","url":null,"abstract":"The stubborn partition is a partition of the vertex set of a graph G into at most four parts A, B, C, D, with the following constraints: the internal constraints are part A and part B are required to be independent sets, and part D is required to be a clique; the only external constraint is that each vertex of part A is nonadjacent to every vertex of part C. This problem is generalized to the list sandwich version: given two graphs G<sup>1</sup> = (V, E<sup>1</sup>), G<sup>2</sup> = (V,E<sup>2</sup>) such that if E<sup>1</sup> sube E<sup>2</sup>, and for each vertex a list of parts in which the vertex is allowed to be placed, we look for a stubborn sandwich graph G = (V, E) such that E<sup>1</sup> sube E sube E<sup>2</sup>. In this paper, we prove that the LIST STUBBORN GRAPH SANDWICH PROBLEM is N/P-complete.","PeriodicalId":102568,"journal":{"name":"2007 International Multi-Conference on Computing in the Global Information Technology (ICCGI'07)","volume":"12 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2007-03-04","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"120937803","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}
{"title":"Integrating Voice over IP Services in IPv4 and IPv6 Networks","authors":"L. Lambrinos, L. Lambrinos","doi":"10.1109/ICCGI.2007.29","DOIUrl":"https://doi.org/10.1109/ICCGI.2007.29","url":null,"abstract":"The transition from the current IPv4 network protocol structure to the next generation IPv6 network has always been deemed as a lengthy process. As the deployment of IPv6 infrastructures evolves, interaction with the existing IPv4 networks is unavoidable. This interaction may occur at the network level (simple data pass-through) or at the application level (between IPv6 and IPv4 endpoints). In this paper we concentrate on application level interoperability and select an increasingly popular application: Voice Over IP (VoIP). The use of VoIP technologies is becoming more widespread as end-users and network providers recognise the potential benefits that the usage of the application provides. It is important to provide an environment where IPv4 and IPv6 networks and applications / devices can interoperate in the context of VoIP. This environment is based on an architecture that integrates all the components together (whether they support IPv4 or IPv6 or both) thereby providing ubiquitous access to IP telephony services based on the SIP signaling protocol. We present our experiences from realising the proposed architecture.","PeriodicalId":102568,"journal":{"name":"2007 International Multi-Conference on Computing in the Global Information Technology (ICCGI'07)","volume":"8 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2007-03-04","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"121658428","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}