Sharif Digital Repository

Rapid growth of digital music data in the Internet during the recent years has led to increase of user demands for search based on different types of meta data. One kind of meta data that we focused in this paper is the emotion or mood of music. Music emotion recognition is a prevalent research topic today. We collected a database including 280 pieces of popular music with four basic emotions of Thayer's two Dimensional model. We used a two level classifier the process of which could be briefly summarized in three steps: 1) Extracting most suitable features from pieces of music in the database to describe each music song; 2) Applying feature selection approaches to decrease correlations... 

In this paper, we address the problem of scientific-social network integration to find a matching relationship between members of these networks. Utilizing several name similarity patterns and contextual properties of these networks, we design a focused crawler to find high probable matching pairs, then the problem of name disambiguation is reduced to predict the label of each candidate pair as either true or false matching. By defining matching dependency graph, we propose a joint label prediction model to determine the label of all candidate pairs simultaneously. An extensive set of experiments have been conducted on six test collections obtained from the DBLP and the Twitter networks to... 

Clustering has become an increasingly important and highly complicated research area for targeting useful and relevant information in modern application domains such as the World Wide Web. Recent studies have shown that the most commonly used partitioning-based clustering algorithm, the K-means algorithm, is more suitable for large datasets. However, the K-means algorithm may generate a local optimal clustering. In this paper, we present novel document clustering algorithms based on the Harmony Search (HS) optimization method. By modeling clustering as an optimization problem, we first propose a pure HS based clustering algorithm that finds near-optimal clusters within a reasonable time.... 

Recognizing TimeML events and identifying their attributes, are important tasks in natural language processing (NLP). Several NLP applications like question answering, information retrieval, summarization, and temporal information extraction need to have some knowledge about events of the input documents. Existing methods developed for this task are restricted to limited number of languages, and for many other languages including Persian, there has not been any effort yet. In this paper, we introduce two different approaches for automatic event recognition and classification in Persian. For this purpose, a corpus of events has been built based on a specific version of ISO-TimeML for Persian.... 

Parallel corpora are the necessary resources in many multilingual natural language processing applications, including machine translation and cross-lingual information retrieval. Manual preparation of a large scale parallel corpus is a very time consuming and costly procedure. In this paper, the work towards building a sentence-level aligned English-Persian corpus in a semi-automated manner is presented. The design of the corpus, collection, and alignment process of the sentences is described. Two statistical similarity measures were used to find the similarities of sentence pairs. To verify the alignment process automatically, Google Translator was used. The corpus is based on news... 

In this work, we consider a three-echelon serial inventory system with two warehouses (suppliers) and one retailer with information exchange. The retailer applies continuous review (R, Q) policy. The warehouses have online information on the inventory position and demand activities of the retailer. We present a new ordering policy to share information among inventory echelons. The warehouse I and II start with m 1 and m 2 initial batches of the same order size of the retailer, respectively. The warehouse I places an order to an outside source immediately after the retailer's inventory position reaches an amount equal to the retailer's order point plus a fixed value s 1, and the warehouse II... 

Temporal relation classification is one of the contemporary demanding tasks in natural language processing. This task can be used in various applications such as question answering, summarization, and language specific information retrieval. In this paper, we propose an improved algorithm for classifying temporal relations between events and times, using support vector machines (SVM). Along with gold-standard corpus features, the proposed method aims at exploiting useful syntactic features, which are automatically generated, to improve accuracy of the classification. Accordingly, a number of novel kernel functions are introduced and evaluated for temporal relation classification. The result... 

Rank aggregation, that is merging multiple ranked lists, is a pivotal challenge in many information retrieval (IR) systems, especially in distributed IR and multilingual IR. From the evaluation point of view, being able to calculate the upper-bound of performance of the final aggregated list lays the ground for evaluating different aggregation strategies, independently. In this paper, we propose an algorithm based on dynamic programming which, using relevancy information, obtains the aggregated list with the maximum performance that could be possibly achieved by any aggregation strategy. We also provide a detailed proof for the optimality of the result of the algorithm. Furthermore, we... 

This paper introduces a new file manager to support multiple categorization. The proposed file manager is designed based on a subtle idea named Conceptual File Management (CFM). According to this approach, files are not contained by folders; nevertheless, each file can be a member of one or more folders (concepts). A prototype file manager is designed and implemented based on the new approach. Filtering by set operations and also manual concept selection improves retrieval of the files. CFM improves file system's clarity and avoids ambiguity and redundancy. As a result, it reduces the size of file system and enhances file access  

Temporal relation classification is one of contemporary demanding tasks of natural language processing. This task can be used in various applications such as question answering, summarization, and language specific information retrieval. In this paper, we propose an improved algorithm for classifying temporal relations, between events or between events and time, using support vector machines (SVM). Along with gold-standard corpus features, the proposed method aims at exploiting some useful automatically generated syntactic features to improve the accuracy of classification. Accordingly, a number of novel kernel functions are introduced and evaluated. Our evaluations clearly demonstrate that... 

In this study, an inventory system consisting of a single product, one supplier, and multiple identical retailers is considered. Each retailer replenishes inventory from the supplier according to the well known (R,Q) policy. Transit times are constant and retailers face independent Poisson demand. The supplier utilizing the retailers' information in decision making for replenishment policy with a given order size starts with m initial batches (of size Q) and places an order in a batch of size Q to an outside source when a new order is placed. In this inventory system, excess demand is backordered, delayed orders are satisfied on a first-come first-serve basis, and no partial shipment is... 

With the extensive growth in information, text classification as one of the text mining methods, plays a vital role in organizing and management information. Most text classification methods represent a documents collection as a Bag of Words (BOW) model and then use the histogram of words as the classification features. But in this way, the number of features is very large; therefore performing text classification faces serious computational cost problems. Moreover, the BOW representation is unable to recognize semantic relations between words. Recently, topic-model approaches have been successfully applied for text classification to overcome the problems of BOW. Our main goal in this paper... 

Deep learning has received much attention as of the most powerful approaches for multimodal representation learning in recent years. An ideal model for multimodal data can reason about missing modalities using the available ones, and usually provides more information when multiple modalities are being considered. All the previous deep models contain separate modality-specific networks and find a shared representation on top of those networks. Therefore, they only consider high level interactions between modalities to find a joint representation for them. In this paper, we propose a multimodal deep learning framework (MDLCW) that exploits the cross weights between representation of... 

In this paper the Multiple Relay Channels (MRC) with delays, with and without channel state information (CSI) are investigated from an information theoretic point of view. For the MRC with unlimited look ahead where the relays can use the whole received block to encode, upper and lower bounds on the capacity are derived which are tight for the degraded case. For the MRC without-delay where the relays have access to the present received symbols in addition to the past symbols, the capacity of the degraded channel is established using Shannon's strategy for the channels with side information. Then we introduce the state dependent MRC with unlimited look ahead and derive a lower bound on the...