Methods for exchanging secret keys are essential for electronic commerce transactions. In this paper the well-known Diffie-Hellman-method is generalized to non-Abelian groups. The new method is easy to implement and contains the original method as a special case. It is to be expected that it provides higher levels of security than the original method
{"title":"A New Method for Exchanging Secret Keys","authors":"E. Stickel","doi":"10.1109/ICITA.2005.33","DOIUrl":"https://doi.org/10.1109/ICITA.2005.33","url":null,"abstract":"Methods for exchanging secret keys are essential for electronic commerce transactions. In this paper the well-known Diffie-Hellman-method is generalized to non-Abelian groups. The new method is easy to implement and contains the original method as a special case. It is to be expected that it provides higher levels of security than the original method","PeriodicalId":371528,"journal":{"name":"Third International Conference on Information Technology and Applications (ICITA'05)","volume":"2003 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2005-07-04","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"127331722","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}
Case-based reasoning (CBR) has been widely and successfully applied in legal precedent retrieval. Traditional nearest-neighbour (NN) matching has shown that it is not capable of dealing with the situations that the values of weights or dimensional matching scores are extremely high or low. These extreme situations have nonlinear psychological effects on the aggregate marching scores. Generalized nearest-neighbour (GNN) matching improved NN matching in certain situations, but it is not generally applicable and it can cause an unexpected ranking. In order to improve the limitation of NN matching and complement the deficiency of GNN matching, we propose a novel nonlinear nearest-neighbour (NNN) matching function based on the adjustments for nonlinear effects and the fuzzy logic inference. In this paper, we also describe how we apply NNN matching in our legal precedent retrieval system.
{"title":"Nonlinear nearest-neighbour matching and its application in legal precedent retrieval","authors":"Ruili Wang, Y. Zeng","doi":"10.1109/ICITA.2005.191","DOIUrl":"https://doi.org/10.1109/ICITA.2005.191","url":null,"abstract":"Case-based reasoning (CBR) has been widely and successfully applied in legal precedent retrieval. Traditional nearest-neighbour (NN) matching has shown that it is not capable of dealing with the situations that the values of weights or dimensional matching scores are extremely high or low. These extreme situations have nonlinear psychological effects on the aggregate marching scores. Generalized nearest-neighbour (GNN) matching improved NN matching in certain situations, but it is not generally applicable and it can cause an unexpected ranking. In order to improve the limitation of NN matching and complement the deficiency of GNN matching, we propose a novel nonlinear nearest-neighbour (NNN) matching function based on the adjustments for nonlinear effects and the fuzzy logic inference. In this paper, we also describe how we apply NNN matching in our legal precedent retrieval system.","PeriodicalId":371528,"journal":{"name":"Third International Conference on Information Technology and Applications (ICITA'05)","volume":"35 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2005-07-04","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"124812604","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 propose a unified approach based on graphic representation to describe the dynamic component-based architectures. It allows to describe the static and the dynamic aspects as well as the architectural constraints to be respected during the system evolution. We specify with UML2.0 the static aspect of a software system in accordance with an architectural style and the architecture dynamic aspect in terms of graph grammars rewriting rules. These specifications are defined according to the proposed notation integrating UML2.0, OCL language and the Delta notation. This integration offers to the architects an intuitive specification approach.
{"title":"Using UML2.0 and GG for describing the dynamic of software architectures","authors":"M. Kacem, M. Jmaiel, A. Kacem, K. Drira","doi":"10.1109/ICITA.2005.304","DOIUrl":"https://doi.org/10.1109/ICITA.2005.304","url":null,"abstract":"In this paper, we propose a unified approach based on graphic representation to describe the dynamic component-based architectures. It allows to describe the static and the dynamic aspects as well as the architectural constraints to be respected during the system evolution. We specify with UML2.0 the static aspect of a software system in accordance with an architectural style and the architecture dynamic aspect in terms of graph grammars rewriting rules. These specifications are defined according to the proposed notation integrating UML2.0, OCL language and the Delta notation. This integration offers to the architects an intuitive specification approach.","PeriodicalId":371528,"journal":{"name":"Third International Conference on Information Technology and Applications (ICITA'05)","volume":"34 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2005-07-04","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"125036390","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}
Even though IPv6 has been developed for more than a decade, IPv4 is still the most commonly adopted network protocol. However, the significant changes in the new version may cause the transition procedure to continue for several years. Currently, three transition mechanisms, dual stack, tunneling, and translation, are proposed to solve the problems due to the co-existence of IPv6 and IPv4. In many occasions, there could be more than one transition mechanism between network connections. In order to effectively manage the co-existing environment with various transition mechanisms, this paper presents a practical approach to deal with the management of co-existing networks. In this approach, we firstly determine the underlying transitions by gathering and analyzing corresponding IPv6 addresses. Once transitions are discovered, appropriate management facilities are developed and applied accordingly.
{"title":"Managing the co-existing network of IPv6 and IPv4 under various transition mechanisms","authors":"I-Ping Hsieh, S. Kao","doi":"10.1109/ICITA.2005.175","DOIUrl":"https://doi.org/10.1109/ICITA.2005.175","url":null,"abstract":"Even though IPv6 has been developed for more than a decade, IPv4 is still the most commonly adopted network protocol. However, the significant changes in the new version may cause the transition procedure to continue for several years. Currently, three transition mechanisms, dual stack, tunneling, and translation, are proposed to solve the problems due to the co-existence of IPv6 and IPv4. In many occasions, there could be more than one transition mechanism between network connections. In order to effectively manage the co-existing environment with various transition mechanisms, this paper presents a practical approach to deal with the management of co-existing networks. In this approach, we firstly determine the underlying transitions by gathering and analyzing corresponding IPv6 addresses. Once transitions are discovered, appropriate management facilities are developed and applied accordingly.","PeriodicalId":371528,"journal":{"name":"Third International Conference on Information Technology and Applications (ICITA'05)","volume":"36 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2005-07-04","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"126973827","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}
Tradition single cluster architecture has limit in expansibility, which is not so good when used in business tier of large-scale application. In this paper we present multi clusters architecture, which can provide more strong expansibility. And we present a new method, named LBBCP (load balance based on business component partition), to implement load balance across multi clusters. LBBCP makes formal description to the configuration of multi clusters and the properties of business components in the early stage of software lifetime, obtains business components partition schema by the way of mathematics, and implement load balance across multi clusters based on business components partition
传统的单集群体系结构在可扩展性上有一定的限制，在大规模应用的业务层中应用效果不佳。在本文中，我们提出了多集群架构，它可以提供更强的可扩展性。提出了一种基于业务组件分区的负载均衡方法LBBCP (load balance based on business component partition)来实现多集群间的负载均衡。LBBCP在软件生命周期早期对多集群的配置和业务组件的属性进行形式化描述，通过数学的方式得到业务组件分区模式，并基于业务组件分区实现多集群间的负载均衡
{"title":"Research on Load Balance of Multi Clusters Architecture Based on Business Components Partition","authors":"Yiqiang Zheng, He-qing Guo, Wei Gao, Botong Xu","doi":"10.1109/ICITA.2005.238","DOIUrl":"https://doi.org/10.1109/ICITA.2005.238","url":null,"abstract":"Tradition single cluster architecture has limit in expansibility, which is not so good when used in business tier of large-scale application. In this paper we present multi clusters architecture, which can provide more strong expansibility. And we present a new method, named LBBCP (load balance based on business component partition), to implement load balance across multi clusters. LBBCP makes formal description to the configuration of multi clusters and the properties of business components in the early stage of software lifetime, obtains business components partition schema by the way of mathematics, and implement load balance across multi clusters based on business components partition","PeriodicalId":371528,"journal":{"name":"Third International Conference on Information Technology and Applications (ICITA'05)","volume":"60 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2005-07-04","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"114951522","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}
Terrestrial neutron is being recognized as a major source of single event effects (SEEs) including soft-error of semi-conductor devices at the ground level. As semiconductor device scaling nose-dives into sub 100nm, the possible threat from single event effects is apparently growing onto IT systems that require a great number of electron devices. The modes of SEEs, however, are reportedly diverging on annual base and thus methods to quantify such effects are getting more and more complicated even for device level. In the present paper, current situation on neutron-induced SEEs are reviewed and benchmark studies are proposed to make the effects of SEEs on the reliability of IT infrastructure clear.
{"title":"Single event effects as a reliability issue of IT infrastructure","authors":"E. Ibe, H. Kameyama, Y. Yahagi, H. Yamaguchi","doi":"10.1109/ICITA.2005.254","DOIUrl":"https://doi.org/10.1109/ICITA.2005.254","url":null,"abstract":"Terrestrial neutron is being recognized as a major source of single event effects (SEEs) including soft-error of semi-conductor devices at the ground level. As semiconductor device scaling nose-dives into sub 100nm, the possible threat from single event effects is apparently growing onto IT systems that require a great number of electron devices. The modes of SEEs, however, are reportedly diverging on annual base and thus methods to quantify such effects are getting more and more complicated even for device level. In the present paper, current situation on neutron-induced SEEs are reviewed and benchmark studies are proposed to make the effects of SEEs on the reliability of IT infrastructure clear.","PeriodicalId":371528,"journal":{"name":"Third International Conference on Information Technology and Applications (ICITA'05)","volume":"109 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2005-07-04","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"122901368","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}
Automated question-answering aims at delivering concise information that contains answers to user questions. This paper reviews and compares three main question-answering approaches based on natural language processing, information retrieval and question templates, eliciting their differences and the context of application that best suits each of them.
{"title":"Automated question answering: review of the main approaches","authors":"A. Andrenucci, E. Sneiders","doi":"10.1109/ICITA.2005.78","DOIUrl":"https://doi.org/10.1109/ICITA.2005.78","url":null,"abstract":"Automated question-answering aims at delivering concise information that contains answers to user questions. This paper reviews and compares three main question-answering approaches based on natural language processing, information retrieval and question templates, eliciting their differences and the context of application that best suits each of them.","PeriodicalId":371528,"journal":{"name":"Third International Conference on Information Technology and Applications (ICITA'05)","volume":"209 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2005-07-04","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"123037910","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 nonlinear dynamic model combined TCP and UDP under RED mechanism has been presented in this paper by modified a previously developed one. We linearized the model and added the feedback control mechanism that is introduced by RED, and then educed a proposition. Based on this proposition, we analyzed the impact of several parameters on the system stability, and we can present design guidelines for choosing network parameters that lead to stable operation of the linear feedback control system. We also performed simulations using NS2, and the results show that our analysis is suitable.
{"title":"A control theoretic analysis of mixed TCP and UDP traffic under RED based on nonlinear dynamic model","authors":"Li Wang, Zeng-zhi Li, Yanping Chen","doi":"10.1109/ICITA.2005.6","DOIUrl":"https://doi.org/10.1109/ICITA.2005.6","url":null,"abstract":"A nonlinear dynamic model combined TCP and UDP under RED mechanism has been presented in this paper by modified a previously developed one. We linearized the model and added the feedback control mechanism that is introduced by RED, and then educed a proposition. Based on this proposition, we analyzed the impact of several parameters on the system stability, and we can present design guidelines for choosing network parameters that lead to stable operation of the linear feedback control system. We also performed simulations using NS2, and the results show that our analysis is suitable.","PeriodicalId":371528,"journal":{"name":"Third International Conference on Information Technology and Applications (ICITA'05)","volume":"5 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2005-07-04","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"114154662","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 computer assisted teaching system which enables sharing the same operation with a large number of users using P2P is shown. The users of this system can share the same operation of applications such like a text editor, a draw program and others, on their computer terminals in real-time. This system can show an operation on a terminal to all terminals in the latency of O(log N) time complexity, where N is the number of terminals. In order to share the same operation on computer terminals, at most one operation must be performed on them at a time. In order to realize this, a mutual exclusion algorithm is embedded in this system. The time complexity of entering the critical section is O(log N). We have compared the performance of this system with the performance of a client-server system. A game could be played by remote users using this system
{"title":"Sharing the Same Operation with a Large Number of Users Using P2P","authors":"Takashi Yamanoue","doi":"10.1109/ICITA.2005.252","DOIUrl":"https://doi.org/10.1109/ICITA.2005.252","url":null,"abstract":"A computer assisted teaching system which enables sharing the same operation with a large number of users using P2P is shown. The users of this system can share the same operation of applications such like a text editor, a draw program and others, on their computer terminals in real-time. This system can show an operation on a terminal to all terminals in the latency of O(log N) time complexity, where N is the number of terminals. In order to share the same operation on computer terminals, at most one operation must be performed on them at a time. In order to realize this, a mutual exclusion algorithm is embedded in this system. The time complexity of entering the critical section is O(log N). We have compared the performance of this system with the performance of a client-server system. A game could be played by remote users using this system","PeriodicalId":371528,"journal":{"name":"Third International Conference on Information Technology and Applications (ICITA'05)","volume":"42 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2005-07-04","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"114461343","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 present a technical review on cerebral vasculature segmentation approaches developed recently. The scope of the review is mainly on the segmentation techniques that can provide complete three-dimensional (3D) vascular structure for quantification and visualization on magnetic resonance angiography (MRA) data. We first brief the specific considerations needed in segmenting cerebral vasculature from MRA data, and the taxonomy of the segmentation. Then we discuss the latest segmentation techniques with comments on their performance. In particular, we present our latest achievement in segmentation. Finally, we conclude and identify possible future challenges in the area.
{"title":"Recent progresses on cerebral vasculature segmentation for 3D quantification and visualization of MRA","authors":"S. Luo, Jesse S. Jin","doi":"10.1109/ICITA.2005.233","DOIUrl":"https://doi.org/10.1109/ICITA.2005.233","url":null,"abstract":"In this paper we present a technical review on cerebral vasculature segmentation approaches developed recently. The scope of the review is mainly on the segmentation techniques that can provide complete three-dimensional (3D) vascular structure for quantification and visualization on magnetic resonance angiography (MRA) data. We first brief the specific considerations needed in segmenting cerebral vasculature from MRA data, and the taxonomy of the segmentation. Then we discuss the latest segmentation techniques with comments on their performance. In particular, we present our latest achievement in segmentation. Finally, we conclude and identify possible future challenges in the area.","PeriodicalId":371528,"journal":{"name":"Third International Conference on Information Technology and Applications (ICITA'05)","volume":"42 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2005-07-04","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"114602285","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
扫码关注我们
求助内容：
应助结果提醒方式：