Recently, the concept of time-frequency masking has developed as an important approach to the blind source separation problem, particularly when in the presence of reverberation. However, previous research has been limited by factors such as the sensor arrangement and/or the mask estimation technique implemented. This paper presents a novel integration of two established approaches to BSS in an...

This paper presents a part of the doctoral work with the theme: “The impact of sorted reading from UB-trees on relational database systems”. Based on [Mar99] this doctoral work deals with the problems of the efficient implementation and analysis of sorted reading (UB-Cache [Bay97b], Tetris -Algorithm [MB98], [MZB99]) and its effect on query-processing and query optimization in relational databa...

Analysis of new trends in databases development shows that promising solution in databases gathering a huge quantities of information is approximate retrieval. This work presents the fuzzy queries processing with a special attention to context-dependent and multidimensional membership functions. In the first part, the analysis of occurrence of fuzzy values in SQL queries directed to the databas...

We present an overview of the most important proposals for human-oriented query languages for relational databases, based on fuzzy sets theory. To highlight important issues concerning communication with databases, we propose two taxonomies: the first taxonomy deals with flexible query languages in crisp relational databases and the second deals with flexible query languages in fuzzy relational...

Multidimensional data structures have become very popular in recent years. Their importance lies in efficient indexing of data, which have naturally multidimensional characteristics like navigation data, drawing specifications etc. The R-tree is a well-known structure based on the bounding of spatial near points by rectangles. Although efficient query processing of multidimensional data is requ...

It is well known that for a regular tree language it decidable whether or not can be recognized by deterministic top-down automaton (DTA). However, the computational complexity of this problem has been studied. We show given bottom-up decided in quadratic time its DTA. Since there are finite languages cannot DTAs, we also consider unions DTAs and here, definability within automata time.

Customer Retention is a major aspect of the growth of any business. It is always good to retain those customers who are more loyal or can be converted to be loyal. In this paper, a fuzzy decision tree based approach is proposed in combination with Z-shaped curved membership function to find the customer loyalty and has been compared with the approach of fuzzy decision tree with Gaussian members...