Pub Date : 2008-11-01DOI: 10.1109/ICDIM.2008.4746782
M. Sharif, Tariq Faiz, M. Raza
The analysis of keystroke dynamics (KD) is a developing biometric technique for user authentication. In computer security, its use is limited to some constraints such as longer typing and practice sessions. In this paper, a practical user authentication system is proposed that combines a conventional login/password method and a said biometric technique. The conventional password authentication method is enhanced through analysis of keystroke dynamics (KD) and click patterns (CP). In this way increased security level is achieved without using long and complicated passwords. For this, an application is developed to demonstrate the technique and the results are analyzed. user time signatures (TS) are identified after analyzing user KD and CP. Based on ability to follow their specific TS, users are categorized into beginner, standard and expert. At the time of login, the user inputs are matched with respective database records for authentication.
{"title":"Time signatures - an implementation of Keystroke and click patterns for practical and secure authentication","authors":"M. Sharif, Tariq Faiz, M. Raza","doi":"10.1109/ICDIM.2008.4746782","DOIUrl":"https://doi.org/10.1109/ICDIM.2008.4746782","url":null,"abstract":"The analysis of keystroke dynamics (KD) is a developing biometric technique for user authentication. In computer security, its use is limited to some constraints such as longer typing and practice sessions. In this paper, a practical user authentication system is proposed that combines a conventional login/password method and a said biometric technique. The conventional password authentication method is enhanced through analysis of keystroke dynamics (KD) and click patterns (CP). In this way increased security level is achieved without using long and complicated passwords. For this, an application is developed to demonstrate the technique and the results are analyzed. user time signatures (TS) are identified after analyzing user KD and CP. Based on ability to follow their specific TS, users are categorized into beginner, standard and expert. At the time of login, the user inputs are matched with respective database records for authentication.","PeriodicalId":415013,"journal":{"name":"2008 Third International Conference on Digital Information Management","volume":"6 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2008-11-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"129651061","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}
Pub Date : 2008-11-01DOI: 10.1109/ICDIM.2008.4746827
Agung Sediyono, K. Ku-Mahamud
Plagiarism is a form of academic misconduct which has increased with the easy access to obtain information through electronic documents and the Internet. The problem of finding document plagiarism in full text document can be viewed as a problem of finding the longest common parts of strings. Moreover, the detection system has to be capable to determine and visualize not only the common parts but also the location of the common parts in both the source and the observed document. Unlike previous research, this paper proposes a numerical based comparison algorithm that is comparable in the computation time without loosing the word order of common parts. Based on the experiment, the proposed algorithm outperforms the suffix tree in the length of observed paragraph below one hundred words.
{"title":"Algorithm of the longest commonly consecutive word for Plagiarism detection in text based document","authors":"Agung Sediyono, K. Ku-Mahamud","doi":"10.1109/ICDIM.2008.4746827","DOIUrl":"https://doi.org/10.1109/ICDIM.2008.4746827","url":null,"abstract":"Plagiarism is a form of academic misconduct which has increased with the easy access to obtain information through electronic documents and the Internet. The problem of finding document plagiarism in full text document can be viewed as a problem of finding the longest common parts of strings. Moreover, the detection system has to be capable to determine and visualize not only the common parts but also the location of the common parts in both the source and the observed document. Unlike previous research, this paper proposes a numerical based comparison algorithm that is comparable in the computation time without loosing the word order of common parts. Based on the experiment, the proposed algorithm outperforms the suffix tree in the length of observed paragraph below one hundred words.","PeriodicalId":415013,"journal":{"name":"2008 Third International Conference on Digital Information Management","volume":"39 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2008-11-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"131347551","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}
Pub Date : 2008-11-01DOI: 10.1109/ICDIM.2008.4746759
J. Bahi, M. Eskandar, A. Mostefaoui
In wireless ad hoc networks, nodes are energy constrained. As they communicate far off destinations using intermediate relays, it may not be in interest of a node to expend its energy in relaying and consequently reducing its own lifetime. On the other hand, if all nodes decide not to always accept relay requests, the network throughput will drop dramatically i.e., the lifetime of the whole network is reduced. Obviously, from a single node point of view, these two extreme attitudes are opposite to its interest. We addressed this issue by proposing a novel distributed approach that guarantees tasks affectation to nodes with regard to their energy constraints. The key idea behind is to guarantee to all nodes that they share tasks in function of their energy provisions. In this paper, we tackle the problem of nodes mobility and its impact on the behaviour of our proposed approach. We evaluated the performance of our approach under several scenarios and showed that it still improves the network lifetime.
{"title":"A robust cooperation approach for mobile multimedia adhoc networks","authors":"J. Bahi, M. Eskandar, A. Mostefaoui","doi":"10.1109/ICDIM.2008.4746759","DOIUrl":"https://doi.org/10.1109/ICDIM.2008.4746759","url":null,"abstract":"In wireless ad hoc networks, nodes are energy constrained. As they communicate far off destinations using intermediate relays, it may not be in interest of a node to expend its energy in relaying and consequently reducing its own lifetime. On the other hand, if all nodes decide not to always accept relay requests, the network throughput will drop dramatically i.e., the lifetime of the whole network is reduced. Obviously, from a single node point of view, these two extreme attitudes are opposite to its interest. We addressed this issue by proposing a novel distributed approach that guarantees tasks affectation to nodes with regard to their energy constraints. The key idea behind is to guarantee to all nodes that they share tasks in function of their energy provisions. In this paper, we tackle the problem of nodes mobility and its impact on the behaviour of our proposed approach. We evaluated the performance of our approach under several scenarios and showed that it still improves the network lifetime.","PeriodicalId":415013,"journal":{"name":"2008 Third International Conference on Digital Information Management","volume":"49 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2008-11-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"121925093","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}
One important field where mobile technology can make significant contributions is education. However one criticism in mobile education is that students receive impersonal teaching. Affective computing may give a solution to this problem. In this paper we describe an affective bi-modal educational system for mobile devices. In our research we describe a novel approach of combining information from two modalities namely the keyboard and the microphone through a multi-criteria decision making theory.
{"title":"Mobile education: Towards affective bi-modal interaction for adaptivity","authors":"Efthymios Alepis, M. Virvou, K. Kabassi","doi":"10.3991/ijim.v3i2.774","DOIUrl":"https://doi.org/10.3991/ijim.v3i2.774","url":null,"abstract":"One important field where mobile technology can make significant contributions is education. However one criticism in mobile education is that students receive impersonal teaching. Affective computing may give a solution to this problem. In this paper we describe an affective bi-modal educational system for mobile devices. In our research we describe a novel approach of combining information from two modalities namely the keyboard and the microphone through a multi-criteria decision making theory.","PeriodicalId":415013,"journal":{"name":"2008 Third International Conference on Digital Information Management","volume":"16 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2008-11-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"121284997","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}
Pub Date : 2008-11-01DOI: 10.1109/ICDIM.2008.4746704
A. Lipitakis
In this paper we show that e-business and strategic management problems in digital information management (DIM) methodologies and smart environments (SE) can be efficiently solved by using corresponding adaptive algorithmic procedures. Case studies representing characteristic e-business problems and strategic management methodologies in DIM & SE are presented by considering the proposed algorithmic approach. The adaptability and compactness of the proposed algorithmic schemes combined by the proper choice of singular perturbation parameters allow the (near) optimum solution of a wide class e-business and strategic management problems in digital information management and smart environments.
{"title":"E-business and strategy management in Digital Information Management methodologies: An adaptive algorithmic approach","authors":"A. Lipitakis","doi":"10.1109/ICDIM.2008.4746704","DOIUrl":"https://doi.org/10.1109/ICDIM.2008.4746704","url":null,"abstract":"In this paper we show that e-business and strategic management problems in digital information management (DIM) methodologies and smart environments (SE) can be efficiently solved by using corresponding adaptive algorithmic procedures. Case studies representing characteristic e-business problems and strategic management methodologies in DIM & SE are presented by considering the proposed algorithmic approach. The adaptability and compactness of the proposed algorithmic schemes combined by the proper choice of singular perturbation parameters allow the (near) optimum solution of a wide class e-business and strategic management problems in digital information management and smart environments.","PeriodicalId":415013,"journal":{"name":"2008 Third International Conference on Digital Information Management","volume":"53 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2008-11-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"116453198","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}
Pub Date : 2008-11-01DOI: 10.1109/ICDIM.2008.4746775
Hasina Attaullah, F. Iqbal, M. Javed
In order to sustain connection and service in heterogeneous wireless environment, vertical handover is necessary. Now-a-days research focus is to optimize vertical handover so that optimized and application specific (QoS based) handover can be made possible. In this paper, an intelligent approach to vertical handover is proposed. The fuzzy logic based decision making is used to select among the available networks. Triggers and events are used to generate the input which is sent to fuzzy expert system. In this way, the intelligent selection of networks can optimize vertical handover and improve QoS of real-time application running on mobile device which is roaming around heterogeneous wireless networks.
{"title":"Intelligent vertical handover decision model to improve QoS","authors":"Hasina Attaullah, F. Iqbal, M. Javed","doi":"10.1109/ICDIM.2008.4746775","DOIUrl":"https://doi.org/10.1109/ICDIM.2008.4746775","url":null,"abstract":"In order to sustain connection and service in heterogeneous wireless environment, vertical handover is necessary. Now-a-days research focus is to optimize vertical handover so that optimized and application specific (QoS based) handover can be made possible. In this paper, an intelligent approach to vertical handover is proposed. The fuzzy logic based decision making is used to select among the available networks. Triggers and events are used to generate the input which is sent to fuzzy expert system. In this way, the intelligent selection of networks can optimize vertical handover and improve QoS of real-time application running on mobile device which is roaming around heterogeneous wireless networks.","PeriodicalId":415013,"journal":{"name":"2008 Third International Conference on Digital Information Management","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2008-11-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"130338268","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}
Pub Date : 2008-11-01DOI: 10.1109/ICDIM.2008.4746847
Marco Aravena Vivar, Andrés Alejandro Ramos Magna
This article presents the design, implementation and use of a remote network lab as an aid to support teaching computer networks. The purpose is to enable students complement the learning of the theory with practical experimentation in networking devices from any room with Internet access. Unlike the current solutions based on mainly emulation and simulation software, the remote laboratory presented is a server and a Web application that allows the students to interact remotely with commercial network devices, such as cutting-edge switches, routers and firewall that are widely used in the workplace. This proposal reduces the expenses of installing new laboratories and moving students who are far from their classrooms. The use of the remote laboratory has been compared, by means of a quasi- experiment, to the use of traditional network labs with seniors students of computing engineering. The outcomes show a similarity between both approaches, turning the remote network lab an effective tool to support teaching computer network.
{"title":"Design, implementation and use of a remote network lab as an aid to support teaching computer network","authors":"Marco Aravena Vivar, Andrés Alejandro Ramos Magna","doi":"10.1109/ICDIM.2008.4746847","DOIUrl":"https://doi.org/10.1109/ICDIM.2008.4746847","url":null,"abstract":"This article presents the design, implementation and use of a remote network lab as an aid to support teaching computer networks. The purpose is to enable students complement the learning of the theory with practical experimentation in networking devices from any room with Internet access. Unlike the current solutions based on mainly emulation and simulation software, the remote laboratory presented is a server and a Web application that allows the students to interact remotely with commercial network devices, such as cutting-edge switches, routers and firewall that are widely used in the workplace. This proposal reduces the expenses of installing new laboratories and moving students who are far from their classrooms. The use of the remote laboratory has been compared, by means of a quasi- experiment, to the use of traditional network labs with seniors students of computing engineering. The outcomes show a similarity between both approaches, turning the remote network lab an effective tool to support teaching computer network.","PeriodicalId":415013,"journal":{"name":"2008 Third International Conference on Digital Information Management","volume":"22 6 Suppl 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2008-11-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"116644188","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}
Pub Date : 2008-11-01DOI: 10.1109/ICDIM.2008.4746776
A. Melouah, H. Merouani
A new hybrid approach for mammography segmentation is suggested in this work. The segmentations proceed by refining successively, in a way that macro regions at each step are recovered. Two segmentation techniques, thresholding and Markov field, enter in competition to segment theses regions. The technique which gives the best results according to a given criterion will take on the process. However, using the same segmentation for all macro regions is not necessary. Thus, the new obtained regions will become candidates for a novel segmentation. The process continues till verification of a stop criterion.
{"title":"Hierarchical segmentation of digital mammography by agents competition","authors":"A. Melouah, H. Merouani","doi":"10.1109/ICDIM.2008.4746776","DOIUrl":"https://doi.org/10.1109/ICDIM.2008.4746776","url":null,"abstract":"A new hybrid approach for mammography segmentation is suggested in this work. The segmentations proceed by refining successively, in a way that macro regions at each step are recovered. Two segmentation techniques, thresholding and Markov field, enter in competition to segment theses regions. The technique which gives the best results according to a given criterion will take on the process. However, using the same segmentation for all macro regions is not necessary. Thus, the new obtained regions will become candidates for a novel segmentation. The process continues till verification of a stop criterion.","PeriodicalId":415013,"journal":{"name":"2008 Third International Conference on Digital Information Management","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2008-11-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"131154814","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}
Pub Date : 2008-11-01DOI: 10.1109/ICDIM.2008.4746758
S. Caballé, F. Xhafa, A. Abraham
The discussion process plays an important social task in Computer-Supported Collaborative Learning (CSCL) where participants can discuss about the activity being performed, collaborate with each other through the exchange of ideas that may arise, propose new resolution mechanisms, and justify and refine their own contributions, and as a result acquire new knowledge. Indeed, learning by discussion when applied to collaborative learning scenarios can provide significant benefits for students in collaborative learning, and in education in general. As a result, current educational organizations incorporate in-class online discussions into web-based courses as part of the very rationale of their pedagogical models. However, online discussions as collaborative learning activities are usually greatly participated and contributed, which makes the monitoring and assessment tasks time-consuming, tedious and error-prone. Specially hard if not impossible by humans is to manually deal with the sequences of hundreds of contributions making up the discussion threads and the relations between these contributions. As a result, current assessment in online discussions restricts to offer evaluation results of the content quality of contributions after the completion of the collaborative learning task and neglects the essential issue of constantly assessing the knowledge building as a whole while it is still being generated. In this paper, we propose a multidimensional model based on data analysis from online collaborative discussion interaction that provides a first step towards an automatic assessment in (almost) real time. The context of this study is a real on-line discussion experience that took place at the Open University of Catalonia.
{"title":"Towards an automatic real-time assessment of online discussions in Computer-Supported Collaborative Learning practices","authors":"S. Caballé, F. Xhafa, A. Abraham","doi":"10.1109/ICDIM.2008.4746758","DOIUrl":"https://doi.org/10.1109/ICDIM.2008.4746758","url":null,"abstract":"The discussion process plays an important social task in Computer-Supported Collaborative Learning (CSCL) where participants can discuss about the activity being performed, collaborate with each other through the exchange of ideas that may arise, propose new resolution mechanisms, and justify and refine their own contributions, and as a result acquire new knowledge. Indeed, learning by discussion when applied to collaborative learning scenarios can provide significant benefits for students in collaborative learning, and in education in general. As a result, current educational organizations incorporate in-class online discussions into web-based courses as part of the very rationale of their pedagogical models. However, online discussions as collaborative learning activities are usually greatly participated and contributed, which makes the monitoring and assessment tasks time-consuming, tedious and error-prone. Specially hard if not impossible by humans is to manually deal with the sequences of hundreds of contributions making up the discussion threads and the relations between these contributions. As a result, current assessment in online discussions restricts to offer evaluation results of the content quality of contributions after the completion of the collaborative learning task and neglects the essential issue of constantly assessing the knowledge building as a whole while it is still being generated. In this paper, we propose a multidimensional model based on data analysis from online collaborative discussion interaction that provides a first step towards an automatic assessment in (almost) real time. The context of this study is a real on-line discussion experience that took place at the Open University of Catalonia.","PeriodicalId":415013,"journal":{"name":"2008 Third International Conference on Digital Information Management","volume":"15 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2008-11-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"134017031","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}
Pub Date : 2008-11-01DOI: 10.1109/ICDIM.2008.4746705
R. Souza, F. Cysneiros, D. C. F. Queiroz, Roberta Fagundes
This paper introduces two classifiers for interval symbolic data based on logit and probit regression models, respectively. Each example of the learning set is described by a feature vector, for which each feature value is an interval and a binary response that defines the class of this example. For each classifier two versions are considered. First fits a classic binary regression model conjointly on the lower and upper bounds of the interval values assumed by the variables in the learning set. Second fits a classic binary regression model separately on the lower and upper bounds of the intervals. The prediction of the class for new examples is accomplished from the computation of the posterior probabilities of the classes. To show the usefulness of this method, examples with synthetic symbolic data sets with overlapping classes are considered.
{"title":"Two pattern classifiers for interval data based on binary regression models","authors":"R. Souza, F. Cysneiros, D. C. F. Queiroz, Roberta Fagundes","doi":"10.1109/ICDIM.2008.4746705","DOIUrl":"https://doi.org/10.1109/ICDIM.2008.4746705","url":null,"abstract":"This paper introduces two classifiers for interval symbolic data based on logit and probit regression models, respectively. Each example of the learning set is described by a feature vector, for which each feature value is an interval and a binary response that defines the class of this example. For each classifier two versions are considered. First fits a classic binary regression model conjointly on the lower and upper bounds of the interval values assumed by the variables in the learning set. Second fits a classic binary regression model separately on the lower and upper bounds of the intervals. The prediction of the class for new examples is accomplished from the computation of the posterior probabilities of the classes. To show the usefulness of this method, examples with synthetic symbolic data sets with overlapping classes are considered.","PeriodicalId":415013,"journal":{"name":"2008 Third International Conference on Digital Information Management","volume":"108 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2008-11-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"132976975","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}
京公网安备 11010802042870号
京ICP备2023020795号-1
扫码关注我们
求助内容：
应助结果提醒方式：