Search results for " Computer Science"
showing 10 items of 3983 documents
Involvement of acyl coenzyme A oxidase isozymes in biotransformation of methyl ricinoleate into gamma-decalactone by Yarrowia lipolytica.
2000
ABSTRACT We reported previously on the function of acyl coenzyme A (acyl-CoA) oxidase isozymes in the yeast Yarrowia lipolytica by investigating strains disrupted in one or several acyl-CoA oxidase-encoding genes ( POX1 through POX5 ) (H. Wang et al., J. Bacteriol. 181:5140–5148, 1999). Here, these mutants were studied for lactone production. Monodisrupted strains produced similar levels of lactone as the wild-type strain (50 mg/liter) except for Δ pox3 , which produced 220 mg of γ-decalactone per liter after 24 h. The Δ pox2 Δpox3 double-disrupted strain, although slightly affected in growth, produced about 150 mg of lactone per liter, indicating that Aox2p was not essential for the biotra…
A Hardware and Secure Pseudorandom Generator for Constrained Devices
2018
Hardware security for an Internet of Things or cyber physical system drives the need for ubiquitous cryptography to different sensing infrastructures in these fields. In particular, generating strong cryptographic keys on such resource-constrained device depends on a lightweight and cryptographically secure random number generator. In this research work, we have introduced a new hardware chaos-based pseudorandom number generator, which is mainly based on the deletion of an Hamilton cycle within the $N$ -cube (or on the vectorial negation), plus one single permutation. We have rigorously proven the chaotic behavior and cryptographically secure property of the whole proposal: the mid-term eff…
Langage et Apprentissage en Interaction pour des Assistants Numériques Autonomes - Une Approche Développementale
2021
The rapid development of digital assistants (DA) opens the way to new modes of interaction. Some DA allows users to personalise the way they respond to queries, in particular by teaching them new procedures. This work proposes to use machine learning methods to enrich the linguistic and procedural generalisation capabilities of these systems. The challenge is to reconcile rapid learning skills, necessary for a smooth user experience, with a sufficiently large generalisation capacity. Though this is a natural human ability, it remains out-of-reach for artificial systems and this leads us to approach these issues from the perspective of developmental Artificial Intelligence. This work is thus…
Artificial intelligence for image-guided prostate brachytherapy procedures
2020
Radiotherapy procedures aim at exposing cancer cells to ionizing radiation. Permanently implanting radioactive sources near to the cancer cells is a typical technique to cure early-stage prostate cancer. It involves image acquisition of the patient, delineating the target volumes and organs at risk on different medical images, treatment planning, image-guided radioactive seed delivery, and post-implant evaluation. Artificial intelligence-based medical image analysis can benefit radiotherapy procedures. It can help to facilitate and improve the efficiency of the procedures by automatically segmenting target organs and extrapolating clinically relevant information. However, manual delineation…
Computer-aided-diagnosis for ocular abnormalities from a single color fundus photography with deep learning
2023
Any damage to the retina can lead to severe consequences like blindness. This visual impairment is preventable by early detection of ocular abnormalities. Computer-aided diagnosis (CAD) for ocular abnormalities is built by analyzing retinal imaging modalities, for instance, Color Fundus Photography (CFP). The main objectives of this thesis are to build two CAD models, one to detect the microaneurysms (MAs), the first visible symptom of diabetic retinopathy, and the other for multi-label detection of 28 ocular abnormalities consisting of frequent and rare abnormalities from a single CFP by using deep learning-based approaches. Two methods were proposed for MAs detection: ensemble-based and c…
Hop: Histogram of patterns for human action representation
2017
This paper presents a novel method for representing actions in terms of multinomial distributions of frequent sequential patterns of different length. Frequent sequential patterns are series of data descriptors that occur many times in the data. This paper proposes to learn a codebook of frequent sequential patterns by means of an apriori-like algorithm, and to represent an action with a Bag-of-Frequent-Sequential-Patterns approach. Preliminary experiments of the proposed method have been conducted for action classification on skeletal data. The method achieves state-of-the-art accuracy value in cross-subject validation.
A comparison of two different formulations for Arc Routing Problems on Mixed graphs
2006
[EN] Arc routing problems on mixed graphs have been modelled in the literature either using just one variable per edge or associating to each edge two variables, each one representing its traversal in the corresponding direction. In this paper, and using the mixed general routing problem as an example, we compare theoretical and computationally both formulations as well as the lower bounds obtained from them using Linear Programming based methods. Extensive computational experiments, including some big and newly generated random instances, are presented.
New Heuristic Algorithms for the Windy Rural Postman Problem
2005
[EN] In this paper we deal with the windy rural postman problem. This problem generalizes several important arc routing problems and has interesting real-life applications. Here, we present several heuristics whose study has lead to the design of a scatter search algorithm for the windy rural postman problem. Extensive computational experiments over different sets of instances, with sizes up to 988 nodes and 3952 edges, are also presented. (c) 2004 Elsevier Ltd. All rights reserved.
A branch-and-cut algorithm for the Profitable Windy Rural Postman Problem
2016
[EN] In this paper we study the profitable windy rural postman problem. This is an arc routing problem with profits defined on a windy graph in which there is a profit associated with some of the edges of the graph, consisting of finding a route maximizing the difference between the total profit collected and the total cost. This problem generalizes the rural postman problem and other well-known arc routing problems and has real-life applications, mainly in snow removal operations. We propose here a formulation for the problem and study its associated polyhedron. Several families of facet-inducing inequalities are described and used in the design of a branch-and-cut procedure. The algorithm…
Solving the length constrained K-drones rural postman problem
2021
[EN] In this paper we address the Length Constrained K-Drones Rural Postman Problem (LC K-DRPP). This is a continuous optimization problem where a fleet of homogeneous drones have to jointly service (traverse) a set of (curved or straight) lines of a network. Unlike the vehicles in classical arc routing problems, a drone can enter a line through any of its points, service a portion of that line, exit through another of its points, then travel directly to any point on another line, and so on. Moreover, since the range of the drones is restricted, the length of each route is limited by a maximum distance. Some applications for drone arc routing problems include inspection of pipelines, railwa…