This work describes the complexity found in the normal and the deaf crying acoustic waves. Using approximate entropy, in a single figure, the complexity of the auto-covariance of the signal is computed. Thus, using this complexity value, we are able to discriminate the normal and the deaf infants crying domains with

The paper provided a description of a new model of information retrieval, which is an extension of vector-space model and is based on the principles of the theory of hypercomplex numerical systems. The model allows to some extent realize the idea of fuzzy search and allows you to apply in practice the model of information retrieval practical developments in the field of hypercomplex numerical s...

Rooted in structural dynamics theory, three approximate procedures for estimating seismic demands for bridges crossing fault-rupture zones and deforming into their inelastic range are presented: modal pushover analysis �MPA�, linear dynamic analysis, and linear static analysis. These procedures estimate the total seismic demand by superposing peak values of quasi-static and dynamic parts. The p...

Dynamic lot sizing problem is one of the significant problem in industrial units and it has been considered by  many researchers. Considering the quantity discount in  purchasing cost is one of the important and practical assumptions in the field of inventory control models and it has been less focused in terms of stochastic version of dynamic lot sizing problem. In  this paper, stochastic dyn...

The approximate string matching problem is to find all locations at which a query of length m matches a substring of a text of length n with k-or-fewer differences. Nowadays, with the advent of novel high throughput sequencing technologies, the approximate string matching algorithms are used to identify similarities, molecular functions and abnormalities in DNA sequences. We consider a generali...

Approximate string matching with k differences is considered. Filtration of the text is a widely adopted technique to reduce the text area processed by dynamic programming. We present sublinear filtration algorithms based on the locations of q-grams in the pattern. Samples of q-grams are drawn from the text at fixed periods, and only if consecutive samples appear in the pattern approximately in...

Though dynamic programming matching can carry out approximate string matching when there may be deletions or insertions in a document, its effectiveness and efficiency are usually too poor to use it for large-scale information retrieval. In this paper, we propose a method of dynamic programming matching for information retrieval. This method is as effective as a conventional information retriev...

This paper deals with a lumped-parameter dynamic simulation of a single-effect LiBr-H2O absorption chiller. In many studies the thermodynamic properties of LiBr-H2O solution were taken from some approximate relations causing the results to be somewhat inaccurate. These relations were used to solve simultaneous differential equations involving the continuity of species constituting the LiBr-H2O ...