This paper presents a hierarchical QoS multicast routing protocol (HQMRP) for mobile ad-hoc networks. It can provide QoS-sensitive routes in a scalable and flexible way, in the network environment with mobility. In the proposed HQMRP scheme, each local node just only needs to maintain local multicast routing information and/or summary information of other clusters (or domains), but does not requires any global ad hoc network states to be maintained. The HQMRP also allows that an ad-hoc group member can join/leave the multicast group dynamically, and supports multiple QoS constraints. The paper presents the proof of correctness and complexity analysis of the protocol. The performance measures of HQMRP are evaluated using simulation. The studies show that HQMRP can provide an available approach to QoS multicast routing for mobile ad-hoc networks.
{"title":"A QoS multicast routing protocol for mobile ad-hoc networks","authors":"L. Layuan, L. Chunlin","doi":"10.1109/ITCC.2005.28","DOIUrl":"https://doi.org/10.1109/ITCC.2005.28","url":null,"abstract":"This paper presents a hierarchical QoS multicast routing protocol (HQMRP) for mobile ad-hoc networks. It can provide QoS-sensitive routes in a scalable and flexible way, in the network environment with mobility. In the proposed HQMRP scheme, each local node just only needs to maintain local multicast routing information and/or summary information of other clusters (or domains), but does not requires any global ad hoc network states to be maintained. The HQMRP also allows that an ad-hoc group member can join/leave the multicast group dynamically, and supports multiple QoS constraints. The paper presents the proof of correctness and complexity analysis of the protocol. The performance measures of HQMRP are evaluated using simulation. The studies show that HQMRP can provide an available approach to QoS multicast routing for mobile ad-hoc networks.","PeriodicalId":326887,"journal":{"name":"International Conference on Information Technology: Coding and Computing (ITCC'05) - Volume II","volume":"17 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2005-04-04","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"122054783","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}
Web crawlers are one of the most crucial components in search engines and their optimization would have a great effect on improving the searching efficiency. In this paper, we introduce an intelligent crawler called Gcrawler that uses a genetic algorithm for improving its crawling performance. Gcrawler estimates the best path for crawling on one hand and expands its initial keywords by using a genetic algorithm during the crawling on the other hand. This is the first crawler that acts intelligently without any relevance feedback or training. All the processes are online and there is no need for direct interaction with the users.
{"title":"Enhancing focused crawling with genetic algorithms","authors":"Milad Shokouhi, P. Chubak, Zaynab Raeesy","doi":"10.1109/ITCC.2005.145","DOIUrl":"https://doi.org/10.1109/ITCC.2005.145","url":null,"abstract":"Web crawlers are one of the most crucial components in search engines and their optimization would have a great effect on improving the searching efficiency. In this paper, we introduce an intelligent crawler called Gcrawler that uses a genetic algorithm for improving its crawling performance. Gcrawler estimates the best path for crawling on one hand and expands its initial keywords by using a genetic algorithm during the crawling on the other hand. This is the first crawler that acts intelligently without any relevance feedback or training. All the processes are online and there is no need for direct interaction with the users.","PeriodicalId":326887,"journal":{"name":"International Conference on Information Technology: Coding and Computing (ITCC'05) - Volume II","volume":"48 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2005-04-04","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"125134895","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 the paper, we propose a media access framework for supporting integrated service including the real-time service, the controlled load service, and the best effort service in wireless networks. Three medium access mechanisms, the "Multi-classes fair scheduling", the "Single-class fair scheduling + DCF", and the "Single-class fair scheduling + DCF with threshold for controlled load service" are proposed in the paper to manage the traffic within a piconet. Moreover, a measurement based admission control algorithm is proposed to guarantee the QoS requirements for the requests. We compare the performance of the proposed access mechanisms by conducting simulations. The simulation results show that the "Multi-classes fair scheduling " mechanism is the best choice for the networks occupied by the real-time service; the "Single-class fair scheduling + DCF with threshold for controlled service" mechanism is the best for controlled service in general case.
{"title":"Media access mechanisms for integrated services in wireless networks","authors":"Sheng-Tzong Cheng, Ming-Hung Tao, Mingzoo Wu","doi":"10.1109/ITCC.2005.191","DOIUrl":"https://doi.org/10.1109/ITCC.2005.191","url":null,"abstract":"In the paper, we propose a media access framework for supporting integrated service including the real-time service, the controlled load service, and the best effort service in wireless networks. Three medium access mechanisms, the \"Multi-classes fair scheduling\", the \"Single-class fair scheduling + DCF\", and the \"Single-class fair scheduling + DCF with threshold for controlled load service\" are proposed in the paper to manage the traffic within a piconet. Moreover, a measurement based admission control algorithm is proposed to guarantee the QoS requirements for the requests. We compare the performance of the proposed access mechanisms by conducting simulations. The simulation results show that the \"Multi-classes fair scheduling \" mechanism is the best choice for the networks occupied by the real-time service; the \"Single-class fair scheduling + DCF with threshold for controlled service\" mechanism is the best for controlled service in general case.","PeriodicalId":326887,"journal":{"name":"International Conference on Information Technology: Coding and Computing (ITCC'05) - Volume II","volume":"38 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2005-04-04","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"125217922","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}
Software architecture (SA) provides a formal basis to describe and analyze a software system as a collection of components and their interactions (connectors). However, the current understanding and specification for a connector are still insufficient. Furthermore, there still exists a gap between architecture design and component-based implementation. This paper attempts to tackle these problems by providing an architecture description language (ADL), xSADL. In the specification of a connector, xSADL can help designers to deal with two kinds of architectural mismatches: behavior mismatch and message mismatch. xSADL is also supported by a GUI-based CASE tool. To help transform the architecture design by xSADL to a component-based software implementation, a component framework, 3CoFramework, is also introduced. xSADLand 3CoFramework complement each other and construct an architecture-based component development environment.
{"title":"xSADL: an architecture description language to specify component-based systems","authors":"Shifeng Zhang, S. Goddard","doi":"10.1109/ITCC.2005.303","DOIUrl":"https://doi.org/10.1109/ITCC.2005.303","url":null,"abstract":"Software architecture (SA) provides a formal basis to describe and analyze a software system as a collection of components and their interactions (connectors). However, the current understanding and specification for a connector are still insufficient. Furthermore, there still exists a gap between architecture design and component-based implementation. This paper attempts to tackle these problems by providing an architecture description language (ADL), xSADL. In the specification of a connector, xSADL can help designers to deal with two kinds of architectural mismatches: behavior mismatch and message mismatch. xSADL is also supported by a GUI-based CASE tool. To help transform the architecture design by xSADL to a component-based software implementation, a component framework, 3CoFramework, is also introduced. xSADLand 3CoFramework complement each other and construct an architecture-based component development environment.","PeriodicalId":326887,"journal":{"name":"International Conference on Information Technology: Coding and Computing (ITCC'05) - Volume II","volume":"40 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2005-04-04","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"125904803","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}
System requirements, which define automatic behavior within a domain model, appear variously as business policies, engineering rules, domain laws, constraints, and state transitions. At first glance, such requirements seem easy to implement in the conventional object oriented (OO) space, but when looked closely, the most natural way of expressing such behavior is the rule based approach. Given a seamless bridge between the two paradigms, the combination not only provides ease of programming but also conceptual clarity at a higher level. In this paper, we consider the features of logic languages and their advantages in representation of various aforesaid system requirements. We look at the conventional three tier object oriented architecture and its advantage and disadvantages using different examples. We propose an optimum architecture that combines the best of both. We also apply the proposed architecture in the context of building highly configurable systems.
{"title":"Need for incorporating a rule-based component in conventional object oriented systems","authors":"Bhuwan Lodha, K. Dinesha, Pavan Kumar","doi":"10.1109/ITCC.2005.209","DOIUrl":"https://doi.org/10.1109/ITCC.2005.209","url":null,"abstract":"System requirements, which define automatic behavior within a domain model, appear variously as business policies, engineering rules, domain laws, constraints, and state transitions. At first glance, such requirements seem easy to implement in the conventional object oriented (OO) space, but when looked closely, the most natural way of expressing such behavior is the rule based approach. Given a seamless bridge between the two paradigms, the combination not only provides ease of programming but also conceptual clarity at a higher level. In this paper, we consider the features of logic languages and their advantages in representation of various aforesaid system requirements. We look at the conventional three tier object oriented architecture and its advantage and disadvantages using different examples. We propose an optimum architecture that combines the best of both. We also apply the proposed architecture in the context of building highly configurable systems.","PeriodicalId":326887,"journal":{"name":"International Conference on Information Technology: Coding and Computing (ITCC'05) - Volume II","volume":"10 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2005-04-04","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"129336338","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}
Workflow has been considered as a crucial component in several Grid projects. Among many workflow standards, BPEL, Business Process Execution Language, is emerging as a de-facto workflow standard in Grid and Web services communities. In this paper, we present the adoption of standard BPEL to orchestrate Grid services based on OGSI specification. Our approach is based on proxy services, which enable user to interact with OGSI Grid services supporting GSI security mechanisms, OGSI factory mechanism, and notification mechanism. Our proposed architecture is platform-neutral as it does not depend on any specific security architecture. With our implementation, the proxy services witl be generated automatically for each target Grid service. Thus, they are not limited to pre-defined Grid services. In addition, our proxy services also remove design-time binding limitations of BPEL and allow user to define the binding information of proxy services in run-time. As our approach utilizes original BPEL specification without special modification, we believe that developing Grid applications on our architecture will benefit from standard BPEL-compliant tools and generic Web services tools. We illustrate the example of using our proposed framework by orchestrating drug discovery processes using BPEL and Grid services.
{"title":"The BPEL orchestrating framework for secured grid services","authors":"Pichet Amnuaykanjanasin, N. Nupairoj","doi":"10.1109/ITCC.2005.271","DOIUrl":"https://doi.org/10.1109/ITCC.2005.271","url":null,"abstract":"Workflow has been considered as a crucial component in several Grid projects. Among many workflow standards, BPEL, Business Process Execution Language, is emerging as a de-facto workflow standard in Grid and Web services communities. In this paper, we present the adoption of standard BPEL to orchestrate Grid services based on OGSI specification. Our approach is based on proxy services, which enable user to interact with OGSI Grid services supporting GSI security mechanisms, OGSI factory mechanism, and notification mechanism. Our proposed architecture is platform-neutral as it does not depend on any specific security architecture. With our implementation, the proxy services witl be generated automatically for each target Grid service. Thus, they are not limited to pre-defined Grid services. In addition, our proxy services also remove design-time binding limitations of BPEL and allow user to define the binding information of proxy services in run-time. As our approach utilizes original BPEL specification without special modification, we believe that developing Grid applications on our architecture will benefit from standard BPEL-compliant tools and generic Web services tools. We illustrate the example of using our proposed framework by orchestrating drug discovery processes using BPEL and Grid services.","PeriodicalId":326887,"journal":{"name":"International Conference on Information Technology: Coding and Computing (ITCC'05) - Volume II","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2005-04-04","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"129466476","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}
Design patterns document good design solutions to a recurring problem in a particular context. They are typically modeled using UML. In practice, however, pattern-related information is lost when a design pattern is applied or composed because UML does not keep track of this information. Consequently, the designer cannot identify design patterns used in software system design diagrams. The benefits of design patterns are compromised because the designers cannot communicate with each other in terms of the design patterns they use and their design decisions and tradeoffs. In this paper, we present a Web service (VisDP) for explicitly visualizing design patterns in UML diagrams. This Web service is developed based on a UML profile containing new stereotypes, tagged values and constraints for visualizing design patterns in UML diagrams. With this service, the user is able to identify design patterns by moving the mouse and viewing color changes in UML diagrams. Additional pattern-related information can be dynamically displayed based on the mouse location.
{"title":"VisDP: a Web service for visualizing design patterns on demand","authors":"Jing Dong, Sheng Yang, Kang Zhang","doi":"10.1109/ITCC.2005.293","DOIUrl":"https://doi.org/10.1109/ITCC.2005.293","url":null,"abstract":"Design patterns document good design solutions to a recurring problem in a particular context. They are typically modeled using UML. In practice, however, pattern-related information is lost when a design pattern is applied or composed because UML does not keep track of this information. Consequently, the designer cannot identify design patterns used in software system design diagrams. The benefits of design patterns are compromised because the designers cannot communicate with each other in terms of the design patterns they use and their design decisions and tradeoffs. In this paper, we present a Web service (VisDP) for explicitly visualizing design patterns in UML diagrams. This Web service is developed based on a UML profile containing new stereotypes, tagged values and constraints for visualizing design patterns in UML diagrams. With this service, the user is able to identify design patterns by moving the mouse and viewing color changes in UML diagrams. Additional pattern-related information can be dynamically displayed based on the mouse location.","PeriodicalId":326887,"journal":{"name":"International Conference on Information Technology: Coding and Computing (ITCC'05) - Volume II","volume":"2 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2005-04-04","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"131132876","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 proposes a parallel implementation of the multiple sequence alignment algorithm, known as ClustalW, on distributed memory parallel machines. The proposed algorithm divides a progressive alignment into subtasks and schedules them dynamically. A task tree is built according to the dependency of the generated phylogenetic tree. The computation and communication costs of the tasks are estimated at run-time and updated periodically. With dynamic scheduling, tasks are allocated to the processors considering the tasks' estimated computation and communication costs and the processors' workload in order to minimize the completion time. The experiment results show that the proposed parallel implementation achieves a considerable speedup over the sequential ClustalW.
{"title":"Parallel multiple sequence alignment with dynamic scheduling","authors":"Jiancong Luo, I. Ahmad, Munib Ahmed, R. Paul","doi":"10.1109/ITCC.2005.223","DOIUrl":"https://doi.org/10.1109/ITCC.2005.223","url":null,"abstract":"This paper proposes a parallel implementation of the multiple sequence alignment algorithm, known as ClustalW, on distributed memory parallel machines. The proposed algorithm divides a progressive alignment into subtasks and schedules them dynamically. A task tree is built according to the dependency of the generated phylogenetic tree. The computation and communication costs of the tasks are estimated at run-time and updated periodically. With dynamic scheduling, tasks are allocated to the processors considering the tasks' estimated computation and communication costs and the processors' workload in order to minimize the completion time. The experiment results show that the proposed parallel implementation achieves a considerable speedup over the sequential ClustalW.","PeriodicalId":326887,"journal":{"name":"International Conference on Information Technology: Coding and Computing (ITCC'05) - Volume II","volume":"5 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2005-04-04","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"121115773","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}
Bezier curves are robust tool for a wide array of applications ranging from computer-aided design to calligraphic character, outlining and object shape description. In terms of the control point generation process, existing shape descriptor techniques that employ Bezier curves do not distinguish between regions where an object's shape changes rapidly and those where the change is more gradual or flat. This can lead to an erroneous shape description, particularly where there are significantly sharp changes in shape, such as at sharp corners. This paper presents a novel shape description algorithm called a generic shape descriptor using Bezier curves (SDBC), which defines a new strategy for Bezier control point generation by integrating domain specific information about the shape of an object in a particular region. The strategy also includes an improved dynamic fixed length coding scheme for control points. The SDBC framework has been rigorously tested upon a number of arbitrary shapes, and both quantitative and qualitative analyses have confirmed its superior performance in comparison with existing algorithms.
{"title":"A generic shape descriptor using Bezier curves","authors":"Ferdous Sohel, G. Karmakar, L. Dooley","doi":"10.1109/ITCC.2005.11","DOIUrl":"https://doi.org/10.1109/ITCC.2005.11","url":null,"abstract":"Bezier curves are robust tool for a wide array of applications ranging from computer-aided design to calligraphic character, outlining and object shape description. In terms of the control point generation process, existing shape descriptor techniques that employ Bezier curves do not distinguish between regions where an object's shape changes rapidly and those where the change is more gradual or flat. This can lead to an erroneous shape description, particularly where there are significantly sharp changes in shape, such as at sharp corners. This paper presents a novel shape description algorithm called a generic shape descriptor using Bezier curves (SDBC), which defines a new strategy for Bezier control point generation by integrating domain specific information about the shape of an object in a particular region. The strategy also includes an improved dynamic fixed length coding scheme for control points. The SDBC framework has been rigorously tested upon a number of arbitrary shapes, and both quantitative and qualitative analyses have confirmed its superior performance in comparison with existing algorithms.","PeriodicalId":326887,"journal":{"name":"International Conference on Information Technology: Coding and Computing (ITCC'05) - Volume II","volume":"21 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2005-04-04","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"121321019","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}
A centralized collaborative system between nodes and Base Stations (BSs) is developed, and a new prediction mobility scheme with Data Mining techniques is proposed so that the service of the handoff calls can be guaranteed. This new approach belongs to the Direct Group Mobility (DGM) prediction scheme and is based on the Tree Path Construction Algorithm (TPCON) and the Merge Tree Algorithm (MTA). Two Call Admission Control (CAC) algorithms are developed for each BS according to the predictive or adaptive policy for the reservation operation in order to minimize the call dropping probability. This study deals with the system behavior only at exceptional congestion time periods (periodical events).
{"title":"A Tree Based Data Mining Prediction Scheme for Wireless Cellular Network","authors":"J. Tsiligaridis, R. Acharya","doi":"10.1109/ITCC.2005.50","DOIUrl":"https://doi.org/10.1109/ITCC.2005.50","url":null,"abstract":"A centralized collaborative system between nodes and Base Stations (BSs) is developed, and a new prediction mobility scheme with Data Mining techniques is proposed so that the service of the handoff calls can be guaranteed. This new approach belongs to the Direct Group Mobility (DGM) prediction scheme and is based on the Tree Path Construction Algorithm (TPCON) and the Merge Tree Algorithm (MTA). Two Call Admission Control (CAC) algorithms are developed for each BS according to the predictive or adaptive policy for the reservation operation in order to minimize the call dropping probability. This study deals with the system behavior only at exceptional congestion time periods (periodical events).","PeriodicalId":326887,"journal":{"name":"International Conference on Information Technology: Coding and Computing (ITCC'05) - Volume II","volume":"11 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2005-04-04","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"121214539","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
扫码关注我们
求助内容：
应助结果提醒方式：