Search results for "Markov model"
showing 10 items of 113 documents
Efficient and accurate methodology for solving multiserver retrial systems
2005
Proposed is a novel methodology for solving retrial systems which is based on the aggregation of levels of the Markov model beyond a given one. Its evaluation concludes that it is more accurate than previous approximations while requiring a low computational cost.
Creation and cognition for humanoid live dancing
2016
Abstract Computational creativity in dancing is a recent and challenging research field in Artificial Intelligence and Robotics. We present a cognitive architecture embodied in a humanoid robot capable to create and perform dances driven by the perception of music. The humanoid robot is able to suitably move, to react to human mate dancers and to generate novel and appropriate sequences of movements. The approach is based on a cognitive architecture that integrates Hidden Markov Models and Genetic Algorithms. The system has been implemented on a NAO robot and tested in public setting-up live performances, obtaining positive feedbacks from the audience.
An automatic system for humanoid dance creation
2016
Abstract The paper describes a novel approach to allow a robot to dance following musical rhythm. The proposed system generates a dance for a humanoid robot through the combination of basic movements synchronized with the music. The system made up of three parts: the extraction of features from audio file, estimation of movements through the Hidden Markov Models and, finally, the generation of dance. Starting from a set of given movements, the robot choices sequence of movements a suitable Hidden Markov Model, and synchronize them processing musical input. The proposed approach has the advantage that movement execution probabilities could be changed according evaluation of the dance executi…
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…
Molecular dynamics simulations in hybrid particle-continuum schemes: Pitfalls and caveats
2017
Heterogeneous multiscale methods (HMM) combine molecular accuracy of particle-based simulations with the computational efficiency of continuum descriptions to model flow in soft matter liquids. In these schemes, molecular simulations typically pose a computational bottleneck, which we investigate in detail in this study. We find that it is preferable to simulate many small systems as opposed to a few large systems, and that a choice of a simple isokinetic thermostat is typically sufficient while thermostats such as Lowe-Andersen allow for simulations at elevated viscosity. We discuss suitable choices for time steps and finite-size effects which arise in the limit of very small simulation bo…
Algorithmic Aspects of Speech Recognition: A Synopsis
2000
Speech recognition is an area with a sizable literature, but there is little discussion of the topic within the computer science algorithms community. Since many of the problems arising in speech recognition are well suited for algorithmic studies, we present them in terms familiar to algorithm designers. Such cross fertilization can breed fresh insights from new perspectives. This material is abstracted from A. L. Buchsbaum and R. Giancarlo, Algorithmic Aspects of Speech Recognition: An Introduction, ACM Journal of Experimental Algorithmics, Vol. 2, 1997, http://www.jea.acm.org.
A Bayesian-optimal principle for learner-friendly adaptation in learning games
2010
Abstract Adaptive learning games should provide opportunities for the student to learn as well as motivate playing until goals have been reached. In this paper, we give a mathematically rigorous treatment of the problem in the framework of Bayesian decision theory. To quantify the opportunities for learning, we assume that the learning tasks that yield the most information about the current skills of the student, while being desirable for measurement in their own right, would also be among those that are efficient for learning. Indeed, optimization of the expected information gain appears to naturally avoid tasks that are exceedingly demanding or exceedingly easy as their results are predic…
Hidden Markov Model Based Machine Learning for mMTC Device Cell Association in 5G Networks
2019
Massive machine-type communication (mMTC) is expected to play a pivotal role in emerging 5G networks. Considering the dense deployment of small cells and the existence of heterogeneous cells, an MTC device can discover multiple cells for association. Under traditional cell association mechanisms, MTC devices are typically associated with an eNodeB with highest signal strength. However, the selected eNodeB may not be able to handle mMTC requests due to network congestion and overload. Therefore, reliable cell association would provide a smarter solution to facilitate mMTC connections. To enable such a solution, a hidden Markov model (HMM) based machine learning (ML) technique is proposed in …
Automatic place detection and localization in autonomous robotics
2007
This paper presents an approach for the simultaneous learning and recognition of places applied to autonomous robotics. While noteworthy results have been achieved with respect to off-line training process for appearance-based navigation, novel issues arise when recognition and learning are simultaneous and unsupervised processes. The approach adopted here uses a Gaussian mixture model estimated by a novel incremental MML-EM to model the probability distribution of features extracted by image-preprocessing. A place detector decides which features belong to which place integrating odometric information and a hidden Markov model. Tests demonstrate that the proposed system performs as well as …
A Sub-Symbolic Approach to Word Modelling for Domain Specific Speech Recognition
2006
In this work a sub-symbolic technique for automatic, data driven language models construction is presented. Such a technique can be used to arrange a language-modelling module, which can be easily integrated in existing speech recognition architectures, such as the well-found HTK architecture. The proposed technique takes advantages from both the traditional LSA approach and from a novel application of a probability space metric known as "Hellinger's distance". Experimental trials are also presented, in order to validate the proposed approach.