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

Towards an Answer Set Programming Methodology for Constructing Programs Following a Semi-Automatic Approach – Extended and Revised version 基于半自动方法构建程序的答案集编程方法

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

Flavio Everardo , Mauricio Osorio

{"title":"Towards an Answer Set Programming Methodology for Constructing Programs Following a Semi-Automatic Approach – Extended and Revised version","authors":"Flavio Everardo , Mauricio Osorio","doi":"10.1016/j.entcs.2020.10.004","DOIUrl":"10.1016/j.entcs.2020.10.004","url":null,"abstract":"<div><p>Answer Set Programming (ASP) is a successful rule-based formalism for modeling and solving knowledge-intense combinatorial (optimization) problems. Despite its success in both academic and industry, open challenges like automatic source code optimization, and software engineering remains. This is because a problem encoded into an ASP might not have the desired solving performance compared to an equivalent representation. Motivated by these two challenges, this paper has three main contributions. First, we propose a developing process towards a methodology to implement ASP programs, being faithful to existing methods. Second, we present ASP encodings that serve as the basis from the developing process. Third, we demonstrate the use of ASP to reverse the standard solving process. That is, knowing answer sets in advance, and desired strong equivalent properties, “we” exhaustively reconstruct ASP programs if they exist. This paper was originally motivated by the search of propositional formulas (if they exist) that represent the semantics of a new aggregate operator. Particularly, a parity aggregate. This aggregate comes as an improvement from the already existing parity (<span>xor</span>) constraints from <em>xorro</em>, where lacks expressiveness, even though these constraints fit perfectly for reasoning modes like sampling or model counting. To this end, this extended version covers the fundaments from parity constraints as well as the <em>xorro</em> system. Hence, we delve a little more in the examples and the proposed methodology over parity constraints. Finally, we discuss our results by showing the only representation available, that satisfies different properties from the classical logic <span>xor</span> operator, which is also consistent with the semantics of parity constraints from <em>xorro</em>.</p></div>","PeriodicalId":38770,"journal":{"name":"Electronic Notes in Theoretical Computer Science","volume":"354 ","pages":"Pages 29-44"},"PeriodicalIF":0.0,"publicationDate":"2020-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"https://sci-hub-pdf.com/10.1016/j.entcs.2020.10.004","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"132047497","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

Building a Maximal Independent Set for the Vertex-coloring Problem on Planar Graphs 平面图上顶点着色问题的最大独立集的建立

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

Cristina López-Ramírez, Jorge Eduardo Gutiérrez Gómez, Guillermo De Ita Luna

引用次数: 1

On Performance Evaluation of Security Monitoring in Multitenant Cloud Applications 多租户云应用安全监控性能评估研究

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

Lelio Campanile, Mauro Iacono, Stefano Marrone, Michele Mastroianni

引用次数: 1

Evaluating the Safety of Crowds in Enclosed Spaces by Markovian Agents 用马尔可夫智能体评价封闭空间中人群的安全性

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

Enrico Barbierato, Marco Gribaudo, Mauro Iacono, Alexander H. Levis

{"title":"Evaluating the Safety of Crowds in Enclosed Spaces by Markovian Agents","authors":"Enrico Barbierato, Marco Gribaudo, Mauro Iacono, Alexander H. Levis","doi":"10.1016/j.entcs.2020.09.019","DOIUrl":"10.1016/j.entcs.2020.09.019","url":null,"abstract":"<div><p>Different paradigms have been used to model the behaviour of pedestrians in a crowd. While some approaches analyze the modelization of crowd motion from a physical perspective, other techniques prefer to focus on similar abstractions following classic paradigms, such as mobile agents or cellular automata, or even from the point of view of social forces interaction. Particular interest has emerged around the topic of crowd behaviour under condition of stress caused by a dramatic event, such as an earthquake, a terrorist attack or a fire. This paper presents a novel approach including a GSPN to describe the behaviour of an individual, which is subsequently translated into a set of Markovian Agents. The model under study reproduces a scenario where a fire, developed in a closed environment, triggers erratic crowd behaviour. It is possible to perceive that a panic situation can be mitigated by enforcing certain measures involving human leaders or small embedded systems (such as Internet-of-things enabled devices), reducing the level of risk related to safety.</p></div>","PeriodicalId":38770,"journal":{"name":"Electronic Notes in Theoretical Computer Science","volume":"353 ","pages":"Pages 61-75"},"PeriodicalIF":0.0,"publicationDate":"2020-11-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"https://sci-hub-pdf.com/10.1016/j.entcs.2020.09.019","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"89638563","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}

引用次数: 0

Energy Consumption by Servers under Unknown Service Demand 未知服务需求下服务器的能耗

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

Ali Alssaiari, Nigel Thomas

引用次数: 1

Performance Modelling of the Impact of Cyber Attacks on a Web-based Sales System 网络攻击对基于网络的销售系统影响的性能建模

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

Ohud Almutairi, Nigel Thomas

引用次数: 1

Modelling Load-Changing Attacks in Cyber-Physical Systems 网络物理系统中负载变化攻击的建模

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

Luca Arnaboldi , Ricardo M. Czekster, Charles Morisset, Roberto Metere

{"title":"Modelling Load-Changing Attacks in Cyber-Physical Systems","authors":"Luca Arnaboldi , Ricardo M. Czekster, Charles Morisset, Roberto Metere","doi":"10.1016/j.entcs.2020.09.018","DOIUrl":"10.1016/j.entcs.2020.09.018","url":null,"abstract":"<div><p>Cyber-Physical Systems (CPS) are present in many settings addressing a myriad of purposes. Examples are Internet-of-Things (IoT) or sensing software embedded in appliances or even specialised meters that measure and respond to electricity demands in smart grids. Due to their pervasive nature, they are usually chosen as recipients for larger scope cyber-security attacks. Those promote system-wide disruptions and are directed towards one key aspect such as confidentiality, integrity, availability or a combination of those characteristics. Our paper focuses on a particular and distressing attack where coordinated malware infected IoT units are maliciously employed to synchronously turn on or off high-wattage appliances, affecting the grid's primary control management. Our model could be extended to larger (smart) grids, Active Buildings as well as similar infrastructures. Our approach models Coordinated Load-Changing Attacks (CLCA) also referred as GridLock or BlackIoT, against a theoretical power grid, containing various types of power plants. It employs Continuous-Time Markov Chains where elements such as Power Plants and Botnets are modelled under normal or attack situations to evaluate the effect of CLCA in power reliant infrastructures. We showcase our modelling approach in the scenario of a power supplier (e.g. power plant) being targeted by a botnet. We demonstrate how our modelling approach can quantify the impact of a botnet attack and be abstracted for any CPS system involving power load management in a smart grid. Our results show that by prioritising the type of power-plants, the impact of the attack may change: in particular, we find the most impacting attack times and show how different strategies impact their success. We also find the best power generator to use depending on the current demand and strength of attack.</p></div>","PeriodicalId":38770,"journal":{"name":"Electronic Notes in Theoretical Computer Science","volume":"353 ","pages":"Pages 39-60"},"PeriodicalIF":0.0,"publicationDate":"2020-11-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"https://sci-hub-pdf.com/10.1016/j.entcs.2020.09.018","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"84466979","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}

引用次数: 15

Compositional Model Checking and Model Repair for a Class of Product Form Models 一类产品形态模型的成分模型检验与模型修复

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

Amin Soltanieh, Markus Siegle

引用次数: 0

Stochastic Bounds for the Max Flow in a Network with Discrete Random Capacities 离散随机容量网络中最大流量的随机边界

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

L. Echabbi , J.M. Fourneau , O. Gacem , H. Lotfi , N. Pekergin

引用次数: 1

Eilenberg-Kelly Reloaded Eilenberg-Kelly重新加载

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

Tarmo Uustalu, Niccolò Veltri, Noam Zeilberger

{"title":"Eilenberg-Kelly Reloaded","authors":"Tarmo Uustalu, Niccolò Veltri, Noam Zeilberger","doi":"10.1016/j.entcs.2020.09.012","DOIUrl":"10.1016/j.entcs.2020.09.012","url":null,"abstract":"<div><p>The Eilenberg-Kelly theorem states that a category <span><math><mi>C</mi></math></span> with an object <strong>I</strong> and two functors <span><math><mo>⊗</mo><mo>:</mo><mi>C</mi><mo>×</mo><mi>C</mi><mo>→</mo><mi>C</mi></math></span> and <span><math><mo>⊸</mo><mo>:</mo><msup><mrow><mi>C</mi></mrow><mrow><mi>op</mi></mrow></msup><mo>×</mo><mi>C</mi><mo>→</mo><mi>C</mi></math></span> related by an adjunction <span><math><mo>−</mo><mo>⊗</mo><mi>B</mi><mo>⊣</mo><mi>B</mi><mo>⊸</mo><mo>−</mo></math></span> natural in <em>B</em> is monoidal iff it is closed and moreover the adjunction holds internally. We dissect the proof of this theorem and observe that the necessity for a side condition on closedness arises because the standard definition of closed category is left-skew in regards to associativity. We analyze Street's observation that left-skew monoidality is equivalent to left-skew closedness and establish that monoidality is equivalent to closedness unconditionally under an adjusted definition of closedness that requires normal associativity. We also work out a definition of right-skew closedness equivalent to right-skew monoidality. We give examples of each type of structure; in particular, we look at the Kleisli category of a left-strong monad on a left-skew closed category and the Kleisli category of a lax closed monad on a right-skew closed category. We also view skew and normal monoidal and closed categories as special cases of skew and normal promonoidal categories and take a brief look at left-skew prounital-closed categories.</p></div>","PeriodicalId":38770,"journal":{"name":"Electronic Notes in Theoretical Computer Science","volume":"352 ","pages":"Pages 233-256"},"PeriodicalIF":0.0,"publicationDate":"2020-10-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"https://sci-hub-pdf.com/10.1016/j.entcs.2020.09.012","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"122656840","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}

引用次数: 5