当前期刊: Logic Journal of the IGPL Go to current issue    加入关注   
显示样式:        排序: IF: - GO 导出
  • Logics of (In)sane and (Un)reliable Beliefs
    Log. J. IGPL (IF 0.931) Pub Date : 2020-09-30
    Jie Fan

    Inspired by an interesting quotation from the literature, we propose four modalities, called ‘sane belief’, ‘insane belief’, ‘reliable belief’ and ‘unreliable belief’, and introduce logics with each operator as the modal primitive. We show that the four modalities constitute a square of opposition, which indicates some interesting relationships among them. We compare the relative expressivity of these

  • Intelligent models for movement detection and physical evolution of patients with hip surgery
    Log. J. IGPL (IF 0.931) Pub Date : 2020-09-24
    César Guevara; Matilde Santos

    This paper develops computational models to monitor patients with hip replacement surgery. The Kinect camera (Xbox One) is used to capture the movements of patients who are performing rehabilitation exercises with both lower limbs, specifically, ‘side step’ and ‘knee lift’ with each leg. The information is measured at 25 body points with their respective coordinates. Features selection algorithms are

  • Complexity of rule sets in mining incomplete data using characteristic sets and generalized maximal consistent blocks
    Log. J. IGPL (IF 0.931) Pub Date : 2020-09-18
    Patrick G Clark; Cheng Gao; Jerzy W Grzymala-Busse; Teresa Mroczek; Rafal Niemiec

    In this paper, missing attribute values in incomplete data sets have three possible interpretations: lost values, attribute-concept values and ‘do not care’ conditions. For rule induction, we use characteristic sets and generalized maximal consistent blocks. Therefore, we apply six different approaches for data mining. As follows from our previous experiments, where we used an error rate evaluated

  • Patterns of frequent user interactions in blogosphere
    Log. J. IGPL (IF 0.931) Pub Date : 2020-09-16
    Krzysztof Rudek; Jarosław Koźlak

    The aim of the paper is to identify and categorize frequent patterns describing interactions between users in social networks. We analyze a social network with relationships between users that evolve in time already identified. In our research, we discover patterns based on frequent interactions between groups of users. The patterns are described by the characteristics of these interactions, such as

  • On learning context-aware rules to link RDF datasets
    Log. J. IGPL (IF 0.931) Pub Date : 2020-09-15
    Andrea Cimmino; Rafael Corchuelo

    Integrating RDF datasets has become a relevant problem for both researchers and practitioners. In the literature, there are many genetic proposals that learn rules that allow to link the resources that refer to the same real-world entities, which is paramount to integrating the datasets. Unfortunately, they are context-unaware because they focus on the resources and their attributes but forget about

  • Machine learning techniques for computer-based decision systems in the operating theatre: application to analgesia delivery
    Log. J. IGPL (IF 0.931) Pub Date : 2020-09-14
    Jose M Gonzalez-Cava; Rafael Arnay; Juan Albino Mendez-Perez; Ana León; María Martín; Jose A Reboso; Esteban Jove-Perez; Jose Luis Calvo-Rolle

    This work focuses on the application of machine learning techniques to assist the clinicians in the administration of analgesic drug during general anaesthesia. Specifically, the main objective is to propose the basis of an intelligent system capable of making decisions to guide the opioid dose changes based on a new nociception monitor, the analgesia nociception index (ANI). Clinical data were obtained

  • A modified biogeography-based optimization algorithm with improved mutation operator for job shop scheduling problem with time lags
    Log. J. IGPL (IF 0.931) Pub Date : 2020-09-12
    Madiha Harrabi; Olfa Belkahla Driss; Khaled Ghedira

    This paper addresses the job shop scheduling problem including time lag constraints. This is an extension of the job shop scheduling problem with many applications in real production environments, where extra (minimum and maximum) delays can be introduced between successive operations of the same job. It belongs to a category of problems known as NP-hard problem due to large solution space. Biogeography-based

  • Detection of forest fires outbreaks by dynamic fuzzy logic controller
    Log. J. IGPL (IF 0.931) Pub Date : 2020-09-12
    Josué Toledo-Castro; Nayra Rodríguez-Pérez; Pino Caballero-Gil; Iván Santos-González; Candelaria Hernández-Goya; Ricardo Aguasca-Colomo

    The use of wireless sensor networks (WSNs) and the Internet of things to detect forest fire outbreaks may help to reduce the response time and avoid natural disasters. This work proposes the deployment of WSN to enhance the real-time monitoring of dynamic variables such as polluting gases, temperature or the presence of fire flames by infrared. In addition, the activation of forest fire alerts if environmental

  • Hybrid Intelligent Model to Predict the Remifentanil Infusion Rate in Patients Under General Anesthesia
    Log. J. IGPL (IF 0.931) Pub Date : 2020-09-11
    Esteban Jove; Jose M Gonzalez-Cava; José-Luis Casteleiro-Roca; Héctor Quintián; Juan Albino Méndez Pérez; Rafael Vega Vega; Francisco Zayas-Gato; Francisco Javier de Cos Juez; Ana León; María MartÍn; José A Reboso; Michał Woźniak; José Luis Calvo-Rolle

    Automatic control of physiological variables is one of the most active areas in biomedical engineering. This paper is centered in the prediction of the analgesic variables evolution in patients undergoing surgery. The proposal is based on the use of hybrid intelligent modelling methods. The study considers the Analgesia Nociception Index (ANI) to assess the pain in the patient and remifentanil as intravenous

  • A hybrid fuzzy clustering approach for diagnosing primary headache disorder
    Log. J. IGPL (IF 0.931) Pub Date : 2020-09-11
    Svetlana Simić; Zorana Banković; José R Villar; Dragan Simić; Svetislav D Simić

    Clustering is one of the most fundamental and essential data analysis tasks with broad applications. It has been studied in various research fields: data mining, machine learning, pattern recognition and in engineering, economics and biomedical data analysis. Headache is not a disease that typically shortens one’s life, but it can be a serious social as well as a health problem. Approximately 27 billion

  • Compensating atmospheric turbulence with CNNs for defocused pupil image wavefront sensors
    Log. J. IGPL (IF 0.931) Pub Date : 2020-09-11
    Sergio Luis Suárez Gómez; Carlos González-Gutiérrez; Juan Díaz Suárez; Juan José Fernández Valdivia; José Manuel Rodríguez Ramos; Luis Fernando Rodríguez Ramos; Jesús Daniel Santos Rodríguez

    Adaptive optics are techniques used for processing the spatial resolution of astronomical images taken from large ground-based telescopes. In this work, computational results are presented for a modified curvature sensor, the tomographic pupil image wavefront sensor (TPI-WFS), which measures the turbulence of the atmosphere, expressed in terms of an expansion over Zernike polynomials. Convolutional

  • Orthogonal Learning Firefly Algorithm
    Log. J. IGPL (IF 0.931) Pub Date : 2020-09-10
    Tomas Kadavy; Roman Senkerik; Michal Pluhacek; Adam Viktorin

    The primary aim of this original work is to provide a more in-depth insight into the relations between control parameters adjustments, learning techniques, inner swarm dynamics and possible hybridization strategies for popular swarm metaheuristic Firefly Algorithm (FA). In this paper, a proven method, orthogonal learning, is fused with FA, specifically with its hybrid modification Firefly Particle

  • Towards real-time DNA biometrics using GPU-accelerated processing
    Log. J. IGPL (IF 0.931) Pub Date : 2020-09-09
    Mario Reja; Ciprian Pungila; Viorel Negru

    Decoding the human genome in the past decades has brought into focus a computationally intensive operation through DNA profiling. The typical search space for these kinds of problems is extremely large and requires specialized hardware and algorithms to perform the necessary sequence analysis. In this paper, we propose an innovative and scalable approach to exact multi-pattern matching of nucleotide

  • Biometric recognition system performance measures for lossy compression on EEG signals
    Log. J. IGPL (IF 0.931) Pub Date : 2020-09-09
    Binh Nguyen; Wanli Ma; Dat Tran

    Electroencephalogram (EEG) plays an essential role in analysing and recognizing brain-related diseases. EEG has been increasingly used as a new type of biometrics in person identification and verification systems. These EEG-based systems are important components in applications for both police and civilian works, and both areas process a huge amount of EEG data. Storing and transmitting these huge

  • Blockchain-based architecture for the control of logistics activities: Pharmaceutical utilities case study
    Log. J. IGPL (IF 0.931) Pub Date : 2020-09-08
    Yeray Mezquita; Roberto Casado-Vara; Alfonso GonzÁlez Briones; Javier Prieto; Juan M Corchado

    Logistics services involve a wide range of transport operations between distributors and clients. Currently, the large number of intermediaries are a challenge for this sector, as it makes all the processes more complicated. To face that problem, we propose a system that uses smart contracts to remove intermediaries and speed up logistics activities. Our new model combines smart contracts and a multi-agent

  • Lyndon’s interpolation property for the logic of strict implication
    Log. J. IGPL (IF 0.931) Pub Date : 2020-09-04
    Narbe Aboolian; Majid Alizadeh

    The main result proves Lyndon’s and Craig’s interpolation properties for the logic of strict implication |${\textsf{F}}$|⁠, with a purely syntactical method. A cut-free G3-style sequent calculus |$ {\textsf{GF}} $| and its single-succedent variant |$ \textsf{GF}_{\textsf{s}} $| are introduced. |$ {\textsf{GF}} $| can be extended to a G3-variant of the sequent calculus GBPC3 for Visser’s basic logic

  • Missing data imputation over academic records of electrical engineering students
    Log. J. IGPL (IF 0.931) Pub Date : 2020-08-07

    The fourteen papers included in this special issue represent a selection of extended contributions presented at the 12th International Conference on Soft Computing Models in Industrial and Environmental Applications (SOCO 2017) and the 10th International Computational Intelligence in Security for Information Systems (CISIS 2017) both held in León, Spain, September 6th–8th 2017 and organized by the

  • Evolutionary Reinforcement Learning for Adaptively Detecting Database Intrusions
    Log. J. IGPL (IF 0.931) Pub Date : 2020-08-07

    The fourteen papers included in this special issue represent a selection of extended contributions presented at the 12th International Conference on Soft Computing Models in Industrial and Environmental Applications (SOCO 2017) and the 10th International Computational Intelligence in Security for Information Systems (CISIS 2017) both held in León, Spain, September 6th–8th 2017 and organized by the

  • Saturated models of first-order many-valued logics
    Log. J. IGPL (IF 0.931) Pub Date : 2020-08-03
    Guillermo Badia; Carles Noguera

    This paper is devoted to the problem of existence of saturated models for first-order many-valued logics. We consider a general notion of type as pairs of sets of formulas in one free variable that express properties that an element of a model should, respectively, satisfy and falsify. By means of an elementary chains construction, we prove that each model can be elementarily extended to a |$\kappa

  • Editorial: Special issue SOCO-CISIS 2017-IGPL
    Log. J. IGPL (IF 0.931) Pub Date : 2020-07-31

    The fourteen papers included in this special issue represent a selection of extended contributions presented at the 12th International Conference on Soft Computing Models in Industrial and Environmental Applications (SOCO 2017) and the 10th International Computational Intelligence in Security for Information Systems (CISIS 2017) both held in León, Spain, September 6th–8th 2017 and organized by the

  • The Axiom of Choice and the Partition Principle from Dialectica Categories
    Log. J. IGPL (IF 0.931) Pub Date : 2020-07-30
    Samuel G Da Silva

    The method of morphisms is a well-known application of Dialectica categories to set theory (more precisely, to the theory of cardinal invariants of the continuum). In a previous work, Valeria de Paiva and the author have asked how much of the Axiom of Choice is needed in order to carry out the referred applications of such method. In this paper, we show that, when considered in their full generality

  • The Russell-Prawitz embedding and the atomization of universal instantiation
    Log. J. IGPL (IF 0.931) Pub Date : 2020-07-29
    José Espírito Santo; Gilda Ferreira

    Given the recent interest in the fragment of system |$\mathbf{F}$| where universal instantiation is restricted to atomic formulas, a fragment nowadays named system |${\mathbf{F}}_{\textbf{at}}$|⁠, we study directly in system |$\mathbf{F}$| new conversions whose purpose is to enforce that restriction. We show some benefits of these new atomization conversions: (i) they help achieving strict simulation

  • Vector logic allows counterfactual virtualization by the square root of NOT
    Log. J. IGPL (IF 0.931) Pub Date : 2020-07-27
    Eduardo Mizraji

    In this work, we investigate the representation of counterfactual conditionals using the vector logic, a matrix-vector formalism for logical functions and truth values. Inside this formalism, the counterfactuals can be transformed in complex matrices preprocessing an implication matrix with one of the square roots of NOT, a complex matrix. This mathematical approach puts in evidence the virtual character

  • Extensions of paraconsistent weak Kleene logic
    Log. J. IGPL (IF 0.931) Pub Date : 2020-07-27
    Francesco Paoli; Michele Pra Baldi

    Paraconsistent weak Kleene (⁠|$\textrm{PWK}$|⁠) logic is the |$3$|-valued logic based on the weak Kleene matrices and with two designated values. In this paper, we investigate the poset of prevarieties of generalized involutive bisemilattices, focussing in particular on the order ideal generated by Α|$\textrm{lg} (\textrm{PWK})$|⁠. Applying to this poset a general result by Alexej Pynko, we prove that

  • An axiomatic approach to CG′3 logic
    Log. J. IGPL (IF 0.931) Pub Date : 2020-07-27
    Miguel Pérez-Gaspar; Alejandro Hernández-Tello; José Arrazola Ramírez; Mauricio Osorio Galindo

    In memoriam José Arrazola Ramírez (1962–2018) The logic |$\textbf{G}^{\prime}_3$| was introduced by Osorio et al. in 2008; it is a three-valued logic, closely related to the paraconsistent logic |$\textbf{CG}^{\prime}_3$| introduced by Osorio et al. in 2014. The logic |$\textbf{CG}^{\prime}_3$| is defined in terms of a multi-valued semantics and has the property that each theorem in |$\textbf{G}^{\prime}_3$|

  • A remark on functional completeness of binary expansions of Kleene’s strong 3-valued logic
    Log. J. IGPL (IF 0.931) Pub Date : 2020-07-27
    Gemma Robles; José M Méndez

    A classical result by Słupecki states that a logic L is functionally complete for the 3-element set of truth-values THREE if, in addition to functionally including Łukasiewicz’s 3-valued logic Ł3, what he names the ‘|$T$|-function’ is definable in L. By leaning upon this classical result, we prove a general theorem for defining binary expansions (i.e. expansions with a binary connective) of Kleene’s

  • When Curry met Abel
    Log. J. IGPL (IF 0.931) Pub Date : 2020-07-16
    Manuel Eduardo Tapia-Navarro; Luis Estrada-González

    Based on his Inclosure Schema and the Principle of Uniform Solution (PUS), Priest has argued that Curry’s paradox belongs to a different family of paradoxes than the Liar. Pleitz (2015, The Logica Yearbook 2014, pp. 233–248) argued that Curry’s paradox shares the same structure as the other paradoxes and proposed a scheme of which the Inclosure Schema is a particular case and he criticizes Priest’s

  • Boolean negation and non-conservativity II: The variable-sharing property
    Log. J. IGPL (IF 0.931) Pub Date : 2020-07-15

    Many relevant logics are conservatively extended by Boolean negation. Not all, however. This paper shows an acute form of non-conservativeness, namely that the Boolean-free fragment of the Boolean extension of a relevant logic need not always satisfy the variable-sharing property. In fact, it is shown that such an extension can in fact yield classical logic. For a vast range of relevant logic, however

  • Boolean negation and non-conservativity I: Relevant modal logics
    Log. J. IGPL (IF 0.931) Pub Date : 2020-07-15
    Tore Fjetland Øgaard

    Many relevant logics can be conservatively extended by Boolean negation. Mares showed, however, that E is a notable exception. Mares’ proof is by and large a rather involved model-theoretic one. This paper presents a much easier proof-theoretic proof which not only covers E but also generalizes so as to also cover relevant logics with a primitive modal operator added. It is shown that from even very

  • Elementary-base cirquent calculus II: Choice quantifiers
    Log. J. IGPL (IF 0.931) Pub Date : 2020-07-14
    Giorgi Japaridze

    Cirquent calculus is a novel proof theory permitting component-sharing between logical expressions. Using it, the predecessor article ‘Elementary-base cirquent calculus I: Parallel and choice connectives’ built the sound and complete axiomatization |$\textbf{CL16}$| of a propositional fragment of computability logic. The atoms of the language of |$\textbf{CL16}$| represent elementary, i.e. moveless

  • Boolean negation and non-conservativity III: the Ackermann constant
    Log. J. IGPL (IF 0.931) Pub Date : 2020-07-13
    Tore Fjetland Øgaard

    It is known that many relevant logics can be conservatively extended by the truth constant known as the Ackermann constant. It is also known that many relevant logics can be conservatively extended by Boolean negation. This essay, however, shows that a range of relevant logics with the Ackermann constant cannot be conservatively extended by a Boolean negation.

  • Natural deduction and semantic models of justification logic in the proof assistant Coq
    Log. J. IGPL (IF 0.931) Pub Date : 2020-06-25
    Jesús Mauricio Andrade Guzmán; Francisco Hernández Quiroz

    The purpose of this paper is to present a formalization of the language, semantics and axiomatization of justification logic in Coq. We present proofs in a natural deduction style derived from the axiomatic approach of justification logic. Additionally, we present possible world semantics in Coq based on Fitting models to formalize the semantic satisfaction of formulas. As an important result, with

  • The subformula property of natural deduction derivations and analytic cuts
    Log. J. IGPL (IF 0.931) Pub Date : 2020-06-17
    Mirjana Borisavljević

    In derivations of a sequent system, |$\mathcal{L}\mathcal{J}$|⁠, and a natural deduction system, |$\mathcal{N}\mathcal{J}$|⁠, the trails of formulae and the subformula property based on these trails will be defined. The derivations of |$\mathcal{N}\mathcal{J}$| and |$\mathcal{L}\mathcal{J}$| will be connected by the map |$g$|⁠, and it will be proved the following: an |$\mathcal{N}\mathcal{J}$|-derivation

  • Conferences
    Log. J. IGPL (IF 0.931) Pub Date : 2020-06-12
    Ferrarotti F, GonzÁles S, Schewe K, et al.

    AbstractWe introduce a restricted second-order logic $\textrm{SO}^{\textit{plog}}$ for finite structures where second-order quantification ranges over relations of size at most poly-logarithmic in the size of the structure. We demonstrate the relevance of this logic and complexity class by several problems in database theory. We then prove a Fagin’s style theorem showing that the Boolean queries which

  • Why the Axiom of Choice Sometimes Fails
    Log. J. IGPL (IF 0.931) Pub Date : 2020-06-06
    Ivonne Victoria Pallares-Vega

    The early controversies surrounding the axiom of choice are well known, as are the many results that followed concerning its (in)dependence from, and equivalence to, other mathematical propositions. This paper focuses not on the logical status of the axiom but rather on showing why it fails in certain categories.

  • The complexity of definability by open first-order formulas
    Log. J. IGPL (IF 0.931) Pub Date : 2020-05-30
    Carlos Areces; Miguel Campercholi; Daniel Penazzi; Pablo Ventura

    In this article, we formally define and investigate the computational complexity of the definability problem for open first-order formulas (i.e. quantifier free first-order formulas) with equality. Given a logic |$\boldsymbol{\mathcal{L}}$|⁠, the |$\boldsymbol{\mathcal{L}}$|-definability problem for finite structures takes as an input a finite structure |$\boldsymbol{A}$| and a target relation |$T$|

  • Interactive proof-search for equational reasoning
    Log. J. IGPL (IF 0.931) Pub Date : 2020-05-29
    Favio E Miranda-Perea; Lourdes del Carmen González Huesca; P Selene Linares-Arévalo

    Equational reasoning arises in many areas of mathematics and computer science. It is a cornerstone of algebraic reasoning and results essential in tasks of specification and verification in functional programming, where a program is mainly a set of equations. The usual manipulation of identities while conducting informal proofs obviates many intermediate steps that are neccesary while developing them

  • Cn algebras with Moisil possibility operators
    Log. J. IGPL (IF 0.931) Pub Date : 2020-05-16
    Aldo V Figallo; Gustavo Pelaitay; Jonathan Sarmiento

    In this paper, we continue the study of the Łukasiewicz residuation algebras of order |$n$| with Moisil possibility operators (or |$MC_n$|-algebras) initiated by Figallo (1989, PhD Thesis, Universidad Nacional del Sur). More precisely, among other things, a method to determine the number of elements of the |$MC_n$|-algebra with a finite set of free generators is described. Applying this method, we

  • Tableaux for essence and contingency
    Log. J. IGPL (IF 0.931) Pub Date : 2020-05-13
    Giorgio Venturi; Pedro Teixeira Yago

    We offer tableaux systems for logics of essence and accident and logics of non-contingency, showing their soundness and completeness for Kripke semantics. We also show an interesting parallel between these logics based on the semantic insensitivity of the two non-normal operators by which these logics are expressed.

  • A restricted second-order logic for non-deterministic poly-logarithmic time
    Log. J. IGPL (IF 0.931) Pub Date : 2020-05-12
    Flavio Ferrarotti; SenÉn GonzÁles; Klaus-Dieter Schewe; JosÉ MarÍa Turull-Torres

    We introduce a restricted second-order logic |$\textrm{SO}^{\textit{plog}}$| for finite structures where second-order quantification ranges over relations of size at most poly-logarithmic in the size of the structure. We demonstrate the relevance of this logic and complexity class by several problems in database theory. We then prove a Fagin’s style theorem showing that the Boolean queries which can

  • Nelson’s logic 𝒮
    Log. J. IGPL (IF 0.931) Pub Date : 2020-05-09
    Thiago Nascimento; Umberto Rivieccio; João Marcos; Matthew Spinks

    Besides the better-known Nelson logic (⁠|$\mathcal{N}3$|⁠) and paraconsistent Nelson logic (⁠|$\mathcal{N}4$|⁠), in 1959 David Nelson introduced, with motivations of realizability and constructibility, a logic called |$\mathcal{S}$|⁠. The logic |$\mathcal{S}$| was originally presented by means of a calculus (crucially lacking the contraction rule) with infinitely many rule schemata and no semantics

  • A bottom-up algorithm for solving ♯2SAT
    Log. J. IGPL (IF 0.931) Pub Date : 2020-05-05
    Guillermo De Ita; J Raymundo Marcial-Romero; J A HernÁndez-ServÍn

    Counting models for a two conjunctive formula (2-CF) |$F$|⁠, a problem known as |$\sharp $|2Sat, is a classic |$\sharp $|P complete problem. Given a 2-CF |$F$| as input, its constraint graph |$G$| is built. If |$G$| is acyclic, then |$\sharp $|2Sat(⁠|$F$|⁠) can be computed efficiently. In this paper, we address the case when |$G$| has cycles.

  • Editorial: Special issue HAIS17-IGPL
    Log. J. IGPL (IF 0.931) Pub Date : 2020-03-19
    Francisco Javier Martínez De PisóN; Rubén Urraca; Héctor Quintián; Emilio Corchado

    The eight papers included in this special issue represent a selection of extended contributions presented at the 12th International Conference on Hybrid Artificial Intelligent Systems (HAIS 2017) held in Logroño (La Rioja), Spain on 21–23 June 2017 and organized by the BISITE group and the University of La Rioja.

  • A proof-search system for the logic of likelihood
    Log. J. IGPL (IF 0.931) Pub Date : 2020-03-12
    R Alonderis; H Giedra

    A proof-search system for the logic of likelihood

  • The logic of imaginary scenarios
    Log. J. IGPL (IF 0.931) Pub Date : 2020-02-01
    Joan Casas-Roma; Antonia Huertas; M Elena Rodríguez

    Imagining is something we use everyday in our lives and in a wide variety of ways. In spite of the amount of works devoted to its study from both psychology and philosophy, there are only a few formal systems capable of modelling it; besides, almost all of those systems are static, in the sense that their models are initially predefined, and they fail to capture the dynamic process behind the creation

  • Time series forecasting with model selection applied to anomaly detection in network traffic
    Log. J. IGPL (IF 0.931) Pub Date : 2020-01-21
    Łukasz Saganowski; Tomasz Andrysiak

    In herein article an attempt of problem solution connected with anomaly detection in network traffic with the use of statistic models with long or short memory dependence was presented. In order to select the proper type of a model, the parameter describing memory on the basis of the Geweke and Porter-Hudak test was estimated. Bearing in mind that the value of statistic model depends directly on quality

  • On the application of compression-based metrics to identifying anomalous behaviour in web traffic
    Log. J. IGPL (IF 0.931) Pub Date : 2020-01-20
    Gonzalo de la Torre-Abaitua; Luis F Lago-Fernández; David Arroyo

    In cybersecurity, there is a call for adaptive, accurate and efficient procedures to identifying performance shortcomings and security breaches. The increasing complexity of both Internet services and traffic determines a scenario that in many cases impedes the proper deployment of intrusion detection and prevention systems. Although it is a common practice to monitor network and applications activity

  • Anomaly detection based on one-class intelligent techniques over a control level plant
    Log. J. IGPL (IF 0.931) Pub Date : 2020-01-13
    Esteban Jove; José-Luis Casteleiro-Roca; Héctor Quintián; Dragan Simić; Juan-Albino Méndez-Pérez; José Luis Calvo-Rolle

    A large part of technological advances, especially in the field of industry, have been focused on the optimization of productive processes. However, the detection of anomalies has turned out to be a great challenge in fields like industry, medicine or stock markets. The present work addresses anomaly detection on a control level plant. We propose the application of different intelligent techniques

  • Deep packet inspection for intelligent intrusion detection in software-defined industrial networks: A proof of concept
    Log. J. IGPL (IF 0.931) Pub Date : 2019-12-31
    Markel Sainz; Iñaki Garitano; Mikel Iturbe; Urko Zurutuza

    Specifically tailored industrial control systems (ICSs) attacks are becoming increasingly sophisticated, accentuating the need of ICS cyber security. The nature of these systems makes traditional IT security measures not suitable, requiring expressly developed security countermeasures. Within the past decades, research has been focused in network-based intrusion detection systems. With the appearance

  • Using the Spanish national identity card in social networks
    Log. J. IGPL (IF 0.931) Pub Date : 2019-12-30
    V Gayoso MartÍnez; L HernÁndez Encinas; A MartÍn MuÑoz; R DurÁn DÍaz

    The distinctive security features of the Spanish electronic national identity card, known as Documento Nacional de Identidad electrónico, allow us to propose the usage of this cryptographic smart card in an authentication framework that can be used during the registration and login phases of internet services where the validation of the user’s age and real identity are key elements, as it is the case

  • A novel fuzzy metaheuristic approach in nurse rerostering problem
    Log. J. IGPL (IF 0.931) Pub Date : 2019-12-27
    Svetlana Simić; Emilio Corchado; Dragan Simić; Jovanka Đorđević; Svetislav D Simić

    In the past 50 years nurse scheduling has received considerable attention in the research community. There are two cases regarding the nurse scheduling problem (NSP): the static and dynamic. Dynamic NSP, is often called nurse rerostering problem (NRRP), which presents reconstruction or modification of the predetermined roster for the current scheduling horizon. The aim of this paper is to present new

  • Patent retrieval architecture based on document retrieval. Sketching out the Spanish patent landscape
    Log. J. IGPL (IF 0.931) Pub Date : 2019-12-14
    Ana B Gil-GonzÁlez; Andrea VÁzquez-Ingelmo; Fernando de la Prieta; Ana de Luis-Reboredo; Alfonso GonzÁlez-Briones

    A patent is a property granted to any new shape, configuration or arrangement of elements, of any device, tool, instrument, mechanism or other object or part thereof, that allows for a better or different operation, use or manufacture of the object that incorporates it or that provides it with some utility, advantage or technical effect that it did not have before. As a document, a patent really is

  • Missing data imputation over academic records of electrical engineering students
    Log. J. IGPL (IF 0.931) Pub Date : 2019-12-13
    Esteban Jove; Patricia Blanco-Rodríguez; José-Luis Casteleiro-Roca; Héctor Quintián; Francisco Javier Moreno Arboleda; José Antonio LóPez-Vázquez; Benigno Antonio Rodríguez-Gómez; María Del Carmen Meizoso-López; Andrés Piñón-Pazos; Francisco Javier De Cos Juez; Sung-Bae Cho; José Luis Calvo-Rolle

    Nowadays, the quality standards of higher education institutions pay special attention to the performance and evaluation of the students. Then, having a complete academic record of each student, such as number of attempts, average grade and so on, plays a key role. In this context, the existence of missing data, which can happen for different reasons, leads to affect adversely interesting future analysis

  • Recovering Decimation-Based Cryptographic Sequences by Means of Linear CAs
    Log. J. IGPL (IF 0.931) Pub Date : 2019-12-10
    Sara D Cardell; Diego F Aranha; Amparo Fúster-Sabater

    The sequences produced by the cryptographic sequence generator known as the shrinking generator can be modelled as the output sequences of linear elementary cellular automata (CA). These sequences are composed of interleaved m-sequences produced by linear structures based on feedback shifts. This profitable characteristic can be used in the cryptanalysis of this generator. In this work we propose an

  • Evolutionary Reinforcement Learning for Adaptively Detecting Database Intrusions
    Log. J. IGPL (IF 0.931) Pub Date : 2019-12-09
    Seul-Gi Choi; Sung-Bae Cho

    Relational database management system (RDBMS) is the most popular database system. It is important to maintain data security from information leakage and data corruption. RDBMS can be attacked by an outsider or an insider. It is difficult to detect an insider attack because its patterns are constantly changing and evolving. In this paper, we propose an adaptive database intrusion detection system that

  • Wind Power with Energy Storage Arbitrage in Day-ahead Market by a Stochastic MILP Approach
    Log. J. IGPL (IF 0.931) Pub Date : 2019-12-09

    This paper is about a support information management system for a wind power (WP) producer having an energy storage system (ESS) and participating in a day-ahead electricity market. Energy storage can play not only a leading role in mitigation of the effect of uncertainty faced by a WP producer, but also allow for conversion of wind energy into electric energy to be stored and then released at favourable

  • Non-removal strategy for outliers in predictive models: The PAELLA algorithm case
    Log. J. IGPL (IF 0.931) Pub Date : 2019-12-09
    Manuel Castejón-limas; Hector Alaiz-Moreton; Laura Fernández-Robles; Javier Alfonso-Cendón; Camino Fernández-Llamas; lidia Sánchez-González; Hilde Pérez

    This paper reports the experience of using the PAELLA algorithm as a helper tool in robust regression instead of as originally intended for outlier identification and removal. This novel usage of the algorithm takes advantage of the occurrence vector calculated by the algorithm in order to strengthen the effect of the more reliable samples and lessen the impact of those that otherwise would be considered

  • Self-Organizing Maps to Validate Anti-Pollution Policies
    Log. J. IGPL (IF 0.931) Pub Date : 2019-12-09
    Ángel Arroyo; Carlos Cambra; Álvaro Herrero; Verónica Tricio; Emilio Corchado

    This study presents the application of self-organizing maps to air-quality data in order to analyze episodes of high pollution in Madrid (Spain’s capital city). The goal of this work is to explore the dataset and then compare several scenarios with similar atmospheric conditions (periods of high Nitrogen dioxide concentration): some of them when no actions were taken and some when traffic restrictions

  • On Fingerprinting of Public Malware Analysis Services
    Log. J. IGPL (IF 0.931) Pub Date : 2019-12-07
    Alvaro Botas; Ricardo J Rodríguez; Vicente Matellan; Juan F Garcia; M T Trobajo; Miguel V Carriegos

    Automatic public malware analysis services (PMAS, e.g. VirusTotal, Jotti or ClamAV, to name a few) provide controlled, isolated and virtual environments to analyse malicious software (malware) samples. Unfortunately, malware is currently incorporating techniques to recognize execution onto a virtual or sandbox environment; when an analysis environment is detected, malware behaves as a benign application

  • The perfect surprise: a new analysis in dynamic epistemic logic
    Log. J. IGPL (IF 0.931) Pub Date : 2019-11-15
    Leander Vignero; Lorenz Demey

    In this article, we present a new logical framework to think about surprise. This research does not just aim to better understand, model and predict human behaviour, but also attempts to provide tools for implementing artificial agents. Moreover, these artificial agents should then also be able to reap the same epistemic benefits from surprise as humans do. We start by discussing the dominant literature

Contents have been reproduced by permission of the publishers.
Springer 纳米技术权威期刊征稿
ACS ES&T Engineering
ACS ES&T Water
ACS Publications填问卷