In this paper, we report a case study of computer supported exploration of the theory of natural numbers, using a theory exploration model based on knowledge schemes, proposed by Bruno Buchberger. We illustrate with examples from the exploration: (i) the invention of new concepts (functions, relations) in the theory, using knowledge scheme;, (ii) the invention of new propositions, using proposition schemes; (iii) the invention of problems, using knowledge schemes; (iv) the introduction of new reasoning rules, by lifting knowledge to the inference level, after their correctness was proved
{"title":"Scheme-Based Systematic Exploration of Natural Numbers","authors":"Madalina Hodorog, A. Craciun","doi":"10.1109/SYNASC.2006.67","DOIUrl":"https://doi.org/10.1109/SYNASC.2006.67","url":null,"abstract":"In this paper, we report a case study of computer supported exploration of the theory of natural numbers, using a theory exploration model based on knowledge schemes, proposed by Bruno Buchberger. We illustrate with examples from the exploration: (i) the invention of new concepts (functions, relations) in the theory, using knowledge scheme;, (ii) the invention of new propositions, using proposition schemes; (iii) the invention of problems, using knowledge schemes; (iv) the introduction of new reasoning rules, by lifting knowledge to the inference level, after their correctness was proved","PeriodicalId":309740,"journal":{"name":"2006 Eighth International Symposium on Symbolic and Numeric Algorithms for Scientific Computing","volume":"91 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2006-09-26","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"124804898","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}
M. Cosulschi, A. Giurca, Bogdan Udrescu, N. Constantinescu, M. Gabroveanu
Existing methods of information extraction from HTML documents include manual approach, supervised learning and automatic techniques. The manual method has high precision and recall values but it is difficult to apply it for large number of pages. Supervised learning involves human interaction to create positive and negative samples. Automatic techniques benefit from less human effort but they are not highly reliable regarding the information retrieved
{"title":"HTML Pattern Generator--Automatic Data Extraction from Web Pages","authors":"M. Cosulschi, A. Giurca, Bogdan Udrescu, N. Constantinescu, M. Gabroveanu","doi":"10.1109/SYNASC.2006.43","DOIUrl":"https://doi.org/10.1109/SYNASC.2006.43","url":null,"abstract":"Existing methods of information extraction from HTML documents include manual approach, supervised learning and automatic techniques. The manual method has high precision and recall values but it is difficult to apply it for large number of pages. Supervised learning involves human interaction to create positive and negative samples. Automatic techniques benefit from less human effort but they are not highly reliable regarding the information retrieved","PeriodicalId":309740,"journal":{"name":"2006 Eighth International Symposium on Symbolic and Numeric Algorithms for Scientific Computing","volume":"12 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2006-09-26","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"114535562","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}
The combination of various meta-heuristics to solve NP-hard problems has great potential to produce good results. Ant algorithms and multi-agent system are proposed to solve a chess problem. The problem is about how to place n rooks on a chessboard so that they are all mutually non-attacking. The introduced algorithms produce reasonable results and have several advantages. A combination between the two meta-heuristics is presented and some possible crossover improvements of the proposed algorithms are suggested
{"title":"Combining Meta-Heuristics to Solve the Rook Problem","authors":"C. Pintea, Camelia Chira, D. Dumitrescu","doi":"10.1109/SYNASC.2006.25","DOIUrl":"https://doi.org/10.1109/SYNASC.2006.25","url":null,"abstract":"The combination of various meta-heuristics to solve NP-hard problems has great potential to produce good results. Ant algorithms and multi-agent system are proposed to solve a chess problem. The problem is about how to place n rooks on a chessboard so that they are all mutually non-attacking. The introduced algorithms produce reasonable results and have several advantages. A combination between the two meta-heuristics is presented and some possible crossover improvements of the proposed algorithms are suggested","PeriodicalId":309740,"journal":{"name":"2006 Eighth International Symposium on Symbolic and Numeric Algorithms for Scientific Computing","volume":"28 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2006-09-26","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"122652031","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}
The article illustrates the graphical study of geodesic motion on curved space-times (mainly exact solutions of Einstein equations) using the symbolic, numerical and graphical computation facilities of Maple platform. The example of null geodesics on Schwarzschild solution is completely processed. The geodesic curves are plotted directly using DEtools package in Schwarzs child coordinates
{"title":"The Use of Maple Platform for the Study of Geodesic Motion on Curved Spacetimes","authors":"D. Vulcanov, Valentina D. Vulcanov","doi":"10.1109/SYNASC.2006.76","DOIUrl":"https://doi.org/10.1109/SYNASC.2006.76","url":null,"abstract":"The article illustrates the graphical study of geodesic motion on curved space-times (mainly exact solutions of Einstein equations) using the symbolic, numerical and graphical computation facilities of Maple platform. The example of null geodesics on Schwarzschild solution is completely processed. The geodesic curves are plotted directly using DEtools package in Schwarzs child coordinates","PeriodicalId":309740,"journal":{"name":"2006 Eighth International Symposium on Symbolic and Numeric Algorithms for Scientific Computing","volume":"24 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2006-09-26","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"122153278","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}
The implementation of asynchronous search techniques can be done in any programming language allowing a distributed programming. Nevertheless, for the study of such techniques and for their evaluation, it is easier and more efficient to implement the techniques under certain distributed environments, which offer various facilities, such as NetLogo. The aim of this article is to introduce an as general as possible model of implementation and evaluation for the asynchronous search techniques in the two possible cases: synchronous and asynchronous. In the case of the synchronous model, a synchronization of the agents' execution is done after each computing cycle. This model, we believe, allows the use of the NetLogo environment as a basic simulator for the study of asynchronous search techniques. This model can be used in the study of agents behavior in several situations, like the priority order of the agents, the behavior in the synchronous and asynchronous case and, therefore, leading to identify possible enhancements in the performances of asynchronous search techniques. A first set of experiments for two large families: the ABT family and the AWCS family, based on the two proposed models is presented in this article
{"title":"Implementation and Evaluation Model for the Asynchronous Search Techniques: From a Synchronously Distributed System to an Asynchronous Distributed System","authors":"I. Muscalagiu, Hong Jiang, H. Popa","doi":"10.1109/SYNASC.2006.44","DOIUrl":"https://doi.org/10.1109/SYNASC.2006.44","url":null,"abstract":"The implementation of asynchronous search techniques can be done in any programming language allowing a distributed programming. Nevertheless, for the study of such techniques and for their evaluation, it is easier and more efficient to implement the techniques under certain distributed environments, which offer various facilities, such as NetLogo. The aim of this article is to introduce an as general as possible model of implementation and evaluation for the asynchronous search techniques in the two possible cases: synchronous and asynchronous. In the case of the synchronous model, a synchronization of the agents' execution is done after each computing cycle. This model, we believe, allows the use of the NetLogo environment as a basic simulator for the study of asynchronous search techniques. This model can be used in the study of agents behavior in several situations, like the priority order of the agents, the behavior in the synchronous and asynchronous case and, therefore, leading to identify possible enhancements in the performances of asynchronous search techniques. A first set of experiments for two large families: the ABT family and the AWCS family, based on the two proposed models is presented in this article","PeriodicalId":309740,"journal":{"name":"2006 Eighth International Symposium on Symbolic and Numeric Algorithms for Scientific Computing","volume":"8 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2006-09-26","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"116861393","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}
This paper approaches the opportunity of the use of medium and high spatial resolution satellite images for the study of the extent and structure of the vegetation cover for a certain geographic area. A computerized system for the classification of vegetation was created based on vegetation indices determined from various combinations of spectral bands from high resolution multispectral satellite images. The comparative study and analysis of vegetation indices in a given image, the acquirement of statistical data and their export to a database are reported
{"title":"PIMS--Multispectral Image Processing Tool for Semantic Information Detection Based on Vegetation Indices","authors":"Cornelia Melenti, D. Safta, D. Gorgan","doi":"10.1109/SYNASC.2006.60","DOIUrl":"https://doi.org/10.1109/SYNASC.2006.60","url":null,"abstract":"This paper approaches the opportunity of the use of medium and high spatial resolution satellite images for the study of the extent and structure of the vegetation cover for a certain geographic area. A computerized system for the classification of vegetation was created based on vegetation indices determined from various combinations of spectral bands from high resolution multispectral satellite images. The comparative study and analysis of vegetation indices in a given image, the acquirement of statistical data and their export to a database are reported","PeriodicalId":309740,"journal":{"name":"2006 Eighth International Symposium on Symbolic and Numeric Algorithms for Scientific Computing","volume":"59 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2006-09-26","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"121360041","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}
We describe the complexity of an approach to fill missing values in decision trees during classification. This approach is derived from the ordered attribute trees method which builds a decision tree for each attribute and uses these trees to fill the missing attribute values. Both our approach and theirs are based on the mutual information between the attributes and the class. Our method takes into account the dependence between attributes by using mutual information. The result of the classification process is a probability distribution instead of a single class. In this paper, we explain our classification algorithm. We then calculate the complexity of constructing the attribute trees and the complexity of classifying a new instance with missing values using our classification algorithm
{"title":"The Complexity of a Probabilistic Approach to Deal with Missing Values in a Decision Tree","authors":"Lamis Hawarah, A. Simonet, M. Simonet","doi":"10.1109/SYNASC.2006.70","DOIUrl":"https://doi.org/10.1109/SYNASC.2006.70","url":null,"abstract":"We describe the complexity of an approach to fill missing values in decision trees during classification. This approach is derived from the ordered attribute trees method which builds a decision tree for each attribute and uses these trees to fill the missing attribute values. Both our approach and theirs are based on the mutual information between the attributes and the class. Our method takes into account the dependence between attributes by using mutual information. The result of the classification process is a probability distribution instead of a single class. In this paper, we explain our classification algorithm. We then calculate the complexity of constructing the attribute trees and the complexity of classifying a new instance with missing values using our classification algorithm","PeriodicalId":309740,"journal":{"name":"2006 Eighth International Symposium on Symbolic and Numeric Algorithms for Scientific Computing","volume":"75 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2006-09-26","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"132672386","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}
Knowledge discovery from databases (KDD) is a complex process composed of several phases: business understanding, data understanding, data preparation, modeling, evaluation and deployment. For each of the phases, there are many algorithms and methods available, the end-user having to select one of them. The AgentDiscover is a multi-agent based intelligent recommendation system for selection of the most appropriate solving method for each phase. This brings added value for both novice and experienced users
{"title":"Multi-Agent Architecture for Knowledge Discovery","authors":"Daniel Pop, V. Negru, C. Sandru","doi":"10.1109/SYNASC.2006.55","DOIUrl":"https://doi.org/10.1109/SYNASC.2006.55","url":null,"abstract":"Knowledge discovery from databases (KDD) is a complex process composed of several phases: business understanding, data understanding, data preparation, modeling, evaluation and deployment. For each of the phases, there are many algorithms and methods available, the end-user having to select one of them. The AgentDiscover is a multi-agent based intelligent recommendation system for selection of the most appropriate solving method for each phase. This brings added value for both novice and experienced users","PeriodicalId":309740,"journal":{"name":"2006 Eighth International Symposium on Symbolic and Numeric Algorithms for Scientific Computing","volume":"50 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2006-09-26","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"128718878","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}
A major limitation of current workflow management systems appears in (1) their lack of support for flexible workflows whose structures can be modified dynamically during the execution and (2) in their failure in dealing, efficiently, with the most advanced workflow patterns. In this paper, we propose a new model which we call recursive ECATNets (RECATNets) to model workflow processes with dynamic structure and, particularly, to handle the most complex workflow patterns, in a concise way. The RECATNets extend classical ECATNets (extended concurrent algebraic term nets) with the recursion concept firstly introduced in the recursive Petri nets. We define the semantics of RECATNets in the conditional rewriting logic framework. Rewriting logic is a true concurrency and operational semantics which allows rapid prototyping using rewriting techniques and the system Maude in particular
{"title":"Modeling Workflows with Recursive ECATNets","authors":"A. Hicheur, Kamel Barkaoui, N. Boudiaf","doi":"10.1109/SYNASC.2006.52","DOIUrl":"https://doi.org/10.1109/SYNASC.2006.52","url":null,"abstract":"A major limitation of current workflow management systems appears in (1) their lack of support for flexible workflows whose structures can be modified dynamically during the execution and (2) in their failure in dealing, efficiently, with the most advanced workflow patterns. In this paper, we propose a new model which we call recursive ECATNets (RECATNets) to model workflow processes with dynamic structure and, particularly, to handle the most complex workflow patterns, in a concise way. The RECATNets extend classical ECATNets (extended concurrent algebraic term nets) with the recursion concept firstly introduced in the recursive Petri nets. We define the semantics of RECATNets in the conditional rewriting logic framework. Rewriting logic is a true concurrency and operational semantics which allows rapid prototyping using rewriting techniques and the system Maude in particular","PeriodicalId":309740,"journal":{"name":"2006 Eighth International Symposium on Symbolic and Numeric Algorithms for Scientific Computing","volume":"136 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2006-09-26","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"131849786","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}
In the field of automated reasoning, one of the most challenging (even if perhaps, somewhat overlooked) problems thus far has been to develop a means of discerning, from amongst all the truths that can be discovered and proved, those which are either useful or interesting enough to be worth recording. As for human reasoning, mathematicians are well known for their predilection towards designating certain discoveries as theorems, lemmas, corollaries, etc., whilst relegating all others as relatively unimportant. However, precisely how mathematicians determine which results to keep, and which to discard, is perhaps not so well known. Nevertheless, this practice is an essential part of the mathematical process, as it allows mathematicians to manage what would otherwise be an overwhelming amount of knowledge. MATHsAiD is a system intended for use by research mathematicians, and is designed to produce high quality theorems, as recognised by mathematicians, within a given theory. The only input required is a set of axioms and definitions for each theory. In this paper we briefly describe some of the more important methods used by MATHsAiD, most of which are based primarily on the human mathematical process
{"title":"MATHsAiD: A Mathematical Theorem Discovery Tool","authors":"R. McCasland, A. Bundy","doi":"10.1109/SYNASC.2006.51","DOIUrl":"https://doi.org/10.1109/SYNASC.2006.51","url":null,"abstract":"In the field of automated reasoning, one of the most challenging (even if perhaps, somewhat overlooked) problems thus far has been to develop a means of discerning, from amongst all the truths that can be discovered and proved, those which are either useful or interesting enough to be worth recording. As for human reasoning, mathematicians are well known for their predilection towards designating certain discoveries as theorems, lemmas, corollaries, etc., whilst relegating all others as relatively unimportant. However, precisely how mathematicians determine which results to keep, and which to discard, is perhaps not so well known. Nevertheless, this practice is an essential part of the mathematical process, as it allows mathematicians to manage what would otherwise be an overwhelming amount of knowledge. MATHsAiD is a system intended for use by research mathematicians, and is designed to produce high quality theorems, as recognised by mathematicians, within a given theory. The only input required is a set of axioms and definitions for each theory. In this paper we briefly describe some of the more important methods used by MATHsAiD, most of which are based primarily on the human mathematical process","PeriodicalId":309740,"journal":{"name":"2006 Eighth International Symposium on Symbolic and Numeric Algorithms for Scientific Computing","volume":"5 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2006-09-26","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"133415534","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
扫码关注我们
求助内容：
应助结果提醒方式：