{"title":"Coupling Latency Time to the Throughput Performance Analysis on Wireless CAN Networks","authors":"S. Dridi, B. Gouissem, S. Hasnaoui, H. Rezig","doi":"10.1109/ICCGI.2006.27","DOIUrl":"https://doi.org/10.1109/ICCGI.2006.27","url":null,"abstract":"CAN networks, called controller area networks, can be used in the framework of real-time distributed industrial applications. Wireless CAN gives a solution when industrial mobile stations under certain constraints should continue to use the CAN protocol as a frame exchange protocol. In wireless CAN, we adopt the use of the RTS/CTS mechanism to gain access to the medium in a first step and to exchange ordinary CAN frames in a second step. We focus, in this paper, on the performance evaluation of wireless CAN by coupling the two criteria: the throughput and the latency time. After analyses, we deduce that when we increase the payload, the latency time along with the throughput increase respectively. Thus, in this way our work, in this paper, consists in computing the throughput-latency time couple that would guarantee a maximum throughput and minimum latency time in the case of WCAN","PeriodicalId":112974,"journal":{"name":"2006 International Multi-Conference on Computing in the Global Information Technology - (ICCGI'06)","volume":"13 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2006-08-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"122606000","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":"IPv6 Broadband Access to University Students in Greece: The DIODOS project","authors":"A. Liakopoulos","doi":"10.1109/ICCGI.2006.39","DOIUrl":"https://doi.org/10.1109/ICCGI.2006.39","url":null,"abstract":"The deployment of IPv6 in the research and commercial networks has been accelerated in the last few years and IPv6 traffic is gradually increased. Broadband access networks will mostly benefit from the IPv6 technology as NAT/PAT techniques will no more be required while new managed services can be easily introduced by the Internet service providers. We present the DIODOS project that aims to provide broadband access to the Internet for university students in Greece. Currently, DIODOS implementation plans are focused on IPv4 interconnection services. This paper discusses some of the arguments that could justify the deployment of IPv6 services at the expense of some reasonable effort and time","PeriodicalId":112974,"journal":{"name":"2006 International Multi-Conference on Computing in the Global Information Technology - (ICCGI'06)","volume":"45 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2006-08-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"116532003","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 mobile based approach to strong authentication on Web","authors":"G. Me, Daniele Pirro, Roberto Sarrecchia","doi":"10.1109/ICCGI.2006.8","DOIUrl":"https://doi.org/10.1109/ICCGI.2006.8","url":null,"abstract":"The rapid increase of the phishing phenomenon states that the Web authentication systems not based on one time password (OTP) are definitively ineffective in providing financial services. Existent Web authentication systems have been developed on the classic username/password mechanism using a single channel, either mobile or Web, generating an expensive or inadequate authentication system. The proposed solution is a combined Web/mobile authentication system. The basic authentication mechanism is integrated with a challenge/response process and an OTP. The challenge is issued from an authentication server and has to authenticate a mobile device, typically a cell phone. This device can communicate with any other involved parts through a fixed terminal, typically a personal computer, via a Bluetooth connection. The mobile device, once accepted, performs the authentication with the web site or application. This final step is accomplished using a temporary one-time password","PeriodicalId":112974,"journal":{"name":"2006 International Multi-Conference on Computing in the Global Information Technology - (ICCGI'06)","volume":"22 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2006-08-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"126074246","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":"Key Issues in the Optimization of Runtime Processes for Dynamic Provisioning of Ubiquitous Services","authors":"Sorin M. Iacob, M. Bargh","doi":"10.1109/ICCGI.2006.37","DOIUrl":"https://doi.org/10.1109/ICCGI.2006.37","url":null,"abstract":"Given the complexity of the runtime processes implied by ubiquitous service provisioning, it is likely that some optimization techniques would be needed for service discovery, matchmaking, and resource allocation and management. In this paper we provide an analysis of these runtime processes and highlight several limitations of the approaches. Next, we outline some of the properties that an optimization solution for these processes should display, and propose a solution direction inspired from cognitive sciences, based on the mechanism of selective attention","PeriodicalId":112974,"journal":{"name":"2006 International Multi-Conference on Computing in the Global Information Technology - (ICCGI'06)","volume":"33 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2006-08-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"133708715","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":"Learning acyclic decision trees with Functional Dependency Network and MDL Genetic Programming","authors":"Wing-Ho Shum, K. Leung, M. Wong","doi":"10.1109/ICCGI.2006.41","DOIUrl":"https://doi.org/10.1109/ICCGI.2006.41","url":null,"abstract":"One objective of data mining is to discover parent-child relationships among a set of variables in the domain. Moreover, showing parents' importance can further help to improve decision makings' quality. Bayesian network (BN) is a useful model for multi-class problems and can illustrate parent-child relationships with no cycle. But it cannot show parents' importance. In contrast, decision trees state parents' importance clearly, for instance, the most important parent is put in the first level. However, decision trees are proposed for single-class problems only, when they are applied to multi-class ones, they are likely to produce cycles representing tautologic. In this paper, we propose to use MDL genetic programming (MDLGP) and functional dependency network (FDN) to learn a set of acyclic decision trees (Shum et al., 2005). The FDN is an extension of BN; it can handle all of discrete, continuous, interval and ordinal values; it guarantees to produce decision trees with no cycle; its learning search space is smaller than decision trees'; and it can represent higher-order relationships among variables. The MDLGP is a robust genetic programming (GP) proposed to learn the FDN. We also propose a method to derive acyclic decision trees from the FDN. The experimental results demonstrate that the proposed method can successfully discover the target decision trees, which have no cycle and have the accurate classification results","PeriodicalId":112974,"journal":{"name":"2006 International Multi-Conference on Computing in the Global Information Technology - (ICCGI'06)","volume":"15 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2006-08-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"114720673","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":"Analysis of SMTP Connection Characteristics for Detecting Spam Relays","authors":"P. Sandford, J. M. Sandford, D. Parish","doi":"10.1109/ICCGI.2006.30","DOIUrl":"https://doi.org/10.1109/ICCGI.2006.30","url":null,"abstract":"Research into preventing spam is an ongoing concern. Much of the effort to date has focused on filtering email at the receiving end using techniques such as content filters. Techniques that could prevent spam from initially being sent would be beneficial and contribute to the preventative effort. In practice much spam is sent from compromised hosts. These can potentially be detected by ISPs using simple monitoring techniques. This monitoring takes place in the core of an ISP's network and provides a periodic summary of email activity. Relatively simple post-capture analysis can then identify the most significant spam relay machines","PeriodicalId":112974,"journal":{"name":"2006 International Multi-Conference on Computing in the Global Information Technology - (ICCGI'06)","volume":"29 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2006-08-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"127306917","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":"Industrial Control Communication Framework on an IPv6 Infrastructure","authors":"Ramona Marfievici, G. Sebestyen, Anca Pop-Bidian","doi":"10.1109/ICCGI.2006.42","DOIUrl":"https://doi.org/10.1109/ICCGI.2006.42","url":null,"abstract":"In the distributed industrial control area activities are concentrated around two main directions that are sometimes conflicting: the development of communication tools in order to satisfy specific requirements from industrial control field and the use of the general purpose communication protocols for distributed control applications. We studied the possibilities of using the QoS features of IPv6 protocol as support for industrial communications and proposed a communication model. The analysis and implementation results showed that some of the most critical aspects of an industrial communication infrastructure are solved using this architecture","PeriodicalId":112974,"journal":{"name":"2006 International Multi-Conference on Computing in the Global Information Technology - (ICCGI'06)","volume":"32 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2006-08-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"125008131","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":"Service-aware Overlay Adaptation in Ambient Networks","authors":"L. Cheng, K. Jean, R. Ocampo, A. Galis","doi":"10.1109/ICCGI.2006.13","DOIUrl":"https://doi.org/10.1109/ICCGI.2006.13","url":null,"abstract":"Developing service-aware self-adaptation systems in heterogeneous and rapidly changing wireless networks such as ambient networks is a challenging issue. Key research areas are adaptation policy definition, network context monitoring, and adaptation policy enforcement. In this paper, we present the ambient virtual pipe platform (AVPP) - that provides a flexible approach towards the creation and management of self-adaptation service-aware overlays in ambient networks","PeriodicalId":112974,"journal":{"name":"2006 International Multi-Conference on Computing in the Global Information Technology - (ICCGI'06)","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2006-08-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"129910621","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":"Peer-to-Peer Platform for Anytime /Anywhere Connectivity in Educational Environments","authors":"J. Kohlenberg, M. Prathaban, S. Balakrichenan","doi":"10.1109/ICCGI.2006.82","DOIUrl":"https://doi.org/10.1109/ICCGI.2006.82","url":null,"abstract":"Institutions are becoming wireless and most of the population are possessing wireless devices since they are becoming less expensive. Providing advanced services such as context aware applications where the personal devices adapt its behavior to the changing environment is challenging. In this paper we propose a P2P platform for a campus environment","PeriodicalId":112974,"journal":{"name":"2006 International Multi-Conference on Computing in the Global Information Technology - (ICCGI'06)","volume":"13 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2006-08-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"133673244","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":"Identifying Transcription Factor Binding Sites in Promoters of Human Genes","authors":"Wei Shi, Wanlei Zhou","doi":"10.1109/ICCGI.2006.90","DOIUrl":"https://doi.org/10.1109/ICCGI.2006.90","url":null,"abstract":"Transcription factor binding sites play an important role in the regulation of gene expression. This study develops a different computational approach to discover putative TFBSs in 17407 human promoters. 89 8-mer sequences are discovered from this research, including 12 new putative TFBSs. All these 12 putative TFBSs show peaks at the location upstream from TSS. 30 out of 89 sequences were also discovered by FitzGerald et al. (FitzGerald et al. 2004), 63 out of 89 sequences match the motifs discovered by Xie et al. (Xie et al. 2005) and 20 out of 89 sequences match the TRANSFAC motifs built from TRANSFAC database by Xie et al. The only predicted TFBS by FitzGerald is verified by our research","PeriodicalId":112974,"journal":{"name":"2006 International Multi-Conference on Computing in the Global Information Technology - (ICCGI'06)","volume":"6 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2006-08-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"133081743","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}