Sharif Digital Repository

We propose an efficient and effective nonlinear feature domain noise suppression algorithm, motivated by the minimum mean square error (MMSE) optimization criterion. Multi Layer Perceptron (MLP) neural network in the log spectral domain minimizes the difference between noisy and clean speech. By using this method as a pre-processing stage of a speech recognition system, the recognition rate in noisy environments is improved. We can extend the application of the system to different environments with different noises without re-training it. We need only to train the preprocessing stage with a small portion ofnoisy data which is created by artificially adding different types of noises from the... 

In this paper, we have proposed an efficient and effective nonlinear feature domain noise suppression algorithm, motivated by the minimum mean square error (MMSE) optimization criterion. A Multi Layer Perceptron (MLP) neural network in the log spectral domain has been employed to minimize the difference between noisy and clean speech. By using this method, as a pre-processing stage of a speech recognition system, the recognition rate in noisy environments has been improved. We extended the application ofthe system to different environments with different noises without retraining HMMmodel. We trained the feature extraction stage with a small portion of noisy data which was created by... 

This work presents a method to increase the face recognition accuracy using a combination of Wavelet, PCA, and SVM. Pre-processing, feature extraction and classification rules are three crucial issues for face recognition. This paper presents a hybrid approach to employ these issues. For pre-processing and feature extraction steps, we apply a combination of wavelet transform and PCA. During the classification stage, SVMs incorporated with a binary tree recognition strategy are applied to tackle the multi-class face recognition problem to achieve a robust decision in presence of wide facial variations. The binary trees extend naturally, the pairwise discrimination capability of the SVMs to... 

In recent years, analyzing genome-wide expression profiles to find genetic markers has received much attention as a challenging field of research aiming at unveiling biological mechanisms behind complex disorders. The identification of reliable and reproducible markers has lately been achieved by integrating genome-scale functional relationships and transcriptome datasets, and a number of algorithms have been developed to support this strategy. In this paper, we present a promising and easily applicable tool to accomplish this goal, namely CytoGTA, which is a Cytoscape plug-in that relies on an optimistic game theoretic approach (GTA) for identifying subnetwork markers. Given transcriptomic... 

How can we optimally trade extra computing power to reduce the communication load in distributed computing? We answer this question by characterizing a fundamental tradeoff between computation and communication in distributed computing, i.e., the two are inversely proportional to each other. More specifically, a general distributed computing framework, motivated by commonly used structures like MapReduce, is considered, where the overall computation is decomposed into computing a set of “Map” and “Reduce” functions distributedly across multiple computing nodes. A coded scheme, named “Coded Distributed Computing” (CDC), is proposed to demonstrate that increasing the computation load of the... 

The great attention to cognitive radio networks (CRNs) in recent years, as a revolutionary communication paradigm that aims to solve the problem of spectrum scarcity, prompts serious investigation on security issues of these networks. One important security concern in CRNs is the preservation of users location privacy, which is under the shadow of threat, especially in database-driven CRNs. To this end, in this paper, we propose a Location Privacy Preserving Database-Driven Spectrum-Sharing (L-PDS 2) protocol for sharing the spectrum between PUs and SUs in a database-driven CRN, while protecting location privacy of both primary and secondary users, simultaneously. We also present two... 

A dense monitoring network is vital for the reliable assessment of PM10 in different parts of an urban area. In this study, a new idea is employed for the re-construction of the 20 shut-down PM10 monitoring stations of Berlin. It endeavours to find the non-linear relationship between the hourly PM10 concentration of both the still operating and the shut-down PM10 monitoring stations by using a fuzzy modelling technique, called modified active learning method (MALM). In addition, the simulations were performed by using not only raw PM10 databases but also log-transformed PM10 databases for skewness reduction. According to the results of hourly PM10 simulation (root mean square error about... 

In recent years, end-to-end approaches to automatic speech recognition have received considerable attention as they are much faster in terms of preparing resources. However, conventional multistage approaches, which rely on a pipeline of training hidden Markov models (HMM)-GMM models and tree-building steps still give the state-of-the-art results on most databases. In this study, we investigate flat-start one-stage training of neural networks using lattice-free maximum mutual information (LF-MMI) objective function with HMM for large vocabulary continuous speech recognition. We thoroughly look into different issues that arise in such a setup and propose a standalone system, which achieves... 

We consider a basic caching system, where a single server with a database of N files (e.g. movies) is connected to a set of K users through a shared bottleneck link. Each user has a local cache memory with a size of M files. The system operates in two phases. a placement phase, where each cache memory is populated up to its size from the database, and a following delivery phase, where each user requests a file from the database, and the server is responsible for delivering the requested contents. The objective is to design the two phases to minimize the load (peak or average) of the bottleneck link. We characterize the rate-memory tradeoff of the above caching system within a factor of... 

There are a vast number of cloud service providers, which offer virtual machines (VMs) with different configurations. From the companies perspective, an appropriate selection of VMs is an important issue, as the proper service selection leads to improved productivity, higher efficiency, and lower cost. An effective service selection cannot be done without a systematic approach due to the modularity of requests, the conflicts between requirements, and the impact of network parameters. In this paper, we introduce an innovative framework, called PCA, to solve service selection problem in the hybrid environment of peer-assisted, public, and private clouds. PCA detects the conflicts between the... 

How can we optimally trade extra computing power to reduce the communication load in distributed computing? We answer this question by characterizing a fundamental tradeoff between computation and communication in distributed computing, i.e., the two are inversely proportional to each other. More specifically, a general distributed computing framework, motivated by commonly used structures like MapReduce, is considered, where the overall computation is decomposed into computing a set of “Map” and “Reduce” functions distributedly across multiple computing nodes. A coded scheme, named “coded distributed computing” (CDC), is proposed to demonstrate that increasing the computation load of the... 

In real applications, there are situations where we need to model some problems based on uncertain data. This leads us to define an uncertain model for some classical geometric optimization problems and propose algorithms to solve them. The assigned version of the k-center problem for n uncertain points in a metric space is studied in this paper. The main approach is to replace each uncertain point with a clever choice of a certain point. We argue that the k-center solution for these certain replacements of our uncertain points, is a good constant approximation factor for the original uncertain k-center problem. This approach enables us to present fast and simple algorithms that give... 

Sequential pattern recognition has long been an important topic of soft computing research with a wide area of applications including speech and handwriting recognition. In this paper, the performance of a novel fuzzy sequential pattern recognition tool named “Fuzzy Elastic Matching Machine” has been investigated. This tool overcomes the shortcomings of the HMM including its inflexible mathematical structure and inconsistent mathematical assumptions with imprecise input data. To do so, “Fuzzy Elastic Pattern” was introduced as the basic element of FEMM. It models the elasticity property of input data using fuzzy vectors. A sequential pattern such as a word in speech or a piece of writing is... 

One of the organizations’ main concerns is to protect sensitive data in database systems, especially the ones outsourced to untrusted service providers. An effective solution for this issue is to employ database encryption methods. Among different encryption approaches, Bucket-based method has the advantage of balancing security and performance of database operations. However, generating false-positive results in executing queries is the main drawback of this method. On the other hand, multi-join queries are one of the most critical operations executed on these stored sensitive data. Hence, acceptable processing and response time in executing multi-join queries is required. In this paper, we... 

Cutting transport is an important goal in drilling operation especially in horizontal and deviated wells since it can cause problems such as stuck pipe, circulation loss and high torque and drag. To this end, this article focused on the affecting parameters on the cutting transport by computational fluid dynamic (CFD) modeling and real operational data. The effect of drilling fluid and cutting density on the pressure drop, deposit ratio and string stress on the cutting transport has been investigated. A systematic validation study is presented by comparing the simulation results against published experimental database. The results showed that by increasing two times of drilling fluid... 

Automatic access control systems (ACS) based on the human biometrics or physical tokens are widely employed in public and private areas. Yet these systems, in their conventional forms, are restricted to active interaction from the users. In scenarios where users are not cooperating with the system, these systems are challenged. Failure in cooperation with the biometric systems might be intentional or because the users are incapable of handling the interaction procedure with the biometric system or simply forget to cooperate with it, due to for example, illness like dementia. This work introduces a challenging bimodal database, including face and hand information of the users when they... 

We consider a basic cache network, in which a single server is connected to multiple users via a shared bottleneck link. The server has a database of files (content). Each user has an isolated memory that can be used to cache content in a prefetching phase. In a following delivery phase, each user requests a file from the database, and the server needs to deliver users' demands as efficiently as possible by taking into account their cache contents. We focus on an important and commonly used class of prefetching schemes, where the caches are filled with uncoded data. We provide the exact characterization of the rate-memory tradeoff for this problem, by deriving both the minimum average rate... 

Considering the wide spread locations of wind farms in Iran, it is important to develop a suitable decision support system (DSS) to fulfill proper management of wind farms. Extensive literature survey indicates that there are no integrated forms of DSS to manage a set of wind farms. The existing wind farms are performing independently, and there is no practical method for exchanging the online data. DSS can contribute to optimal operation of wind farms, operation and maintenance scheduling, pricing policy, etc. In this study, a geographic information system and RETSCREEN software were linked to the designed DSS to achieve a more suitable result. Also, a huge number of data are constantly... 

This paper introduces a large-scale, validated database for Persian called Sharif Emotional Speech Database (ShEMO). The database includes 3000 semi-natural utterances, equivalent to 3 h and 25 min of speech data extracted from online radio plays. The ShEMO covers speech samples of 87 native-Persian speakers for five basic emotions including anger, fear, happiness, sadness and surprise, as well as neutral state. Twelve annotators label the underlying emotional state of utterances and majority voting is used to decide on the final labels. According to the kappa measure, the inter-annotator agreement is 64% which is interpreted as “substantial agreement”. We also present benchmark results... 

In this paper, learning of tree-structured Gaussian graphical models from distributed data is addressed. In our model, samples are stored in a set of distributed machines where each machine has access to only a subset of features. A central machine is then responsible for learning the structure based on received messages from the other nodes. We present a set of communication-efficient strategies, which are theoretically proved to convey sufficient information for reliable learning of the structure. In particular, our analyses show that even if each machine sends only the signs of its local data samples to the central node, the tree structure can still be recovered with high accuracy. Our...