Pub Date : 2002-11-06DOI: 10.1109/SCCC.2002.1173192
Marcello Visconti, C. Cook
A system documentation process maturity model and assessment procedure were developed and used to assess 91 projects at 41 different companies over a seven year period. During this time the original version evolved into a total of four versions based on feedback from industry and the experience gained from the assessments. This paper reports the overall results obtained from the assessments which strongly suggest that the practice of documentation is not getting a passing grade in the software industry. The results show a clear maturity gap between documentation practices concerned with defining policy and practices concerned with adherence to those policies. The results further illustrate the need to recognize the importance of improving the documentation process, and to transform the good intentions into explicit policies and actions.
{"title":"An overview of industrial software documentation practice","authors":"Marcello Visconti, C. Cook","doi":"10.1109/SCCC.2002.1173192","DOIUrl":"https://doi.org/10.1109/SCCC.2002.1173192","url":null,"abstract":"A system documentation process maturity model and assessment procedure were developed and used to assess 91 projects at 41 different companies over a seven year period. During this time the original version evolved into a total of four versions based on feedback from industry and the experience gained from the assessments. This paper reports the overall results obtained from the assessments which strongly suggest that the practice of documentation is not getting a passing grade in the software industry. The results show a clear maturity gap between documentation practices concerned with defining policy and practices concerned with adherence to those policies. The results further illustrate the need to recognize the importance of improving the documentation process, and to transform the good intentions into explicit policies and actions.","PeriodicalId":130951,"journal":{"name":"12th International Conference of the Chilean Computer Science Society, 2002. Proceedings.","volume":"75 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":"115671797","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.1173173
C. Trefftz, H. Trefftz
Observations about an approximate parallel algorithm for the point robot motion planning problem are presented. The algorithm solves not only the original problem, but related problems as well.
给出了一种求解点机器人运动规划问题的近似并行算法。该算法不仅解决了原始问题，还解决了相关问题。
{"title":"Observations about an approximate algorithm for the point robot motion planning problem","authors":"C. Trefftz, H. Trefftz","doi":"10.1109/SCCC.2002.1173173","DOIUrl":"https://doi.org/10.1109/SCCC.2002.1173173","url":null,"abstract":"Observations about an approximate parallel algorithm for the point robot motion planning problem are presented. The algorithm solves not only the original problem, but related problems as well.","PeriodicalId":130951,"journal":{"name":"12th International Conference of the Chilean Computer Science Society, 2002. Proceedings.","volume":"32 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":"117143376","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.1173176
A. Yamin, Iara Augustin, J. Barbosa, L. Silva, C. Geyer, G. H. Cavalheiro
The next years will be characterized by high levels of heterogeneity and interactions among devices connected to global networks. The first researches involving wide-area distributed systems answered many questions concerning resource management, although they fail in treating questions related to heterogeneity and dynamic adaptation. More recent works, through technologies like CORBA and Java/Jini, deal with heterogeneity problem, but do not deepen into adaptability aspects. In this article, we present the ISAM architecture. ISAM is a middleware directed to resource management in heterogeneous networks, supporting physical and logical mobilities, dynamic adaptation and the execution of distributed mobile applications based on components. In order to achieve its goal, ISAM uses, as strategy, an integrated environment that: (a) provides a programming paradigm and its execution environment; (b) handles the adaptation process through a multilevel collaborative model, in which both the system and the application contribute.
{"title":"Collaborative multilevel adaptation in distributed mobile applications","authors":"A. Yamin, Iara Augustin, J. Barbosa, L. Silva, C. Geyer, G. H. Cavalheiro","doi":"10.1109/SCCC.2002.1173176","DOIUrl":"https://doi.org/10.1109/SCCC.2002.1173176","url":null,"abstract":"The next years will be characterized by high levels of heterogeneity and interactions among devices connected to global networks. The first researches involving wide-area distributed systems answered many questions concerning resource management, although they fail in treating questions related to heterogeneity and dynamic adaptation. More recent works, through technologies like CORBA and Java/Jini, deal with heterogeneity problem, but do not deepen into adaptability aspects. In this article, we present the ISAM architecture. ISAM is a middleware directed to resource management in heterogeneous networks, supporting physical and logical mobilities, dynamic adaptation and the execution of distributed mobile applications based on components. In order to achieve its goal, ISAM uses, as strategy, an integrated environment that: (a) provides a programming paradigm and its execution environment; (b) handles the adaptation process through a multilevel collaborative model, in which both the system and the application contribute.","PeriodicalId":130951,"journal":{"name":"12th International Conference of the Chilean Computer Science Society, 2002. Proceedings.","volume":"22 4 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":"124552359","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.1173198
Fábio Reis Cecin, J. Barbosa, C. Geyer
The Hololanguage (briefly, Holo) is a programming language derived from a new software development paradigm, the Holoparadigm. This paper provides an initial treatment to the problem of supporting the debug process of Holo-programs. To this end, an extension is proposed to the Holoplatform, the Holo Extension for Debugging (HED). Finally, the Holo Debugger a simple debugger is presented to illustrate the feasibility of the proposed extension.
holollanguage(简称Holo)是一种源自新的软件开发范式——holopparadigm的编程语言。本文对holo程序调试过程的支持问题作了初步的论述。为此，提出了Holoplatform的扩展，Holo extension for Debugging (HED)。最后，给出了Holo调试器，一个简单的调试器来说明所提出的扩展的可行性。
{"title":"Holo Debugger: a debugger for a concurrent multiparadigm language","authors":"Fábio Reis Cecin, J. Barbosa, C. Geyer","doi":"10.1109/SCCC.2002.1173198","DOIUrl":"https://doi.org/10.1109/SCCC.2002.1173198","url":null,"abstract":"The Hololanguage (briefly, Holo) is a programming language derived from a new software development paradigm, the Holoparadigm. This paper provides an initial treatment to the problem of supporting the debug process of Holo-programs. To this end, an extension is proposed to the Holoplatform, the Holo Extension for Debugging (HED). Finally, the Holo Debugger a simple debugger is presented to illustrate the feasibility of the proposed extension.","PeriodicalId":130951,"journal":{"name":"12th International Conference of the Chilean Computer Science Society, 2002. Proceedings.","volume":"22 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":"124322791","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.1173168
M. Crochemore, G. Navarro
The compression of binary texts using antidictionaries is a novel technique based on the fact that some substrings (called "antifactors") never appear in the text. Let sb be an antifactor where b is its last bit. Every time s appears in the text we know that the next bit is b~ and hence omit its representation. Since building the set of all antifactors is space consuming at compression time, it is customary to limit the maximum length of antifactors considered up to a constant k. Larger k yields better compression of the text but requires more space at compression time. In this paper we introduce the notion of almost antifactors, which are strings that rarely appear in the text. More formally, almost antifactors are strings that, if we consider them as antifactors and separately code their occurrences as exceptions, the compression ratio improves. We show that almost antifactors permit improving compression with a limited amount of main memory to compress. Our experiments show that they obtain the same compression of the classical algorithm using only 30%-55% of its memory space.
{"title":"Improved antidictionary based compression","authors":"M. Crochemore, G. Navarro","doi":"10.1109/SCCC.2002.1173168","DOIUrl":"https://doi.org/10.1109/SCCC.2002.1173168","url":null,"abstract":"The compression of binary texts using antidictionaries is a novel technique based on the fact that some substrings (called \"antifactors\") never appear in the text. Let sb be an antifactor where b is its last bit. Every time s appears in the text we know that the next bit is b~ and hence omit its representation. Since building the set of all antifactors is space consuming at compression time, it is customary to limit the maximum length of antifactors considered up to a constant k. Larger k yields better compression of the text but requires more space at compression time. In this paper we introduce the notion of almost antifactors, which are strings that rarely appear in the text. More formally, almost antifactors are strings that, if we consider them as antifactors and separately code their occurrences as exceptions, the compression ratio improves. We show that almost antifactors permit improving compression with a limited amount of main memory to compress. Our experiments show that they obtain the same compression of the classical algorithm using only 30%-55% of its memory space.","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":"130254573","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.1173170
C. Montez
Recently, there has been an increasing interest in programming models of real-time systems and approaches of flexible scheduling for dealing with situations of transient overloading, which can occur in nondeterministic environments. This paper presents the (p+i, k)-firm approach that can be seen as a combination and generalization of imprecise computing and of deadline (m,k)-firm. This approach extends the (m,k)-firm concept allowing a task to execute in an imprecise way, obtaining better results than a deadline missing. The approach seeks to establish a compromise between avoiding temporal failures and maximizing the quality (cumulative value). A battery of tests was developed to evaluate the approach and its capacity to reduce the probability of dynamic failures and to obtain a smooth degradation in overload conditions.
{"title":"Dealing with overloading in tasks scheduling","authors":"C. Montez","doi":"10.1109/SCCC.2002.1173170","DOIUrl":"https://doi.org/10.1109/SCCC.2002.1173170","url":null,"abstract":"Recently, there has been an increasing interest in programming models of real-time systems and approaches of flexible scheduling for dealing with situations of transient overloading, which can occur in nondeterministic environments. This paper presents the (p+i, k)-firm approach that can be seen as a combination and generalization of imprecise computing and of deadline (m,k)-firm. This approach extends the (m,k)-firm concept allowing a task to execute in an imprecise way, obtaining better results than a deadline missing. The approach seeks to establish a compromise between avoiding temporal failures and maximizing the quality (cumulative value). A battery of tests was developed to evaluate the approach and its capacity to reduce the probability of dynamic failures and to obtain a smooth degradation in overload conditions.","PeriodicalId":130951,"journal":{"name":"12th International Conference of the Chilean Computer Science Society, 2002. Proceedings.","volume":"63 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":"126691713","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.1173183
Regina Motz
We characterize the problem of maintenance of a federated schema to cope with local schema evolution in a tightly coupled federation. By means of an example, we present the problems that local schema changes could cause on the federated schema and show proposed solutions.
{"title":"Problems in the maintenance of a federated database schema","authors":"Regina Motz","doi":"10.1109/SCCC.2002.1173183","DOIUrl":"https://doi.org/10.1109/SCCC.2002.1173183","url":null,"abstract":"We characterize the problem of maintenance of a federated schema to cope with local schema evolution in a tightly coupled federation. By means of an example, we present the problems that local schema changes could cause on the federated schema and show proposed solutions.","PeriodicalId":130951,"journal":{"name":"12th International Conference of the Chilean Computer Science Society, 2002. Proceedings.","volume":"149 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":"127268763","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.1173174
F. Peña-Mora, R. Aldunate, M. Nussbaum
The number of victims rescued alive when a disaster occurs depends on the efficiency of search and rescue teams. Hence, communication, coordination and collaboration must be developed as best as possible. Currently the communication infrastructure, radio gear, permits us only to transfer audio signals, so enhancing group interaction by providing complementary communication media and services is a challenge. An ad-hoc network formed by wearable devices operating in a peer to peer architecture with limited wireless coverage seems appropriate for this need. We have designed an ad-hoc distributed shared memory system, focused on issues generated by peer mobility, to provide a transparent way for applications to interact. Also, we developed a simulation model to analyze the amount of replication needed to obtain a reliable medium. A trade-off appeared between the transparency provided to the applications and the system's availability. The results suggest that it is possible to build a reliable communication system.
{"title":"Availability analysis of an ad-hoc DSMS for disaster relief environments","authors":"F. Peña-Mora, R. Aldunate, M. Nussbaum","doi":"10.1109/SCCC.2002.1173174","DOIUrl":"https://doi.org/10.1109/SCCC.2002.1173174","url":null,"abstract":"The number of victims rescued alive when a disaster occurs depends on the efficiency of search and rescue teams. Hence, communication, coordination and collaboration must be developed as best as possible. Currently the communication infrastructure, radio gear, permits us only to transfer audio signals, so enhancing group interaction by providing complementary communication media and services is a challenge. An ad-hoc network formed by wearable devices operating in a peer to peer architecture with limited wireless coverage seems appropriate for this need. We have designed an ad-hoc distributed shared memory system, focused on issues generated by peer mobility, to provide a transparent way for applications to interact. Also, we developed a simulation model to analyze the amount of replication needed to obtain a reliable medium. A trade-off appeared between the transparency provided to the applications and the system's availability. The results suggest that it is possible to build a reliable communication system.","PeriodicalId":130951,"journal":{"name":"12th International Conference of the Chilean Computer Science Society, 2002. Proceedings.","volume":"61 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":"132701676","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.1173169
H. Mahanta, Phalguni Gupta, Sajal K. Das
In this paper we present two algorithms for solving the list update problem which is to maintain a list of items to support such basic operations as access, insert and delete. The first algorithm proposed is an approximation to the optimal off-line algorithm. Knowing the complete request sequence, it provides a good approximation to the lower bound of the optimum cost and finds an approximately optimum service sequence in polynomial time of the list and the size of the request sequence. The underlying idea is to maintain the pairwise optimal ordering of the items except for the case of conflicts, when no exchange takes place. The approximate off-line algorithm takes O(n/sup 3/ m) time and O(1) space, where n is the length of the list and m is the number of requests. Our second algorithm is a deterministic on-line algorithm which is shown to be 2-competitive under any sequence of access requests. It can be efficiently implemented compared to the best known deterministic online algorithms such as MTF and TS (0). We also show that using the proposed on-line algorithm as a procedure in data compression techniques, it is possible to obtain better compression ratio.
{"title":"Approximate and on-line algorithms for list update problem","authors":"H. Mahanta, Phalguni Gupta, Sajal K. Das","doi":"10.1109/SCCC.2002.1173169","DOIUrl":"https://doi.org/10.1109/SCCC.2002.1173169","url":null,"abstract":"In this paper we present two algorithms for solving the list update problem which is to maintain a list of items to support such basic operations as access, insert and delete. The first algorithm proposed is an approximation to the optimal off-line algorithm. Knowing the complete request sequence, it provides a good approximation to the lower bound of the optimum cost and finds an approximately optimum service sequence in polynomial time of the list and the size of the request sequence. The underlying idea is to maintain the pairwise optimal ordering of the items except for the case of conflicts, when no exchange takes place. The approximate off-line algorithm takes O(n/sup 3/ m) time and O(1) space, where n is the length of the list and m is the number of requests. Our second algorithm is a deterministic on-line algorithm which is shown to be 2-competitive under any sequence of access requests. It can be efficiently implemented compared to the best known deterministic online algorithms such as MTF and TS (0). We also show that using the proposed on-line algorithm as a procedure in data compression techniques, it is possible to obtain better compression ratio.","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":"127625409","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.1173195
M. Pérez, Anna Grimán, F. Losavio
Software quality can be expressed through various attributes, many of which depend on the architecture by nature. Therefore an architecture-focused development process, with an integrated self-evaluation, must be selected. Since there is no known process covering these attributes, a method capable of evaluating the architecture must be built into the development process. The purpose of this research is presenting the incorporation of Bosch's (2000) architectural design method, formulated to a standard software development process, emphasizing on the definition of the software architecture through its quality attributes. The improved development process was applied to the knowledge management system (KMS) case study, in the domain of collaborative systems. The most important quality attributes for the KMS were selected, candidate architectures were proposed for it and the most suitable architecture selected using a simulation technique. A result of this research was the specification of the critical quality attributes for the collaborative systems domain.
{"title":"Simulation-based architectural evaluation for collaborative systems","authors":"M. Pérez, Anna Grimán, F. Losavio","doi":"10.1109/SCCC.2002.1173195","DOIUrl":"https://doi.org/10.1109/SCCC.2002.1173195","url":null,"abstract":"Software quality can be expressed through various attributes, many of which depend on the architecture by nature. Therefore an architecture-focused development process, with an integrated self-evaluation, must be selected. Since there is no known process covering these attributes, a method capable of evaluating the architecture must be built into the development process. The purpose of this research is presenting the incorporation of Bosch's (2000) architectural design method, formulated to a standard software development process, emphasizing on the definition of the software architecture through its quality attributes. The improved development process was applied to the knowledge management system (KMS) case study, in the domain of collaborative systems. The most important quality attributes for the KMS were selected, candidate architectures were proposed for it and the most suitable architecture selected using a simulation technique. A result of this research was the specification of the critical quality attributes for the collaborative systems domain.","PeriodicalId":130951,"journal":{"name":"12th International Conference of the Chilean Computer Science Society, 2002. Proceedings.","volume":"41 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":"117254541","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
扫码关注我们
求助内容：
应助结果提醒方式：