Pub Date : 2009-04-18DOI: 10.1007/978-3-642-00958-7_41
Stefano Baccianella, Andrea Esuli, F. Sebastiani
{"title":"Multi-Faceted Rating of Product Reviews","authors":"Stefano Baccianella, Andrea Esuli, F. Sebastiani","doi":"10.1007/978-3-642-00958-7_41","DOIUrl":"https://doi.org/10.1007/978-3-642-00958-7_41","url":null,"abstract":"","PeriodicalId":44543,"journal":{"name":"ERCIM News","volume":null,"pages":null},"PeriodicalIF":0.1,"publicationDate":"2009-04-18","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"https://sci-hub-pdf.com/10.1007/978-3-642-00958-7_41","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"51068193","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}
Stream applications gained significant popularity over the last years that lead to the development of specialized stream engines. These systems are designed from scratch with a different philosophy than nowadays database engines in order to cope with the stream applications requirements. However, this means that they lack the power and sophisticated techniques of a full fledged database system that exploits techniques and algorithms accumulated over many years of database research. In this paper, we take the opposite route and design a stream engine directly on top of a database kernel. Incoming tuples are directly stored upon arrival in a new kind of system tables, called baskets. A continuous query can then be evaluated over its relevant baskets as a typical one-time query exploiting the power of the relational engine. Once a tuple has been seen by all relevant queries/operators, it is dropped from its basket. A basket can be the input to a single or multiple similar query plans. Furthermore, a query plan can be split into multiple parts each one with its own input/output baskets allowing for flexible load sharing query scheduling. Contrary to traditional stream engines, that process one tuple at a time, this model allows batch processing of tuples, e.g., query a basket only after x tuples arrive or after a time threshold has passed. Furthermore, we are not restricted to process tuples in the order they arrive. Instead, we can selectively pick tuples from a basket based on the query requirements exploiting a novel query component, the basket expressions. We investigate the opportunities and challenges that arise with such a direction and we show that it carries significant advantages. We propose a complete architecture, the DataCell, which we implemented on top of an open-source column-oriented DBMS. A detailed analysis and experimental evaluation of the core algorithms using both micro benchmarks and the standard Linear Road benchmark demonstrate the potential of this new approach.
{"title":"Exploiting the power of relational databases for efficient stream processing","authors":"Erietta Liarou, M. Kersten","doi":"10.1145/1516360.1516398","DOIUrl":"https://doi.org/10.1145/1516360.1516398","url":null,"abstract":"Stream applications gained significant popularity over the last years that lead to the development of specialized stream engines. These systems are designed from scratch with a different philosophy than nowadays database engines in order to cope with the stream applications requirements. However, this means that they lack the power and sophisticated techniques of a full fledged database system that exploits techniques and algorithms accumulated over many years of database research.\u0000 In this paper, we take the opposite route and design a stream engine directly on top of a database kernel. Incoming tuples are directly stored upon arrival in a new kind of system tables, called baskets. A continuous query can then be evaluated over its relevant baskets as a typical one-time query exploiting the power of the relational engine. Once a tuple has been seen by all relevant queries/operators, it is dropped from its basket. A basket can be the input to a single or multiple similar query plans. Furthermore, a query plan can be split into multiple parts each one with its own input/output baskets allowing for flexible load sharing query scheduling. Contrary to traditional stream engines, that process one tuple at a time, this model allows batch processing of tuples, e.g., query a basket only after x tuples arrive or after a time threshold has passed. Furthermore, we are not restricted to process tuples in the order they arrive. Instead, we can selectively pick tuples from a basket based on the query requirements exploiting a novel query component, the basket expressions.\u0000 We investigate the opportunities and challenges that arise with such a direction and we show that it carries significant advantages. We propose a complete architecture, the DataCell, which we implemented on top of an open-source column-oriented DBMS. A detailed analysis and experimental evaluation of the core algorithms using both micro benchmarks and the standard Linear Road benchmark demonstrate the potential of this new approach.","PeriodicalId":44543,"journal":{"name":"ERCIM News","volume":null,"pages":null},"PeriodicalIF":0.1,"publicationDate":"2009-03-24","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"https://sci-hub-pdf.com/10.1145/1516360.1516398","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"64101001","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 : 2008-10-20DOI: 10.1007/978-3-540-88625-9_17
F. Martinelli, F. Massacci, P. Mori, C. Schaefer, T. Walter
{"title":"Enhancing Java ME Security Support with Resource Usage Monitoring","authors":"F. Martinelli, F. Massacci, P. Mori, C. Schaefer, T. Walter","doi":"10.1007/978-3-540-88625-9_17","DOIUrl":"https://doi.org/10.1007/978-3-540-88625-9_17","url":null,"abstract":"","PeriodicalId":44543,"journal":{"name":"ERCIM News","volume":null,"pages":null},"PeriodicalIF":0.1,"publicationDate":"2008-10-20","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"84355779","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}
Page-centric Web application frameworks fail to offer adequate solutions to model composition and control flow. Seaside allows Web applications to be developed in the same way as desktop applications. Control flow is modelled as a continuous piece of code, and components may be composed, configured and nested as one would expect from traditional user interface frameworks.
{"title":"Seaside - Advanced Composition and Control Flow for Dynamic Web Applications","authors":"Alexandre Bergel, Stéphane Ducasse, L. Renggli","doi":"10.7892/BORIS.104394","DOIUrl":"https://doi.org/10.7892/BORIS.104394","url":null,"abstract":"Page-centric Web application frameworks fail to offer adequate solutions to model composition and control flow. Seaside allows Web applications to be developed in the same way as desktop applications. Control flow is modelled as a continuous piece of code, and components may be composed, configured and nested as one would expect from traditional user interface frameworks.","PeriodicalId":44543,"journal":{"name":"ERCIM News","volume":null,"pages":null},"PeriodicalIF":0.1,"publicationDate":"2008-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"71357364","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}
functionality on every computer that allows any type of application software to be run. For computer science students it is crucial to know and understand the principal concepts and mechanisms of operating systems. This understanding helps them to efficiently use programming languages to develop software built on top of the operating system. This also applies to people working in other fields related to information technology, who could benefit greatly from a deeper knowledge of operating system internals.
{"title":"OSLab: An Interactive Operating System Laboratory","authors":"M. Wulff, T. Braun","doi":"10.7892/BORIS.26539","DOIUrl":"https://doi.org/10.7892/BORIS.26539","url":null,"abstract":"functionality on every computer that allows any type of application software to be run. For computer science students it is crucial to know and understand the principal concepts and mechanisms of operating systems. This understanding helps them to efficiently use programming languages to develop software built on top of the operating system. This also applies to people working in other fields related to information technology, who could benefit greatly from a deeper knowledge of operating system internals.","PeriodicalId":44543,"journal":{"name":"ERCIM News","volume":null,"pages":null},"PeriodicalIF":0.1,"publicationDate":"2007-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"71357267","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 : 2000-01-01DOI: 10.1007/3-540-44698-2_17
U. Ebert, M. Arrayás
{"title":"Pattern Formation in Electric Discharges","authors":"U. Ebert, M. Arrayás","doi":"10.1007/3-540-44698-2_17","DOIUrl":"https://doi.org/10.1007/3-540-44698-2_17","url":null,"abstract":"","PeriodicalId":44543,"journal":{"name":"ERCIM News","volume":null,"pages":null},"PeriodicalIF":0.1,"publicationDate":"2000-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"https://sci-hub-pdf.com/10.1007/3-540-44698-2_17","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"51564626","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}
J. Ejarque, Javier Álvarez, R. Sirvent, Rosa M. Badia, Henar Muñoz
Norms have been extensively proposed as coordination mechanisms for both agent and human societies. Nevertheless, choosing the norms to regulate a society is by no means straightforward. The reasons are twofold. First, the norms to choose from may not be independent (i.e, they can be related to each other). Second, different preference criteria may be applied when choosing the norms to enact. On the one hand, this paper considers norm representation power and cost as alternative preference criteria. On the other hand, it identifies three different norm relationships --namely, generalisation, exclusivity, and substitutability. We show that the decisionmaking problem faced by policy makers can be encoded as a linear program, and hence solved with the aid of state-of-the-art solvers.
{"title":"Automating Decision Making to Help Establish Norm-Based Regulations","authors":"J. Ejarque, Javier Álvarez, R. Sirvent, Rosa M. Badia, Henar Muñoz","doi":"10.13039/501100002809","DOIUrl":"https://doi.org/10.13039/501100002809","url":null,"abstract":"Norms have been extensively proposed as coordination mechanisms for both agent and human societies. Nevertheless, choosing the norms to regulate a society is by no means straightforward. The reasons are twofold. First, the norms to choose from may not be independent (i.e, they can be related to each other). Second, different preference criteria may be applied when choosing the norms to enact. On the one hand, this paper considers norm representation power and cost as alternative preference criteria. On the other hand, it identifies three different norm relationships --namely, generalisation, exclusivity, and substitutability. We show that the decisionmaking problem faced by policy makers can be encoded as a linear program, and hence solved with the aid of state-of-the-art solvers.","PeriodicalId":44543,"journal":{"name":"ERCIM News","volume":null,"pages":null},"PeriodicalIF":0.1,"publicationDate":"1991-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"66112541","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
扫码关注我们
求助内容：
应助结果提醒方式：