The prerequisites of success and reasons for failure for enterprise integration projects are still not well-understood as evidenced by large failure rates, including cost or schedule overruns, abandoned projects, and projects delivered with diminished functionality. These failures point to the inherently human activities of planning and overseeing that are critical to successful large-scale integration. In spite of a rich stream of research on systems development risks, few research efforts have attempted to understand enterprise integration risks. This paper reports preliminary findings, based on an analysis of data gathered via focus groups at an organization poised to embark on an integration project, about how organizational participants perceive these risks. The analysis shows that risk perception is fuzzy, it differs significantly across organizational actors, and points to considerable information asymmetry between risk managers and project participants.
{"title":"Understanding enterprise integration project risks: A focus group study","authors":"S. Purao, S. Paul, Steven Smith","doi":"10.1109/DEXA.2007.46","DOIUrl":"https://doi.org/10.1109/DEXA.2007.46","url":null,"abstract":"The prerequisites of success and reasons for failure for enterprise integration projects are still not well-understood as evidenced by large failure rates, including cost or schedule overruns, abandoned projects, and projects delivered with diminished functionality. These failures point to the inherently human activities of planning and overseeing that are critical to successful large-scale integration. In spite of a rich stream of research on systems development risks, few research efforts have attempted to understand enterprise integration risks. This paper reports preliminary findings, based on an analysis of data gathered via focus groups at an organization poised to embark on an integration project, about how organizational participants perceive these risks. The analysis shows that risk perception is fuzzy, it differs significantly across organizational actors, and points to considerable information asymmetry between risk managers and project participants.","PeriodicalId":314834,"journal":{"name":"18th International Workshop on Database and Expert Systems Applications (DEXA 2007)","volume":"9 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2007-09-03","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"114897854","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}
We introduce Tira (text-based information retrieval architecture), a software architecture for the rapid prototyping of tailored information retrieval (IR) tools. Tira allows to compose personal IR tools from atomic IR services, following the model driven architecture (MDA) paradigm: In a first step, an IR process is defined independently from platforms, by means of a UML activity diagram. In a second step, the activity diagram is transformed to a platform specific model, which is executed in a distributed environment. Major driving force behind our research is the question of personalization: We see a large gap between information retrieval theory and algorithms on the one hand and their implementation and deployment to satisfy a personal information need on the other. This gap can be closed with adequate software engineering means, and Tira shall contribute in this respect.
{"title":"An MDA Approach to Implement Personal IR Tools","authors":"Sven Meyer zu Eissen, Benno Stein","doi":"10.1109/DEXA.2007.101","DOIUrl":"https://doi.org/10.1109/DEXA.2007.101","url":null,"abstract":"We introduce Tira (text-based information retrieval architecture), a software architecture for the rapid prototyping of tailored information retrieval (IR) tools. Tira allows to compose personal IR tools from atomic IR services, following the model driven architecture (MDA) paradigm: In a first step, an IR process is defined independently from platforms, by means of a UML activity diagram. In a second step, the activity diagram is transformed to a platform specific model, which is executed in a distributed environment. Major driving force behind our research is the question of personalization: We see a large gap between information retrieval theory and algorithms on the one hand and their implementation and deployment to satisfy a personal information need on the other. This gap can be closed with adequate software engineering means, and Tira shall contribute in this respect.","PeriodicalId":314834,"journal":{"name":"18th International Workshop on Database and Expert Systems Applications (DEXA 2007)","volume":"29 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2007-09-03","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"121906535","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}
Various requirements that usually are imposed on data, constraints, updates and methods for checking the integrity of databases can be perceived as inflexible straitjackets. We show that such restrictions can be notably relaxed or even completely abandoned without forfeiting any major advantage. On the contrary, a significant amount of flexibility is gained by relaxing or abandoning several established prerequisites for integrity checking.
{"title":"Getting Rid of Straitjackets for Flexible Integrity Checking","authors":"H. Decker, D. Martinenghi","doi":"10.1109/DEXA.2007.54","DOIUrl":"https://doi.org/10.1109/DEXA.2007.54","url":null,"abstract":"Various requirements that usually are imposed on data, constraints, updates and methods for checking the integrity of databases can be perceived as inflexible straitjackets. We show that such restrictions can be notably relaxed or even completely abandoned without forfeiting any major advantage. On the contrary, a significant amount of flexibility is gained by relaxing or abandoning several established prerequisites for integrity checking.","PeriodicalId":314834,"journal":{"name":"18th International Workshop on Database and Expert Systems Applications (DEXA 2007)","volume":"62 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2007-09-03","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"117315937","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}
We have used Galois lattices for mining hydrobiological data. These data are about macrophytes, that are macroscopic plants living in water bodies. These plants are characterized by several biological traits, that own several modalities. Our aim is to cluster the plants according to their common traits and modalities and to find out the relations between traits. Galois lattices are efficient methods for such an aim, but apply on binary data. In this article, we detail a few approaches we used to transform complex hydrobiological data into binary data and compare the first results obtained thanks to Galois lattices.
{"title":"Mining Complex Hydrobiological Data with Galois Lattices","authors":"Aurélie Bertaux, Agnès Braud, F. Ber","doi":"10.1109/DEXA.2007.148","DOIUrl":"https://doi.org/10.1109/DEXA.2007.148","url":null,"abstract":"We have used Galois lattices for mining hydrobiological data. These data are about macrophytes, that are macroscopic plants living in water bodies. These plants are characterized by several biological traits, that own several modalities. Our aim is to cluster the plants according to their common traits and modalities and to find out the relations between traits. Galois lattices are efficient methods for such an aim, but apply on binary data. In this article, we detail a few approaches we used to transform complex hydrobiological data into binary data and compare the first results obtained thanks to Galois lattices.","PeriodicalId":314834,"journal":{"name":"18th International Workshop on Database and Expert Systems Applications (DEXA 2007)","volume":"60 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2007-09-03","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"122934092","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}
The paper deals with a solution for visual surveillance metadata management. Data coming from many cameras is annotated using computer vision units to produce metadata representing moving objects in their states. It is assumed that the data is often uncertain, noisy and some states are missing. The solution consists of the following three layers: (a) data cleaning layer - improves quality of the data by smoothing it and by filling in missing states in short sequences referred to as tracks that represent a composite state of a moving object in a spatiotemporal subspace followed by one camera, (b) Data integration layer - assigns a global identity to tracks that represent the same object, (c) Persistence layer - manages the metadata in a database so that it can be used for online identification and offline querying, analyzing and mining. A Kalman filter technique is used to solve (a) and a classification based on the moving object's state and its visual properties is used in (b). An object model for layer (c) is presented too.
{"title":"Visual Surveillance Metadata Management","authors":"P. Chmelar, J. Zendulka","doi":"10.1109/DEXA.2007.50","DOIUrl":"https://doi.org/10.1109/DEXA.2007.50","url":null,"abstract":"The paper deals with a solution for visual surveillance metadata management. Data coming from many cameras is annotated using computer vision units to produce metadata representing moving objects in their states. It is assumed that the data is often uncertain, noisy and some states are missing. The solution consists of the following three layers: (a) data cleaning layer - improves quality of the data by smoothing it and by filling in missing states in short sequences referred to as tracks that represent a composite state of a moving object in a spatiotemporal subspace followed by one camera, (b) Data integration layer - assigns a global identity to tracks that represent the same object, (c) Persistence layer - manages the metadata in a database so that it can be used for online identification and offline querying, analyzing and mining. A Kalman filter technique is used to solve (a) and a classification based on the moving object's state and its visual properties is used in (b). An object model for layer (c) is presented too.","PeriodicalId":314834,"journal":{"name":"18th International Workshop on Database and Expert Systems Applications (DEXA 2007)","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2007-09-03","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"130107897","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}
C. Challiol, Andrés Fortier, S. Gordillo, G. Rossi
In this paper we present the rationale and the main components for a modular and extensible architecture for building and deploying physical hypermedia software. We show that this kind of software systems poses strong requirements on supporting software (such as Web browsers) because they involve complex context-aware navigation semantics. By using some simple archetypical examples we also show how to provide context-aware assistance to the mobile user, as he explores the physical world.
{"title":"A Flexible Architecture for Context-Aware Physical Hypermedia","authors":"C. Challiol, Andrés Fortier, S. Gordillo, G. Rossi","doi":"10.1109/DEXA.2007.9","DOIUrl":"https://doi.org/10.1109/DEXA.2007.9","url":null,"abstract":"In this paper we present the rationale and the main components for a modular and extensible architecture for building and deploying physical hypermedia software. We show that this kind of software systems poses strong requirements on supporting software (such as Web browsers) because they involve complex context-aware navigation semantics. By using some simple archetypical examples we also show how to provide context-aware assistance to the mobile user, as he explores the physical world.","PeriodicalId":314834,"journal":{"name":"18th International Workshop on Database and Expert Systems Applications (DEXA 2007)","volume":"59 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2007-09-03","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"128850263","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}
In this paper we investigate the problem of automatically identifying the genre of TV programmes. The approach here proposed is based on two foundations: Gaussian mixture models (GMMs) and artificial neural networks (ANNs). Firstly, we use Gaussian mixtures to model the probability distributions of low-level audiovisual features. Secondly, we use the parameters of each mixture model as new feature vectors. Finally, we train a multilayer perceptron (MLP), using GMM parameters as input data, to identify seven television programme genres. We evaluated the effectiveness of the proposed approach testing our system on a large set of data, summing up to more than 100 hours of broadcasted programmes.
{"title":"Automatic Genre Classification of TV Programmes Using Gaussian Mixture Models and Neural Networks","authors":"M. Montagnuolo, A. Messina","doi":"10.1109/DEXA.2007.92","DOIUrl":"https://doi.org/10.1109/DEXA.2007.92","url":null,"abstract":"In this paper we investigate the problem of automatically identifying the genre of TV programmes. The approach here proposed is based on two foundations: Gaussian mixture models (GMMs) and artificial neural networks (ANNs). Firstly, we use Gaussian mixtures to model the probability distributions of low-level audiovisual features. Secondly, we use the parameters of each mixture model as new feature vectors. Finally, we train a multilayer perceptron (MLP), using GMM parameters as input data, to identify seven television programme genres. We evaluated the effectiveness of the proposed approach testing our system on a large set of data, summing up to more than 100 hours of broadcasted programmes.","PeriodicalId":314834,"journal":{"name":"18th International Workshop on Database and Expert Systems Applications (DEXA 2007)","volume":"22 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2007-09-03","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"116141166","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}
This paper deals with the problem of author identification. The common N-grams (CNG) method [6] is a language-independent profile-based approach with good results in many author identification experiments so far. A variation of this approach is presented based on new distance measures that are quite stable for large profile length values. Special emphasis is given to the degree upon which the effectiveness of the method is affected by the available training text samples per author. Experiments based on text samples on the same topic from the Reuters Corpus Volume 1 are presented using both balanced and imbalanced training corpora. The results show that CNG with the proposed distance measures is more accurate when only limited training text samples are available, at least for some of the candidate authors, a realistic condition in author identification problems.
{"title":"Author Identification Using Imbalanced and Limited Training Texts","authors":"E. Stamatatos","doi":"10.1109/DEXA.2007.41","DOIUrl":"https://doi.org/10.1109/DEXA.2007.41","url":null,"abstract":"This paper deals with the problem of author identification. The common N-grams (CNG) method [6] is a language-independent profile-based approach with good results in many author identification experiments so far. A variation of this approach is presented based on new distance measures that are quite stable for large profile length values. Special emphasis is given to the degree upon which the effectiveness of the method is affected by the available training text samples per author. Experiments based on text samples on the same topic from the Reuters Corpus Volume 1 are presented using both balanced and imbalanced training corpora. The results show that CNG with the proposed distance measures is more accurate when only limited training text samples are available, at least for some of the candidate authors, a realistic condition in author identification problems.","PeriodicalId":314834,"journal":{"name":"18th International Workshop on Database and Expert Systems Applications (DEXA 2007)","volume":"24 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2007-09-03","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"116530103","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}
Jaydip Sen, M. Chandra, P. Balamuralidhar, G. HariharaS., H. Reddy
The attractiveness of the wireless ad hoc networks lies in the fact that these networks are self-organized: the hosts constituting the networks can communicate with each other without reliance on any centralized or specified entities such as base stations or access points. With these networks finding more applications, the need for adequate security mechanism is increasingly becoming important. Key management is an essential cryptographic primitive upon which other security protocols are built. However, most of the existing key management schemes are not feasible in ad hoc networks because public key infrastructures with a centralized certification authority are hard to deploy there. In this paper, we propose and evaluate a security mechanism based on distributed certification authority based on threshold cryptography that is suited to wireless ad hoc networks. A collection of nodes acts as the certificate authority and provides the certification service. The feasibility of the proposed scheme is verified by some simulation studies. The results show the effectiveness of the scheme.
{"title":"A Scheme of Certificate Authority for Ad Hoc Networks","authors":"Jaydip Sen, M. Chandra, P. Balamuralidhar, G. HariharaS., H. Reddy","doi":"10.1109/DEXA.2007.90","DOIUrl":"https://doi.org/10.1109/DEXA.2007.90","url":null,"abstract":"The attractiveness of the wireless ad hoc networks lies in the fact that these networks are self-organized: the hosts constituting the networks can communicate with each other without reliance on any centralized or specified entities such as base stations or access points. With these networks finding more applications, the need for adequate security mechanism is increasingly becoming important. Key management is an essential cryptographic primitive upon which other security protocols are built. However, most of the existing key management schemes are not feasible in ad hoc networks because public key infrastructures with a centralized certification authority are hard to deploy there. In this paper, we propose and evaluate a security mechanism based on distributed certification authority based on threshold cryptography that is suited to wireless ad hoc networks. A collection of nodes acts as the certificate authority and provides the certification service. The feasibility of the proposed scheme is verified by some simulation studies. The results show the effectiveness of the scheme.","PeriodicalId":314834,"journal":{"name":"18th International Workshop on Database and Expert Systems Applications (DEXA 2007)","volume":"112 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2007-09-03","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"131716039","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}
Customers generally like to see alternative products and compare their characteristics and prices before deciding on one of them. Therefore, proposing alternative products is one of the crucial issues for e-commerce applications to increase customer satisfaction. This paper proposes a fuzzy similarity-based approach to determine similar products recorded in a database and submit them intelligently to the customer in a ranked way as alternative products.
{"title":"An Alternative Product Extraction Method for E-Commerce Applications","authors":"Murat Koyuncu","doi":"10.1109/DEXA.2007.48","DOIUrl":"https://doi.org/10.1109/DEXA.2007.48","url":null,"abstract":"Customers generally like to see alternative products and compare their characteristics and prices before deciding on one of them. Therefore, proposing alternative products is one of the crucial issues for e-commerce applications to increase customer satisfaction. This paper proposes a fuzzy similarity-based approach to determine similar products recorded in a database and submit them intelligently to the customer in a ranked way as alternative products.","PeriodicalId":314834,"journal":{"name":"18th International Workshop on Database and Expert Systems Applications (DEXA 2007)","volume":"16 4 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2007-09-03","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"132988761","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
扫码关注我们
求助内容：
应助结果提醒方式：