Pub Date : 2009-12-15DOI: 10.1109/IIT.2009.5413776
T. Khan, T. Paul, G. M. Shahabuddin, K. Wahid, A. H. Chowdhury, S. Kabir
Gas is an important source of energy in this world. At this age of energy crisis, gas must be utilized wisely and carefully. In this paper, a design of a smart card based prepaid gas metering system has been presented. Prepaid gas meter will make the consumers more conscious to utilize gas carefully and also it promises easy, fast and accurate billing scheme. The entire system is designed with the state-of-the-art digital and information technology. A prototype of the system has been developed and tested.
{"title":"Towards design of a smart prepaid gas metering system","authors":"T. Khan, T. Paul, G. M. Shahabuddin, K. Wahid, A. H. Chowdhury, S. Kabir","doi":"10.1109/IIT.2009.5413776","DOIUrl":"https://doi.org/10.1109/IIT.2009.5413776","url":null,"abstract":"Gas is an important source of energy in this world. At this age of energy crisis, gas must be utilized wisely and carefully. In this paper, a design of a smart card based prepaid gas metering system has been presented. Prepaid gas meter will make the consumers more conscious to utilize gas carefully and also it promises easy, fast and accurate billing scheme. The entire system is designed with the state-of-the-art digital and information technology. A prototype of the system has been developed and tested.","PeriodicalId":239829,"journal":{"name":"2009 International Conference on Innovations in Information Technology (IIT)","volume":"64 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2009-12-15","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"117242177","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 : 2009-12-15DOI: 10.1109/IIT.2009.5413363
S. Bani-Ahmad, G. Ozsoyoglu
Within publication digital collections, citation analysis and publication score assignment are commonly used (i) to evaluate the impact of publications (and scientific collections, e.g., journals and conferences), and (ii) to order digital collection search outputs, e.g., Google Scholar. The popular citation-based web page (and, thus, publication) score measure PageRank is criticized for (a) computing only the current (and, thus, time-independent) publication scores, and (b) not taking into account the fact that citation graphs continuously evolve. Thus, the use of PageRank as is results in penalizing recent publications that have not yet developed enough popularity to receive citations. In order to overcome this inherent bias of PageRank and other citation-based popularity measures, Cho et. al. defined Page Quality for a webpage as its popularity after large numbers of web users become aware of it. Page Quality is based on the assumption that popularity evolves over time. In this paper, we (i) experimentally validate that PageRank scores of publications, as they change over time, follow the logistic growth model that often arises in the context of population growth, (ii) model one aspect of researchers' citation behavior in technology-driven fields (such as computer science) where authors tend not to cite old publications, (iii) argue and empirically verify that publication popularity, unlike web page popularity, has two distinct phases, namely, the popularity growth phase and the popularity decay phase, and (iv) extend the popularity growth model developed by Cho et. al. to capture the popularity decay phase. All of our claims are empirically verified using the ACM SIGMOD Anthology digital collection.
{"title":"On popularity quality: Growth and decay phases of publication popularities","authors":"S. Bani-Ahmad, G. Ozsoyoglu","doi":"10.1109/IIT.2009.5413363","DOIUrl":"https://doi.org/10.1109/IIT.2009.5413363","url":null,"abstract":"Within publication digital collections, citation analysis and publication score assignment are commonly used (i) to evaluate the impact of publications (and scientific collections, e.g., journals and conferences), and (ii) to order digital collection search outputs, e.g., Google Scholar. The popular citation-based web page (and, thus, publication) score measure PageRank is criticized for (a) computing only the current (and, thus, time-independent) publication scores, and (b) not taking into account the fact that citation graphs continuously evolve. Thus, the use of PageRank as is results in penalizing recent publications that have not yet developed enough popularity to receive citations. In order to overcome this inherent bias of PageRank and other citation-based popularity measures, Cho et. al. defined Page Quality for a webpage as its popularity after large numbers of web users become aware of it. Page Quality is based on the assumption that popularity evolves over time. In this paper, we (i) experimentally validate that PageRank scores of publications, as they change over time, follow the logistic growth model that often arises in the context of population growth, (ii) model one aspect of researchers' citation behavior in technology-driven fields (such as computer science) where authors tend not to cite old publications, (iii) argue and empirically verify that publication popularity, unlike web page popularity, has two distinct phases, namely, the popularity growth phase and the popularity decay phase, and (iv) extend the popularity growth model developed by Cho et. al. to capture the popularity decay phase. All of our claims are empirically verified using the ACM SIGMOD Anthology digital collection.","PeriodicalId":239829,"journal":{"name":"2009 International Conference on Innovations in Information Technology (IIT)","volume":"22 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2009-12-15","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"114691888","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 : 2009-12-15DOI: 10.1109/IIT.2009.5413368
Jaejong Baek, Joo-Seok Song, Sunghoon Seo
Seamless handoff issues including authentications have become considerable interest in wireless networks, which support pervasive environment users. Usually the active scanning and preauthentication methods are adopted to solve the disruption in seamless services. In this paper, we propose a new preauthentication scheme based on the fast channel switching and the power saving mode (PSM) in public wireless local area networks (LANs). We prove the effect of our proposed scheme using the simulation programming results. During the channel switching period (CPS), our proposed scheme performs multiple preauthentication with pre-scanned neighbor Access Points (APs). By using very short period of channel switching, our scheme doe not degrade Quality-of-Service (QoS) of its current applications. It also reduces the authentication latency in handoffs and improves the random mobility of users. In addition, our scheme only requires minor implementation changes on the client device driver, so it is apt for being deployed in current WLANs environment.
{"title":"Multiple preauthentication schemes based on fast channel switching in public Wireless LANs","authors":"Jaejong Baek, Joo-Seok Song, Sunghoon Seo","doi":"10.1109/IIT.2009.5413368","DOIUrl":"https://doi.org/10.1109/IIT.2009.5413368","url":null,"abstract":"Seamless handoff issues including authentications have become considerable interest in wireless networks, which support pervasive environment users. Usually the active scanning and preauthentication methods are adopted to solve the disruption in seamless services. In this paper, we propose a new preauthentication scheme based on the fast channel switching and the power saving mode (PSM) in public wireless local area networks (LANs). We prove the effect of our proposed scheme using the simulation programming results. During the channel switching period (CPS), our proposed scheme performs multiple preauthentication with pre-scanned neighbor Access Points (APs). By using very short period of channel switching, our scheme doe not degrade Quality-of-Service (QoS) of its current applications. It also reduces the authentication latency in handoffs and improves the random mobility of users. In addition, our scheme only requires minor implementation changes on the client device driver, so it is apt for being deployed in current WLANs environment.","PeriodicalId":239829,"journal":{"name":"2009 International Conference on Innovations in Information Technology (IIT)","volume":"9 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2009-12-15","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"131288869","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 : 2009-12-15DOI: 10.1109/IIT.2009.5413780
Zahra Aghajani, M. A. Azgomi
One of the drawbacks of the existing majority voters, which are widely used in N-version programming (NVP) technique, is the high probability of agreement on incorrect results generated by variants. Therefore, to propose an intrusion-tolerant software architecture based on NVP for hostile environments and to consider possible attacks, a new voting scheme is required. In this paper, we propose a voting scheme to improve the correctness of the binary majority voters in the hostile environments to treat the situations that more than half of the variants may have been compromised. We have used stochastic activity networks (SANs) to model the scheme for a triple-version programming (3VP) system and measure the probability of detecting the correct outputs by the voter. The evaluation results showed that the proposed scheme can improve the correctness of the classic majority voting algorithms to detect the correct output, especially the intrusion detection mechanisms are used in the scheme.
{"title":"A majority voter for intrusion tolerant software based on N-version programming techniques","authors":"Zahra Aghajani, M. A. Azgomi","doi":"10.1109/IIT.2009.5413780","DOIUrl":"https://doi.org/10.1109/IIT.2009.5413780","url":null,"abstract":"One of the drawbacks of the existing majority voters, which are widely used in N-version programming (NVP) technique, is the high probability of agreement on incorrect results generated by variants. Therefore, to propose an intrusion-tolerant software architecture based on NVP for hostile environments and to consider possible attacks, a new voting scheme is required. In this paper, we propose a voting scheme to improve the correctness of the binary majority voters in the hostile environments to treat the situations that more than half of the variants may have been compromised. We have used stochastic activity networks (SANs) to model the scheme for a triple-version programming (3VP) system and measure the probability of detecting the correct outputs by the voter. The evaluation results showed that the proposed scheme can improve the correctness of the classic majority voting algorithms to detect the correct output, especially the intrusion detection mechanisms are used in the scheme.","PeriodicalId":239829,"journal":{"name":"2009 International Conference on Innovations in Information Technology (IIT)","volume":"22 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2009-12-15","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"131076087","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 : 2009-12-15DOI: 10.1109/IIT.2009.5413630
N. Mavridis, Asma Al Rashdi, Maryam Al Ketbi, Sara Al Ketbi, Alia Marar
Constructionism, a term first coined by Seymour Papert, is a learning theory based on constructivism, which however also holds that learning can happen most effectively when people are also active in making objects in the real world. In this paper, we will present a case study of an application of constructionism at the undergraduate senior project level. More specifically, we will describe a robotics project that took place in our lab, which aimed towards providing a strong hands-on background in the basics of robotics and the fundamentals of the research process to a group of four final-year students. During this project, the students experienced basics of team working, flexible project management, and intra- as well as extra-group constructionist tuition, as well as aspects of real-world research. Furthermore, they were able to gain experience in three programming languages, build and successfully demonstrate basic behaviors and collaborative mapping using the Mindstorms robots, and create a theoretical framework incorporating and providing novel extensions to their methods.
{"title":"Exploring behaviors & collaborative mapping through Mindstorms robots: A case study in applied social constructionism at senior-project level","authors":"N. Mavridis, Asma Al Rashdi, Maryam Al Ketbi, Sara Al Ketbi, Alia Marar","doi":"10.1109/IIT.2009.5413630","DOIUrl":"https://doi.org/10.1109/IIT.2009.5413630","url":null,"abstract":"Constructionism, a term first coined by Seymour Papert, is a learning theory based on constructivism, which however also holds that learning can happen most effectively when people are also active in making objects in the real world. In this paper, we will present a case study of an application of constructionism at the undergraduate senior project level. More specifically, we will describe a robotics project that took place in our lab, which aimed towards providing a strong hands-on background in the basics of robotics and the fundamentals of the research process to a group of four final-year students. During this project, the students experienced basics of team working, flexible project management, and intra- as well as extra-group constructionist tuition, as well as aspects of real-world research. Furthermore, they were able to gain experience in three programming languages, build and successfully demonstrate basic behaviors and collaborative mapping using the Mindstorms robots, and create a theoretical framework incorporating and providing novel extensions to their methods.","PeriodicalId":239829,"journal":{"name":"2009 International Conference on Innovations in Information Technology (IIT)","volume":"30 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2009-12-15","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"116060441","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 : 2009-12-15DOI: 10.1109/IIT.2009.5413784
N. Katuk, A. Sarrafzadeh, F. Dadgostar
Intelligent tutoring systems (ITSs) have been proven effective in supporting students' learning activities, but the actual utilization of ITSs has not been confirmed. Delegation of development tasks from developers to teachers through the use of ITS authoring tools (ITSATs) is not promoting rapid progress in this area of research. Designing ITSs using ITSATs by teachers seems to be difficult to realize. This could be affected by insufficient features in ITASTs which meet teachers' requirements. This paper presents feature analysis of ITSATs. In this study, we examined two categories of features: authoring environment and lesson content creation. The study focuses on three ITSAT namely CTAT, ASPIRE and Assistment Buider. We investigated the availability of such features in those ITSAT and propose ITSAT features which could meet teachers' requirements in using ITSAT to design ITS.
{"title":"Effective ways of encouraging teachers to design and use ITS: feature analysis of intelligent tutoring systems authoring tools","authors":"N. Katuk, A. Sarrafzadeh, F. Dadgostar","doi":"10.1109/IIT.2009.5413784","DOIUrl":"https://doi.org/10.1109/IIT.2009.5413784","url":null,"abstract":"Intelligent tutoring systems (ITSs) have been proven effective in supporting students' learning activities, but the actual utilization of ITSs has not been confirmed. Delegation of development tasks from developers to teachers through the use of ITS authoring tools (ITSATs) is not promoting rapid progress in this area of research. Designing ITSs using ITSATs by teachers seems to be difficult to realize. This could be affected by insufficient features in ITASTs which meet teachers' requirements. This paper presents feature analysis of ITSATs. In this study, we examined two categories of features: authoring environment and lesson content creation. The study focuses on three ITSAT namely CTAT, ASPIRE and Assistment Buider. We investigated the availability of such features in those ITSAT and propose ITSAT features which could meet teachers' requirements in using ITSAT to design ITS.","PeriodicalId":239829,"journal":{"name":"2009 International Conference on Innovations in Information Technology (IIT)","volume":"22 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2009-12-15","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"123964707","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 : 2009-12-15DOI: 10.1109/IIT.2009.5413631
W. Ibrahim, Valeriu Beiu
The high-level approach for estimating circuit reliability tends to consider the probability of failure of a logic gate as a constant, and work towards the higher levels. With scaling, such gate-centric approaches become highly inaccurate, as both transistors and input vectors drastically affect the probability of failure of the logic gates. This paper will present a transistor-level gate failure analysis starting from threshold voltage variations. We will briefly review the state-of-the-art, and rely upon freshly reported results for threshold voltage variations. These will be used to estimate the probabilities of failure of a classical NAND-2 CMOS gate for (a few) different technologies, voltages, and input vectors. They will also reveal huge differences between the highest and the lowest probabilities of failure, and will show how strongly these are affected by the supply voltage.
{"title":"Reliability of NAND-2 CMOS gates from threshold voltage variations","authors":"W. Ibrahim, Valeriu Beiu","doi":"10.1109/IIT.2009.5413631","DOIUrl":"https://doi.org/10.1109/IIT.2009.5413631","url":null,"abstract":"The high-level approach for estimating circuit reliability tends to consider the probability of failure of a logic gate as a constant, and work towards the higher levels. With scaling, such gate-centric approaches become highly inaccurate, as both transistors and input vectors drastically affect the probability of failure of the logic gates. This paper will present a transistor-level gate failure analysis starting from threshold voltage variations. We will briefly review the state-of-the-art, and rely upon freshly reported results for threshold voltage variations. These will be used to estimate the probabilities of failure of a classical NAND-2 CMOS gate for (a few) different technologies, voltages, and input vectors. They will also reveal huge differences between the highest and the lowest probabilities of failure, and will show how strongly these are affected by the supply voltage.","PeriodicalId":239829,"journal":{"name":"2009 International Conference on Innovations in Information Technology (IIT)","volume":"5 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2009-12-15","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"129725189","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 : 2009-12-15DOI: 10.1109/IIT.2009.5413771
A. Hosseini, M. A. Azgomi
Constraints are an important topic in any access control mechanism. Always, there are demands for defining new constraints or generalizing the existing ones in order to better managing and controlling organizations and specifying new policies. Among access control models, role-based access control (RBAC) is very useful and is continuously under development. In this paper, we propose a new constraint in the RBAC model based on dependent roles that we call combination of duty (CD). Furthermore, static and dynamic types of this constraint are also defined. In addition, these constraints and the two existing constraints in RBAC model (i.e. static and dynamic separation of duty (SD)) are generalized in the base of history as static historical SD, dynamic historical SD, static historical CD and dynamic historical CD.
{"title":"Combination of duty and historical constraints in role-based access control","authors":"A. Hosseini, M. A. Azgomi","doi":"10.1109/IIT.2009.5413771","DOIUrl":"https://doi.org/10.1109/IIT.2009.5413771","url":null,"abstract":"Constraints are an important topic in any access control mechanism. Always, there are demands for defining new constraints or generalizing the existing ones in order to better managing and controlling organizations and specifying new policies. Among access control models, role-based access control (RBAC) is very useful and is continuously under development. In this paper, we propose a new constraint in the RBAC model based on dependent roles that we call combination of duty (CD). Furthermore, static and dynamic types of this constraint are also defined. In addition, these constraints and the two existing constraints in RBAC model (i.e. static and dynamic separation of duty (SD)) are generalized in the base of history as static historical SD, dynamic historical SD, static historical CD and dynamic historical CD.","PeriodicalId":239829,"journal":{"name":"2009 International Conference on Innovations in Information Technology (IIT)","volume":"21 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2009-12-15","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"121436717","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 : 2009-12-15DOI: 10.1109/IIT.2009.5413402
F. Allan, M. Hajji
Multi-layer boundary value problems have received a great deal of attention in the past few years. This is due to the fact that they model many engineering applications. Examples of applications include fluid flow though multi-layers porous media such as ground water and oil reservoirs. In this work, we present a new method for solving multilayer boundary value problems. The method is based on an efficient adaption of the classical shooting method, where boundary value problems are solved for by means of solving a sequence of initial value problems. Illustration of the method is presented on application to fluid flow through multi-layer porous media. The examples presented suggested that the method is reliable and accurate.
{"title":"Multi-layer parallel shooting method for multi-layer boundary value problems","authors":"F. Allan, M. Hajji","doi":"10.1109/IIT.2009.5413402","DOIUrl":"https://doi.org/10.1109/IIT.2009.5413402","url":null,"abstract":"Multi-layer boundary value problems have received a great deal of attention in the past few years. This is due to the fact that they model many engineering applications. Examples of applications include fluid flow though multi-layers porous media such as ground water and oil reservoirs. In this work, we present a new method for solving multilayer boundary value problems. The method is based on an efficient adaption of the classical shooting method, where boundary value problems are solved for by means of solving a sequence of initial value problems. Illustration of the method is presented on application to fluid flow through multi-layer porous media. The examples presented suggested that the method is reliable and accurate.","PeriodicalId":239829,"journal":{"name":"2009 International Conference on Innovations in Information Technology (IIT)","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2009-12-15","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"115725536","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 : 2009-12-15DOI: 10.1109/IIT.2009.5413769
Ahmad F. Klaib, H. Osborne
Huge amounts of biological data are stored in linear files. Biological proteins are sequences of amino acids. The quantities of data in these fields tend to increase year on year. String matching algorithms play a key role in many computer science problems, and in the implementation of computer software. For this reason efficient string-matching algorithms should be used which use minimal computer storage and which minimize the searching response time. In this study, we propose a new algorithm called the Random String Matching Algorithm (RSMA). RSMA combines our enhanced preprocessing phase from the Berry Ravindran algorithm with our proposed new searching phase procedure. This variety of searching order allows our proposed algorithm to reduce the number of comparison characters and enhances the searching response time. Experimental results show that the RSMA algorithm offers a smaller number of comparisons and offers improved elapsed searching time when compared to other well-known algorithms.
{"title":"RSMA Matching Algorithm for searching biological sequences","authors":"Ahmad F. Klaib, H. Osborne","doi":"10.1109/IIT.2009.5413769","DOIUrl":"https://doi.org/10.1109/IIT.2009.5413769","url":null,"abstract":"Huge amounts of biological data are stored in linear files. Biological proteins are sequences of amino acids. The quantities of data in these fields tend to increase year on year. String matching algorithms play a key role in many computer science problems, and in the implementation of computer software. For this reason efficient string-matching algorithms should be used which use minimal computer storage and which minimize the searching response time. In this study, we propose a new algorithm called the Random String Matching Algorithm (RSMA). RSMA combines our enhanced preprocessing phase from the Berry Ravindran algorithm with our proposed new searching phase procedure. This variety of searching order allows our proposed algorithm to reduce the number of comparison characters and enhances the searching response time. Experimental results show that the RSMA algorithm offers a smaller number of comparisons and offers improved elapsed searching time when compared to other well-known algorithms.","PeriodicalId":239829,"journal":{"name":"2009 International Conference on Innovations in Information Technology (IIT)","volume":"58 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2009-12-15","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"128484978","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
扫码关注我们
求助内容：
应助结果提醒方式：