Pub Date : 2009-04-22DOI: 10.1109/RCIS.2009.5089297
M. Davoudi, F. S. Aliee
Enterprise Architecture (EA) as a discipline with numerous and enterprise-wide models, can support decision making on several enterprise-wide issues. In order to provide such a capability, enterprise architecture models should be amenable to analysis of various utilities and quality attributes. This paper provides a method towards enterprise architecture analysis. This approach is based on Analytical Hierarchy Process (AHP) and considers the situation of the enterprise in giving weight to the different criteria and sub-criteria of each utility. It proposes a quantitative method of measuring quality attribute achievement for each scenario using AHP based on the knowledge and experience of EA experts and domain experts and demonstrates its efficacy by applying it to a case study.
{"title":"A new AHP-based approach towards Enterprise Architecture quality attribute analysis","authors":"M. Davoudi, F. S. Aliee","doi":"10.1109/RCIS.2009.5089297","DOIUrl":"https://doi.org/10.1109/RCIS.2009.5089297","url":null,"abstract":"Enterprise Architecture (EA) as a discipline with numerous and enterprise-wide models, can support decision making on several enterprise-wide issues. In order to provide such a capability, enterprise architecture models should be amenable to analysis of various utilities and quality attributes. This paper provides a method towards enterprise architecture analysis. This approach is based on Analytical Hierarchy Process (AHP) and considers the situation of the enterprise in giving weight to the different criteria and sub-criteria of each utility. It proposes a quantitative method of measuring quality attribute achievement for each scenario using AHP based on the knowledge and experience of EA experts and domain experts and demonstrates its efficacy by applying it to a case study.","PeriodicalId":180106,"journal":{"name":"2009 Third International Conference on Research Challenges in Information Science","volume":"175 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2009-04-22","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"131908978","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 : 2009-04-22DOI: 10.1109/RCIS.2009.5089266
A.A.A. Slimane, M. Kirsch-Pinheiro, C. Souveyet
Services based applications are considered as support for both Business-to-Consumer interactions and Business-to-Business collaborations. However, Service Oriented Computing (SOC) remains at the software level and business people cannot exploit fully its benefits. In this context, the Intentional Service Oriented Architecture (ISOA) suggests a move from the function-driven Service Oriented Computing (SOC) to intention-driven SOC in order to provide service description understandable by business practitioners. Intentional services represented business oriented services in an intentional perspective, i.e. focusing on the goal it allows achieving rather on the functionality it performs. However, current intentional service omits the quality of service (QoS) dimension. In this paper, we focus on the quality elicitation process to apply for (1) capturing customers' Quality requirements and (2) describing the quality of service on an intentional service specification. We consider that the elicitation of the quality of a service during the requirements engineering (RE) phase can contribute to a customer-centered adaptability of service composition by selecting the service composition that will satisfy customers' quality requirements. The aim is to provide a goal driven approach to reason on quality for both documenting intentional service and discovering the quality requirements of business customers.
{"title":"Goal reasoning for quality elicitation in the ISOA approach","authors":"A.A.A. Slimane, M. Kirsch-Pinheiro, C. Souveyet","doi":"10.1109/RCIS.2009.5089266","DOIUrl":"https://doi.org/10.1109/RCIS.2009.5089266","url":null,"abstract":"Services based applications are considered as support for both Business-to-Consumer interactions and Business-to-Business collaborations. However, Service Oriented Computing (SOC) remains at the software level and business people cannot exploit fully its benefits. In this context, the Intentional Service Oriented Architecture (ISOA) suggests a move from the function-driven Service Oriented Computing (SOC) to intention-driven SOC in order to provide service description understandable by business practitioners. Intentional services represented business oriented services in an intentional perspective, i.e. focusing on the goal it allows achieving rather on the functionality it performs. However, current intentional service omits the quality of service (QoS) dimension. In this paper, we focus on the quality elicitation process to apply for (1) capturing customers' Quality requirements and (2) describing the quality of service on an intentional service specification. We consider that the elicitation of the quality of a service during the requirements engineering (RE) phase can contribute to a customer-centered adaptability of service composition by selecting the service composition that will satisfy customers' quality requirements. The aim is to provide a goal driven approach to reason on quality for both documenting intentional service and discovering the quality requirements of business customers.","PeriodicalId":180106,"journal":{"name":"2009 Third International Conference on Research Challenges in Information Science","volume":"38 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2009-04-22","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"115269134","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 : 2009-04-22DOI: 10.1109/RCIS.2009.5089311
M. Novotný, F. Zavoral
The trust management in P2P networks allow to establish the trust relationships among the peers and decide whether the considered transaction will be realized. It tries to ensure safety in the extremely unsafe environments of P2P networks. In this paper we focus on the formal description of requirements of trusted P2P networks and we propose the model which is able to measure them. Our model should be adaptable to the previously published methods and allows to compare them. The fundamentals of our model are trust matrices which record the trust relationships between peers. We define similarity between trust matrices for purpose of comparison of different management systems. On the basis of this similarity we propose the criterion which is able to measure successfulness of trust management.
{"title":"Matrix model of trust management in P2P networks","authors":"M. Novotný, F. Zavoral","doi":"10.1109/RCIS.2009.5089311","DOIUrl":"https://doi.org/10.1109/RCIS.2009.5089311","url":null,"abstract":"The trust management in P2P networks allow to establish the trust relationships among the peers and decide whether the considered transaction will be realized. It tries to ensure safety in the extremely unsafe environments of P2P networks. In this paper we focus on the formal description of requirements of trusted P2P networks and we propose the model which is able to measure them. Our model should be adaptable to the previously published methods and allows to compare them. The fundamentals of our model are trust matrices which record the trust relationships between peers. We define similarity between trust matrices for purpose of comparison of different management systems. On the basis of this similarity we propose the criterion which is able to measure successfulness of trust management.","PeriodicalId":180106,"journal":{"name":"2009 Third International Conference on Research Challenges in Information Science","volume":"11 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2009-04-22","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"116793453","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 : 2009-04-22DOI: 10.1109/RCIS.2009.5089294
María José Escalona Cuaresma, J. Gutiérrez, M. Risoto, Isabel M. Ramos, J. Torres
The test phase is one of the most important phases in software development. However, in practice, little research has been carried out in this field. Model-Driven Engineering is a new paradigm that can help to minimize test cases generation costs and can ensure quality of results. This paper presents the application of the MDE paradigm in the systematic, even automatic, generation of System Test Software.
{"title":"An approach for Model-Driven test generation","authors":"María José Escalona Cuaresma, J. Gutiérrez, M. Risoto, Isabel M. Ramos, J. Torres","doi":"10.1109/RCIS.2009.5089294","DOIUrl":"https://doi.org/10.1109/RCIS.2009.5089294","url":null,"abstract":"The test phase is one of the most important phases in software development. However, in practice, little research has been carried out in this field. Model-Driven Engineering is a new paradigm that can help to minimize test cases generation costs and can ensure quality of results. This paper presents the application of the MDE paradigm in the systematic, even automatic, generation of System Test Software.","PeriodicalId":180106,"journal":{"name":"2009 Third International Conference on Research Challenges in Information Science","volume":"422 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2009-04-22","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"133876061","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 : 2009-04-22DOI: 10.1109/RCIS.2009.5089282
Bi-Ru Dai, YangChih Lin
Classification is an important issue in data mining, and decision tree is one of the most popular techniques for classification analysis. Some data sources contain private personal information that people are unwilling to reveal. The disclosure of person-specific data is possible to endanger thousands of people, and therefore the dataset should be protected before it is released for mining. However, techniques to hide private information usually modify the original dataset without considering influences on the prediction accuracy of a classification model. In this paper, we propose an algorithm to protect personal privacy for classification model based on decision tree. Our goal is to hide all person-specific information with minimized data perturbation. Furthermore, the prediction capability of the decision tree classifier can be maintained. As demonstrated in the experiments, the proposed algorithm can successfully hide private information with fewer disturbances of the classifier.
{"title":"A decision tree based quasi-identifier perturbation technique for preserving privacy in data mining","authors":"Bi-Ru Dai, YangChih Lin","doi":"10.1109/RCIS.2009.5089282","DOIUrl":"https://doi.org/10.1109/RCIS.2009.5089282","url":null,"abstract":"Classification is an important issue in data mining, and decision tree is one of the most popular techniques for classification analysis. Some data sources contain private personal information that people are unwilling to reveal. The disclosure of person-specific data is possible to endanger thousands of people, and therefore the dataset should be protected before it is released for mining. However, techniques to hide private information usually modify the original dataset without considering influences on the prediction accuracy of a classification model. In this paper, we propose an algorithm to protect personal privacy for classification model based on decision tree. Our goal is to hide all person-specific information with minimized data perturbation. Furthermore, the prediction capability of the decision tree classifier can be maintained. As demonstrated in the experiments, the proposed algorithm can successfully hide private information with fewer disturbances of the classifier.","PeriodicalId":180106,"journal":{"name":"2009 Third International Conference on Research Challenges in Information Science","volume":"47 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2009-04-22","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"134351124","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 : 2009-04-22DOI: 10.1109/RCIS.2009.5089300
Wolf-Tilo Balke, SungRan Cho
Facing today's information flood needs efficient means for personalization. Therefore XML query processing over large volumes of data needs to make the most out of already spent processing time by caching common (sub)expressions for reuse. This is especially promising for the new paradigm of personalized preference queries. Here a sequence of possible query relaxations is a-priori determined by the users' preferences. Structural and value-based preferences thus define a query process where predicates are progressively relaxed until a suitable set of best possible results has been retrieved. To improve evaluation times for such query processes we argue that caching intermediate join results of structural preference queries is especially effective, because subsequent queries will always be subsumed by some previously cached queries to a certain extent. In this paper we propose a structural join-based caching scheme that allows preference queries to reuse the most beneficial structural join results of all previous queries. We first design a twig cache along with effective strategies for cache management. Moreover, we present a selection algorithm for join orders using cached data and the preference-induced sequence of future queries to select optimal query evaluation plans. Our benchmark experiments show that by using our twig caches preference query processing can be essentially sped up.
{"title":"Efficient evaluation of preference query processes using twig caches","authors":"Wolf-Tilo Balke, SungRan Cho","doi":"10.1109/RCIS.2009.5089300","DOIUrl":"https://doi.org/10.1109/RCIS.2009.5089300","url":null,"abstract":"Facing today's information flood needs efficient means for personalization. Therefore XML query processing over large volumes of data needs to make the most out of already spent processing time by caching common (sub)expressions for reuse. This is especially promising for the new paradigm of personalized preference queries. Here a sequence of possible query relaxations is a-priori determined by the users' preferences. Structural and value-based preferences thus define a query process where predicates are progressively relaxed until a suitable set of best possible results has been retrieved. To improve evaluation times for such query processes we argue that caching intermediate join results of structural preference queries is especially effective, because subsequent queries will always be subsumed by some previously cached queries to a certain extent. In this paper we propose a structural join-based caching scheme that allows preference queries to reuse the most beneficial structural join results of all previous queries. We first design a twig cache along with effective strategies for cache management. Moreover, we present a selection algorithm for join orders using cached data and the preference-induced sequence of future queries to select optimal query evaluation plans. Our benchmark experiments show that by using our twig caches preference query processing can be essentially sped up.","PeriodicalId":180106,"journal":{"name":"2009 Third International Conference on Research Challenges in Information Science","volume":"36 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2009-04-22","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"127529967","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 : 2009-04-22DOI: 10.1109/RCIS.2009.5089272
A. Vizcaíno, Javier Portillo-Rodríguez, J. P. Soto, M. Piattini, O. Kusche
This paper presents a recommendation algorithm with which to recommend Knowledge Objects within a Community of Practice (CoP). It is based on a trust model that takes into account not only previous experience of a Knowledge Source, but also the position of the respective member in the community, along with that member's level of expertise. Furthermore, the system attempts to emulate the principle of human intuition. The combination of these factors, which can be adjusted by means of weight factors, enables the system to make decisions based on a calculated trust value even if a new member is introduced into the community or the entire community is newly created. To demonstrate the capabilities of this algorithm, a tool employing a multi-agent architecture has been developed which is also presented.
本文提出了一种推荐算法，用于在实践社区(Community of Practice, CoP)中推荐知识对象。它基于信任模型，该模型不仅考虑了知识库以前的经验，还考虑了各自成员在社区中的位置，以及该成员的专业知识水平。此外，该系统试图模仿人类直觉的原理。这些因素的组合可以通过权重因子进行调整，使得系统即使在社区中引入新成员或整个社区是新创建的情况下，也可以根据计算出的信任值做出决策。为了证明该算法的能力，还开发了一个采用多智能体体系结构的工具。
{"title":"A recommendation algorithm for Knowledge Objects based on a trust model","authors":"A. Vizcaíno, Javier Portillo-Rodríguez, J. P. Soto, M. Piattini, O. Kusche","doi":"10.1109/RCIS.2009.5089272","DOIUrl":"https://doi.org/10.1109/RCIS.2009.5089272","url":null,"abstract":"This paper presents a recommendation algorithm with which to recommend Knowledge Objects within a Community of Practice (CoP). It is based on a trust model that takes into account not only previous experience of a Knowledge Source, but also the position of the respective member in the community, along with that member's level of expertise. Furthermore, the system attempts to emulate the principle of human intuition. The combination of these factors, which can be adjusted by means of weight factors, enables the system to make decisions based on a calculated trust value even if a new member is introduced into the community or the entire community is newly created. To demonstrate the capabilities of this algorithm, a tool employing a multi-agent architecture has been developed which is also presented.","PeriodicalId":180106,"journal":{"name":"2009 Third International Conference on Research Challenges in Information Science","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2009-04-22","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"130745624","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 : 2009-04-22DOI: 10.1109/RCIS.2009.5089303
M. Mahrsi, Sylvie Vignes, G. Hébrail, M. Picard
With the forthcoming deployment of smart metering infrastructures, it will be possible to extract data describing usage and functioning of home devices locally (in residences). Such data can then be streamed continuously and in real-time to a DSMS (Data Stream Management System) for further processing and knowledge extraction. In order for the data to be streamed, their structure and semantics have to be properly defined through a data model. To our knowledge, already existing standards do not include modeling of home devices and their behavior. In this paper, we describe a data stream model that covers these aspects. We also provide basic experimental results based on a data stream generator that we developed and used to test a DSMS.
{"title":"A data stream model for home device description","authors":"M. Mahrsi, Sylvie Vignes, G. Hébrail, M. Picard","doi":"10.1109/RCIS.2009.5089303","DOIUrl":"https://doi.org/10.1109/RCIS.2009.5089303","url":null,"abstract":"With the forthcoming deployment of smart metering infrastructures, it will be possible to extract data describing usage and functioning of home devices locally (in residences). Such data can then be streamed continuously and in real-time to a DSMS (Data Stream Management System) for further processing and knowledge extraction. In order for the data to be streamed, their structure and semantics have to be properly defined through a data model. To our knowledge, already existing standards do not include modeling of home devices and their behavior. In this paper, we describe a data stream model that covers these aspects. We also provide basic experimental results based on a data stream generator that we developed and used to test a DSMS.","PeriodicalId":180106,"journal":{"name":"2009 Third International Conference on Research Challenges in Information Science","volume":"16 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2009-04-22","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"133058328","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 : 2009-04-22DOI: 10.1109/RCIS.2009.5089277
Ismail Jellouli, M. E. Mohajir
Semantic annotation is a preliminary step towards the Semantic Web. In the Web scale, the large amounts of heterogonous data sources make manual annotation impracticable; automation is therefore unavoidable. Our work aims to develop a solution for automatic semantic annotation. We focus on data-rich web pages, i.e., pages that contain a list of records. All these pages are related to a particular domain. Most of data-rich web pages are generated automatically according to a template. Many solutions, based on wrapper induction techniques have been established to automatically extract data contained in this kind of pages. The solution we propose follows the data extraction phase. It transforms the data into a set of RDF assertions expressed in accordance with an ontology of the domain of interest. Our approach is based on instances. This means that starting from a set of instances we try to find the concept or property of the ontology that has the best match. We aim here to present the details of our approach and discuss the results produced in the primary experiments which turn to be promising.
{"title":"Towards automatic semantic annotation of data rich Web pages","authors":"Ismail Jellouli, M. E. Mohajir","doi":"10.1109/RCIS.2009.5089277","DOIUrl":"https://doi.org/10.1109/RCIS.2009.5089277","url":null,"abstract":"Semantic annotation is a preliminary step towards the Semantic Web. In the Web scale, the large amounts of heterogonous data sources make manual annotation impracticable; automation is therefore unavoidable. Our work aims to develop a solution for automatic semantic annotation. We focus on data-rich web pages, i.e., pages that contain a list of records. All these pages are related to a particular domain. Most of data-rich web pages are generated automatically according to a template. Many solutions, based on wrapper induction techniques have been established to automatically extract data contained in this kind of pages. The solution we propose follows the data extraction phase. It transforms the data into a set of RDF assertions expressed in accordance with an ontology of the domain of interest. Our approach is based on instances. This means that starting from a set of instances we try to find the concept or property of the ontology that has the best match. We aim here to present the details of our approach and discuss the results produced in the primary experiments which turn to be promising.","PeriodicalId":180106,"journal":{"name":"2009 Third International Conference on Research Challenges in Information Science","volume":"84 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2009-04-22","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"122078420","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 : 2009-04-22DOI: 10.1109/RCIS.2009.5089270
D. Karagiannis
This paper provides a praxis report on how semantic technologies introduce the usage of “smart” and “adaptive” semantic workflows fostering efficient involvement of the actors from E-Government area in the service delivery process. Usage of semantic workflows is presented through use cases: a.) Semantic Service Discovery and Binding and b.) Business Rules Approach as a result of EC research projects — LD-CAST and FIT
{"title":"Modelling semantic workflows for E-Government applications","authors":"D. Karagiannis","doi":"10.1109/RCIS.2009.5089270","DOIUrl":"https://doi.org/10.1109/RCIS.2009.5089270","url":null,"abstract":"This paper provides a praxis report on how semantic technologies introduce the usage of “smart” and “adaptive” semantic workflows fostering efficient involvement of the actors from E-Government area in the service delivery process. Usage of semantic workflows is presented through use cases: a.) Semantic Service Discovery and Binding and b.) Business Rules Approach as a result of EC research projects — LD-CAST and FIT","PeriodicalId":180106,"journal":{"name":"2009 Third International Conference on Research Challenges in Information Science","volume":"300 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2009-04-22","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"115956715","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
扫码关注我们
求助内容：
应助结果提醒方式：