In our previous papers we described the ability of methylxanthine pentoxifylline (PTX) to depress the P-glycoprotein (P-gp) mediated multidrug resistance (MDR) of the mouse leukemic cell line L1210/VCR. Other methylxanthines like caffeine and theophylline were found to be ineffective in this respect. In the present paper we have analysed the capability of 25 methylxanthines to depress MDR of L1...

The problem of load balancing on the hypercube is considered. A number of tokens are placed at the nodes and the goal is to redistribute them evenly throughout the network. Initially each of the p nodes stores up to m tokens. A simple algorithm is presented operating in time O(logp+m log logp) on average.

In this paper, the LogP model is used to analyze four parallel sorting algorithms (bitonic, column, radix, and sample sort). LogP characterizes the performance of modern parallel machines with a small set of parameters: the communication latency (L), overhead (o), bandwidth (g), and the number of processors (P ). We develop implementations of these algorithms in Split-C, a parallel extension to...

In this paper, the LogP model is used to analyze four parallel sorting algorithms (bitonic, column, radix, and sample sort). LogP characterizes the performance of modern parallel machines with a small set of parameters: the communication latency (L), overhead (o), bandwidth (g), and the number of processors (P ). We develop implementations of these algorithms in Split-C, a parallel extension to...

The LogP model is a model of parallel computation that characterises a parallel computer architecture by four parameters: the latency L, the overhead o, the gap g and the number of processors P . We study the problem of constructing minimum-length schedules for treestructured programs in the LogP model. This problem is proved to be NP-hard, even for outtrees of height two in LogP models with an...

Niche membrane technologies, such as organic solvent nanofiltration (OSN), offer considerable energy and operation cost reduction compared with conventional separation methods. However, despite their many advantages, industrial implementation is hindered by small specialized datasets, which hinders the development of more advanced prediction In this study, we developed a medium-throughput syste...

Definition 8.1.1 Let P = ∑ i∈J Pi. Clearly 1 ≤ OPT ≤ P . Since 1 ≤ OPT ≤ P , if we have access to a (1 + )-relaxed decision procedure we can use it O(logP ) times to do a binary search on different values of T (between 1 and P ) to find a (1 + )approximation. Since logP is polynomial in the input size, if the relaxed decision procedure runs in polynomial time then we have a (1 + )-approximation...

Using our interferometric angular diameter measurements of seven classical Cepheids reported in Kervella et al. (2003, Paper I), complemented by previously existing measurements, we derive new calibrations of the Cepheids Period–Radius (P–R) and Period–Luminosity (P–L) relations. We obtain a P–R relation of logR = [0.767 ± 0.009] logP + [1.091 ± 0.011], only 1σ away from the relation obtained b...