Data Portal @ linkeddatafragments.org

Matches in ScholarlyData for { ?s ?p ?o. }

• 88 keyword "Web Engineering".
• 88 title "Automated Construction of Web Accessibility Models from Transaction Click-streams".
• authorList type List.
• authorList hasFirstItem item-1.
• authorList hasItem item-1.
• authorList hasItem item-2.
• authorList hasItem item-3.
• authorList hasItem item-4.
• authorList hasLastItem item-4.
• item-1 type ListItem.
• item-1 hasContent jalal-mahmud.
• item-1 next item-2.
• item-2 type ListItem.
• item-2 hasContent yevgen-borodin.
• item-2 next item-3.
• item-2 previous item-1.
• item-3 type ListItem.
• item-3 hasContent i-v-ramakrishnan.
• item-3 next item-4.
• item-3 previous item-2.
• item-4 type ListItem.
• item-4 hasContent c-r-ramakrishnan.
• item-4 previous item-3.
• 89 type InProceedings.
• 89 label "Combining Global Optimization with Local Selection for Efficient QoS-aware Service Composition".
• 89 sameAs 89.
• 89 abstract "The run-time binding of web services has been recently put forward in order to support rapid and dynamic web service compositions. With the growing number of alternative web services that provide the same functionality but differ in quality parameters, the service composition becomes a decision problem on which component services should be selected such that user's end-to-end QoS requirements (e.g. availability, response time) and preferences (e.g. price) are satisfied. Although very efficient, local selection strategy fails short in handling global QoS requirements. Solutions based on global optimization, on the other hand, can handle global constraints, but their poor performance renders them inappropriate for applications with dynamic and realtime requirements. In this paper we address this problem and propose a solution that combines global optimization with local selection techniques to benefit from the advantages of both worlds. The proposed solution consists of two steps: first, we use mixed integer programming (MIP) to find the optimal decomposition of global QoS constraints into local constraints. Second, we use distributed local selection to find the best web services that satisfy these local constraints. The results of experimental evaluation indicate that our approach significantly outperforms existing solutions in terms of computation time while achieving close-tooptimal results.".
• 89 hasAuthorList authorList.
• 89 isPartOf proceedings.
• 89 keyword "Web Engineering".
• 89 title "Combining Global Optimization with Local Selection for Efficient QoS-aware Service Composition".
• 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 mohammad-alrifai.
• item-1 next item-2.
• item-2 type ListItem.
• item-2 hasContent thomas-risse.
• item-2 previous item-1.
• 9 type InProceedings.
• 9 label "Efficient Overlap and Content Reuse Detection in Blogs and Online News Articles".
• 9 sameAs 9.
• 9 abstract "The use of blogs to track and comment on real world (political, news, entertainment) events is growing. Similarly, as more individuals start relying on the Web as their primary information source and as more traditional media outlets try reaching consumers through alternative venues, the number of news sites on the Web is also continuously increasing. Content-reuse, whether in the form of extensive quotations or content borrowing across media outlets, is very common in blogs and news entries outlets tracking the same real-world event. Knowledge about which web entries re-use content from which others can be an effective asset when organizing these entries for presentation. On the other hand, this knowledge is not cheap to acquire: considering the size of the related space web entries, it is essential that the techniques developed for identifying re-use are fast and scalable. Furthermore, the dynamic nature of blog and news entries necessitates incremental processing for reuse detection. In this paper, we develop a novel qSign algorithm that efficiently and effectively analyze the blogosphere for quotation and reuse identification. Experiment results show that with qSign processing time gains from 10X to 100X are possible while maintaining reuse detection rates of upto 90%. Furthermore, processing time gains can be pushed multiple orders of magnitude (from 100X to 1000X) for 70% recall.".
• 9 hasAuthorList authorList.
• 9 isPartOf proceedings.
• 9 keyword "Data Mining".
• 9 title "Efficient Overlap and Content Reuse Detection in Blogs and Online News Articles".
• 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 jong-wook-kim.
• item-1 next item-2.
• item-2 type ListItem.
• item-2 hasContent k-selcuk-candan.
• item-2 next item-3.
• item-2 previous item-1.
• item-3 type ListItem.
• item-3 hasContent junichi-tatemura.
• item-3 previous item-2.
• 90 type InProceedings.
• 90 label "A Trust Management Framework for Service-Oriented Environments".
• 90 sameAs 90.
• 90 abstract "Many reputation management systems have been developed under the assumption that each entity in the system will use a variant of the same scoring function. Much of the previous work in reputation management has focused on providing robustness and improving performance for a given reputation scheme. In this paper, we present a reputation-based trust management framework that supports the synthesis of trust-related feedback from many different entities while also providing each entity with the flexibility to apply different scoring functions over the same feedback data for customized trust evaluations. We also propose a novel scheme to cache trust values based on recent client activity. To evaluate our approach, we implemented our trust management service and tested it on a realistic application scenario in both LAN and WAN distributed environments. Our results indicate that our trust management service can effectively support multiple scoring functions with low overhead and high availability.".
• 90 hasAuthorList authorList.
• 90 isPartOf proceedings.
• 90 keyword "Web Engineering".
• 90 title "A Trust Management Framework for Service-Oriented Environments".
• 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 hasLastItem item-5.
• item-1 type ListItem.
• item-1 hasContent william-conner.
• item-1 next item-2.
• item-2 type ListItem.
• item-2 hasContent arun-iyengar.
• item-2 next item-3.
• item-2 previous item-1.
• item-3 type ListItem.
• item-3 hasContent thomas-mikalsen.
• item-3 next item-4.
• item-3 previous item-2.
• item-4 type ListItem.
• item-4 hasContent isabelle-rouvellou.
• item-4 next item-5.
• item-4 previous item-3.
• item-5 type ListItem.
• item-5 hasContent klara-nahrstedt.
• item-5 previous item-4.

• first
• previous
• next