Context. This paper is the third one in a series devoted to studying the properties of binaries involving M giants. Aims. We use a new set of orbits to construct the first (e− logP ) diagram of an extensive sample of M giant binaries, to obtain their mass-function distribution, and to derive evolutionary constraints for this class of binaries and related systems. Methods. The orbital properties...

We consider the isomorphism problem for groups specified by their multiplication tables. Until recently, the best published bound for the worst-case was achieved by the np n+O(1) generator-enumeration algorithm. In previous work with Fabian Wagner, we showed an n logp n+O(logn/ log logn) time algorithm for testing isomorphism of p-groups by building graphs with degree bounded by p + O(1) that r...

We give a generalization to Abelian varieties over finite fields of the algorithm of Schoof for elliptic curves. Schoof showed that for an elliptic curve E over F , given by a Weierstrass equation, one can compute the number of Q F -rational points of E in time 0((log<?) ). Our result is the following. Let A be an Abelian variety over F . Then one can compute the characteristic polynomial of th...

(Abstract) The problem of efficient parallelization of 2D Ising spin systems requires realistic algorithmic design and implementation based on an understanding of issues from computer science and statistical physics. In this work, we not only consider fundamental parallel computing issues but also ensure that the major constraints and criteria of 2D Ising spin systems are incorporated into our ...

Through time-series CCD photometry of the metal-poor globular cluster M53, we have discovered eight new SX Phoenicis type stars (labeled from SXP1 to SXP8). All the new SX Phoenicis stars are located in the blue straggler star region of a color-magnitude diagram of M53. One of these stars (SXP2) is found to have very closely separated pulsation frequencies: f1/f2 = 0.9595 where f1 and f2 are pr...

We investigate the time complexity of several fundamental problems on the subbus mesh parallel computer with p processors. The problems include computing the PARITY and MAJORITY of p bits, the SUM of p numbers of length O(logp) and the MINIMUM of p numbers. It is shown that in one dimension the time to compute any of these problems is (log p). In two dimensions the time to compute any of PARITY...

BACKGROUND The design of chemical libraries, an early step in agrochemical discovery programs, is frequently addressed by means of qualitative physicochemical and/or topological rule-based methods. The aim of this study is to develop quantitative estimates of herbicide- (QEH), insecticide- (QEI), fungicide- (QEF), and, finally, pesticide-likeness (QEP). In the assessment of these definitions, w...

Lipophilicity (logP) represents one of the most studied and most frequently used fundamental physicochemical properties. At present there are several possibilities for its quantitative expression and many of them stems from chromatographic experiments. Numerous attempts have been made to compare different computational methods, chromatographic methods vs. computational approaches, as well as ch...

In this work, two reliable aqueous solubility models, ASMS (aqueous solubility based on molecular surface) and ASMS-LOGP (aqueous solubility based on molecular surface using ClogP as a descriptor), were constructed by using atom type classified solvent accessible surface areas and several molecular descriptors for a diverse data set of 1708 molecules. For ASMS (without using ClogP as a descript...

Organic salts of diclofenac were predicted by using computed molecular descriptors and multivariate partial least squares (PLS). The molecular descriptors including binding energy and surface area of salts were calculated by the use of Hyperchem and ChemPlus QSAR programs for Windows. Other physicochemical properties such as hydrogen acceptor for oxygen atoms, hydrogen acceptor for nitrogen ato...