If we try to increase the level of automation in enterprise application integration (EAI) scenarios, we confront challenges related to the resolution of data heterogeneities, service discovery and process composition. In this paper, we propose the enterprise interoperability ontology (ENIO) that provides a shared, common understanding of data, services and processes within enterprise application integration scenarios. ENIO consists of an upper EAI ontology, which is based on the DOLCE-SUMO alignment, with extensions called facets that cover several dimensions of the EAI domain. Each facet contains a relative meta-model that utilizes widely adopted standards.
{"title":"ENIO: An Enterprise Application Integration Ontology","authors":"A. Bouras, P. Gouvas, G. Mentzas","doi":"10.1109/DEXA.2007.25","DOIUrl":"https://doi.org/10.1109/DEXA.2007.25","url":null,"abstract":"If we try to increase the level of automation in enterprise application integration (EAI) scenarios, we confront challenges related to the resolution of data heterogeneities, service discovery and process composition. In this paper, we propose the enterprise interoperability ontology (ENIO) that provides a shared, common understanding of data, services and processes within enterprise application integration scenarios. ENIO consists of an upper EAI ontology, which is based on the DOLCE-SUMO alignment, with extensions called facets that cover several dimensions of the EAI domain. Each facet contains a relative meta-model that utilizes widely adopted standards.","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":"127415807","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 propose an approach to treat business rules as a separate component of business model used in business process deployment. Using this approach, we can define, customise and deploy business processes that are directly dependent upon business rules. Moreover, business rules can be applied efficiently and consistently to a business process. Furthermore, we are able to incorporate these rules into another business process, where each process depends upon some specific rules, policies, procedures and standards. The approach also provides the flexibility to allow business process automation to be more customisable, flexible, efficient and reusable.
{"title":"Rule component specification for business process deployment","authors":"Saqib Ali, T. Torabi, B. Soh","doi":"10.1109/DEXA.2007.109","DOIUrl":"https://doi.org/10.1109/DEXA.2007.109","url":null,"abstract":"In this paper we propose an approach to treat business rules as a separate component of business model used in business process deployment. Using this approach, we can define, customise and deploy business processes that are directly dependent upon business rules. Moreover, business rules can be applied efficiently and consistently to a business process. Furthermore, we are able to incorporate these rules into another business process, where each process depends upon some specific rules, policies, procedures and standards. The approach also provides the flexibility to allow business process automation to be more customisable, flexible, efficient and reusable.","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":"115540588","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 propose an efficient ALIB algorithm that can find frequent patterns by only onetime database scan. Frequent patterns are found without generation of candidate sets using LIB-graph. LIB-graph is generated simultaneously when the database is scanned for 1-frequent items generation. LIB-graph represents the relation between 1-frequent items and transactions including the 1-frequent items. That is, LIB-graph compresses database information into a much smaller data structure. We can quickly find frequent patterns because the proposed method conducts only onetime database scan and avoids the generation of candidate sets. Our performance study shows that the ALIB algorithm is efficient for mining frequent patterns, and is faster than the FP-growth.
{"title":"Frequent Pattern Mining using Bipartite Graph","authors":"D. Chai, Long Jin, B. Hwang, K. Ryu","doi":"10.1109/DEXA.2007.110","DOIUrl":"https://doi.org/10.1109/DEXA.2007.110","url":null,"abstract":"In this paper, we propose an efficient ALIB algorithm that can find frequent patterns by only onetime database scan. Frequent patterns are found without generation of candidate sets using LIB-graph. LIB-graph is generated simultaneously when the database is scanned for 1-frequent items generation. LIB-graph represents the relation between 1-frequent items and transactions including the 1-frequent items. That is, LIB-graph compresses database information into a much smaller data structure. We can quickly find frequent patterns because the proposed method conducts only onetime database scan and avoids the generation of candidate sets. Our performance study shows that the ALIB algorithm is efficient for mining frequent patterns, and is faster than the FP-growth.","PeriodicalId":314834,"journal":{"name":"18th International Workshop on Database and Expert Systems Applications (DEXA 2007)","volume":"45 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":"132082324","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 importance of integrating information about patients in intelligent tutoring systems (ITS) is the opportunity given to the students to direct their own learning. We propose an integration-architecture for sharing patient clinical data among tutoring and health information systems (HISs). HL 7 is used as a standard messaging protocol for collecting the clinical patient data distributed over health information systems.
{"title":"Integrating Intelligent Tutoring Systems and Health Information Systems","authors":"Carolina González, J. C. Burguillo, M. Nistal","doi":"10.1109/DEXA.2007.57","DOIUrl":"https://doi.org/10.1109/DEXA.2007.57","url":null,"abstract":"The importance of integrating information about patients in intelligent tutoring systems (ITS) is the opportunity given to the students to direct their own learning. We propose an integration-architecture for sharing patient clinical data among tutoring and health information systems (HISs). HL 7 is used as a standard messaging protocol for collecting the clinical patient data distributed over health information systems.","PeriodicalId":314834,"journal":{"name":"18th International Workshop on Database and Expert Systems Applications (DEXA 2007)","volume":"45 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":"125425221","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}
Computing resources of both hardware and software tends to be located at a certain place, as most professional software supplied by a computing Grid demands powerful computing hardware. The computing Grid in this paper provides work processing with legacy professional software, without any modification or adaptation of the software. The simplified computing Grid model consolidates server farms with multiple Web service providers. A client may access the computing Grid through redundant Web interfaces and experience faster Web interface. The computing Grid would not become inaccessible until all the coordinators crashed down.
{"title":"Consolidating Web Application Server Farms with Redundant Webinterfaces","authors":"M. Ok, Yangsup Lee, Sung-Il Hong","doi":"10.1109/DEXA.2007.45","DOIUrl":"https://doi.org/10.1109/DEXA.2007.45","url":null,"abstract":"Computing resources of both hardware and software tends to be located at a certain place, as most professional software supplied by a computing Grid demands powerful computing hardware. The computing Grid in this paper provides work processing with legacy professional software, without any modification or adaptation of the software. The simplified computing Grid model consolidates server farms with multiple Web service providers. A client may access the computing Grid through redundant Web interfaces and experience faster Web interface. The computing Grid would not become inaccessible until all the coordinators crashed down.","PeriodicalId":314834,"journal":{"name":"18th International Workshop on Database and Expert Systems Applications (DEXA 2007)","volume":"46 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":"114164159","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 growing amount of multimedia data available to the average user has reached a critical phase where methods for indexing, searching, and efficient retrieval are expressly needed to manage the information load. In this paper, we present a hybrid video database model which is a combination of the hierarchical video database model and annotations using. In particular, we extend the original hierarchical indexing mechanism to add frames and salient objects as the lowest granularity level in the video tree with the aim to support multi-level access control. In conjunction, with the use of annotations, we give users more solutions to query for their interesting videos based on the video contents (content-based retrieval). In addition, we also tailor the original database access control model to fit the characteristics of video data. Our updated model supports both multiple access control policies, means a user may be affected by multiple polices, and multilevel access control, means an authorization may be specified at any video levels.
{"title":"A Novel Approach to Fine-grained Content-based Access Control for Video Databases","authors":"N. Tran, T. K. Dang","doi":"10.1109/DEXA.2007.49","DOIUrl":"https://doi.org/10.1109/DEXA.2007.49","url":null,"abstract":"The growing amount of multimedia data available to the average user has reached a critical phase where methods for indexing, searching, and efficient retrieval are expressly needed to manage the information load. In this paper, we present a hybrid video database model which is a combination of the hierarchical video database model and annotations using. In particular, we extend the original hierarchical indexing mechanism to add frames and salient objects as the lowest granularity level in the video tree with the aim to support multi-level access control. In conjunction, with the use of annotations, we give users more solutions to query for their interesting videos based on the video contents (content-based retrieval). In addition, we also tailor the original database access control model to fit the characteristics of video data. Our updated model supports both multiple access control policies, means a user may be affected by multiple polices, and multilevel access control, means an authorization may be specified at any video levels.","PeriodicalId":314834,"journal":{"name":"18th International Workshop on Database and Expert Systems Applications (DEXA 2007)","volume":"11 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":"121168964","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}
Current processes for providing security and dependability (S&D) in computing systems require a detailed a priori knowledge about the target systems and their environments. However, in many emergent computing scenarios like ubiquitous computing or ambient intelligence, it is not possible to foresee all possible situations that may arise at runtime so the necessary knowledge is not available at development time. In this paper we present the concept of S&D pattern and the artefacts that we use to implement it, as the basis for the automated provision of S&D solutions to running applications in highly dynamic and heterogeneous environments.
{"title":"Patterns for Automated Management of Security and Dependability Solutions","authors":"F. Sánchez-Cid, A. Maña","doi":"10.1109/DEXA.2007.136","DOIUrl":"https://doi.org/10.1109/DEXA.2007.136","url":null,"abstract":"Current processes for providing security and dependability (S&D) in computing systems require a detailed a priori knowledge about the target systems and their environments. However, in many emergent computing scenarios like ubiquitous computing or ambient intelligence, it is not possible to foresee all possible situations that may arise at runtime so the necessary knowledge is not available at development time. In this paper we present the concept of S&D pattern and the artefacts that we use to implement it, as the basis for the automated provision of S&D solutions to running applications in highly dynamic and heterogeneous environments.","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":"116512973","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 concentrate on the problem of integrating heterogeneous, autonomous and evolving sources using conceptual ontologies. We propose an ontology-based approach by an a priori articulation of ontologies. It assumes that each source has its own ontology that references shared domain ontology. To guarantee the autonomy of sources, the shared ontology can be extended/refined locally. We also study the problem of managing the evolution of sources and show its effect on the integrated system. In ontology based integration systems, the evolution is more challenging, because it concerns not only schemas and populations of sources, but also ontologies (local and shared).
{"title":"OntoAPI: An Ontology-based Data Integration Approach by an a Priori Articulation of Ontologies","authors":"Ladjel Bellatreche, G. Pierra","doi":"10.1109/DEXA.2007.152","DOIUrl":"https://doi.org/10.1109/DEXA.2007.152","url":null,"abstract":"In this paper, we concentrate on the problem of integrating heterogeneous, autonomous and evolving sources using conceptual ontologies. We propose an ontology-based approach by an a priori articulation of ontologies. It assumes that each source has its own ontology that references shared domain ontology. To guarantee the autonomy of sources, the shared ontology can be extended/refined locally. We also study the problem of managing the evolution of sources and show its effect on the integrated system. In ontology based integration systems, the evolution is more challenging, because it concerns not only schemas and populations of sources, but also ontologies (local and shared).","PeriodicalId":314834,"journal":{"name":"18th International Workshop on Database and Expert Systems Applications (DEXA 2007)","volume":"18 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":"134438993","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}
Hao Wang, Yuyi Ou, Jie Ling, Xiang Xu, He-qing Guo
As a continuative effort of our WICS'05 paper, a new certified Email protocol is proposed. Email is a standard communication method nowadays but certified email is poorly developed and has very limited application. A certified email protocol assures non-repudiability which means that if the email is successfully sent, the sender cannot deny s/he has actually sent the mail and the recipient cannot deny s/he has actually received it. Our protocol uses an efficient RSA-based convertible signature with non- interactive partial signature proof method and additively split signing secret key.
{"title":"A New Certified Email Protocol","authors":"Hao Wang, Yuyi Ou, Jie Ling, Xiang Xu, He-qing Guo","doi":"10.1109/DEXA.2007.117","DOIUrl":"https://doi.org/10.1109/DEXA.2007.117","url":null,"abstract":"As a continuative effort of our WICS'05 paper, a new certified Email protocol is proposed. Email is a standard communication method nowadays but certified email is poorly developed and has very limited application. A certified email protocol assures non-repudiability which means that if the email is successfully sent, the sender cannot deny s/he has actually sent the mail and the recipient cannot deny s/he has actually received it. Our protocol uses an efficient RSA-based convertible signature with non- interactive partial signature proof method and additively split signing secret key.","PeriodicalId":314834,"journal":{"name":"18th International Workshop on Database and Expert Systems Applications (DEXA 2007)","volume":"37 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":"123086443","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 the paper we have studied the application of document sets categorization and different features combination in the summarization. The most important work is that we implement an improved extractive summarizer, which analyzes the document sets and decides the categories of the documents using different summarization strategies. The novel summarizer with categorization has confirmed better than summarizer without categorization.
{"title":"A Novel Approach to Multi-document Summarization","authors":"Li-qing Qiu, Bin Pang, Sai-Qun Lin, Peng Chen","doi":"10.1109/DEXA.2007.32","DOIUrl":"https://doi.org/10.1109/DEXA.2007.32","url":null,"abstract":"In the paper we have studied the application of document sets categorization and different features combination in the summarization. The most important work is that we implement an improved extractive summarizer, which analyzes the document sets and decides the categories of the documents using different summarization strategies. The novel summarizer with categorization has confirmed better than summarizer without categorization.","PeriodicalId":314834,"journal":{"name":"18th International Workshop on Database and Expert Systems Applications (DEXA 2007)","volume":"233 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":"132924582","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
扫码关注我们
求助内容：
应助结果提醒方式：