A Note on an Input Control Model of a Predictive Regression Interval

A well-known problem of prediction in linear regression models is to find a confidence interval for the random value of the dependent variable when the values of the independent variables are given. Such a situation may arise in economic quality control models when the independent variables are costly inputs and the dependent variable is some measure of quality or production. In such a circumstance, an important control objective may be to find values for the inputs that will maximize the lower limit of the prediction confidence interval for a fixed budget, or alternatively, to minimize the cost of the inputs for a fixed lower limit of the confidence interval. In this paper, we shall show that global optima can be found using known algorithms. The special case of simple linear regression is discussed and an illustrative example is provided.     

A characterization of certain irreducible symplectic 4-folds

 We give a characterization of irreducible symplectic fourfolds which are given as Hilbert scheme of points on a K3 surface. Received: 26 June 2002 / Revised version: 9 September 2002 Published online: 14 February 2003 Mathematics Subject Classification (2000): Primary 14J32, Secondary 32Q20     

Machine assignment in a nonlinear multi-product flowline

A group of machines for processing a set of jobs in a manufacturing system is often located in a serial line. An efficient strategy for locating these machines such that the total travel distance or the cost of transporting the jobs is minimized is desired. In this research, the assumption of a linear line with equally spaced machine location is relaxed. This research addressed problems of locating unique machines. It is found that the machine distances possess unique properties in this type of a problem. Utilizing these properties, heuristic strategies are proposed to obtain efficient solution where optimal methods are expected to be computationally prohibitive. A lower bound for the optimum solution is also proposed. Results are encouraging.     

New Combinatorial Descriptions of the Triangulations of Cyclic Polytopes and the Second Higher Stasheff–Tamari Posets

This paper is concerned with the d-dimensional cyclic polytope with n vertices, C(n,d), and the set of its triangulations, S(n,d). We show that there is a bijection between S(n,d) and certain partitions of the set of increasing d-tuples on the integers 1 to n–1. We give a combinatorial characterization of the second higher Stasheff–Tamari poset, which is a partial ordering of S(n,d), and we determine its 2-dimension. There is a well-known representation of triangulations of an n-gon by right bracket vectors. We generalize this to cyclic polytopes of higher dimensions.     

On disjoint configurations in infinite graphs

For a graph A and a positive integer n, let nA denote the union of n disjoint copies of A; similarly, the union of ?₀ disjoint copies of A is referred to as ?₀A. It is shown that there exist (connected) graphs A and G such that nA is a minor of G for all n??, but ?₀A is not a minor of G. This supplements previous examples showing that analogous statements are true if, instead of minors, isomorphic embeddings or topological minors are considered. The construction of A and G is based on the fact that there exist (infinite) graphs G₁, G₂,… such that G_i is not a minor of G_j for all i ≠ j. In contrast to previous examples concerning isomorphic embeddings and topological minors, the graphs A and G presented here are not locally finite. The following conjecture is suggested: for each locally finite connected graph A and each graph G, if nA is a minor of G for all n ? ?, then ?₀A is a minor of G, too. If true, this would be a far‐reaching generalization of a classical result of R. Halin on families of disjoint one‐way infinite paths in graphs. © 2002 Wiley Periodicals, Inc. J Graph Theory 39: 222–229, 2002; DOI 10.1002/jgt.10016     

The Organization of Interaction Between Oil Refineries

The paper deals with the appropriate form of interaction between two refineries with different demand patterns. This problem can be formulated as finding a decentralized solution of linear programming problems linked by buying and selling activities. The complete problem is first solved for central values of product demands and costs and revenues. The structure of the basis then determines the organization of the interaction in terms of which unit sets quantities and which prices, or whether centralized decisions should be made. If, for expected values of product demand and costs, the structure of the basis is the same then the related organization of trading can be used for day-to-day transactions. For a well-known oil refinery model it is found that, for fairly large demand variations, decentralized interaction is effective, but that the structure of the basis changes easily with crude price variations, and that simulations did not converge for these variations.     

Influence of trans-cis photoisomerizations of solubilized compounds on transition temperatures in the system cetyltrimethylammonium bromide-water: Light-induced phase transitions

Transition temperatures (TN1) from the nematic lyotropic liquid-crystalline phase to the isotropic phase were measured for the system cetyltrimethylammonium bromide (CTAB) water in the presence of small amounts of 3-stilbene carboxylic acid (3SC), 4-stilbene carboxylic acid (4SC) and Δ2/2'-bi-(2H-l,4-benzothiazine) (BT). TNI, increases as a function of trans-3SC or trans-4SC concentration, ranging from 01 to 08 wt %, by up to 12°C. A further increase in TNI between 2 and 5°C can be achieved by photochemically converting the solubilized trans stilbene derivatives to the cis isomers. Irradiation of a trans-3SC containing sample at a temperature just above TNl leads to a light-induced phase transition to the lyotropic liquid-crystalline phase. Solubilization of trans-BT causes a slight decrease of TNI while photoisomerization to cis-BT increases T_NI by 1°C.