Visual optimization is a very interesting topic to the application users for many purposes. It enables the user with an interactive platform where, by varying different parameter settings, one can customize a solution. Several attempts of developing generalized evolutionary optimizers are found in literature. In this paper, we have tried to develop a generalized visual platform for stochastic optimization algorithms that encompass both single objective and multi objective problems.
{"title":"On Development of a Generalized Visual Stochastic Optimizer","authors":"M. K. Pakhira, Prasenjit Das","doi":"10.1109/ICIT.2008.69","DOIUrl":"https://doi.org/10.1109/ICIT.2008.69","url":null,"abstract":"Visual optimization is a very interesting topic to the application users for many purposes. It enables the user with an interactive platform where, by varying different parameter settings, one can customize a solution. Several attempts of developing generalized evolutionary optimizers are found in literature. In this paper, we have tried to develop a generalized visual platform for stochastic optimization algorithms that encompass both single objective and multi objective problems.","PeriodicalId":184201,"journal":{"name":"2008 International Conference on Information Technology","volume":"69 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":"115622383","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}
Praveen Ranjan Srivastava, V. KarthikAnand, V. SubbaReddy, G. Raghurama
- In recent years, agent-based systems have received considerable attention in both academics and industry. The agent-oriented paradigm can be considered as a natural extension of the object-oriented (OO) paradigm. In this paper, a procedure using message flow graph (MFG) for regression testing of agent oriented software systems is proposed. This method however can be used when the interaction pattern of an agent changes. Furthermore a procedure for selection of modification-traversing regression test cases using execution trace is proposed. For illustration purpose, a multi agent air ticket booking system is implemented using JADE 3.5 and tested using our proposed methods.
{"title":"Regression Testing Techniques for Agent Oriented Software","authors":"Praveen Ranjan Srivastava, V. KarthikAnand, V. SubbaReddy, G. Raghurama","doi":"10.1109/ICIT.2008.30","DOIUrl":"https://doi.org/10.1109/ICIT.2008.30","url":null,"abstract":"- In recent years, agent-based systems have received considerable attention in both academics and industry. The agent-oriented paradigm can be considered as a natural extension of the object-oriented (OO) paradigm. In this paper, a procedure using message flow graph (MFG) for regression testing of agent oriented software systems is proposed. This method however can be used when the interaction pattern of an agent changes. Furthermore a procedure for selection of modification-traversing regression test cases using execution trace is proposed. For illustration purpose, a multi agent air ticket booking system is implemented using JADE 3.5 and tested using our proposed methods.","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":"126618761","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}
In this paper we introduce a new interconnection network, the extended varietal hypercube with cross connection denoted by EVHC(n,k). This network has hierarchical structure and it overcomes the poor fault tolerant properties of extended varietal hypercube. This network has low diameter, constant degree connectivity and low message traffic density.
{"title":"Topological Properties of a New Fault Tolerant Interconnection Network for Parallel Computer","authors":"S. P. Mohanty, B. Ray, S. Patro, A. Tripathy","doi":"10.1109/ICIT.2008.64","DOIUrl":"https://doi.org/10.1109/ICIT.2008.64","url":null,"abstract":"In this paper we introduce a new interconnection network, the extended varietal hypercube with cross connection denoted by EVHC(n,k). This network has hierarchical structure and it overcomes the poor fault tolerant properties of extended varietal hypercube. This network has low diameter, constant degree connectivity and low message traffic density.","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":"129472234","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}
S. Udgata, S. Srivastava, Hitesh Mahajan, Gauri K. Udgata
The channel assignment problem arises in a mobile communication network whenever there is an installation of a new base station or one cell is split into two or more cells or power of the base station is changed. Channel assignment or reassignment is an NP-hard problem and generally a heuristic approach is used for solving large sized problems. We have developed a ¿copy best available¿ heuristic in which we are using recursive search algorithm and concept of co-channel cells for the need of channel assignment and reassignment (arising from the situation of installation of new base stations for capacity expansion of a mobile communication network). The heuristic is proposed for the GSM (global system for mobile communication) environment. We try to achieve optimal channel assignment and reassignment by not allowing the co-channel interference in the neighboring cells as a hard constraint. Computational results show that our heuristic approach is quite simple and strong. It finds a near optimal solution to the most test problems with reasonable time bound as well as other constraints.
{"title":"Channel Assignment and Reassignment Using Co-channel Cells in Mobile Communication Networks","authors":"S. Udgata, S. Srivastava, Hitesh Mahajan, Gauri K. Udgata","doi":"10.1109/ICIT.2008.53","DOIUrl":"https://doi.org/10.1109/ICIT.2008.53","url":null,"abstract":"The channel assignment problem arises in a mobile communication network whenever there is an installation of a new base station or one cell is split into two or more cells or power of the base station is changed. Channel assignment or reassignment is an NP-hard problem and generally a heuristic approach is used for solving large sized problems. We have developed a ¿copy best available¿ heuristic in which we are using recursive search algorithm and concept of co-channel cells for the need of channel assignment and reassignment (arising from the situation of installation of new base stations for capacity expansion of a mobile communication network). The heuristic is proposed for the GSM (global system for mobile communication) environment. We try to achieve optimal channel assignment and reassignment by not allowing the co-channel interference in the neighboring cells as a hard constraint. Computational results show that our heuristic approach is quite simple and strong. It finds a near optimal solution to the most test problems with reasonable time bound as well as other constraints.","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":"129888124","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}
H. Mohanty, D. Chenthati, S. Vaddi, R. K. Shyamsundar
A business process implemented as a Web service has two major components for orchestration and choreography. Its execution can be viewed as an ordered sequence of states and corresponding associated transitions. Hence, finite state machine (FSM) is considered as a natural choice to model Web services. In this work we show that both orchestration and choreography for Web services can be modeled by annotated FSM (AFSM) - A FSM enriched with domain specific information. The transformation of an AFSM model to executable BPEL and WSDL code is demonstrated. Also briefly we discuss HUMSAT the tool developed to model Web services and to automate the process of model transformation.
{"title":"HUMSAT for State Based Web Service Composition","authors":"H. Mohanty, D. Chenthati, S. Vaddi, R. K. Shyamsundar","doi":"10.1109/ICIT.2008.40","DOIUrl":"https://doi.org/10.1109/ICIT.2008.40","url":null,"abstract":"A business process implemented as a Web service has two major components for orchestration and choreography. Its execution can be viewed as an ordered sequence of states and corresponding associated transitions. Hence, finite state machine (FSM) is considered as a natural choice to model Web services. In this work we show that both orchestration and choreography for Web services can be modeled by annotated FSM (AFSM) - A FSM enriched with domain specific information. The transformation of an AFSM model to executable BPEL and WSDL code is demonstrated. Also briefly we discuss HUMSAT the tool developed to model Web services and to automate the process of model transformation.","PeriodicalId":184201,"journal":{"name":"2008 International Conference on Information Technology","volume":"51 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":"130071961","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}
Search engine has become a major tool for searching any information from the World Wide Web (WWW). While searching the huge digital library available in the WWW, every effort is made to retrieve the most relevant results. But in WWW majority of the Web pages are in HTML format and there are no such tags, which tells the crawler to find any specific domain. To find more relevant result we use Ontology for that particular domain. If we are working with multiple domains then we use multiple ontologies. Now in order to design a domain specific search engine for multiple domains, crawler must crawl through the domain specific Web pages in the WWW according to the predefined ontologies.
{"title":"A New Approach to Design Graph Based Search Engine for Multiple Domains Using Different Ontologies","authors":"Debajyoti Mukhopadhyay, Sukanta Sinha","doi":"10.1109/ICIT.2008.46","DOIUrl":"https://doi.org/10.1109/ICIT.2008.46","url":null,"abstract":"Search engine has become a major tool for searching any information from the World Wide Web (WWW). While searching the huge digital library available in the WWW, every effort is made to retrieve the most relevant results. But in WWW majority of the Web pages are in HTML format and there are no such tags, which tells the crawler to find any specific domain. To find more relevant result we use Ontology for that particular domain. If we are working with multiple domains then we use multiple ontologies. Now in order to design a domain specific search engine for multiple domains, crawler must crawl through the domain specific Web pages in the WWW according to the predefined ontologies.","PeriodicalId":184201,"journal":{"name":"2008 International Conference on Information Technology","volume":"107 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":"134389665","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}
Implementations of synchronous programs on distributed hardware modules are infeasible if the totality of hardware is viewed as a single monster circuit. The zero execution time semantics that govern the interaction between the system and the environment has to be adapted to the inter module interaction. This interaction is at micro-instants and the signals exchanged are tentative at the start and firm up to final values micro-instant by micro-instant. This micro-instant protocol is derived from Maliks iterative algorithm used to analyze cyclic digital circuits for being combinational.
{"title":"Semantics Preserving Micro-Instant Implementation of Synchronous Programs","authors":"Vinod Kumar, Kanchan Bokil, Ashwin Nivangune, Peeyush Jain","doi":"10.1109/ICIT.2008.61","DOIUrl":"https://doi.org/10.1109/ICIT.2008.61","url":null,"abstract":"Implementations of synchronous programs on distributed hardware modules are infeasible if the totality of hardware is viewed as a single monster circuit. The zero execution time semantics that govern the interaction between the system and the environment has to be adapted to the inter module interaction. This interaction is at micro-instants and the signals exchanged are tentative at the start and firm up to final values micro-instant by micro-instant. This micro-instant protocol is derived from Maliks iterative algorithm used to analyze cyclic digital circuits for being combinational.","PeriodicalId":184201,"journal":{"name":"2008 International Conference on Information Technology","volume":"84 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":"133295801","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}
Authentication is one of the important security properties in applications ranging from border security to consumer electronics. This paper presents an efficient mutual authentication scheme for remote systems, which provides two-factor user authentication. The scheme attains two interesting features such as avoids the possibility of many logged in users with the same login identity and eliminates the overhead of maintaining verifier table at remote server.
{"title":"Secure and Efficient Authentication Scheme for Remote Systems","authors":"M. Das","doi":"10.1109/ICIT.2008.21","DOIUrl":"https://doi.org/10.1109/ICIT.2008.21","url":null,"abstract":"Authentication is one of the important security properties in applications ranging from border security to consumer electronics. This paper presents an efficient mutual authentication scheme for remote systems, which provides two-factor user authentication. The scheme attains two interesting features such as avoids the possibility of many logged in users with the same login identity and eliminates the overhead of maintaining verifier table at remote server.","PeriodicalId":184201,"journal":{"name":"2008 International Conference on Information Technology","volume":"66 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":"115698916","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}
Pairwise DNA and protein sequence alignment is an underlying task in bioinformatics which forms the basis of many other bioinformatics applications. Protein sequence alignment is in general given more importance than DNA sequence alignment, and protein sequence alignment methods can usually be used with little modification for DNA sequences as well. However, alignment methods specific to DNA sequence alignment using sequence specific information are highly desirable. Most existing DNA alignment programs routinely use the common match/mismatch scoring scheme. Recently, an iterative alignment scheme using sequence-specific transition-transversion ratio was shown to be better than using a simple match/mismatch scoring scheme. In this paper, we present a modification to the iterative approach by incorporating in it the use of multiple parameter sets. Preliminary experiments indicate that using multiple parameter sets gives significantly better performance than using a single parameter set, and than using a simple match/mismatch scoring scheme. Sequence specific scoring matrices have been shown to be highly successful for protein alignment over the last decade, and the current work should be a significant step in the direction of using sequence specific substitution matrices for DNA sequences.
{"title":"Pairwise DNA Alignment with Sequence Specific Transition-Transversion Ratio Using Multiple Parameter Sets","authors":"Ankit Agrawal, Xiaoqiu Huang","doi":"10.1109/ICIT.2008.62","DOIUrl":"https://doi.org/10.1109/ICIT.2008.62","url":null,"abstract":"Pairwise DNA and protein sequence alignment is an underlying task in bioinformatics which forms the basis of many other bioinformatics applications. Protein sequence alignment is in general given more importance than DNA sequence alignment, and protein sequence alignment methods can usually be used with little modification for DNA sequences as well. However, alignment methods specific to DNA sequence alignment using sequence specific information are highly desirable. Most existing DNA alignment programs routinely use the common match/mismatch scoring scheme. Recently, an iterative alignment scheme using sequence-specific transition-transversion ratio was shown to be better than using a simple match/mismatch scoring scheme. In this paper, we present a modification to the iterative approach by incorporating in it the use of multiple parameter sets. Preliminary experiments indicate that using multiple parameter sets gives significantly better performance than using a single parameter set, and than using a simple match/mismatch scoring scheme. Sequence specific scoring matrices have been shown to be highly successful for protein alignment over the last decade, and the current work should be a significant step in the direction of using sequence specific substitution matrices for DNA sequences.","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":"114628301","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}
Wireless mesh networks (WMNs) are a type of radio-based network systems which require minimal configuration and infrastructure. One of the factors that influence the performance of WMNs is the underlying routing protocol used. Here, we propose one such routing protocol, called M-OLSR, which is a variant of OLSR, a traditional link-state protocol developed to meet the requirements of mobile adhoc networks MANETs. Our approach improves the throughput and packet delivery ratio, while minimizing routing overhead and delay, by choosing a stable path for packet forwarding through static routers. Simulation results demonstrate that, for WMNs, the M-OLSR outperforms OLSR in terms of throughput, packet delivery ratio, and routing overhead.
{"title":"Modified Optimized Link State Routing (M-OLSR) for Wireless Mesh Networks","authors":"A. Paul, Sukumar Nandi","doi":"10.1109/ICIT.2008.67","DOIUrl":"https://doi.org/10.1109/ICIT.2008.67","url":null,"abstract":"Wireless mesh networks (WMNs) are a type of radio-based network systems which require minimal configuration and infrastructure. One of the factors that influence the performance of WMNs is the underlying routing protocol used. Here, we propose one such routing protocol, called M-OLSR, which is a variant of OLSR, a traditional link-state protocol developed to meet the requirements of mobile adhoc networks MANETs. Our approach improves the throughput and packet delivery ratio, while minimizing routing overhead and delay, by choosing a stable path for packet forwarding through static routers. Simulation results demonstrate that, for WMNs, the M-OLSR outperforms OLSR in terms of throughput, packet delivery ratio, and routing overhead.","PeriodicalId":184201,"journal":{"name":"2008 International Conference on Information Technology","volume":"90 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":"114707614","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
扫码关注我们
求助内容：
应助结果提醒方式：