Pub Date : 2004-03-28DOI: 10.1109/EEE.2004.1287336
Kanta Matsuura
In e-science, a participant may entrust data-analysis to a third party. This analysis may necessitate digital watermarking for security/privacy reasons. When we use watermarking, there is a robustness requirement that the data be kept acceptable. By using a phantom experiment, We demonstrate that the traditional robustness evaluation does not always work in the e-science scenario.
{"title":"Robustness of entrusted data-analysis in e-science research collaboration","authors":"Kanta Matsuura","doi":"10.1109/EEE.2004.1287336","DOIUrl":"https://doi.org/10.1109/EEE.2004.1287336","url":null,"abstract":"In e-science, a participant may entrust data-analysis to a third party. This analysis may necessitate digital watermarking for security/privacy reasons. When we use watermarking, there is a robustness requirement that the data be kept acceptable. By using a phantom experiment, We demonstrate that the traditional robustness evaluation does not always work in the e-science scenario.","PeriodicalId":360167,"journal":{"name":"IEEE International Conference on e-Technology, e-Commerce and e-Service, 2004. EEE '04. 2004","volume":"21 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":"133553942","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.1287315
Kun-Lung Wu, Shyh-Kwei Chen, Philip S. Yu
We study a new main memory-based approach to indexing continual range queries to support location-aware mobile services. The query index is used to efficiently answer the following question repeatedly: "Which moving objects are currently located inside the boundaries of individual queries?" We present a covering tile-based (COVET) query index, where adjacent covering tiles touch each other only at the edges. A set of virtual tiles is predefined, each with a unique ID. One or more of the virtual tiles are used to strictly cover individual range queries. A COVET index maintains a direct mapping between covering tiles and queries. It allows query evaluation to take advantage of incremental changes in object locations. Simulations are conducted to evaluate the effectiveness of the COVET index and compare virtual tiles of different shapes and sizes.
{"title":"Indexing continual range queries for location-aware mobile services","authors":"Kun-Lung Wu, Shyh-Kwei Chen, Philip S. Yu","doi":"10.1109/EEE.2004.1287315","DOIUrl":"https://doi.org/10.1109/EEE.2004.1287315","url":null,"abstract":"We study a new main memory-based approach to indexing continual range queries to support location-aware mobile services. The query index is used to efficiently answer the following question repeatedly: \"Which moving objects are currently located inside the boundaries of individual queries?\" We present a covering tile-based (COVET) query index, where adjacent covering tiles touch each other only at the edges. A set of virtual tiles is predefined, each with a unique ID. One or more of the virtual tiles are used to strictly cover individual range queries. A COVET index maintains a direct mapping between covering tiles and queries. It allows query evaluation to take advantage of incremental changes in object locations. Simulations are conducted to evaluate the effectiveness of the COVET index and compare virtual tiles of different shapes and sizes.","PeriodicalId":360167,"journal":{"name":"IEEE International Conference on e-Technology, e-Commerce and e-Service, 2004. EEE '04. 2004","volume":"3 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":"123922120","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.1287331
Deok-Gyu Lee, Hyung-Geun Oh, Imyeong Lee
Electronic cash systems are used as payment tools of e-commerce. They should be equipped with independence, transferability, and dividability, which are requirements of digital rights management (DRM) servicing contents. The contents can be recognized in terms of money. Its concept applies to reprint, copy, and anonymous users. This paper shows DRM model which adopted e-cash as a result of examining requirements of e-cash and DRM. The DRM introduces the hierarchical structure, and gives anonymity to the contents or users. Lastly, several methods proposed are examined, compared and analyzed.
{"title":"A study on contents distribution using electronic cash system","authors":"Deok-Gyu Lee, Hyung-Geun Oh, Imyeong Lee","doi":"10.1109/EEE.2004.1287331","DOIUrl":"https://doi.org/10.1109/EEE.2004.1287331","url":null,"abstract":"Electronic cash systems are used as payment tools of e-commerce. They should be equipped with independence, transferability, and dividability, which are requirements of digital rights management (DRM) servicing contents. The contents can be recognized in terms of money. Its concept applies to reprint, copy, and anonymous users. This paper shows DRM model which adopted e-cash as a result of examining requirements of e-cash and DRM. The DRM introduces the hierarchical structure, and gives anonymity to the contents or users. Lastly, several methods proposed are examined, compared and analyzed.","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":"115902372","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.1287352
Woei-Kae Chen, Kuo-Hua Chung
Report generation is arguably the most important task for database applications. It is especially important for e-commerce applications, since dynamic Web pages consisting of database reports are essential to almost every transaction. When a report is generated, the layout of the data sources must be converted to the layout of the report. This conversion is called data transformation. It has been shown that data transformation can be simplified by using table operations. In this paper, we propose a set of new extendable table operations. We show that these operations can be applied visually so as to support visual programming for data transformation. We also implement a visual application called table presentation system (TPS) to demonstrate how these operations are used. With the aid of TPS, one can create sophisticated database reports without writing data transformation programs. Therefore the complexity of data transformation is greatly reduced.
{"title":"A table presentation system for database and Web applications","authors":"Woei-Kae Chen, Kuo-Hua Chung","doi":"10.1109/EEE.2004.1287352","DOIUrl":"https://doi.org/10.1109/EEE.2004.1287352","url":null,"abstract":"Report generation is arguably the most important task for database applications. It is especially important for e-commerce applications, since dynamic Web pages consisting of database reports are essential to almost every transaction. When a report is generated, the layout of the data sources must be converted to the layout of the report. This conversion is called data transformation. It has been shown that data transformation can be simplified by using table operations. In this paper, we propose a set of new extendable table operations. We show that these operations can be applied visually so as to support visual programming for data transformation. We also implement a visual application called table presentation system (TPS) to demonstrate how these operations are used. With the aid of TPS, one can create sophisticated database reports without writing data transformation programs. Therefore the complexity of data transformation is greatly reduced.","PeriodicalId":360167,"journal":{"name":"IEEE International Conference on e-Technology, e-Commerce and e-Service, 2004. EEE '04. 2004","volume":"71 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":"115956870","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.1287313
T. Kwong, Matthew K. O. Lee
With the rapid growth of the Internet in terms of the widespread acceptance and the increased bandwidth of connection, the situation of digital piracy has become increasingly serious. Due to increased prosecution by the authorities, we rarely find Web sites that provide copyrighted digital materials (music, movies, software, games, etc.) to download. Instead, end users share those copyrighted materials among themselves. This kind of peer-to-peer sharing is facilitated by the growth of virtual communities. Piracy in virtual communities has become a major trend. Our objective is to examine the behavioral intention of members in virtual communities to digital piracy under group settings by proposing a theoretical model.
{"title":"Understanding the behavioral intention to digital piracy in virtual communities - a propose model","authors":"T. Kwong, Matthew K. O. Lee","doi":"10.1109/EEE.2004.1287313","DOIUrl":"https://doi.org/10.1109/EEE.2004.1287313","url":null,"abstract":"With the rapid growth of the Internet in terms of the widespread acceptance and the increased bandwidth of connection, the situation of digital piracy has become increasingly serious. Due to increased prosecution by the authorities, we rarely find Web sites that provide copyrighted digital materials (music, movies, software, games, etc.) to download. Instead, end users share those copyrighted materials among themselves. This kind of peer-to-peer sharing is facilitated by the growth of virtual communities. Piracy in virtual communities has become a major trend. Our objective is to examine the behavioral intention of members in virtual communities to digital piracy under group settings by proposing a theoretical model.","PeriodicalId":360167,"journal":{"name":"IEEE International Conference on e-Technology, e-Commerce and e-Service, 2004. EEE '04. 2004","volume":"61 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":"126540633","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.1287287
F. Rabhi, Feras T. Dabous, Hairong Yu, B. Benatallah, Yun Ki Lee
The area of finance has always evolved along side with the development of new technology. For instance, utilizing new technologies in capital markets trading automation is one of the major factors for the market efficiency and competitiveness as time has a huge impact on the costs incurred by financial institutions. Considering capital markets as our case study, we investigate the usability of these technologies in implementing business processes that span across a number of legacy applications. We describe Web services as emerging technologies that facilitate the composition and execution of distributed business processes. We also present an overview of a service-oriented architecture for capital market systems (CMSs). This architecture is meant to integrate existing legacy applications and facilitate the automation of trading-related business processes.
{"title":"A case study in developing Web services for capital markets","authors":"F. Rabhi, Feras T. Dabous, Hairong Yu, B. Benatallah, Yun Ki Lee","doi":"10.1109/EEE.2004.1287287","DOIUrl":"https://doi.org/10.1109/EEE.2004.1287287","url":null,"abstract":"The area of finance has always evolved along side with the development of new technology. For instance, utilizing new technologies in capital markets trading automation is one of the major factors for the market efficiency and competitiveness as time has a huge impact on the costs incurred by financial institutions. Considering capital markets as our case study, we investigate the usability of these technologies in implementing business processes that span across a number of legacy applications. We describe Web services as emerging technologies that facilitate the composition and execution of distributed business processes. We also present an overview of a service-oriented architecture for capital market systems (CMSs). This architecture is meant to integrate existing legacy applications and facilitate the automation of trading-related business processes.","PeriodicalId":360167,"journal":{"name":"IEEE International Conference on e-Technology, e-Commerce and e-Service, 2004. EEE '04. 2004","volume":"36 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":"127009392","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.1287350
Keqiu Li, Hong Shen
Placement of Web proxy servers is an important avenue to save network bandwidth, alleviate server load, and reduce latency experienced by users. The general problem of Web proxy placement is to compute the optimal locations for placing k Web proxies in a network such that the objective concerned is minimized or maximized. We address this problem for tree networks and propose a novel mathematical model for it. In our model, we consider maximizing the overall access gain as our objective and formulate this problem as an optimization problem. The optimal placement is obtained using a computationally efficient dynamic programming-based algorithm. Applying our mathematical model, we also present a solution to Web proxy placement for autonomous systems (ASes), as a natural extension of the solution for tree networks. Our algorithms have been implemented. The simulation results show that our model significantly outperforms the random placement model.
{"title":"Optimal placement of Web proxies for tree networks","authors":"Keqiu Li, Hong Shen","doi":"10.1109/EEE.2004.1287350","DOIUrl":"https://doi.org/10.1109/EEE.2004.1287350","url":null,"abstract":"Placement of Web proxy servers is an important avenue to save network bandwidth, alleviate server load, and reduce latency experienced by users. The general problem of Web proxy placement is to compute the optimal locations for placing k Web proxies in a network such that the objective concerned is minimized or maximized. We address this problem for tree networks and propose a novel mathematical model for it. In our model, we consider maximizing the overall access gain as our objective and formulate this problem as an optimization problem. The optimal placement is obtained using a computationally efficient dynamic programming-based algorithm. Applying our mathematical model, we also present a solution to Web proxy placement for autonomous systems (ASes), as a natural extension of the solution for tree networks. Our algorithms have been implemented. The simulation results show that our model significantly outperforms the random placement model.","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":"129741411","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-02-01DOI: 10.1109/EEE.2004.1287333
P. V. Eck, J. Gordijn, R. Wieringa
Designing cross-organizational e-business applications faces the problem that the collaborating businesses must align their commercial interests without any central decision making authority. The design process must therefore yield a clear view of the commercial value of the collaboration for each economic actor, as well as a clear specification of the activities to be performed by each actor and a specification of information systems to be used by each actor. We present guidelines for designing the value network of the collaboration, which shows the commercial value of the collaboration for each participating actor. We then present guidelines for transforming the value network into process models, which show the feasibility of implementing the value network in the business processes of the actors. Our approach has been developed in different consultancy projects. We illustrate our approach with a consultancy project performed at a company that we will call the Amsterdam Times.
{"title":"Value-based design of collaboration processes for e-commerce","authors":"P. V. Eck, J. Gordijn, R. Wieringa","doi":"10.1109/EEE.2004.1287333","DOIUrl":"https://doi.org/10.1109/EEE.2004.1287333","url":null,"abstract":"Designing cross-organizational e-business applications faces the problem that the collaborating businesses must align their commercial interests without any central decision making authority. The design process must therefore yield a clear view of the commercial value of the collaboration for each economic actor, as well as a clear specification of the activities to be performed by each actor and a specification of information systems to be used by each actor. We present guidelines for designing the value network of the collaboration, which shows the commercial value of the collaboration for each participating actor. We then present guidelines for transforming the value network into process models, which show the feasibility of implementing the value network in the business processes of the actors. Our approach has been developed in different consultancy projects. We illustrate our approach with a consultancy project performed at a company that we will call the Amsterdam Times.","PeriodicalId":360167,"journal":{"name":"IEEE International Conference on e-Technology, e-Commerce and e-Service, 2004. EEE '04. 2004","volume":"23 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2004-02-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"132043699","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 : 2001-08-01DOI: 10.1109/EEE.2004.1287367
Tzer-Shyong Chen, Kuo-Hsuan Huang, Yu-Fang Chung
Although the improved cryptographic key assignment scheme by Wen et al. resolved the inaccuracy and security leak in the CHW scheme, another kind of security leak was neglected, for which a solution is proposed herein.
{"title":"Modified cryptographic key assignment scheme for overcoming the incorrectness of the CHW scheme","authors":"Tzer-Shyong Chen, Kuo-Hsuan Huang, Yu-Fang Chung","doi":"10.1109/EEE.2004.1287367","DOIUrl":"https://doi.org/10.1109/EEE.2004.1287367","url":null,"abstract":"Although the improved cryptographic key assignment scheme by Wen et al. resolved the inaccuracy and security leak in the CHW scheme, another kind of security leak was neglected, for which a solution is proposed herein.","PeriodicalId":360167,"journal":{"name":"IEEE International Conference on e-Technology, e-Commerce and e-Service, 2004. EEE '04. 2004","volume":"19 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2001-08-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"132333561","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 : 1900-01-01DOI: 10.1109/EEE.2004.1287301
O. Etzion, A. Fisher, S. Wasserkrug
E-commerce companies understand that customers are their most important asset and that it is imperative to estimate the potential value of this asset. Hence, a model for calculating customer's value is essential in these domains. We describe a general modeling approach, based on Markov chain models, for calculating customer value in the e-commerce domain. This model extends existing models from the field of direct marketing, by taking into account a new set of variables required for evaluating customers value in an e-commerce environment. In addition, we present an algorithm for generating this model from historical data, as well as an application of this modeling approach for the creation of a model for online auctions. We also describe a case study that demonstrates how our model provides more accurate predictions than existing models regarding the future income generated by customers.
{"title":"e-CLV: a modelling approach for customer lifetime evaluation in e-commerce domains, with an application and case study for online auctions","authors":"O. Etzion, A. Fisher, S. Wasserkrug","doi":"10.1109/EEE.2004.1287301","DOIUrl":"https://doi.org/10.1109/EEE.2004.1287301","url":null,"abstract":"E-commerce companies understand that customers are their most important asset and that it is imperative to estimate the potential value of this asset. Hence, a model for calculating customer's value is essential in these domains. We describe a general modeling approach, based on Markov chain models, for calculating customer value in the e-commerce domain. This model extends existing models from the field of direct marketing, by taking into account a new set of variables required for evaluating customers value in an e-commerce environment. In addition, we present an algorithm for generating this model from historical data, as well as an application of this modeling approach for the creation of a model for online auctions. We also describe a case study that demonstrates how our model provides more accurate predictions than existing models regarding the future income generated by customers.","PeriodicalId":360167,"journal":{"name":"IEEE International Conference on e-Technology, e-Commerce and e-Service, 2004. EEE '04. 2004","volume":"4 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1900-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"121131514","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
扫码关注我们
求助内容：
应助结果提醒方式：