Electronic Notes in Theoretical Computer Science最新文献_第6页

A Microservice Approach for a Cellular Automata Parallel Programming Environment 元胞自动机并行编程环境的微服务方法

Electronic Notes in Theoretical Computer Science Pub Date : 2020-06-01 DOI: 10.1016/j.entcs.2020.02.016

Aurelio Vivas , John Sanabria

{"title":"A Microservice Approach for a Cellular Automata Parallel Programming Environment","authors":"Aurelio Vivas , John Sanabria","doi":"10.1016/j.entcs.2020.02.016","DOIUrl":"10.1016/j.entcs.2020.02.016","url":null,"abstract":"<div><p>This paper presents an architecture for a parallel programming environment designed to assist the process of writing parallel programs. The proposed architecture allows the integration of several tools such as parallel programming skeletons and parallelizing compilers, among others. On the one hand, parallel programming skeletons simplify the design of parallel algorithms. On the other hand, parallelizing compilers rely on compiler capabilities to translate sequential programs into ones capable of using multiple processing units (CPU/GPU) found in personal computers (PCs). The technological solution presented in this work follows a microservices-oriented approach. This approach eases the integration of new parallel programming tools in the existing deployment through well-known protocols and existing services. We show how the aforementioned parallel programming tools were integrated to support the coding and parallelization of a general purpose cellular automata. Since the parallelization rely on the capabilities underlying to each tool, the focus of this work is not to deal with an efficient cellular automata parallelization. Instead, a promising microservice approach to the development of an extensible and scalable parallel programming environment is presented.</p></div>","PeriodicalId":38770,"journal":{"name":"Electronic Notes in Theoretical Computer Science","volume":null,"pages":null},"PeriodicalIF":0.0,"publicationDate":"2020-06-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"https://sci-hub-pdf.com/10.1016/j.entcs.2020.02.016","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"134308967","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"OA","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}

引用次数: 1

A Multi-Objective Optimization Algorithm for Center-Based Clustering 基于中心聚类的多目标优化算法

Electronic Notes in Theoretical Computer Science Pub Date : 2020-06-01 DOI: 10.1016/j.entcs.2020.02.012

Jared León, Boris Chullo-Llave, Lauro Enciso-Rodas, José Luis Soncco-Álvarez

{"title":"A Multi-Objective Optimization Algorithm for Center-Based Clustering","authors":"Jared León, Boris Chullo-Llave, Lauro Enciso-Rodas, José Luis Soncco-Álvarez","doi":"10.1016/j.entcs.2020.02.012","DOIUrl":"10.1016/j.entcs.2020.02.012","url":null,"abstract":"<div><p>Center-based clustering is a set of clustering problems that require finding a single element, a center, to represent an entire cluster. The algorithms that solve this type of problems are very efficient for clustering large and high-dimensional datasets. In this paper, we propose a similar heuristic used in Lloyd's algorithm to approximately solve (EMAX algorithm) a more robust variation of the <em>k</em>-means problem, namely the EMAX problem. Also, a new center-based clustering algorithm (SSO-C) is proposed, which is based on a swarm intelligence technique called Social Spider Optimization. This algorithm minimizes a multi-objective optimization function defined as a weighted combination of the objective functions of the <em>k</em>-means and EMAX problems. Also, an approximation algorithm for the discrete <em>k</em>-center problem is used as a local search strategy for initializing the population. Results of the experiments showed that SSO-C algorithm is suitable for finding maximum best values, however EMAX algorithm is better in finding median and mean values.</p></div>","PeriodicalId":38770,"journal":{"name":"Electronic Notes in Theoretical Computer Science","volume":null,"pages":null},"PeriodicalIF":0.0,"publicationDate":"2020-06-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"https://sci-hub-pdf.com/10.1016/j.entcs.2020.02.012","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"122392921","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"OA","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}

引用次数: 2

Criteria for Bracket Abstractions Design 支架抽象设计准则

Electronic Notes in Theoretical Computer Science Pub Date : 2020-06-01 DOI: 10.1016/j.entcs.2020.02.011

Federico Flaviani, Elias Tahhan Bitar

引用次数: 1

Multi-Objective Pareto Histogram Equalization 多目标Pareto直方图均衡化

Electronic Notes in Theoretical Computer Science Pub Date : 2020-06-01 DOI: 10.1016/j.entcs.2020.02.010

Federico Daumas-Ladouce , Miguel García-Torres , José Luis Vázquez Noguera , Diego P. Pinto-Roa , Horacio Legal-Ayala

{"title":"Multi-Objective Pareto Histogram Equalization","authors":"Federico Daumas-Ladouce , Miguel García-Torres , José Luis Vázquez Noguera , Diego P. Pinto-Roa , Horacio Legal-Ayala","doi":"10.1016/j.entcs.2020.02.010","DOIUrl":"10.1016/j.entcs.2020.02.010","url":null,"abstract":"<div><p>Several histogram equalization methods focus on enhancing the contrast as one of their main objectives, but usually without considering the details of the input image. Other methods seek to keep the brightness while improving the contrast, causing distortion. Among the multi-objective algorithms, the classical optimization (<em>a priori</em>) techniques are commonly used given their simplicity. One of the most representative method is the weighted sum of metrics used to enhance the contrast of an image. These type of techniques, beside just returning a single image, have problems related to the weight assignment for each selected metric. To avoid the pitfalls of the algorithms just mentioned, we propose a new method called MOPHE (Multi-Objective Pareto Histogram Equalization) which is based on Multi-objective Particle Swarm Optimization (MOPSO) approach combining different metrics in <em>a posteriori</em> selection criteria context. The goal of this method is three-fold: (1) improve the contrast (2) without losing important details, (3) avoiding an excessive distortion. MOPHE, is a pure multi-objective optimization algorithm, consequently a set of trade-off optimal solutions are generated, thus providing alternative solutions to the decision-maker, allowing the selection of one or more resulting images, depending on the application needs. Experimental results indicate that MOPHE is a promising approach, as it calculates a set of trade-off optimal solutions that are better than the results obtained from representative algorithms from the state-of-the-art regarding visual quality and metrics measurement.</p></div>","PeriodicalId":38770,"journal":{"name":"Electronic Notes in Theoretical Computer Science","volume":null,"pages":null},"PeriodicalIF":0.0,"publicationDate":"2020-06-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"https://sci-hub-pdf.com/10.1016/j.entcs.2020.02.010","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"129399850","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"OA","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}

引用次数: 2

Medical Image Enhancement With Brightness and Detail Preserving Using Multiscale Top-hat Transform by Reconstruction 基于重构多尺度顶帽变换的医学图像亮度和细节保持增强

Electronic Notes in Theoretical Computer Science Pub Date : 2020-06-01 DOI: 10.1016/j.entcs.2020.02.013

Julio César Mello Román , Ricardo Escobar , Fabiola Martínez , José Luis Vázquez Noguera , Horacio Legal-Ayala , Diego P. Pinto-Roa

引用次数: 9

Introducing Synchrony in Fuzzy Automata 在模糊自动机中引入同步

Electronic Notes in Theoretical Computer Science Pub Date : 2020-03-01 DOI: 10.1016/j.entcs.2020.02.004

Leandro Gomes, Alexandre Madeira, Luis Soares Barbosa

引用次数: 3

On Solving Nominal Disunification Constraints 论名义不统一约束的求解

Electronic Notes in Theoretical Computer Science Pub Date : 2020-03-01 DOI: 10.1016/j.entcs.2020.02.002

Mauricio Ayala-Rincón , Maribel Fernández , Daniele Nantes-Sobrinho , Deivid Vale

{"title":"On Solving Nominal Disunification Constraints","authors":"Mauricio Ayala-Rincón , Maribel Fernández , Daniele Nantes-Sobrinho , Deivid Vale","doi":"10.1016/j.entcs.2020.02.002","DOIUrl":"10.1016/j.entcs.2020.02.002","url":null,"abstract":"<div><p>This paper proposes an extension of first-order disunification problems by taking into account binding operators according to the nominal approach. In this approach, bindings are implemented through atom abstraction, and renaming of atoms is implemented via atom permutations. In the nominal setting, unification problems consist of equational questions (<span><math><mi>s</mi><msubsup><mrow><mo>≈</mo></mrow><mrow><mi>α</mi></mrow><mrow><mo>?</mo></mrow></msubsup><mi>t</mi></math></span>) considered under freshness constraints (<span><math><mi>a</mi><msup><mrow><mi>#</mi></mrow><mrow><mo>?</mo></mrow></msup><mi>t</mi></math></span>) that restrict solutions by forbidding free occurrences of atoms in the instantiation of variables. In addition to equational and freshness constraints, nominal disunification problems include also nominal disunification constraints (<span><math><mi>s</mi><msubsup><mrow><mo>≉</mo></mrow><mrow><mi>α</mi></mrow><mrow><mo>?</mo></mrow></msubsup><mi>t</mi></math></span>), and their solutions consist of a substitution and additional freshness constraints such that under these constraints the instantiation of the equations, disequations and freshness constraints with the substitution hold. By re-using nominal unification techniques, this paper shows how to decide whether two nominal terms can be made different modulo <em>α</em>-equivalence. This is done by extending previous results on first-order disunification, and defining the notion of <em>solutions with exceptions</em> in the nominal syntax. A discussion on the semantics of disunification constraints is also given.</p></div>","PeriodicalId":38770,"journal":{"name":"Electronic Notes in Theoretical Computer Science","volume":null,"pages":null},"PeriodicalIF":0.0,"publicationDate":"2020-03-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"https://sci-hub-pdf.com/10.1016/j.entcs.2020.02.002","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"122180812","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"OA","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}

引用次数: 3

Dual and Axiomatic Systems for Constructive S4, a Formally Verified Equivalence 构式S4的对偶和公理化系统，一个正式验证的等价

Electronic Notes in Theoretical Computer Science Pub Date : 2020-03-01 DOI: 10.1016/j.entcs.2020.02.005

Lourdes del Carmen González Huesca , Favio E. Miranda-Perea , P. Selene Linares-Arévalo

引用次数: 1

Deciding Quantifier-free Definability in Finite Algebraic Structures 有限代数结构中无量词可定义性的确定

Electronic Notes in Theoretical Computer Science Pub Date : 2020-03-01 DOI: 10.1016/j.entcs.2020.02.003

Miguel Campercholi, Mauricio Tellechea, Pablo Ventura

引用次数: 0

A Fuzzy Modal Logic for Fuzzy Transition Systems 模糊过渡系统的模糊模态逻辑

Electronic Notes in Theoretical Computer Science Pub Date : 2020-03-01 DOI: 10.1016/j.entcs.2020.02.006

Manisha Jain , Alexandre Madeira , Manuel A. Martins

引用次数: 17