R. Hashemi, J. H. Early, M. Bahar, A. Tyler, John F. Young
The predictive system presented in this paper employs both SOM and Hopfield nets to determine whether a given chemical agent causes cancer in the liver. The SOM net performs the clustering of the training set and delivers a signature for each cluster. Hopfield net treats each signature as an exemplar and learns the exemplars. Each record of the test set is considered a corrupted signature. The Hopfield net tries to un-corrupt the test record using learned exemplars and map it to one of the signatures and consequently to the prediction value associated with the signature. Four pairs of training and test sets are used to test the system. To establish the validity of the new predictive system, its performance is compared with the performance of the discriminant analysis and the rough sets methodology applied on the same datasets.
{"title":"A signature-based liver cancer predictive system","authors":"R. Hashemi, J. H. Early, M. Bahar, A. Tyler, John F. Young","doi":"10.1109/ITCC.2005.37","DOIUrl":"https://doi.org/10.1109/ITCC.2005.37","url":null,"abstract":"The predictive system presented in this paper employs both SOM and Hopfield nets to determine whether a given chemical agent causes cancer in the liver. The SOM net performs the clustering of the training set and delivers a signature for each cluster. Hopfield net treats each signature as an exemplar and learns the exemplars. Each record of the test set is considered a corrupted signature. The Hopfield net tries to un-corrupt the test record using learned exemplars and map it to one of the signatures and consequently to the prediction value associated with the signature. Four pairs of training and test sets are used to test the system. To establish the validity of the new predictive system, its performance is compared with the performance of the discriminant analysis and the rough sets methodology applied on the same datasets.","PeriodicalId":326887,"journal":{"name":"International Conference on Information Technology: Coding and Computing (ITCC'05) - Volume II","volume":"109 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":"117194194","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}
This paper presents a high performance and scalable elliptic curve processor which is designed to be resistant against timing attacks. The point multiplication algorithm (double-add-subtract) is modified so that the processor performs the same operations for every 3 bits of the scalar k independent of the bit pattern of the 3 bits. Therefore, it is not possible to extract the key pattern using a timing attack. The data flow graph of the modified algorithm is derived and the underlying Galois field operators are scheduled so that the point multiplication delay is minimized. The architecture of this processor is based on the Galois field of GF(2n) and the bit-serial field multiplier and squarer are designed. The processor is configurable for any value of n and the delay of point multiplication is [18(n+3) + (n+3)/2 + 1]/spl times/(n/3) clock cycles. For the case of GF(2/sup 163/) the point multiplication delay is 165888 clock cycles.
{"title":"A scalable and high performance elliptic curve processor with resistance to timing attacks","authors":"A. Hodjat, D. Hwang, I. Verbauwhede","doi":"10.1109/ITCC.2005.32","DOIUrl":"https://doi.org/10.1109/ITCC.2005.32","url":null,"abstract":"This paper presents a high performance and scalable elliptic curve processor which is designed to be resistant against timing attacks. The point multiplication algorithm (double-add-subtract) is modified so that the processor performs the same operations for every 3 bits of the scalar k independent of the bit pattern of the 3 bits. Therefore, it is not possible to extract the key pattern using a timing attack. The data flow graph of the modified algorithm is derived and the underlying Galois field operators are scheduled so that the point multiplication delay is minimized. The architecture of this processor is based on the Galois field of GF(2n) and the bit-serial field multiplier and squarer are designed. The processor is configurable for any value of n and the delay of point multiplication is [18(n+3) + (n+3)/2 + 1]/spl times/(n/3) clock cycles. For the case of GF(2/sup 163/) the point multiplication delay is 165888 clock cycles.","PeriodicalId":326887,"journal":{"name":"International Conference on Information Technology: Coding and Computing (ITCC'05) - Volume II","volume":"101 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":"132333320","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 focuses on the development of a maintainable information filtering system. The simple and efficient solution to this problem is to block the Web sites by URL, including IP address. However, it is not efficient for unknown Web sites and it is difficult to obtain complete block list. Content based filtering is suggested to overcome this problem as an additional strategy of URL filtering. The manual rule based method is widely applied in current content filtering systems, but they overlook the knowledge acquisition bottleneck problems. To solve this problem, we employed the multiple classification ripple-down rules (MCRDR) knowledge acquisition method, which allows the domain expert to maintain the knowledge base without the help of knowledge engineers. Throughout this study, we prove the MCRDR based information filtering system can easily prevent unknown Web information from being delivered and easily maintain the knowledge base for the filtering system.
{"title":"Dynamic Web content filtering based on user's knowledge","authors":"N. Churcharoenkrung, Yang Sok Kim, B. Kang","doi":"10.1109/ITCC.2005.137","DOIUrl":"https://doi.org/10.1109/ITCC.2005.137","url":null,"abstract":"This paper focuses on the development of a maintainable information filtering system. The simple and efficient solution to this problem is to block the Web sites by URL, including IP address. However, it is not efficient for unknown Web sites and it is difficult to obtain complete block list. Content based filtering is suggested to overcome this problem as an additional strategy of URL filtering. The manual rule based method is widely applied in current content filtering systems, but they overlook the knowledge acquisition bottleneck problems. To solve this problem, we employed the multiple classification ripple-down rules (MCRDR) knowledge acquisition method, which allows the domain expert to maintain the knowledge base without the help of knowledge engineers. Throughout this study, we prove the MCRDR based information filtering system can easily prevent unknown Web information from being delivered and easily maintain the knowledge base for the filtering system.","PeriodicalId":326887,"journal":{"name":"International Conference on Information Technology: Coding and Computing (ITCC'05) - Volume II","volume":"42 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":"132914717","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}
Pervasive systems are created by introducing wireless communication into distributed multimedia systems. These systems facilitate mobile data access to applications such as health care, tourism and emergency. However new challenges have emerged that has not been adequately addressed in traditional distributed multimedia systems. In pervasive systems, data must be adapted to the user's preferences, device capabilities and network conditions. Several content adaptation techniques have been proposed to fit the data to the usage environment. In this paper we present a distributed content adaptation framework (DCAF) for distributed multimedia systems and its prototype implementation. The architecture takes into consideration client profile, network conditions, content profile (meta-data) and available adaptation services (third party software elements) to construct an optimal dynamic adaptation graph.
{"title":"Distributed content adaptation for pervasive systems","authors":"Girma Berhe, L. Brunie, J. Pierson","doi":"10.1109/ITCC.2005.133","DOIUrl":"https://doi.org/10.1109/ITCC.2005.133","url":null,"abstract":"Pervasive systems are created by introducing wireless communication into distributed multimedia systems. These systems facilitate mobile data access to applications such as health care, tourism and emergency. However new challenges have emerged that has not been adequately addressed in traditional distributed multimedia systems. In pervasive systems, data must be adapted to the user's preferences, device capabilities and network conditions. Several content adaptation techniques have been proposed to fit the data to the usage environment. In this paper we present a distributed content adaptation framework (DCAF) for distributed multimedia systems and its prototype implementation. The architecture takes into consideration client profile, network conditions, content profile (meta-data) and available adaptation services (third party software elements) to construct an optimal dynamic adaptation graph.","PeriodicalId":326887,"journal":{"name":"International Conference on Information Technology: Coding and Computing (ITCC'05) - Volume II","volume":"74 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":"134483811","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}
Zhiwen Yu, Xingshe Zhou, Daqing Zhang, A. Lugmayr, Zhiyong Yu
The ubiquitous computing environment and users' demand for multimedia personalization precipitate a need for ubiquitous personalized multimedia services (UPMSs). Delivering UPMSs is very complex because of diverse device capabilities, dynamic network characteristics, etc. This paper proposes a lifecycle management model based on FSM (finite state machines) for ubiquitous personalized multimedia services (UPMSs). By using this model, the management of UPMSs is very clear and easy, and the services are delivered more efficiently, effectively, and robustly.
{"title":"A ubiquitous personalized multimedia service model based on FSM","authors":"Zhiwen Yu, Xingshe Zhou, Daqing Zhang, A. Lugmayr, Zhiyong Yu","doi":"10.1109/ITCC.2005.51","DOIUrl":"https://doi.org/10.1109/ITCC.2005.51","url":null,"abstract":"The ubiquitous computing environment and users' demand for multimedia personalization precipitate a need for ubiquitous personalized multimedia services (UPMSs). Delivering UPMSs is very complex because of diverse device capabilities, dynamic network characteristics, etc. This paper proposes a lifecycle management model based on FSM (finite state machines) for ubiquitous personalized multimedia services (UPMSs). By using this model, the management of UPMSs is very clear and easy, and the services are delivered more efficiently, effectively, and robustly.","PeriodicalId":326887,"journal":{"name":"International Conference on Information Technology: Coding and Computing (ITCC'05) - Volume II","volume":"74 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":"134518176","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 investigate the selection of an optimal threshold level that takes into account security and quality of service requirements for ad hoc networks. We incorporate intelligence into the selection of an optimal threshold for a distributed threshold cryptography scheme for a distributed trust model in ad hoc networks. We investigate both local and global threshold schemes.
{"title":"QoS-based authentication scheme for ad hoc wireless networks","authors":"P. Muppala, Johnson P. Thomas, A. Abraham","doi":"10.1109/ITCC.2005.235","DOIUrl":"https://doi.org/10.1109/ITCC.2005.235","url":null,"abstract":"In this paper we investigate the selection of an optimal threshold level that takes into account security and quality of service requirements for ad hoc networks. We incorporate intelligence into the selection of an optimal threshold for a distributed threshold cryptography scheme for a distributed trust model in ad hoc networks. We investigate both local and global threshold schemes.","PeriodicalId":326887,"journal":{"name":"International Conference on Information Technology: Coding and Computing (ITCC'05) - Volume II","volume":"460 ","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2005-04-04","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"133847818","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
扫码关注我们
求助内容：
应助结果提醒方式：