Log. J. IGPLPub Date : 2021-02-04DOI: 10.1093/JIGPAL/JZAB007
Ovidiu Cosma, P. Pop, C. Sabo
{"title":"Solving a Two-stage Supply Chain Network Design Problem with Fixed Costs by a Hybrid Genetic Algorithm","authors":"Ovidiu Cosma, P. Pop, C. Sabo","doi":"10.1093/JIGPAL/JZAB007","DOIUrl":"https://doi.org/10.1093/JIGPAL/JZAB007","url":null,"abstract":"In this paper we investigate a particular two-stage supply chain network design problem with fixed costs. In order to solve this complex optimization problem, we propose an efficient hybrid algorithm, which was obtained by incorporating a linear programming optimization problem within the framework of a genetic algorithm. In addition, we integrated within our proposed algorithm a powerful local search procedure able to perform a fine tuning of the global search. We evaluate our proposed solution approach on a set of large size instances. The achieved computational results prove the efficiency of our hybrid genetic algorithm in providing high-quality solutions within reasonable running-times and its superiority against other existing methods from the literature.","PeriodicalId":304915,"journal":{"name":"Log. J. IGPL","volume":"42 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2021-02-04","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"131750059","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Log. J. IGPLPub Date : 2021-02-01DOI: 10.1093/JIGPAL/JZAB001
H. J. S. Martín, Valeria A. Sígal
{"title":"Dualities for Bounded Prelinear Hilbert Algebras","authors":"H. J. S. Martín, Valeria A. Sígal","doi":"10.1093/JIGPAL/JZAB001","DOIUrl":"https://doi.org/10.1093/JIGPAL/JZAB001","url":null,"abstract":"\u0000 This paper deals about dualities for bounded prelinear Hilbert algebras. In particular, we give an Esakia-style duality between the algebraic category of bounded prelinear Hilbert algebras and a category of H-spaces whose morphisms are certain continuous p-morphisms.","PeriodicalId":304915,"journal":{"name":"Log. J. IGPL","volume":"50 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2021-02-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"117050632","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Log. J. IGPLPub Date : 2021-01-06DOI: 10.1093/JIGPAL/JZAB020
M. Coniglio, L. F. D. Cerro, N. Peron
{"title":"Modal Logic With Non-Deterministic Semantics: Part II - Quantified Case","authors":"M. Coniglio, L. F. D. Cerro, N. Peron","doi":"10.1093/JIGPAL/JZAB020","DOIUrl":"https://doi.org/10.1093/JIGPAL/JZAB020","url":null,"abstract":"\u0000 In the first part of this paper we analyzed finite non-deterministic matrix semantics for propositional non-normal modal logics as an alternative to the standard Kripke possible world semantics. This kind of modal system characterized by finite non-deterministic matrices was originally proposed by Ju. Ivlev in the 70s. The aim of this second paper is to introduce a formal non-deterministic semantical framework for the quantified versions of some Ivlev-like non-normal modal logics. It will be shown that several well-known controversial issues of quantified modal logics, relative to the identity predicate, Barcan’s formulas and de re and de dicto modalities, can be tackled from a new angle within the present framework.","PeriodicalId":304915,"journal":{"name":"Log. J. IGPL","volume":"62 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2021-01-06","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"127263897","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Log. J. IGPLPub Date : 2020-12-11DOI: 10.1093/JIGPAL/JZAA005
I. Pallares-Vega
{"title":"Why the Axiom of Choice Sometimes Fails","authors":"I. Pallares-Vega","doi":"10.1093/JIGPAL/JZAA005","DOIUrl":"https://doi.org/10.1093/JIGPAL/JZAA005","url":null,"abstract":"\u0000 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.","PeriodicalId":304915,"journal":{"name":"Log. J. IGPL","volume":"74 6 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2020-12-11","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"125995922","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Log. J. IGPLPub Date : 2020-12-11DOI: 10.1093/jigpal/jzaa064
M. Fáñez, J. Villar, E. D. L. Cal, Víctor M. González, J. Sedano
{"title":"Improving wearable-based fall detection with unsupervised learning","authors":"M. Fáñez, J. Villar, E. D. L. Cal, Víctor M. González, J. Sedano","doi":"10.1093/jigpal/jzaa064","DOIUrl":"https://doi.org/10.1093/jigpal/jzaa064","url":null,"abstract":"\u0000 Fall detection (FD) is a challenging task that has received the attention of the research community in the recent years. This study focuses on FD using data gathered from wearable devices with tri-axial accelerometers (3DACC), developing a solution centered in elderly people living autonomously. This research includes three different ways to improve a FD method: (i) an analysis of the event detection stage, comparing several alternatives, (ii) an evaluation of features to extract for each detected event and (iii) an appraisal of up to 6 different clustering scenarios to split the samples in subsets that might enhance the classification. For each clustering scenario, a specific classification stage is defined. The experimentation includes publicly available simulated fall data sets. Results show the guidelines for defining a more robust and efficient FD method for on-wrist 3DACC wearable devices.","PeriodicalId":304915,"journal":{"name":"Log. J. IGPL","volume":"688 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2020-12-11","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"132056898","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Log. J. IGPLPub Date : 2020-11-20DOI: 10.1093/jigpal/jzaa018
{"title":"Special issue: 17th LATIN AMERICAN SYMPOSIUM ON MATHEMATICAL LOGIC (LASML 2017/SLALM 2017 in Spanish)","authors":"","doi":"10.1093/jigpal/jzaa018","DOIUrl":"https://doi.org/10.1093/jigpal/jzaa018","url":null,"abstract":"","PeriodicalId":304915,"journal":{"name":"Log. J. IGPL","volume":"153 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2020-11-20","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"132032339","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Log. J. IGPLPub Date : 2020-11-11DOI: 10.1093/jigpal/jzaa065
Alberto Allegue Leira, Esteban Jove, J. M. González-Cava, J. Casteleiro-Roca, Héctor Quintián-Pardo, Francisco Zayas-Gato, Santiago Torres Álvarez, S. Simic, J. A. M. Pérez, J. Calvo-Rolle
{"title":"One-Class-Based Intelligent Classifier for Detecting Anomalous Situations During the Anesthetic Process","authors":"Alberto Allegue Leira, Esteban Jove, J. M. González-Cava, J. Casteleiro-Roca, Héctor Quintián-Pardo, Francisco Zayas-Gato, Santiago Torres Álvarez, S. Simic, J. A. M. Pérez, J. Calvo-Rolle","doi":"10.1093/jigpal/jzaa065","DOIUrl":"https://doi.org/10.1093/jigpal/jzaa065","url":null,"abstract":"\u0000 Closed-loop administration of propofol for the control of hypnosis in anesthesia has evidenced an outperformance when comparing it with manual administration in terms of drug consumption and post-operative recovery of patients. Unlike other systems, the success of this strategy lies on the availability of a feedback variable capable of quantifying the current hypnotic state of the patient. However, the appearance of anomalies during the anesthetic process may result in inaccurate actions of the automatic controller. These anomalies may come from the monitors, the syringe pumps, the actions of the surgeon or even from alterations in patients. This could produce adverse side effects that can affect the patient postoperative and reduce the safety of the patient in the operating room. Then, the use of anomaly detection techniques plays a significant role to avoid this undesirable situations. This work assesses different one-class intelligent techniques to detect anomalies in patients undergoing general anesthesia. Due to the difficulty of obtaining real data from anomaly situations, artificial outliers are generated to check the performance of each classifier. The final model presents successful performance.","PeriodicalId":304915,"journal":{"name":"Log. J. IGPL","volume":"34 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2020-11-11","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"133368574","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Log. J. IGPLPub Date : 2020-11-11DOI: 10.1093/jigpal/jzaa059
Belén Vega-Márquez, Cristina Rubio-Escudero, Isabel A. Nepomuceno-Chamorro
{"title":"Generation of Synthetic Data with Conditional Generative Adversarial Networks","authors":"Belén Vega-Márquez, Cristina Rubio-Escudero, Isabel A. Nepomuceno-Chamorro","doi":"10.1093/jigpal/jzaa059","DOIUrl":"https://doi.org/10.1093/jigpal/jzaa059","url":null,"abstract":"\u0000 The generation of synthetic data is becoming a fundamental task in the daily life of any organization due to the new protection data laws that are emerging. Because of the rise in the use of Artificial Intelligence, one of the most recent proposals to address this problem is the use of Generative Adversarial Networks (GANs). These types of networks have demonstrated a great capacity to create synthetic data with very good performance. The goal of synthetic data generation is to create data that will perform similarly to the original dataset for many analysis tasks, such as classification. The problem of GANs is that in a classification problem, GANs do not take class labels into account when generating new data, it is treated as any other attribute. This research work has focused on the creation of new synthetic data from datasets with different characteristics with a Conditional Generative Adversarial Network (CGAN). CGANs are an extension of GANs where the class label is taken into account when the new data is generated. The performance of our results has been measured in two different ways: firstly, by comparing the results obtained with classification algorithms, both in the original datasets and in the data generated; secondly, by checking that the correlation between the original data and those generated is minimal.","PeriodicalId":304915,"journal":{"name":"Log. J. IGPL","volume":"17 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2020-11-11","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"129232343","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Log. J. IGPLPub Date : 2020-11-06DOI: 10.1093/jigpal/jzaa061
A. Vescan, Camelia-M. Pintea, P. Pop
{"title":"Test Case Prioritization - ANT Algorithm With Faults Severity","authors":"A. Vescan, Camelia-M. Pintea, P. Pop","doi":"10.1093/jigpal/jzaa061","DOIUrl":"https://doi.org/10.1093/jigpal/jzaa061","url":null,"abstract":"Regression testing is applied whenever a code changes, ensuring that the modifications fixed the fault and no other faults are introduced. Due to a large number of test cases to be run, test case prioritization is one of the strategies that allows to run the test cases with the highest fault rate first. The aim of the paper is to present an optimized test case prioritization method inspired by ant colony optimization, test case prioritization–ANT. The criteria used by the optimization algorithm are the number of faults not covered yet by the selected test cases and the sum of severity of the faults. The cost, i.e. time execution, for test cases is considered in the computation of the pheromone deposited on the graph’s edges. The average percentage of fault detected metric, as best selection criterion, is used to uncover maximum faults with the highest severity, and reducing the regression testing time. Several experiments are considered, detailed and discussed, comparing various algorithm parameter’s alternatives. A benchmark project is also used to validate the proposed approach. The obtained results are encouraging, being a cornerstone for new perspectives to be considered.","PeriodicalId":304915,"journal":{"name":"Log. J. IGPL","volume":"26 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2020-11-06","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"131146610","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Log. J. IGPLPub Date : 2020-11-06DOI: 10.1093/jigpal/jzaa060
C. Amor, J. M. Pérez, P. Schlatter, R. Vinuesa, S. L. Clainche
{"title":"Modeling the Turbulent Wake Behind a Wall-Mounted Square Cylinder","authors":"C. Amor, J. M. Pérez, P. Schlatter, R. Vinuesa, S. L. Clainche","doi":"10.1093/jigpal/jzaa060","DOIUrl":"https://doi.org/10.1093/jigpal/jzaa060","url":null,"abstract":"\u0000 This article introduces some soft computing methods generally used for data analysis and flow pattern detection in fluid dynamics. These techniques decompose the original flow field as an expansion of modes, which can be either orthogonal in time (variants of dynamic mode decomposition), or in space (variants of proper orthogonal decomposition) or in time and space (spectral proper orthogonal decomposition), or they can simply be selected using some sophisticated statistical techniques (empirical mode decomposition). The performance of these methods is tested in the turbulent wake of a wall-mounted square cylinder. This highly complex flow is suitable to show the ability of the aforementioned methods to reduce the degrees of freedom of the original data by only retaining the large scales in the flow. The main result is a reduced-order model of the original flow case, based on a low number of modes. A deep discussion is carried out about how to choose the most computationally efficient method to obtain suitable reduced-order models of the flow. The techniques introduced in this article are data-driven methods that could be applied to model any type of non-linear dynamical system, including numerical and experimental databases.","PeriodicalId":304915,"journal":{"name":"Log. J. IGPL","volume":"27 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2020-11-06","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"127870777","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}