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}
Zongkai Yang, Qingtang Liu, Kun Yan, Wanting Deng, Jing Jin
With the rapid increase of learning resources, the contradiction between learning content intelligent properties and its share and reuse becomes an outstanding event. In order to solve the problem, the authors probed into a way that is to integrate the DRM technologies and learning technology standards into the development of learning content management system. The authors also designed a novel online management system for broadcasting environments of virtual classroom or courseware on demand based on a browser/server framework, which carries out learning content management for reuse, share, interoperation and security. Particular emphases was placed on the strategies of integration of digital rights management and flexible commercial model by license services into applications, management, exchange and trade of Web-based learning content and try to solve the problem between reuse and protection.
{"title":"Integration of digital rights management into learning content management system","authors":"Zongkai Yang, Qingtang Liu, Kun Yan, Wanting Deng, Jing Jin","doi":"10.1109/ITCC.2005.176","DOIUrl":"https://doi.org/10.1109/ITCC.2005.176","url":null,"abstract":"With the rapid increase of learning resources, the contradiction between learning content intelligent properties and its share and reuse becomes an outstanding event. In order to solve the problem, the authors probed into a way that is to integrate the DRM technologies and learning technology standards into the development of learning content management system. The authors also designed a novel online management system for broadcasting environments of virtual classroom or courseware on demand based on a browser/server framework, which carries out learning content management for reuse, share, interoperation and security. Particular emphases was placed on the strategies of integration of digital rights management and flexible commercial model by license services into applications, management, exchange and trade of Web-based learning content and try to solve the problem between reuse and protection.","PeriodicalId":326887,"journal":{"name":"International Conference on Information Technology: Coding and Computing (ITCC'05) - Volume II","volume":"61 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":"127048618","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}
Brent Doeksen, A. Abraham, Johnson P. Thomas, M. Paprzycki
The main focus of this study is to compare different performances of soft computing paradigms for predicting the direction of individuals stocks. Three different artificial intelligence techniques were used to predict the direction of both Microsoft and Intel stock prices over a period of thirteen years. We explore the performance of artificial neural networks trained using backpropagation and conjugate gradient algorithm and a Mamdani and Takagi Sugeno fuzzy inference system learned using neural learning and genetic algorithm. Once all the different models were built the last part of the experiment was to determine how much profit can be made using these methods versus a simple buy and hold technique.
{"title":"Real stock trading using soft computing models","authors":"Brent Doeksen, A. Abraham, Johnson P. Thomas, M. Paprzycki","doi":"10.1109/ITCC.2005.238","DOIUrl":"https://doi.org/10.1109/ITCC.2005.238","url":null,"abstract":"The main focus of this study is to compare different performances of soft computing paradigms for predicting the direction of individuals stocks. Three different artificial intelligence techniques were used to predict the direction of both Microsoft and Intel stock prices over a period of thirteen years. We explore the performance of artificial neural networks trained using backpropagation and conjugate gradient algorithm and a Mamdani and Takagi Sugeno fuzzy inference system learned using neural learning and genetic algorithm. Once all the different models were built the last part of the experiment was to determine how much profit can be made using these methods versus a simple buy and hold technique.","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":"114331088","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}
Declustering techniques reduce query response times through parallel I/O by distributing data among multiple devices. Most of the research on declustering is targeted at spatial range queries and investigates schemes with low additive error. Recently, declustering using replication is proposed to reduce the additive overhead. Replication significantly reduces retrieval cost of arbitrary queries. In this paper, we propose a disk allocation and retrieval mechanism for arbitrary queries based on design theory. Using proposed c-copy replicated declustering scheme, (c - 1)k/sup 2/ + ck buckets can be retrieved using at most k disk accesses. Retrieval algorithm is very efficient and is asymptotically optimal with /spl Theta/(|Q|) complexity for a query Q. In addition to the deterministic worst-case bound and efficient retrieval, proposed algorithm handles nonuniform data, high dimensions, supports incremental declustering and has good fault-tolerance property.
{"title":"Design theoretic approach to replicated declustering","authors":"A. Tosun","doi":"10.1109/ITCC.2005.124","DOIUrl":"https://doi.org/10.1109/ITCC.2005.124","url":null,"abstract":"Declustering techniques reduce query response times through parallel I/O by distributing data among multiple devices. Most of the research on declustering is targeted at spatial range queries and investigates schemes with low additive error. Recently, declustering using replication is proposed to reduce the additive overhead. Replication significantly reduces retrieval cost of arbitrary queries. In this paper, we propose a disk allocation and retrieval mechanism for arbitrary queries based on design theory. Using proposed c-copy replicated declustering scheme, (c - 1)k/sup 2/ + ck buckets can be retrieved using at most k disk accesses. Retrieval algorithm is very efficient and is asymptotically optimal with /spl Theta/(|Q|) complexity for a query Q. In addition to the deterministic worst-case bound and efficient retrieval, proposed algorithm handles nonuniform data, high dimensions, supports incremental declustering and has good fault-tolerance property.","PeriodicalId":326887,"journal":{"name":"International Conference on Information Technology: Coding and Computing (ITCC'05) - Volume II","volume":"53 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":"121885323","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, a scheme is proposed for parallel-pipelined implementation of the multialphabet arithmetic-coding algorithm used in lossless data compression. Using this scheme, it is possible to parallelize both the encoding and decoding operations used respectively in data compression and decompression. The compression performance of the proposed implementation for both order 0 and order 1 models have been evaluated and compared with existing sequential implementations in terms of compression ratios as well as the execution time using the Canterbury corpus benchmark set of files. The proposed scheme also facilitates hardware realisation of the respective modules and hence is suitable for integration into embedded microprocessor systems, an important area where lossless data compression is applied.
{"title":"A parallel scheme for implementing multialphabet arithmetic coding in high-speed programmable hardware","authors":"S. Mahapatra, Kuldeep Singh","doi":"10.1109/ITCC.2005.24","DOIUrl":"https://doi.org/10.1109/ITCC.2005.24","url":null,"abstract":"In this paper, a scheme is proposed for parallel-pipelined implementation of the multialphabet arithmetic-coding algorithm used in lossless data compression. Using this scheme, it is possible to parallelize both the encoding and decoding operations used respectively in data compression and decompression. The compression performance of the proposed implementation for both order 0 and order 1 models have been evaluated and compared with existing sequential implementations in terms of compression ratios as well as the execution time using the Canterbury corpus benchmark set of files. The proposed scheme also facilitates hardware realisation of the respective modules and hence is suitable for integration into embedded microprocessor systems, an important area where lossless data compression is applied.","PeriodicalId":326887,"journal":{"name":"International Conference on Information Technology: Coding and Computing (ITCC'05) - Volume II","volume":"282 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":"122946150","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}
In recent years, amphibian populations in many parts of the world have experienced an apparent widespread, yet poorly understood decline. One of the obstacles comes from the difficulties in rapidly collecting and analyzing amphibian population data from the field sites. In this paper, we investigate how to apply wireless network and mobile computing technologies to build a mobile amphibian population information system (MAPIS). This system not only enhances communication between field biologists in different locations, but also speed onsite data entry and analysis. Thus, the field biologists can optimize collection efforts and better exploit narrow windows of ecologically relevant population behaviors.
{"title":"MAPIS: a mobile amphibian population information system","authors":"Lei Zhu, Lei He, Alex Collier","doi":"10.1109/ITCC.2005.188","DOIUrl":"https://doi.org/10.1109/ITCC.2005.188","url":null,"abstract":"In recent years, amphibian populations in many parts of the world have experienced an apparent widespread, yet poorly understood decline. One of the obstacles comes from the difficulties in rapidly collecting and analyzing amphibian population data from the field sites. In this paper, we investigate how to apply wireless network and mobile computing technologies to build a mobile amphibian population information system (MAPIS). This system not only enhances communication between field biologists in different locations, but also speed onsite data entry and analysis. Thus, the field biologists can optimize collection efforts and better exploit narrow windows of ecologically relevant population behaviors.","PeriodicalId":326887,"journal":{"name":"International Conference on Information Technology: Coding and Computing (ITCC'05) - Volume II","volume":"20 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":"131399452","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
One of the major problems of managing information systems for e-Commerce or m-Commerce is to estimate the memory utilization for its set of servers, among others. In particular, along with system security and fault tolerance, memory management is perhaps the most frequently observed challenge that the IS/IT manager faces on a daily basis. A framework for building an automated intelligent agent for memory management under the client-server architecture is suggested in this paper. Further, possible applications of the framework in terms of data mining are suggested.
{"title":"Automatic agent and data mining for e-commerce","authors":"Charles C. Willow","doi":"10.1109/ITCC.2005.95","DOIUrl":"https://doi.org/10.1109/ITCC.2005.95","url":null,"abstract":"One of the major problems of managing information systems for e-Commerce or m-Commerce is to estimate the memory utilization for its set of servers, among others. In particular, along with system security and fault tolerance, memory management is perhaps the most frequently observed challenge that the IS/IT manager faces on a daily basis. A framework for building an automated intelligent agent for memory management under the client-server architecture is suggested in this paper. Further, possible applications of the framework in terms of data mining are suggested.","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":"115395111","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 interconnection network plays an important role in the performance and energy consumption of a network-on-chip (NoC) system. In this paper, we propose a RDT(2,2,1)//spl alpha/-based interconnection network for NoC designs. RDT(2,2,1)//spl alpha/ is constructed by recursively overlaying 2D diagonal meshes (torus). The number of layers needed for routing the links in RDT(2,2,1)//spl alpha/ is shown to be bounded at 6, which is feasible to be implemented with current and future VLSI technologies. With the innovative diagonal structure and its simple rank assignment, RDT(2,2,1)//spl alpha/ possesses the following features: recursive structure, smaller diameter and average distance, embedded mesh/torus topology, a constant node degree of 8, and robust routing schemes. These features make RDT(2,2,1)//spl alpha/ a promising solution for the interconnection network of NoC designs satisfying the requirements for scalability, energy-efficiency, customizability, and fault-tolerance.
{"title":"A RDT-based interconnection network for scalable network-on-chip designs","authors":"Yang Yu, Mei Yang, Yulu Yang, Yingtao Jiang","doi":"10.1109/ITCC.2005.30","DOIUrl":"https://doi.org/10.1109/ITCC.2005.30","url":null,"abstract":"The interconnection network plays an important role in the performance and energy consumption of a network-on-chip (NoC) system. In this paper, we propose a RDT(2,2,1)//spl alpha/-based interconnection network for NoC designs. RDT(2,2,1)//spl alpha/ is constructed by recursively overlaying 2D diagonal meshes (torus). The number of layers needed for routing the links in RDT(2,2,1)//spl alpha/ is shown to be bounded at 6, which is feasible to be implemented with current and future VLSI technologies. With the innovative diagonal structure and its simple rank assignment, RDT(2,2,1)//spl alpha/ possesses the following features: recursive structure, smaller diameter and average distance, embedded mesh/torus topology, a constant node degree of 8, and robust routing schemes. These features make RDT(2,2,1)//spl alpha/ a promising solution for the interconnection network of NoC designs satisfying the requirements for scalability, energy-efficiency, customizability, and fault-tolerance.","PeriodicalId":326887,"journal":{"name":"International Conference on Information Technology: Coding and Computing (ITCC'05) - Volume II","volume":"72 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":"114607905","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}
We present an innovative routing protocol that utilizes multiple channels to improve performance in wireless ad-hoc networks. The basic idea of the protocol is to use multiple channels so that multiple useful transmissions can occur simultaneously, thus increasing network capacity. The proposed scheme requires minor changes to an existing proactive ad-hoc routing protocol and no modifications to the current IEEE 802.11 medium access control (MAC) protocol. To avoid inefficiencies due to periodic updates in the proactive routing protocol, the proposed scheme divides the network layer into control and data planes. Nodes send routing updates using the control channel and user packets using the data channel. We extend the Destination-Sequenced Distance-Vector (DSDV) routing protocol to a multi-channel version, DSDV-MC. Simulation results indicate that DSDV-MC exploits multiple channels to improve network capacity. Goodput increases in proportion to the number of available channels as the number of nodes and network load increase in both single-hop and multiple-hop networks.
{"title":"A proactive routing protocol for multi-channel wireless ad-hoc networks (DSDV-MC)","authors":"U. Lee, S. Midkiff, J. Park","doi":"10.1109/ITCC.2005.26","DOIUrl":"https://doi.org/10.1109/ITCC.2005.26","url":null,"abstract":"We present an innovative routing protocol that utilizes multiple channels to improve performance in wireless ad-hoc networks. The basic idea of the protocol is to use multiple channels so that multiple useful transmissions can occur simultaneously, thus increasing network capacity. The proposed scheme requires minor changes to an existing proactive ad-hoc routing protocol and no modifications to the current IEEE 802.11 medium access control (MAC) protocol. To avoid inefficiencies due to periodic updates in the proactive routing protocol, the proposed scheme divides the network layer into control and data planes. Nodes send routing updates using the control channel and user packets using the data channel. We extend the Destination-Sequenced Distance-Vector (DSDV) routing protocol to a multi-channel version, DSDV-MC. Simulation results indicate that DSDV-MC exploits multiple channels to improve network capacity. Goodput increases in proportion to the number of available channels as the number of nodes and network load increase in both single-hop and multiple-hop networks.","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":"126911149","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
扫码关注我们
求助内容：
应助结果提醒方式：