Given a graph G = (V,E) and a set P = {po, p1, . . . , ps} of integers 0 ≤ po < p1 < . . . < ps ≤ b|V |/2c, we want to color a subset R ⊆ E of edges of G, say in red, in such a way that for any i (0 ≤ i ≤ s) G contains a maximum matching Mi with exactly pi red edges, i.e., |Mi ∩ R| = pi. We shall in particular be interested in finding a smallest subset R for which the required maximum matchings...

This paper studies the impact of the re-importation of imitated pharmaceuticals as a by-product of an open policy toward parallel import (PI) on process innovation. Foreign investment by a firm to exploit a new unregulated market with weak intellectual property rights can give rise to imitation. These products can potentially re-enter the original country when PI is allowed influencing research...

The structure and psychometric characteristics of the NEO Personality Inventory-3 (NEO-PI-3), a more readable version of the Revised NEO Personality Inventory (NEO-PI-R), are examined and compared with NEO-PI-R characteristics using data from college student observer ratings of 5,109 adolescents aged 12 to 17 years from 24 cultures. Replacement items in the PI-3 showed on average stronger item-...

Background The absence of detectable HIV resistance after treatment failure may result from non-adherence, especially for drugs such as ritonavir-boosted PIs (PI/r) for which minimum adherence may be sufficient to achieve suppression. This analysis aimed to investigate the association between adherence, indicated by a detectable PI plasma concentration, and development of PI resistance in patie...

Parameter Estimate Reaction k1f 0.01 nM−1 s−1 S+L → SL k1b 0.059 s−1 SL → S+L k2 0.1 s−1 SL (+ATP) → SLP (+ADP) k3f 0.001 s−1 SLP → SP k3b 0.001 s−1 SP → SLP k4f 0.0238 nM−1 s−1 SLP+R → SLP·R k4b 0.001 s−1 SLP·R → SLP+R k5f 0.0238 nM−1 s−1 SP+R → SP·R k5b 0.001 s−1 SP·R → SP+R k6f 19.8 s−1 SLP·R → SL+RP k6b 0.001 nM−1 s−1 SL+RP → SLP·R k7f 19.8 s−1 SP·R → S+RP k7b 0.001 nM−1 s−1 S+RP → SP·R k8f...

Let there be m parallel machines and n jobs, where a job j can be scheduled on machine i to take pi, j ∈ Z+ time units. The makespan Cmax is the completion time of a machine that finishes last. The goal is to produce a schedule with all n jobs that has minimum makespan. This is the makespan problem on unrelated parallel machines, denoted as R||Cmax. Assume p,q ∈ Z+ are constants, let A(p,q) = {...

R is called commuting regular ring (resp. semigroup) if for each x,y $in$ R there exists a $in$ R such that xy = yxayx. In this paper, we introduce the concept of commuting $pi$-regular rings (resp. semigroups) and study various properties of them.

We study the exclusive two-body nonleptonic $B_c\to X_{c\bar{c}}M$ decays, where $X_{c\bar{c}}$ is either a ground(1S) or radially excited (2S 3S) charmonium and $M$ pseudoscalar $(P)$ vector $(V)$ meson. consider here three categories of decays: $B_c \to PP, PV, VP$ decays within framework relativistic independent quark(RIQ) model based on flavor-independent interaction potential in scalar-vec...

The branching fraction $\mathcal{B}(B^0 \to D^{*-}\tau^+\nu_{\tau})$ is measured relative to that of the normalisation mode $B^0 D^{*-}\pi^+\pi^-\pi^+$ using hadronic $\tau^+ \pi^+\pi^-\pi^+(\pi^0)\bar{\nu}_{\tau}$ decays in proton-proton collision data at a centre-of-mass energy 13 TeV collected by LHCb experiment, corresponding an integrated luminosity 2 fb$^{-1}$. ratio D^{*-}\tau^+\nu_{\tau...