We have devised a DNA encoding method and a corresponding DNA algorithm for the minimum spanning tree problem, an instance of optimization problems on weighted graphs. In order to find out the minimum spanning trees of a weighted graph G= (V, E, W) by means of molecular biology techniques, we encode each vertex viisinV using one recognition code of length l, l=max{[log4n], 6}; we encode each edge eijisinE using two DNA strands of length 2p=2max{wij, l}; for any two adjacent edges eije jk we add one DNA strand saijk of length wij +Wjk as an additional code. We also presented a DNA algorithm for the minimum spanning tree problem based on the proposed DNA encoding method, in which we firstly obtain the Euler cycle corresponding to the minimum spanning tree by means of the molecular biology techniques, and then the Euler cycle is converted to the minimum spanning tree. Our work provides further evidence for the ability of DNA computing to solve numerical optimization problems
针对加权图优化问题中的最小生成树问题，提出了一种DNA编码方法和相应的DNA算法。为了利用分子生物学技术求出加权图G= (V, E, W)的最小生成树，我们使用一个长度为l的识别码对每个顶点viisinV进行编码，l=max{[log4n]， 6};我们用两条长度为2p=2max{wij, l}的DNA链对每条边进行编码;对于任意两条相邻的边eijjk，我们添加一条长度为wij +Wjk的DNA链saijk作为附加代码。在提出的DNA编码方法的基础上，提出了求解最小生成树问题的DNA算法，该算法首先利用分子生物学技术得到最小生成树对应的欧拉循环，然后将欧拉循环转化为最小生成树。我们的工作为DNA计算解决数值优化问题的能力提供了进一步的证据
{"title":"DNA Computing Model for the Minimum Spanning Tree Problem","authors":"Aili Han, Daming Zhu","doi":"10.1109/SYNASC.2006.31","DOIUrl":"https://doi.org/10.1109/SYNASC.2006.31","url":null,"abstract":"We have devised a DNA encoding method and a corresponding DNA algorithm for the minimum spanning tree problem, an instance of optimization problems on weighted graphs. In order to find out the minimum spanning trees of a weighted graph G= (V, E, W) by means of molecular biology techniques, we encode each vertex viisinV using one recognition code of length l, l=max{[log4n], 6}; we encode each edge eijisinE using two DNA strands of length 2p=2max{wij, l}; for any two adjacent edges eije jk we add one DNA strand saijk of length wij +Wjk as an additional code. We also presented a DNA algorithm for the minimum spanning tree problem based on the proposed DNA encoding method, in which we firstly obtain the Euler cycle corresponding to the minimum spanning tree by means of the molecular biology techniques, and then the Euler cycle is converted to the minimum spanning tree. Our work provides further evidence for the ability of DNA computing to solve numerical optimization problems","PeriodicalId":309740,"journal":{"name":"2006 Eighth International Symposium on Symbolic and Numeric Algorithms for Scientific Computing","volume":"02 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":"131374039","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}
V. Martínez, F. Arroyo, Abraham Gutierrez, Luis Fernández
The transition P-systems performs a computation through transition between two consecutive configurations. A configuration consists in a m-tuple of multisets present at any moment in the existing m regions of the system. Transitions between two configurations are performed by using evolution rules which are in each region of the system in a non-deterministic maximally parallel manner. This paper is part of exhaustive investigation line whose objective is to implement a hardware system that evolves as it makes a transition P-system. To achieve this objective, it has been carried out a division of this generic system in several stages. The first stage was to determine active rules in a determined configuration for the membrane. The second stage is developed by obtaining the part of the system that is in charge of the application of the active rules. To count the number of times that the active rules is applied exist different algorithms. In this paper presents an algorithm with improved aspects: the number of necessary iterations to reach the final values is perfectly defined, and their adaptation to systems with any number of rules is simple
{"title":"Hardware Implementation of a Bounded Algorithm for Application of Rules in a Transition P-System","authors":"V. Martínez, F. Arroyo, Abraham Gutierrez, Luis Fernández","doi":"10.1109/SYNASC.2006.42","DOIUrl":"https://doi.org/10.1109/SYNASC.2006.42","url":null,"abstract":"The transition P-systems performs a computation through transition between two consecutive configurations. A configuration consists in a m-tuple of multisets present at any moment in the existing m regions of the system. Transitions between two configurations are performed by using evolution rules which are in each region of the system in a non-deterministic maximally parallel manner. This paper is part of exhaustive investigation line whose objective is to implement a hardware system that evolves as it makes a transition P-system. To achieve this objective, it has been carried out a division of this generic system in several stages. The first stage was to determine active rules in a determined configuration for the membrane. The second stage is developed by obtaining the part of the system that is in charge of the application of the active rules. To count the number of times that the active rules is applied exist different algorithms. In this paper presents an algorithm with improved aspects: the number of necessary iterations to reach the final values is perfectly defined, and their adaptation to systems with any number of rules is simple","PeriodicalId":309740,"journal":{"name":"2006 Eighth International Symposium on Symbolic and Numeric Algorithms for Scientific Computing","volume":"16 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":"121797110","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}
Despite the fact that several initiatives are applying grid technologies to the remote sensing computing, the deployment of proposed solutions on a large scale is not yet a reality. First we identify the former solutions. Following the conclusions and the advances in grid technologies, we propose a practical solution for remote sensing computing based on freely distributed tools. A test case is also described in which the software prototype is used to detect river bed changes
{"title":"Grid Service Based on GIMP for Processing Remote Sensing Images","authors":"D. Petcu, V. Iordan","doi":"10.1109/SYNASC.2006.40","DOIUrl":"https://doi.org/10.1109/SYNASC.2006.40","url":null,"abstract":"Despite the fact that several initiatives are applying grid technologies to the remote sensing computing, the deployment of proposed solutions on a large scale is not yet a reality. First we identify the former solutions. Following the conclusions and the advances in grid technologies, we propose a practical solution for remote sensing computing based on freely distributed tools. A test case is also described in which the software prototype is used to detect river bed changes","PeriodicalId":309740,"journal":{"name":"2006 Eighth International Symposium on Symbolic and Numeric Algorithms for Scientific Computing","volume":"40 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":"126772337","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 presented a stability analysis method for nonlinear processes with Takagi-Sugeno's (T-S) fuzzy logic controllers (FLC's). The design of FLC is based on heuristic fuzzy rules. The stability analysis of this fuzzy control model is performed using Krasovskii-LaSalle invariant set theorem with quadratic Lyapunov candidate function. This paper proves that if the Lyapunov function is negative semi-definite in the active region of each fuzzy rule then, the overall system is asymptotic stable in the sense of Lyapunov (ISL). The stability theorem presents in this paper assures sufficient conditions for the stability of the nonlinear system with FLC. The end of the paper contains an illustrative example that describes an application of the method of the stability analysis
{"title":"A Stability Analysis Method for Nonlinear Systems with Fuzzy Logic Controller","authors":"Marius-Lucian Tomescu, G. Petrov","doi":"10.1109/SYNASC.2006.10","DOIUrl":"https://doi.org/10.1109/SYNASC.2006.10","url":null,"abstract":"This paper presented a stability analysis method for nonlinear processes with Takagi-Sugeno's (T-S) fuzzy logic controllers (FLC's). The design of FLC is based on heuristic fuzzy rules. The stability analysis of this fuzzy control model is performed using Krasovskii-LaSalle invariant set theorem with quadratic Lyapunov candidate function. This paper proves that if the Lyapunov function is negative semi-definite in the active region of each fuzzy rule then, the overall system is asymptotic stable in the sense of Lyapunov (ISL). The stability theorem presents in this paper assures sufficient conditions for the stability of the nonlinear system with FLC. The end of the paper contains an illustrative example that describes an application of the method of the stability analysis","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":"126371651","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}
Y. Mota, Rafael Bello, Alberto Taboada-Crispí, A. Nowé, M. Lorenzo, G. C. Cardoso
Due to the wide availability of huge amounts of data in electronic forms, the necessity of turning such data into useful knowledge has increased. This is a proposal of learning from examples. In this paper, we propose measures to evaluate the quality of training sets used by algorithms for learning classification. Our training set assessment relies on measures provided by rough sets theory. Our experimental results involved three classifiers (k-NN, C-4.5 and MLP) applied to international data bases. The new measure we propose shows good results on these test cases
{"title":"A New Measure Based in the Rough Set Theory to Estimate the Training Set Quality","authors":"Y. Mota, Rafael Bello, Alberto Taboada-Crispí, A. Nowé, M. Lorenzo, G. C. Cardoso","doi":"10.1109/SYNASC.2006.6","DOIUrl":"https://doi.org/10.1109/SYNASC.2006.6","url":null,"abstract":"Due to the wide availability of huge amounts of data in electronic forms, the necessity of turning such data into useful knowledge has increased. This is a proposal of learning from examples. In this paper, we propose measures to evaluate the quality of training sets used by algorithms for learning classification. Our training set assessment relies on measures provided by rough sets theory. Our experimental results involved three classifiers (k-NN, C-4.5 and MLP) applied to international data bases. The new measure we propose shows good results on these test cases","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":"129149593","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 previous studies, we have introduced marked-controlled net rewriting systems and a subclass of these called marked-controlled reconfigurable nets. The main goal of these models is to analyze, simulate and verify concurrent and distributed systems that are subject to structural dynamic changes. In a marked-controlled net rewriting system, a system configuration is described as a Petri net, and a change in configuration is described as a graph rewriting rule. A marked-controlled reconfigurable net is a marked-controlled net rewriting system where a change in configuration amounts to a modification in the flow relations of the places in the domain of the involved rule in accordance with this rule, independently of the context in which this rewriting applies. In both models, the enabling of a rule not only depends on the net topology, but also depends on the net marking according to control places. In this work, we introduce marked-controlled reconfigurable workflow nets, based on Van der Aalst's workflow nets and marked-controlled reconfigurable nets, in order to model workflow systems handling structural dynamic changes. A characterization of the soundness property for marked-controlled reconfigurable workflow nets is also provided
在以前的研究中，我们已经介绍了标记控制的网络重写系统和其中的一个子类，称为标记控制的可重构网络。这些模型的主要目的是分析、模拟和验证受结构动态变化影响的并发和分布式系统。在标记控制的网络重写系统中，将系统配置描述为Petri网，将配置的变化描述为图重写规则。标记控制的可重构网络是一种标记控制的网络重写系统，其中配置的改变相当于根据该规则修改所涉及规则域内位置的流动关系，而独立于该重写应用的上下文。在这两种模型中，规则的启用不仅取决于网络拓扑结构，还取决于根据控制位置对网络进行标记。本文在Van der Aalst工作流网络和标记控制可重构工作流网络的基础上，引入标记控制可重构工作流网络，对处理结构动态变化的工作流系统进行建模。给出了标记控制的可重构工作流网络的稳健性表征
{"title":"Marked-Controlled Reconfigurable Workflow Nets","authors":"Marisa Llorens, Javier Oliver","doi":"10.1109/SYNASC.2006.49","DOIUrl":"https://doi.org/10.1109/SYNASC.2006.49","url":null,"abstract":"In previous studies, we have introduced marked-controlled net rewriting systems and a subclass of these called marked-controlled reconfigurable nets. The main goal of these models is to analyze, simulate and verify concurrent and distributed systems that are subject to structural dynamic changes. In a marked-controlled net rewriting system, a system configuration is described as a Petri net, and a change in configuration is described as a graph rewriting rule. A marked-controlled reconfigurable net is a marked-controlled net rewriting system where a change in configuration amounts to a modification in the flow relations of the places in the domain of the involved rule in accordance with this rule, independently of the context in which this rewriting applies. In both models, the enabling of a rule not only depends on the net topology, but also depends on the net marking according to control places. In this work, we introduce marked-controlled reconfigurable workflow nets, based on Van der Aalst's workflow nets and marked-controlled reconfigurable nets, in order to model workflow systems handling structural dynamic changes. A characterization of the soundness property for marked-controlled reconfigurable workflow nets is also provided","PeriodicalId":309740,"journal":{"name":"2006 Eighth International Symposium on Symbolic and Numeric Algorithms for Scientific Computing","volume":"128 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":"134499483","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 presents the implementation of a theoretical model intended for the simulation and presentation of real world systems. The proposed model is the active objects model due to its flexibility and extendibility. Its structure offers the possibility of accurately representing real objects with structure and behavior. Due to the high computing requirements of the model, this paper focuses on the implementation on a distributed environment, more specifically on a grid network
{"title":"Active Objects Based Application over Grid Environment","authors":"Rares Barbantan, D. Gorgan","doi":"10.1109/SYNASC.2006.13","DOIUrl":"https://doi.org/10.1109/SYNASC.2006.13","url":null,"abstract":"This paper presents the implementation of a theoretical model intended for the simulation and presentation of real world systems. The proposed model is the active objects model due to its flexibility and extendibility. Its structure offers the possibility of accurately representing real objects with structure and behavior. Due to the high computing requirements of the model, this paper focuses on the implementation on a distributed environment, more specifically on a grid network","PeriodicalId":309740,"journal":{"name":"2006 Eighth International Symposium on Symbolic and Numeric Algorithms for Scientific Computing","volume":"14 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":"115472171","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}
C. Bǎdicǎ, Gabriel-George Popa, Mihnea Scafes, M. Ganzha, M. Gawinecki, P. Kobzdej, M. Paprzycki
In our previous paper we have established that to develop an extensible agent-based e-commerce system it is necessary to logically separate the negotiation process from other parts of the system. This paper deals with the design of the "negotiation box" - the component that actually runs the negotiation processes. Furthermore, interaction of the negotiation box with the rest of the system is addressed
{"title":"Design Considerations for a Negotiation Component in a Model E-commerce Agent System","authors":"C. Bǎdicǎ, Gabriel-George Popa, Mihnea Scafes, M. Ganzha, M. Gawinecki, P. Kobzdej, M. Paprzycki","doi":"10.1109/SYNASC.2006.28","DOIUrl":"https://doi.org/10.1109/SYNASC.2006.28","url":null,"abstract":"In our previous paper we have established that to develop an extensible agent-based e-commerce system it is necessary to logically separate the negotiation process from other parts of the system. This paper deals with the design of the \"negotiation box\" - the component that actually runs the negotiation processes. Furthermore, interaction of the negotiation box with the rest of the system is addressed","PeriodicalId":309740,"journal":{"name":"2006 Eighth International Symposium on Symbolic and Numeric Algorithms for Scientific Computing","volume":"17 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":"123667313","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 this paper the author proposes non-Archimedean multiple-validity and construct the logical language with the related semantics. Further he built non-Archimedean valued sequent logic. Notice that non-Archimedean valued logical system is considered for the first time
{"title":"Non-Archimedean Valued Sequent Logic","authors":"A. Schumann","doi":"10.1109/SYNASC.2006.57","DOIUrl":"https://doi.org/10.1109/SYNASC.2006.57","url":null,"abstract":"In this paper the author proposes non-Archimedean multiple-validity and construct the logical language with the related semantics. Further he built non-Archimedean valued sequent logic. Notice that non-Archimedean valued logical system is considered for the first time","PeriodicalId":309740,"journal":{"name":"2006 Eighth International Symposium on Symbolic and Numeric Algorithms for Scientific Computing","volume":"37 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":"123779402","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 this paper, the approach to the development of deductive assistance based on the current state of the System for Automated Deduction, SAD, is described briefly. The SAD may be considered as a three-dimensional "shell" for deductive assistance in a formal natural language environment when solving a number of scientific and industrial tasks requiring automated theorem proving, verification of formal texts, construction of knowledge bases for formalized theories, integration of symbolic calculation with deduction, and so on
本文简要介绍了基于自动扣除系统(System for Automated Deduction, SAD)现状的演绎援助开发方法。在解决一些需要自动定理证明、正式文本验证、形式化理论知识库的构建、符号计算与演绎的整合等科学和工业任务时，SAD可以被视为形式化自然语言环境中演绎辅助的三维“外壳”
{"title":"The SAD System in Three Dimensions","authors":"A. Anisimov, Alexander V. Lyaletski","doi":"10.1109/SYNASC.2006.75","DOIUrl":"https://doi.org/10.1109/SYNASC.2006.75","url":null,"abstract":"In this paper, the approach to the development of deductive assistance based on the current state of the System for Automated Deduction, SAD, is described briefly. The SAD may be considered as a three-dimensional \"shell\" for deductive assistance in a formal natural language environment when solving a number of scientific and industrial tasks requiring automated theorem proving, verification of formal texts, construction of knowledge bases for formalized theories, integration of symbolic calculation with deduction, and so on","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":"130596285","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
扫码关注我们
求助内容：
应助结果提醒方式：