Results 31 to 40 of about 6,618,541 (298)
An upper and lower bound of the Medication Possession Ratio. [PDF]
Christian M Sperber, Suren R Samarasinghe, Grace P Lomax Patient Connect Limited, Guildford, UK Background: The Medication Possession Ratio (MPR) is a ubiquitous and central measurement for adherence in the health care industry.
Sperber CM, Samarasinghe SR, Lomax GP.
europepmc +2 more sources
Projection Uniformity of Asymmetric Fractional Factorials
The objective of this paper is to study the issue of the projection uniformity of asymmetric fractional factorials. On the basis of level permutation and mixture discrepancy, the average projection mixture discrepancy to measure the uniformity for low ...
Kang Wang, Zujun Ou, Hong Qin, Na Zou
doaj +1 more source
A lower bound on opaque sets [PDF]
13 pages, 10 ...
Akitoshi Kawamura +3 more
openaire +7 more sources
A Column Generation-Based Lower Bound for the Minimum Sum Coloring Problem
The objective of this paper is to derive a tight and efficient lower bound for the minimum sum coloring problem. This NP-hard problem is a variant of the classical graph coloring problem where the objective is to minimize the sum of the colors.
Mehdi Mrad +3 more
doaj +1 more source
Setting lower bounds on truthfulness [PDF]
We present and discuss general techniques for proving inapproximability results for truthful mechanisms. We make use of these techniques to prove lower bounds on the approximability of several non-utilitarian multi-parameter problems. In particular, we demonstrate the strength of our techniques by exhibiting a lower bound of $2-\frac{1}{m}$ for the ...
Ahuva Mu'alem, Michael Schapira
openaire +2 more sources
Maximum common subgraph: some upper bound and lower bound results
Background Structure matching plays an important part in understanding the functional role of biological structures. Bioinformatics assists in this effort by reformulating this process into a problem of finding a maximum common subgraph between graphical
Jennings Steven F +2 more
doaj +1 more source
Construction of Dual Optimal Bidirectional Double-Loop Networks for Optimal Routing
Bidirectional double-loop networks (BDLNs) are widely used in computer networks for their simplicity, symmetry and scalability. One common way to improve their performance is to decrease the diameter and average distance.
Hui Liu, Xiaowan Li, Shenling Wang
doaj +1 more source
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Neeldhara Misra +2 more
openaire +3 more sources
Distance upper-bounding DUB allows a verifier to know whether a proving party is located within a certain distance bound. DUB protocols have many applications in secure authentication and location based services. We consider the dual problem of distance lower bounding DLB, where the prover proves it is outside a distance bound to the verifier.
Xifan Zheng +2 more
openaire +3 more sources
On the lower bound of Spearman’s footrule
Úbeda-Flores showed that the range of multivariate Spearman’s footrule for copulas of dimension d ≥ 2 is contained in the interval [−1/d, 1], that the upper bound is attained exclusively by the upper Fréchet-Hoeffding bound, and that the lower bound is ...
Fuchs Sebastian, McCord Yann
doaj +1 more source

