Pub Date : 2009-04-22DOI: 10.1109/RCIS.2009.5089274
M. Nieminen, Tomi D. Räty
The Single Location Surveillance Point (SLSP) is a multi-sensor surveillance system that supports human security personnel in monitoring a physical indoors location. The system's Logical Decision Making Server (LDMS) component features rule-based automated logical deduction capabilities used for detecting threats and reacting to them. We have constructed a representation format for user definable surveillance rules based on the Extensible Markup Language (XML), with the aim of providing a solution that is both human-readable and expressive enough to support the features of the SLSP system. The syntax is capable of representing complex logical rules consisting of multiple conditions and reactive actions. The design features a vocabulary for rule definition, specific to the capabilities of the SLSP system. A prototype rule set has been successfully developed as a part of an SLSP prototype implementation.
{"title":"Representing user definable rules for decision making in The Single Location Surveillance Point","authors":"M. Nieminen, Tomi D. Räty","doi":"10.1109/RCIS.2009.5089274","DOIUrl":"https://doi.org/10.1109/RCIS.2009.5089274","url":null,"abstract":"The Single Location Surveillance Point (SLSP) is a multi-sensor surveillance system that supports human security personnel in monitoring a physical indoors location. The system's Logical Decision Making Server (LDMS) component features rule-based automated logical deduction capabilities used for detecting threats and reacting to them. We have constructed a representation format for user definable surveillance rules based on the Extensible Markup Language (XML), with the aim of providing a solution that is both human-readable and expressive enough to support the features of the SLSP system. The syntax is capable of representing complex logical rules consisting of multiple conditions and reactive actions. The design features a vocabulary for rule definition, specific to the capabilities of the SLSP system. A prototype rule set has been successfully developed as a part of an SLSP prototype implementation.","PeriodicalId":180106,"journal":{"name":"2009 Third International Conference on Research Challenges in Information Science","volume":"58 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":"121452672","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.5089280
R. Saidi, A. Front, D. Rieu, M. Fredj, S. Mouline
Component-Based Development Methods (CBDM) become largely adopted and used. They replace the traditional methods by the introduction, in their development lifecycle, of two processes: design for reuse and design by reuse. However, these two processes are not clearly established and are combined in the majority of the CBDM. This paper aims to propose an approach to extend a CBDM by the reuse processes, using the Symphony method as a reference. A special interest is given to the reuse of Business Component for which we propose a conceptual model based on the variability concept that we consider a key property in a reuse process.
{"title":"Component-Based Development: Extension with Business Component reuse","authors":"R. Saidi, A. Front, D. Rieu, M. Fredj, S. Mouline","doi":"10.1109/RCIS.2009.5089280","DOIUrl":"https://doi.org/10.1109/RCIS.2009.5089280","url":null,"abstract":"Component-Based Development Methods (CBDM) become largely adopted and used. They replace the traditional methods by the introduction, in their development lifecycle, of two processes: design for reuse and design by reuse. However, these two processes are not clearly established and are combined in the majority of the CBDM. This paper aims to propose an approach to extend a CBDM by the reuse processes, using the Symphony method as a reference. A special interest is given to the reuse of Business Component for which we propose a conceptual model based on the variability concept that we consider a key property in a reuse process.","PeriodicalId":180106,"journal":{"name":"2009 Third International Conference on Research Challenges in Information Science","volume":"60 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":"131395590","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.5089305
Ana Dias, Vasco Amaral, J. Araújo
Requirements Engineering (RE) is the branch of Software Engineering dealing with requirements for software systems. A software requirement is a property which must be exhibited by software developed or adapted to solve a particular problem. Within RE, there are several branches of methodologies for obtaining requirements, among which we have Goal-Oriented Requirements Engineering (GORE), that uses goals to treat requirements.
{"title":"Towards a Domain Specific Language for a Goal-Oriented approach based on KAOS","authors":"Ana Dias, Vasco Amaral, J. Araújo","doi":"10.1109/RCIS.2009.5089305","DOIUrl":"https://doi.org/10.1109/RCIS.2009.5089305","url":null,"abstract":"Requirements Engineering (RE) is the branch of Software Engineering dealing with requirements for software systems. A software requirement is a property which must be exhibited by software developed or adapted to solve a particular problem. Within RE, there are several branches of methodologies for obtaining requirements, among which we have Goal-Oriented Requirements Engineering (GORE), that uses goals to treat requirements.","PeriodicalId":180106,"journal":{"name":"2009 Third International Conference on Research Challenges in Information Science","volume":"75 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":"133709702","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.5089291
Lili Marziana Abdullah, J. Verner
Organizations are increasingly outsourcing the development of strategic IT systems to external vendors. Because of the importance of such systems to a client organization, unaddressed risks that develop into serious problems may have a huge negative impact on the organization. There is much reported research on IT development and IT outsourcing risk, and risk management. However, research on risk in outsourced strategic IT system development, from the client perspective, have largely been ignored. We developed a risk framework for outsourced strategic IT development based on the literature. In this paper we review three reported cases of unsuccessful strategic IT system development that provide an initial validation of our outsourced risk framework. A number of risks critical to a client are identified. These risks fall into several categories associated with organizational environment, team, user, complexity, contract, requirements, planning and control, and execution. If critical outsourcing risks are clearly understood by a client organization then strategies for managing such risks can be implemented.
{"title":"Outsourced strategic IT systems development risk","authors":"Lili Marziana Abdullah, J. Verner","doi":"10.1109/RCIS.2009.5089291","DOIUrl":"https://doi.org/10.1109/RCIS.2009.5089291","url":null,"abstract":"Organizations are increasingly outsourcing the development of strategic IT systems to external vendors. Because of the importance of such systems to a client organization, unaddressed risks that develop into serious problems may have a huge negative impact on the organization. There is much reported research on IT development and IT outsourcing risk, and risk management. However, research on risk in outsourced strategic IT system development, from the client perspective, have largely been ignored. We developed a risk framework for outsourced strategic IT development based on the literature. In this paper we review three reported cases of unsuccessful strategic IT system development that provide an initial validation of our outsourced risk framework. A number of risks critical to a client are identified. These risks fall into several categories associated with organizational environment, team, user, complexity, contract, requirements, planning and control, and execution. If critical outsourcing risks are clearly understood by a client organization then strategies for managing such risks can be implemented.","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":"123676150","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.5089263
R. Deneckère, Elena Kornyshova, C. Rolland
The MAP model was introduced in information system engineering in order to model processes on a flexible way. The intentional level of this model helps an engineer to execute a process with a strong relationship to the situation of the project at hand. In the literature, attempts for having a practical use of maps are not numerous. Our aim is to enhance the guidance mechanisms of the process execution by reusing graph algorithms. After clarifying the existing relationship between graphs and maps, we improve the MAP model by adding qualitative criteria. We then offer a way to express maps with graphs and propose to use Graph theory algorithms to offer an automatic guidance of the map. We illustrate our proposal by an example and discuss its limitations.
{"title":"Enhancing the guidance of the intentional model “MAP”: Graph theory application","authors":"R. Deneckère, Elena Kornyshova, C. Rolland","doi":"10.1109/RCIS.2009.5089263","DOIUrl":"https://doi.org/10.1109/RCIS.2009.5089263","url":null,"abstract":"The MAP model was introduced in information system engineering in order to model processes on a flexible way. The intentional level of this model helps an engineer to execute a process with a strong relationship to the situation of the project at hand. In the literature, attempts for having a practical use of maps are not numerous. Our aim is to enhance the guidance mechanisms of the process execution by reusing graph algorithms. After clarifying the existing relationship between graphs and maps, we improve the MAP model by adding qualitative criteria. We then offer a way to express maps with graphs and propose to use Graph theory algorithms to offer an automatic guidance of the map. We illustrate our proposal by an example and discuss its limitations.","PeriodicalId":180106,"journal":{"name":"2009 Third International Conference on Research Challenges in Information Science","volume":"252 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":"122704987","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.5089278
Carlos Cares, Xavier Franch
The mobile office devices market is currently growing, mainly due to the descending cost of wireless technology as well as the high diversity of functions and features covered. Diversity and proliferation become a hard problem when a person or organization aims at selecting the appropriate device for their particular needs. We propose here a framework for producing device recommendations based on personal or business needs. The framework is articulated through an architecture that includes subsystems for data extraction, recommendation and personalization. All these subsystems operate upon a goaloriented knowledge base whose presentation is the subject of this paper. Our approach is built upon three independent models: a market model, which contains descriptions of the current devices offered in the marketplace; a domain model, which states the needs of the person or organization; a mediator model, which describes the types of devices available. We show the actors and processes around these models. Last, we present a prototype that acts as proof-of-concept of the recommender system.
{"title":"Selecting mobile office devices using a goal-oriented approach","authors":"Carlos Cares, Xavier Franch","doi":"10.1109/RCIS.2009.5089278","DOIUrl":"https://doi.org/10.1109/RCIS.2009.5089278","url":null,"abstract":"The mobile office devices market is currently growing, mainly due to the descending cost of wireless technology as well as the high diversity of functions and features covered. Diversity and proliferation become a hard problem when a person or organization aims at selecting the appropriate device for their particular needs. We propose here a framework for producing device recommendations based on personal or business needs. The framework is articulated through an architecture that includes subsystems for data extraction, recommendation and personalization. All these subsystems operate upon a goaloriented knowledge base whose presentation is the subject of this paper. Our approach is built upon three independent models: a market model, which contains descriptions of the current devices offered in the marketplace; a domain model, which states the needs of the person or organization; a mediator model, which describes the types of devices available. We show the actors and processes around these models. Last, we present a prototype that acts as proof-of-concept of the recommender system.","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":"123875978","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.5089265
Yong-Ki Kim, You-Jin Jang, Jae-Woo Chang
GML is a markup language presented as exchange standard for geographic information by the OGC (Open GIS Consortium). In spatial network databases, researches for supporting GML (Geographic Markup Language) can be divided into parsing, storing and retrieval of GML documents. Among them, the study on the storage of GML documents is essential for their efficient retrieval. However there is little research on the storing of GML documents whereas there have been a lot of researches on the storing of XML documents. Because the storage schema designed for XML documents are not appropriate for geographic information, we, in this paper, propose three storage schemas for efficiently storing GML documents including geographic information in order to solve the problem that the XML storage schema store duplicate data and need to search many tables for obtaining elements. In addition, we design and implement a storage manager which can store GML documents using proposed GML storage schema.
{"title":"Design and implementation of efficient storage schemas and low-level storage manager for GML documents","authors":"Yong-Ki Kim, You-Jin Jang, Jae-Woo Chang","doi":"10.1109/RCIS.2009.5089265","DOIUrl":"https://doi.org/10.1109/RCIS.2009.5089265","url":null,"abstract":"GML is a markup language presented as exchange standard for geographic information by the OGC (Open GIS Consortium). In spatial network databases, researches for supporting GML (Geographic Markup Language) can be divided into parsing, storing and retrieval of GML documents. Among them, the study on the storage of GML documents is essential for their efficient retrieval. However there is little research on the storing of GML documents whereas there have been a lot of researches on the storing of XML documents. Because the storage schema designed for XML documents are not appropriate for geographic information, we, in this paper, propose three storage schemas for efficiently storing GML documents including geographic information in order to solve the problem that the XML storage schema store duplicate data and need to search many tables for obtaining elements. In addition, we design and implement a storage manager which can store GML documents using proposed GML storage schema.","PeriodicalId":180106,"journal":{"name":"2009 Third International Conference on Research Challenges in Information Science","volume":"24 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":"127459262","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.5089299
C. Lofi, Wolf-Tilo Balke, Ulrich Güntzer
Skyline Queries have received a lot of attention due to their intuitive query formulation. Following the concept of Pareto optimality all ‘best’ database items satisfying different aspects of the query are returned to the user. However, this often results in huge result set sizes. In everyday's life users face the same problem. But here, when confronted with a too large variety of choices users tend to focus only on some aspects of the attribute space at a time and try to figure out acceptable compromises between these attributes. Such trade-offs are not reflected by the Pareto paradigm. Incorporating them into user preferences and adjusting skyline results accordingly thus needs special algorithms beyond traditional skylining. In this paper we propose a novel algorithm for efficiently incorporating such typical trade-off information into preference orders. Our experiments on both real world and synthetic data sets show the impact of our techniques: impractical skyline sizes efficiently become manageable with a minimum amount of user interaction. Additionally, we also design a method to elicit especially interesting trade-offs promising a high reduction of skyline sizes. At any point, the user can choose whether to provide individual trade-offs, or accept those suggested by the system. The benefit of incorporating trade-offs into the strict Pareto semantics is clear: result sets become manageable, while additionally getting more focused on the users' information needs.
{"title":"Efficient Skyline Refinement using trade-offs","authors":"C. Lofi, Wolf-Tilo Balke, Ulrich Güntzer","doi":"10.1109/RCIS.2009.5089299","DOIUrl":"https://doi.org/10.1109/RCIS.2009.5089299","url":null,"abstract":"Skyline Queries have received a lot of attention due to their intuitive query formulation. Following the concept of Pareto optimality all ‘best’ database items satisfying different aspects of the query are returned to the user. However, this often results in huge result set sizes. In everyday's life users face the same problem. But here, when confronted with a too large variety of choices users tend to focus only on some aspects of the attribute space at a time and try to figure out acceptable compromises between these attributes. Such trade-offs are not reflected by the Pareto paradigm. Incorporating them into user preferences and adjusting skyline results accordingly thus needs special algorithms beyond traditional skylining. In this paper we propose a novel algorithm for efficiently incorporating such typical trade-off information into preference orders. Our experiments on both real world and synthetic data sets show the impact of our techniques: impractical skyline sizes efficiently become manageable with a minimum amount of user interaction. Additionally, we also design a method to elicit especially interesting trade-offs promising a high reduction of skyline sizes. At any point, the user can choose whether to provide individual trade-offs, or accept those suggested by the system. The benefit of incorporating trade-offs into the strict Pareto semantics is clear: result sets become manageable, while additionally getting more focused on the users' information needs.","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":"129147710","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.5089283
Lefteris Moussiades, A. Vakali
Artificial graphs are commonly used for the evaluation of community mining and clustering algorithms. Each artificial graph is assigned a pre-specified clustering, which is compared to clustering solutions obtained by the algorithms under evaluation. Hence, the pre-specified clustering should comply with specifications that are assumed to delimit a good clustering. However, existing construction processes for artificial graphs do not set explicit specifications for the pre-specified clustering. We call these graphs, randomly clustered graphs. Here, we introduce a new class of benchmark graphs which are clustered according to explicit specifications. We call them optimally clustered graphs. We present the basic properties of optimally clustered graphs and propose algorithms for their construction. Experimentally, we compare two community mining algorithms using both randomly and optimally clustered graphs. Results of this evaluation reveal interesting insights both for the algorithms and the artificial graphs.
{"title":"Benchmark graphs for the evaluation of clustering algorithms","authors":"Lefteris Moussiades, A. Vakali","doi":"10.1109/RCIS.2009.5089283","DOIUrl":"https://doi.org/10.1109/RCIS.2009.5089283","url":null,"abstract":"Artificial graphs are commonly used for the evaluation of community mining and clustering algorithms. Each artificial graph is assigned a pre-specified clustering, which is compared to clustering solutions obtained by the algorithms under evaluation. Hence, the pre-specified clustering should comply with specifications that are assumed to delimit a good clustering. However, existing construction processes for artificial graphs do not set explicit specifications for the pre-specified clustering. We call these graphs, randomly clustered graphs. Here, we introduce a new class of benchmark graphs which are clustered according to explicit specifications. We call them optimally clustered graphs. We present the basic properties of optimally clustered graphs and propose algorithms for their construction. Experimentally, we compare two community mining algorithms using both randomly and optimally clustered graphs. Results of this evaluation reveal interesting insights both for the algorithms and the artificial graphs.","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":"115475562","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.5089269
H. Ouchetto, O. Roudiès, M. Fredj
The current components' retrieval tools offer few services to facilitate a relevant search of these components. They are intended for experts having already a good knowledge of the components' catalogues. However, they are still limited for inexperienced users. The crucial problem is to retrieve the components according to the user's requirements. In this context, our contribution aims at analyzing and comparing some existing retrieval approaches and proposing an integrated process of the components retrieval which is user centred.
{"title":"A component retrieval system","authors":"H. Ouchetto, O. Roudiès, M. Fredj","doi":"10.1109/RCIS.2009.5089269","DOIUrl":"https://doi.org/10.1109/RCIS.2009.5089269","url":null,"abstract":"The current components' retrieval tools offer few services to facilitate a relevant search of these components. They are intended for experts having already a good knowledge of the components' catalogues. However, they are still limited for inexperienced users. The crucial problem is to retrieve the components according to the user's requirements. In this context, our contribution aims at analyzing and comparing some existing retrieval approaches and proposing an integrated process of the components retrieval which is user centred.","PeriodicalId":180106,"journal":{"name":"2009 Third International Conference on Research Challenges in Information Science","volume":"56 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":"127825691","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
扫码关注我们
求助内容：
应助结果提醒方式：