Search results for " Computer Science"
showing 10 items of 3983 documents
Automated Diagnostics of Retinal Pathologies Using OCT Volumes
2020
The leading cause of blindness in the population could mostly be the degeneration of the retina caused by the diabetic-related problems and the aging issue. Diabetic retinopathy (DR) and diabetic macular edema (DME) are the main direct causes of vision problems in the labor age citizens of most advanced countries. The elevated number of diabetic people globally indicates that DME and DR will remain to be the principal factor to partial or total vision loss, which affects the lives quality of patients for many years to come and threaten their lives. Therefore, early detection followed by fast treatment procedures of persons with diabetic-related diseases is significant in preventing optical …
Automatic cell nuclei counting: a protocol to acquire images and to compare results between color and multispectral images
2013
International audience; High-throughput screening in histology and analysis need a necessary automatic cell or nucleus counting. Current methods and systems based on grayscale or color images give results with counting errors. We suggest to use multispectral imaging (with more than three bands) rather than color one for nucleus counting. A traditional acquisition chains uses a source of white light and a CCD camera in addition to the optical microscope. To pass to a multispectral acquisition, we use a Programmable Light Source (PLS) in the place of the white light source. This PLS is capable of generating different wavelengths in the visible spectrum. So, one color image and four multispect…
Contribution to the cooperative management of conflictual spaces between autonomous vehicles
2017
The continuous increase in the number of vehicles has constantly led to innovation to improve the regulation of road traffic. Today, vehicle automation and inter-vehicular communication make possible a new approach: the autonomous and cooperative intersection (ACI) in which autonomous vehicles communicate to negotiate their right of way at the intersection. Theoretically more effective, safer and more economical than traditional approaches, its implementation and deployment constitute a scientific and technological challenge. In this paper, we propose several contributions supporting this development: a longitudinal and lateral vehicle control strategy designed to work with information disc…
Learning-Graph-Based Quantum Algorithm for k-distinctness
2012
We present a quantum algorithm solving the $k$-distinctness problem in $O(n^{1-2^{k-2}/(2^k-1)})$ queries with a bounded error. This improves the previous $O(n^{k/(k+1)})$-query algorithm by Ambainis. The construction uses a modified learning graph approach. Compared to the recent paper by Belovs and Lee arXiv:1108.3022, the algorithm doesn't require any prior information on the input, and the complexity analysis is much simpler. Additionally, we introduce an $O(\sqrt{n}\alpha^{1/6})$ algorithm for the graph collision problem where $\alpha$ is the independence number of the graph.
RDF2NμSMV: Mapping Semantic Graphs to NμSMV Model Checker
2011
International audience; The most frequently used language to represent the semantic graphs is the RDF (W3C standard for meta-modeling). The construction of semantic graphs is a source of numerous errors of interpretation. The processing of large semantic graphs is a limit to the use of semantics in current information systems. The work presented in this paper is part of a new research at the border between two areas: the Semantic Web and the model checking. For this, we developed a tool, RDF2NμSMV, which converts RDF graphs into NμSMV language. This conversion aims checking the semantic graphs with the model checker NμSMV in order to verify the consistency of the data. To illustrate our pro…
Probabilities of conditionals and previsions of iterated conditionals
2019
Abstract We analyze selected iterated conditionals in the framework of conditional random quantities. We point out that it is instructive to examine Lewis's triviality result, which shows the conditions a conditional must satisfy for its probability to be the conditional probability. In our approach, however, we avoid triviality because the import-export principle is invalid. We then analyze an example of reasoning under partial knowledge where, given a conditional if A then C as information, the probability of A should intuitively increase. We explain this intuition by making some implicit background information explicit. We consider several (generalized) iterated conditionals, which allow…
Taxonomic categorisation of motivic patterns
2009
The issue of pattern description in computational models for motivic analysis is closely related to the cognitive debate on categorisation, in which are traditionally opposed “well-defined” and “ill-defined” categorisations. The ill-defined conceptualisation has been considered as a suitable framework for the formalisation of musical categorisation as it takes into account motivic variations. It seems that computational models rely rather on well-defined categorisation, due to its better controllability. The computational model we previously presented (Lartillot & Toiviainen, 2007) strikes a balance by developing a new flexible framework allowing the taking into account of unrestricted…
Durability assessment of basalt fiber polymer as reinforcement to expanded clay concrete in harsh environment
2021
Basalt fiber-reinforced polymer composites are receiving considerable attention as they represent a low-cost green source of raw materials. In most cases, fiber-reinforced polymer composites face harsh environments, such as chloride ions in coastal marine environments or cold regions with salt deicing. The resistance of fiber-reinforced polymers subjected to the above environments is critical for the safe design and application of such composites. This research aims to develop a framework to investigate the durability properties of the lightweight expanded clay basalt fiber polymer reinforced concrete exposed to the NaCl environment. The specified quantity of concrete structural elements wa…
Solving two‐armed Bernoulli bandit problems using a Bayesian learning automaton
2010
PurposeThe two‐armed Bernoulli bandit (TABB) problem is a classical optimization problem where an agent sequentially pulls one of two arms attached to a gambling machine, with each pull resulting either in a reward or a penalty. The reward probabilities of each arm are unknown, and thus one must balance between exploiting existing knowledge about the arms, and obtaining new information. The purpose of this paper is to report research into a completely new family of solution schemes for the TABB problem: the Bayesian learning automaton (BLA) family.Design/methodology/approachAlthough computationally intractable in many cases, Bayesian methods provide a standard for optimal decision making. B…