Adrian Ion, Thomas Illetschko, Y. Haxhimusa, W. Kropatsch
Most of the existing work regarding topology preserving hierarchies is mainly preoccupied with 2D domains. But recently attention has turned to 3D, and more generally, nD representations. Even more than in 2D, the necessity for reducing these representations exists and motivates the research in hierarchical structures i.e. pyramids. Using representations that support any dimension, like e.g. the combinatorial map, n dimensional irregular pyramids can be built, thus obtaining reduced representations of the original data, while preserving the topology. This paper presents 3D combinatorial maps and the primitive operations needed to simplify such representations. Minimal configurations of the three primitive topological configurations, simplex, hole, and tunnel, and two possible configurations for two tori are presented. Experimental results and possible applications show the potential of the approach
{"title":"Distinguishing 3D-Topological Configurations of Two Tori","authors":"Adrian Ion, Thomas Illetschko, Y. Haxhimusa, W. Kropatsch","doi":"10.1109/SYNASC.2006.30","DOIUrl":"https://doi.org/10.1109/SYNASC.2006.30","url":null,"abstract":"Most of the existing work regarding topology preserving hierarchies is mainly preoccupied with 2D domains. But recently attention has turned to 3D, and more generally, nD representations. Even more than in 2D, the necessity for reducing these representations exists and motivates the research in hierarchical structures i.e. pyramids. Using representations that support any dimension, like e.g. the combinatorial map, n dimensional irregular pyramids can be built, thus obtaining reduced representations of the original data, while preserving the topology. This paper presents 3D combinatorial maps and the primitive operations needed to simplify such representations. Minimal configurations of the three primitive topological configurations, simplex, hole, and tunnel, and two possible configurations for two tori are presented. Experimental results and possible applications show the potential of the approach","PeriodicalId":309740,"journal":{"name":"2006 Eighth International Symposium on Symbolic and Numeric Algorithms for Scientific Computing","volume":"6 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":"131891328","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 is devoted to a new variational model for color texture modeling and color image decomposition into cartoon and texture. A given image in the RGB space is decomposed into a cartoon part and a texture part. The cartoon part is modeled by the space of vector-valued functions of bounded variation, while the texture or noise part is modeled by a space of oscillatory functions, dual in some sense of the BV space. Examples for color image decomposition, color image denoising, and color texture discrimination and segmentation will be presented
{"title":"Color Texture Modeling and Color Image Decomposition in a Variational-PDE Approach","authors":"L. Vese, S. Osher","doi":"10.1109/SYNASC.2006.24","DOIUrl":"https://doi.org/10.1109/SYNASC.2006.24","url":null,"abstract":"This paper is devoted to a new variational model for color texture modeling and color image decomposition into cartoon and texture. A given image in the RGB space is decomposed into a cartoon part and a texture part. The cartoon part is modeled by the space of vector-valued functions of bounded variation, while the texture or noise part is modeled by a space of oscillatory functions, dual in some sense of the BV space. Examples for color image decomposition, color image denoising, and color texture discrimination and segmentation will be presented","PeriodicalId":309740,"journal":{"name":"2006 Eighth International Symposium on Symbolic and Numeric Algorithms for Scientific Computing","volume":"94 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":"116266796","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 reports our initial results with the development of a multi-agent distributed system for Web news content syndication. Our proposal builds on a multi-agent platform compliant with FIPA specifications. An initial implementation, design outline and sample experiment are presented
{"title":"Conceptual Architecture of a Multi-Agent System for News Syndication","authors":"Iulia Dogaru, A. Bădică, C. Bǎdicǎ","doi":"10.1109/SYNASC.2006.26","DOIUrl":"https://doi.org/10.1109/SYNASC.2006.26","url":null,"abstract":"This paper reports our initial results with the development of a multi-agent distributed system for Web news content syndication. Our proposal builds on a multi-agent platform compliant with FIPA specifications. An initial implementation, design outline and sample experiment are presented","PeriodicalId":309740,"journal":{"name":"2006 Eighth International Symposium on Symbolic and Numeric Algorithms for Scientific Computing","volume":"42 5","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2006-09-26","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"120985824","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}
Colored Petri nets are a formalism widely used to specify and analyze workflow models. Finding the set of transition color instances enabled in a given marking is a basic task affecting reachability graph construction, model-checking, and especially discrete-event simulation, which is an interesting alternative when analytical solutions are unfeasible due to state-space explosion. An introduced symbolic approach to colored transition enabling test is the kernel for the efficient implementation of several algorithms for the analysis of SWN (a stochastic CPN flavor retaining power that exploits behavioral symmetries) based on state-space exploration. An application example of the symbolic enabling test for efficient simulation of SWN workflow models is presented. The example shows that the technique can be easily integrated to the SWN symbolic firing rule
{"title":"Applying a Symbolic Approach for SWN Enabling Test to Workflow Models","authors":"L. Capra","doi":"10.1109/SYNASC.2006.16","DOIUrl":"https://doi.org/10.1109/SYNASC.2006.16","url":null,"abstract":"Colored Petri nets are a formalism widely used to specify and analyze workflow models. Finding the set of transition color instances enabled in a given marking is a basic task affecting reachability graph construction, model-checking, and especially discrete-event simulation, which is an interesting alternative when analytical solutions are unfeasible due to state-space explosion. An introduced symbolic approach to colored transition enabling test is the kernel for the efficient implementation of several algorithms for the analysis of SWN (a stochastic CPN flavor retaining power that exploits behavioral symmetries) based on state-space exploration. An application example of the symbolic enabling test for efficient simulation of SWN workflow models is presented. The example shows that the technique can be easily integrated to the SWN symbolic firing rule","PeriodicalId":309740,"journal":{"name":"2006 Eighth International Symposium on Symbolic and Numeric Algorithms for Scientific Computing","volume":"32 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":"117130155","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 Dixon resultant for a bivariate polynomial system has many interesting properties. When the unmixed canonical bidegree monomial support of the polynomial system undergoes corner cutting, some monomial points become distinguished by being exposed. When a corner has exactly three exposed monomial points, certain rows and columns of the Dixon matrix, called almost-exposed rows and columns, produce a factor which is a power of the bracket corresponding to the three exposed points. The power is determined by the relative positions of these three exposed points. This observation is very useful when constructing quotient Dixon resultants
{"title":"Bracket Producing Rows and Columns of the Dixon Determinant","authors":"Wei Xiao, E. Chionh","doi":"10.1109/SYNASC.2006.20","DOIUrl":"https://doi.org/10.1109/SYNASC.2006.20","url":null,"abstract":"The Dixon resultant for a bivariate polynomial system has many interesting properties. When the unmixed canonical bidegree monomial support of the polynomial system undergoes corner cutting, some monomial points become distinguished by being exposed. When a corner has exactly three exposed monomial points, certain rows and columns of the Dixon matrix, called almost-exposed rows and columns, produce a factor which is a power of the bracket corresponding to the three exposed points. The power is determined by the relative positions of these three exposed points. This observation is very useful when constructing quotient Dixon resultants","PeriodicalId":309740,"journal":{"name":"2006 Eighth International Symposium on Symbolic and Numeric Algorithms for Scientific Computing","volume":"196 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":"123076619","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 present paper studies the numerical computation of the extreme eigenvalues of a n times n real symmetric matrix A, by the means of the Newton's approximate method for the characteristic polynomial PA(lambda). An iterative algorithm is also presented involving the computation of a trace of an appropriate matrix, instead of using the evaluation of PA(lambda) and its derivative. Numerical examples solved with this algorithm are to be found within as well
{"title":"On the Newton's Iterative Method for the Characteristic Equation of a Real Symmetric Matrix","authors":"R. Militaru","doi":"10.1109/SYNASC.2006.59","DOIUrl":"https://doi.org/10.1109/SYNASC.2006.59","url":null,"abstract":"The present paper studies the numerical computation of the extreme eigenvalues of a n times n real symmetric matrix A, by the means of the Newton's approximate method for the characteristic polynomial PA(lambda). An iterative algorithm is also presented involving the computation of a trace of an appropriate matrix, instead of using the evaluation of PA(lambda) and its derivative. Numerical examples solved with this algorithm are to be found within as well","PeriodicalId":309740,"journal":{"name":"2006 Eighth International Symposium on Symbolic and Numeric Algorithms for Scientific Computing","volume":"1 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":"126079665","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}
Summary form only given. Pen-based user interfaces offer tantalizing potential for mathematical software systems. In contrast to normal text, entering and editing mathematical formulae with a digital pen can be much more natural than using a keyboard. Machine recognition of mathematical handwriting, however, is more complex than recognizing natural language text. In this context it is necessary to deal with a vast array of similar symbols and the analysis of the two-dimensional syntactic structure of formulae. This talk outlines our work in this area. We describe our architecture for a mathematical handwriting component that can be embedded in various applications. These include computer algebra systems, such as Maple, and document processing applications, such as Microsoft Word. We describe the problem of mathematical character recognition and detail how recognition rates can be enhanced using data derived from the analysis of digital libraries
{"title":"Improving Pen-Based Mathematical Interfaces","authors":"S. Watt","doi":"10.1109/SYNASC.2006.46","DOIUrl":"https://doi.org/10.1109/SYNASC.2006.46","url":null,"abstract":"Summary form only given. Pen-based user interfaces offer tantalizing potential for mathematical software systems. In contrast to normal text, entering and editing mathematical formulae with a digital pen can be much more natural than using a keyboard. Machine recognition of mathematical handwriting, however, is more complex than recognizing natural language text. In this context it is necessary to deal with a vast array of similar symbols and the analysis of the two-dimensional syntactic structure of formulae. This talk outlines our work in this area. We describe our architecture for a mathematical handwriting component that can be embedded in various applications. These include computer algebra systems, such as Maple, and document processing applications, such as Microsoft Word. We describe the problem of mathematical character recognition and detail how recognition rates can be enhanced using data derived from the analysis of digital libraries","PeriodicalId":309740,"journal":{"name":"2006 Eighth International Symposium on Symbolic and Numeric Algorithms for Scientific Computing","volume":"26 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":"121917760","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 article presents a multi-input multi-output (MIMO) neuro-fuzzy model for a pharmaceutical research problem. Designing drugs is a current problem in the pharmaceutical research domain. By designing a drug we mean to choose some variables of drug formulation (inputs), for obtaining optimal characteristics of drug (outputs). To solve such a problem we propose a neuro-fuzzy model and the performance is compared with artificial neural networks. This research used the experimental data obtained from the Laboratory of Pharmaceutical Techniques of the Faculty of Pharmacy in Cluj-Napoca, Romania. The idea is to build a multi-input - multi-output neuro-fuzzy model depicting the dependence between inputs and outputs. A first order Takagi-Sugeno type fuzzy inference system is developed and it is fine tuned using neural network learning techniques. Bootstrap techniques were used to generate more samples of data and the number of experimental data is reduced due to the costs and time durations of experimentations. We obtain in this way a better estimation of some drug parameters. Experiment results indicate that the proposed method is efficient
{"title":"Engineering Drug Design Using a Multi-Input Multi-Output Neuro-Fuzzy System","authors":"C. Grosan, A. Abraham, S. Tigan","doi":"10.1109/SYNASC.2006.38","DOIUrl":"https://doi.org/10.1109/SYNASC.2006.38","url":null,"abstract":"This article presents a multi-input multi-output (MIMO) neuro-fuzzy model for a pharmaceutical research problem. Designing drugs is a current problem in the pharmaceutical research domain. By designing a drug we mean to choose some variables of drug formulation (inputs), for obtaining optimal characteristics of drug (outputs). To solve such a problem we propose a neuro-fuzzy model and the performance is compared with artificial neural networks. This research used the experimental data obtained from the Laboratory of Pharmaceutical Techniques of the Faculty of Pharmacy in Cluj-Napoca, Romania. The idea is to build a multi-input - multi-output neuro-fuzzy model depicting the dependence between inputs and outputs. A first order Takagi-Sugeno type fuzzy inference system is developed and it is fine tuned using neural network learning techniques. Bootstrap techniques were used to generate more samples of data and the number of experimental data is reduced due to the costs and time durations of experimentations. We obtain in this way a better estimation of some drug parameters. Experiment results indicate that the proposed method is efficient","PeriodicalId":309740,"journal":{"name":"2006 Eighth International Symposium on Symbolic and Numeric Algorithms for Scientific Computing","volume":"4 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":"121647560","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 international trading agent competition (TAC) provides a dynamic trading environment aimed at testing different strategies to be used in the design of autonomous agents for e-commerce and automated marketplaces. The TAC supply chain management (TAC/SCM) scenario defines a complex six-player game with severely incomplete and imperfect information, and high-dimensional strategy spaces. The paper presents PhantAgent, a successful trading agent in the 2006 TAC/SCM competition. The paper discusses PhantAgent architecture, the basic ideas and strategies that were used in its design, and emphasizes that the unpredictable nature of the environment is the main challenge in building autonomous agents in real-world environments
{"title":"A Dynamic Strategy Agent for Supply Chain Management","authors":"Mihai Stan, Bogdanov Stan, A. Florea","doi":"10.1109/SYNASC.2006.1","DOIUrl":"https://doi.org/10.1109/SYNASC.2006.1","url":null,"abstract":"The international trading agent competition (TAC) provides a dynamic trading environment aimed at testing different strategies to be used in the design of autonomous agents for e-commerce and automated marketplaces. The TAC supply chain management (TAC/SCM) scenario defines a complex six-player game with severely incomplete and imperfect information, and high-dimensional strategy spaces. The paper presents PhantAgent, a successful trading agent in the 2006 TAC/SCM competition. The paper discusses PhantAgent architecture, the basic ideas and strategies that were used in its design, and emphasizes that the unpredictable nature of the environment is the main challenge in building autonomous agents in real-world environments","PeriodicalId":309740,"journal":{"name":"2006 Eighth International Symposium on Symbolic and Numeric Algorithms for Scientific Computing","volume":"11 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":"133927900","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}
Emergence is usually the way in which a collective organisation behaves differently than the sum of its elements. We propose here an overview of different ways this paradigm is used in several fields of artificial intelligence and we propose some theoretical tracks relying on some works in the field of machine learning
{"title":"Emergence in Problem Solving, Classification and Machine Learning","authors":"J. Quinqueton","doi":"10.1109/SYNASC.2006.37","DOIUrl":"https://doi.org/10.1109/SYNASC.2006.37","url":null,"abstract":"Emergence is usually the way in which a collective organisation behaves differently than the sum of its elements. We propose here an overview of different ways this paradigm is used in several fields of artificial intelligence and we propose some theoretical tracks relying on some works in the field of machine learning","PeriodicalId":309740,"journal":{"name":"2006 Eighth International Symposium on Symbolic and Numeric Algorithms for Scientific Computing","volume":"29 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":"125719729","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
扫码关注我们
求助内容：
应助结果提醒方式：