Matches in ScholarlyData for { ?s ?p ?o. }
- 468 title "A Framework for Rapid Integration of Presentation Components".
- 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 jin-yu.
- item-1 next item-2.
- item-2 type ListItem.
- item-2 hasContent boualem-benatallah.
- item-2 next item-3.
- item-2 previous item-1.
- item-3 type ListItem.
- item-3 hasContent fabio-casati.
- item-3 next item-4.
- item-3 previous item-2.
- item-4 type ListItem.
- item-4 hasContent florian-daniel.
- item-4 next item-5.
- item-4 previous item-3.
- item-5 type ListItem.
- item-5 hasContent maristella-matera.
- item-5 next item-6.
- item-5 previous item-4.
- item-6 type ListItem.
- item-6 hasContent regis-saint-paul.
- item-6 previous item-5.
- 469 creator anupriya-ankolekar.
- 469 creator steffen-lamparter.
- 469 creator stephan-grimm.
- 469 type InProceedings.
- 469 label "Preference-based Selection of Highly Configurable Web Services".
- 469 sameAs 469.
- 469 abstract "A key challenge for dynamic Web service selection is that Web services are typically highly configurable and service requesters often have dynamic preferences on service configurations. Current approaches, such as WS-Agreement, describe Web services by enumerating the various possible service configurations, an inefficient approach when dealing with numerous service attributes with large value spaces. We model Web service configurations and associated prices and preferences more compactly using utility function policies, which also allows us to draw from multi-attribute decision theory methods to develop an algorithm for optimal service selection. In this paper, we present an OWL ontology for the specification of configurable Web service offers and requests, and a flexible and extensible framework for optimal service selection that combines declarative logic-based matching rules with optimization methods, such as linear programming. Assuming additive price/preference functions, experimental results indicate that our algorithm introduces an overhead of only around 2 sec. compared to a random service selection, while giving optimal results. The overhead, as percentage of total time, decreases as the number of offers and configurations increase.".
- 469 hasAuthorList authorList.
- 469 isPartOf proceedings.
- 469 title "Preference-based Selection of Highly Configurable Web Services".
- 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 steffen-lamparter.
- item-1 next item-2.
- item-2 type ListItem.
- item-2 hasContent anupriya-ankolekar.
- item-2 next item-3.
- item-2 previous item-1.
- item-3 type ListItem.
- item-3 hasContent stephan-grimm.
- item-3 previous item-2.
- 479 creator daniel-james-goodman.
- 479 type InProceedings.
- 479 label "Introduction and Evaluation of Martlet, a Scientific Workflow Language for Abstracted Parallelisation".
- 479 sameAs 479.
- 479 abstract "The workflow language Martlet described in this paper implements a new programming model that allows users to write parallel programs and analyse distributed data without having to be aware of the details of the parallelisation. Martlet abstracts the parallelisation of the computation and the splitting of the data through the inclusion of constructs inspired by functional programming. These allow programs to be written as an abstract description that can be adjusted automatically at runtime to match the data set and available resources. Using this model it is possible to write programs to perform complex calculations across a distributed data set such as Singular Value Decomposition or Least Squares problems, as well as creating an intuitive way of working with distributed systems<br /><br /> Having described and evaluated Martlet against other functional languages for parallel computation, this paper goes on to look at how Martlet might develop. In doing so it covers both possible additions to the language itself, and the use of JIT compilers to increase the range of platforms it is capable of running on.".
- 479 hasAuthorList authorList.
- 479 isPartOf proceedings.
- 479 title "Introduction and Evaluation of Martlet, a Scientific Workflow Language for Abstracted Parallelisation".
- authorList type List.
- authorList hasFirstItem item-1.
- authorList hasItem item-1.
- authorList hasLastItem item-1.
- item-1 type ListItem.
- item-1 hasContent daniel-james-goodman.
- 481 creator paul-alexandru-chirita.
- 481 creator siegfried-handschuh.
- 481 creator stefania-costache.
- 481 creator wolfgang-nejdl.
- 481 type InProceedings.
- 481 label "P-TAG: Large Scale Automatic Generation of Personalized Annotation TAGs for the Web".
- 481 sameAs 481.
- 481 abstract "The success of the Semantic Web depends on the availability of Web pages annotated with metadata. Free form metadata or tags, as used in social bookmarking and folksonomies based systems, have become more and more popular and successful. Such tags are relevant keywords associated with or assigned to a piece of information (e.g., a Web page), thus describing the item and enabling keyword-based classification. In this paper we propose P-TAG, a method which automatically generates personalized tags for Web pages. Keywords are generated based on the content of the Web page but also based on the content of the user's Desktop, thus expressing a personalized viewpoint very relevant for personal tags. We implemented and tested several algorithms for this approach and evaluated the relevance of the resulting keywords. These evaluations showed very promising results and we are therefore very confident that such a user oriented automatic tagging approach can provide large scale personalized metadata annotation as an important step towards realizing the Semantic Web.".
- 481 hasAuthorList authorList.
- 481 isPartOf proceedings.
- 481 title "P-TAG: Large Scale Automatic Generation of Personalized Annotation TAGs for the Web".
- 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 paul-alexandru-chirita.
- item-1 next item-2.
- item-2 type ListItem.
- item-2 hasContent stefania-costache.
- item-2 next item-3.
- item-2 previous item-1.
- item-3 type ListItem.
- item-3 hasContent siegfried-handschuh.
- item-3 next item-4.