Romaric Besançon, M. Rajman, Jean-Cédric Chappelier
{"title":"Textual similarities based on a distributional approach","authors":"Romaric Besançon, M. Rajman, Jean-Cédric Chappelier","doi":"10.1109/DEXA.1999.795163","DOIUrl":"https://doi.org/10.1109/DEXA.1999.795163","url":null,"abstract":"The design of efficient textual similarities is an important issue in the domain of textual data exploration. Textual similarities are for example central in document collection structuring (e.g. clustering), or in information retrieval (IR) which relies on the computation of textual similarities for measuring the adequacy between a query and documents. The objective of this paper is to present and compare several textual similarity measures in the framework of the distributional semantics (DS) model for IR. This model is an extension of the standard vector space model, which further takes the co-frequencies between the terms in a given reference corpus into account. These co-frequencies are considered to provide a distributional representation of the \"semantics\" of the terms. The co-occurrence profiles are used to represent the documents as vectors. Practical retrieval experiments using DS-based similarity models have been conducted in the framework of the AMARYLLIS evaluation campaign. The results obtained are presented. They indicate significant improvement of the performance in comparison with the standard approach.","PeriodicalId":276867,"journal":{"name":"Proceedings. Tenth International Workshop on Database and Expert Systems Applications. DEXA 99","volume":"132 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1999-09-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"134517379","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}
{"title":"The limitations of interactive multiuser 3D environments in the WWW","authors":"M. A. M. S. Oliveira, G. Todesco, R. B. Araujo","doi":"10.1109/DEXA.1999.795180","DOIUrl":"https://doi.org/10.1109/DEXA.1999.795180","url":null,"abstract":"With the emergence and integration of the languages VRML and JAVA, the number of available shared virtual environments in the WWW is increasing. However, due to the slow progress of the VRML language and the lack of conformance to its complete specification by the actual browsers, successful 3D environments face some limitations: from high latency to low presentation quality and small number of users supported. This is further worsened by the restrictive security placed upon applets what prevents the use of more efficient communication models such as multicasting (also limited by the actual network technology of the Internet). This article discusses these limitations and presents the implementation and evaluation of the Shared Virtual Reality Tool (SVRT), which supports the sharing of virtual environments among multiple users through the integration of tools and mechanisms of the WWW. The evaluation shows that latency is, on average, 200 ms-a value considered as acceptable in the literature for loosely synchronized interactive 3D applications.","PeriodicalId":276867,"journal":{"name":"Proceedings. Tenth International Workshop on Database and Expert Systems Applications. DEXA 99","volume":"115 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1999-09-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"132810472","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}
{"title":"Systemic approach for spatio-temporal database structuration","authors":"M. D. Sède, Alexandre Moine, Patrick Marceau","doi":"10.1109/DEXA.1999.795210","DOIUrl":"https://doi.org/10.1109/DEXA.1999.795210","url":null,"abstract":"Territory characterization greatly lies in our capacity of synthesizing and analysing information collected and stored inside databases. However, these partially integrate the systemic nature of a multi-dimensional territory (spatial, temporal and thematic). This reality makes necessary new approaches able to take this complexity into account. Based on a systemic approach used in the MADS formalism, we propose a data structuring method that authorizes complex thematic spatio-temporal query formulation.","PeriodicalId":276867,"journal":{"name":"Proceedings. Tenth International Workshop on Database and Expert Systems Applications. DEXA 99","volume":"127 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1999-09-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"117350831","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}
{"title":"Non-repudiation in an agent-based electronic commerce system","authors":"C. Liew, W. Ng, Ee-Peng Lim, B. Tan, K. Ong","doi":"10.1109/DEXA.1999.795295","DOIUrl":"https://doi.org/10.1109/DEXA.1999.795295","url":null,"abstract":"ABECOS is an agent-based e-commerce system under development at the Nanyang Technological University. A key factor in making this system usable in practice is strict security control. One aspect of security is the provision of non-repudiation services. As protocols for non-repudiation have focused on message non-repudiation, its adaptation to afford non-repudiation in a communication session for two agents in ABECOS is inefficient. In this work, we investigate and propose a protocol for enforcing non-repudiation in a session. The protocol is believed to be applicable in any e-commerce system; agent- or not agent-based.","PeriodicalId":276867,"journal":{"name":"Proceedings. Tenth International Workshop on Database and Expert Systems Applications. DEXA 99","volume":"15 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1999-09-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"114948693","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}
{"title":"An object-oriented framework for the parallel join operation","authors":"S. Carvalho, Alberto Lerner, Sérgio Lifschitz","doi":"10.1109/DEXA.1999.795141","DOIUrl":"https://doi.org/10.1109/DEXA.1999.795141","url":null,"abstract":"We propose an object oriented framework for one of the most frequent and costly operations in parallel database systems: the parallel join. The framework independently captures a great variety of parameters, such as different load balancing procedures and different synchronization disciplines. The framework addresses DBMS flexibility, configuration and extensibility issues, via the instantiation of known algorithms and facilities for the introduction of new ones. The framework can also be used to compare algorithms and to determine the execution scenario an algorithm is best suited for. Related algorithms are grouped in families, suggesting a taxonomy.","PeriodicalId":276867,"journal":{"name":"Proceedings. Tenth International Workshop on Database and Expert Systems Applications. DEXA 99","volume":"113 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1999-09-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"116244287","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}
{"title":"Adding a systemic view to the requirements engineering processes","authors":"V. Veneziano, S. Jones, C. Britton","doi":"10.1109/DEXA.1999.795187","DOIUrl":"https://doi.org/10.1109/DEXA.1999.795187","url":null,"abstract":"Requirements Engineering (RE) can be seen as a real challenge for human intelligence and ability to manage what we know, what other people know, and what nobody knows. To cope with this challenge, a good way to proceed is to adopt a systemic view, where all the factors involved (information, problems, stakeholders, notations, etc.) may be handled, whilst being as aware as possible of their connections, links, implications and obviously of their meaning. An approach derived from the SHEL model (Software, Hardware, Environment, Live-ware) of Edwards has been discussed in order to introduce and support such a systemic view and to propose a model. It is argued that this model can facilitate management of the RE process by managing the lack of knowledge which characterises many RE activities. We have also prototyped a tool to manage typical processes involving the sharing of what is known and detection of gaps in knowledge, mainly based on the paradigm of distributed cognition.","PeriodicalId":276867,"journal":{"name":"Proceedings. Tenth International Workshop on Database and Expert Systems Applications. DEXA 99","volume":"60 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1999-09-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"115641702","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}
{"title":"Aggregate-based query processing in a parallel data warehouse server","authors":"J. Albrecht, Wolfgang Sporer","doi":"10.1109/DEXA.1999.795142","DOIUrl":"https://doi.org/10.1109/DEXA.1999.795142","url":null,"abstract":"In the last years data warehousing has emerged as a fundamental database technology providing the basis for online analytical processing (OLAP). In general, analytical queries involve aggregations of large data sets. This results in serious performance problems if ad-hoc queries are to be answered online. One method to avoid performance bottlenecks is to use parallel hardware, i.e. SMP or MPP machines which are able to cope with the data volume. Another optimization approach specific to data warehousing is to preaggregate some of the results in order to avoid scanning the base relations. The prototypical OLAP system CUBESTAR PARALLEL SERVER combines both approaches. In order to achieve high query performance with low hardware costs, we present a technique for the dynamic, i.e. query-behavior and load-dependent, use and management of multidimensional aggregates in a shared-nothing workstation cluster.","PeriodicalId":276867,"journal":{"name":"Proceedings. Tenth International Workshop on Database and Expert Systems Applications. DEXA 99","volume":"7 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1999-09-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"121828079","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}
{"title":"Protocol for pseudo-active replication in wide-area networks","authors":"H. Higaki, Katsuya Tanaka, M. Takizawa","doi":"10.1109/DEXA.1999.795266","DOIUrl":"https://doi.org/10.1109/DEXA.1999.795266","url":null,"abstract":"We discuss how to replicate a server in order to obtain fault tolerant services. In the active replication, all the requests from a client are performed by all the server replicas in the same order. The replicas are rather placed on heterogeneous computers interconnected in a wide area network: (WAN), e.g. the Internet, where each communication channel has different message transmission delay and bandwidth. Hence, the response times of the replicas observed by the clients are not the same. We newly propose a pseudo active replication where the client does not wait for other responses after receiving one response and slower replicas do not perform every request performed by the faster replicas.","PeriodicalId":276867,"journal":{"name":"Proceedings. Tenth International Workshop on Database and Expert Systems Applications. DEXA 99","volume":"290 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1999-09-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"124178232","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}
{"title":"Applying agents to search goods information based on three-level metadata architectures","authors":"Duen-Ren Liu, Shien-Chang Pan","doi":"10.1109/DEXA.1999.795258","DOIUrl":"https://doi.org/10.1109/DEXA.1999.795258","url":null,"abstract":"With the explosive growth in the number of virtual stores and goods information on the Internet, customers are experiencing difficulties in searching for goods information satisfying their needs. In this work, agent technology was applied to develop a flexible search system enabling users to search goods information based on the attributes of various goods categories. We propose a three-level metadata architecture to make an Internet search for goods information more effective. The metadata is able to facilitate resource discovery and format translation, and to flexibly model the definitions of diverse attributes for describing goods in various goods categories and data resources. With the three-level metadata architecture and the agent technology, an integrated search for goods information can be performed effectively.","PeriodicalId":276867,"journal":{"name":"Proceedings. Tenth International Workshop on Database and Expert Systems Applications. DEXA 99","volume":"47 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1999-09-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"128246293","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}
{"title":"Is similarity search useful for high dimensional spaces?","authors":"R. Weber, P. Zezula","doi":"10.1109/DEXA.1999.795157","DOIUrl":"https://doi.org/10.1109/DEXA.1999.795157","url":null,"abstract":"In recent years, multimedia content-based retrieval has become an important research problem. In order to provide effective and also efficient access to relevant data stored in large (often distributed) digital repositories, advanced software tools are necessary. Content-based retrieval works on the idea of abstracting the contents of an object, for example color or shape in the case of images, by so-called features-features are typically points in a high-dimensional vector space. Instead of determining the similarity of two objects based on their raw data, only the much smaller feature representations are used to estimate the objects' similarity. Given a reference (query) object represented by its features, similarity predicates are defined to retrieve a specific number of best cases or all objects satisfying a (distance) constraint. In this respect, we can distinguish between similarity range and nearest neighbor (NN) queries.","PeriodicalId":276867,"journal":{"name":"Proceedings. Tenth International Workshop on Database and Expert Systems Applications. DEXA 99","volume":"88 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1999-09-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"128337086","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}