Search results for "General Computer Science"

A pedagogical flight simulator for longitudinal airplane flight

2009

This article presents a bi-dimensional model of flight and describes the implementation of a flight simulator able to describe the different phases of longitudinal flight of a real airplane. After identifying the relevant physical variables, the equations of motion are written and solved using a numerical integration method. Using computer simulations, flight paths and time evolution of the kinematics variables are analyzed for a complete flight of a light commercial airplane. The simulations take into account and reproduce the basic actions of a pilot to control the flight. The main maneuvers involved in pilotage are also predicted and explained in terms of model parameter variations induc…

Biotechnology Applications of Plant Callus Cultures

2019

In ethnopharmacology, and especially in traditional Chinese medicine, medicinal plants have been used for thousands of years. Similarly, agricultural plants have been used throughout the history of mankind. The recent development of the genetic engineering of plants to produce plants with desirable features adds a new and growing dimension to humanity’s usage of plants. The biotechnology of plants has come of age and a plethora of bioengineering applications in this context have been delineated during the past few decades. Callus cultures and suspension cell cultures offer a wide range of usages in pharmacology and pharmacy (including Chinese medicine), as well as in agriculture and horticu…

Handling the epistemic uncertainty in the selective maintenance problem

2020

Abstract Nowadays, both continuous and discontinuous operating systems require higher and higher reliability levels in order to avoid the occurrence of dangerous or even disastrous consequences. Accordingly, the definition of appropriate maintenance policies and the identification of components to be maintained during the planned system’s downtimes are fundamental to ensure the reliability maximization. Therefore, the present paper proposes a mathematical programming formulation of the selective maintenance problem with the aim to maximize the system’s reliability under an uncertain environment. Specifically, the aleatory model related to the components’ failure process is well known, where…

2020

Vector-borne diseases such as malaria, dengue fever, West Nile virus, and so forth are some of the most prominent threats to human health. They are transmitted to the human population by infected insects or by direct transmission between humans. The epidemic process relies on suitable environmental and climatic conditions. Indeed, climatic factors affect the development of pathogens in vectors as well as the population dynamics of the vectors impacting significantly the incidence of disease in the human population. While the influence of the climatic conditions on Vector-borne diseases is well-documented, there is a strong need to design more realistic epidemiological models incorporating e…

A Push Forward Construction and the Comprehensive Factorization for Internal Crossed Modules

2014

In a semi-abelian category, we give a categorical construction of the push forward of an internal pre-crossed module, generalizing the pushout of a short exact sequence in abelian categories. The main properties of the push forward are discussed. A simplified version is given for action accessible categories, providing examples in the categories of rings and Lie algebras. We show that push forwards can be used to obtain the crossed module version of the comprehensive factorization for internal groupoids.

Scheduling on Two Types of Resources: a Survey

2020

International audience; We study the problem of executing an application represented by a precedence task graph on a parallel machine composed of standard computing cores and accelerators. Contrary to most existing approaches, we distinguish the allocation and the scheduling phases and we mainly focus on the allocation part of the problem: choose the most appropriate type of computing unit for each task. We address both off-line and on-line settings and design generic scheduling approaches. In the first case, we establish strong lower bounds on the worst-case performance of a known approach based on Linear Programming for solving the allocation problem. Then, we refine the scheduling phase …

Extending the Tsetlin Machine With Integer-Weighted Clauses for Increased Interpretability

2020

Despite significant effort, building models that are both interpretable and accurate is an unresolved challenge for many pattern recognition problems. In general, rule-based and linear models lack accuracy, while deep learning interpretability is based on rough approximations of the underlying inference. Using a linear combination of conjunctive clauses in propositional logic, Tsetlin Machines (TMs) have shown competitive performance on diverse benchmarks. However, to do so, many clauses are needed, which impacts interpretability. Here, we address the accuracy-interpretability challenge in machine learning by equipping the TM clauses with integer weights. The resulting Integer Weighted TM (…

Adaptive learning of compressible strings

2020

Suppose an oracle knows a string $S$ that is unknown to us and that we want to determine. The oracle can answer queries of the form "Is $s$ a substring of $S$?". In 1995, Skiena and Sundaram showed that, in the worst case, any algorithm needs to ask the oracle $\sigma n/4 -O(n)$ queries in order to be able to reconstruct the hidden string, where $\sigma$ is the size of the alphabet of $S$ and $n$ its length, and gave an algorithm that spends $(\sigma-1)n+O(\sigma \sqrt{n})$ queries to reconstruct $S$. The main contribution of our paper is to improve the above upper-bound in the context where the string is compressible. We first present a universal algorithm that, given a (computable) compre…

Popularity of patterns over $d$-equivalence classes of words and permutations

2020

Abstract Two same length words are d-equivalent if they have same descent set and same underlying alphabet. In particular, two same length permutations are d-equivalent if they have same descent set. The popularity of a pattern in a set of words is the overall number of copies of the pattern within the words of the set. We show the far-from-trivial fact that two patterns are d-equivalent if and only if they are equipopular over any d-equivalence class, and this equipopularity does not follow obviously from a trivial equidistribution.

Topological Logics with Connectedness over Euclidean Spaces

2013

We consider the quantifier-free languages, Bc and Bc °, obtained by augmenting the signature of Boolean algebras with a unary predicate representing, respectively, the property of being connected, and the property of having a connected interior. These languages are interpreted over the regular closed sets of R n ( n ≥ 2) and, additionally, over the regular closed semilinear sets of R n . The resulting logics are examples of formalisms that have recently been proposed in the Artificial Intelligence literature under the rubric Qualitative Spatial Reasoning. We prove that the satisfiability problem for Bc is undecidable over the regular closed semilinear sets in all dimensions greater than 1,…