Pub Date : 2002-11-06DOI: 10.1109/SCCC.2002.1173188
Adriana Marotta, R. Ruggia
This paper addresses DW design problems, with the goal of improving the DW logical design process. Some of the existing work in transformation oriented methodologies for DW design construct the DW starting from an entity-relationship model of the source database, and arrive to a conceptual or high-level-logical dimensional model of the DW. We propose a mechanism for obtaining the DW logical schema through pre-defined transformations applied to the source logical schema, which can be used as a complement to the existing DW design methodologies. The transformations allow a refined logical design of the DW and provide a trace of the design and a mapping between the source and DW logical structures.
{"title":"Data warehouse design: a schema-transformation approach","authors":"Adriana Marotta, R. Ruggia","doi":"10.1109/SCCC.2002.1173188","DOIUrl":"https://doi.org/10.1109/SCCC.2002.1173188","url":null,"abstract":"This paper addresses DW design problems, with the goal of improving the DW logical design process. Some of the existing work in transformation oriented methodologies for DW design construct the DW starting from an entity-relationship model of the source database, and arrive to a conceptual or high-level-logical dimensional model of the DW. We propose a mechanism for obtaining the DW logical schema through pre-defined transformations applied to the source logical schema, which can be used as a complement to the existing DW design methodologies. The transformations allow a refined logical design of the DW and provide a trace of the design and a mapping between the source and DW logical structures.","PeriodicalId":130951,"journal":{"name":"12th International Conference of the Chilean Computer Science Society, 2002. Proceedings.","volume":"4 5","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2002-11-06","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"120914365","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 : 2002-11-06DOI: 10.1109/SCCC.2002.1173172
Juan F. Martin, L. Chiang
A Webcam-based vision system for performing image processing in real time in a restricted environment is presented. A color based image segmentation algorithm is the fundamental part of the system. Algorithm efficiency was very important due to hardware limitations. This led to a simple and cost-effective vision system that is able to detect and identify several mobile robots through successive frames. The main achievements of the presented system can be described as robust object detection under relative constant illumination and sufficient refresh rate at image processing to evaluate position and direction of movement of target objects with a rough idea of speed.
{"title":"Cost effective vision system for mobile robots","authors":"Juan F. Martin, L. Chiang","doi":"10.1109/SCCC.2002.1173172","DOIUrl":"https://doi.org/10.1109/SCCC.2002.1173172","url":null,"abstract":"A Webcam-based vision system for performing image processing in real time in a restricted environment is presented. A color based image segmentation algorithm is the fundamental part of the system. Algorithm efficiency was very important due to hardware limitations. This led to a simple and cost-effective vision system that is able to detect and identify several mobile robots through successive frames. The main achievements of the presented system can be described as robust object detection under relative constant illumination and sufficient refresh rate at image processing to evaluate position and direction of movement of target objects with a rough idea of speed.","PeriodicalId":130951,"journal":{"name":"12th International Conference of the Chilean Computer Science Society, 2002. Proceedings.","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2002-11-06","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"131060339","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 : 2002-11-06DOI: 10.1109/SCCC.2002.1173193
Pablo A. Straub, D. Guzmán
Defined software processes using quality models like CMM have proven to be effective means to develop software in large organizations. The effort required to define or tailor a process for a very small group may easily exceed available resources. Our aim is to define a software process compatible with CMM level 3 for a 1-dozen engineer organization, without committing significant resources. We have defined a model for processes based upon small process elements and a collaborative method to incrementally describe processes from actual practice. The model is implemented using XML.
{"title":"Incremental, collaborative software process improvement in a tiny software group","authors":"Pablo A. Straub, D. Guzmán","doi":"10.1109/SCCC.2002.1173193","DOIUrl":"https://doi.org/10.1109/SCCC.2002.1173193","url":null,"abstract":"Defined software processes using quality models like CMM have proven to be effective means to develop software in large organizations. The effort required to define or tailor a process for a very small group may easily exceed available resources. Our aim is to define a software process compatible with CMM level 3 for a 1-dozen engineer organization, without committing significant resources. We have defined a model for processes based upon small process elements and a collaborative method to incrementally describe processes from actual practice. The model is implemented using XML.","PeriodicalId":130951,"journal":{"name":"12th International Conference of the Chilean Computer Science Society, 2002. Proceedings.","volume":"29 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2002-11-06","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"126015508","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 : 2002-11-06DOI: 10.1109/SCCC.2002.1173197
A. Cechich, Manuel E. Prieto
Current visual programming environments offer a variety of composition possibilities. Most of these environments provide drag and drop facilities of components on a form and let the interaction between components be defined by selecting suitable components and checking the incompatibilities of the resulting composition. Thus, the special nature of component-based development environments induces requirements for capabilities such as identification, retrieval and integration of components. We propose a framework for comparing visual component composition techniques and environments. We identify basic and specific features that compose the framework and we show its use by comparing four visual composition environments.
{"title":"Comparing visual component composition environments","authors":"A. Cechich, Manuel E. Prieto","doi":"10.1109/SCCC.2002.1173197","DOIUrl":"https://doi.org/10.1109/SCCC.2002.1173197","url":null,"abstract":"Current visual programming environments offer a variety of composition possibilities. Most of these environments provide drag and drop facilities of components on a form and let the interaction between components be defined by selecting suitable components and checking the incompatibilities of the resulting composition. Thus, the special nature of component-based development environments induces requirements for capabilities such as identification, retrieval and integration of components. We propose a framework for comparing visual component composition techniques and environments. We identify basic and specific features that compose the framework and we show its use by comparing four visual composition environments.","PeriodicalId":130951,"journal":{"name":"12th International Conference of the Chilean Computer Science Society, 2002. Proceedings.","volume":"12 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2002-11-06","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"121624591","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 : 2002-11-06DOI: 10.1109/SCCC.2002.1173200
Diego Garat, Dina Wonsever
In this paper we describe a constraint analyser for contextual rules. Contextual rules constitute a rule-based formalism that allows rewriting of terminals and/or non terminal sequences taking in account their context. The formalism allows also to refer to portions of text by means of exclusion zones, that is, patterns that are only specified by a maximum length and a set of not allowed categories. The constraint approach reveals particularly useful for this type of rules, as decisions can be taken under the hypothesis of non existence of the excluded categories. If these categories are finally deduced, all other categories inferred upon the non existence of the former ones are automatically eliminated. The parser has been implemented using Constraint, Handling Rules. Some results with a set of rules oriented to the segmentation of texts in propositions are shown.
{"title":"A constraint parser for contextual rules","authors":"Diego Garat, Dina Wonsever","doi":"10.1109/SCCC.2002.1173200","DOIUrl":"https://doi.org/10.1109/SCCC.2002.1173200","url":null,"abstract":"In this paper we describe a constraint analyser for contextual rules. Contextual rules constitute a rule-based formalism that allows rewriting of terminals and/or non terminal sequences taking in account their context. The formalism allows also to refer to portions of text by means of exclusion zones, that is, patterns that are only specified by a maximum length and a set of not allowed categories. The constraint approach reveals particularly useful for this type of rules, as decisions can be taken under the hypothesis of non existence of the excluded categories. If these categories are finally deduced, all other categories inferred upon the non existence of the former ones are automatically eliminated. The parser has been implemented using Constraint, Handling Rules. Some results with a set of rules oriented to the segmentation of texts in propositions are shown.","PeriodicalId":130951,"journal":{"name":"12th International Conference of the Chilean Computer Science Society, 2002. Proceedings.","volume":"29 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2002-11-06","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"114610345","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 : 2002-11-06DOI: 10.1109/SCCC.2002.1173194
F. Losavio, D. Ortega, M. Pérez
Software integration has been a solution to the problem of connecting dissimilar systems for many years. Integration is still a challenging issue. EAI is defined as the process of integrating enterprise systems with existing applications. Since software integration research has yielded a variety of different concepts, we survey and discuss this terminology. EAI arises as an evolution of the CASE technology approach. The main goal of this work is the modeling of EAI in order to obtain a more organized and unified view of the main aspects involved. The EAI model presented was constructed extending the known Brown's (1994) Conceptual Model of Integration. One contribution of this paper is the identification of architectural styles and patterns and the specification of a quality model based on the ISO 9126-1 standard for enterprise systems (ES). This quality model specifies the quality characteristics that the systems in the EAI domain should hold.
{"title":"Modeling EAI [Enterprise Application Integration]","authors":"F. Losavio, D. Ortega, M. Pérez","doi":"10.1109/SCCC.2002.1173194","DOIUrl":"https://doi.org/10.1109/SCCC.2002.1173194","url":null,"abstract":"Software integration has been a solution to the problem of connecting dissimilar systems for many years. Integration is still a challenging issue. EAI is defined as the process of integrating enterprise systems with existing applications. Since software integration research has yielded a variety of different concepts, we survey and discuss this terminology. EAI arises as an evolution of the CASE technology approach. The main goal of this work is the modeling of EAI in order to obtain a more organized and unified view of the main aspects involved. The EAI model presented was constructed extending the known Brown's (1994) Conceptual Model of Integration. One contribution of this paper is the identification of architectural styles and patterns and the specification of a quality model based on the ISO 9126-1 standard for enterprise systems (ES). This quality model specifies the quality characteristics that the systems in the EAI domain should hold.","PeriodicalId":130951,"journal":{"name":"12th International Conference of the Chilean Computer Science Society, 2002. Proceedings.","volume":"134 1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2002-11-06","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"130982239","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 : 2002-11-06DOI: 10.1109/SCCC.2002.1173175
Edgard Jamhour, Simone Storoz
The deployment of wireless networks based on IPv4 is spreading quickly all over the world. However, there is a strong shortage of public IPv4 addresses. Because of this, IPv6 has recently, received a new push of development. Most of the advances related to IPv6 are concerned to the development of transition mechanisms allowing IPv6 hosts to communicate through an existing IPv4 infrastructure or yet, permitting the communication between IPv4 and IPv6 hosts. This paper addresses the issue of using private IP addresses for implementing Mobile IP in wireless networks using IPv4/IPv6 transition mechanisms. An overview of the published IPv4/IPv6 transition mechanisms is presented, then, a new mechanism, called Transparent IPv6, which combines features of existing mechanisms, is proposed. The Transparent IPv6 mechanism consists in virtually assigning IPv6 addresses to IPv4 hosts without modifying user devices. This technique could be used to permit the deployment of wireless networks without requiring public IPv4 addresses, using legacy IPv4 equipments.
{"title":"Implementing wireless networks with transition mechanisms","authors":"Edgard Jamhour, Simone Storoz","doi":"10.1109/SCCC.2002.1173175","DOIUrl":"https://doi.org/10.1109/SCCC.2002.1173175","url":null,"abstract":"The deployment of wireless networks based on IPv4 is spreading quickly all over the world. However, there is a strong shortage of public IPv4 addresses. Because of this, IPv6 has recently, received a new push of development. Most of the advances related to IPv6 are concerned to the development of transition mechanisms allowing IPv6 hosts to communicate through an existing IPv4 infrastructure or yet, permitting the communication between IPv4 and IPv6 hosts. This paper addresses the issue of using private IP addresses for implementing Mobile IP in wireless networks using IPv4/IPv6 transition mechanisms. An overview of the published IPv4/IPv6 transition mechanisms is presented, then, a new mechanism, called Transparent IPv6, which combines features of existing mechanisms, is proposed. The Transparent IPv6 mechanism consists in virtually assigning IPv6 addresses to IPv4 hosts without modifying user devices. This technique could be used to permit the deployment of wireless networks without requiring public IPv4 addresses, using legacy IPv4 equipments.","PeriodicalId":130951,"journal":{"name":"12th International Conference of the Chilean Computer Science Society, 2002. Proceedings.","volume":"46 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2002-11-06","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"123455846","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 : 2002-11-06DOI: 10.1109/SCCC.2002.1173182
Angélica Urrutia, José Galindo, M. Piattini
We present a proposal for the application of fuzzy logic to conceptual modeling as an extension to the EER model. In order to do this, we extend some EER components to fuzzy ERR and we propose a notation for fuzzy representations, such as fuzzy values in the attributes, the degree in each value of an attribute and the degree in a set of values of diverse attributes, as well as fuzzy entities treated as a degree in all the instances of the entity. In the case of the degrees we have found that these may have a different meaning to that which we are trying to represent.
{"title":"Modeling data using fuzzy attributes","authors":"Angélica Urrutia, José Galindo, M. Piattini","doi":"10.1109/SCCC.2002.1173182","DOIUrl":"https://doi.org/10.1109/SCCC.2002.1173182","url":null,"abstract":"We present a proposal for the application of fuzzy logic to conceptual modeling as an extension to the EER model. In order to do this, we extend some EER components to fuzzy ERR and we propose a notation for fuzzy representations, such as fuzzy values in the attributes, the degree in each value of an attribute and the degree in a set of values of diverse attributes, as well as fuzzy entities treated as a degree in all the instances of the entity. In the case of the degrees we have found that these may have a different meaning to that which we are trying to represent.","PeriodicalId":130951,"journal":{"name":"12th International Conference of the Chilean Computer Science Society, 2002. Proceedings.","volume":"39 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2002-11-06","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"116044689","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 : 2002-11-06DOI: 10.1109/SCCC.2002.1173179
A. Roche, Carlos Becker Westphall, P. A. C. K. G. V. Mecklenburg
Wireless networks represent the new computer paradigm. They have as main function to provide users with permanent access, independently of their physical location. With the decrease in the costs of portable devices and the increase in their capacity, a new concept called ad hoc network appeared. Through this technology, communication is made directly between mobile computers. In this paper, the proposal and validation of a mechanism based on the bandwidth management principle are done to guarantee QoS (Quality of Service) in ad hoc wireless networks. Therefore, a software is developed to simulate ad hoc environments, making connections following the approach of the already proposed mechanism. Several experiences demonstrating the advantages of this method were carried out. They proved that this method guarantees a better use of the transmission channel and, at the same time, accepts more connections.
{"title":"Quality of service for ad hoc wireless network","authors":"A. Roche, Carlos Becker Westphall, P. A. C. K. G. V. Mecklenburg","doi":"10.1109/SCCC.2002.1173179","DOIUrl":"https://doi.org/10.1109/SCCC.2002.1173179","url":null,"abstract":"Wireless networks represent the new computer paradigm. They have as main function to provide users with permanent access, independently of their physical location. With the decrease in the costs of portable devices and the increase in their capacity, a new concept called ad hoc network appeared. Through this technology, communication is made directly between mobile computers. In this paper, the proposal and validation of a mechanism based on the bandwidth management principle are done to guarantee QoS (Quality of Service) in ad hoc wireless networks. Therefore, a software is developed to simulate ad hoc environments, making connections following the approach of the already proposed mechanism. Several experiences demonstrating the advantages of this method were carried out. They proved that this method guarantees a better use of the transmission channel and, at the same time, accepts more connections.","PeriodicalId":130951,"journal":{"name":"12th International Conference of the Chilean Computer Science Society, 2002. Proceedings.","volume":"62 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2002-11-06","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"124036758","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 : 2002-11-06DOI: 10.1109/SCCC.2002.1173171
Jorge A. Baier
The aim of our ongoing research is to give a method to construct intelligent tutoring systems for agents who are executing typical procedures in dynamic environments based on a logical framework. Typical procedures are similar to plans in the sense that they describe the actions an agent should execute to achieve a certain goal. In this paper we address what we consider is the first step toward the construction of this kind of system: procedure recognition. We formalize what it means that an agent is performing a procedure in the Situation Calculus, a logical first-order language extended with induction. Based upon this formalization, we give two different implementations. The first, which is directly based in our formalization, is proved to be quite inefficient. The second, significantly more efficient, arises from a logical reformulation of the original formalization. Procedures are represented through CONGOLOG programs, a logical interpreted language based on the Situation Calculus.
{"title":"On procedure recognition in the Situation Calculus","authors":"Jorge A. Baier","doi":"10.1109/SCCC.2002.1173171","DOIUrl":"https://doi.org/10.1109/SCCC.2002.1173171","url":null,"abstract":"The aim of our ongoing research is to give a method to construct intelligent tutoring systems for agents who are executing typical procedures in dynamic environments based on a logical framework. Typical procedures are similar to plans in the sense that they describe the actions an agent should execute to achieve a certain goal. In this paper we address what we consider is the first step toward the construction of this kind of system: procedure recognition. We formalize what it means that an agent is performing a procedure in the Situation Calculus, a logical first-order language extended with induction. Based upon this formalization, we give two different implementations. The first, which is directly based in our formalization, is proved to be quite inefficient. The second, significantly more efficient, arises from a logical reformulation of the original formalization. Procedures are represented through CONGOLOG programs, a logical interpreted language based on the Situation Calculus.","PeriodicalId":130951,"journal":{"name":"12th International Conference of the Chilean Computer Science Society, 2002. Proceedings.","volume":"10 8 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2002-11-06","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"127282602","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
扫码关注我们
求助内容：
应助结果提醒方式：