Lipids from Five Cotton Varieties

Seed characteristics and the lipid and fatty-acid compositions were determined for the new cotton varieties ASh-25, Omad, 9771-I, Termez-43, and Bukhara-6.     

Theoretical Study of Weakly Bound Dimers between Hydrogen Fluoride and Some Polar Molecules

Weakly bound linear and bent dimers, FH—X (where X = CO, OC, CNH, NCH, N₂O and ON₂), are investigated using the DFT B3LYP and ab initio MP2 methods with the same basis sets (6–311++G(3df,2pd)). The strengths of the H—C or H—N H‐bonds in dimers FH—CO, FH—CNH, and FH—N₂O are compared with those of the H—O or H—N H‐bonds in dimers FH—OC, FH—NCH, and FH—ON₂. The results obtained for the H‐bond distances, the elongation effect of the HF bond, the red shift of the HF stretching frequency, and the energy difference between the dimer and the charge transfer reveal that the H‐bonds of the first group of dimers are stronger than those of the second. The Gibbs energies calculated for the six dimer formations indicate that the weakly bound dimers are unstable at room temperature (T = 298 K) (FH—X's → FH + X's, ΔG < 0).     

A note on adapting methods for continuous global optimization to the discrete case

In this note we show that various branch and bound methods for solving continuous global optimization problems can be readily adapted to the discrete case. As an illustration, we present an algorithm for minimizing a concave function over the integers contained in a compact polyhedron. Computational experience with this algorithm is reported.     

On the Exceptional Zeros of Rankin–Selberg L-Functions

The main objects of study in this article are two classes of Rankin–Selberg L-functions, namely L(s,f×g) and L(s, sym²(g)× sym²(g)), where f,g are newforms, holomorphic or of Maass type, on the upper half plane, and sym²(g) denotes the symmetric square lift of g to GL(3). We prove that in general, i.e., when these L-functions are not divisible by L-functions of quadratic characters (such divisibility happening rarely), they do not admit any LandauSiegel zeros. Such zeros, which are real and close to s=1, are highly mysterious and are not expected to occur. There are corollaries of our result, one of them being a strong lower bound for special value at s=1, which is of interest both geometrically and analytically. One also gets this way a good bound onthe norm of sym²(g).     

Information and asymptotic efficiency of the case-cohort sampling design in Cox's regression model

Efficiencies of the maximum pseudolikelihood estimator and a number of related estimators for the case-cohort sampling design in the proportional hazards regression model are studied. The asymptotic information and lower bound for estimating the parametric regression parameter are calculated based on the effective score, which is obtained by determining the component of the parametric score orthogonal to the space generated by the infinite-dimensional nuisance parameter. The asymptotic distributions of the maximum pseudolikelihood and related estimators in an i.i.d. setting show that these estimators do not achieve the computed asymptotic lower bound. Simple guidelines are provided to determine in which instances such estimators are close enough to efficient for practical purposes.     

An improved max-flow-based lower bound for minimizing maximum lateness on identical parallel machines

In this paper, we introduce a new concept of semi-preemptive scheduling and we show how it can be used to derive a maximum-flow-based lower bound for the P|r_j|L_max which dominates the well-known preemptive lower bound. We show that, in some cases, the proposed bound strictly dominates the preemptive one while having the same complexity.     

On Uniform Global Error Bounds for Convex Inequalities

This paper studies the existence of a uniform global error bound when a convex inequality g 0, where g is a closed proper convex function, is perturbed. The perturbation neighborhoods are defined by small arbitrary perturbations of the epigraph of its conjugate function. Under certain conditions, it is shown that for sufficiently small arbitrary perturbations the perturbed system is solvable and there exists a uniform global error bound if and only if g satisfies the Slater condition and the solution set is bounded or its recession function satisfies the Slater condition. The results are used to derive lower bounds on the distance to ill-posedness.     

Bound on <Emphasis Type="Italic">m</Emphasis>-restricted Edge Connectivity

An m-restricted edge cut is an edge cut that separates a connected graph into a disconnected one with no components having order less than m. m-restrict edge connectivity λm is the cardinality of a minimum m-restricted edge cut. Let G be a connected k-regular graph of order at least 2m that contains m-restricted edge cuts and X be a subgraph of G. Let θ(X) denote the number of edges with one end in X and the other not in X and ξm=min{θ(X) ;X is a connected vertex-induced subgraph of order m}.It is proved in this paper that if G has girth at least m/2 2,then λm≤ξm.The upper bound of λm is sharp.     

Two exact algorithms for the capacitated p-median problem

The p-median problem has been widely studied in combinatorial optimisation, but its generalisation to the capacitated case has not. We propose a branch and price algorithm, comparing it with a standard MIP solver and a branch and bound algorithm based on Lagrangean relaxation. We present computational experience, using test instances drawn from the literature and new instances with higher ratio between the number of medians p and the number of nodes N. The branch and price algorithm shows very good performances and computational time robustness in solving problems for any ratio.Received: December 2002, Revised: August 2003AMS classification: 90C10, 90C27     

An additive bounding procedure for the asymmetric travelling salesman problem

In this paper, new lower bounds for the asymmetric travelling salesman problem are presented, based on spanning arborescences. The new bounds are combined in an additive procedure whose theoretical performance is compared with that of the Balas and Christofides procedure (1981). Both procedures have been imbedded in a simple branch and bound algorithm and experimentally evaluated on hard test problems.