We investigate the complexity of approximately counting stable roommate assignments in two models: (i) the k-attribute model, in which the preference lists are determined by dot products of “preference vectors” with “attribute vectors” and (ii) the k-Euclidean model, in which the preference lists are determined by the closeness of the “positions” of the people to their “preferred positions”. Ex...

eperisone hydrochloride is a skeletal muscle relaxant and paracetamol is cyclooxygenase inhibitor. these drugs in combination are used as antispasmodics. a simple, specific, precise and accurate method was developed, namely reverse phase high performance liquid chromatography for simultaneous estimation of eperisone hydrochloride and paracetamol in tablet dosage form. in rp-hplc method separati...

This paper gives output sensitive parallel algorithms whose performance depends on the output size and are signiicantly more eecient than previous algorithms for problems with suuciently small output size. Inputs are n n matrices over a xed ground eld. Let P (n) and M (n) be the PRAM processor bounds for O(log n) time multiplication of two degree n polynomials, and n n matrices, respectively. L...

Determining the positions of the sensor nodes in a network is essential to many network functionalities such as routing, coverage and tracking, and event detection. The localization problem for sensor networks is to reconstruct the positions of all of the sensors in a network, given the distances between all pairs of sensors that are within some radius r of each other. In the past few years, ma...

Let f : 2 → Z be a polymatroid (an integer-valued non-decreasing submodular set function with f(∅) = 0). We call S ⊆ N a base if f(S) = f(N). We consider the problem of finding a maximum number of disjoint bases; we denote by m be this base packing number. A simple upper bound on m is given by k = max{k : ∑ i∈N fA(i) ≥ kfA(N), ∀A ⊆ N} where fA(S) = f(A∪S)−f(A). This upper bound is a natural gen...

We study the complexity of inverting many-one, honest, polynomial-time computable onto functions. Asserting that every polynomial-time computable, honest, onto function is invertible is equivalent to the following proposition that we call Q: For all NP machines M that accept , there exists a polynomial-time computable function gM such that for all x, gM(x) outputs an accepting computation of M ...

Nitrogen (N), phosphate (P), and potassium (K) are the three most important nutrients applied into agricultural soils, but impacts of their single or combined application on soil fungal community structure stability still open questions. Using qPCR Illumina Miseq sequencing, variation communities in response to long-term addition N, P, K fertilization alone combinations a Mollisol field was inv...