Lisa Bradshaw, Annie Persson, Keith Regensburger Prototype
Navigation is an important aspect in web-site design to make information on web sites easy to find. Different navigation styles have been designed and employed on real-life web pages, most of the styles having good rationales as regards intuitiveness and ease of use. A study based on lay computer users investigates the theory that certain placement/ presentation styles for menus are more preferred than others and the expectation that left bars are easiest to use. Though the study confirms the former, the latter is not found true but a different, the Tabbed, navigation style is the winner.
{"title":"Web Interface Navigation Design: Which Style of Navigation-Link Menus Do Users Prefer?","authors":"Lisa Bradshaw, Annie Persson, Keith Regensburger Prototype","doi":"10.1109/ICDEW.2006.163","DOIUrl":"https://doi.org/10.1109/ICDEW.2006.163","url":null,"abstract":"Navigation is an important aspect in web-site design to make information on web sites easy to find. Different navigation styles have been designed and employed on real-life web pages, most of the styles having good rationales as regards intuitiveness and ease of use. A study based on lay computer users investigates the theory that certain placement/ presentation styles for menus are more preferred than others and the expectation that left bars are easiest to use. Though the study confirms the former, the latter is not found true but a different, the Tabbed, navigation style is the winner.","PeriodicalId":331953,"journal":{"name":"22nd International Conference on Data Engineering Workshops (ICDEW'06)","volume":null,"pages":null},"PeriodicalIF":0.0,"publicationDate":"2006-04-03","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"113950946","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}
D. Bianchini, V. D. Antonellis, M. Melchiori, Denise Salvi
Automated techniques and tools are required to effectively locate services that fulfil a given user request. To this purpose, the use of semantic descriptions of services has been widely motivated and recommended for automated service discovery under highly dynamic and contextdependent requirements in distributed environments. Our aim in this work is to propose a semantic-enriched framework to describe services and an ontology-based hybrid approach where such framework is exploited combining together different kinds of comparison strategies to provide a flexible and efficient matchmaking between service descriptions. For service discovery two matchmaking strategies are proposed: a deductive strategy based on Description Logics, with a reasoning procedure exploiting ontology knowledge to assess the type of match between services; a similarity-based strategy, exploiting retrieval metrics to measure the degree of match between services.
{"title":"Semantic-Enriched Service Discovery","authors":"D. Bianchini, V. D. Antonellis, M. Melchiori, Denise Salvi","doi":"10.1109/ICDEW.2006.134","DOIUrl":"https://doi.org/10.1109/ICDEW.2006.134","url":null,"abstract":"Automated techniques and tools are required to effectively locate services that fulfil a given user request. To this purpose, the use of semantic descriptions of services has been widely motivated and recommended for automated service discovery under highly dynamic and contextdependent requirements in distributed environments. Our aim in this work is to propose a semantic-enriched framework to describe services and an ontology-based hybrid approach where such framework is exploited combining together different kinds of comparison strategies to provide a flexible and efficient matchmaking between service descriptions. For service discovery two matchmaking strategies are proposed: a deductive strategy based on Description Logics, with a reasoning procedure exploiting ontology knowledge to assess the type of match between services; a similarity-based strategy, exploiting retrieval metrics to measure the degree of match between services.","PeriodicalId":331953,"journal":{"name":"22nd International Conference on Data Engineering Workshops (ICDEW'06)","volume":null,"pages":null},"PeriodicalIF":0.0,"publicationDate":"2006-04-03","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"125881775","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}
During the development of our object deputy database system, called TOTEM, we find that OID exhaustion becomes a serious problem, which may also exist in other databases. To our knowledge, most current database systems don’t reuse OIDs in the fear of destroying referential consistency, which, however, can get well resolved in our OID Reuse Mechanism with the help of bilateral pointers. This paper firstly introduces the basic concepts of OID, states the necessity and importance of OID Reuse, and then introduces the implementation of OID Reuse Mechanism in TOTEM. At last, its performance evaluation is presented.
{"title":"Object Identifier Reuse Mechanism for TOTEM","authors":"Yuan Shi, Boxuan Zhai, Xiaoping Zhou, Zhiyong Peng","doi":"10.1109/ICDEW.2006.101","DOIUrl":"https://doi.org/10.1109/ICDEW.2006.101","url":null,"abstract":"During the development of our object deputy database system, called TOTEM, we find that OID exhaustion becomes a serious problem, which may also exist in other databases. To our knowledge, most current database systems don’t reuse OIDs in the fear of destroying referential consistency, which, however, can get well resolved in our OID Reuse Mechanism with the help of bilateral pointers. This paper firstly introduces the basic concepts of OID, states the necessity and importance of OID Reuse, and then introduces the implementation of OID Reuse Mechanism in TOTEM. At last, its performance evaluation is presented.","PeriodicalId":331953,"journal":{"name":"22nd International Conference on Data Engineering Workshops (ICDEW'06)","volume":null,"pages":null},"PeriodicalIF":0.0,"publicationDate":"2006-04-03","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"129512176","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}
Sang-Hyuk Lim, Kyong-I Ku, Kichang Kim, Yoo-Sung Kim
Even though the ideal split policy for M-tree should determine which two routing objects are promoted so that the two partitioned regions would have minimum volume and minimum overlapped space, the previously proposed split algorithms must fail to achieve the goal since they select the actual entries from overflow entries as the routing objects to be promoted. Hence, in this paper, we propose an optimal node split algorithm for M-tree which uses the virtual center points of two partitioned regions as the routing objects and which results in tighter volume and finally reduce the overlap index spaces between nodes. Also, we show that the proposed algorithm outperforms the previous ones for similarity-based query processing with respect to the average response time, although there is a slight increase in insertion time. We also discuss the implementation of a prototype of contentbased music retrieval system in which the proposed scheme is used for multidimensional indexing.
{"title":"A Node Split Algorithm Reducing Overlapped Index Spaces in M-tree Index","authors":"Sang-Hyuk Lim, Kyong-I Ku, Kichang Kim, Yoo-Sung Kim","doi":"10.1109/ICDEW.2006.14","DOIUrl":"https://doi.org/10.1109/ICDEW.2006.14","url":null,"abstract":"Even though the ideal split policy for M-tree should determine which two routing objects are promoted so that the two partitioned regions would have minimum volume and minimum overlapped space, the previously proposed split algorithms must fail to achieve the goal since they select the actual entries from overflow entries as the routing objects to be promoted. Hence, in this paper, we propose an optimal node split algorithm for M-tree which uses the virtual center points of two partitioned regions as the routing objects and which results in tighter volume and finally reduce the overlap index spaces between nodes. Also, we show that the proposed algorithm outperforms the previous ones for similarity-based query processing with respect to the average response time, although there is a slight increase in insertion time. We also discuss the implementation of a prototype of contentbased music retrieval system in which the proposed scheme is used for multidimensional indexing.","PeriodicalId":331953,"journal":{"name":"22nd International Conference on Data Engineering Workshops (ICDEW'06)","volume":null,"pages":null},"PeriodicalIF":0.0,"publicationDate":"2006-04-03","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"116119613","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}
William Y. Arms, Selcuk Aya, Manuel Calimlim, Jim Cordes, J. Deneva, Pavel A. Dmitriev, J. Gehrke, L. Gibbons, C. D. Jones, V. Kuznetsov, D. Lifka, Mirek Riedewald, D. Riley, A. Ryd, G. Sharp
We survey three examples of large-scale scientific workflows that we are working with at Cornell: the Arecibo sky survey, the CLEO high-energy particle physics experiment, and the Web Lab project for enabling social science studies of the Internet. All three projects face the same general challenges: massive amounts of raw data, expensive processing steps, and the requirement to make raw data or data products available to users nation- or world-wide. However, there are several differences that prevent a one-sizefits- all approach to handling their data flows. Instead, current implementations are heavily tuned by domain and data management experts. We describe the three projects, and we outline research issues and opportunities to integrate Grid technology into these workflows.
{"title":"Three Case Studies of Large-Scale Data Flows","authors":"William Y. Arms, Selcuk Aya, Manuel Calimlim, Jim Cordes, J. Deneva, Pavel A. Dmitriev, J. Gehrke, L. Gibbons, C. D. Jones, V. Kuznetsov, D. Lifka, Mirek Riedewald, D. Riley, A. Ryd, G. Sharp","doi":"10.1109/ICDEW.2006.148","DOIUrl":"https://doi.org/10.1109/ICDEW.2006.148","url":null,"abstract":"We survey three examples of large-scale scientific workflows that we are working with at Cornell: the Arecibo sky survey, the CLEO high-energy particle physics experiment, and the Web Lab project for enabling social science studies of the Internet. All three projects face the same general challenges: massive amounts of raw data, expensive processing steps, and the requirement to make raw data or data products available to users nation- or world-wide. However, there are several differences that prevent a one-sizefits- all approach to handling their data flows. Instead, current implementations are heavily tuned by domain and data management experts. We describe the three projects, and we outline research issues and opportunities to integrate Grid technology into these workflows.","PeriodicalId":331953,"journal":{"name":"22nd International Conference on Data Engineering Workshops (ICDEW'06)","volume":null,"pages":null},"PeriodicalIF":0.0,"publicationDate":"2006-04-03","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"125648869","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}
Web usage mining exploits data mining techniques to discover valuable information from navigation behavior of World Wide Web (WWW) users. The required information is captured by web servers and stored in web usage data logs. The first phase of web usage mining is the data processing phase. In the data processing phase, first, relevant information is filtered from the logs. After that, sessions are reconstructed by using heuristics that select and group requests belonging to the same user session. If we are processing requests after they are handled by the web server, this technique is called "reactive" while in "proactive" techniques the same (pre)processing occurs during the interactive browsing of the web site by the user. Reactive session reconstruction uses "time" and "navigation" oriented heuristics. We propose to combine these heuristics with "site topology" information in order to increase the accuracy of the reconstructed sessions. In this work, we have implemented an agent simulator, which models behavior of web users and generates web user navigation as well as the log data kept by the web server. By this way we know the actual user sessions and we can accurately evaluate and compare the performances of alternative session reconstruction heuristics (which will use only the web server log data). To the best of our knowledge, this paper is the first work that uses such an agent simulator, and therefore, is able to accurately evaluate different session reconstruction heuristics. By using the agent simulator, we attempt to show that our new heuristic discovers more accurate sessions than previous heuristics.
{"title":"A New Approach for Reactive Web Usage Data Processing","authors":"Murat Ali Bayir, I. H. Toroslu, A. Cosar","doi":"10.1109/ICDEW.2006.13","DOIUrl":"https://doi.org/10.1109/ICDEW.2006.13","url":null,"abstract":"Web usage mining exploits data mining techniques to discover valuable information from navigation behavior of World Wide Web (WWW) users. The required information is captured by web servers and stored in web usage data logs. The first phase of web usage mining is the data processing phase. In the data processing phase, first, relevant information is filtered from the logs. After that, sessions are reconstructed by using heuristics that select and group requests belonging to the same user session. If we are processing requests after they are handled by the web server, this technique is called \"reactive\" while in \"proactive\" techniques the same (pre)processing occurs during the interactive browsing of the web site by the user. Reactive session reconstruction uses \"time\" and \"navigation\" oriented heuristics. We propose to combine these heuristics with \"site topology\" information in order to increase the accuracy of the reconstructed sessions. In this work, we have implemented an agent simulator, which models behavior of web users and generates web user navigation as well as the log data kept by the web server. By this way we know the actual user sessions and we can accurately evaluate and compare the performances of alternative session reconstruction heuristics (which will use only the web server log data). To the best of our knowledge, this paper is the first work that uses such an agent simulator, and therefore, is able to accurately evaluate different session reconstruction heuristics. By using the agent simulator, we attempt to show that our new heuristic discovers more accurate sessions than previous heuristics.","PeriodicalId":331953,"journal":{"name":"22nd International Conference on Data Engineering Workshops (ICDEW'06)","volume":null,"pages":null},"PeriodicalIF":0.0,"publicationDate":"2006-04-03","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"127781844","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}
One of the characteristic of Risk is the possible loss that could be incurred in an interaction. In a peer-topeer financial interaction the loss incurred is usually the financial loss to the resources of the trusting peer that are involved in the interaction. Hence a way for the trusting peer to analyse the Risk in interacting with any trusted peer in order to decide wether to interact with it or not, is to determine the possible loss to its resources that are involved in the interaction. In this paper we will propose a methodology by which the trusting peer can determine the possible loss that could be incurred to it in interacting with a trusted peer.
{"title":"Quantifying Risk in Financial Terms According to Context and Time for Decision Making","authors":"O. Hussain, E. Chang, T. Dillon","doi":"10.1109/ICDEW.2006.122","DOIUrl":"https://doi.org/10.1109/ICDEW.2006.122","url":null,"abstract":"One of the characteristic of Risk is the possible loss that could be incurred in an interaction. In a peer-topeer financial interaction the loss incurred is usually the financial loss to the resources of the trusting peer that are involved in the interaction. Hence a way for the trusting peer to analyse the Risk in interacting with any trusted peer in order to decide wether to interact with it or not, is to determine the possible loss to its resources that are involved in the interaction. In this paper we will propose a methodology by which the trusting peer can determine the possible loss that could be incurred to it in interacting with a trusted peer.","PeriodicalId":331953,"journal":{"name":"22nd International Conference on Data Engineering Workshops (ICDEW'06)","volume":null,"pages":null},"PeriodicalIF":0.0,"publicationDate":"2006-04-03","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"131909631","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}
Transactions have moved away from faceto- face encounters to more being on the Internet. The infrastructure for the business and information exchange activities could be client-server, peer-to-peer (P2P), or mobile networks. In this paper we refer to ‘peer’ as an entity involved in a transaction. Trust between two interacting peers involved in an electronic transaction is a major issue that needs to be addressed in order to make the internet a safe medium for carrying out transactions. In this paper, we propose the aspects that can influence the trustworthiness assigned to the trusted peer. Furthermore we catalogue these factors into three classes and discuss the relationship between these factors.
{"title":"Aspects Influencing Trustworthiness In Service Oriented Environments","authors":"F. Hussain, E. Chang, T. Dillon","doi":"10.1109/ICDEW.2006.33","DOIUrl":"https://doi.org/10.1109/ICDEW.2006.33","url":null,"abstract":"Transactions have moved away from faceto- face encounters to more being on the Internet. The infrastructure for the business and information exchange activities could be client-server, peer-to-peer (P2P), or mobile networks. In this paper we refer to ‘peer’ as an entity involved in a transaction. Trust between two interacting peers involved in an electronic transaction is a major issue that needs to be addressed in order to make the internet a safe medium for carrying out transactions. In this paper, we propose the aspects that can influence the trustworthiness assigned to the trusted peer. Furthermore we catalogue these factors into three classes and discuss the relationship between these factors.","PeriodicalId":331953,"journal":{"name":"22nd International Conference on Data Engineering Workshops (ICDEW'06)","volume":null,"pages":null},"PeriodicalIF":0.0,"publicationDate":"2006-04-03","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"131760606","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 method for the automatic maintenance of a directory of Web documents, based on the analysis of the query logs of a search engine. Our method allows automatic maintenance and continuous improvement of Web directories without the need of human editors. The method finds relevant documents to each topic of the Web directory and estimates the relevance of the documents to the topic from user clicks registered in the query log. We also enrich the Web directory by recommending queries to the topics of the directory. We show experiments to illustrate the effectiveness of our approach.
{"title":"Automatic Maintenance ofWeb Directories using Click-Through Data","authors":"A. Cid, Carlos A. Hurtado, Marcelo Mendoza","doi":"10.1109/ICDEW.2006.36","DOIUrl":"https://doi.org/10.1109/ICDEW.2006.36","url":null,"abstract":"In this paper, we propose a method for the automatic maintenance of a directory of Web documents, based on the analysis of the query logs of a search engine. Our method allows automatic maintenance and continuous improvement of Web directories without the need of human editors. The method finds relevant documents to each topic of the Web directory and estimates the relevance of the documents to the topic from user clicks registered in the query log. We also enrich the Web directory by recommending queries to the topics of the directory. We show experiments to illustrate the effectiveness of our approach.","PeriodicalId":331953,"journal":{"name":"22nd International Conference on Data Engineering Workshops (ICDEW'06)","volume":null,"pages":null},"PeriodicalIF":0.0,"publicationDate":"2006-04-03","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"117064988","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}
G. Pallis, K. Stamos, A. Vakali, Dimitrios Katsaros, Antonis Sidiropoulos, Y. Manolopoulos
Users tend to use the Internet for “resource-hungry” applications (which involve content such as video, audio on-demand and distributed data) and at the same time, more and more applications (such as e-commerce, elearning etc.) are relying on the Web. In this framework, Content Distribution Networks (CDNs) are increasingly being used to disseminate data in today's Internet, providing a delicate balance between costs for Web content providers and quality of services for Web customers. The growing interest in CDNs is motivated by a common problem across disciplines: how does one reduce the load on the origin server and the traffic on the Internet, and ultimately improve response time to users? In this direction, crucial data management issues should be addressed. A very important issue is the optimal placement of the outsourced content to CDN’s servers. Taking into account that this problem is NP complete, an heuristic method should be developed. All the approaches developed so far either take as criterion the network’s latency or the workload. This paper develops a novel technique to place the outsourced content to CDN’s servers, integrating both the latency and the load. Through a detailed simulation environment, using both real and synthetic data, we show that the proposed method can improve significantly the response time of requests while keeping the CDNs’ servers’ load at a very low level.
{"title":"Replication Based on Objects Load under a Content Distribution Network","authors":"G. Pallis, K. Stamos, A. Vakali, Dimitrios Katsaros, Antonis Sidiropoulos, Y. Manolopoulos","doi":"10.1109/ICDEW.2006.127","DOIUrl":"https://doi.org/10.1109/ICDEW.2006.127","url":null,"abstract":"Users tend to use the Internet for “resource-hungry” applications (which involve content such as video, audio on-demand and distributed data) and at the same time, more and more applications (such as e-commerce, elearning etc.) are relying on the Web. In this framework, Content Distribution Networks (CDNs) are increasingly being used to disseminate data in today's Internet, providing a delicate balance between costs for Web content providers and quality of services for Web customers. The growing interest in CDNs is motivated by a common problem across disciplines: how does one reduce the load on the origin server and the traffic on the Internet, and ultimately improve response time to users? In this direction, crucial data management issues should be addressed. A very important issue is the optimal placement of the outsourced content to CDN’s servers. Taking into account that this problem is NP complete, an heuristic method should be developed. All the approaches developed so far either take as criterion the network’s latency or the workload. This paper develops a novel technique to place the outsourced content to CDN’s servers, integrating both the latency and the load. Through a detailed simulation environment, using both real and synthetic data, we show that the proposed method can improve significantly the response time of requests while keeping the CDNs’ servers’ load at a very low level.","PeriodicalId":331953,"journal":{"name":"22nd International Conference on Data Engineering Workshops (ICDEW'06)","volume":null,"pages":null},"PeriodicalIF":0.0,"publicationDate":"2006-04-03","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"114273560","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
扫码关注我们
求助内容：
应助结果提醒方式：