Search results for " ANN"

Suitability of a content-based retrieval method in astronomical image databases

1996

Abstract Indexing and retrieval methods based on the image content are required to effectively use information from large repositories of digital images. Usually, the way to search for data and images in astronomical archives is via textual queries expressed in terms of constraints on observation parameters. In this paper we present a method for automatic extraction of images by using shape descriptions based on local symmetry. The proposed indexing methodology has been developed and tested inside JACOB, a prototypal system for content-based video database querying.

Quantum Random Walks – New Method for Designing Quantum Algorithms

2008

Quantum walks are quantum counterparts of random walks. In the last 5 years, they have become one of main methods of designing quantum algorithms. Quantum walk based algorithms include element distinctness, spatial search, quantum speedup of Markov chains, evaluation of Boolean formulas and search on "glued trees" graph. In this talk, I will describe the quantum walk method for designing search algorithms and show several of its applications.

Paolo Labisi. Disegni per la sacrestia e arredi della chiesa della Santissima Annunziata a Ispica

2009

Proposer des révisions intersessions aux étudiants de 1ère année : quelles relations avec la réussite aux examens ?

2013

This paper assesses a revision programme proposed to unsuccessful students between the two examination sessions within the framework of the "Plan réussite en Licence" in first year at the University of Burgundy, both in terms of student participation and links with achievement. The low participation of students is not associated with particular student profiles. An analysis of the students' future shows that student participation in the revision programme led to a lower drop-out risk during the second examination session and greater success, but only as regards the examinations of the 2nd semester. It should also be noted that student participation also has positive effects in the mid-term …

Ant Colony Search algorithm for optimal strategical planning of electrical distribution systems expansion

2005

Strategical planning is one of many research fields in the design of electrical distribution systems. The problem of strategical planning is a multiobjective combinatorial problem and the search space may often be quite large concerning to the options. The aim is to identify a strategy of expansion of a given distribution system in a given timeframe. For this problem, the search space is created beforehand by running a multiobjective optimisation algorithm for the optimal design of distribution networks for different load levels related to different years. The sets of Pareto-optimal solutions obtained for each load level at each year are equivalent in terms of the considered objectives, the…

Tevatron Run II combination of the effective leptonic electroweak mixing angle

2018

The Ministry of Science and Innovation and the Consolider-Ingenio 2010 Program and the European Union community Marie Curie Fellowship Contract No. 302103.

Sequencing, De Novo Assembly and Annotation of the Colorado Potato Beetle, Leptinotarsa decemlineata, Transcriptome

2012

Background. The Colorado potato beetle (Leptinotarsa decemlineata) is a major pest and a serious threat to potato cultivation throughout the northern hemisphere. Despite its high importance for invasion biology, phenology and pest management, little is known about L. decemlineata from a genomic perspective. We subjected European L. decemlineata adult and larval transcriptome samples to 454-FLX massively-parallel DNA sequencing to characterize a basal set of genes from this species. We created a combined assembly of the adult and larval datasets including the publicly available midgut larval Roche 454 reads and provided basic annotation. We were particularly interested in diapause-specific g…

Design of novel artemisinin-like derivatives with cytotoxic and anti-angiogenic properties

2010

Abstract Artemisinins are plant products with a wide range of medicinal applications. Most prominently, artesunate is a well tolerated and effective drug for treating malaria, but is also active against several protozoal and schistosomal infections, and additionally exhibits anti-angiogenic, anti-tumorigenic and anti-viral properties. The array of activities of the artemisinins, and the recent emergence of malaria resistance to artesunate, prompted us to synthesize and evaluate several novel artemisinin-like derivatives. Sixteen distinct derivatives were therefore synthesized and the in vitro cytotoxic effects of each were tested with different cell lines. The in vivo anti-angiogenic proper…

Abstract 5109: Beyond malaria: Second career of artesunate as cancer drug

2017

Abstract More than a decade ago, we initiated a research program on the molecular pharmacology of phytochemicals derived from Chinese medicinal herbs. Bioactive plant extracts have been fractionated by chromatographic techniques. We isolated bioactive compounds and elucidated their chemical structures by nuclear magnetic resonance and mass spectrometry. A promising compounds was artemisinin from Artemisia annua L. and its semisynthetic compound artesunate. Artemisinin and artesunate are anti-malarial drugs. Our data indicated profound activity against cancer cells, but also against various viruses, Schistosoma, Trypanosoma, and even plant crown gall tumors. To elucidate the molecular mode o…

A Branch-and-Cut method for the Capacitated Location-Routing Problem

2011

International audience; Recent researches in the design of logistic networks have shown that the overall distribution cost may be excessive if routing decisions are ignored when locating depots. The Location-Routing Problem (LRP) overcomes this drawback by simultaneously tackling location and routing decisions. The aim of this paper is to propose an exact approach based on a Branch-and-Cut algorithm for solving the LRP with capacity constraints on depots and vehicles. The proposed method is based on a zero-one linear model strengthened by new families of valid inequalities. The computational evaluation on three sets of instances (34 instances in total), with 5–10 potential depots and 20–88 …