On the asymptotic existence of cocyclic Hadamard matrices

Let q be an odd natural number. We prove there is a cocyclic Hadamard matrix of order ²10+tq whenever . We also show that if the binary expansion of q contains N ones, then there is a cocyclic Hadamard matrix of order ²4N−2q.     

The Existence of Partitioned Generalized Balanced Tournament Designs with Block Size 3

A generalized balanced tournament design, GBTD(n, k), defined on a kn-set V, is an arrangement of the blocks of a (kn, k, k – 1)-BIBD defined on V into an n × (kn – 1) array such that (1) every element of V is contained in precisely one cell of each column, and (2) every element of V is contained in at most k cells of each row. Suppose we can partition the columns of a GBTD(n, k) into k + 1 sets B1, B2,..., Bk + 1 where |Bi| = n for i = 1, 2,..., k – 2, |Bi| = n–1 for i = k – 1, k and |Bk+1| = 1 such that (1) every element of V occurs precisely once in each row and column of Bi for i = 1, 2,..., k – 2, and (2) every element of V occurs precisely once in each row and column of Bi Bk+1 for i = k – 1 and i = k. Then the GBTD(n, k) is called partitioned and we denote the design by PGBTD(n, k). The spectrum of GBTD(n, 3) has been completely determined. In this paper, we determine the spectrum of PGBTD(n,3) with, at present, a fairly small number of exceptions for n. This result is then used to establish the existence of a class of Kirkman squares in diagonal form.     

Optimum covariate designs in a binary proper equi-replicate block design set-up

The choice of covariates values for a given block design attaining minimum variance for estimation of each of the regression parameters of the model has attracted attention in recent times. In this article, we consider the problem of finding the optimum covariate design (OCD) for the estimation of covariate parameters in a binary proper equi-replicate block (BPEB) design model with covariates, which cover a large class of designs in common use. The construction of optimum designs is based mainly on Hadamard matrices.     

A new approach with orthogonal array for global optimization in design of experiments

In this paper, we develop an approach that determines the overall best parameter setting in design of experiments. The approach starts with successive orthogonal array experiments and ends with a full factorial experiment. The setup for the next orthogonal-array experiment is obtained from the previous one by either fixing a factor at a given level or by reducing the number of levels considered for all currently non-fixed factors. We illustrate this method using an industrial problem with seven parameters, each with three levels. In previous work, the full factorial of 3⁷ = 2,187 points was evaluated and the best point was found. With the new method, we found the same point using 3% of these evaluations. As a further comparison, we obtained the optimum using a traditional Taguchi approach, and found it corresponded to the 366th of the 2,187 possibilities when sorted by the objective function. We conclude the proposed approach would provide an accurate, fast, and economic tool for optimization using design of experiments.     

On the Characterisation of AG(n,q) by its Parameters asa Nearly Triply Regular Design

We show that a non-symmetric nearly triply regular designD with and in which every line has at least q points is AG(n,q) for prime power q > 2 and positiveinteger n 3.     

Some open problems in the design and use of modern production systems

During the past two decades, manufacturing systems have moved towards automation, integration and modularity. These trends will certainly continue in the future due to the constraints of the market and to evolution of resources and worker requirements. As a consequence, the design and use of manufacturing systems are increasingly expensive. Numerous methods and tools have been developed to face up to this situation, but some complementary aids could be provided for designers and manufacturing engineers. The goal of this paper is to present important open problems whose solutions could certainly significantly improve the design and use of modern production systems.     

Some integer programs arising in the design of main frame computers

In this paper we describe and discuss a problem that arises in the (global) design of a main frame computer. The task is to assign certain functional units to a given number of so called multi chip modules or printed circuit boards taking into account many technical constraints and minimizing a complex objective function. We describe the real world problem. A thorough mathematical modelling of all aspects of this problem results in a rather complicated integer program that seems to be hopelessly difficult — at least for the present state of integer programming technology. We introduce several relaxations of the general model, which are alsoNP-hard, but seem to be more easily accessible. The mathematical relations between the relaxations and the exact formulation of the problem are discussed as well.On leave from University of São Paulo, Brazil.     

On structuring problems of job design met in the development and maintenance of information systems

In the development and maintenance of information systems data processing tasks are assigned either to a computer or to a man. In this paper we consider five decisions made during the development phase. These decisions have an influence on the contents of jobs: 1. distribution of work between man and computer, 2. construction of man-computer interface, 3. grouping tasks into jobs, 4. design of control part of new information system, 5. assignment of people to jobs.During the use of an information system both the person and his job will change. Here various combinations of changes in a person-job pair are classified and analyzed.This research has been supported by the Academy of Finland.     

Definition of the feasible solution set in multicriteria optimization problems with continuous, discrete, and mixed design variables

Engineering optimization problems are multicriteria with continuous, discrete, and mixed design variables. Correct definition of the feasible solution set is of fundamental importance in these problems. It is quite difficult for the expert to define this set. For this reason, the results of searching for optimal solutions frequently have no practical meaning. Furthermore, correct definition of this set makes it possible to significantly reduce the time of searching for optimal solutions. This paper describes construction of the feasible solution set with continuous, discrete, and mixed design variables on the basis of Parameter Space Investigation (PSI) method.