Search results for " Computer Science"
showing 10 items of 3983 documents
Detection of H. pylori induced gastric inflammation by diffuse reflectance analysis
2018
International audience; Spectral acquisitions contain rich information and thus, are promising modalities for early detection of gastric diseases. In this study, we analyze the diffuse reflectance of the gastric inflammatory lesions induced by the bacterium H. pylori in the mouse stomach. A pipeline has been designed to characterize and classify spectra acquired on mice. The pipeline is based on a band clustering algorithm followed by the computation of meaningful division and subtraction features and by classification with a linear SVM classifier. Currently, the pipeline is able to recognize inflamed stomachs spectra with an accuracy of 98%. These results are promising and the same pipelin…
Impact of the community structure on the dynamics of complex networks
2023
Networks are everywhere. We encounter them daily in our lives, through our social interactions, how we come up with decisions in our brain, to having phone calls, conducting financial transactions, and traveling from one place to another. Individual actions are influenced by their environment, which is, in turn, influenced by the network's topology. Notably, individuals may change their actions, ideas, or opinions to conform to the aspirations of a particular social group. In the same vein, the spread of a virus can take a certain course if the network's structure induces specific pathways for expansion. In such scenarios, communities substantially impact the evolution of the dynamics. They…
Capturing and Indexing Rehearsals: The Design and Usage of a Digital Archive of Performing Arts
2015
International audience; Preserving the cultural heritage of the performing arts raises difficult and sensitive issues, as each performance is unique by nature and the juxtaposition between the performers and the audience cannot be easily recorded. In this paper, we report on an experimental research project to preserve another aspect of the performing arts—the history of their rehearsals. We have specifically designed non-intrusive video recording and on-site documentation techniques to make this process transparent to the creative crew, and have developed a complete workflow to publish the recorded video data and their corresponding meta-data online as Open Data using state-of-the-art audi…
Ensemble Planning for Digital Audio Broadcasting
2003
Information retrieval in digital documents : a variation patterns of procedural execution
2013
The research activity of information on the internet has become common in our daily life. Despite this fact, it still raises many problems for the user who does not find the information they want or is lost to the amount of information available. This study aims at testing a new patented preview device, enabling users to browse and view pages in depth. The task is to find a target apartment with one or more specific criteria in a real estate agency designed website. Several conditions were tested. The “usual” condition with the classic search features, page by page, the other "transparent" condition which enables you to preview selected pages and select only relevant pages. We are intereste…
Object tracking in medical imaging using a 2D active mesh system
2003
International audience; Abstract: This article proposes a technique for tracking moving organs in medical imaging. It can be split into two stages. We first initialize a 2D-triangular mesh on the first image of the sequence. We distinguish different objects of interest by grouping together the triangles that make them up. Afterwards, we deform this mesh on the successive images in order to track each identified object. The tracking stage uses optical flow by adding a node relaxation step to avoid mesh deteriorations. The mesh deformations analysis provides access to motion information along the sequence. This technique is applied to a cine-MRI sequences of the heart and allows the analysis …
Portable Video Supercomputing
2004
As inexpensive imaging chips and wireless telecommunications are incorporated into an increasing array, of portable products, the need for high efficiency, high throughput embedded processing will become an important challenge in computer architecture. Videocentric applications, such wireless videoconferencing, real-time video enhancement and analysis, and new, immersive modes of distance education, will exceed the computational capabilities of current microprocessor and digital signal processor (DSP) architectures. A new class of embedded computers, portable video supercomputers, will combine supercomputer performance with the energy efficiency required for deployment in portable systems. …
Hierarchies of probabilistic and team FIN-learning
2001
AbstractA FIN-learning machine M receives successive values of the function f it is learning and at some moment outputs a conjecture which should be a correct index of f. FIN learning has two extensions: (1) If M flips fair coins and learns a function with certain probability p, we have FIN〈p〉-learning. (2) When n machines simultaneously try to learn the same function f and at least k of these machines output correct indices of f, we have learning by a [k,n]FIN team. Sometimes a team or a probabilistic learner can simulate another one, if their probabilities p1,p2 (or team success ratios k1/n1,k2/n2) are close enough (Daley et al., in: Valiant, Waranth (Eds.), Proc. 5th Annual Workshop on C…
An exact method for graph coloring
2006
International audience; We are interested in the graph coloring problem. We propose an exact method based on a linear-decomposition of the graph. The complexity of this method is exponential according to the linearwidth of the entry graph, but linear according to its number of vertices. We present some experiments performed on literature instances, among which COLOR02 library instances. Our method is useful to solve more quickly than other exact algorithms instances with small linearwidth, such as mug graphs. Moreover, our algorithms are the first to our knowledge to solve the COLOR02 instance 4-Inser_3 with an exact method.
The Steiner Traveling Salesman Problem and its extensions
2019
Abstract This paper considers the Steiner Traveling Salesman Problem, an extension of the classical Traveling Salesman Problem on an incomplete graph where not all vertices have demand. Some extensions including several depots or location decisions are introduced, modeled and solved. A compact integer linear programming formulation is proposed for each problem, where the routes are represented with two-index decision variables, and parity conditions are modeled using cocircuit inequalities. Exact branch-and-cut algorithms are developed for all formulations. Computational results obtained confirm the good performance of the algorithms. Instances with up to 500 vertices are solved optimally.