Hundred ninety three drugs of different pharmacological activity were studied. Lipophilicity of a drug is one of the parameters, which influence its biological activity. The n-octanol-water partition coefficients were calculated for these compounds by use of different theoretical procedures (AlogPs, IAlogP, miLogP, ClogP, logP(Kowwin), and xlogP). Particular theoretical partition coefficients w...

serve as a basis for the design and analysis of fast, portable parallel algorithms, such as algorithms that can be implemented effectively on a wide variety of current and future parallel machines. If we look at the body of parallel algorithms developed under current parallel models, many are impractical because they exploit artificial factors not present in any reasonable machine, such as zero...

This paper describes a task scheduling algorithm, based on a LogP -type model, for allocating arbitrary task graphs to fully connected networks of processors. This problem is known to be NP-complete even under the delay model (a special case under the LogP model). The strategy exploits the replication and clustering of tasks to minimise the ill e ects of communication overhead on the makespan. ...

This paper critique is written under the assumption that the reader is already familiar with the primary text [2] (henceforth referred to as “the paper”), and therefore a full overview of the LogP model will not be presented. The critique will mainly focus on shortcomings and weaknesses of the paper, leaving commentary on the positive contributions of the work for the end. The critique is organ...

A quantitative comparison of the BSP and LogP models of parallel computation is developed. We concentrate on a variant of LogP that disallows the so-called stalling behavior, although issues surrounding the stalling phenomenon are also explored. Very eecient cross simulations between the two models are derived, showing their substantial equivalence for algorithmic design guided by asymptotic an...

A quantitative comparison of the BSP and LogP models of parallel computation is developed. We concentrate on a variant of LogP that disallows the so-called stalling behavior, although issues surrounding the stalling phenomenon are also explored. Very eecient cross simulations between the two models are derived, showing their substantial equivalence for algorithmic design guided by asymptotic an...

Most theoretical work is based on the PRAM-model which has a block of shared memory and executes in a synchronous lock-step mode. Real hardware usually executes asynchronously and uses local memory and message passing. The recent LogP-model reeects these architectural properties. We show that for a practically important subclass of PRAM-programs it is possible to transform them into LogP-progra...

Currently, many parallel algorithms are deened for shared-memory architectures. The prefered machine model for designing these algorithms is the PRAM. However, this model does not take into account properties of existing architectures. Recently, Culler et al. deened the LogP machine model which better reeects the behaviour of massively parallel computers. We discuss an important class of progra...

Three QSAR methods, artificial neural net (ANN), k-nearest neighbors (kNN), and Decision Forest (DF), were applied to 3363 diverse compounds tested for their Ames genotoxicity. The ratio of mutagens to non-mutagens was 60/40 for this dataset. This group of compounds includes >300 therapeutic drugs. All models were developed using the same initial set of 148 topological indices: molecular connec...

It is shown that a threshold network of width w and depth d cannot be constructed from balancers of width p0; p1; : : : ; pm 1, if w does not divide P , where P is the least common multiple of p0; p1; : : : ; pm 1. This holds regardless of the size of the network, as long as it is nite, and it implies a lower bound of logP w on the depth of the network. More strongly, a lower bound of logpmax w...