{"title":"Feasibility of PKC in resource-constrained wireless sensor networks","authors":"A. Pathan, C. Hong","doi":"10.1109/ICCITECHN.2008.4803120","DOIUrl":"https://doi.org/10.1109/ICCITECHN.2008.4803120","url":null,"abstract":"In this paper we present a detailed review of the works on public key cryptography (PKC) in wireless sensor networks (WSNs). In the early days of sensor networks, public key cryptography was thought to be completely unfeasible considering its computational complexity and energy requirements. By this time, several works have proved that the lightweight versions of many well-known public key algorithms can be utilized in WSN environment. With the expense of a little energy, public key based schemes could in fact be the best choice for ensuring data security in high-security demanding WSN applications. Here, we talk about the notion of public key cryptography in WSN, its applicability, challenges in its implementation, and present a detailed study of the significant works on PKC in WSN.","PeriodicalId":335795,"journal":{"name":"2008 11th International Conference on Computer and Information Technology","volume":"73 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2008-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"129925819","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":"Distortion measurement using arc-length-parameterisation within a vertex-based shape coding framework","authors":"F. Sohel, Bennamoun","doi":"10.1109/ICCITECHN.2008.4803073","DOIUrl":"https://doi.org/10.1109/ICCITECHN.2008.4803073","url":null,"abstract":"Existing vertex-based shape coding algorithms use a number of different distortion measurement techniques including the shortest absolute distance (SAD), distortion band (DB) or tolerance band (TB), accurate distortion measurement technique for shape coding (ADMSC) and distortion measurement based on chord-length-parameterisation (DMCLP). Among these techniques DMCLP is computationally the fastest. It however, is a relaxed measurement technique and does not fully utilise the admissible distortion within the rate-distortion optimisation. This paper presents a novel distortion measurement technique based on arc-length-parameterisation (DMALP) within the vertex-based shape coding framework. Experimental results vindicate its superior performance over the existing geometric distortion measurement techniques.","PeriodicalId":335795,"journal":{"name":"2008 11th International Conference on Computer and Information Technology","volume":"17 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2008-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"130549883","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 crosstalk free routing algorithm of Generalized Recursive Non-blocking Network","authors":"A. Sultana, G. Chowdhury, M. Rahman","doi":"10.1109/ICCITECHN.2008.4803035","DOIUrl":"https://doi.org/10.1109/ICCITECHN.2008.4803035","url":null,"abstract":"Crosstalk is an intrinsic drawback of an optical network, and avoiding crosstalk is important for making fruitful application of optical switching network. In this paper, we apply the well-known semi-permutation technique on generalized recursive network (GRN) to make it crosstalk free. GRN has reasonable path independent signal loss and crosstalk. Using the methodology presented in this paper, that reasonable crosstalk is avoided. For the GRN network, we show that any semi-permutation is realizable in one pass and any permutation is realizable in two passes under the constraint of avoiding crosstalk.","PeriodicalId":335795,"journal":{"name":"2008 11th International Conference on Computer and Information Technology","volume":"47 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2008-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"123984353","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. Rahman, Y. Inoguchi, Y. Sato, Y. Miura, S. Horiguchi
{"title":"On hot-spot traffic pattern of TESH network","authors":"M. Rahman, Y. Inoguchi, Y. Sato, Y. Miura, S. Horiguchi","doi":"10.1109/ICCITECHN.2008.4802999","DOIUrl":"https://doi.org/10.1109/ICCITECHN.2008.4802999","url":null,"abstract":"In this paper, we present a deadlock-free routing algorithm for the Tori connected mESH (TESH) network using 2 virtual channels - 2 being the minimum number for dimension-order routing - and evaluate the networks dynamic communication performance under the hot-spot traffic pattern, using the proposed routing algorithm. We evaluate the dynamic communication performance of TESH, mesh, and torus networks by computer simulation. It is shown that the dynamic communication performance of the TESH network is better than that of the mesh and torus networks. It is also shown that the relative difference in maximum throughput between torus and TESH networks decreases with the increase of hot spot traffic.","PeriodicalId":335795,"journal":{"name":"2008 11th International Conference on Computer and Information Technology","volume":"107 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2008-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"121720999","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 least square approach for TDOA/AOA wireless location in WCDMA system","authors":"M. Nur-A-Alam, M. M. Haque","doi":"10.1109/ICCITECHN.2008.4803072","DOIUrl":"https://doi.org/10.1109/ICCITECHN.2008.4803072","url":null,"abstract":"Cellular mobile networks use time of arrival (TOA), time difference of arrival (TDOA), angle of arrival (AOA) or received signal strength (RSS) based measurement techniques for mobile position estimation. Each of these measurement techniques has its degree of accuracy and level of complexity. Individual methods are usually not able to give adequate correct position of a mobile user. Therefore, a common trend is to combine these methods with other suitable techniques to attain enhanced performance. There are several algorithms to compensate the position errors by combining different methods. In this paper, a two step least square algorithm for wireless position estimation technique is implemented in WCDMA system where an angle of arrival (AOA) assisted and correlation slope-based time difference of arrival (TDOA) measurement method is considered and their performance is presented in signal to noise ratio conditions.","PeriodicalId":335795,"journal":{"name":"2008 11th International Conference on Computer and Information Technology","volume":"18 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2008-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"133869227","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 mobile applications using JXTA/JXME","authors":"Tahmina Tahsin, Lazeeb Choudhury, Lutfur Rahman","doi":"10.1109/ICCITECHN.2008.4803076","DOIUrl":"https://doi.org/10.1109/ICCITECHN.2008.4803076","url":null,"abstract":"With the advancement in mobile wireless communication technology and the increasing number of mobile users, peer-to-peer (P2P) computing, in both academic research and industrial development, has found a new dimension of communication, collaboration and resource sharing. In the recent years P2P have evolved rapidly in Internet especially for file-sharing. The major issue of this popularity is that no longer the networks are constrained on unreliable central servers; sharing and connectivity is the main focus. The popularity of peer-to-peer file sharing applications such as Gnutella, KaZaA, or Napster has created an outbreak in recent Internet history. But P2P file sharing applications have not yet been widely adopted in mobile devices. In this paper, possibilities of P2P applications in mobile devices are presented. To illustrate the possibilities two demo applications are presented here. One is a message passing application and another is a file sharing application. The open source JXTA/JXME framework is used here.","PeriodicalId":335795,"journal":{"name":"2008 11th International Conference on Computer and Information Technology","volume":"22 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2008-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"134387309","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":"Resource capability discovery and description management system for bioinformatics Data and service Integration - an experiment with gene regulatory networks","authors":"E. Ahmed","doi":"10.1109/ICCITECHN.2008.4802991","DOIUrl":"https://doi.org/10.1109/ICCITECHN.2008.4802991","url":null,"abstract":"Traditional legacy HTML based web sites/ page can be thought of as web services because the dynamic web pages can take user input argument via web forms and response to user query. The ability of agents and services to automatically locate and interact with unknown partners is a goal for Web based Data Integration system. This ldquoserendipitous interoperabilityrdquo is hindered by the lack of an explicit means of describing what web pages are able to do and in order to do it what input it takes and what output it produces, that is what is their capabilities [1]. The tremendous success of the WWW is countervailed by the efforts needed to search and find relevant information. For tabular structures embedded in HTML documents, typical keyword or link-analysis based search fails. The next phase envisioned for the WWW is automatic ad-hoc interaction between intelligent agents, web services, databases and semantic web enabled applications. A large amount of information available on the Web is formatted in HTML tables, which are mainly presentation oriented and are not suited for database applications. As a result, how to capture information in HTML tables semantically and integrate relevant information is a challenge. We are envisioning another layer of web abstraction where user can query intra web document table like structure. Our prototype application is based on WebFusion and an ad hoc query language BioFlow [2], [3], [4], [5], [6] a software agent that can simulate a person interacting with web search forms and extracting information from the resulting pages by means of an API. We need to develop a framework which is able to query search web forms and the web page tables in a SQL way. In this context we also report a Java based implementation for integrating Flybase and AlignACE site.","PeriodicalId":335795,"journal":{"name":"2008 11th International Conference on Computer and Information Technology","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2008-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"130903558","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":"Sensitivity analysis in robust and kernel canonical correlation analysis","authors":"A. Alam, M. Nasser, K. Fukumizu","doi":"10.1109/ICCITECHN.2008.4802966","DOIUrl":"https://doi.org/10.1109/ICCITECHN.2008.4802966","url":null,"abstract":"A number of measures of canonical correlation coefficient are now used in pattern recognition in the different literature. Some robust forms of classical canonical correlation coefficient are introduced recently to address the robustness issue of the canonical coefficient in the presence of outliers and departure from normality. Also a few number of kernels are used in canonical analysis to capture nonlinear relationship in data space, which is linear in some higher dimensional feature space. But not much work has been done to investigate their relative performances through simulation and also from the view point of sensitivity. In this paper an attempt has been made to compare performances of kernel canonical correlation coefficients (Gaussian, Laplacian and Polynomial) with that of classical and robust canonical correlation coefficient measures using simulation and influence function. We investigate the bias, standard error, MSE, qualitative robustness index, sensitivity curve of each estimator under a variety of situations and also employ boxplots and scatter plots of canonical variates to judge their performances. We observe that the class of kernel estimators perform better than the class of classical and robust estimators in general and the kernel estimator with Laplacian function has shown the best performance for large sample size.","PeriodicalId":335795,"journal":{"name":"2008 11th International Conference on Computer and Information Technology","volume":"11 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2008-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"130969040","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":"An efficient system for recognition of human face in different expressions by some measured features of the face using laplacian operator","authors":"A. Arif, G. Rahaman, G.K. Biswas, S. Islam","doi":"10.1109/ICCITECHN.2008.4802977","DOIUrl":"https://doi.org/10.1109/ICCITECHN.2008.4802977","url":null,"abstract":"In this paper we present an efficient system for face recognition with high recognition rate. In our proposed method, at first we detect the face from an image, then two main significant edge lines - chin-line and nose-line are determined and next we apply third order polynomial regression on these two lines to get a third order polynomial equation with four coefficients for each line. Here we use Laplacian operator to determine the curve of chin line and nose line. Then we measure distances from the middle point of the nose curve to the chin line horizontally and vertically, the width of the two eyebrows, the width of forehead and the distance from pupil to eyebrow. We also determine two regions - eye-region and nose-region. For each of these regions, we determine the average value of each three basic colors: red, green and blue. We then store the coefficients of the detected edge lines, the average values of the three basic colors and other distances and perform the task of recognition process. The existing face is recognized for which the weighted error is minimum and higher than a predefined threshold value. Experimental results show that our proposed method successfully recognizes face at a very high rate.","PeriodicalId":335795,"journal":{"name":"2008 11th International Conference on Computer and Information Technology","volume":"37 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2008-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"115790043","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":"An effective term weighting method using random walk model for text classification","authors":"M. Islam","doi":"10.1109/ICCITECHN.2008.4803000","DOIUrl":"https://doi.org/10.1109/ICCITECHN.2008.4803000","url":null,"abstract":"Text classification may be viewed as assigning texts in a predefined set of categories. However there are many digital documents that are not organized according to their contents. So it is difficult task to find relevant documents for a user. Automatic text classification problem can solve this problem. In this paper we introduce a new random walk term weighting method for improved text classification. In our approach to weight a term, we exploit the relationship of local (term position, term frequency) and global (inverse document frequency, information gain) information of terms (vertices). Moreover, we weight terms by considering co-occurrence and semantic relation of terms as a measure of dependency. To evaluate our term weighting approach we integrate it in Rocchio text classification algorithm and experimental results show that our method performs better than other random walk models.","PeriodicalId":335795,"journal":{"name":"2008 11th International Conference on Computer and Information Technology","volume":"131 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2008-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"114362786","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}