Thibault Gauthier, Chad Brown, Mikoláš Janota, Josef Urban
We present a benchmark of 29687 problems derived from the On-Line Encyclopedia of Integer Sequences (OEIS). Each problem expresses the equivalence of two syntactically different programs generating the same OEIS sequence. Such programs were conjectured by a learning-guided synthesis system using a language with looping operators. The operators implement recursion, and thus many of the proofs require induction on natural numbers. The benchmark contains problems of varying difficulty from a wide area of mathematical domains. We believe that these characteristics will make it an effective judge for the progress of inductive theorem provers in this domain for years to come.
{"title":"A Mathematical Benchmark for Inductive Theorem Provers","authors":"Thibault Gauthier, Chad Brown, Mikoláš Janota, Josef Urban","doi":"10.29007/jr72","DOIUrl":"https://doi.org/10.29007/jr72","url":null,"abstract":"We present a benchmark of 29687 problems derived from the On-Line Encyclopedia of Integer Sequences (OEIS). Each problem expresses the equivalence of two syntactically different programs generating the same OEIS sequence. Such programs were conjectured by a learning-guided synthesis system using a language with looping operators. The operators implement recursion, and thus many of the proofs require induction on natural numbers. The benchmark contains problems of varying difficulty from a wide area of mathematical domains. We believe that these characteristics will make it an effective judge for the progress of inductive theorem provers in this domain for years to come.","PeriodicalId":93549,"journal":{"name":"EPiC series in computing","volume":null,"pages":null},"PeriodicalIF":0.0,"publicationDate":"2023-06-03","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"135842670","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}
Elazar Cohen, Yizhak Yisrael Elboher, Clark Barrett, Guy Katz
Neural networks have become critical components of reactive systems in various do- mains within computer science. Despite their excellent performance, using neural networks entails numerous risks that stem from our lack of ability to understand and reason about their behavior. Due to these risks, various formal methods have been proposed for verify- ing neural networks; but unfortunately, these typically struggle with scalability barriers. Recent attempts have demonstrated that abstraction-refinement approaches could play a significant role in mitigating these limitations; but these approaches can often produce net- works that are so abstract, that they become unsuitable for verification. To deal with this issue, we present CEGARETTE, a novel verification mechanism where both the system and the property are abstracted and refined simultaneously. We observe that this approach allows us to produce abstract networks which are both small and sufficiently accurate, allowing for quick verification times while avoiding a large number of refinement steps. For evaluation purposes, we implemented CEGARETTE as an extension to the recently proposed CEGAR-NN framework. Our results are highly promising, and demonstrate a significant improvement in performance over multiple benchmarks.
{"title":"Tighter Abstract Queries in Neural Network Verification","authors":"Elazar Cohen, Yizhak Yisrael Elboher, Clark Barrett, Guy Katz","doi":"10.29007/3mk7","DOIUrl":"https://doi.org/10.29007/3mk7","url":null,"abstract":"Neural networks have become critical components of reactive systems in various do- mains within computer science. Despite their excellent performance, using neural networks entails numerous risks that stem from our lack of ability to understand and reason about their behavior. Due to these risks, various formal methods have been proposed for verify- ing neural networks; but unfortunately, these typically struggle with scalability barriers. Recent attempts have demonstrated that abstraction-refinement approaches could play a significant role in mitigating these limitations; but these approaches can often produce net- works that are so abstract, that they become unsuitable for verification. To deal with this issue, we present CEGARETTE, a novel verification mechanism where both the system and the property are abstracted and refined simultaneously. We observe that this approach allows us to produce abstract networks which are both small and sufficiently accurate, allowing for quick verification times while avoiding a large number of refinement steps. For evaluation purposes, we implemented CEGARETTE as an extension to the recently proposed CEGAR-NN framework. Our results are highly promising, and demonstrate a significant improvement in performance over multiple benchmarks.","PeriodicalId":93549,"journal":{"name":"EPiC series in computing","volume":null,"pages":null},"PeriodicalIF":0.0,"publicationDate":"2023-06-03","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"135842669","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}
Natalia Ślusarz, Ekaterina Komendantskaya, Matthew Daggitt, Robert Stewart, Kathrin Stark
Differentiable logics (DL) have recently been proposed as a method of training neural networks to satisfy logical specifications. A DL consists of a syntax in which specifications are stated and an interpretation function that translates expressions in the syntax into loss functions. These loss functions can then be used during training with standard gradient descent algorithms. The variety of existing DLs and the differing levels of formality with which they are treated makes a systematic comparative study of their properties and implementations difficult. This paper remedies this problem by suggesting a meta-language for defining DLs that we call the Logic of Differentiable Logics, or LDL. Syntactically, it generalises the syntax of existing DLs to FOL, and for the first time introduces the formalism for reasoning about vectors and learners. Semantically, it introduces a general interpretation function that can be instantiated to define loss functions arising from different existing DLs. We use LDL to establish several theoretical properties of existing DLs and to conduct their empirical study in neural network verification.
{"title":"Logic of Differentiable Logics: Towards a Uniform Semantics of DL","authors":"Natalia Ślusarz, Ekaterina Komendantskaya, Matthew Daggitt, Robert Stewart, Kathrin Stark","doi":"10.29007/c1nt","DOIUrl":"https://doi.org/10.29007/c1nt","url":null,"abstract":"Differentiable logics (DL) have recently been proposed as a method of training neural networks to satisfy logical specifications. A DL consists of a syntax in which specifications are stated and an interpretation function that translates expressions in the syntax into loss functions. These loss functions can then be used during training with standard gradient descent algorithms. The variety of existing DLs and the differing levels of formality with which they are treated makes a systematic comparative study of their properties and implementations difficult. This paper remedies this problem by suggesting a meta-language for defining DLs that we call the Logic of Differentiable Logics, or LDL. Syntactically, it generalises the syntax of existing DLs to FOL, and for the first time introduces the formalism for reasoning about vectors and learners. Semantically, it introduces a general interpretation function that can be instantiated to define loss functions arising from different existing DLs. We use LDL to establish several theoretical properties of existing DLs and to conduct their empirical study in neural network verification.","PeriodicalId":93549,"journal":{"name":"EPiC series in computing","volume":null,"pages":null},"PeriodicalIF":0.0,"publicationDate":"2023-06-03","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"135842672","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}
Explaining the presence or absence of transformations in nature, such as chemical or elementary particle reactions, is fundamental to our thinking about nature. This paper describes a generic approach to the search for such conserved quantities. In the work that follows we formulate a generic approach to conserved such explanations by summoning techniques from Linear Algebra.
{"title":"Mining for Conserved Constituents and Quantities","authors":"Yusuke Yokota, J. Hearne","doi":"10.29007/4cmg","DOIUrl":"https://doi.org/10.29007/4cmg","url":null,"abstract":"Explaining the presence or absence of transformations in nature, such as chemical or elementary particle reactions, is fundamental to our thinking about nature. This paper describes a generic approach to the search for such conserved quantities. In the work that follows we formulate a generic approach to conserved such explanations by summoning techniques from Linear Algebra.","PeriodicalId":93549,"journal":{"name":"EPiC series in computing","volume":null,"pages":null},"PeriodicalIF":0.0,"publicationDate":"2023-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"69421622","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}
Finland has decided to implement the national open science and research (OScaR) declaration, policies, and recommendations by using the enterprise architecture (EA) method. The OScaR policies drive the Open science and research field in Finland. Succeeded implementation of these policies is a critical success factor in the Open science and research field. The EA method is a tried, tested, and recognized tool for gaining digital transformation because of its important strategic and operational role in public and private sector organizations and service ecosystems. With the EA tool, OScaR policies and objectives can be described and visualized as strategy, business, information, and application architectures.EA is a holistic tool for understanding and describing the target area in different abstract layers, views, and viewpoints. It aims to serve and provide beneficial information to all stakeholders, which makes it challenging to manage. For this reason, the chief architect of the project has to be very careful with risk management and into the project have to allocate enough resources to gain an appropriate level of maturity in communication and collaboration capabilities.EA and EA problems have been studied a lot. However, in the field of open science and research, there are hardly any literature on it and no comparable EA projects in the EU. Thus the OScaR project and its deliverables could be a driver to start a discussion on the need for shared open science and research reference architecture among higher education institutions in the EU.
{"title":"OScaR RA: Finnish national reference architecture on open science and research","authors":"Ari Rouvari","doi":"10.29007/s49n","DOIUrl":"https://doi.org/10.29007/s49n","url":null,"abstract":"Finland has decided to implement the national open science and research (OScaR) declaration, policies, and recommendations by using the enterprise architecture (EA) method. The OScaR policies drive the Open science and research field in Finland. Succeeded implementation of these policies is a critical success factor in the Open science and research field. The EA method is a tried, tested, and recognized tool for gaining digital transformation because of its important strategic and operational role in public and private sector organizations and service ecosystems. With the EA tool, OScaR policies and objectives can be described and visualized as strategy, business, information, and application architectures.EA is a holistic tool for understanding and describing the target area in different abstract layers, views, and viewpoints. It aims to serve and provide beneficial information to all stakeholders, which makes it challenging to manage. For this reason, the chief architect of the project has to be very careful with risk management and into the project have to allocate enough resources to gain an appropriate level of maturity in communication and collaboration capabilities.EA and EA problems have been studied a lot. However, in the field of open science and research, there are hardly any literature on it and no comparable EA projects in the EU. Thus the OScaR project and its deliverables could be a driver to start a discussion on the need for shared open science and research reference architecture among higher education institutions in the EU.","PeriodicalId":93549,"journal":{"name":"EPiC series in computing","volume":null,"pages":null},"PeriodicalIF":0.0,"publicationDate":"2023-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"69450908","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}
Derangement is one well-known problem in the filed of probability theory. An in- stance of a derangement problem contains a finite collection C of n paired objects, C = {(x1 , y1 ), ..., (xn , yn )}. The derangement problem asks how many ways to gener- ate a new collection C′ ̸= C such that for each (xi,yj) ∈ C′,i ̸= j. We propose an efficient dynamic programming algorithm that divides an instance of the derangement problem into several subproblems. During a recursive process of unrolling a subproblem, there exists a repeated procedure that allows us to make a use of a subsolution that has already been computed. We present the methodology to formulate a concept of this subproblem as well as parts of designing and analyzing an efficiency of the proposed algorithm.
错乱是概率论领域中一个众所周知的问题。无序问题的一个实例包含n个配对对象的有限集合C, C = {(x1, y1)，…， (xn, yn)}。无序问题要求有多少种方法生成一个新的集合C′′′，使得对于每个(xi,yj)∈C′，i′′= j。我们提出了一种有效的动态规划算法，该算法将无序问题的一个实例划分为几个子问题。在展开子问题的递归过程中，存在一个重复的过程，允许我们使用已经计算过的子解。我们给出了该子问题概念的形成方法，以及算法设计和效率分析的部分内容。
{"title":"Alternative Approach to Achieve a Solution of Derangement Problems by Dynamic Programming","authors":"Thitivatr Patanasakpinyo, Adel Sulaiman","doi":"10.29007/1j3g","DOIUrl":"https://doi.org/10.29007/1j3g","url":null,"abstract":"Derangement is one well-known problem in the filed of probability theory. An in- stance of a derangement problem contains a finite collection C of n paired objects, C = {(x1 , y1 ), ..., (xn , yn )}. The derangement problem asks how many ways to gener- ate a new collection C′ ̸= C such that for each (xi,yj) ∈ C′,i ̸= j. We propose an efficient dynamic programming algorithm that divides an instance of the derangement problem into several subproblems. During a recursive process of unrolling a subproblem, there exists a repeated procedure that allows us to make a use of a subsolution that has already been computed. We present the methodology to formulate a concept of this subproblem as well as parts of designing and analyzing an efficiency of the proposed algorithm.","PeriodicalId":93549,"journal":{"name":"EPiC series in computing","volume":null,"pages":null},"PeriodicalIF":0.0,"publicationDate":"2023-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"69419368","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}
Luis Juarez-Ramiro, J. Dávila-Velderrain, A. Soria-López, E. Álvarez-Buylla, Juan Carlos Martínez-García
Epithelial-to-Mesenchymal Transition (EMT) plays a key role in epithelial-cancer. The state trajectory of its underlying Gene Regulatory Network (GRN) includes three fixed-point attractors characterizing epithelial, senescent, and mesenchymal, cell phenotypes, which implies specific cell-to-cell and cell-to-tissue interactions. The interplay between the GRN driving EMT and the one regulating the Mammalian Cell Cycle (MCC) influences cancer- related cell growing and proliferation. We expose the characteristics of the network arising from the interconnection of the gene regulatory networks associated to EMT and MCC. Our purpose is twofold: first, to elucidate the dynamical properties of cancer-related gene regulatory networks. Subsequently, to propose a computational methodology to address the interconnection of networks related to cancer. Our approach is based on feedback-based interconnection of networks described in discrete Boolean terms.
{"title":"Uncovering the particularities of the dynamical interaction between cancer-related Epithelial-Mesenchymal Transition and the Mammalian Cell Cycle: a feedback-based Boolean networks interconnection approach","authors":"Luis Juarez-Ramiro, J. Dávila-Velderrain, A. Soria-López, E. Álvarez-Buylla, Juan Carlos Martínez-García","doi":"10.29007/3kx4","DOIUrl":"https://doi.org/10.29007/3kx4","url":null,"abstract":"Epithelial-to-Mesenchymal Transition (EMT) plays a key role in epithelial-cancer. The state trajectory of its underlying Gene Regulatory Network (GRN) includes three fixed-point attractors characterizing epithelial, senescent, and mesenchymal, cell phenotypes, which implies specific cell-to-cell and cell-to-tissue interactions. The interplay between the GRN driving EMT and the one regulating the Mammalian Cell Cycle (MCC) influences cancer- related cell growing and proliferation. We expose the characteristics of the network arising from the interconnection of the gene regulatory networks associated to EMT and MCC. Our purpose is twofold: first, to elucidate the dynamical properties of cancer-related gene regulatory networks. Subsequently, to propose a computational methodology to address the interconnection of networks related to cancer. Our approach is based on feedback-based interconnection of networks described in discrete Boolean terms.","PeriodicalId":93549,"journal":{"name":"EPiC series in computing","volume":null,"pages":null},"PeriodicalIF":0.0,"publicationDate":"2023-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"69421563","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}
Rosario Pacheco-Marin, Carolina Caballero-Cordero, Jorge Arturo Arciniega-González, E. Álvarez-Buylla, Juan Carlos Martínez-García
We explore here the systems-based regulatory mechanisms that determine human blood pressure patterns. This in the context of the reported negative association between hypertension and COVID-19 disease. We are particularly interested in the key role that plays angiotensin converting enzyme 2 (ACE2), one of the first identified receptors that enable the entry of the SARS-CoV-2 virus into a cell. Taking into account the two main systems involved in the regulation of blood pressure, that is, the Renin-Angiotensin system and the Kallikrein-Kinin system, we follow a Bottom-Up systems biology modeling approach in order to built the discrete Boolean model of the gene regulatory network that underlies both the typical hypertensive phenotype and the hypotensive/normotensive phenotype. These phenotypes correspond to the dynamic attractors of the regulatory network modeled on the basis of publicly available experimental information. Our model recovers the observed phenotypes and shows the key role played by the inflammatory response in the emergence of hypertension.
{"title":"Uncovering the interdependence between hypertension and the inflammatory response for the patient affected by Covid 19 through mathematical modeling and computer-based analysis","authors":"Rosario Pacheco-Marin, Carolina Caballero-Cordero, Jorge Arturo Arciniega-González, E. Álvarez-Buylla, Juan Carlos Martínez-García","doi":"10.29007/b5v4","DOIUrl":"https://doi.org/10.29007/b5v4","url":null,"abstract":"We explore here the systems-based regulatory mechanisms that determine human blood pressure patterns. This in the context of the reported negative association between hypertension and COVID-19 disease. We are particularly interested in the key role that plays angiotensin converting enzyme 2 (ACE2), one of the first identified receptors that enable the entry of the SARS-CoV-2 virus into a cell. Taking into account the two main systems involved in the regulation of blood pressure, that is, the Renin-Angiotensin system and the Kallikrein-Kinin system, we follow a Bottom-Up systems biology modeling approach in order to built the discrete Boolean model of the gene regulatory network that underlies both the typical hypertensive phenotype and the hypotensive/normotensive phenotype. These phenotypes correspond to the dynamic attractors of the regulatory network modeled on the basis of publicly available experimental information. Our model recovers the observed phenotypes and shows the key role played by the inflammatory response in the emergence of hypertension.","PeriodicalId":93549,"journal":{"name":"EPiC series in computing","volume":null,"pages":null},"PeriodicalIF":0.0,"publicationDate":"2023-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"69429906","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}
Christopher Scherb, Luc Bryan Heitz, F. Grimberg, Hermann Grieder, Marcel Maurer
With the rising number of cyberattacks, such as ransomware attacks and cyber espionage, educating non-cybersecurity professionals to recognize threats has become more important than ever before. However, traditional training methods, such as phishing awareness campaigns, training videos and assessments have proven to be less effective over time. Therefore, it is time to rethink the approach on how to train cyber awareness. In this paper we suggest an alternative approach – a serious game – to educate awareness for common cyberattacks. While many serious games for cybersecurity education exist, all follow a very similar approach: showing people the effects of a cyber attack on their own system or company network. For example, one of the main tasks in these games is to sort out phishing mails. We developed and evaluated a new type of cybersecurity game: an attack simulator, which shows the entire setting from a different perspective. Instead of sorting out phishing mails the players should write phishing mails to trick potential victims and use other forms of cyberattacks. Our game explains the intention of each attack and shows the consequences of a successful attack. This way, we hope, players will get a better understanding on how to detect cyberattacks.
{"title":"A Cyber Attack Simulation for Teaching Cybersecurity","authors":"Christopher Scherb, Luc Bryan Heitz, F. Grimberg, Hermann Grieder, Marcel Maurer","doi":"10.29007/dkdw","DOIUrl":"https://doi.org/10.29007/dkdw","url":null,"abstract":"With the rising number of cyberattacks, such as ransomware attacks and cyber espionage, educating non-cybersecurity professionals to recognize threats has become more important than ever before. However, traditional training methods, such as phishing awareness campaigns, training videos and assessments have proven to be less effective over time. Therefore, it is time to rethink the approach on how to train cyber awareness. In this paper we suggest an alternative approach – a serious game – to educate awareness for common cyberattacks. While many serious games for cybersecurity education exist, all follow a very similar approach: showing people the effects of a cyber attack on their own system or company network. For example, one of the main tasks in these games is to sort out phishing mails. We developed and evaluated a new type of cybersecurity game: an attack simulator, which shows the entire setting from a different perspective. Instead of sorting out phishing mails the players should write phishing mails to trick potential victims and use other forms of cyberattacks. Our game explains the intention of each attack and shows the consequences of a successful attack. This way, we hope, players will get a better understanding on how to detect cyberattacks.","PeriodicalId":93549,"journal":{"name":"EPiC series in computing","volume":null,"pages":null},"PeriodicalIF":0.0,"publicationDate":"2023-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"69431632","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}
Data transfers to and from High Performance Computing (HPC) clusters are a rather well established mechanism since standard Linux file transfer tools like scp and rsync can be used. Nowadays, users are not always familiar with these command-line based mechanisms and prefer more user friendly, and web based solutions. In this article we present a system to use the protocols of enterprise file sync and share systems (EFSS) for data transfers utilizing components of Science Mesh. In addition, this offers a technique to transfer data between different HPC sites without the need for commercial software or exposing the rather vulnerable port 22 to the outside world.
{"title":"Bringing HPC clusters into Science Mesh","authors":"H. Angenent, Daniel Müller, R. Vogl","doi":"10.29007/gfjd","DOIUrl":"https://doi.org/10.29007/gfjd","url":null,"abstract":"Data transfers to and from High Performance Computing (HPC) clusters are a rather well established mechanism since standard Linux file transfer tools like scp and rsync can be used. Nowadays, users are not always familiar with these command-line based mechanisms and prefer more user friendly, and web based solutions. In this article we present a system to use the protocols of enterprise file sync and share systems (EFSS) for data transfers utilizing components of Science Mesh. In addition, this offers a technique to transfer data between different HPC sites without the need for commercial software or exposing the rather vulnerable port 22 to the outside world.","PeriodicalId":93549,"journal":{"name":"EPiC series in computing","volume":null,"pages":null},"PeriodicalIF":0.0,"publicationDate":"2023-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"69432545","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
扫码关注我们
求助内容：
应助结果提醒方式：