Pub Date : 2004-03-28DOI: 10.1109/EEE.2004.1287322
A. Waluyo, R. Hsieh, D. Taniar, W. Rahayu, B. Srinivasan
The emerging of wireless computing motivates radical changes of how information is derived. Our paper concerns with developing push and pull based application in wireless environment. We use a simplified e-health (hospital) context to demonstrate some effective uses of pull-based and push-based mechanisms. The pull mechanism involves information retrieval from a database, and update information in the database. The push mechanism is classified into three scenarios, (i) aperiodic push, (ii) periodic push - global recipients and (iii) periodic push - selective recipients.
{"title":"Utilising push and pull mechanism in wireless e-health environment","authors":"A. Waluyo, R. Hsieh, D. Taniar, W. Rahayu, B. Srinivasan","doi":"10.1109/EEE.2004.1287322","DOIUrl":"https://doi.org/10.1109/EEE.2004.1287322","url":null,"abstract":"The emerging of wireless computing motivates radical changes of how information is derived. Our paper concerns with developing push and pull based application in wireless environment. We use a simplified e-health (hospital) context to demonstrate some effective uses of pull-based and push-based mechanisms. The pull mechanism involves information retrieval from a database, and update information in the database. The push mechanism is classified into three scenarios, (i) aperiodic push, (ii) periodic push - global recipients and (iii) periodic push - selective recipients.","PeriodicalId":360167,"journal":{"name":"IEEE International Conference on e-Technology, e-Commerce and e-Service, 2004. EEE '04. 2004","volume":"11 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2004-03-28","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"132308460","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}
Pub Date : 2004-03-28DOI: 10.1109/EEE.2004.1287334
A. Wombacher, Péter Fankhauser, Bendick Mahleko, E. Neuhold
Web services have a potential to enhance B2B e-commerce over the Internet by allowing companies and organizations to publish their business processes on service directories where potential trading partners can find them. This can give rise to new business paradigms based on ad-hoc trading relations as companies, particularly small to medium scale, can cheaply and flexibly enter into fruitful contracts, e.g., through subcontracting from big companies by simply publishing their business processes and the services they offer. More business process support by the Web service infrastructure is however needed before such a paradigm change can materialize. A service for searching and matchmaking of business processes does not yet exist in the current infrastructure. We believe that such a service is needed and will enable companies and organizations to be able to establish ad-hoc business relations without relying on manually negotiated interorganizational workflows. We give a formal semantics to business process matchmaking based on finite state automata extended by logical expressions associated to states.
{"title":"Matchmaking for business processes based on choreographies","authors":"A. Wombacher, Péter Fankhauser, Bendick Mahleko, E. Neuhold","doi":"10.1109/EEE.2004.1287334","DOIUrl":"https://doi.org/10.1109/EEE.2004.1287334","url":null,"abstract":"Web services have a potential to enhance B2B e-commerce over the Internet by allowing companies and organizations to publish their business processes on service directories where potential trading partners can find them. This can give rise to new business paradigms based on ad-hoc trading relations as companies, particularly small to medium scale, can cheaply and flexibly enter into fruitful contracts, e.g., through subcontracting from big companies by simply publishing their business processes and the services they offer. More business process support by the Web service infrastructure is however needed before such a paradigm change can materialize. A service for searching and matchmaking of business processes does not yet exist in the current infrastructure. We believe that such a service is needed and will enable companies and organizations to be able to establish ad-hoc business relations without relying on manually negotiated interorganizational workflows. We give a formal semantics to business process matchmaking based on finite state automata extended by logical expressions associated to states.","PeriodicalId":360167,"journal":{"name":"IEEE International Conference on e-Technology, e-Commerce and e-Service, 2004. EEE '04. 2004","volume":"25 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2004-03-28","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"130608114","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}
Pub Date : 2004-03-28DOI: 10.1109/EEE.2004.1287349
Tianhan Gao, Nan Guo, Hong Zhao
A self-adapting mobile IPv6 model based on MAP is presented to optimize the performance when mobile node moves frequently at remote region. Through enhancing the MAP, adopting the self-adapting binding update policy and intra-CN process, the model optimizes mobile node's moving performance, owns the capability of self-adapting to exterior network changes as well as improves the utilization of network resources.
{"title":"A self-adapting mobile IPv6 model based on MAP","authors":"Tianhan Gao, Nan Guo, Hong Zhao","doi":"10.1109/EEE.2004.1287349","DOIUrl":"https://doi.org/10.1109/EEE.2004.1287349","url":null,"abstract":"A self-adapting mobile IPv6 model based on MAP is presented to optimize the performance when mobile node moves frequently at remote region. Through enhancing the MAP, adopting the self-adapting binding update policy and intra-CN process, the model optimizes mobile node's moving performance, owns the capability of self-adapting to exterior network changes as well as improves the utilization of network resources.","PeriodicalId":360167,"journal":{"name":"IEEE International Conference on e-Technology, e-Commerce and e-Service, 2004. EEE '04. 2004","volume":"65 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2004-03-28","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"132603348","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}
Pub Date : 2004-03-28DOI: 10.1109/EEE.2004.1287323
T. Morigaki, Kanta Matsuura, O. Sudo
Theoretical studies on electronic time stamping and audit logs protection have focused mainly on safety, particularly, "the identification of falsified contents or sequences through encryption". However, these studies don't consider such details as time (being punctual to the second) or which electronic documents or data are older or newer when looking at several different sites. We solve the problem of time accuracy by using digital TV as a base for judging the order relation of time information between two or more sites. We design a new electronic time-stamping protocol for digital TV and invented a new digital publication infrastructure. This protocol can also accommodate the demand for ultra high-speed electronic commerce transactions in the future. Therefore, it is possibly become one of the important e-business models or enterprise e-service architectures. We show these procedures and compare them to procedures shown in other papers.
{"title":"An analysis of detailed electronic time-stamping using digital TV","authors":"T. Morigaki, Kanta Matsuura, O. Sudo","doi":"10.1109/EEE.2004.1287323","DOIUrl":"https://doi.org/10.1109/EEE.2004.1287323","url":null,"abstract":"Theoretical studies on electronic time stamping and audit logs protection have focused mainly on safety, particularly, \"the identification of falsified contents or sequences through encryption\". However, these studies don't consider such details as time (being punctual to the second) or which electronic documents or data are older or newer when looking at several different sites. We solve the problem of time accuracy by using digital TV as a base for judging the order relation of time information between two or more sites. We design a new electronic time-stamping protocol for digital TV and invented a new digital publication infrastructure. This protocol can also accommodate the demand for ultra high-speed electronic commerce transactions in the future. Therefore, it is possibly become one of the important e-business models or enterprise e-service architectures. We show these procedures and compare them to procedures shown in other papers.","PeriodicalId":360167,"journal":{"name":"IEEE International Conference on e-Technology, e-Commerce and e-Service, 2004. EEE '04. 2004","volume":"38 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2004-03-28","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"126891841","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}
Pub Date : 2004-03-28DOI: 10.1109/EEE.2004.1287300
Yong Zongkai, Lan Weimin, Tan Yunmeng
Micropayment systems in existence usually do not provide fairness, which means that either the customer or the merchant, or both, can cheat each other and gain a financial advantage by misbehaving in the protocols. We propose a new fair micropayment system based on hash chain, which is an offline, prepaid system and supports divisibility of digital coins in a simpler way. Moreover, in our system, a hash chain can be used to have transactions with different merchants. Compared with other micropayment schemes, e.g. Pay Word, no public-key operation is required, which improves the efficiency of our system. In addition, restricted anonymous is provided in our system.
{"title":"A new fair micropayment system based on hash chain","authors":"Yong Zongkai, Lan Weimin, Tan Yunmeng","doi":"10.1109/EEE.2004.1287300","DOIUrl":"https://doi.org/10.1109/EEE.2004.1287300","url":null,"abstract":"Micropayment systems in existence usually do not provide fairness, which means that either the customer or the merchant, or both, can cheat each other and gain a financial advantage by misbehaving in the protocols. We propose a new fair micropayment system based on hash chain, which is an offline, prepaid system and supports divisibility of digital coins in a simpler way. Moreover, in our system, a hash chain can be used to have transactions with different merchants. Compared with other micropayment schemes, e.g. Pay Word, no public-key operation is required, which improves the efficiency of our system. In addition, restricted anonymous is provided in our system.","PeriodicalId":360167,"journal":{"name":"IEEE International Conference on e-Technology, e-Commerce and e-Service, 2004. EEE '04. 2004","volume":"17 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2004-03-28","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"114690999","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}
Pub Date : 2004-03-28DOI: 10.1109/EEE.2004.1287312
Hua-Fu Li, Suh-Yin Lee
We propose an online single-pass algorithm MFC-append (mining frequency change patterns in append-only data streams) for online mining frequent frequency change items in continuous append-only data streams. An online space-efficient data structure called Change-Sketch is developed for providing fast response time to compute dynamic frequency changes between data streams. A modified approach MFC-dynamic (mining frequency change patterns in dynamic data streams) is also presented to mine frequency changes in dynamic data streams. The theoretic analyses show that our algorithms meet the major performance requirements of single-pass, bounded storage, and real time for streaming data mining.
{"title":"Single-pass algorithms for mining frequency change patterns with limited space in evolving append-only and dynamic transaction data streams","authors":"Hua-Fu Li, Suh-Yin Lee","doi":"10.1109/EEE.2004.1287312","DOIUrl":"https://doi.org/10.1109/EEE.2004.1287312","url":null,"abstract":"We propose an online single-pass algorithm MFC-append (mining frequency change patterns in append-only data streams) for online mining frequent frequency change items in continuous append-only data streams. An online space-efficient data structure called Change-Sketch is developed for providing fast response time to compute dynamic frequency changes between data streams. A modified approach MFC-dynamic (mining frequency change patterns in dynamic data streams) is also presented to mine frequency changes in dynamic data streams. The theoretic analyses show that our algorithms meet the major performance requirements of single-pass, bounded storage, and real time for streaming data mining.","PeriodicalId":360167,"journal":{"name":"IEEE International Conference on e-Technology, e-Commerce and e-Service, 2004. EEE '04. 2004","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2004-03-28","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"129489682","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}
Pub Date : 2004-03-28DOI: 10.1109/EEE.2004.1287366
Hung-Min Sun, Bin-Tsan Hsieh, V. Tseng
With the rapid development of communication technology, wireless technology has become more and more important, and has been widely used in personal communication. Recently, Aydos et al. proposed an ECC-based authenticated key agreement protocol for wireless communication. In their protocol, they used ECDSA and Diffie-Hellman key agreement to provide authentication and to obtain a session key for later communication. In this paper, however, we show that Aydos et al's ECC-based authenticated key agreement protocol for wireless communication does not achieve some essential security requirements including forward secrecy, known-key security, and mutual authentication.
{"title":"Cryptanalysis of Aydos et al.'s ECC-based wireless authentication protocol","authors":"Hung-Min Sun, Bin-Tsan Hsieh, V. Tseng","doi":"10.1109/EEE.2004.1287366","DOIUrl":"https://doi.org/10.1109/EEE.2004.1287366","url":null,"abstract":"With the rapid development of communication technology, wireless technology has become more and more important, and has been widely used in personal communication. Recently, Aydos et al. proposed an ECC-based authenticated key agreement protocol for wireless communication. In their protocol, they used ECDSA and Diffie-Hellman key agreement to provide authentication and to obtain a session key for later communication. In this paper, however, we show that Aydos et al's ECC-based authenticated key agreement protocol for wireless communication does not achieve some essential security requirements including forward secrecy, known-key security, and mutual authentication.","PeriodicalId":360167,"journal":{"name":"IEEE International Conference on e-Technology, e-Commerce and e-Service, 2004. EEE '04. 2004","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2004-03-28","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"129696279","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}
Pub Date : 2004-03-28DOI: 10.1109/EEE.2004.1287282
Chen-Liang Fang, Deron Liang, Chyouhwa Chen, PuSan Lin
Zwass suggested that middleware and message service is one of the five fundamental technologies used to realize electronic commerce (EC) [Zwass, V. (1996)]. The simple object access protocol (SOAP) is recognized as a more promising middleware for EC applications among other leading candidates such as CORBA. We notice that the fault-tolerance issue is somewhat neglected in the current standard, i.e., SOAP 1.1. We therefore proposed a fault tolerant Web service called fault-tolerant SOAP or FT-SOAP through which Web services can be built with higher resilience to failure. Active replication is a common approach to building highly available and reliable distributed software applications. The redundant nested invocation (RNI) problem arises when servers in a replicated group issues nested invocations to other server groups in response to a client invocation. In this work, we propose a mechanism to perform auto-suppression of redundant nested invocation in an active replication FT-SOAP system. Our approach ensures the portability requirement of a middleware, especially for FT-SOAP.
{"title":"A redundant nested invocation suppression mechanism for active replication fault-tolerant Web service","authors":"Chen-Liang Fang, Deron Liang, Chyouhwa Chen, PuSan Lin","doi":"10.1109/EEE.2004.1287282","DOIUrl":"https://doi.org/10.1109/EEE.2004.1287282","url":null,"abstract":"Zwass suggested that middleware and message service is one of the five fundamental technologies used to realize electronic commerce (EC) [Zwass, V. (1996)]. The simple object access protocol (SOAP) is recognized as a more promising middleware for EC applications among other leading candidates such as CORBA. We notice that the fault-tolerance issue is somewhat neglected in the current standard, i.e., SOAP 1.1. We therefore proposed a fault tolerant Web service called fault-tolerant SOAP or FT-SOAP through which Web services can be built with higher resilience to failure. Active replication is a common approach to building highly available and reliable distributed software applications. The redundant nested invocation (RNI) problem arises when servers in a replicated group issues nested invocations to other server groups in response to a client invocation. In this work, we propose a mechanism to perform auto-suppression of redundant nested invocation in an active replication FT-SOAP system. Our approach ensures the portability requirement of a middleware, especially for FT-SOAP.","PeriodicalId":360167,"journal":{"name":"IEEE International Conference on e-Technology, e-Commerce and e-Service, 2004. EEE '04. 2004","volume":"2 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2004-03-28","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"128560284","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}
Pub Date : 2004-03-28DOI: 10.1109/EEE.2004.1287359
Chi-Chien Pan, Kai-Hsiang Yang, Tzao-Lin Lee
Online (Web-based) examination is an effective solution for mass education evaluation. However, due to the incomplete of network security, students can communicate with each other, and we can't prevent the cheating. Therefore, keeping the security of a online examination has become an important issue. This paper focuses on how to implement a secure environment for online-examination in the general academic network environment without the need of special network topologies and hardware devices. It not only reduces the system administrator's load, but also enhances the system flexibility to fit every teacher's needs. We use (1) the distributed firewall techniques to control the network packets of all machines, and (2) the centralized security policy management to control the security policies for all machines. Beside the above mentioned, we also design some mechanisms to prevent the possible network attacks and cheating, which enhance the security of the online examination environment.
{"title":"Secure online examination architecture based on distributed firewall","authors":"Chi-Chien Pan, Kai-Hsiang Yang, Tzao-Lin Lee","doi":"10.1109/EEE.2004.1287359","DOIUrl":"https://doi.org/10.1109/EEE.2004.1287359","url":null,"abstract":"Online (Web-based) examination is an effective solution for mass education evaluation. However, due to the incomplete of network security, students can communicate with each other, and we can't prevent the cheating. Therefore, keeping the security of a online examination has become an important issue. This paper focuses on how to implement a secure environment for online-examination in the general academic network environment without the need of special network topologies and hardware devices. It not only reduces the system administrator's load, but also enhances the system flexibility to fit every teacher's needs. We use (1) the distributed firewall techniques to control the network packets of all machines, and (2) the centralized security policy management to control the security policies for all machines. Beside the above mentioned, we also design some mechanisms to prevent the possible network attacks and cheating, which enhance the security of the online examination environment.","PeriodicalId":360167,"journal":{"name":"IEEE International Conference on e-Technology, e-Commerce and e-Service, 2004. EEE '04. 2004","volume":"18 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2004-03-28","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"125254284","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}
Pub Date : 2004-03-28DOI: 10.1109/EEE.2004.1287341
Zhuang Yan, S. Fong, Meilin Shi
The objective is to design an agent-based B2B trading system that has both the dynamic negotiation ability and knowledge management functionality. Achieving both agent negotiation and knowledge management (KM) is believed to be possible when the "knowledge" that is used to describe the product and the deal are commonly represented by an object-oriented ontology called Knowledge Bead (KB) [S. Fong, et al. (2002)]. We focus on the knowledge context of agent negotiation process in electronic marketplace, discuss how knowledge can be formulated and managed, and further be utilized to assist in the competent negotiation process. This is the continued research work on knowledge beads [S. Fong, et al. (2002)][Z. Yan, et al. (2003)]. The anticipated contribution will be a clearer understanding on knowledge management utilization for intelligent negotiation in electronic commerce.
{"title":"Knowledge oriented negotiation for agent-based B2B electronic commerce","authors":"Zhuang Yan, S. Fong, Meilin Shi","doi":"10.1109/EEE.2004.1287341","DOIUrl":"https://doi.org/10.1109/EEE.2004.1287341","url":null,"abstract":"The objective is to design an agent-based B2B trading system that has both the dynamic negotiation ability and knowledge management functionality. Achieving both agent negotiation and knowledge management (KM) is believed to be possible when the \"knowledge\" that is used to describe the product and the deal are commonly represented by an object-oriented ontology called Knowledge Bead (KB) [S. Fong, et al. (2002)]. We focus on the knowledge context of agent negotiation process in electronic marketplace, discuss how knowledge can be formulated and managed, and further be utilized to assist in the competent negotiation process. This is the continued research work on knowledge beads [S. Fong, et al. (2002)][Z. Yan, et al. (2003)]. The anticipated contribution will be a clearer understanding on knowledge management utilization for intelligent negotiation in electronic commerce.","PeriodicalId":360167,"journal":{"name":"IEEE International Conference on e-Technology, e-Commerce and e-Service, 2004. EEE '04. 2004","volume":"5 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2004-03-28","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"132429524","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
扫码关注我们
求助内容：
应助结果提醒方式：