We study an online assignment problem where the offline servers have capacities, and the objective is to obtain a maximum-weight assignment of requests that arrive online. The weight of edges incident to any server can be at most the server capacity. Our problem is related to the adwords problem, where the assignment to a server is allowed to exceed its capacity. In many applications, however, ...

due to the complex physical properties of the detected targets using sonar systems, identification and classification of the actual targets is among the most difficult and complex issues of this field. considering the characteristics of the detected targets and unique capabilities of the intelligent methods in classification of their dataset, these methods seem to be the proper choice for the t...

We study the problem where we are given a system of polynomial equations defined by multivariate polynomials over GF[2] of fixed, constant, degree d > 1 and the aim is to satisfy the maximum number of equations. A random assignment approximates this number within a factor 2−d and we prove that for any ε > 0, it is NP-hard to obtain a ratio 2−d +ε . When considering instances that are perfectly ...

since it is essential to deliver smoothed sinusoidal voltage to the customers, diagnosing power quality (pq) events has played important role in power delivery and conversion. this diagnostic scheme should be accurate to classify pq events from other events in power system. also it should be fast enough to rapidly mitigate pq events. in this paper, an algorithm based on core vector machine (cvm...

microarray data have an important role in identification and classification of the cancer tissues. having a few samples of microarrays in cancer researches is always one of the most concerns which lead to some problems in designing the classifiers. for this matter, preprocessing gene selection techniques should be utilized before classification to remove the noninformative genes from the microa...

Solymosi and Raghavan (2001) characterize the stability of the core of the assignment game by means of a property of the valuation matrix. They show that the core of an assignment game is a von Neumann-Morgenstern stable set if and only if its valuation matrix has a dominant diagonal. Their proof makes use of some graphtheoretical tools, while the present proof relies on the notion of buyer-sel...

This paper develops a model of wage distribution and wage dynamics based on assignment and Pareto learning. The model matches a large number of key facts about wage distribution and wage dynamics. The tractability of Pareto learning allows us to derive joint implications on the wage distribution and wage dynamics as assignment becomes more important. Our model also provides a natural framework ...

Crowdsourcing markets have gained popularity as a tool for inexpensively collecting data from diverse populations of workers. Classification tasks, in which workers provide labels (such as “offensive” or “not offensive”) for instances (such as “websites”), are among the most common tasks posted, but due to human error and the prevalence of spam, the labels collected are often noisy. This proble...

As part of a larger program to identify low redshift radio analogues of the damped Lyman−α (DLA) absorbers seen in the spectra of high redshift quasars, Westerbork Synthesis Radio Telescope (WSRT) observations have discovered two new HI 21cm absorption lines at z = 0.394 and z = 0.437 in the spectra of the radio sources B 0248+430 and B 1243-072 respectively. These sightlines and redshifts were...

Generative models based on the multivariate Bernoulli and multinomial distributions have been widely used for text classification. Recently, the spherical k-means algorithm, which has desirable properties for text clustering, has been shown to be a special case of a generative model based on a mixture of von Mises-Fisher (vMF) distributions. This paper compares these three probabilistic models ...