scholarly journals NACRE - A Nogood And Clause Reasoning Engine

10.29007/dxnb ◽  
2020 ◽  
Author(s):  
Gael Glorian ◽  
Jean-Marie Lagniez ◽  
Christophe Lecoutre
Keyword(s):  
Learning Strategies ◽  
Data Structures ◽  
State Of The Art ◽  
Search Algorithms ◽  
Black Box ◽  
General Description ◽  
Modular Architecture ◽  
Search Methods ◽  
Constraint Solver ◽  
Reasoning Engine

NACRE, for Nogood And Clause Reasoning Engine, is a constraint solver written in C++. It is based on a modular architecture designed to work with generic constraints while implementing several state-of-the-art search methods and heuristics. Interestingly, its data structures have been carefully designed to play around nogoods and clauses, making it suit- able for implementing learning strategies. NACRE was submitted to the CSP MiniTrack of the 2018 and 2019 XCSP3 [8] competitions where it took the first place. This paper gives a general description of NACRE as a framework. We present its kernel, the available search algorithms, and the default settings (notably, used for XCSP3 competitions), which makes NACRE efficient in practice when used as a black-box solver.

scholarly journals A Comparison of Global Search Algorithms for Continuous Black Box Optimization

2012 ◽  
Vol 20 (4) ◽  
pp. 509-541 ◽  
Author(s):  
Petr Pošík ◽  
Waltraud Huyer ◽  
László Pál
Keyword(s):  
State Of The Art ◽  
Search Space ◽  
Search Algorithms ◽  
Black Box ◽  
Search Method ◽  
The Other ◽  
Systematic Sampling ◽  
Careful Selection ◽  
Local Optimizer ◽  
Selection Of

Four methods for global numerical black box optimization with origins in the mathematical programming community are described and experimentally compared with the state of the art evolutionary method, BIPOP-CMA-ES. The methods chosen for the comparison exhibit various features that are potentially interesting for the evolutionary computation community: systematic sampling of the search space (DIRECT, MCS) possibly combined with a local search method (MCS), or a multi-start approach (NEWUOA, GLOBAL) possibly equipped with a careful selection of points to run a local optimizer from (GLOBAL). The recently proposed “comparing continuous optimizers” (COCO) methodology was adopted as the basis for the comparison. Based on the results, we draw suggestions about which algorithm should be used depending on the available budget of function evaluations, and we propose several possibilities for hybridizing evolutionary algorithms (EAs) with features of the other compared algorithms.

Review of the Applications of Deep Learning in Bioinformatics

2021 ◽  
Vol 15 (8) ◽  
pp. 898-911
Author(s):  
Yongqing Zhang ◽  
Jianrong Yan ◽  
Siyu Chen ◽  
Meiqin Gong ◽  
Dongrui Gao ◽  
...  
Keyword(s):  
Deep Learning ◽  
Drug Discovery ◽  
Biomedical Imaging ◽  
State Of The Art ◽  
Black Box ◽  
Medical Data ◽  
Biological Data ◽  
High Dimensional ◽  
Biological Research ◽  
Process Data

Rapid advances in biological research over recent years have significantly enriched biological and medical data resources. Deep learning-based techniques have been successfully utilized to process data in this field, and they have exhibited state-of-the-art performances even on high-dimensional, nonstructural, and black-box biological data. The aim of the current study is to provide an overview of the deep learning-based techniques used in biology and medicine and their state-of-the-art applications. In particular, we introduce the fundamentals of deep learning and then review the success of applying such methods to bioinformatics, biomedical imaging, biomedicine, and drug discovery. We also discuss the challenges and limitations of this field, and outline possible directions for further research.

scholarly journals Efficient Rank-Based Diffusion Process with Assured Convergence

2021 ◽  
Vol 7 (3) ◽  
pp. 49
Author(s):  
Daniel Carlos Guimarães Pedronette ◽  
Lucas Pascotti Valem ◽  
Longin Jan Latecki
Keyword(s):  
Diffusion Process ◽  
Learning Strategies ◽  
State Of The Art ◽  
Representation Learning ◽  
Theoretical Background ◽  
High Dimensional ◽  
Visual Features ◽  
Learning Approaches ◽  
Previous Decade ◽  
Asymptotic Complexity

Visual features and representation learning strategies experienced huge advances in the previous decade, mainly supported by deep learning approaches. However, retrieval tasks are still performed mainly based on traditional pairwise dissimilarity measures, while the learned representations lie on high dimensional manifolds. With the aim of going beyond pairwise analysis, post-processing methods have been proposed to replace pairwise measures by globally defined measures, capable of analyzing collections in terms of the underlying data manifold. The most representative approaches are diffusion and ranked-based methods. While the diffusion approaches can be computationally expensive, the rank-based methods lack theoretical background. In this paper, we propose an efficient Rank-based Diffusion Process which combines both approaches and avoids the drawbacks of each one. The obtained method is capable of efficiently approximating a diffusion process by exploiting rank-based information, while assuring its convergence. The algorithm exhibits very low asymptotic complexity and can be computed regionally, being suitable to outside of dataset queries. An experimental evaluation conducted for image retrieval and person re-ID tasks on diverse datasets demonstrates the effectiveness of the proposed approach with results comparable to the state-of-the-art.

scholarly journals The electronic Space Weather upper atmosphere (eSWua) project at INGV: advancements and state of the art

2008 ◽  
Vol 26 (2) ◽  
pp. 345-351 ◽  
Author(s):  
V. Romano ◽  
S. Pau ◽  
M. Pezzopane ◽  
E. Zuccheretti ◽  
B. Zolesi ◽  
...  
Keyword(s):  
Real Time ◽  
Space Weather ◽  
State Of The Art ◽  
Upper Atmosphere ◽  
Software System ◽  
General Description ◽  
Data Archiving ◽  
Web Tools ◽  
Technical Features ◽  
Technological Community

Abstract. The eSWua project is based on measurements performed by all the instruments installed by the upper atmosphere physics group of the Istituto Nazionale di Geofisica e Vulcanologia, Italy and on all the related studies. The aim is the realization of a hardware-software system to standardize historical and real-time observations for different instruments. An interactive Web site, supported by a well organized database, can be a powerful tool for the scientific and technological community in the field of telecommunications and space weather. The most common and useful database type for our purposes is the relational one, in which data are organized in tables for petabytes data archiving and the complete flexibility in data retrieving. The project started in June 2005 and will last till August 2007. In the first phase the major effort has been focused on the design of hardware and database architecture. The first two databases related to the DPS4 digisonde and GISTM measurements are complete concerning populating, tests and output procedures. Details on the structure and Web tools concerning these two databases are presented, as well as the general description of the project and technical features.

scholarly journals Remote Gait Type Classification System Using Markerless 2D Video

Diagnostics ◽  
2021 ◽  
Vol 11 (10) ◽  
pp. 1824
Author(s):  
Pedro Albuquerque ◽  
João Pedro Machado ◽  
Tanmay Tulsidas Verlekar ◽  
Paulo Lobato Correia ◽  
Luís Ducla Soares
Keyword(s):  
Gait Analysis ◽  
Learning Strategies ◽  
Web Application ◽  
State Of The Art ◽  
The State ◽  
Remote Healthcare ◽  
Visual Artifacts ◽  
Analysis System ◽  
Private Network ◽  
User Friendly

Several pathologies can alter the way people walk, i.e., their gait. Gait analysis can be used to detect such alterations and, therefore, help diagnose certain pathologies or assess people’s health and recovery. Simple vision-based systems have a considerable potential in this area, as they allow the capture of gait in unconstrained environments, such as at home or in a clinic, while the required computations can be done remotely. State-of-the-art vision-based systems for gait analysis use deep learning strategies, thus requiring a large amount of data for training. However, to the best of our knowledge, the largest publicly available pathological gait dataset contains only 10 subjects, simulating five types of gait. This paper presents a new dataset, GAIT-IT, captured from 21 subjects simulating five types of gait, at two severity levels. The dataset is recorded in a professional studio, making the sequences free of background camouflage, variations in illumination and other visual artifacts. The dataset is used to train a novel automatic gait analysis system. Compared to the state-of-the-art, the proposed system achieves a drastic reduction in the number of trainable parameters, memory requirements and execution times, while the classification accuracy is on par with the state-of-the-art. Recognizing the importance of remote healthcare, the proposed automatic gait analysis system is integrated with a prototype web application. This prototype is presently hosted in a private network, and after further tests and development it will allow people to upload a video of them walking and execute a web service that classifies their gait. The web application has a user-friendly interface usable by healthcare professionals or by laypersons. The application also makes an association between the identified type of gait and potential gait pathologies that exhibit the identified characteristics.

scholarly journals The Audio Auditor: User-Level Membership Inference in Internet of Things Voice Services

2021 ◽  
Vol 2021 (1) ◽  
pp. 209-228
Author(s):  
Yuantian Miao ◽  
Minhui Xue ◽  
Chao Chen ◽  
Lei Pan ◽  
Jun Zhang ◽  
...  
Keyword(s):  
Internet Of Things ◽  
State Of The Art ◽  
Rapid Development ◽  
Black Box ◽  
Problem Space ◽  
Specific Data ◽  
Learning Techniques ◽  
Audio Data ◽  
Iot Devices ◽  
Asr System

AbstractWith the rapid development of deep learning techniques, the popularity of voice services implemented on various Internet of Things (IoT) devices is ever increasing. In this paper, we examine user-level membership inference in the problem space of voice services, by designing an audio auditor to verify whether a specific user had unwillingly contributed audio used to train an automatic speech recognition (ASR) model under strict black-box access. With user representation of the input audio data and their corresponding translated text, our trained auditor is effective in user-level audit. We also observe that the auditor trained on specific data can be generalized well regardless of the ASR model architecture. We validate the auditor on ASR models trained with LSTM, RNNs, and GRU algorithms on two state-of-the-art pipelines, the hybrid ASR system and the end-to-end ASR system. Finally, we conduct a real-world trial of our auditor on iPhone Siri, achieving an overall accuracy exceeding 80%. We hope the methodology developed in this paper and findings can inform privacy advocates to overhaul IoT privacy.

scholarly journals Embarrassingly Parallel Search in Constraint Programming

2016 ◽  
Vol 57 ◽  
pp. 421-464 ◽  
Author(s):  
Arnaud Malapert ◽  
Jean-Charles Régin ◽  
Mohamed Rezgui
Keyword(s):  
Cloud Computing ◽  
Efficient Method ◽  
Data Centers ◽  
Optimization Problems ◽  
State Of The Art ◽  
Parallel Search ◽  
Simple Method ◽  
Constraint Solver ◽  
Average Performance ◽  
Depth Analysis

We introduce an Embarrassingly Parallel Search (EPS) method for solving constraint problems in parallel, and we show that this method matches or even outperforms state-of-the-art algorithms on a number of problems using various computing infrastructures. EPS is a simple method in which a master decomposes the problem into many disjoint subproblems which are then solved independently by workers. Our approach has three advantages: it is an efficient method; it involves almost no communication or synchronization between workers; and its implementation is made easy because the master and the workers rely on an underlying constraint solver, but does not require to modify it. This paper describes the method, and its applications to various constraint problems (satisfaction, enumeration, optimization). We show that our method can be adapted to different underlying solvers (Gecode, Choco2, OR-tools) on different computing infrastructures (multi-core, data centers, cloud computing). The experiments cover unsatisfiable, enumeration and optimization problems, but do not cover first solution search because it makes the results hard to analyze. The same variability can be observed for optimization problems, but at a lesser extent because the optimality proof is required. EPS offers good average performance, and matches or outperforms other available parallel implementations of Gecode as well as some solvers portfolios. Moreover, we perform an in-depth analysis of the various factors that make this approach efficient as well as the anomalies that can occur. Last, we show that the decomposition is a key component for efficiency and load balancing.

Sign in / Sign up

Export Citation Format

Share Document