Sampling with partial enumeration from bivariate populations

In multi-character surveys, determination of sample sizes for studying various characters poses a difficult problem. In some situations, instead of observing the same units for all the characters it may be desirable to have some units observed for all the characters whereas some extra units for each character are observed separately. Such type of sampling has been defined here as sampling with partial enumeration. In the present investigation the efficiency of sampling with partial enumeration has been examined as compared to the usual two phase sampling for the study of only two characters.     

Hierarchical Bayesian models to assess between- and within-batch variability of pathogen contamination in food

Assessing within-batch and between-batch variability is of major interest for risk assessors and risk managers in the context of microbiological contamination of food. For example, the ratio between the within-batch variability and the between-batch variability has a large impact on the results of a sampling plan. Here, we designed hierarchical Bayesian models to represent such variability. Compatible priors were built mathematically to obtain sound model comparisons. A numeric criterion is proposed to assess the contamination structure comparing the ability of the models to replicate grouped data at the batch level using a posterior predictive loss approach. Models were applied to two case studies: contamination by Listeria monocytogenes of pork breast used to produce diced bacon and contamination by the same microorganism on cold smoked salmon at the end of the process. In the first case study, a contamination structure clearly exists and is located at the batch level, that is, between batches variability is relatively strong, whereas in the second a structure also exists but is less marked.     

Computing monotone disjoint paths on polytopes

The Holt-Klee Condition states that there exist at least d vertex-disjoint strictly monotone paths from the source to the sink of a polytopal digraph consisting of the set of vertices and arcs of a polytope P directed by a linear objective function in general position. The study of paths on polytopal digraphs stems from a long standing problem, that of designing a polynomial-time pivot method, or proving none exists. To study disjoint paths it would be useful to have a tool to compute them. Without explicitly computing the digraph we develop an algorithm to compute a maximum cardinality set of source to sink paths in a polytope, even in the presence of degeneracy. The algorithm uses a combination of networks flows, the simplex method, and reverse search. An implementation is available.     

On approximating point spread distributions

We discuss some properties of the point spread distribution, defined as the distribution of the difference of two independent binomial random variables with the same parameter n including exact and approximate probabilities and related optimization issues. We use various approximation techniques for different distributions, special functions, and analytic, combinatorial and symbolic methods, such as multi-summation techniques. We prove that in case of unequal success rates, if these rates change with their difference kept fixed and small, and n is appropriately bounded, then the point spread distribution only slightly changes for small point differences. We also prove that for equal success rates p, the probability of a tie is minimized if p=1/2. Numerical examples are included for the case with n=12.     

A Queueing Theoretic Approach to Set Staffing Levels in Time‐Dependent Dual‐Class Service Systems*

This article addresses the optimal staffing problem for a nonpreemptive priority queue with two customer classes and a time‐dependent arrival rate. The problem is related to several important service settings such as call centers and emergency departments where the customers are grouped into two classes of “high priority” and “low priority,” and the services are typically evaluated according to the proportion of customers who are responded to within targeted response times. To date, only approximation methods have been explored to generate staffing requirements for time‐dependent dual‐class services, but we propose a tractable numerical approach to evaluate system behavior and generate safe minimum staffing levels using mixed discrete‐continuous time Markov chains (MDCTMCs). Our approach is delicate in that it accounts for the behavior of the system under a number of different rules that may be imposed on staff if they are busy when due to leave and involves explicitly calculating delay distributions for two customer classes. Ultimately, we embed our methodology in a proposed extension of the Euler method, coined Euler Pri, that can cope with two customer classes, and use it to recommend staffing levels for the Welsh Ambulance Service Trust (WAST).     

Types of stable network structures based on exhaustive search

Based on the works of Doreian [Doreian, P., 2006. Actor network utilities and network evolution. Social Networks 28, 137–164] and Xie and Cui [Xie, F., Cui, W., 2008b. A note on the paper ‘cost range and the stable network structures’. Social Networks 30, 102–103], the paper applies exhaustive search and inductive approaches to analyze possible transitions among isomeric social networks with five vertices. A total of seven types of stable network structures are identified, which include the complete, star, chain, cycle, near-chain, near-cycle and null graphs. Then, a modified theorem for the equilibrium forms which corrects the previous work is presented.     

标号有向块的计数

根据图的计数中的基本定理和标号计数引理,利用标号有向图的指数型生成函数,讨论了标号有向连通图和标号有向块的计数问题。     

Algorithmic construction of optimal block designs for two-colour cDNA microarray experiments using the linear mixed effects model

ABSTRACT

In this study, methods for efficient construction of A-, MV-, D- and E-optimal or near-optimal block designs for two-colour cDNA microarray experiments with array as the block effect are considered. Two algorithms, namely the array exchange and treatment exchange algorithms together with the complete enumeration technique are introduced. For large numbers of arrays or treatments or both, the complete enumeration method is highly computer intensive. The treatment exchange algorithm computes the optimal or near-optimal designs faster than the array exchange algorithm. The two methods however produce optimal or near-optimal designs with the same efficiency under the four optimality criteria.     

Optimal and efficient semi-Latin squares

An (n×n)/k$(n\times n)/k$semi-Latin square is an n×n square array in which nk distinct symbols (representing treatments) are placed in such a way that there are exactly k   symbols in each cell (row–column intersection) and each symbol occurs once in each row and once in each column. Semi-Latin squares form a class of row–column designs generalising Latin squares, and have applications in areas including the design of agricultural experiments, consumer testing, and via their duals, human–machine interaction. In the present paper, new theoretical and computational methods are developed to determine optimal or efficient (n×n)/k$(n\times n)/k$ semi-Latin squares for values of n and k for which such semi-Latin squares were previously unknown. The concept of subsquares of uniform semi-Latin squares is studied, new applications of the DESIGN package for GAP are developed, and exact algebraic computational techniques for comparing efficiency measures of binary equireplicate block designs are described. Applications include the complete enumeration of the (4×4)/k$(4\times 4)/k$ semi-Latin squares for k=2,…,10$k=2,\dots ,10$, and the determination of those that are A-, D-, and E-optimal, the construction of efficient (6×6)/k$(6\times 6)/k$ semi-Latin squares for k=4,5,6$k=4,5,6$, and counterexamples to a long-standing conjecture of R.A. Bailey and to a similar conjecture of D. Bedford and R.M. Whitaker.