We solve the design spectrum problem for all theta graphs with 10, 11, 12, 13, 14 and 15 edges.

OVERVIEW . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 543 STRUCTURE OF GENERAL FACTORIAL DESIGNS . . . . . . . . . . . 543 SUITABLE CONFOUNDING RULES . . . . . . . . . . . . . . . . . . . . . 544 Design Factors . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 544 Block Factors . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 545 Gener...

Shape grammars play an important role in a new generation of tools for the analysis and design of products. Up until now there has been numerous attempts to create a general shape grammar interpreter, but most of the existing tools are either very specific in their purpose, have only limited functionality or were programmed for one operating system. In this work we present a tool named Shape Gr...

The R package planor enables the user to search for, and construct, factorial designs satisfying given conditions. The user specifies the factors and their numbers of levels, the factorial terms which are assumed to be non-zero, and the subset of those which are to be estimated. Both block and treatment factors can be allowed for, and they may have either fixed or random effects, as well as hie...

SUMMARY We present a tool called MRSD (Metabolic Route Search and Design) to search and design routes based on the weighted compound transform diagraph. The search submodule returns routes between a source and product compound within seconds in the network of one or multiple organisms based on data from KEGG. The design submodule designs a route from an appointed compound in an interactive mode...

In this paper we formulate the problem of constructing 1-rotational near resolvable difference families as a combinatorial optimization problem where a global optimum corresponds to a desired difference family. Then, we develop an algorithm based on scatter search in conjunction with a tabu search to construct many of these difference families. In particular, we construct three new near resolva...

Booth and Cox proposed the E(s) criterion for constructing twolevel supersaturated designs. Nguyen [Technometrics 38 (1996) 69– 73] and Tang and Wu [Canad. J. Statist 25 (1997) 191–201] independently derived a lower bound for E(s). This lower bound can be achieved only when m is a multiple of N − 1, where m is the number of factors and N is the run size. We present a method that uses difference...

In this paper, we propose a framework to systematically analyze the structural form and thematic content of codes of ethics related to Information and Communication Technology (ICT codes of ethics). Then we apply this framework, within a sample of 30 organizations. Our purpose is to assess the organizational ethical positioning advocated by these ICT codes of ethics, using an adaptation of Kohl...