The present era is distinguished for the development both of physical and psychical wonders. In mechanical and other arts, what miracles have been wrought by the ingenuity and scientific experiments of the engineer and the practical chemist; the tunnelling of iron-stone rocks; the draining of primaeval bogs and mosses; the suspension, as if by magic, of gigantic tubes over the wide waters; the ...

We consider the well-studied Hospital Residents (HR) problem in the presence of lower quotas (LQ). The input instance consists of a bipartite graph G = (R∪H, E) where R and H denote sets of residents and hospitals respectively. Every vertex has a preference list that imposes a strict ordering on its neighbors. In addition, each hospital h has an associated upper-quota q+(h) and lower-quota q−(h...

An instance of the popular matching problem (POP-M) consists of a set of applicants and a set of posts. Each applicant has a preference list that strictly ranks a subset of the posts. A matching M of applicants to posts is popular if there is no other matching M ′ such that more applicants prefer M ′ to M than prefer M to M . Abraham et al [1] described a linear time algorithm to determine whet...

§

Recent work in the sociology of music suggests a declining importance of genre categories. Yet other work in this research stream and in the sociology of classification argues for the continued prevalence of genres as a meaningful tool through which creators, critics and consumers focus their attention in the topology of available works. Building from work in the study of categories and categor...

In this paper, we propose to identify the singers of popular songs using vibrato characteristics and high level musical knowledge of song structure. The proposed framework starts with a vocal detection process followed by a hypothesis test for the vocal/non-vocal verification. This method allows us to select vocal segments of high confidence for singer identification. From the selected vocal se...

Our input is a bipartite graph G = (R ∪ H,E) where each vertex in R ∪ H has a preference list strictly ranking its neighbors. The vertices in R (similarly, in H) are called residents (resp., hospitals): each resident seeks to be matched to a hospital while each hospital h seeks cap(h) ≥ 1 many residents to be matched to it. The Gale-Shapley algorithm computes a stable matching in G in linear ti...

Since, most of the organizations present their services electronically, the number of functionally-equivalent web services is increasing as well as the number of users that employ those web services. Consequently, plenty of information is generated by the users and the web services that lead to the users be in trouble in finding their appropriate web services. Therefore, it is required to provi...