{"title":"Protocol for large-scale group","authors":"Kojiro Taguchi, M. Takizawa","doi":"10.1109/DEXA.2002.1045869","DOIUrl":"https://doi.org/10.1109/DEXA.2002.1045869","url":null,"abstract":"We discuss a novel type of group communication protocol for a large number of processes. Group communication among a large number of processes implies large computation and communication overheads for manipulating and transmitting messages since computation and communication overheads are O(n/sup 2/) for number n of processes. In this paper, we discuss a hierarchical group which is composed of subgroups of processes.","PeriodicalId":254550,"journal":{"name":"Proceedings. 13th International Workshop on Database and Expert Systems Applications","volume":"14 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2002-09-02","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"126136119","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}
Giorgos Papavassiliou, Spyridon Ntioudis, G. Mentzas, A. Abecker
{"title":"Business process knowledge modelling: method and tool","authors":"Giorgos Papavassiliou, Spyridon Ntioudis, G. Mentzas, A. Abecker","doi":"10.1109/DEXA.2002.1045889","DOIUrl":"https://doi.org/10.1109/DEXA.2002.1045889","url":null,"abstract":"The DECOR approach to business process oriented knowledge management (BPOKM) is based upon an extended business process modelling, including automatable knowledge retrieval activities, additional knowledge management tasks and sub processes, and additional process variables used to instruct the latter two. In this paper we present the DECOR business process modelling method and a software tool to support it. The concepts are briefly illustrated with a use case from the social security sector.","PeriodicalId":254550,"journal":{"name":"Proceedings. 13th International Workshop on Database and Expert Systems Applications","volume":"48 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2002-09-02","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"126546788","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}
F. Sadat, Akira Maeda, Masatoshi Yoshikawa, Shunsuke Uemura
{"title":"A combined statistical query term disambiguation in cross-language information retrieval","authors":"F. Sadat, Akira Maeda, Masatoshi Yoshikawa, Shunsuke Uemura","doi":"10.1109/DEXA.2002.1045907","DOIUrl":"https://doi.org/10.1109/DEXA.2002.1045907","url":null,"abstract":"The diversity of information sources and the explosive growth of the Internet worldwide are compelling evidence of a need for information retrieval that can cross language boundaries. Ambiguity from failure to translate queries is one of the major causes for large drops in effectiveness below monolingual performance, for the dictionary-based method in Cross-Language Information Retrieval. In this paper, we focus on the query translation and disambiguation, to improve the effectiveness of an information retrieval and to dramatically reduce errors such an approach normally makes. A combined statistical disambiguation method both before and after translation is proposed, to avoid the problem of wrong selection of target translations. We tested the effectiveness of the proposed disambiguation method, by an application to French-English Information Retrieval. Evaluations using TREC data collection proved a great effectiveness of the proposed disambiguation method.","PeriodicalId":254550,"journal":{"name":"Proceedings. 13th International Workshop on Database and Expert Systems Applications","volume":"76 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2002-09-02","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"121381001","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":"A modeling approach for product classification systems","authors":"J. Leukel, Volker Schmitz, Frank-Dieter Dorloff","doi":"10.1109/DEXA.2002.1046005","DOIUrl":"https://doi.org/10.1109/DEXA.2002.1046005","url":null,"abstract":"Standardized product classification systems play a major role for searching and comparing offered products on electronic markets. Especially in the case of large multivendor product catalogs classified data becomes an important asset and success factor. The best known systems are UNSPSC and eCl@ss, however they are still developing, and new systems are emerging as well. Classification systems differ not only in content but also in structure from each other. The management and exchange of the systems between market partners must be able to get along with these differences. A common structure model, which can be used to specify XML business documents, is missing so far. The paper discusses the design of classification systems and develops a data model using XML schema. The model can be used for the transmission of classification systems, thus it is an innovative extension of existing product catalog standards.","PeriodicalId":254550,"journal":{"name":"Proceedings. 13th International Workshop on Database and Expert Systems Applications","volume":"5 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2002-09-02","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"126358038","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":"On accessing and customizing cultural heritage objects in Tiscover","authors":"B. Pröll, J. Palkoska","doi":"10.1109/DEXA.2002.1045954","DOIUrl":"https://doi.org/10.1109/DEXA.2002.1045954","url":null,"abstract":"Web-based tourism information systems should not only provide access to various tourism products, but should also present accompanying destination information, comprising information on cultural heritage. The generic platform for Web-based destination information systems Tiscover tries to cope with this need. Tiscover supports three different access paradigms together with appropriate Web patterns, allowing to conveniently access not only tourism products, but also a huge amount of destination information. Furthermore, customization mechanisms are provided, allowing adaptation of destination information with respect to both structural aspects in terms of describing attributes and presentation aspects in terms of layout properties.","PeriodicalId":254550,"journal":{"name":"Proceedings. 13th International Workshop on Database and Expert Systems Applications","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2002-09-02","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"131056240","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":"A decentralized authorization mechanism for e-business applications","authors":"Z. Miklós","doi":"10.1109/DEXA.2002.1045938","DOIUrl":"https://doi.org/10.1109/DEXA.2002.1045938","url":null,"abstract":"E-business applications need robust and powerful mechanisms to authorize security-critical actions. These actions can be very complex, since they can be initiated not only by human users but also by applications or software agents. Existing authorization mechanisms do not scale for large number of users if the trust relations are dynamic and fail to provide reliable authorization among strangers. Our mechanism uses authorization relevant attributes to define the policy. The attributes are assigned to principals in a decentralized manner. We also present a method to reduce the financial losses which may arise if the authorization mechanism fails. We conclude the paper with our plans for future research.","PeriodicalId":254550,"journal":{"name":"Proceedings. 13th International Workshop on Database and Expert Systems Applications","volume":"45 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2002-09-02","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"131534894","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":"Protection against hackers on client computers for e-voting systems","authors":"G. Salomonsen","doi":"10.1109/DEXA.2002.1045935","DOIUrl":"https://doi.org/10.1109/DEXA.2002.1045935","url":null,"abstract":"Summary form only given. I consider trading performance of a protocol against small, well-defined, security weaknesses. The weaknesses will be of the form that a hacker with some knowledge can, with well-defined probability, guess how a voter voted or influence the election in the way he desires. By setting parameters, these probabilities can be made as small as desired with the cost of additional computational effort. The constructions are quite general, but are presented in the context of the generalized Paillier crypto system with a particular system of noninteractive zero-knowledge proofs for implementing a secure voting protocol.","PeriodicalId":254550,"journal":{"name":"Proceedings. 13th International Workshop on Database and Expert Systems Applications","volume":"24 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2002-09-02","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"132163788","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}
B. Czejdo, Mikolaj Morzy, Marek Wojciechowski, M. Zakrzewicz
{"title":"Materialized views in data mining","authors":"B. Czejdo, Mikolaj Morzy, Marek Wojciechowski, M. Zakrzewicz","doi":"10.1109/DEXA.2002.1046000","DOIUrl":"https://doi.org/10.1109/DEXA.2002.1046000","url":null,"abstract":"Data mining is an interactive and iterative process. It is highly probable that a user will issue a series of similar queries until he or she receives satisfying results. Currently available mining algorithms suffer from long processing times depending mainly on the size of the dataset. As the pattern discovery takes place mainly in the data warehouse environment, such long processing times are unacceptable from the point of view of interactive data mining. On the other hand, the results of consecutive data mining queries are usually very similar. This observation leads to the idea of reusing materialized results of previous data mining queries in order to improve performance of the system. In this paper we present the concept of materialized data mining views and we show how the results stored in these views can be used to accelerate processing of data mining queries. We demonstrate the use of materialized views in the domains of association rules discovery and sequential pattern search.","PeriodicalId":254550,"journal":{"name":"Proceedings. 13th International Workshop on Database and Expert Systems Applications","volume":"12 26 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2002-09-02","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"124336491","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":"Effective management of location dependent continuous queries in mobile environment","authors":"L. Khan, M. Gupta","doi":"10.1109/DEXA.2002.1045980","DOIUrl":"https://doi.org/10.1109/DEXA.2002.1045980","url":null,"abstract":"Advances in wireless and mobile computing environments allow a mobile user to perform within a wide range of applications. For example, mobile users need to pull data about unfamiliar places or local life styles related to their location. Furthermore, a mobile user may be interested in getting location dependent query results periodically. We propose an algorithm for handling continuous queries in a tree-structure in such a way that the user will get the correct current query result, not the outdated result. In addition our proposed method strives to reduce communication cost. Since data are related to a particular zone, the obvious approach is to replicate fragments of location dependent data (LDD) for each zone. If we follow the approach of replicating fragments of LDD information at each zone, we may not be able to meet the storage requirements in given zones. Therefore, full replication will not work. Hence, we propose an selective replication algorithm in the context of these continuous queries. Our replication algorithm is based on the user's query pattern. If a particular type of query is frequently requested from a particular zone, we will replicate its corresponding LDD in that zone. We demonstrate that this selective replication strives to balance lookup cost and storage cost using a simulation experiment.","PeriodicalId":254550,"journal":{"name":"Proceedings. 13th International Workshop on Database and Expert Systems Applications","volume":"69 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2002-09-02","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"124456544","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":"Similarity model and term association for document categorization","authors":"Huaizhong Kou, G. Gardarin","doi":"10.1109/DEXA.2002.1045908","DOIUrl":"https://doi.org/10.1109/DEXA.2002.1045908","url":null,"abstract":"Both Euclidean distance- and cosine-based similarity models are widely used for measures of document similarity in information retrieval and document categorization. These two similarity models are based on the assumption that term vectors are orthogonal. But this assumption is not true. Term associations are ignored in such similarity models. In the document categorization context, we analyze the properties of term-document space, term-category space and category-document space. Then, without the assumption of term independence, we propose a new mathematical model to estimate the association between terms and define an /spl epsiv/-similarity model of documents. Here we make best use of existing category membership represented by the corpus as much as possible, and the objective is to improve categorization performance. Experiments have been done with a k-NN classifier over the Reuters-5178 corpus. The empirical results show that utilization of term association can improve the effectiveness of the categorization system and the /spl epsiv/-similarity model outperforms those without term association.","PeriodicalId":254550,"journal":{"name":"Proceedings. 13th International Workshop on Database and Expert Systems Applications","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2002-09-02","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"128855021","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}