Search results for "hidden"

showing 10 items of 210 documents

Beating the One-Half Limit of Ancilla-Free Linear Optics Bell Measurements

2013

We show that optically encoded two-qubit Bell states can be unambiguously discriminated with a success probability of more than 50% in both single-rail and dual-rail encodings by using active linear-optical resources that include Gaussian squeezing operations. These results are in contrast to the well-known upper bound of 50% for unambiguous discrimination of dual-rail Bell states using passive, static linear optics and arbitrarily many vacuum modes. We present experimentally feasible schemes that improve the success probability to 64.3% in dual-rail and to 62.5% in single-rail for a uniform random distribution of Bell states. Conceptually, this demonstrates that neither interactions that i…

PhysicsQuantum PhysicsBell stateGaussianFOS: Physical sciencesGeneral Physics and AstronomyPhysics::Classical PhysicsUpper and lower boundsTeleportationComputer Science::Othersymbols.namesakeLocal hidden variable theoryQuantum mechanicssymbolsLimit (mathematics)Quantum informationQuantum Physics (quant-ph)Quantum information sciencePhysical Review Letters
researchProduct

Hidden Markov random field model and Broyden–Fletcher–Goldfarb–Shanno algorithm for brain image segmentation

2018

International audience; Many routine medical examinations produce images of patients suffering from various pathologies. With the huge number of medical images, the manual analysis and interpretation became a tedious task. Thus, automatic image segmentation became essential for diagnosis assistance. Segmentation consists in dividing the image into homogeneous and significant regions. We focus on hidden Markov random fields referred to as HMRF to model the problem of segmentation. This modelisation leads to a classical function minimisation problem. Broyden-Fletcher-Goldfarb-Shanno algorithm referred to as BFGS is one of the most powerful methods to solve unconstrained optimisation problem. …

Dice coefficient criterionComputer scienceBrain image segmentation02 engineering and technologyMR-images[INFO.INFO-AI]Computer Science [cs]/Artificial Intelligence [cs.AI]Theoretical Computer Science03 medical and health sciences0302 clinical medicineArtificial Intelligence0202 electrical engineering electronic engineering information engineering[INFO]Computer Science [cs]SegmentationBrain magnetic resonance imagingHidden Markov modelRandom fieldbusiness.industryBroyden-Fletcher-Goldfarb-Shanno algorithmPattern recognitionImage segmentationhidden Markov random fieldMinimization3. Good healthHomogeneousBroyden–Fletcher–Goldfarb–Shanno algorithm020201 artificial intelligence & image processingAutomatic segmentationArtificial intelligenceHidden Markov random fieldbusiness030217 neurology & neurosurgerySoftwareJournal of Experimental & Theoretical Artificial Intelligence
researchProduct

The search for dark matter gauge bosons with the Mainz Microtron

2011

Abstract A pilot experiment in the search for light gauge bosons at the spectrometer setup of the A1 collaboration at MAMI is presented. Light gauge bosons arise naturally in a wide range of theoretical approaches beyond the standard model and are in accordance with several pieces of experimental evidence not yet understood in the standard model. A first test measurement at MAMI showed that existing limits on the coupling of such a light gauge boson can be improved by nearly an order of magnitude by fixed target experiments at existing electron accelerators.

Nuclear physicsHidden sectorPhysicsNuclear and High Energy PhysicsGauge bosonParticle physicsSpectrometerPhysics beyond the Standard ModelHigh Energy Physics::PhenomenologyDark matterTechnicolorMicrotronStandard ModelProgress in Particle and Nuclear Physics
researchProduct

Breadwinners, sportsmen and conforming girls : representations of gender in Finnish EFL textbooks

2007

piilo-opetussuunnitelmatteaching materialshidden curriculumoppikirjatgendercritical discourse analysistextbook analysisenglannin kielisukupuoli
researchProduct

Observational properties of feebly coupled dark matter

2016

We show that decoupled hidden sectors can have observational consequences. As a representative model example, we study dark matter production in the Higgs portal model with one real singlet scalar $s$ coupled to the Standard Model Higgs via $\lambda_{\rm hs}\Phi^\dagger\Phi s^2$ and demonstrate how the combination of non-observation of cosmological isocurvature perturbations and astrophysical limits on dark matter self-interactions imply stringent bounds on the magnitude of the scalar self-coupling $\lambda_{\rm s}s^4$. For example, for dark matter mass $m_{\rm s}=10$ MeV and Hubble scale during cosmic inflation $H_*=10^{12}$ GeV, we find $10^{-4}\lesssim \lambda_{\rm s}\lesssim 0.2$.

PhysicsParticle physicsCosmology and Nongalactic Astrophysics (astro-ph.CO)Dark matterHigh Energy Physics::PhenomenologyScalar field dark matterFOS: Physical sciencesAstrophysics::Cosmology and Extragalactic Astrophysicsdark matterStandard ModelHidden sectorpimeä aineHigh Energy Physics - PhenomenologyHigh Energy Physics - Phenomenology (hep-ph)Higgs bosonProduction (computer science)Light dark matterDark fluidAstrophysics - Cosmology and Nongalactic Astrophysics
researchProduct

Gesture Modeling by Hanklet-Based Hidden Markov Model

2015

In this paper we propose a novel approach for gesture modeling. We aim at decomposing a gesture into sub-trajectories that are the output of a sequence of atomic linear time invariant (LTI) systems, and we use a Hidden Markov Model to model the transitions from the LTI system to another. For this purpose, we represent the human body motion in a temporal window as a set of body joint trajectories that we assume are the output of an LTI system. We describe the set of trajectories in a temporal window by the corresponding Hankel matrix (Hanklet), which embeds the observability matrix of the LTI system that produced it. We train a set of HMMs (one for each gesture class) with a discriminative a…

Conditional random fieldKinectbusiness.industryComputer scienceMaximum-entropy Markov modelAction ClassificationHankel matrixMarkov modelHidden Markov ModelLTI system theoryGestureAction RecognitionGesture recognitionObservabilityArtificial intelligencebusinessHidden Markov modelAlgorithmHankel matrixSkeleton
researchProduct

Counterexamples to the Kalman Conjectures

2018

In the paper counterexamples to the Kalman conjecture with smooth nonlinearity basing on the Fitts system, that are periodic solution or hidden chaotic attractor are presented. It is shown, that despite the fact that Kalman’s conjecture (as well as Aizerman’s) turned out to be incorrect in the case of n > 3, it had a huge impact on the theory of absolute stability, namely, the selection of the class of nonlinear systems whose stability can be studied with linear methods. peerReviewed

Barabanov systemsäätöteoriakaaosteoriamethodKalman conjectureFitts systempoint-mappinghidden attractor
researchProduct

Part of Speech Tagging Using Hidden Markov Models

2020

Abstract In this paper, we present a wide range of models based on less adaptive and adaptive approaches for a PoS tagging system. These parameters for the adaptive approach are based on the n-gram of the Hidden Markov Model, evaluated for bigram and trigram, and based on three different types of decoding method, in this case forward, backward, and bidirectional. We used the Brown Corpus for the training and the testing phase. The bidirectional trigram model almost reaches state of the art accuracy but is disadvantaged by the decoding speed time while the backward trigram reaches almost the same results with a way better decoding speed time. By these results, we can conclude that the decodi…

Computer scienceBrown CorpusSpeech recognitionBigramTrigramHidden Markov modelTag systemSentenceWord (computer architecture)Decoding methodsInternational Journal of Advanced Statistics and IT&C for Economics and Life Sciences
researchProduct

An adaptive probabilistic graphical model for representing skills in PbD settings

2010

business.industryComputer scienceProgramming by demonstrationBayesian probabilityProbabilistic logicMachine learningcomputer.software_genreUnsupervised learningArtificial intelligenceGraphical modelMachine Learning Imitation Learning Incremental Learning Dynamic Bayesian Network Growing Hierarchical Dynamic Bayesian NetworkAutomatic programmingbusinessHidden Markov modelcomputerDynamic Bayesian network
researchProduct

Textual data compression in computational biology: Algorithmic techniques

2012

Abstract In a recent review [R. Giancarlo, D. Scaturro, F. Utro, Textual data compression in computational biology: a synopsis, Bioinformatics 25 (2009) 1575–1586] the first systematic organization and presentation of the impact of textual data compression for the analysis of biological data has been given. Its main focus was on a systematic presentation of the key areas of bioinformatics and computational biology where compression has been used together with a technical presentation of how well-known notions from information theory have been adapted to successfully work on biological data. Rather surprisingly, the use of data compression is pervasive in computational biology. Starting from…

Biological dataData Compression Theory and Practice Alignment-free sequence comparison Entropy Huffman coding Hidden Markov Models Kolmogorov complexity Lempel–Ziv compressors Minimum Description Length principle Pattern discovery in bioinformatics Reverse engineering of biological networks Sequence alignmentSettore INF/01 - InformaticaGeneral Computer ScienceKolmogorov complexityComputer scienceSearch engine indexingComputational biologyInformation theoryInformation scienceTheoretical Computer ScienceTechnical PresentationEntropy (information theory)Data compressionComputer Science Review
researchProduct