M. Bastarrica, S. Demurjian, Alexander A. Shvartsman
{"title":"Comprehensive specification of distributed systems using I/sup 5/ and IOA","authors":"M. Bastarrica, S. Demurjian, Alexander A. Shvartsman","doi":"10.1109/SCCC.2000.890394","DOIUrl":"https://doi.org/10.1109/SCCC.2000.890394","url":null,"abstract":"Low level difficulties in the development of distributed systems that are due to non-standard communication protocols and incompatible components or platforms have largely been solved through standardization and commoditization of protocols and platforms. Distributed systems are being designed at higher levels of sophistication these days, and having an expressive yet usable specification language is a valuable tool. IOA is a formal language for specifying the semantics of distributed systems. I/sup 5/ is a specification framework for architectural definition of distributed systems, also intended as a basis for configuration management. I/sup 5/ has five levels that specify mainly the structural characteristics at different levels of abstraction, but I/sup 5/ does not address the semantics or dynamics of distributed systems interactions. We explore the integration of IOA and I/sup 5/ to create combined specifications that enjoy the benefits of both specification languages: the five different levels of abstraction of I/sup 5/ with their structural specification capabilities are enhanced by a semantic specification written in IOA. We show an example of a specification developed using IOA and I/sup 5/ in an integrated way. We consider general approaches to such integrated specifications and discuss the possibilities and limitations of integrating IOA and I/sup 5/, as well as our future work towards the complete integration.","PeriodicalId":263257,"journal":{"name":"Proceedings 20th International Conference of the Chilean Computer Science Society","volume":"44 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2000-11-16","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"121869212","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}
{"title":"A genetic classifier tool","authors":"A. Pozo, Mozart Hasse","doi":"10.1109/SCCC.2000.890387","DOIUrl":"https://doi.org/10.1109/SCCC.2000.890387","url":null,"abstract":"Knowledge discovery is the most desirable end product of an enterprise information system. Research from different areas recognizes that a new generation of intelligent tools for automated data mining is needed to deal with large databases. In this sense, induction based learning systems have emerged as a promising approach. This paper describes an induction-based classifier tool. The tool employs a genetic algorithm using the Michigan approach to find rules, is able to process discrete and continuous attributes and also is domain-independent. Implementation details are explained, including some optimizations, data structures and genetic operators. Some optimizations include the use of phenotypic sharing (with linear complexity) to direct the search. The results of accuracy are compared with 33 other algorithms in 32 datasets. The difference of accuracy is not statistically significant at the 10% level when compared with the best of the other 33 algorithms.","PeriodicalId":263257,"journal":{"name":"Proceedings 20th International Conference of the Chilean Computer Science Society","volume":"24 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2000-11-16","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"123498786","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}
{"title":"Multiplicity and local search in evolutionary algorithms to build the Pareto front","authors":"Héctor A. Leiva, S. Esquivel, R. Gallard","doi":"10.1109/SCCC.2000.890386","DOIUrl":"https://doi.org/10.1109/SCCC.2000.890386","url":null,"abstract":"In multicriteria optimization determination of the Pareto-optimal front is of utmost importance for decision making. Simultaneous parallel search for multiple members of an evolutionary algorithm can lead to effective optimization. In a previous approach (Esquivel et al., 1999) extending the ideas of a former work of (Lis and Eiben, 1997), we proposed the multi-sexual-parents-crossovers genetic algorithm (MSPC-GA), a method which by allowing multiple parents per sex and multiple crossovers per mating action attempted to balance the explorative and exploitative efforts which are present in any evolutionary algorithm. The performance of the method produced an evenly distributed and larger set of efficient points. Following this concept the present proposal incorporates a hybridisation of global and local search to the multiplicity approach. Now the evolutionary approach combined with simulated annealing and neighbourhood search produced better results.","PeriodicalId":263257,"journal":{"name":"Proceedings 20th International Conference of the Chilean Computer Science Society","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2000-11-16","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"129735549","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}
{"title":"A dynamic virtual fragmentation method for query recovery optimization","authors":"Jaime A. Aguilera Vázquez","doi":"10.1109/SCCC.2000.890391","DOIUrl":"https://doi.org/10.1109/SCCC.2000.890391","url":null,"abstract":"The time consumed during the execution of queries in a parallel and distributed environment is highly affected by the form in which the tables comprising a database have been fragmented. The classical methods of fragmentation in a distributed database system helps, to a great extent, to make the information retrieval faster and with smaller calculation efforts. This is particularly true for applications where the specifications are well known in advance at the time of the creation of the tables that compose the database, which in some form or other influenced the design and the definition of the type of fragmentation and their distribution on different sites of processing. Nevertheless, the above characteristics cannot be used in applications where the distributed management cannot do inferences that help it to know in what sites the data with the characteristics the user is looking for are located. Under these conditions the time and amount of work used by the participants in the query solution can be highly increased. In this paper the dynamic virtual fragmentation method is presented. The method works as an alternative way that allows us to diminish response time consumed by queries using horizontal fragmented tables. The proposed method has been proven and implemented in a database parallel server running on a shared nothing supercomputer.","PeriodicalId":263257,"journal":{"name":"Proceedings 20th International Conference of the Chilean Computer Science Society","volume":"31 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2000-11-16","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"127702763","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}
{"title":"A dynamic associative semantic model for natural language processing based on a spreading activation network","authors":"Alejandro Bassi","doi":"10.1109/SCCC.2000.890397","DOIUrl":"https://doi.org/10.1109/SCCC.2000.890397","url":null,"abstract":"This paper presents a semantic model based on well-known psycholinguistic theories of human memory. It is centered on a spreading activation network, but it departs from classical models by representing associations between structured units instead of atomic nodes. Network units have an activity level that evolves according to their expected contextual relevance. Spreading activation explains the predictive top-down effect of knowledge. It supports general heuristics which may be used as the first step of more elaborated methods. This model is suited to deal with the interaction between semantic and episodic memories, as well as many other practical issues regarding natural language processing, including the retroactive effect of semantics over perception and the operation in open-worlds.","PeriodicalId":263257,"journal":{"name":"Proceedings 20th International Conference of the Chilean Computer Science Society","volume":"35 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2000-11-16","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"115750134","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}
{"title":"Testing an implementation of a temporal logic language","authors":"Marisa A. Sanchez, J. Augusto","doi":"10.1109/SCCC.2000.890393","DOIUrl":"https://doi.org/10.1109/SCCC.2000.890393","url":null,"abstract":"Axiomatic presentations contain a great deal of information that can be used in the testing of an implementation. We describe how we tested an implementation of a temporal logical system, specifically an implementation of an extension (Cobo and Augusto, 1998) of the language Temporal Prolog (Gabbay, 1987). However, this testing approach generalizes to any system specified using a Hilbert model (i.e. a system described using a set of axioms and inference rules) and implemented as a Prolog program. Our approach allowed us to discover some errors in the program. The necessary background information on temporal logic and specification-based testing is included in order to make the exposition as self-contained as possible.","PeriodicalId":263257,"journal":{"name":"Proceedings 20th International Conference of the Chilean Computer Science Society","volume":"29 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2000-11-16","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"125624113","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}
{"title":"Evolving a legacy data warehouse system to an object-oriented architecture","authors":"A. H. Filho, H. Prado, Simão S. Toscani","doi":"10.1109/SCCC.2000.890389","DOIUrl":"https://doi.org/10.1109/SCCC.2000.890389","url":null,"abstract":"We introduce an object-oriented approach to transform a star-schema of a legacy data warehouse system into a Dimensional Object Model (DOM) (Firestone, 1998), in order to take advantage of the flexibility of the object paradigm. We have applied the Object-Oriented Software Engineering (OOSE) process, proposed by (Jacobson et al., 1992), to describe the life cycle of a data warehouse and to clarify the context of our intervention. By means of OOSE we also define the target architecture and the components that will ensure the development of reuse-supporting data warehouse systems. In a sense, a change tolerant architecture is proposed, as referred to by (Jacobson, 1998). The solution proposed applies the object paradigm for the star-schema decomposition in a three-layer architecture, separating the components in logical, interface and data management layers. This decomposition minimizes the dependence among the components and increases their reusability. The main contribution of this work is that, by transforming the star-schema into a DOM, we are preparing the system to evolve through any object-oriented data warehouse development methodology. In a context of many already existing data warehouse systems based on relational models, this transformation sounds especially interesting.","PeriodicalId":263257,"journal":{"name":"Proceedings 20th International Conference of the Chilean Computer Science Society","volume":"402 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2000-11-16","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"133565788","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}
{"title":"Network programming internals of the Dillo Web browser","authors":"Jorge Arellano-Cid, H. Brand","doi":"10.1109/SCCC.2000.890406","DOIUrl":"https://doi.org/10.1109/SCCC.2000.890406","url":null,"abstract":"Network programs face several delay sources when sending or retrieving data. This is particularly problematic in programs which interact directly with the user, most notably Web browsers. We present a hybrid approach using threads and signal driven I/O, which allows a non-blocking main thread and overlapping waiting times.","PeriodicalId":263257,"journal":{"name":"Proceedings 20th International Conference of the Chilean Computer Science Society","volume":"44 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2000-11-16","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"115087240","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}
{"title":"Comparative analysis of a parallel discrete-event simulator","authors":"Mauricio Marín","doi":"10.1109/SCCC.2000.890405","DOIUrl":"https://doi.org/10.1109/SCCC.2000.890405","url":null,"abstract":"Discrete-event simulation is a widely used technique for the study of systems which are too complex to be modeled with analytical methods. Usually parallelism becomes an effective tool for reducing the running times involved in the simulation of large scale systems. However the actual realization of an efficient parallel simulator is highly dependent on the particular features of the system being modeled. As a result, a number of alternative strategies for parallel simulation, the so called synchronization protocols, have been developed. None of them is the most efficient one for all kind of systems, or even different instances of a given system. It is then relevant to provide the designer of a parallel simulator with information relative to the factors affecting the performance of known protocols. We present an analysis of such factors in the context of the comparison of an optimistic synchronization protocol with alternative approaches which are suitable for the bulk-synchronous parallel model of computing. It is well-known that analytical analysis in this field is mathematically intractable due to the irregular nature of the workload. However, rather than resorting to benchmarks whose results are largely influenced by programming details, we devised a strategy to get quantitative results from an implementation independent and yet empirical framework.","PeriodicalId":263257,"journal":{"name":"Proceedings 20th International Conference of the Chilean Computer Science Society","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2000-11-16","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"129781098","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}
{"title":"Haar-like wavelets defined over tetrahedrical grids","authors":"L. Boscardin, Liliana Castro, S. Castro","doi":"10.1109/SCCC.2000.890399","DOIUrl":"https://doi.org/10.1109/SCCC.2000.890399","url":null,"abstract":"We systematically define Haar-like wavelets over a tetrahedral grid which is generated by a regular subdivision method. These wavelets form an unconditional basis for L/sup P/(T,/spl Sigma/,/spl mu/), 1<p</spl infin/, /spl mu/ being the Lebesgue measure and /spl Sigma/ the /spl sigma/-algebra of all tetrahedra generated from a tetrahedron T by the chosen subdivision method.","PeriodicalId":263257,"journal":{"name":"Proceedings 20th International Conference of the Chilean Computer Science Society","volume":"144 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2000-11-16","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"123249496","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}