Proceedings Fourth IEEE International Workshop on Advanced Issues of E-Commerce and Web-Based Information Systems (WECWIS 2002)最新文献_第2页

Key management and access control for large dynamic multicast group 大型动态组播组密钥管理与访问控制

Proceedings Fourth IEEE International Workshop on Advanced Issues of E-Commerce and Web-Based Information Systems (WECWIS 2002) Pub Date : 2002-06-26 DOI: 10.1109/WECWIS.2002.1021249

Jing Liu, Mingtian Zhou

引用次数: 6

Separating business process from user interaction utilizing process-aware XSLT stylesheets 利用感知过程的XSLT样式表将业务流程与用户交互分离

Proceedings Fourth IEEE International Workshop on Advanced Issues of E-Commerce and Web-Based Information Systems (WECWIS 2002) Pub Date : 2002-06-26 DOI: 10.1109/WECWIS.2002.1021243

K. Aberer, Anwitaman Datta, Z. Despotovic

引用次数: 1

WebMon: A performance profiler for web transactions WebMon:一个用于web事务的性能分析器

Proceedings Fourth IEEE International Workshop on Advanced Issues of E-Commerce and Web-Based Information Systems (WECWIS 2002) Pub Date : 2002-06-26 DOI: 10.1109/WECWIS.2002.1021256

T. Gschwind, K. Eshghi, P. Garg, K. Wurster

引用次数: 35

Clustering Web Accelerators 集群Web加速器

Proceedings Fourth IEEE International Workshop on Advanced Issues of E-Commerce and Web-Based Information Systems (WECWIS 2002) Pub Date : 2002-06-26 DOI: 10.1109/WECWIS.2002.1021255

J. J. Feenan, Patrick Fry, Ming Lei

引用次数: 3

Dynamic refinement of table summarization for M-commerce 移动商务中表格汇总的动态细化

Proceedings Fourth IEEE International Workshop on Advanced Issues of E-Commerce and Web-Based Information Systems (WECWIS 2002) Pub Date : 2002-06-26 DOI: 10.1109/WECWIS.2002.1021257

Kun-Lung Wu, Shyh-Kwei Chen, Philip S. Yu

{"title":"Dynamic refinement of table summarization for M-commerce","authors":"Kun-Lung Wu, Shyh-Kwei Chen, Philip S. Yu","doi":"10.1109/WECWIS.2002.1021257","DOIUrl":"https://doi.org/10.1109/WECWIS.2002.1021257","url":null,"abstract":"Table summarization is important in mobile commerce as many diverse small devices, such as smart phones and personal digital assistants, are being equipped with applications that can access corporate databases. It is difficult to effectively present a large table of information on small devices as they tend to have limited display and processing capabilities. Hence, large tables need to be reduced and summarized in order to be properly displayed on small devices. Due to updates in the databases, device capabilities and personal preferences, a summarized table based on a previously defined specification may not be satisfactory anymore and requires further refinements. In this paper we present a flexible and lightweight implementation of dynamic refinement of table summarization. With a GUI tool or a browser the user of a small device in M-commerce can dynamically and interactively refine a summarized table until he/she is satisfied. Not only the summarized table output but also the corresponding specification are refined. Individual refined specifications are flexibly and efficiently maintained for subsequent table summarization.","PeriodicalId":287894,"journal":{"name":"Proceedings Fourth IEEE International Workshop on Advanced Issues of E-Commerce and Web-Based Information Systems (WECWIS 2002)","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2002-06-26","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"128518562","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}

引用次数: 5

QoS management in Web-based real-time data services 基于web的实时数据服务中的QoS管理

Proceedings Fourth IEEE International Workshop on Advanced Issues of E-Commerce and Web-Based Information Systems (WECWIS 2002) Pub Date : 2002-06-26 DOI: 10.1109/WECWIS.2002.1021250

S. Son, K. Kang

引用次数: 19

Web services and XML good news: the difficult issues are still open Web服务和XML的好消息:棘手的问题仍然没有解决

Proceedings Fourth IEEE International Workshop on Advanced Issues of E-Commerce and Web-Based Information Systems (WECWIS 2002) Pub Date : 2002-06-26 DOI: 10.1109/WECWIS.2002.10000

M. Devin

引用次数: 0

Automatic generation and integration of RosettaNet based on generic templates and components 基于通用模板和组件的RosettaNet自动生成和集成

Proceedings Fourth IEEE International Workshop on Advanced Issues of E-Commerce and Web-Based Information Systems (WECWIS 2002) Pub Date : 2002-06-26 DOI: 10.1109/WECWIS.2002.1021239

Simon S. Y. Shim, Zhao-shu Zeng, J. Gao

引用次数: 4

Converting business documents:a classification of problems and solutions using XML/XSLT 转换业务文档:使用XML/XSLT的问题和解决方案的分类

Proceedings Fourth IEEE International Workshop on Advanced Issues of E-Commerce and Web-Based Information Systems (WECWIS 2002) Pub Date : 2002-06-26 DOI: 10.1109/WECWIS.2002.1021242

Erik Wüstner, Thorsten Hotzel, Peter Buxmann

引用次数: 34

On the sensitivity of incremental algorithms for combinatorial auctions 组合拍卖中增量算法的敏感性研究

Proceedings Fourth IEEE International Workshop on Advanced Issues of E-Commerce and Web-Based Information Systems (WECWIS 2002) Pub Date : 2002-06-26 DOI: 10.1109/WECWIS.2002.1021244

R. Kastner, Christina Hsieh, M. Potkonjak, M. Sarrafzadeh

{"title":"On the sensitivity of incremental algorithms for combinatorial auctions","authors":"R. Kastner, Christina Hsieh, M. Potkonjak, M. Sarrafzadeh","doi":"10.1109/WECWIS.2002.1021244","DOIUrl":"https://doi.org/10.1109/WECWIS.2002.1021244","url":null,"abstract":"Despite the large amounts of runtime needed to adequately solve a combinatorial auction (CA), existing iterative CA auction protocols require winner determination during every round of bid submissions. Using existing algorithms for winner determination will cause a timing bottleneck during the winner determination phase. Furthermore, there has recently been work which models the formation of supply chains through auctions. Here, winner determination is used for supply chain formation. As supply chains become more dynamic, there is a need for incremental algorithms that quickly and accurately restructure the supply chain while keeping the initial supplier/producer/consumer constraints satisfied. In this work, we look into the process of quickly and efficiently handling incremental changes in combinatorial auctions. Given some perturbations, we illustrate the tradeoff between preserving the previous solution while maximizing the valuation of the auction. Our results show that it is possible to use a locally optimal solution while sacrificing little solution quality compared to a globally optimal solution. When we have 5000 bids or more, the local algorithm gives a solution within 2% of optimal on the \"matching\" benchmark from the Combinatorial Auction Test Suite (CATS). Therefore, a simple, fast algorithm can be used to handle incremental changes in CAs with a large number of bids.","PeriodicalId":287894,"journal":{"name":"Proceedings Fourth IEEE International Workshop on Advanced Issues of E-Commerce and Web-Based Information Systems (WECWIS 2002)","volume":"97 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2002-06-26","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"120843345","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}

引用次数: 26