Matches in ScholarlyData for { ?s ?p ?o. }
- item-3 hasContent gerhard-weikum.
- item-3 previous item-2.
- 395 creator farooque-azam.
- 395 creator rashid-ahmad.
- 395 creator zhang-li.
- 395 type InProceedings.
- 395 label "Integrating Value-based Requirement Engineering Models to WebML using VIP Business Modeling Framework".
- 395 sameAs 395.
- 395 abstract "Requirement engineering is emerging as an increasingly important discipline for supporting Web application development, as these are designed to satisfy diverse stakeholder needs, additional functional, information, multimedia and usability requirements as compared to traditional software applications. Moreover, when considering innovative e-commerce applications, value-based requirements engineering is an extremely relevant methodology which exploits the concept of economic value during the requirements engineering activity. In contrast, most of the methodologies proposed for the development of Web applications, primarily focus on the system design, and paying less attention to the requirements engineering, and specifically to value-based requirement engineering. Focusing this aspect, the paper presents integration of value-based requirement engineering models to WebML models using our recently proposed VIP Business Modeling Framework. The integration process is demonstrated using a well-known e-commerce application example by first presenting example VIP business models and then deriving WebML process, structural and other models from these business models.".
- 395 hasAuthorList authorList.
- 395 isPartOf proceedings.
- 395 title "Integrating Value-based Requirement Engineering Models to WebML using VIP Business Modeling Framework".
- authorList type List.
- authorList hasFirstItem item-1.
- authorList hasItem item-1.
- authorList hasItem item-2.
- authorList hasItem item-3.
- authorList hasLastItem item-3.
- item-1 type ListItem.
- item-1 hasContent farooque-azam.
- item-1 next item-2.
- item-2 type ListItem.
- item-2 hasContent zhang-li.
- item-2 next item-3.
- item-2 previous item-1.
- item-3 type ListItem.
- item-3 hasContent rashid-ahmad.
- item-3 previous item-2.
- 397 creator ben-fei.
- 397 creator gui-rong-xue.
- 397 creator shenghua-bao.
- 397 creator xiaoyuan-wu.
- 397 creator yong-yu.
- 397 creator zhong-su.
- 397 type InProceedings.
- 397 label "Optimizing Web Search Using Social Annotation".
- 397 sameAs 397.
- 397 abstract "This paper explores the use of social annotations to improve web search. Nowadays, many services e.g., del.icio.us have been developed for web users to organize and share their favorite web pages on line by using social annotations. We observed that the social annotations can benefit the web search in two aspects: 1) the annotations are usually good summaries of corresponding web pages; 2) the count of annotations indicates the popularity of web pages. Two novel algorithms are proposed to incorporate these information into page ranking: 1) SocialSimRank (SSR) calculates the similarity between social annotations and web queries; 2) SocialPageRank (SPR) captures the popularity of web pages. Preliminary experimental results show that SSR can find the latent semantic association between queries and annotations, while SPR successfully measures the quality (popularity) of a web page from the web users' perspective. We further empirically evaluate the proposed methods with 50 manually annotated queries and 3000 auto-generated queries, on a dataset consisting of 690,482 web pages with 2,879,614 different annotations [32]. Experiments show that both SSR and SPR benefit the web search significantly. By incorporating both the SPR and SSR features, the quality of search results can be improved by as much as 14.80% and 25.02% compared with the original performance in MAP on two query sets respectively.".
- 397 hasAuthorList authorList.
- 397 isPartOf proceedings.
- 397 title "Optimizing Web Search Using Social Annotation".
- authorList type List.
- authorList hasFirstItem item-1.
- authorList hasItem item-1.
- authorList hasItem item-2.
- authorList hasItem item-3.
- authorList hasItem item-4.
- authorList hasItem item-5.
- authorList hasItem item-6.
- authorList hasLastItem item-6.
- item-1 type ListItem.
- item-1 hasContent shenghua-bao.
- item-1 next item-2.
- item-2 type ListItem.
- item-2 hasContent xiaoyuan-wu.
- item-2 next item-3.
- item-2 previous item-1.
- item-3 type ListItem.
- item-3 hasContent ben-fei.
- item-3 next item-4.
- item-3 previous item-2.
- item-4 type ListItem.
- item-4 hasContent gui-rong-xue.
- item-4 next item-5.
- item-4 previous item-3.
- item-5 type ListItem.
- item-5 hasContent zhong-su.
- item-5 next item-6.
- item-5 previous item-4.
- item-6 type ListItem.
- item-6 hasContent yong-yu.
- item-6 previous item-5.
- 403 creator alexandros-ntoulas.
- 403 creator kukulenz-dirk.
- 403 type InProceedings.
- 403 label "Answering Bounded Continuous Search Queries in the World Wide Web".
- 403 sameAs 403.
- 403 abstract "Search queries applied to extract relevant information from the World Wide Web over a period of time may be denoted as continuous search queries. The improvement of continuous search queries may concern not only the quality of retrieved results but also the freshness of results, i.e. the time between the availability of a respective data object on the Web and the notification of a user by the search engine. In some cases a user should be notified immediately since the value of the respective information decreases quickly, as e.g. news about companies that affect the value of respective stocks or sales offers for products that may no longer be available after a short period of time. In the document filtering literature the optimization of such queries is usually based on threshold classification. Documents above a quality threshold are returned to a user. The threshold is tuned in order to optimize the quality of retrieved results. The disadvantage of such approaches is that the amount of information returned to a user may hardly be controlled without further user-interaction. In this paper we consider the optimization of bounded continuous search queries where only the estimated best k elements are returned to a user. We present a new optimization method for bounded continuous search queries based on the optimal stopping theory and compare the new method to methods currently applied by Web search systems. The new method provides results of significantly higher quality for the cases where very fresh results have to be delivered.".
- 403 hasAuthorList authorList.
- 403 isPartOf proceedings.
- 403 title "Answering Bounded Continuous Search Queries in the World Wide Web".
- authorList type List.
- authorList hasFirstItem item-1.
- authorList hasItem item-1.
- authorList hasItem item-2.
- authorList hasLastItem item-2.
- item-1 type ListItem.
- item-1 hasContent kukulenz-dirk.
- item-1 next item-2.
- item-2 type ListItem.
- item-2 hasContent alexandros-ntoulas.
- item-2 previous item-1.
- 420 creator boi-faltings.
- 420 creator radu-jurca.
- 420 creator walter-binder.
- 420 type InProceedings.
- 420 label "Reliable QoS Monitoring Based on Client Feedback".
- 420 sameAs 420.
- 420 abstract "Service-level agreements (SLAs) establish a contract between service providers and clients concerning Quality of Service (QoS) parameters. Without proper penalties, service providers have strong incentives to deviate from the advertised QoS, causing losses to the clients. Reliable QoS monitoring (and proper penalties computed on the basis of delivered QoS) are therefore essential for the trustworthiness of a service-oriented environment. In this paper, we present a novel QoS monitoring mechanism based on quality ratings from the clients. A reputation mechanism collects the ratings and computes the actual quality delivered to the clients. The mechanism provides incentives for the clients to report honestly, and pays special attention to minimizing cost and overhead.".
- 420 hasAuthorList authorList.