In this paper we present a variation of the Campos' method for the solution of a fuzzy zero-sum two-person game. Campos considered games with the imprecise values in the matrix of payoffs given by triangular fuzzy numbers. The solution method was based on the establishment of a Fuzzy Linear Programming problem for each player. The method was shown as a generalization of that conventionally used in the solution of classical games, with auxiliary models resulting from the application of some of the standard methods for ranking fuzzy numbers. In this paper, we consider the fuzzy number ranking method proposed by Ezzati et al., which induces a total order on the set of fuzzy numbers, can be easily applied to any kind of fuzzy number, so enlarging the scope of the application of Campos's method and allowing for further extensions.
{"title":"Linear Programming Modeling for Solving Fuzzy Zero-Sum Games","authors":"S. L. Briao, G. Dimuro, C. M. Machado","doi":"10.1109/WEIT.2013.12","DOIUrl":"https://doi.org/10.1109/WEIT.2013.12","url":null,"abstract":"In this paper we present a variation of the Campos' method for the solution of a fuzzy zero-sum two-person game. Campos considered games with the imprecise values in the matrix of payoffs given by triangular fuzzy numbers. The solution method was based on the establishment of a Fuzzy Linear Programming problem for each player. The method was shown as a generalization of that conventionally used in the solution of classical games, with auxiliary models resulting from the application of some of the standard methods for ranking fuzzy numbers. In this paper, we consider the fuzzy number ranking method proposed by Ezzati et al., which induces a total order on the set of fuzzy numbers, can be easily applied to any kind of fuzzy number, so enlarging the scope of the application of Campos's method and allowing for further extensions.","PeriodicalId":295142,"journal":{"name":"2013 2nd Workshop-School on Theoretical Computer Science","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2013-10-15","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"130891409","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}
Matheus Machado dos Santos, Mauricio G. Goulart, G. J. Gelatti, K. Machado, A. Werhli, O. Mendizabal
Proteins play a key role in cells' function and metabolism. Their functions are directly related with the three-dimensional (3D) native structure. Different algorithms have been proposed to predict the 3D protein structure from the amino acids sequence by minimizing its free energy, nonetheless, this problem still a great challenge in structural biology. The space of possible conformations becomes very large for long proteins, making it difficult to search for the optimal minimum free energy with the available computational resources. Due to the complexity involved in the protein folding problem the researchers have developed some simplified protein models as the hydrophobic-polar (HP). In this work we propose a parallel algorithm to predict protein conformations in HP model by dividing tasks among processing nodes distributed in a server cluster. With this approach we circumvent the memory constraints observed by other approaches. We discuss the correctness of the algorithm based on the verification results achieved by model checking. The performance of our algorithm was evaluated but although benefits of parallel execution are noticeable for small proteins, we demonstrated that our algorithm has an exponential complexity.
{"title":"Parallel Algorithm for the HP Protein Folding Problem","authors":"Matheus Machado dos Santos, Mauricio G. Goulart, G. J. Gelatti, K. Machado, A. Werhli, O. Mendizabal","doi":"10.1109/WEIT.2013.18","DOIUrl":"https://doi.org/10.1109/WEIT.2013.18","url":null,"abstract":"Proteins play a key role in cells' function and metabolism. Their functions are directly related with the three-dimensional (3D) native structure. Different algorithms have been proposed to predict the 3D protein structure from the amino acids sequence by minimizing its free energy, nonetheless, this problem still a great challenge in structural biology. The space of possible conformations becomes very large for long proteins, making it difficult to search for the optimal minimum free energy with the available computational resources. Due to the complexity involved in the protein folding problem the researchers have developed some simplified protein models as the hydrophobic-polar (HP). In this work we propose a parallel algorithm to predict protein conformations in HP model by dividing tasks among processing nodes distributed in a server cluster. With this approach we circumvent the memory constraints observed by other approaches. We discuss the correctness of the algorithm based on the verification results achieved by model checking. The performance of our algorithm was evaluated but although benefits of parallel execution are noticeable for small proteins, we demonstrated that our algorithm has an exponential complexity.","PeriodicalId":295142,"journal":{"name":"2013 2nd Workshop-School on Theoretical Computer Science","volume":"152 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2013-10-15","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"123260832","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 problem of extending function from a subset to the entire set can be considered for several operators in different branches of knowledge. We have provided a method to extend lattice-valued t-norms, t-conorms end fuzzy negations, in our previous investigations. In this paper, we apply this extension method for lattice-valued QL-implications and analyze its behavior. We also discuss about the relation between extension and conjugate of a given implication.
{"title":"Extension of Lattice-valued QL-implications","authors":"E. Palmeira, B. Bedregal","doi":"10.1109/WEIT.2013.38","DOIUrl":"https://doi.org/10.1109/WEIT.2013.38","url":null,"abstract":"The problem of extending function from a subset to the entire set can be considered for several operators in different branches of knowledge. We have provided a method to extend lattice-valued t-norms, t-conorms end fuzzy negations, in our previous investigations. In this paper, we apply this extension method for lattice-valued QL-implications and analyze its behavior. We also discuss about the relation between extension and conjugate of a given implication.","PeriodicalId":295142,"journal":{"name":"2013 2nd Workshop-School on Theoretical Computer Science","volume":"43 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2013-10-15","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"125919384","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}
Lambda calculus is a formal system built around the concepts of function definition and function application. It is a minimalistic Turing-computable system that has a great influence on the design of functional programming. This paper is a tutorial on the untyped lambda calculus and its use as an idealised programming language.
{"title":"An Introduction to Lambda Calculus and Functional Programming","authors":"Rodrigo Machado","doi":"10.1109/WEIT.2013.40","DOIUrl":"https://doi.org/10.1109/WEIT.2013.40","url":null,"abstract":"Lambda calculus is a formal system built around the concepts of function definition and function application. It is a minimalistic Turing-computable system that has a great influence on the design of functional programming. This paper is a tutorial on the untyped lambda calculus and its use as an idealised programming language.","PeriodicalId":295142,"journal":{"name":"2013 2nd Workshop-School on Theoretical Computer Science","volume":"176 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2013-10-15","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"124351526","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 main contribution of this paper is the study of a fuzzy X(N)or class, named as fuzzy s-(N)Xor, which is explicitly defined and graphically represented by the product t-norm, probabilistic sum and standard negation. The fuzzy s-Xor (co)implications obtained by such fuzzy s-X(N)or connectives are also considered along with the corresponding conjugate functions. The relationship between a fuzzy s-Xor E and its conjugate function Eρ is discussed in the following together with their dual constructions. Additionally, for a fuzzy s-Xor E connective both constructions, its dual connective XNor EN and its conjugate Eρ, satisfy analogous properties of the e-Xor class.
{"title":"Analysing Properties, Conjugate and Dual Constructions on Fuzzy s-X(N)or Connectives","authors":"Diego Jaccottet, R. Reiser, A. Yamin, B. Bedregal","doi":"10.1109/WEIT.2013.37","DOIUrl":"https://doi.org/10.1109/WEIT.2013.37","url":null,"abstract":"The main contribution of this paper is the study of a fuzzy X(N)or class, named as fuzzy s-(N)Xor, which is explicitly defined and graphically represented by the product t-norm, probabilistic sum and standard negation. The fuzzy s-Xor (co)implications obtained by such fuzzy s-X(N)or connectives are also considered along with the corresponding conjugate functions. The relationship between a fuzzy s-Xor E and its conjugate function Eρ is discussed in the following together with their dual constructions. Additionally, for a fuzzy s-Xor E connective both constructions, its dual connective XNor EN and its conjugate Eρ, satisfy analogous properties of the e-Xor class.","PeriodicalId":295142,"journal":{"name":"2013 2nd Workshop-School on Theoretical Computer Science","volume":"15 3","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2013-10-15","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"121199262","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 an extension of the VPE-qGM execution environment in order to support parallel execution using OpenMP. As a relevant part of a broader project represented by the simulation framework D-GM which aims to achieve quantum simulation on hybrid architectures (clusters, multicore CPUs and GPUs), this work enables the control and execution of the simulation from multicore architectures. This proposal is shown by providing relevant management simulation on multicore CPUs, which will be later combined with GPU targeted implementations. From the synergy between these implementations, this work aims to establish a general platform for hybrid simulation, exploring different architectures usually found in clusters and expanding the capabilities of the simulation environment VPE-qGM.
{"title":"qGMC-Analyzer -- Quantum Simulation on Multicore Architectures","authors":"Murilo Schmalfuss, R. Reiser, M. Pilla, A. Maron","doi":"10.1109/WEIT.2013.25","DOIUrl":"https://doi.org/10.1109/WEIT.2013.25","url":null,"abstract":"This paper presents an extension of the VPE-qGM execution environment in order to support parallel execution using OpenMP. As a relevant part of a broader project represented by the simulation framework D-GM which aims to achieve quantum simulation on hybrid architectures (clusters, multicore CPUs and GPUs), this work enables the control and execution of the simulation from multicore architectures. This proposal is shown by providing relevant management simulation on multicore CPUs, which will be later combined with GPU targeted implementations. From the synergy between these implementations, this work aims to establish a general platform for hybrid simulation, exploring different architectures usually found in clusters and expanding the capabilities of the simulation environment VPE-qGM.","PeriodicalId":295142,"journal":{"name":"2013 2nd Workshop-School on Theoretical Computer Science","volume":"25 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2013-10-15","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"124758929","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 consider the fuzzy lattice notion introduced by Chon, characterize a fuzzy ideal on operation of product between bounded fuzzy lattices. Define fuzzy a-ideals of fuzzy lattices and some properties analogous to the classical theory are also proved. Moreover, we characterize a fuzzy a-ideal on operation of product between bounded fuzzy lattices and prove results involving a fuzzy a-ideal of the product operator between fuzzy lattices and the product between fuzzy α-ideals of the bounded fuzzy lattices.
{"title":"Fuzzy a-Ideals of Product Operator on Bounded Fuzzy Lattices","authors":"I. Mezzomo, B. Bedregal, R. Santiago, R. Reiser","doi":"10.1109/WEIT.2013.15","DOIUrl":"https://doi.org/10.1109/WEIT.2013.15","url":null,"abstract":"We consider the fuzzy lattice notion introduced by Chon, characterize a fuzzy ideal on operation of product between bounded fuzzy lattices. Define fuzzy a-ideals of fuzzy lattices and some properties analogous to the classical theory are also proved. Moreover, we characterize a fuzzy a-ideal on operation of product between bounded fuzzy lattices and prove results involving a fuzzy a-ideal of the product operator between fuzzy lattices and the product between fuzzy α-ideals of the bounded fuzzy lattices.","PeriodicalId":295142,"journal":{"name":"2013 2nd Workshop-School on Theoretical Computer Science","volume":"132 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2013-10-15","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"128362666","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}
Taina Carvalho, Daiane Andrade, J. Silveira, Victor Auler, S. Cavalheiro, M. Aguiar, Luciana Foss, A. Pernas, R. Reiser
Computational thinking aims to employ Computer Science foundations to solve problems in different knowledge areas. This paper describes projects related to computational thinking and starts a discussion on the challenges for implementing computational thinking in primary and secondary education in Brazil.
{"title":"Discussing the Challenges Related to Deployment of Computational Thinking in Brazilian Basic Education","authors":"Taina Carvalho, Daiane Andrade, J. Silveira, Victor Auler, S. Cavalheiro, M. Aguiar, Luciana Foss, A. Pernas, R. Reiser","doi":"10.1109/WEIT.2013.27","DOIUrl":"https://doi.org/10.1109/WEIT.2013.27","url":null,"abstract":"Computational thinking aims to employ Computer Science foundations to solve problems in different knowledge areas. This paper describes projects related to computational thinking and starts a discussion on the challenges for implementing computational thinking in primary and secondary education in Brazil.","PeriodicalId":295142,"journal":{"name":"2013 2nd Workshop-School on Theoretical Computer Science","volume":"19 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2013-10-15","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"132002111","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}
Isabelle is a generic meta-logical framework for implementing logical formalisms, and Isabelle/HOL is the specialization of Isabelle for HOL, which stands for Higher Order Logic. In programming language theory, formal semantics is the field concerned with the rigorous mathematical study of the meaning of programming languages. In this paper we develop a relational denotational semantics for a small imperative programming language and implement it as a theory in Isabelle/HOL. We give special attention to the specification of monotonic fix point functional for loops and provide non-trivial proofs of interesting lemmas and properties with the structured proof language Isar.
{"title":"Programming Language Semantics with Isabelle/HOL","authors":"A. Martini","doi":"10.1109/WEIT.2013.29","DOIUrl":"https://doi.org/10.1109/WEIT.2013.29","url":null,"abstract":"Isabelle is a generic meta-logical framework for implementing logical formalisms, and Isabelle/HOL is the specialization of Isabelle for HOL, which stands for Higher Order Logic. In programming language theory, formal semantics is the field concerned with the rigorous mathematical study of the meaning of programming languages. In this paper we develop a relational denotational semantics for a small imperative programming language and implement it as a theory in Isabelle/HOL. We give special attention to the specification of monotonic fix point functional for loops and provide non-trivial proofs of interesting lemmas and properties with the structured proof language Isar.","PeriodicalId":295142,"journal":{"name":"2013 2nd Workshop-School on Theoretical Computer Science","volume":"90 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2013-10-15","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"121487380","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}
Marcos Antonio de Oliveira Junior, L. Ribeiro, L. Duarte, É. Cota
This paper presents an approach for model specification in the context of Model Checking, using graph grammars. The choice for this formal method is justified by the visual language provided by Graph Grammar and the possibility of using it to check properties of a system. Our approach is based on the analysis of a graph grammar obtained from trace information generated by Java applications. The process of creating such graph grammar from execution traces follows the main ideas of an existing approach that allows the generation of labeled transition systems from Java code. The main objective of this work is to find a way to automate the process of generating a graph grammar, using the information extracted from the source code and execution traces. For this, we developed an algorithm that maps system information, such as values of variables and possible transitions between states of a program, to rules of a graph grammar. To evaluate the methodology used in our approach, we conducted two experiments with toy applications and discuss the results obtained.
{"title":"Specification of Models Based on Contexts using Graph Grammars","authors":"Marcos Antonio de Oliveira Junior, L. Ribeiro, L. Duarte, É. Cota","doi":"10.1109/WEIT.2013.36","DOIUrl":"https://doi.org/10.1109/WEIT.2013.36","url":null,"abstract":"This paper presents an approach for model specification in the context of Model Checking, using graph grammars. The choice for this formal method is justified by the visual language provided by Graph Grammar and the possibility of using it to check properties of a system. Our approach is based on the analysis of a graph grammar obtained from trace information generated by Java applications. The process of creating such graph grammar from execution traces follows the main ideas of an existing approach that allows the generation of labeled transition systems from Java code. The main objective of this work is to find a way to automate the process of generating a graph grammar, using the information extracted from the source code and execution traces. For this, we developed an algorithm that maps system information, such as values of variables and possible transitions between states of a program, to rules of a graph grammar. To evaluate the methodology used in our approach, we conducted two experiments with toy applications and discuss the results obtained.","PeriodicalId":295142,"journal":{"name":"2013 2nd Workshop-School on Theoretical Computer Science","volume":"14 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2013-10-15","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"126807048","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
扫码关注我们
求助内容：
应助结果提醒方式：