Let A = {a1, a2, . . . , as} and {b1, b2, . . . , bt} with s+r = n, the many to many point matching with demands and capacities matches each point ai ∈ A to at least αi and at most α ′ i points in B, and each point bj ∈ B to at least βj and at most β ′j points in A for all 1 ≤ i ≤ s and 1 ≤ j ≤ t. In this paper, we present an O(n) time and O(n) space algorithm for this problem.

the purpose of this study is to examine the relationship between epistemological and motivational beliefs about mathematics among gifted students. to this end , 334 first year high school gifted students were selected through applying the otis intelligence test. epistemological beliefs questionnaire (ebq) and motivational beliefs about mathematics scale (mbms) were also used as measurement inst...

Modelling and optimization principles become a key concept in many biological areas, especially in biochemistry. Definitions of objective function, fitness and co-evolution, although they differ between biology and mathematics, are similar in a general sense. Although successful in fitting models to experimental data, and some biochemical predictions, optimization and evolutionary computations ...

To navigate many-to-many mappings between referents and linguistic expressions, listeners need to calibrate likelihood estimates for different referential expressions taking into account both the context and speaker-specific variation. Focusing on speaker variation, we present three experiments. Experiment 1 establishes that listeners generalize speakerspecific patterns of pre-nominal modificat...

Although many factors determine Google's overall ranking of search engine results, Google maintains that the heart of its search engine software is PageRank, the eigenvector corresponds to the maximal eigenvalue in the Google matrix. In this note, we deals with a very special case of this positive matrix; i.e. when it is a positive convex matrix, then we provide a new way which can be used as a...