Choice under complete uncertainty when outcome spaces are state dependent

One central objection to the maximin payoff criterion is that it focuses on the state that yields the lowest payoffs regardless of how low these are. We allow different states to have different sets of possible outcomes and show that the original axioms of Milnor (1954) continue to characterize the maximin payoff criterion, provided that the sets of payoffs achievable across states overlap. If instead payoffs in some states are always lower than in all others then ignoring the “bad” states is no longer inconsistent with these axioms. Similar dependence on overlap of outcome spaces across states holds for the minimax regret and maximin joy criteria.      

Constructing 1-rotational NRDFs through an optimization approach: new (46,9,8), (51,10,9) and (55,9,8)-NRBDs

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 resolvable difference families which lead to an equal number of new 1-rotational near resolvable block designs with parameters: (46,9,8), (51,10,9) and (55,9,8). Our results indicate that this conjunction outperforms both scatter search and tabu search.     

The Multivariate Randomized Complete Block Design: A Novel Permutation Solution in Case of Ordered Categorical Variables

In this article, multivariate extensions of the combination-based test statistics for the comparison of several treatments in the multivariate Randomized Complete Block designs are introduced in case of categorical response variables. Several tests for the multivariate Randomized Complete Block designs, including MANOVA procedure, are compared with the method proposed via a Monte Carlo simulation study. The method has also been applied to a real case study in the field of sensorial testing studies. Results suggest that in each experimental situation where normality of the supposed underlying continuous model is hard to justify and especially when errors have heavy-tailed distributions, the proposed nonparametric procedure can be considered as a valid solution.     

Increasing the sample size at interim for a two‐sample experiment without Type I error inflation

For the case of a one‐sample experiment with known variance σ²=1, it has been shown that at interim analysis the sample size (SS) may be increased by any arbitrary amount provided: (1) The conditional power (CP) at interim is ?50% and (2) there can be no decision to decrease the SS (stop the trial early). In this paper we verify this result for the case of a two‐sample experiment with proportional SS in the treatment groups and an arbitrary common variance. Numerous authors have presented the formula for the CP at interim for a two‐sample test with equal SS in the treatment groups and an arbitrary common variance, for both the one‐ and two‐sided hypothesis tests. In this paper we derive the corresponding formula for the case of unequal, but proportional SS in the treatment groups for both one‐sided superiority and two‐sided hypothesis tests. Finally, we present an SAS macro for doing this calculation and provide a worked out hypothetical example. In discussion we note that this type of trial design trades the ability to stop early (for lack of efficacy) for the elimination of the Type I error penalty. The loss of early stopping requires that such a design employs a data monitoring committee, blinding of the sponsor to the interim calculations, and pre‐planning of how much and under what conditions to increase the SS and that this all be formally written into an interim analysis plan before the start of the study. Copyright © 2009 John Wiley & Sons, Ltd.     

New combinatorial structures with applications to efficient group testing with inhibitors

Group testing with inhibitors (GTI) is a variant of classical group testing where in addition to positive items and negative items, there is a third class of items called inhibitors. In this model the response to a test is YES if and only if the tested group of items contains at least one positive item and no inhibitor. This model of group testing has been introduced by Farach et al. (Proceedings of compression and complexity of sequences, pp 357–367, 1997) for applications in the field of molecular biology. In this paper we investigate the GTI problem both in the case when the exact number of positive items is given, and in the case when the number of positives is not given but we are provided with an upper bound on it. For the latter case, we present a lower bound on the number of tests required to determine the positive items in a completely nonadaptive fashion. Also under the same hypothesis, we derive an improved lower bound on the number of tests required by any algorithm (using any number of stages) for the GTI problem. As far as it concerns the case when the exact number of positives is known, we give an efficient trivial two-stage algorithm. Instrumental to our results are new combinatorial structures introduced in this paper. In particular we introduce generalized versions of the well known superimposed codes (Du, D.Z., Hwang, F.K. in Pooling designs and nonadaptive group testing, 2006; Dyachkov, A.G., Rykov, V.V. in Probl. Control Inf. Theory 12:7–13, 1983; Dyachkov, A.G., et al. in J. Comb. Theory Ser. A 99:195–218, 2002; Kautz, W.H., Singleton, R.R. in IEEE Trans. Inf. Theory 10:363–377, 1964) and selectors (Clementi, A.E.F, et al. in Proceedings of symposium on discrete algorithms, pp. 709–718, 2001; De Bonis, A., et al. in SIAM J Comput. 34(5):1253–1270, 2005; Indyk, P. in Proceedings of symposium on discrete algorithms, pp. 697–704, 2002) that we believe to be of independent interest.     

互联网技术在艺术设计专业毕业设计辅导中的应用

针对当前毕业生就业所面临的压力,必须充分利用互联网技术辅导艺术设计专业学生的毕业设计,进一步提高毕业设计的质量,同时给毕业生一个充分的就业实习机会,切实解决毕业生毕业与就业过程的有效衔接问题。     

Efficient crossover designs in the presence of interactions between direct and carry-over treatment effects

Crossover designs, or repeated measurements designs, are used for experiments in which t treatments are applied to each of n experimental units successively over p time periods. Such experiments are widely used in areas such as clinical trials, experimental psychology and agricultural field trials. In addition to the direct effect on the response of the treatment in the period of application, there is also the possible presence of a residual, or carry-over, effect of a treatment from one or more previous periods. We use a model in which the residual effect from a treatment depends upon the treatment applied in the succeeding period; that is, a model which includes interactions between the treatment direct and residual effects. We assume that residual effects do not persist further than one succeeding period.A particular class of strongly balanced repeated measurements designs with n=t² units and which are uniform on the periods is examined. A lower bound for the A-efficiency of the designs for estimating the direct effects is derived and it is shown that such designs are highly efficient for any number of periods p=2,…,2t.     

On a class of variance balanced incomplete block designs

In this paper variance balanced incomplete block designs have been constructed for situations when suitable BIB designs do not exist for a given number of treatments, because of the contraints bk=vr, λ(v-1) = r(k-l). These variance balanced designs are in unequal block sizes and unequal replications.     

Minimum,maximum, and average spherical prediction variances for central composite and box-behnken designs

Single value design optimality criteria are often considered when selecting a response surface design. An alternative to a single value criterion is to evaluate prediction variance properties throughout the experimental region and to graphically display the results in a variance dispersion graph (VDG) (Giovannitti-Jensen and Myers (1989)). Three properties of interest are the spherical average, maximum, and minimum prediction variances. Currently, a computer-intensive optimization algorithm is utilized to evaluate these prediction variance properties. It will be shown that the average, maximum, and minimum spherical prediction variances for central composite designs and Box-Behnken designs can be derived analytically. These three prediction variances can be expressed as functions of the radius and the design parameters. These functions provide exact spherical prediction variance values eliminating the implementation of extensive computing involving algorithms which do not guarantee convergence. This research is concerned with the theoretical development of these analytical forms. Results are presented for hyperspherical and hypercuboidal regions.     

Circular balanced repeated measurements designs

The concept of a circular design is defined and when proper balance for various effects is assumed, its universal optimality is proved over the class of all designs with the same set of parameters, Such designs are shown to minimize the variance of the best linear unbiased estimators of contrasts of residual and direct effects over the class of equireplicated designs. All models assume first order residual effects and are of a circular nature. The proofs are presented in a unified manner for several models at a time. They are based on certain matrix domination which occurs when parameters are eliminated from a linear modelj this latter fact is proved for a general linear model.