Pub Date : 2004-03-28DOI: 10.1109/EEE.2004.1287329
Libo Chen, M. L'Abbate, U. Thiel, E. Neuhold
In e-commerce it is often crucial to provide customers a large choice of relevant offers. As short and incomplete queries prevail, appropriate expansion methods are desirable. This work describes a method for the automatic construction of a thesaurus based on existing categories of documents. A clustering algorithm, the "Layer-Seeds method", is introduced, which facilitates the automatic generation of thesaurus reflecting the specific vocabulary occurring in a given collection of documents. The clustering works on terms extracted from the documents in a certain category and organizes them in a tree-like hierarchical structure - a thesaurus. The thesaurus is then employed for automatic query expansion in an e-commerce application in order to obtain better results for product searching. Experiments yield evidence that a significant increase of user satisfaction is achieved.
{"title":"Increasing the customer's choice: query expansion based on the layer-seeds method and its application in e-commerce","authors":"Libo Chen, M. L'Abbate, U. Thiel, E. Neuhold","doi":"10.1109/EEE.2004.1287329","DOIUrl":"https://doi.org/10.1109/EEE.2004.1287329","url":null,"abstract":"In e-commerce it is often crucial to provide customers a large choice of relevant offers. As short and incomplete queries prevail, appropriate expansion methods are desirable. This work describes a method for the automatic construction of a thesaurus based on existing categories of documents. A clustering algorithm, the \"Layer-Seeds method\", is introduced, which facilitates the automatic generation of thesaurus reflecting the specific vocabulary occurring in a given collection of documents. The clustering works on terms extracted from the documents in a certain category and organizes them in a tree-like hierarchical structure - a thesaurus. The thesaurus is then employed for automatic query expansion in an e-commerce application in order to obtain better results for product searching. Experiments yield evidence that a significant increase of user satisfaction is achieved.","PeriodicalId":360167,"journal":{"name":"IEEE International Conference on e-Technology, e-Commerce and e-Service, 2004. EEE '04. 2004","volume":"49 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":"121931176","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.1287347
Liquan Chen
Recently, IEEE 802.11 wireless LAN (WLAN) technology was rapidly developed and the high-speed wireless access was stepping into our lives. In public areas, the architecture of public wireless LAN (public WLAN) is proposed to solve the emerging management problems such as authentication, accounting and authorization, etc. [J.A. Laurila et al., (2001)]. But there is no previous good solution mentions the management for use of network operators' equipments. We specify how to use MAC isolation to enhance the public WLAN effective management. For IEEE 802.11 compliance, we propose a scheme to implement the MAC isolation by re-design the state machine of distribution/spl I.bar/service component in WLAN access point. Finally, a WLAN access point solution based on MPC860 embedded processor hardware and embedded Linux software is specified, and the simulation of MAC isolation in public WLAN is also presented. The result shows that the scheme by re-design the state machine of distribution/spl I.bar/service component in IEEE 802.11 access point to realize MAC isolation is effective and realizable.
近年来，IEEE 802.11无线局域网(WLAN)技术得到了迅速发展，高速无线接入正在走进我们的生活。在公共领域，为了解决新出现的认证、计费、授权等管理问题，提出了公共无线局域网(public WLAN)架构Laurila et al.，(2001)。但对于网络运营商设备的使用管理，目前尚无较好的解决方案。详细介绍了如何利用MAC隔离来增强公共WLAN的有效管理。为了符合IEEE 802.11标准，我们提出了一种通过重新设计WLAN接入点的分布/spl .bar/业务组件状态机来实现MAC隔离的方案。最后，提出了一种基于MPC860嵌入式处理器硬件和嵌入式Linux软件的无线局域网接入点方案，并对公共无线局域网的MAC隔离进行了仿真。结果表明，通过在IEEE 802.11接入点中重新设计分布/spl .bar/业务组件的状态机来实现MAC隔离的方案是有效的、可实现的。
{"title":"A scheme for MAC isolation to realize effective management in public wireless LAN","authors":"Liquan Chen","doi":"10.1109/EEE.2004.1287347","DOIUrl":"https://doi.org/10.1109/EEE.2004.1287347","url":null,"abstract":"Recently, IEEE 802.11 wireless LAN (WLAN) technology was rapidly developed and the high-speed wireless access was stepping into our lives. In public areas, the architecture of public wireless LAN (public WLAN) is proposed to solve the emerging management problems such as authentication, accounting and authorization, etc. [J.A. Laurila et al., (2001)]. But there is no previous good solution mentions the management for use of network operators' equipments. We specify how to use MAC isolation to enhance the public WLAN effective management. For IEEE 802.11 compliance, we propose a scheme to implement the MAC isolation by re-design the state machine of distribution/spl I.bar/service component in WLAN access point. Finally, a WLAN access point solution based on MPC860 embedded processor hardware and embedded Linux software is specified, and the simulation of MAC isolation in public WLAN is also presented. The result shows that the scheme by re-design the state machine of distribution/spl I.bar/service component in IEEE 802.11 access point to realize MAC isolation is effective and realizable.","PeriodicalId":360167,"journal":{"name":"IEEE International Conference on e-Technology, e-Commerce and e-Service, 2004. EEE '04. 2004","volume":"27 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":"115162331","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.1287355
W. K. Cheung
E-transformation technologies, for the past few years, have been evolving towards the goal of information integration and system interoperability. While there is no doubt that interoperable systems can enable many value-added functions and provide new business opportunities, whether the current development trend can really lead to some real impacts on people's daily lives is still a commonly asked question. In this paper, we first describe a value chain of e-transformation that starts from the availability of data from heterogeneous sources and stops at the ultimate goal of autonomous and context-aware computational services provision. Two prototypes, namely e-Bus Planner and e-Food Marketplace are described for demonstrating the promises that can be provided by information integration. We then argue that the value adding process should further be advanced along the chain by analyzing Web-based social networks. The ultimate objective is to benefit the end-users more directly and immediately.
{"title":"e-Transformation technologies: case studies and the road ahead - a value chain perspective","authors":"W. K. Cheung","doi":"10.1109/EEE.2004.1287355","DOIUrl":"https://doi.org/10.1109/EEE.2004.1287355","url":null,"abstract":"E-transformation technologies, for the past few years, have been evolving towards the goal of information integration and system interoperability. While there is no doubt that interoperable systems can enable many value-added functions and provide new business opportunities, whether the current development trend can really lead to some real impacts on people's daily lives is still a commonly asked question. In this paper, we first describe a value chain of e-transformation that starts from the availability of data from heterogeneous sources and stops at the ultimate goal of autonomous and context-aware computational services provision. Two prototypes, namely e-Bus Planner and e-Food Marketplace are described for demonstrating the promises that can be provided by information integration. We then argue that the value adding process should further be advanced along the chain by analyzing Web-based social networks. The ultimate objective is to benefit the end-users more directly and immediately.","PeriodicalId":360167,"journal":{"name":"IEEE International Conference on e-Technology, e-Commerce and e-Service, 2004. EEE '04. 2004","volume":"12 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":"125460915","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.1287320
Wei-Po Lee, Ming-Hsiang Su
The increasing Internet contents cause the problem of information overload. We present a generic framework and discuss the main issues in personalizing Internet information services to solve this problem.
{"title":"Personalizing information services on wired and wireless networks","authors":"Wei-Po Lee, Ming-Hsiang Su","doi":"10.1109/EEE.2004.1287320","DOIUrl":"https://doi.org/10.1109/EEE.2004.1287320","url":null,"abstract":"The increasing Internet contents cause the problem of information overload. We present a generic framework and discuss the main issues in personalizing Internet information services to solve this problem.","PeriodicalId":360167,"journal":{"name":"IEEE International Conference on e-Technology, e-Commerce and e-Service, 2004. EEE '04. 2004","volume":"7 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":"125587793","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.1287340
S. Weng, Meiran Liu
The purpose is to analyze customers' purchasing behaviors based on product features from transaction records and product feature databases. Customers' preferences toward particular features of products are analyzed and then rules of customer interest profiles are thus derived in order to recommend customer products that have potential attraction with customers. The approach of this paper has its strength to be able to recommend to customers brand new products or rarely purchased products as long as they fit customer interest profiles. This research also derives customers' interest profiles that can explain recommendation results. The interests on particular features of products can be referenced for product development.
{"title":"Personalized product recommendation in e-commerce","authors":"S. Weng, Meiran Liu","doi":"10.1109/EEE.2004.1287340","DOIUrl":"https://doi.org/10.1109/EEE.2004.1287340","url":null,"abstract":"The purpose is to analyze customers' purchasing behaviors based on product features from transaction records and product feature databases. Customers' preferences toward particular features of products are analyzed and then rules of customer interest profiles are thus derived in order to recommend customer products that have potential attraction with customers. The approach of this paper has its strength to be able to recommend to customers brand new products or rarely purchased products as long as they fit customer interest profiles. This research also derives customers' interest profiles that can explain recommendation results. The interests on particular features of products can be referenced for product development.","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":"128373367","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.1287351
Nan Guo, Tianhan Gao, Hong Zhao
As network is developing to distribution and heterogeneity, legacy network management systems do not work efficiently on operator-intensive distribution of management tasks. A distributed plug-and-play network management model is presented to implement an automatic and self-adapting network management system. In this model, network components can automatically locate the proper management stations, which are configured in specified function, as added to network and get initial management tasks without human intervention. We adopt mobile agent infrastructure to communicate and fulfill management tasks, thus improve the flexibility and autonomy. Moreover, it makes extension and update of management tasks at run-time, thus increases self-adapting capability of the model.
{"title":"Distributed plug-and-play network management model based on mobile agents","authors":"Nan Guo, Tianhan Gao, Hong Zhao","doi":"10.1109/EEE.2004.1287351","DOIUrl":"https://doi.org/10.1109/EEE.2004.1287351","url":null,"abstract":"As network is developing to distribution and heterogeneity, legacy network management systems do not work efficiently on operator-intensive distribution of management tasks. A distributed plug-and-play network management model is presented to implement an automatic and self-adapting network management system. In this model, network components can automatically locate the proper management stations, which are configured in specified function, as added to network and get initial management tasks without human intervention. We adopt mobile agent infrastructure to communicate and fulfill management tasks, thus improve the flexibility and autonomy. Moreover, it makes extension and update of management tasks at run-time, thus increases self-adapting capability of the model.","PeriodicalId":360167,"journal":{"name":"IEEE International Conference on e-Technology, e-Commerce and e-Service, 2004. EEE '04. 2004","volume":"34 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":"133327675","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.1287309
Deepak Subramoniam, J. John
We deal with the problem of finding the subject that a given set of pages deals with. The algorithms presented have been designed with a view to provide good results when pages that belong to community (or handle some common topic) are presented to them. When a set of pages are presented, the algorithms return a set of words ordered in the decreasing order of relevance. The words among the first few can be used to identify the topic that the set deals with. The algorithms have been tested by providing them with pages returned from a search engine for a given search query and their performance is assessed based on how high the words used in the search query are placed in the list returned by the algorithm.
{"title":"Algorithms for community subject-identification: experiments and test results","authors":"Deepak Subramoniam, J. John","doi":"10.1109/EEE.2004.1287309","DOIUrl":"https://doi.org/10.1109/EEE.2004.1287309","url":null,"abstract":"We deal with the problem of finding the subject that a given set of pages deals with. The algorithms presented have been designed with a view to provide good results when pages that belong to community (or handle some common topic) are presented to them. When a set of pages are presented, the algorithms return a set of words ordered in the decreasing order of relevance. The words among the first few can be used to identify the topic that the set deals with. The algorithms have been tested by providing them with pages returned from a search engine for a given search query and their performance is assessed based on how high the words used in the search query are placed in the list returned by the algorithm.","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":"131143318","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.1287295
Tzer-Shyong Chen, Kuo-Hsuan Huang, Yu-Fang Chung
We present a new (t, n) threshold-authenticated encryption scheme with message linkage to reduce the load on the signer using a division-of-labor signature. Only t signers can examine and sign an over-large message on behalf of the whole group, by dividing the whole message into a few readable submessage blocks; then, each signer needs only to examine and sign the designated submessage block rather than the whole message. Consequently, the load on the signer should be substantially reduced to improve the performance. Moreover, the proposed scheme is based on the elliptic curve cryptosystem, because of its highly efficient performance and comprehensiveness of security, supporting the practical use of the scheme.
{"title":"A division-of-labor-signature (t, n) threshold-authenticated encryption scheme with message linkage based on the elliptic curve cryptosystem","authors":"Tzer-Shyong Chen, Kuo-Hsuan Huang, Yu-Fang Chung","doi":"10.1109/EEE.2004.1287295","DOIUrl":"https://doi.org/10.1109/EEE.2004.1287295","url":null,"abstract":"We present a new (t, n) threshold-authenticated encryption scheme with message linkage to reduce the load on the signer using a division-of-labor signature. Only t signers can examine and sign an over-large message on behalf of the whole group, by dividing the whole message into a few readable submessage blocks; then, each signer needs only to examine and sign the designated submessage block rather than the whole message. Consequently, the load on the signer should be substantially reduced to improve the performance. Moreover, the proposed scheme is based on the elliptic curve cryptosystem, because of its highly efficient performance and comprehensiveness of security, supporting the practical use of the scheme.","PeriodicalId":360167,"journal":{"name":"IEEE International Conference on e-Technology, e-Commerce and e-Service, 2004. EEE '04. 2004","volume":"110 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":"132303871","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.1287354
J. Lai, B. Soh
The tremendous growth in the amount of information available and the number of visitors to Web sites in the recent years poses some key challenges for information filtering and retrieval. Web visitors not only expect high quality and relevant information, but also wish that the information be presented in an as efficient way as possible. The traditional filtering methods, however, only consider the relevant values of document. These conventional methods fail to consider the efficiency of documents retrieval. In this paper, we propose a new algorithm to calculate an index called document similarity score based on elements of the document. Using the index, document profile will be derived. Any documents with the similarity score above a given threshold are clustered. Using these pre-clustered documents, information filtering and retrieval can be made more efficient.
{"title":"Using element and document profile for information clustering","authors":"J. Lai, B. Soh","doi":"10.1109/EEE.2004.1287354","DOIUrl":"https://doi.org/10.1109/EEE.2004.1287354","url":null,"abstract":"The tremendous growth in the amount of information available and the number of visitors to Web sites in the recent years poses some key challenges for information filtering and retrieval. Web visitors not only expect high quality and relevant information, but also wish that the information be presented in an as efficient way as possible. The traditional filtering methods, however, only consider the relevant values of document. These conventional methods fail to consider the efficiency of documents retrieval. In this paper, we propose a new algorithm to calculate an index called document similarity score based on elements of the document. Using the index, document profile will be derived. Any documents with the similarity score above a given threshold are clustered. Using these pre-clustered documents, information filtering and retrieval can be made more efficient.","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":"114956392","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.1287362
Yuan-Liang Tang, Ching-Ting Chen
In this paper, a novel watermarking technique for image authentication is proposed. This technique operates in the wavelet domain and makes use of semifragile watermarks for achieving better robustness. The image is first transformed into the wavelet domain and the relations between neighboring coefficients are utilized to authenticate the integrity of the image content. By carefully designing the processes of feature extraction and watermark embedding, the proposed method is able to identify malicious changes made on the image, while very insensitive to common image processing. In addition, the system is secure because not only the watermark is protected by a private key but also building relations between coefficients significantly discourages an adversary from performing the collage attack.
{"title":"Image authentication using relation measures of wavelet coefficients","authors":"Yuan-Liang Tang, Ching-Ting Chen","doi":"10.1109/EEE.2004.1287362","DOIUrl":"https://doi.org/10.1109/EEE.2004.1287362","url":null,"abstract":"In this paper, a novel watermarking technique for image authentication is proposed. This technique operates in the wavelet domain and makes use of semifragile watermarks for achieving better robustness. The image is first transformed into the wavelet domain and the relations between neighboring coefficients are utilized to authenticate the integrity of the image content. By carefully designing the processes of feature extraction and watermark embedding, the proposed method is able to identify malicious changes made on the image, while very insensitive to common image processing. In addition, the system is secure because not only the watermark is protected by a private key but also building relations between coefficients significantly discourages an adversary from performing the collage attack.","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":"125228125","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
扫码关注我们
求助内容：
应助结果提醒方式：