Could chroman-4-one derivative be a better inhibitor of PTR1? – Reason for the identified disparity in its inhibitory potency in Trypanosoma brucei and Leishmania major

Most notable Kinetoplastids are of the genus Trypanosoma and Leishmania, affecting several millions of humans in Africa and Latin America. Current therapeutic options are limited by several drawbacks, hence the need to develop more efficacious inhibitors. An investigation to decipher the mechanism behind greater inhibitory potency of a chroman-4-one derivative (compound 1) in Trypanosoma brucei pteridine reductase 1 (TbPTR1) and Leishmania major pteridine reductase 1 (LmPTR1) was performed. Estimation of ΔG_bind revealed that compound 1 had a greater binding affinity in TbPTR1 with a ΔG_bind value of −49.0507 Kcal/mol than −29.2292 Kcal/mol in LmPTR1. The ΔGbind in TbPTR1 were predominantly contributed by “strong” electrostatic energy compared to the “weak” van der Waals in LmPTR1. In addition to this, the NADPH cofactor contributed significantly to the total energy of TbPTR1. A characteristic weak aromatic π interaction common in PTR1 was more prominent in TbPTR1 than LmPTR1. The consistent occurrence of high-affinity conventional hydrogen bond interactions as well as a steady interaction of crucial active site residues like Arg14/Arg17, Ser95/Ser111, Phe97/Phe113 in TbPTR1/LmPTR1 with chroman-4-one moiety equally revealed the important role the moiety played in the activity of compound 1. Overall, the structural and conformational analysis of the active site residues in TbPTR1 revealed them to be more rigid than LmPTR1. This could be the mechanism of interaction TbPTR1 employs in exerting a greater potency than LmPTR1. These findings will further give insight that will be assistive in modifying compound 1 for better potency and the design of novel inhibitors of PTR1.     

An M/G/1 Retrial Queueing System with Two-Phase Service and Preemptive Resume

An M/G/1 retrial queueing system with additional phase of service and possible preemptive resume service discipline is considered. For an arbitrarily distributed retrial time distribution, the necessary and sufficient condition for the system stability is obtained, assuming that only the customer at the head of the orbit has priority access to the server. The steady-state distributions of the server state and the number of customers in the orbit are obtained along with other performance measures. The effects of various parameters on the system performance are analysed numerically. A general decomposition law for this retrial queueing system is established.     

On Series of Ordinals and Combinatorics

This paper deals mainly with generalizations of results in finitary combinatorics to infinite ordinals. It is well-known that for finite ordinals ∑_bT<αβ is the number of 2-element subsets of an α-element set. It is shown here that for any well-ordered set of arbitrary infinite order type α, ∑_bT<αβ is the ordinal of the set M of 2-element subsets, where M is ordered in some natural way. The result is then extended to evaluating the ordinal of the set of all n-element subsets for each natural number n ≥ 2. Moreover, series ∑_β<αf(β) are investigated and evaluated, where α is a limit ordinal and the function f belongs to a certain class of functions containing polynomials with natural number coefficients. The tools developed for this result can be extended to cover all infinite α, but the case of finite α appears to be quite problematic.     

Interlaboratory comparisons and improvements of methods for acid number determination in used motor oils

The results of two interlaboratory comparisons of acid number determinations in used motor oils are discussed. It is shown that the comparability of the measurement results is not as good as that required by known standards for petroleum products. The problem is motor oil contaminants which accumulated during use, and which are the source of a matrix effect in the acid number determination. The standard methods’ drawbacks are analyzed and some improvements are proposed. Repeatability and accuracy of the improved methods are evaluated. Received: 11 December 2001 Accepted: 15 February 2002     

Some formulae for the q-Bernoulli and Euler polynomials of higher order

The purpose of this paper is to give a proof of Kummer type congruence for the q-Bernoulli numbers of higher order, which is an answer to a part of the problem in a previous publication (see Indian J. Pure Appl. Math. 32 (2001) 1565-1570).     

Stochastic signal analysis: Numerical representation and applications to system theory

Alternative procedures for representing a stochastic signal as a denumerable series with uncorrelated terms are developed. The study includes considerations about parametric rescaling and its repercussions on the orthogonal expansion, as well as numerical techniques for approaching such an expansion. In addition, applications to the Gaussian characterization of stochastic signals, filtering and stochastic modelling are treated.     

Orthogonal double covers by super‐extendable cycles

An Orthogonal Double Cover (ODC) of the complete graph K_n by an almost‐hamiltonian cycle is a decomposition of 2K_n into cycles of length n?1 such that the intersection of any two of them is exactly one edge. We introduce a new class of such decompositions. If n is a prime, the special structure of such a decomposition allows to expand it to an ODC of K_n+1 by an almost‐hamiltonian cycle. This yields the existence of an ODC of K_p+1 by an almost‐hamiltonian cycle for primes p of order 3 mod 4 and its eventual existence for arbitrary primes p. © 2002 Wiley Periodicals, Inc. J Combin Designs 10: 283–293, 2002; Published online in Wiley InterScience ( www.interscience.wiley.com ). DOI 10.1002/jcd.10011     

Global and uniform convergence of subspace correction methods for some convex optimization problems

This paper gives some global and uniform convergence estimates for a class of subspace correction (based on space decomposition) iterative methods applied to some unconstrained convex optimization problems. Some multigrid and domain decomposition methods are also discussed as special examples for solving some nonlinear elliptic boundary value problems.