Search results for " Signature"

Genome-wide detection of signatures of selection in three Valdostana cattle populations

2020

International audience; The Valdostana is a local dual purpose cattle breed developed in Italy. Three populations are recognized within this breed, based on coat colour, production level, morphology and temperament: Valdostana Red Pied (VPR), Valdostana Black Pied (VPN) and Valdostana Chestnut (VCA). Here, we investigated putative genomic regions under selection among these three populations using the Bovine 50K SNP array by combining three different statistical methods based either on allele frequencies (F-ST) or extended haplotype homozygosity (iHS and Rsb). In total, 8, 5 and 8 chromosomes harbouring 13, 13 and 16 genomic regions potentially under selection were identified by at least tw…

Prime divisors of character degrees

2008

Interchannel Interference and Mitigation in Distributed MIMO RF Sensing

2021

In this paper, we analyze and mitigate the cross-channel interference, which is found in multiple-input multiple-output (MIMO) radio frequency (RF) sensing systems. For a millimeter wave (mm-Wave) MIMO system, we present a geometrical three-dimensional (3D) channel model to simulate the time-variant (TV) trajectories of a moving scatterer. We collected RF data using a state-of-the-art radar known as Ancortek SDR-KIT 2400T2R4, which is a frequency-modulated continuous wave (FMCW) MIMO radar system operating in the K-band. The Ancortek radar is currently the only K-band MIMO commercial radar system that offers customized antenna configurations. It is shown that this radar system encounters th…

An improvement of NFC-SEC with signed exchanges for an e-prescription-based application

2013

International audience; In the context of an aging population, drug intake can be a potential source of errors leading to death in some cases. Almost all of these errors are unintentional and come from incorrect prescriptions, unsuitable dosages for the patient or incompatibility with other treatments. To limit these risks which are especially important in the elderly or pre-dependency, we propose a secure system for drug treatment through the NFC (Near Field Communication) contact-less communication technology. The proposed system provides security mechanisms such as integrity, authentication, encryption and non-repudiation. To ensure this security, an extension of the international standa…

Acoustic Detection of Moving Vehicles

2018

This chapter outlines a robust algorithm to detect the arrival of a vehicle of arbitrary type when other noises are present. It is done via analysis of its acoustic signature against an existing database of recorded and processed acoustic signals. To achieve it with minimum number of false alarms, a construction of a training database of acoustic signatures of signals emitted by vehicles using the distribution of the energies among blocks of wavelet packet coefficients (waveband spectra, see Sect. 4.6) is combined with a procedure of random search for a near-optimal footprint (RSNOFP). The number of false alarms in the detection is minimized even under severe conditions such as: signals emi…

If P ≠ NP then Some Strongly Noninvertible Functions Are Invertible

2001

Rabi, Rivest, and Sherman alter the standard notion of noninvertibility to a new notion they call strong noninvertibility, and show--via explicit cryptographic protocols for secret-key agreement ([RS93, RS97] attribute this to Rivest and Sherman) and digital signatures [RS93, RS97]--that strongly noninvertible functions would be very useful components in protocol design. Their definition of strong noninvertibility has a small twist ("respecting the argument given") that is needed to ensure cryptographic usefulness. In this paper, we show that this small twist has a large, unexpected consequence: Unless P = NP, some strongly noninvertible functions are invertible.

If P≠NP then some strongly noninvertible functions are invertible

2006

AbstractRabi, Rivest, and Sherman alter the standard notion of noninvertibility to a new notion they call strong noninvertibility, and show—via explicit cryptographic protocols for secret-key agreement (Rabi and Sherman attribute this protocol to Rivest and Sherman) and digital signatures (Rabi and Sherman)—that strongly noninvertible functions are very useful components in protocol design. Their definition of strong noninvertibility has a small twist (“respecting the argument given”) that is needed to ensure cryptographic usefulness. In this paper, we show that this small twist has a consequence: unless P=NP, some strongly noninvertible functions are invertible.

Building Semantic Trees from XML Documents

2016

International audience; The distributed nature of the Web, as a decentralized system exchanging information between heterogeneous sources, has underlined the need to manage interoperability, i.e., the ability to automatically interpret information in Web documents exchanged between different sources, necessary for efficient information management and search applications. In this context, XML was introduced as a data representation standard that simplifies the tasks of interoperation and integration among heterogeneous data sources, allowing to represent data in (semi-) structured documents consisting of hierarchically nested elements and atomic attributes. However, while XML was shown most …

Building Ontologies from XML Data Sources

2009

In this paper, we present a tool called X2OWL that aims at building an OWL ontology from an XML datasource. This method is based on XML schema to automatically generate the ontology structure, as well as, a set of mapping bridges. The presented method also includes a refinement step that allows to clean the mapping bridges and possibly to restructure the generated ontology.

Extensible User-Based XML Grammar Matching

2009

International audience; XML grammar matching has found considerable interest recently due to the growing number of heterogeneous XML documents on the web and the increasing need to integrate, and consequently search and retrieve XML data originated from different data sources. In this paper, we provide an approach for automatic XML grammar matching and comparison aiming to minimize the amount of user effort required to perform the match task. We propose an open framework based on the concept of tree edit distance, integrating different matching criterions so as to capture XML grammar element semantic and syntactic similarities, cardinality and alternativeness constraints, as well as data-ty…