• Log. J. IGPL (IF 0.931) Pub Date : 2020-08-03

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 更新日期：2020-08-03 • 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 更新日期：2020-08-01 • 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 更新日期：2020-07-30 • 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 更新日期：2020-07-29 • 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 更新日期：2020-07-28 • 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 更新日期：2020-07-28 • 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$| 更新日期：2020-07-28 • 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 更新日期：2020-07-28 • 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 更新日期：2020-07-16 • Log. J. IGPL (IF 0.931) Pub Date : 2020-07-15 TORE FJETLAND ØGAARD 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 更新日期：2020-07-16 • 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 更新日期：2020-07-16 • 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 更新日期：2020-07-15 • 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. 更新日期：2020-07-14 • 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 更新日期：2020-06-25 • 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 更新日期：2020-06-17 • 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 更新日期：2020-06-12 • 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. 更新日期：2020-06-06 • 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$| 更新日期：2020-05-30 • 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 更新日期：2020-05-29 • 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 更新日期：2020-05-16 • 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. 更新日期：2020-05-13 • 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 更新日期：2020-05-12 • 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 更新日期：2020-05-09 • 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.

更新日期：2020-05-05
• 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.

更新日期：2020-03-19
• Log. J. IGPL (IF 0.931) Pub Date : 2020-03-12
R Alonderis; H Giedra

A proof-search system for the logic of likelihood

更新日期：2020-03-12
• 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

更新日期：2020-02-01
• 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

更新日期：2020-01-21
• 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

更新日期：2020-01-20
• 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

更新日期：2020-01-13
• 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

更新日期：2019-12-31
• 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

更新日期：2019-12-30
• 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

更新日期：2019-12-27
• 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

更新日期：2019-12-14
• 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

更新日期：2019-12-13
• 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

更新日期：2019-12-10
• 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

更新日期：2019-12-09
• Log. J. IGPL (IF 0.931) Pub Date : 2019-12-09
I L R GOMES; R MELICIO; V M F MENDES; H M I POUSINHO

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

更新日期：2019-12-09
• 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

更新日期：2019-12-09
• 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

更新日期：2019-12-09
• 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

更新日期：2019-12-07
• 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

更新日期：2019-11-15
• Log. J. IGPL (IF 0.931) Pub Date : 2019-11-15
Juan Manuel Cornejo; HernÁn Javier San MartÍn

Extending the relation between semi-Heyting algebras and semi-Nelson algebras to dually hemimorphic semi-Heyting algebras, we introduce and study the variety of dually hemimorphic semi-Nelson algebras and some of its subvarieties. In particular, we prove that the category of dually hemimorphic semi-Heyting algebras is equivalent to the category of dually hemimorphic centered semi-Nelson algebras. We

更新日期：2019-11-15
• Log. J. IGPL (IF 0.931) Pub Date : 2018-12-12
F Segovia,J M Górriz,J Ramírez,F J Martinez-Murcia,M García-Pérez

The analysis of neuroimaging data is frequently used to assist the diagnosis of neurodegenerative disorders such as Alzheimer's disease (AD) or Parkinson's disease (PD) and has become a routine procedure in the clinical practice. During the past decade, the pattern recognition community has proposed a number of machine learning-based systems that automatically analyse neuroimaging data in order to

更新日期：2019-11-01
• Log. J. IGPL (IF 0.931) Pub Date : 2015-11-20
Dominic Widdows,Trevor Cohen

This paper describes the use of continuous vector space models for reasoning with a formal knowledge base. The practical significance of these models is that they support fast, approximate but robust inference and hypothesis generation, which is complementary to the slow, exact, but sometimes brittle behavior of more traditional deduction engines such as theorem provers. The paper explains the way

更新日期：2019-11-01
• Log. J. IGPL (IF 0.931) Pub Date : 2010-08-17

Researchers studying complex cognition have grown increasingly interested in mapping symbolic cognitive architectures onto subsymbolic brain models. Such a mapping seems essential for understanding cognition under all but the most extreme viewpoints (namely, that cognition consists exclusively of digitally implemented rules; or instead, involves no rules whatsoever). Making this mapping reduces to

更新日期：2019-11-01
• Log. J. IGPL (IF 0.931) Pub Date : 2019-09-12
Marcelo E Coniglio; Fariñas Del Cerro Luis; Marques Peron Newton

Dugundji proved in 1940 that most parts of standard modal systems cannot be characterized by a single finite deterministic matrix. In the eighties, Ivlev proposed a semantics of four-valued non-deterministic matrices (which he called quasi-matrices), in order to characterize a hierarchy of weak modal logics without the necessitation rule. In a previous paper, we extended some systems of Ivlev’s hierarchy

更新日期：2019-09-12
• Log. J. IGPL (IF 0.931) Pub Date : 2019-07-30
R Alonderis; H Giedra

The cut-free Gentzen-type sequent calculus LLK for the logic of likelihood (LL) is introduced in the paper. It is proved that the calculus is sound and complete for LL. Using the introduced calculus LLK, a decision procedure for LL is presented.

更新日期：2019-07-30
• Log. J. IGPL (IF 0.931) Pub Date : 2018-12-03
M Dolores Muñoz Vicente; María N Moreno García; Vivian F López

Influence zone generating is used in different fields: environmental studies, urban areas establishment, road construction and fire propagation. The influence zone is defined as the geometric space of the points that are at a shorter or similar distance to a given object (point, polyline or polygon). The simulation of the phenomena that are subject to constant patterns can be graphically represented

更新日期：2018-12-03
• Log. J. IGPL (IF 0.931) Pub Date : 2018-10-01
Alexandros Tzanetos; Vassilios Vassiliadis; Georgios Dounias

In most optimization problems, the solution space is very vast. At the same time, the imposed constraints and limitations provide additional burdens for the underline algorithm. Although hybrid intelligent approaches have proven their potential in demanding problem settings, in most cases, they manage to approximate a good-quality solution, meaning that there is room for improvement. Based on preliminary

更新日期：2018-10-01
• Log. J. IGPL (IF 0.931) Pub Date : 2018-10-01

This extended study presents a hybridization of particle swarm optimization (PSO) with complex network construction and analysis. A partial population restart is performed in certain moments of the run of the algorithm based on the information obtained from a complex network analysis. The complex network structure represents the communication in the population. We present experimental results of the

更新日期：2018-10-01
• Log. J. IGPL (IF 0.931) Pub Date : 2018-10-01
Svetlana Simić; Dragana Milutinović; Slobodan Sekulić; Dragan Simić; Svetislav D Simić; Jovanka Đorđević

Demand for healthcare is increasing due to a growing and ageing population. Choosing an adequate schedule for medical staff can be a difficult dilemma for managers. The goal of nurse scheduling is to minimize the cost of the staff while maximizing their preferences and the overall benefits for the unit. This paper is focused on a new hybrid strategy based on detecting the optimal solution in nurse

更新日期：2018-10-01
• Log. J. IGPL (IF 0.931) Pub Date : 2018-09-28
C Peñaranda; J Palanca; V Julian; V Botti

The main goal of this paper is to provide an approach to solve the problem of localization in mobile robots using multi-agent systems. Usually, the robot localization problem is solved in static environments by the addition of the needed sensors in order to help the robot, but this is not useful in dynamic environments where the robot is moving through different rooms or areas. The novelty of this

更新日期：2018-09-28
• Log. J. IGPL (IF 0.931) Pub Date : 2018-09-28

In this research paper a hybridization of two computational intelligence fields, which are evolutionary computation techniques and complex networks (CNs), is presented. During the optimization run of the success-history based adaptive differential evolution (SHADE) a CN is built and its feature, node degree centrality, is extracted for each node. Nodes represent here the individual solutions from the

更新日期：2018-09-28
• Log. J. IGPL (IF 0.931) Pub Date : 2018-09-28
Miguel Cárdenas-Montes

Differential Evolution (DE) is one of the most popular metaheuristics. This is based on its performance and speed, and at the same time its easy description which allows direct modifications aimed at improving its performance. DE is based on the application of the scaled difference of a pair of population members to another population member, all of them distinct. Following this schema diverse variants

更新日期：2018-09-28
• Log. J. IGPL (IF 0.931) Pub Date : 2018-09-27
Ga Ching Lui; Kwok Yip Szeto

The structure of financial market is captured using an analysis of non-linear coupling between various stocks using a novel time warping method known as discrete time warping genetic algorithm (dTWGA). In contrast to previous studies which estimate the correlations between different time series, dTWGA can be used to analyse time series with different lengths and with data sampled unevenly. Moreover

更新日期：2018-09-27
Contents have been reproduced by permission of the publishers.

down
wechat
bug