-
Towards enhanced monitoring framework with smart predictions Log. J. IGPL (IF 1.0) Pub Date : 2024-03-16 Antonello Calabrò, Said Daoudagh, Eda Marchetti
Context: Predicting security and trust vulnerabilities and issues is crucial for IoT interconnected systems and ecosystems, especially when integrating new, third-party or open-source components. Objective: One way to ensure timely predictions is by using a smart monitoring framework to continuously verify functional and non-functional property violations during the executions of the systems and their
-
Detection, exploitation and mitigation of memory errors Log. J. IGPL (IF 1.0) Pub Date : 2024-03-16 Oscar Llorente-Vazquez, Igor Santos-Grueiro, Iker Pastor-Lopez, Pablo Garcia Bringas
Software vulnerabilities are the root cause for a multitude of security problems in computer systems. Owing to their efficiency and tight control over low-level system resources, the C and C++ programming languages are extensively used for a myriad of purposes, from implementing operating system kernels to user-space applications. However, insufficient or improper memory management frequently leads
-
Exploiting multimodal biometrics for enhancing password security Log. J. IGPL (IF 1.0) Pub Date : 2024-03-16 Konstantinos Karampidis
Digitization of every daily procedure requires trustworthy verification schemes. People tend to overlook the security of the passwords they use, i.e. they use the same password on different occasions, they neglect to change them periodically or they often forget them. This raises a major security issue, especially for elderly people who are not familiar with modern technology and its risks and challenges
-
Good practices in designing a communication channel architecture for secure async flexible distributed collaboration Log. J. IGPL (IF 1.0) Pub Date : 2024-03-15 Rudolf Erdei, Daniela Delinschi, Oliviu Matei, Laura Andreica
In this paper we present a set of good practices in the design of a security-centric architecture for a Communication Channel that can be used to secure a Loosely-Coupled distributed platform, over unreliable communication mediums. The proposed practices are derived from designing a complete architecture that is modular and designed to support principles of Service Oriented Architecture (SOA) and the
-
Symmetric and conflated intuitionistic logics Log. J. IGPL (IF 1.0) Pub Date : 2024-03-04 Norihiro Kamide
Two new propositional non-classical logics, referred to as symmetric intuitionistic logic (SIL) and conflated intuitionistic logic (CIL), are introduced as indexed and non-indexed Gentzen-style sequent calculi. SIL is regarded as a natural hybrid logic combining intuitionistic and dual-intuitionistic logics, whereas CIL is regarded as a variant of intuitionistic paraconsistent logic with conflation
-
Base-extension semantics for modal logic Log. J. IGPL (IF 1.0) Pub Date : 2024-03-02 Timo Eckhardt, David J Pym
In proof-theoretic semantics, meaning is based on inference. It may seen as the mathematical expression of the inferentialist interpretation of logic. Much recent work has focused on base-extension semantics, in which the validity of formulas is given by an inductive definition generated by provability in a ‘base’ of atomic rules. Base-extension semantics for classical and intuitionistic propositional
-
A characterization of crossed self-similarity on crossed modules in L-algebras Log. J. IGPL (IF 1.0) Pub Date : 2024-02-29 Selim Çetin, Utku Gürdal
We introduce crossed modules in cycloids, as a generalization of cycloids, which are algebraic logical structures arising in the context of the quantum Yang–Baxter equation. As a spacial case, we in particular focus on the crossed modules of $L-$algebras. These types of crossed modules are exceptional, since the category of $L-$algebras is not protomodular, nor Barr-exact, but it nevertheless has natural
-
Labelled proof systems for existential reasoning Log. J. IGPL (IF 1.0) Pub Date : 2024-01-30 Jaime Ramos, João Rasga, Cristina Sernadas
Usually in logic, proof systems are defined having in mind proving properties like validity and semantic consequence. It seems worthwhile to address the problem of having proof systems where satisfiability is a primitive notion in the sense that a formal derivation means that a finite set of formulas is satisfiable. Moreover, it would be useful to cover within the same framework as many logics as possible
-
Constructive theories through a modal lens Log. J. IGPL (IF 1.0) Pub Date : 2023-12-30 Matteo Tesi
We present a uniform proof-theoretic proof of the Gödel–McKinsey–Tarski embedding for a class of first-order intuitionistic theories. This is achieved by adapting to the case of modal logic the methods of proof analysis in order to convert axioms into rules of inference of a suitable sequent calculus. The soundness and the faithfulness of the embedding are proved by induction on the height of the derivations
-
On the number of different variables required to define the n-density or the bounded n-width of Kripke frames with some consequences for Sahlqvist formulae Log. J. IGPL (IF 1.0) Pub Date : 2023-11-20 Petar Iliev
We show that both the $n$-density and the bounded $n$-width of Kripke frames can be modally defined not only with natural and well-known Sahlqvist formulae containing a linear number of different propositional variables but also with formulae of polynomial length with a logarithmic number of different propositional variables and then we prove that this exponential decrease in the number of variables
-
The use of logic and argumentation in therapy of sex offenders Log. J. IGPL (IF 1.0) Pub Date : 2023-10-19 Dov Gabbay, Gadi Rozenberg, Lydia Rivlin
This paper is intended first for the formal argumentation community (see https://comma.csc.liv.ac.uk/). This community develops logics and systems modelling argumentation and dialogues. The community is in search of major applications areas for their models. One such application area e.g. is Law. The message of this paper is that there is another major application area for formal argumentation. There
-
Algebraic structures formalizing the logic with unsharp implication and negation Log. J. IGPL (IF 1.0) Pub Date : 2023-10-19 Ivan Chajda, Helmut Länger
It is well-known that intuitionistic logics can be formalized by means of Heyting algebras, i.e. relatively pseudocomplemented semilattices. Within such algebras the logical connectives implication and conjunction are formalized as the relative pseudocomplement and the semilattice operation meet, respectively. If the Heyting algebra has a bottom element $0$, then the relative pseudocomplement with
-
Report on the exact methods for finding minimum-sized DFA Log. J. IGPL (IF 1.0) Pub Date : 2023-09-09 Wojciech Wieczorek, Łukasz Strąk, Arkadiusz Nowakowski
This paper presents four state-of-art methods for the finite-state automaton inference based on a sample of labeled strings. The first algorithm is Exbar, and the next three are mathematical models based on ASP, SAT and SMT theories. The potentiality of using multiprocessor computers in the context of automata inference was our research’s primary goal. In a series of experiments, we showed that our
-
The fixed points of belief and knowledge Log. J. IGPL (IF 1.0) Pub Date : 2023-09-06 Daniela Schuster
Self-referential sentences have troubled our understanding of language for centuries. The most famous self-referential sentence is probably the Liar, a sentence that says of itself that it is false. The Liar Paradox has encouraged many philosophers to establish theories of truth that manage to give a proper account of the truth predicate in a formal language. Kripke’s Fixed Point Theory from 1975 is
-
On the relationships between some meta-mathematical properties of arithmetical theories Log. J. IGPL (IF 1.0) Pub Date : 2023-09-06 Yong Cheng
In this work, we aim at understanding incompleteness in an abstract way via metamathematical properties of formal theories. We systematically examine the relationships between the following twelve important metamathematical properties of arithmetical theories: Rosser, EI (effectively inseparable), RI (recursively inseparable), TP (Turing persistent), EHU (essentially hereditarily undecidable), EU (essentially
-
A probabilistic temporal epistemic logic: Decidability Log. J. IGPL (IF 1.0) Pub Date : 2023-09-04 Zoran Ognjanović, Angelina Ilić Stepić, Aleksandar Perović
We study a propositional probabilistic temporal epistemic logic $\textbf {PTEL}$ with both future and past temporal operators, with non-rigid set of agents and the operators for agents’ knowledge and for common knowledge and with probabilities defined on the sets of runs and on the sets of possible worlds. A semantics is given by a class ${\scriptsize{\rm Mod}}$ of Kripke-like models with possible
-
Semantical investigations on non-classical logics with recovery operators: negation Log. J. IGPL (IF 1.0) Pub Date : 2023-08-31 David Fuenmayor
We investigate mathematical structures that provide natural semantics for families of (quantified) non-classical logics featuring special unary connectives, known as recovery operators, that allow us to ‘recover’ the properties of classical logic in a controlled manner. These structures are known as topological Boolean algebras, which are Boolean algebras extended with additional operations subject
-
Logical reduction of relations: From relational databases to Peirce’s reduction thesis Log. J. IGPL (IF 1.0) Pub Date : 2023-06-10 Sergiy Koshkin
We study logical reduction (factorization) of relations into relations of lower arity by Boolean or relative products that come from applying conjunctions and existential quantifiers to predicates, i.e. by primitive positive formulas of predicate calculus. Our algebraic framework unifies natural joins and data dependencies of database theory and relational algebra of clone theory with the bond algebra
-
Remarks on uniform interpolation property Log. J. IGPL (IF 1.0) Pub Date : 2023-06-08 Majid Alizadeh
A logic $\mathcal{L}$ is said to satisfy the descending chain condition, DCC, if any descending chain of formulas in $\mathcal{L}$ with ordering induced by $\vdash _{\mathcal{L}};$ eventually stops. In this short note, we first establish a general theorem, which states that if a propositional logic $\mathcal{L}$ satisfies both DCC and has the Craig Interpolation Property, CIP, then it satisfies the
-
Logics and collaboration Log. J. IGPL (IF 1.0) Pub Date : 2023-05-08 Liz Sonenberg
Since the early days of artificial intelligence (AI), many logics have been explored as tools for knowledge representation and reasoning. In the spirit of the Crossley Festscrift and recognizing John Crossley’s diverse interests and his legacy in both mathematical logic and computer science, I discuss examples from my own research that sit in the overlap of logic and AI, with a focus on supporting
-
Proof-carrying parameters in certified symbolic execution Log. J. IGPL (IF 1.0) Pub Date : 2023-05-03 Andrei Arusoaie, Dorel Lucanu
Complex frameworks for defining programming languages aim to generate various tools (e.g. interpreters, symbolic execution engines, deductive verifiers, etc.) using only the formal definition of a language. When used at an industrial scale, these tools are constantly updated, and at the same time, it is required to be trustworthy. Ensuring the correctness of such a framework is practically impossible
-
Algebraic logic for the negation fragment of classical logic Log. J. IGPL (IF 1.0) Pub Date : 2023-04-28 Luciano J González
The general aim of this article is to study the negation fragment of classical logic within the framework of contemporary () Algebraic Logic. More precisely, we shall find the three classes of algebras that are canonically associated with a logic in Algebraic Logic, i.e. we find the classes $\textrm{Alg}^*$, $\textrm{Alg}$ and the intrinsic variety of the negation fragment of classical logic. In order
-
Correspondence and canonicity theory of quasi-inequalities andΠ2-statements in modal subordination algebras Log. J. IGPL (IF 1.0) Pub Date : 2023-03-18 Zhiguang Zhao
In the present paper, we study the correspondence and canonicity theory of modal subordination algebras and their dual Stone space with two relations, generalizing correspondence results for subordination algebras in [13–15, 25]. Due to the fact that the language of modal subordination algebras involves a binary subordination relation, we will find it convenient to use the so-called quasi-inequalities
-
Predicate counterparts of modal logics of provability: High undecidability and Kripke incompleteness Log. J. IGPL (IF 1.0) Pub Date : 2023-03-01 Mikhail Rybakov
In this paper, the predicate counterparts, defined both axiomatically and semantically by means of Kripke frames, of the modal propositional logics $\textbf {GL}$, $\textbf {Grz}$, $\textbf {wGrz}$ and their extensions are considered. It is proved that the set of semantical consequences on Kripke frames of every logic between $\textbf {QwGrz}$ and $\textbf {QGL.3}$ or between $\textbf {QwGrz}$ and
-
Logic, Co-ordination and the Envelope of our Beliefs Log. J. IGPL (IF 1.0) Pub Date : 2022-12-14 Rohit Parikh
Each of us has a story which we can think of as a set of beliefs, hopefully consistent. We make our decisions in view of our beliefs which may be probabilistic, in the general case, but simple yes or no as in this paper. Our beliefs are our envelope just as the shell of a tortoise is its envelope. Decision theory—or single agent game theory tells us when to make the best choice in a game of us against
-
Amalgamation and Robinson property in universal algebraic logic Log. J. IGPL (IF 1.0) Pub Date : 2022-11-25 Zalán Gyenis, Övge Öztürk
There is a well-established correspondence between interpolation and amalgamation for algebraizable logics that satisfy certain additional assumptions. In this paper, we introduce the Robinson property of a logic and show that a conditionally algebraizable logic without any additional assumptions has the Robinson property if and only if the corresponding class of Lindenbaum–Tarski algebras has the
-
On algebraic and topological semantics of the modal logic of common knowledge S4CI Log. J. IGPL (IF 1.0) Pub Date : 2022-11-25 Daniyar Shamkanov
For the modal logic $\textsf {S4}^{C}_{I}$, we identify the class of completable $\textsf {S4}^{C}_{I}$-algebras and prove for them a Stone-type representation theorem. As a consequence, we obtain strong algebraic and topological completeness of the logic $\textsf {S4}^{C}_{I}$ in the case of local semantic consequence relations. In addition, we consider an extension of the logic $\textsf {S4}^{C}_{I}$
-
The Spectra of Quasi-Boolean Algebras Log. J. IGPL (IF 1.0) Pub Date : 2022-11-08 Yajie Lv, Wenjuan Chen
In the present paper, we introduce the notions of quasi-Boolean algebras as the generalization of Boolean algebras. First we discuss the related properties of quasi-Boolean algebras. Second we define filters of quasi-Boolean algebras and investigate some properties of filters in quasi-Boolean algebras. We also show that there is a one-to-one correspondence between the set of filters and the set of
-
Contrariety Re-encountered: Nonstandard Contraries and Internal Negation** Log. J. IGPL (IF 1.0) Pub Date : 2022-10-18 Lloyd Humberstone
This discussion explores the possibility of distinguishing a tighter notion of contrariety evident in the Square of Opposition, especially in its modal incarnations, than as that binary relation holding statements that cannot both be true, with or without the added rider ‘though can both be false’. More than one theorist has voiced the intuition that the paradigmatic contraries of the traditional Square
-
Paraconsistentization and many-valued logics Log. J. IGPL (IF 1.0) Pub Date : 2022-10-14 Edelcio G de Souza, Alexandre Costa-Leite, Diogo H B Dias
This paper shows how to transform explosive many-valued systems into paraconsistent logics. We investigate mainly the case of three-valued systems exhibiting how non-explosive three-valued logics can be obtained from them.
-
The Logic of Conditionals on Outback Trails Log. J. IGPL (IF 1.0) Pub Date : 2022-10-13 Johan van Benthem
Conditional statements are ubiquitous, from promises and threats to reasoning and decision making. By now, logicians have studied them from many different angles, both semantic and proof-theoretic. This paper suggests two more perspectives on the meaning of conditionals, one dynamic and one geometric, that may throw yet more light on a familiar and yet in some ways surprisingly elusive and many-faceted
-
The Logic Languages of the TPTP World Log. J. IGPL (IF 1.0) Pub Date : 2022-09-13 Geoff Sutcliffe
The Thousands of Problems for Theorem Provers (TPTP) World is a well-established infrastructure that supports research, development and deployment of automated theorem proving systems. This paper provides an overview of the logic languages of the TPTP World, from classical first-order form (FOF), through typed FOF, up to typed higher-order form, and beyond to non-classical forms. The logic languages
-
Kolmogorov and Kuroda Translations Into Basic Predicate Logic Log. J. IGPL (IF 1.0) Pub Date : 2022-09-05 Mohammad Ardeshir, Wim Ruitenburg
Kolmogorov established the principle of the double negation translation by which to embed Classical Predicate Logic ${\operatorname {CQC}}$ into Intuitionistic Predicate Logic ${\operatorname {IQC}}$. We show that the obvious generalizations to the Basic Predicate Logic of [3] and to ${\operatorname {BQC}}$ of [12], a proper subsystem of ${\operatorname {IQC}}$, go through as well. The obvious generalizations
-
How Did Avicenna Understand the Barcan Formulas? Log. J. IGPL (IF 1.0) Pub Date : 2022-08-24 Wilfrid Hodges
In 2003 Zia Movahed pointed to a passage of Avicenna, written probably in 1022, which Movahed claimed anticipated the modal formula of Barcan (that ‘For every $x$ necessarily $\phi $’ entails ‘Necessarily for every $x$$\phi $’), and its converse. Since 2003, examination of early logical writings of Avicenna has clarified how he understood entailments between modal sentences, using his own new temporal
-
First-Order Logic of Change Log. J. IGPL (IF 1.0) Pub Date : 2022-08-20 Kordula Świętorzecka
We present the first-order logic of change, which is an extension of the propositional logic of change $\textsf {LC}\Box $ developed and axiomatized by Świętorzecka and Czermak (2015, Log. et Anal., 232, 511–527). $\textsf {LC}\Box $ has two primitive operators: ${\mathcal {C}}$ to be read it changes whether and $\Box $ for constant unchangeability. It implements the philosophically grounded idea that
-
Online, Computable and Punctual Structure Theory Log. J. IGPL (IF 1.0) Pub Date : 2022-08-18 Matthew Askes, Rod Downey
Several papers (e.g. [7, 23, 42]) have recently sought to give general frameworks for online structures and algorithms ([4]), and seeking to connect, if only by analogy, online and computable structure theory. These initiatives build on earlier work on online colouring and other combinatorial algorithms by Bean [10], Kierstead, Trotter et al. [48, 54, 57] and others, as we discuss below. In this paper
-
Equivalence between Varieties of Łukasiewicz–Moisil Algebras and Rings Log. J. IGPL (IF 1.0) Pub Date : 2022-08-08 Blanca Fernanda López Martinolich, María del Carmen Vannicola
The Post, axled and Łukasiewicz–Moisil algebras are important lattices studied in algebraic logic. In this paper, we investigate a useful interpretation between these algebras and some rings. We give a term equivalence between Post algebras of order $p$ and $p$-rings, $p$ prime and lift this result to the axled Łukasiewicz–Moisil algebra $L \cong B_s \times P$ and the ring $\prod ^s F_2 \times \prod
-
Cyclic proofs for the first-order µ-calculus Log. J. IGPL (IF 1.0) Pub Date : 2022-08-04 Bahareh Afshari, Sebastian Enqvist, Graham E Leigh
We introduce a path-based cyclic proof system for first-order $\mu $-calculus, the extension of first-order logic by second-order quantifiers for least and greatest fixed points of definable monotone functions. We prove soundness of the system and demonstrate it to be as expressive as the known trace-based cyclic systems of Dam and Sprenger. Furthermore, we establish cut-free completeness of our system
-
Logical Foundations: Personal Perspective Log. J. IGPL (IF 1.0) Pub Date : 2022-07-28 Yuri Gurevich
We illustrate the glorious history of logical foundations and discuss the uncertain future.
-
Genuine paracomplete logics Log. J. IGPL (IF 1.0) Pub Date : 2022-07-23 Verónica Borja Macías, Marcelo E Coniglio, Alejandro Hernández-Tello
In 2016, Béziau introduces a restricted notion of paraconsistency, the so-called genuine paraconsistency. A logic is genuine paraconsistent if it rejects the laws $\varphi ,\neg \varphi \vdash \psi $ and $\vdash \neg (\varphi \land \neg \varphi )$. In that paper, the author analyzes, among the three-valued logics, which of them satisfy this property. If we consider multiple-conclusion consequence relations
-
Restriction in Program Algebra Log. J. IGPL (IF 1.0) Pub Date : 2022-07-18 Marcel Jackson, Tim Stokes
We provide complete classifications of algebras of partial maps for a significant swathe of combinations of operations not previously classified. Our focus is the many subsidiary operations that arise in recent considerations of the ‘override’ and ‘update’ operations arising in specification languages. These other operations turn out to have an older pedigree: domain restriction, set subtraction and
-
What is mathematical logic? An Australian odyssey Log. J. IGPL (IF 1.0) Pub Date : 2022-07-14 John Newsome Crossley
John Crossley settled in Australia in 1968 having been a graduate student and later University Lecturer at Oxford. This is a brief account of his logical career. It is a revised version of a webcast talk for World Logic Day on 14 January 2022.
-
Axioms for a Logic of Consequential Counterfactuals Log. J. IGPL (IF 1.0) Pub Date : 2022-06-23 Claudio E A Pizzi
The basis of the paper is a logic of analytical consequential implication, CI.0, which is known to be equivalent to the well-known modal system KT thanks to the definition A → B = df A ⥽ B ∧ Ξ (Α, Β), Ξ (Α, Β) being a symbol for what is called here Equimodality Property: (□A ≡ □B) ∧ (◊A ≡ ◊B). Extending CI.0 (=KT) with axioms and rules for the so-called circumstantial operator symbolized by *, one
-
The cardinality of the partitions of a set in the absence of the Axiom of Choice Log. J. IGPL (IF 1.0) Pub Date : 2022-06-22 Palagorn Phansamdaeng, Pimpen Vejjajiva
In the Zermelo–Fraenkel set theory (ZF), $|\textrm {fin}(A)|<2^{|A|}\leq |\textrm {Part}(A)|$ for any infinite set $A$, where $\textrm {fin}(A)$ is the set of finite subsets of $A$, $2^{|A|}$ is the cardinality of the power set of $A$ and $\textrm {Part}(A)$ is the set of partitions of $A$. In this paper, we show in ZF that $|\textrm {fin}(A)|<|\textrm {Part}_{\textrm {fin}}(A)|$ for any set $A$ with
-
Branching Time Axiomatized With the Use of Change Operators Log. J. IGPL (IF 1.0) Pub Date : 2022-06-21 Marcin Łyczak
We present a temporal logic of branching time with four primitive operators: $\exists {\mathcal {C}}$ – it may change whether; $\forall {\mathcal {C}} $ – it must change whether; $\exists \Box $ – it may be endlessly unchangeable that; and $\forall \Box $ – it must be endlessly unchangeable that. Semantically, operator $\forall {\mathcal {C}}$ expresses a change in the logical value of the given formula
-
On semantically labelled syntax trees and the non-existence of certain Sahlqvist formulae Log. J. IGPL (IF 1.0) Pub Date : 2022-04-27 Petar Iliev
Abstract We elaborate on semantically labelled syntax trees that provide a method of proving the non-existence of modal formulae satisfying certain syntactic properties and defining a given class of frames and use them to show that there are classes of Kripke frames that are definable by both non-Sahlqvist and Sahlqvist formulae, but the latter requires more propositional variables.
-
A note on functional relations in a certain class of implicative expansions of FDE related to Brady’s 4-valued logic BN4 Log. J. IGPL (IF 1.0) Pub Date : 2022-04-26 Gemma Robles,José M Méndez
Abstract The logic E4 is related to Brady’s BN4 in a similar way to which Anderson and Belnap’s logic of entailment E is related to their logic of the relevant implication R. In ‘A companion to Brady’s 4-valued relevant logic: the 4-valued logic of entailment E4’, quoted in this paper, three alternatives to BN4 and another three to E4 are summarily introduced in a couple of pages as the only alternatives
-
Complexity of the interpretability logics ILW and ILP Log. J. IGPL (IF 1.0) Pub Date : 2022-04-07 Luka Mikec
Abstract The interpretability logic ILP is the interpretability logic of all sufficiently strong $\varSigma _1$-sound finitely axiomatised theories, such as the Gödel-Bernays set theory. The interpretability logic IL is a strict subset of the intersection of the interpretability logics of all so-called reasonable theories, IL(All). It is known that both ILP and ILW are decidable, however their complexity
-
Contrapositionally complemented Heyting algebras and intuitionistic logic with minimal negation Log. J. IGPL (IF 1.0) Pub Date : 2022-03-20 Anuj Kumar More, Mohua Banerjee
Two algebraic structures, the contrapositionally complemented Heyting algebra (ccHa) and the contrapositionally $\vee $ complemented Heyting algebra (c$\vee $cHa), are studied. The salient feature of these algebras is that there are two negations, one intuitionistic and another minimal in nature, along with a condition connecting the two operators. Properties of these algebras are discussed, examples
-
A low-power HAR method for Fall and High-Intensity ADLs identification using wrist-worn accelerometer devices Log. J. IGPL (IF 1.0) Pub Date : 2022-03-04 Enrique A de la Cal, Mirko Fáñez, Mario Villar, Jose R Villar, Víctor M González
There are many real-world applications like healthcare systems, job monitoring, well-being and personal fitness tracking, monitoring of elderly and frail people, assessment of rehabilitation and follow-up treatments, affording Fall Detection (FD) and ADL (Activity of Daily Living) identification, separately or even at a time. However, the two main drawbacks of these solutions are that most of the times
-
Hourly pollutants forecasting using a deep learning approach to obtain the AQI Log. J. IGPL (IF 1.0) Pub Date : 2022-02-22 José Antonio Moscoso-López, Javier González-Enrique, Daniel Urda, Juan Jesús Ruiz-Aguilar, Ignacio J Turias
The Air Quality Index (AQI) shows the state of air pollution in a unique and more understandable way. This work aims to forecast the AQI in Algeciras (Spain) 8 hours in advance. The AQI is calculated indirectly through the predicted concentrations of five pollutants (O3, NO2, CO, SO2 and PM10) to achieve this goal. Artificial neural networks (ANNs), sequence-to-sequence long short-term memory networks
-
A three-stage hybrid clustering system for diagnosing children with primary headache disorder Log. J. IGPL (IF 1.0) Pub Date : 2022-02-21 Svetlana Simić, Slađana Sakač, Zorana Banković, José R Villar, José Luis Calvo-Rolle, Svetislav D Simić, Dragan Simić
Headache disorders can be considered as the predominant neurological condition. In the field of neurological diseases, migraine was estimated to cost a total of €27 billion per year for the loss through reduced work productivity in the European Community. Medical data and information in turn provide knowledge based on which physicians make scientific decisions for diagnosis and treatments. It is, therefore
-
An efficient IoT forensic approach for the evidence acquisition and analysis based on network link Log. J. IGPL (IF 1.0) Pub Date : 2022-02-17 Saad Khalid Alabdulsalam, Trung Q Duong, Kim-Kwang Raymond Choo, Nhien-An Le-Khac
In an Internet of Things (IoT) environment, IoT devices are typically connected through different network media types such as mobile, wireless and wired networks. Due to the pervasive nature of such devices, they are a potential evidence source in both civil litigation and criminal investigations. It is, however, challenging to identify and acquire forensic artefacts from a broad range of devices,
-
Ethereum-based decentralized car rental system Log. J. IGPL (IF 1.0) Pub Date : 2022-02-16 Cándido Caballero-Gil, Pino Caballero-Gil, Jezabel Molina-Gil, Néstor García-Moreno
Blockchain is a pioneering technology that allows the creation of innovative information exchange ecosystems thanks to unique properties, such as immutability, distribution and transparency. By combining this technology with the emergent internet of things (IoT), many innovative business models can be created. The main objective of this work is to present the design and an initial implementation of
-
A modification proposal for the reconciliation mechanism of the key exchange algorithm NewHope Log. J. IGPL (IF 1.0) Pub Date : 2022-02-16 V Gayoso Martínez, L Hernández Encinas, A Martín Muñoz
The latest advances in quantum computing forced the National Institute of Standards and Technology (NIST) to launch an initiative for selecting quantum-resistant cryptographic algorithms. One of the best-known proposals is NewHope, an algorithm that was initially designed as a key exchange algorithm. In its original design, NewHope presented a reconciliation mechanism that is complex and represents
-
Intelligent model for active power prediction of a small wind turbine Log. J. IGPL (IF 1.0) Pub Date : 2022-02-15 Francisco Zayas-Gato, Esteban Jove, José-Luis Casteleiro-Roca, Héctor Quintián, Francisco Javier Pérez-Castelo, Andrés Piñón-Pazos, Elena Arce, José Luis Calvo-Rolle
In this study, a hybrid model based on intelligent techniques is developed to predict the active power generated in a bioclimatic house by a low power wind turbine. Contrary to other researches that predict the generated power taking into account the speed and the direction of the wind, the model developed in this paper only uses the speed of the wind, measured mainly in a weather station from the
-
Design and implementation of parallel self-adaptive differential evolution for global optimization Log. J. IGPL (IF 1.0) Pub Date : 2022-02-15 Iztok Fister, Andres Iglesias, Akemi Galvez, Dušan Fister, Iztok Fister
The results of evolutionary algorithms depend on population diversity that normally decreases by increasing the selection pressure from generation to generation. Usually, this can lead the evolution process to get stuck in local optima. This study is focused on mechanisms to avoid this undesired phenomenon by introducing parallel self-adapted differential evolution that decomposes a monolithic population
-
MDL+ a manufacturing description language to describe and control assembling tasks in industry 4.0 Log. J. IGPL (IF 1.0) Pub Date : 2022-02-15 Mauricio-Andres Zamora-Hernandez, Jose Andrez Chaves Ceciliano, Alonso Villalobos Granados, John Alejandro Castro Vargas, Jose Garcia-Rodriguez, Jorge Azorin-Lopez
The assembly of products or components by operators in industries is a complex task with recurring problems. In these processes, operators often make errors that can lead to defective products. Therefore, they need to be inspected later to verify their correct assembly. The main problems are caused by several reasons including high employee turnover, lack of experience in manufacturing specific products
-
Streaming big time series forecasting based on nearest similar patterns with application to energy consumption Log. J. IGPL (IF 1.0) Pub Date : 2022-02-15 P Jiménez-Herrera, L Melgar-GarcÍa, G Asencio-Cortés, A Troncoso
This work presents a novel approach to forecast streaming big time series based on nearest similar patterns. This approach combines a clustering algorithm with a classifier and the nearest neighbours algorithm. It presents two separate stages: offline and online. The offline phase is for training and finding the best models for clustering, classification and the nearest neighbours algorithm. The online
-
Filtering non-balanced data using an evolutionary approach Log. J. IGPL (IF 1.0) Pub Date : 2022-02-15 Jessica A Carballido, Ignacio Ponzoni, Rocío L Cecchini
Matrices that cannot be handled using conventional clustering, regression or classification methods are often found in every big data research area. In particular, datasets with thousands or millions of rows and less than a hundred columns regularly appear in biological so-called omic problems. The effectiveness of conventional data analysis approaches is hampered by this matrix structure, which necessitates