Search results for "Computation"
showing 10 items of 7362 documents
Quantum counter automata
2011
The question of whether quantum real-time one-counter automata (rtQ1CAs) can outperform their probabilistic counterparts has been open for more than a decade. We provide an affirmative answer to this question, by demonstrating a non-context-free language that can be recognized with perfect soundness by a rtQ1CA. This is the first demonstration of the superiority of a quantum model to the corresponding classical one in the real-time case with an error bound less than 1. We also introduce a generalization of the rtQ1CA, the quantum one-way one-counter automaton (1Q1CA), and show that they too are superior to the corresponding family of probabilistic machines. For this purpose, we provide gene…
5G IoT System for Real-Time Psycho-Acoustic Soundscape Monitoring in Smart Cities With Dynamic Computational Offloading to the Edge
2021
Environmental noise monitoring for smart cities need to be as much efficient as possible in order to mitigate its significant impact in the health of their inhabitants. 5G Internet of Things (IoT) systems offer a big opportunity to offload the computation from the sensor nodes, since it provides a series of new concepts for dynamic computing that the previous technologies did not offer. In this article, a complete 5G IoT system for psycho-acoustic monitoring has been designed and implemented using different options for offloading computation to different parts of the system. This offloading has been done by developing different functional splittings of the psycho-acoustic metrics algorithms…
2MOLCAS as a development platform for quantum chemistry software
2004
This work presents the quantum chemistry package MOLCAS, with emphasis on its usefulness as a platform for developing new quantum chemical codes, and the reader is assumed to be familiar with such a process. The development of new codes for quantum chemistry is a time-consuming job that can be dramatically simplified by using libraries for standard problems (such as calculation of integrals), and tools to surmount computer language and operating system limitations. The MOLCAS quantum chemistry software contains modules for a variety of quantum chemical methods, such as Hartree-Fock (HF), density functional theory (DFT), coupled-cluster (CC), and multiconfigurational (MCSCF) approaches, incl…
Mapping of BLASTP Algorithm onto GPU Clusters
2011
Searching protein sequence database is a fundamental and often repeated task in computational biology and bioinformatics. However, the high computational cost and long runtime of many database scanning algorithms on sequential architectures heavily restrict their applications for large-scale protein databases, such as GenBank. The continuing exponential growth of sequence databases and the high rate of newly generated queries further deteriorate the situation and establish a strong requirement for time-efficient scalable database searching algorithms. In this paper, we demonstrate how GPU clusters, powered by the Compute Unified Device Architecture (CUDA), OpenMP, and MPI parallel programmi…
Bill2d - a software package for classical two-dimensional Hamiltonian systems
2015
Abstract We present Bill2d , a modern and efficient C++ package for classical simulations of two-dimensional Hamiltonian systems. Bill2d can be used for various billiard and diffusion problems with one or more charged particles with interactions, different external potentials, an external magnetic field, periodic and open boundaries, etc. The software package can also calculate many key quantities in complex systems such as Poincare sections, survival probabilities, and diffusion coefficients. While aiming at a large class of applicable systems, the code also strives for ease-of-use, efficiency, and modularity for the implementation of additional features. The package comes along with a use…
Usage of HMM-Based Speech Recognition Methods for Automated Determination of a Similarity Level Between Languages
2019
The problem of automated determination of language similarity (or even defining of a distance on the space of languages) could be solved in different ways – working with phonetic transcriptions, with speech recordings or both of them. For the recordings, we propose and test a HMM-based one: in the first part of our article we successfully try language detection, afterwards we are trying to calculate distances between HMM-based models, using different metrics and divergences. The Kullback-Leibler divergence is the only one we got good results with – it means that the calculated distances between languages correspond to analytical understanding of similarity between them. Even if it does not …
Visualization of Parameter Sensitivity of 2D Time-Dependent Flow
2018
In this paper, we present an approach to analyze 1D parameter spaces of time-dependent flow simulation ensembles. By extending the concept of the finite-time Lyapunov exponent to the ensemble domain, i.e., to the parameter that gives rise to the ensemble, we obtain a tool for quantitative analysis of parameter sensitivity both in space and time. We exemplify our approach using 2D synthetic examples and computational fluid dynamics ensembles.
Using privacy-transformed speech in the automatic speech recognition acoustic model training
2020
Automatic Speech Recognition (ASR) requires huge amounts of real user speech data to reach state-of-the-art performance. However, speech data conveys sensitive speaker attributes like identity that can be inferred and exploited for malicious purposes. Therefore, there is an interest in the collection of anonymized speech data that is processed by some voice conversion method. In this paper, we evaluate one of the voice conversion methods on Latvian speech data and also investigate if privacy-transformed data can be used to improve ASR acoustic models. Results show the effectiveness of voice conversion against state-of-the-art speaker verification models on Latvian speech and the effectivene…
Special factors and the combinatorics of suffix and factor automata
2011
AbstractThe suffix automaton (resp. factor automaton) of a finite word w is the minimal deterministic automaton recognizing the set of suffixes (resp. factors) of w. We study the relationships between the structure of the suffix and factor automata and classical combinatorial parameters related to the special factors of w. We derive formulae for the number of states of these automata. We also characterize the languages LSA and LFA of words having respectively suffix automaton and factor automaton with the minimal possible number of states.
Advances in the investigation of dioxouranium(VI) complexes of interest for natural fluids
2012
Abstract The interactions of dioxouranium(VI) cation with different organic and inorganic ligands of environmental and biological interest were carefully examined with the aim to draw a chemical speciation picture of this ion in natural aquatic ecosystems and in biological fluids. Since UO22+ ion shows a significant tendency to hydrolyze, particular attention was paid in considering the hydrolysis species formation both in the presence and in absence of ligands. The results reported in the literature show that formation of the hydrolytic species assumes a great importance in the complexation models for all the UO22+-ligand systems considered. In particular, the following ligands have been t…