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.     

Convex functions, subdifferentiability and renormings

This paper through discussing subdifferentiability and convexity of convex functions shows that a Banach space admits an equivalent uniformly [locally uniformly, strictly] convex norm if and only if there exists a continuous uniformly [locally uniformly, strictly] convex function on some nonempty open convex subset of the space and presents some characterizations of super-reflexive Banach spaces. Supported by NSFC     

Generalization of Murty's direct algorithm to linear and convex quadratic programming

Murty's algorithm for the linear complementarity problem is generalized to solve the optimality conditions for linear and convex quadratic programming problems with both equality and inequality constraints. An implementation is suggested which provides both efficiency and tight error control. Numerical experiments as well as field tests in various applications show favorable results.The author thanks K. G. Murty for his encouragement and helpful comments.     

Well-Posedness by Perturbations of Variational Problems

In this paper, we consider the extension of the notion of well-posedness by perturbations, introduced by Zolezzi for optimization problems, to other related variational problems like inclusion problems and fixed-point problems. Then, we study the conditions under which there is equivalence of the well-posedness in the above sense between different problems. Relations with the so-called diagonal well-posedness are also given. Finally, an application to staircase iteration methods is presented.     

The Hahn–Banach Theorem for Partially Ordered Totally Convex, Positively Convex and Superconvex Modules

The Hahn–Banach Theorem for partially ordered totally convex modules [3] and a necessary and sufficient condition for the existence of an extension of a morphism from a submodule C ₀ of a partially ordered totally convex module C (with the ordered unit ball of the reals as codomain) to C, are proved. Moreover, the categories of partially ordered positively convex and superconvex modules are introduced and for both categories the Hahn–Banach Theorem is proved.     

线性分式规划最优解集的求法

本文使用多面集的表示定理，导出了线性分式规划最优解集的结构，并给出确定全部最优解的计算步骤。     

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