SINGLE MACHINE SCHEDULING WITH CONTROLLABLE PROCESSING TIMES AND COMPRESSION COSTS （PART I：EQUAL TIMES AND COSTS）

Most papers in scheduling research have treated individual job processing times as fixed parameters. However, in many practical situations, a manager may control processing time by realloeating resources. In this paper, authors consider a machine scheduling problemwith controllable processing times. In the first part of this paper, a special case where the pro-cessing times and compression costs are uniform among jobs is discussed. Theoretical results are derived that aid in developing an O（n^2) algorithm to slove the problem optimally. In the second part of this paper, authors generalize the discussion to general case, An effective heuristic to the genera/ problem will be presented.     

A DIRECT METHOD FOR THE UNIT CIRCLE PROBLEM

The unit circle problem is the problem of finding the number of eigenvalues of a non-Hermitian matrix inside and outside the unit circle . To reduce the cost of computing eigenvalues for the problem, a direct method, which is analogous to that given in [5], is proposed in this paper.     

关于艾森斯坦因判别法的间接应用

探讨了间接应用艾森斯坦因判别法判断整系数多项式在有理数域上不可约的两种途径.     

Minimum concave cost production system: A further generalization of multi-echelon model

We will consider a concave minimization problem associated with a series production system in which raw material is processed inm consecutive facilities. The products at some facility are either sent to the next facility or stocked in the warehouse. The amount of demand for the final products during periodi, i = 1,,n, are known in advance. Our problem is to minimize the sum of processing, holding and backlogging cost, all of which are assumed to be concave.The origin of this model is the classical economic lot size problem of Wagner and Whitin and was extensively studied by Zangwill. This model is very important from the theoretical as well as practical point of view and this is one of the very rare instances in which polynomial time algorithm has been constructed for concave minimization problems.The purpose of this paper is to extend the model further to the situation in which time lag is associated with processing at each facility. We will propose an efficient O(n ⁴ m) algorithm for this class of problems.     

On the average length of lexicographic paths

A bound is given for the average length of a lexicographic path, a definition that is motivated by degeneracies encountered when using the randomized simplex method.     

Hosoya polynomials of armchair open‐ended nanotubes

For a connected graph G we denote by d(G,k) the number of vertex pairs at distance k. The Hosoya polynomial of G is H(G,x) = ∑_k≥0 d(G,k)x^k. In this paper, analytical formulae for calculating the polynomials of armchair open‐ended nanotubes are given. Furthermore, the Wiener index, derived from the first derivative of the Hosoya polynomial in x = 1, and the hyper‐Wiener index, from one‐half of the second derivative of the Hosoya polynomial multiplied by x in x = 1, can be calculated. © 2006 Wiley Periodicals, Inc. Int J Quantum Chem, 2007     

Liquid Densities and Excess Molar Volumes for Binary Systems (Ionic Liquids + Methanol or Water) at 298.15, 303.15 and 313.15 K,and at Atmospheric Pressure

Binary excess molar volumes, V _m ^E, have been evaluated from density measurements, using a vibrating tube densimeter over the entire composition range for binary liquid mixtures of ionic liquids 1-ethyl-3-methyl-imidazolium diethyleneglycol monomethylethersulphate [EMIM]⁺[CH₃(OCH₂CH₂)₂OSO₃]⁻ or 1-butyl-3-methyl-imidazolium diethyleneglycol monomethylethersulphate [BMIM]⁺[CH₃(OCH₂CH₂)₂OSO₃]⁻ or 1-methyl-3-octyl-imidazolium diethyleneglycol monomethylethersulphate [MOIM]⁺[CH₃(OCH₂CH₂)₂OSO₃]⁻+methanol and [EMIM]⁺[CH₃(OCH₂CH₂)₂OSO₃]⁻+water at 298.15, 303.15 and 313.15 K. The V _m ^E values were found to be negative for all systems studied. The V _m ^E results are explained in terms of intermolecular interactions and packing effects. The experimental data were fitted by the Redlich-Kister polynomial.     

On Tutte polynomial expansion formulas in perspectives of matroids and oriented matroids

We introduce the active partition of the ground set of an oriented matroid perspective (or morphism, or quotient, or strong map) on a linearly ordered ground set. The reorientations obtained by arbitrarily reorienting parts of the active partition share the same active partition. This yields an equivalence relation for the set of reorientations of an oriented matroid perspective, whose classes are enumerated by coefficients of the Tutte polynomial, and a remarkable partition of the set of reorientations into Boolean lattices, from which we get a short direct proof of a 4-variable expansion formula for the Tutte polynomial in terms of orientation activities. This formula was given in the last unpublished preprint by Michel Las Vergnas; the above equivalence relation and notion of active partition generalize a former construction in oriented matroids by Michel Las Vergnas and the author; and the possibility of such a proof technique in perspectives was announced in the aforementioned preprint. We also briefly highlight how the 5-variable expansion of the Tutte polynomial in terms of subset activities in matroid perspectives comes in a similar way from the known partition of the power set of the ground set into Boolean lattices related to subset activities (and we complete the proof with a property which was missing in the literature). In particular, the paper applies to matroids and oriented matroids on a linearly ordered ground set, and applies to graph and directed graph homomorphisms on a linearly ordered edge-set.     

Exponential stability of discrete-time systems with slowly time-varying delays

Slowly time-varying delays are seldom, but do need to be, considered in the context of discrete-time systems. This paper addresses the exponential stability issue of discrete-time systems with slowly time-varying delays. The basic idea is to transform, by utilizing the switching transformation approach, the original system with slowly time-varying delays into an equivalent switched system with special switching signal. Different types of delays correspond to different types of switching signals, and the stability issue of the original system is converted into that of a switched system. It is the first time that the method of switched homogeneous polynomial Lyapunov function is applied to general delayed systems. Some sufficient exponential stability conditions for the original system are proposed in several situations. It is numerically shown that the conservativeness of the proposed conditions reduces as the degree of the switched homogeneous polynomial Lyapunov function increases.     

On the classification of geometric codes by polynomial functions

It is shown how to represent algebraically all functions that have a zero sum on all -dimensional subspaces ofPG(n,q) or ofAG(n,q). In this way one can calculate the dimensions of related codes, or one can represent interesting sets of points by functions.