Search results for "Crete"
showing 10 items of 2495 documents
Hypergraph imaging: an overview
2002
Hypergraph theory as originally developed by Berge (Hypergraphe, Dunod, Paris, 1987) is a theory of finite combinatorial sets, modeling lot of problems of operational research and combinatorial optimization. This framework turns out to be very interesting for many other applications, in particular for computer vision. In this paper, we are going to survey the relationship between combinatorial sets and image processing. More precisely, we propose an overview of different applications from image hypergraph models to image analysis. It mainly focuses on the combinatorial representation of an image and shows the effectiveness of this approach to low level image processing; in particular to seg…
Social Influence Maximization in Hypergraphs
2021
This work deals with a generalization of the minimum Target Set Selection (TSS) problem, a key algorithmic question in information diffusion research due to its potential commercial value. Firstly proposed by Kempe et al., the TSS problem is based on a linear threshold diffusion model defined on an input graph with node thresholds, quantifying the hardness to influence each node. The goal is to find the smaller set of items that can influence the whole network according to the diffusion model defined. This study generalizes the TSS problem on networks characterized by many-to-many relationships modeled via hypergraphs. Specifically, we introduce a linear threshold diffusion process on such …
An MDE Approach for Rapid Prototyping and Implementation of Dynamic Reconfigurable Systems
2015
This article presents a co-design methodology based on RecoMARTE, an extension to the well-known UML MARTE profile, which is used for the specification and automatic generation of Dynamic and Partially Reconfigurable Systems-on-Chip (DRSoC). This endeavor is part of a larger framework in which Model-Driven Engineering (MDE) techniques are extensively used for modeling and via model transformations, generating executable models, which are exploited by implementation tools to create reconfigurable systems. More specifically, the methodological aspects presented in this article are concerned with expediting the conception and implementation of the hardware platform and the integration of corre…
Low Complexity Image Compression using Pruned 8-point DCT Approximation in Wireless Visual Sensor Networks
2017
International audience; Since the transmission of the uncompressed image in the context of wireless visual sensor networks (WVSNs) consumes less energy than transmitting the compressed image, developing energy-aware compression algorithms are mandatory to extend the camera node's lifetime and thereby the whole network lifetime. The present paper studies a low-complexity image compression algorithm in the context of WVSNs. This algorithm consists of applying a pruning approach on a DCT approximation transform. The scheme is investigated in terms of computation cycles, processing time, energy consumption and image quality. Experimental works are conducted using the Atmel Atmega128 processor o…
An immune system model in discrete time based on the analogy with the central nervous system
1988
Jerne's model for the immune system formulated in terms of a neural network recently proposed by Weisbuch and Atlan is generalized to interactions with continuous coupling coefficients. It is shown that even the extended model can be solved analytically without the aid of computer simulations and exhibits one additional attractor, which corresponds to a configuration with high concentrations of active killer cells eventually causing death of the organism.
"Table 4" of "Search for long-lived, heavy particles in final states with a muon and multi-track displaced vertex in proton-proton collisions at sqrt…
2012
Number of tracks in vertex vs invariant mass of vertex (DATA) The number of tracks in the vertex vs the invariant mass of the vertex, for the data, and for the MH signal sample respectively. All selection cuts are applied, with the exceptions of those on the variables in the plot (Ntrk and mass), and the offline muon requirements.
"Table 5" of "Search for long-lived, heavy particles in final states with a muon and multi-track displaced vertex in proton-proton collisions at sqrt…
2012
Number of tracks in vertex vs invariant mass of vertex (SIGNAL) The number of tracks in the vertex vs the invariant mass of the vertex, for the data, and for the MH signal sample respectively. All selection cuts are applied, with the exceptions of those on the variables in the plot (Ntrk and mass), and the offline muon requirements.
"Table 1" of "Search for long-lived, heavy particles in final states with a muon and multi-track displaced vertex in proton-proton collisions at sqrt…
2012
Efficiency-vs-radial-vertex-position without re-tracking The efficiency for reconstructing a displaced vertex passing all cuts, as a function of radial distance from the z-axis to the vertex positon. The retrack and noretrack suffixes refer to whether or not the procedure known as re-tracking, where the tracking algorithm is re-run with looser cuts, on the leftover hits from standard tracking, was used to select the tracks that were input to the vertexing algorithm.
"Table 2" of "Search for long-lived, heavy particles in final states with a muon and multi-track displaced vertex in proton-proton collisions at sqrt…
2012
Efficiency-vs-radial-vertex-position with re-tracking The efficiency for reconstructing a displaced vertex passing all cuts, as a function of radial distance from the z-axis to the vertex positon. The retrack and noretrack suffixes refer to whether or not the procedure known as re-tracking, where the tracking algorithm is re-run with looser cuts, on the leftover hits from standard tracking, was used to select the tracks that were input to the vertexing algorithm.
Probabilistic inferences from conjoined to iterated conditionals
2017
Abstract There is wide support in logic, philosophy, and psychology for the hypothesis that the probability of the indicative conditional of natural language, P ( if A then B ) , is the conditional probability of B given A, P ( B | A ) . We identify a conditional which is such that P ( if A then B ) = P ( B | A ) with de Finetti's conditional event, B | A . An objection to making this identification in the past was that it appeared unclear how to form compounds and iterations of conditional events. In this paper, we illustrate how to overcome this objection with a probabilistic analysis, based on coherence, of these compounds and iterations. We interpret the compounds and iterations as cond…