Abhijit R. Tendulkar, N. Stojanovic, Robert Barber
Whole genome association studies of the genetic underpinnings of complex phenotypes, and human diseases in particular, have been steadily gaining momentum over the past several years. Yet, the number of polymorphic sites in the human genome, including, but not limited to, single nucleotide polymorphisms (SNPs) is so large that identifying the combination of these few that have a significant effect on the condition of interest remains an overwhelming task. In this manuscript we present a new networked solution, and a program GeneNAB implementing it, to the computational identification and ranking of SNPs likely to be relevant for the phenotype of interest, genome-wide. We expect that the output of this program will be useful to guide further laboratory and clinical studies of these SNPs.
{"title":"Web–Enabled Classification of SNPs for Genome–Wide Association Studies","authors":"Abhijit R. Tendulkar, N. Stojanovic, Robert Barber","doi":"10.1109/ICIT.2008.65","DOIUrl":"https://doi.org/10.1109/ICIT.2008.65","url":null,"abstract":"Whole genome association studies of the genetic underpinnings of complex phenotypes, and human diseases in particular, have been steadily gaining momentum over the past several years. Yet, the number of polymorphic sites in the human genome, including, but not limited to, single nucleotide polymorphisms (SNPs) is so large that identifying the combination of these few that have a significant effect on the condition of interest remains an overwhelming task. In this manuscript we present a new networked solution, and a program GeneNAB implementing it, to the computational identification and ranking of SNPs likely to be relevant for the phenotype of interest, genome-wide. We expect that the output of this program will be useful to guide further laboratory and clinical studies of these SNPs.","PeriodicalId":184201,"journal":{"name":"2008 International Conference on Information Technology","volume":"15 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2008-12-17","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"127637562","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}
Specification-based testing, also called black-box testing, involves producing a test suite based on the specification. Using a formal language or a model for specification helps in automation of the test generation process. For large and complex systems, testing based on covering the control flow or data flow paths becomes infeasible. In this regard, an efficient set of test scenarios need to be generated. One of the main objectives of testing is to check whether customer requirements are met. Scenarios help in generating sequence of events that represent the purpose of a system. Requirements are well defined using activity diagrams and this has led to an increased interest on generating test scenarios using activity diagrams. Each path from the initial node to the final node in an activity diagram constitutes a test scenario. The problem encountered following the strategy is exponential increase in test scenarios when considering concurrent activities, represented in an activity diagram using fork-join nodes. In this paper, we investigate this problem and have observed that the growth in test scenarios can be limited by considering domain dependency existing among concurrent activities. The paper proposes a method to automate the test scenario generation process.
{"title":"Automated Scenario Generation Based on UML Activity Diagrams","authors":"G. SapnaP., H. Mohanty","doi":"10.1109/ICIT.2008.52","DOIUrl":"https://doi.org/10.1109/ICIT.2008.52","url":null,"abstract":"Specification-based testing, also called black-box testing, involves producing a test suite based on the specification. Using a formal language or a model for specification helps in automation of the test generation process. For large and complex systems, testing based on covering the control flow or data flow paths becomes infeasible. In this regard, an efficient set of test scenarios need to be generated. One of the main objectives of testing is to check whether customer requirements are met. Scenarios help in generating sequence of events that represent the purpose of a system. Requirements are well defined using activity diagrams and this has led to an increased interest on generating test scenarios using activity diagrams. Each path from the initial node to the final node in an activity diagram constitutes a test scenario. The problem encountered following the strategy is exponential increase in test scenarios when considering concurrent activities, represented in an activity diagram using fork-join nodes. In this paper, we investigate this problem and have observed that the growth in test scenarios can be limited by considering domain dependency existing among concurrent activities. The paper proposes a method to automate the test scenario generation process.","PeriodicalId":184201,"journal":{"name":"2008 International Conference on Information Technology","volume":"28 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2008-12-17","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"131172768","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}
Debajyoti Mukhopadhyay, R. Dutta, A. Kundu, R. Dattagupta
This paper presents an alternative product recommendation system for Business-to-customer e-commerce purposes. The system recommends the products to a new user. It depends on the purchase pattern of previous users whose purchase pattern are close to that of new user. The system is based on vector space model to find out the closest user profile among the profiles of all users in database. It also implements Association rule mining based recommendation system, taking into consideration the order of purchase, in recommending more than one product. To make the association rule memory-efficient, cellular automata is used.
{"title":"A Product Recommendation System Using Vector Space Model and Association Rule","authors":"Debajyoti Mukhopadhyay, R. Dutta, A. Kundu, R. Dattagupta","doi":"10.1109/ICIT.2008.48","DOIUrl":"https://doi.org/10.1109/ICIT.2008.48","url":null,"abstract":"This paper presents an alternative product recommendation system for Business-to-customer e-commerce purposes. The system recommends the products to a new user. It depends on the purchase pattern of previous users whose purchase pattern are close to that of new user. The system is based on vector space model to find out the closest user profile among the profiles of all users in database. It also implements Association rule mining based recommendation system, taking into consideration the order of purchase, in recommending more than one product. To make the association rule memory-efficient, cellular automata is used.","PeriodicalId":184201,"journal":{"name":"2008 International Conference on Information Technology","volume":"35 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2008-12-17","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"133737730","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}
Policy Enforcer is an online monitoring tool for detecting security violations in a multi domain environment where the network, system and service are the multiple domains. One can ensure security for a network service by protecting the sensitive resources at these three domains. This paper presents the various design issues of policy enforcer, which have the performance impact in terms of detection-rate, response-time and protection-rate against resource security violations.
{"title":"Design Issues of a Policy Enforcer to Secure Multi-domain Environment","authors":"A. Rao, H. Mohanty","doi":"10.1109/ICIT.2008.58","DOIUrl":"https://doi.org/10.1109/ICIT.2008.58","url":null,"abstract":"Policy Enforcer is an online monitoring tool for detecting security violations in a multi domain environment where the network, system and service are the multiple domains. One can ensure security for a network service by protecting the sensitive resources at these three domains. This paper presents the various design issues of policy enforcer, which have the performance impact in terms of detection-rate, response-time and protection-rate against resource security violations.","PeriodicalId":184201,"journal":{"name":"2008 International Conference on Information Technology","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2008-12-17","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"124045456","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}
Baikuntha Narayan Biswal, Pragyan Nanda, D. Mohapatra
Testing of software is a time-consuming activity which requires a great deal of planning and resources. Model-based testing is gaining importance as a research issue. In scenario-based testing, test scenarios are used for generating test cases, test drivers etc. UML is widely used to describe analysis and design specifications of software development. UML models are important source of information for test case design. UML activity diagrams describe the realization of the operation in design phase and also support description of parallel activities and synchronization aspects involved in different activities perfectly. In this paper we generate test scenarios from activity diagrams, which achieve test adequacy criteria perfectly. Finally we generate test cases by analyzing the respective sequence and class diagrams of each scenario, which achieves maximum path coverage criteria. Also in our approach, the cost of test model creation is reduced as design is reused.
{"title":"A Novel Approach for Scenario-Based Test Case Generation","authors":"Baikuntha Narayan Biswal, Pragyan Nanda, D. Mohapatra","doi":"10.1109/ICIT.2008.43","DOIUrl":"https://doi.org/10.1109/ICIT.2008.43","url":null,"abstract":"Testing of software is a time-consuming activity which requires a great deal of planning and resources. Model-based testing is gaining importance as a research issue. In scenario-based testing, test scenarios are used for generating test cases, test drivers etc. UML is widely used to describe analysis and design specifications of software development. UML models are important source of information for test case design. UML activity diagrams describe the realization of the operation in design phase and also support description of parallel activities and synchronization aspects involved in different activities perfectly. In this paper we generate test scenarios from activity diagrams, which achieve test adequacy criteria perfectly. Finally we generate test cases by analyzing the respective sequence and class diagrams of each scenario, which achieves maximum path coverage criteria. Also in our approach, the cost of test model creation is reduced as design is reused.","PeriodicalId":184201,"journal":{"name":"2008 International Conference on Information Technology","volume":"5 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2008-12-17","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"126854358","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}
Identification of node-disjoint paths in an ad hoc network is a challenging task. A protocol that is hybrid of an incremental protocol and a protocol that tries to identify multiple node-disjoint paths in a single route discovery, can be used to identify a maximal set of node-disjoint paths between a given source and destination. In this paper, we analyze the communication and computational overheads and the time after which all node-disjoint paths between a given source and a destination are expected to fail.
{"title":"Overheads and Mean Route Failure Time of a Hybrid Protocol for Node-Disjoint Multipath Routing in Mobile Ad Hoc Networks","authors":"A. Abbas","doi":"10.1109/ICIT.2008.26","DOIUrl":"https://doi.org/10.1109/ICIT.2008.26","url":null,"abstract":"Identification of node-disjoint paths in an ad hoc network is a challenging task. A protocol that is hybrid of an incremental protocol and a protocol that tries to identify multiple node-disjoint paths in a single route discovery, can be used to identify a maximal set of node-disjoint paths between a given source and destination. In this paper, we analyze the communication and computational overheads and the time after which all node-disjoint paths between a given source and a destination are expected to fail.","PeriodicalId":184201,"journal":{"name":"2008 International Conference on Information Technology","volume":"142 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2008-12-17","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"114037847","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}
Over the last few years many firms of any significant size are in some stage of implementing enterprise resources planning (ERP) systems or other similar multifunctional enterprise systems or are planning to implementing ERP systems in their organization to reap the benefits of integration. Some are in the early stages of the process, giving consideration to the very substantial implementation costs. Given the nature and magnitude of the problems in encountered in implementing an ERP project, this study would attempt to identify the critical success factors (CSF¿s) for a successful implementation of an ERP project since it calls for substantial effort on the part of all the stake holders involved to make the implementation a success. This paper explores the existing literature on ERP implementation issues in context to small and medium scale enterprises and attempts a compilation of the factors that assume great significance while implementing ERP in SMEs.
{"title":"An Explorative Study to Identify the Critical Success Factors for ERP Implementation in Indian Small and Medium Scale Enterprises","authors":"Parijat Upadhyay, P. Dan","doi":"10.1109/ICIT.2008.66","DOIUrl":"https://doi.org/10.1109/ICIT.2008.66","url":null,"abstract":"Over the last few years many firms of any significant size are in some stage of implementing enterprise resources planning (ERP) systems or other similar multifunctional enterprise systems or are planning to implementing ERP systems in their organization to reap the benefits of integration. Some are in the early stages of the process, giving consideration to the very substantial implementation costs. Given the nature and magnitude of the problems in encountered in implementing an ERP project, this study would attempt to identify the critical success factors (CSF¿s) for a successful implementation of an ERP project since it calls for substantial effort on the part of all the stake holders involved to make the implementation a success. This paper explores the existing literature on ERP implementation issues in context to small and medium scale enterprises and attempts a compilation of the factors that assume great significance while implementing ERP in SMEs.","PeriodicalId":184201,"journal":{"name":"2008 International Conference on Information Technology","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2008-12-17","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"129049097","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}
The concept of design patterns has been widely used in the software and hardware domain. Several fault tolerance patterns have been proposed to document widely used fault tolerance methods. In this paper, we propose a new software fault tolerance pattern, which is called recovery block with backup voting pattern. This pattern can be used to improve the software reliability of the classical recovery block pattern in applications in which the construction of an effective acceptance test can not be guaranteed. In order to represent the new pattern, we use a pattern representation that focuses on the nonfunctional consequences of the design patterns on safety critical embedded systems. These nonfunctional consequences contain: safety, reliability, modifiability, cost, and execution time. Among other side effects, the implications part of the new pattern shows that it is resulting in higher reliability than the classical recovery block with relatively low additional hardware cost.
{"title":"Recovery Block with Backup Voting: A New Pattern with Extended Representation for Safety Critical Embedded Systems","authors":"Ashraf Armoush, F. Salewski, S. Kowalewski","doi":"10.1109/ICIT.2008.60","DOIUrl":"https://doi.org/10.1109/ICIT.2008.60","url":null,"abstract":"The concept of design patterns has been widely used in the software and hardware domain. Several fault tolerance patterns have been proposed to document widely used fault tolerance methods. In this paper, we propose a new software fault tolerance pattern, which is called recovery block with backup voting pattern. This pattern can be used to improve the software reliability of the classical recovery block pattern in applications in which the construction of an effective acceptance test can not be guaranteed. In order to represent the new pattern, we use a pattern representation that focuses on the nonfunctional consequences of the design patterns on safety critical embedded systems. These nonfunctional consequences contain: safety, reliability, modifiability, cost, and execution time. Among other side effects, the implications part of the new pattern shows that it is resulting in higher reliability than the classical recovery block with relatively low additional hardware cost.","PeriodicalId":184201,"journal":{"name":"2008 International Conference on Information Technology","volume":"48 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2008-12-17","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"127561537","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}
Promoter recognition has been attempted using different paradigms such as motif/binding regions alone or whole promoter itself. In an earlier paper, a scheme is proposed to use 2-gram features to represent a promoter. These 2-grams gave a comparable performance with the existing methods in the literature. An in-depth analysis of data sets using 2-grams is performed. The analysis presented a scenario where there is a confusion between a majority of promoters with a minor set of non-promoter and vice versa. In an effort to build a complete classification system, using the majority and minority sets in promoters as well as non-promoters, a multi-level cascading system and Ada-Boost classifier are applied. The results indicate that much further improvement is not possible with the modifications proposed.
{"title":"Cascaded Multi-level Promoter Recognition of E. coli Using Dinucleotide Features","authors":"T. Rani, R. Bapi","doi":"10.1109/ICIT.2008.56","DOIUrl":"https://doi.org/10.1109/ICIT.2008.56","url":null,"abstract":"Promoter recognition has been attempted using different paradigms such as motif/binding regions alone or whole promoter itself. In an earlier paper, a scheme is proposed to use 2-gram features to represent a promoter. These 2-grams gave a comparable performance with the existing methods in the literature. An in-depth analysis of data sets using 2-grams is performed. The analysis presented a scenario where there is a confusion between a majority of promoters with a minor set of non-promoter and vice versa. In an effort to build a complete classification system, using the majority and minority sets in promoters as well as non-promoters, a multi-level cascading system and Ada-Boost classifier are applied. The results indicate that much further improvement is not possible with the modifications proposed.","PeriodicalId":184201,"journal":{"name":"2008 International Conference on Information Technology","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2008-12-17","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"125836262","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}
This paper presents an efficient one pass technique, SCOPE (strongly correlated item pairs extraction), which finds all the strongly correlated item pairs from transaction database, without generating any candidate sets. We experimented with real and synthetic datasets and compared the performance of SCOPE with its other counterparts i.e. TAPER and TCP and found satisfactory.
{"title":"SCOPE: An Efficient One Pass Approach to Find Strongly Correlated Item Pairs","authors":"Swarup Roy, D. Bhattacharyya","doi":"10.1109/ICIT.2008.10","DOIUrl":"https://doi.org/10.1109/ICIT.2008.10","url":null,"abstract":"This paper presents an efficient one pass technique, SCOPE (strongly correlated item pairs extraction), which finds all the strongly correlated item pairs from transaction database, without generating any candidate sets. We experimented with real and synthetic datasets and compared the performance of SCOPE with its other counterparts i.e. TAPER and TCP and found satisfactory.","PeriodicalId":184201,"journal":{"name":"2008 International Conference on Information Technology","volume":"37 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2008-12-17","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"134645001","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
扫码关注我们
求助内容：
应助结果提醒方式：