On the determination and construction of optimal row-column designs having unequal row and column sizes

In this paper we consider experimental situations requiring usage of a row-column design where v treatments are to be applied to experimental units arranged in b ₁ rows and b ₂ columns where row i has size k _1i , i=1,..., b ₁ and column j has size k _2j , j=1,..., b ₂. Conditions analogous to those given in Kunert (1983, Ann. Statis., 11, 247–257) and Cheng (1978, Ann. Statist., 6, 1262–1272) are given which can often be used to establish the optimality of a given row-column design from the optimality of an associated block design. In addition, sufficient conditions are derived which guarantee the existence of an optimal row-column design which can be constructed by appropriately arranging treatments within blocks of an optimal block design.Visiting from the Indian Statistical Institute.     

Uniformly More Powerful, Two-Sided Tests for Hypotheses about Linear Inequalities

Let Xhave a multivariate, p-dimensional normal distribution (p 2) with unknown mean and known, nonsingular covariance . Consider testing H ₀ : b _i 0, for some i = 1,..., k, and b _i 0, for some i = 1,..., k, versus H ₁ : b _i < 0, for all i = 1,..., k, or b _i < 0, for all i = 1,..., k, where b ₁,..., b _k , k 2, are known vectors that define the hypotheses and suppose that for each i = 1,..., k there is an j {1,..., k} (j will depend on i) such that b _i b _j 0. For any 0 < < 1/2. We construct a test that has the same size as the likelihood ratio test (LRT) and is uniformly more powerful than the LRT. The proposed test is an intersection-union test. We apply the result to compare linear regression functions.     

A Load-Balanced Network with Two Servers

A load-balanced network with two queues Q ₁ and Q ₂ is considered. Each queue receives a Poisson stream of customers at rate _i , i=1,2. In addition, a Poisson stream of rate arrives to the system; the customers from this stream join the shorter of two queues. After being served in the ith queue, i=1,2, customers leave the system with probability 1–p _i ^*, join the jth queue with probability p(i,j), j=1,2, and choose the shortest of two queues with probability p(i,{1,2}). We establish necessary and sufficient conditions for stability of the system.     

The dependence on parameters of the modulus problem for families of several classes of curves

Let, where A={a₁,..., a_n} and B={b₁,...,b_m} are systems of distinguished points, and let H be a family of homotopic classes H_i, i=1, ..., j + m, of closed Jordan curves in C, where the classes H_j+, =1, ..., m, consist of curves that are homotopic to a point curve in b. Let ={₁,...,_j+m} be a system of positive numbers. By P=P(,A,B) we denote the extremal-metric problem for the family H and the numbers : for the modulusU=U(,A,B) of this problem we have the equality , whereD ^*={D ₁ ^* ,...,D _j+m ^* } is a system of domains realizinga maximum for the indicated sum in the family of all systemsD={D ₁,...,D _j+m } of domains, associated with the family H (byU(D _i )) we denote the modulus of the domain D_i, associated with the class H_i). In the present paper we investigate the manner in whichU=U(,A,B) and the moduliU=(D ₁ ^* ) depend on the parameters _i, a_k, b; moreover, we consider the conditions under which some of the doubly connected domains D _i ^* ,i=1,...,j, from the system D^* turn out to be degenerate (Theorems 1–3). In particular, one obtains an expression for the gradient of the function M, as function of the parameter a=a_k (Theorem 4). One gives some applications of the obtained results (Theorem 5).Translated from Zapiski Nauchnykh Seminarov Leningradskogo Otdeleniya Matematicheskogo Instituta im. V. A. Steklova AN SSSR, Vol. 144, pp. 136–148, 1985.     

An Efficient Algorithm for the Knapsack Sharing Problem

The Knapsack Sharing Problem (KSP) is an NP-Hard combinatorial optimization problem, admitted in numerous real world applications. In the KSP, we have a knapsack of capacity c and a set of n objects, namely N, where each object j, j = 1,...,n, is associated with a profit p _j and a weight w _j. The set of objects N is composed of m different classes of objects J _i, i = 1,...,m, and N = ^m _i=1 J _i. The aim is to determine a subset of objects to be included in the knapsack that realizes a max-min value over all classes.In this article, we solve the KSP using an approximate solution method based upon tabu search. First, we describe a simple local search in which a depthparameter and a tabu list are used. Next, we enhance the algorithm by introducing some intensifying and diversifying strategies. The two versions of the algorithm yield satisfactory results within reasonable computational time. Extensive computational testing on problem instances taken from the literature shows the effectiveness of the proposed approach.     

On a Turán type problem of Erdös

Let L ^k be the graph formed by the lowest three levels of the Boolean lattice B _k , i.e.,V(L ^k )={0, 1,...,k, 12, 13,..., (k–1)k} and 0is connected toi for all 1ik, andij is connected toi andj (1i<jk).It is proved that if a graph G overn vertices has at leastk ^3/2 n ^3/2 edges, then it contains a copy of L ^k .Research supported in part by the Hungarian National Science Foundation under Grant No. 1812     

On a conjecture concerningk-Hamilton-nice sequences

In this paper, we prove that a non-negative rational number sequence (a ₁,a ₂, ...,a _k+1) isk-Hamilton-nice, if (1)a _k+12, and (2) _j ^=1/h (i _j –1)k–1 implies for arbitraryi ₁,i ₂,...i _h {1,2,... ,k}. This result was conjectured by Guantao Chen and R.H. Schelp, and it generalizes several well-known sufficient conditions for graphs to be Hamiltonian.This project is supported by the National Natural Science Foundation of China.     

Some sufficient conditions for the E- and MV-optimality of block designs having blocks of unequal size

Summary In this paper we consider experimental situations in which ν treatments are to be tested inb blocks whereb _i blocks containk _i experimental units,i=1,...,p, k ₁<k ₂<...<k _p . The idea of a group divisible (GD) design is extended to that of a group divisible design with unequal block sizes (GDUB design) and then a number of results concerning the E- and MV-optimality of GD designs are generalized to the case of GDUB designs.     

A convexity-preservingC 2 parametric rational cubic interpolation

Summary AC ² parametric rational cubic interpolantr(t)=x(t) i+y(t) j,t[t ₁,t _n] to data S={(x_j, y_j)|j=1,...,n} is defined in terms of non-negative tension parameters _j ,j=1,...,n–1. LetP be the polygonal line defined by the directed line segments joining the points (x _j ,y _j ),t=1,...,n. Sufficient conditions are derived which ensure thatr(t) is a strictly convex function on strictly left/right winding polygonal line segmentsP. It is then proved that there always exist _j ,j=1,...,n–1 for whichr(t) preserves the local left/righ winding properties of any polygonal lineP. An example application is discussed.This research was supported in part by the natural Sciences and Engineering Research Council of Canada.     

Componentwise estimation of ordered parameters ofk (≥2) exponential populations

We consider the estimation of ordered parameters ofk ( 2) exponential distributions by improving upon the usual estimators. TheBrewsterzidek technique is used to find sufficient conditions for an estimator of _i and/or _i (i=1,...,k), to be inadmissible with respect to the MSE criterion where _i and _i are the location and scale parameters respectively of thei-th exponential population. Using these sufficient conditions improved estimators of _i and/or _i (i=1,...,k) are obtained.     

Mixed block designs

Let V_i (i = 1, 2) be a set of size v_i. Let D be a collection of ordered pairs (b₁, b₂) where b_i is a k_i-element subset of V_i. We say that D is a mixed t-design if there exist constants λ _(j,j2), (0 ≤ j_i ≤ k_i, j₁ + j₂ ≤ t) such that, for every choice of a j₁-element subset S₁ of V₁ and every choice of a j₂-element subset S₂ of V₂, there exist exactly λ_(j1,j2) ordered pairs (b₁, b₂) in D satisfying S₁ ⊆ b₁ and S₂ ⊆ b₂. In W. J. Martin [Designs in product association schemes, submitted for publication], Delsarte's theory of designs in association schemes is extended to products of Q-polynomial association schemes. Mixed t-designs arise as a particularly interesting case. These include symmetric designs with a distinguished block and α-resolvable balanced incomplete block designs as examples. The theory in the above-mentioned paper yields results on mixed t-designs analogous to those known for ordinary t-designs, such as the Ray-Chaudhuri/Wilson bound. For example, the analogue of Fisher's inequality gives |D| ≥ v₁ + v₂ − 1 for mixed 2-designs with Bose's condition on resolvable designs as a special case. Partial results are obtained toward a classification of those mixed 2-designs D with |D| = v₁ + v₂ − 1. The central result of this article is Theorem 3.1, an analogue of the Assmus–Mattson theorem which allows us to construct mixed (t + 1 − s)-designs from any t-design with s distinct block intersection numbers. © 1998 John Wiley & Sons, Inc. J Combin Designs 6:151–163, 1998     

Utilizing Shelve Slots: Sufficiency Conditions for Some Easy Instances of Hard Problems

In this paper we present a minimal set of conditions sufficient to assure the existence of a solution to a system of nonnegative linear diophantine equations. More specifically, suppose we are given a finite item set U = {u₁, u₂, . . . , u_k} together with a "size" v_i ≡ v(u_i) ∈ Z⁺, such that v_i ≠ v_j for i ≠ j, a "frequency" a_i ≡ a(u_i) ∈ Z⁺, and a positive integer (shelf length) L ∈ Z⁺ with the following conditions: (i) L = ∏ⁿ_j=1p_j(p_j ∈ Z⁺ ∀j, p_j ≠ p_l for j ≠ l) and v_i = ∏ _j∈Aip_j, A_i ⊆ {l, 2, . . . , n} for i = 1, . . . , n; (ii) (A_i\{⋂^k_j=1A_j}) ∩ (A_l\{⋂^k_j=1A_j}) = ⊘∀i ≠ l. Note that v_i|L (divides L) for each i. If for a given m ∈ Z⁺, ∑ⁿ_i=1a_iv_i = mL (i.e., the total size of all the items equals the total length of the shelf space), we prove that conditions (i) and (ii) are sufficient conditions for the existence of a set of integers {b₁₁, b₁₂, . . . , b_1m, b₂₁, . . . , b_n1, . . . , b_nm}⊆ N such that ∑^m_j=1b_ij = a_i, i = 1, . . . , k, and ∑^k_i=1b_ijv_i = L, j =1, . . . , m (i.e., m shelves of length L can be fully utilized). We indicate a number of special cases of well known NP-complete problems which are subsequently decided in polynomial time.     

An analog of the fundamental theorem of arithmetic in ordered groupoids

In the note we consider ordered groupoids with the Riesz interpolation property, that is, ifa _i ≤b _j (i, j=1,2), then there exists ac such thata _i ≤c≤b _j (i, j=1,2). For such groupoids possessing the descending chain condition for the positive cone and the property

A form of multivariate gamma distribution

Let V _i, i=1,..., k, be independent gamma random variables with shape i, scale , and location parameter i, and consider the partial sums Z ₁=V ₁, Z ₂=V ₁+V ₂,..., Z _k=V ₁+...+V _k. When the scale parameters are all equal, each partial sum is again distributed as gamma, and hence the joint distribution of the partial sums may be called a multivariate gamma. This distribution, whose marginals are positively correlated has several interesting properties and has potential applications in stochastic processes and reliability. In this paper we study this distribution as a multivariate extension of the three-parameter gamma and give several properties that relate to ratios and conditional distributions of partial sums. The general density, as well as special cases are considered.     

Boundary value problem with normal derivatives for a higher-order elliptic equation on the plane

For an elliptic operator of order 2l with constant (and only leading) real coefficients, we consider a boundary value problem in which the normal derivatives of order (k _j ?1), j = 1,..., l, where 1 ≤ k ₁ < ··· < k _l, are specified. It becomes the Dirichlet problem for kj = j and the Neumann problem for k _j = j + 1. We obtain a sufficient condition for the Fredholm property of which problem and derive an index formula.     

The view-obstruction problem for 3-dimensional spheres

LetC be ann-dimensional sphere with diameter 1 and center at the origin inE ⁿ . The view-obstruction problem forn-dimensional spheres is to determine a constant ν(n) to be the lower bound of those α for which any half-lineL, given byx _i =a _i t (i=1,2,...,n) where parametert≥0 anda _i (i=1,2,...,n) are positive real numbers, intersects

Optimality Conditions for Vector Optimization Problems of a Difference of Convex Mappings

In this paper, we study optimality conditions for vector optimization problems of a difference of convex mappings

Old and new designs via difference multisets and strong difference families

Let X =((x_1,1,x_1,2,…,x_1,k),(x_2,1,x_2,2,…,x_2,k),…,(x_t,1,x_t,2,…,x_t,k)) be a family of t multisets of size k defined on an additive group G. We say that X is a t-(G,k,μ) strong difference family (SDF) if the list of differences (x_h,i-x_h,j∣h=1,…,t;i≠ j) covers all of G exactly μ times. If a SDF consists of a single multiset X, we simply say that X is a (G,k,μ) difference multiset. After giving some constructions for SDF's, we show that they allow us to obtain a very useful method for constructing regular group divisible designs and regular (or 1-rotational) balanced incomplete block designs. In particular cases this construction method has been implicitly used by many authors, but strangely, a systematic treatment seems to be lacking. Among the main consequences of our research, we find new series of regular BIBD's and new series of 1-rotational (in many cases resovable) BIBD's.     

The Minimum Covering l pb -Hypersphere Problem

The minimu vering hypersphere problem is defined as to find a hypersphere of minimum radius enclosing a finite set of given points in ⁿ. A hypersphere is a set S(c,r)={x ⁿ : d(x,c) r}, where c is the center of S, r is the radius of S and d(x,c) is the Euclidean distance between x and c, i.e.,d(x,c)=l ₂ (x-c). We consider the extension of this problem when d(x, c) is given by any l _pb -norm, where 1<p and b=(b ₁,...,b _n ) with b _j >0, j=1,...,n, then S(c,r) is called an l _pb -hypersphere, in particular for p=2 and b _j =1, j=1,..., n, we obtain the l ₂-norm. We study some properties and propose some primal and dual algorithms for the extended problem , which are based on the feasible directions method and on the Wolfe duality theory. By computational experiments, we compare the proposed algorithms and show that they can be used to approximate the smallest l _pb -hypersphere enclosing a large set of points in ⁿ.     

Steiner systems andn −1-isomorphisms

In this work we introduce the concept of n ^–1-isomorphism between Steiner systems (this coincides with the concept of isomorphism whenever n=1).Precisely two Steiner systems S₁ and S₂ are said to be n^–1-isomorphic if there exist n partial systems S _i ⁽¹⁾ ,...,S _i ⁽ⁿ⁾ contained in Si, i.{1,2},such that S ₁ ^(k) and S ₂ ^(k) are isomorphic for each k{1,..., n}.The n^–1-isomorphisms are also used to study nets replacements, see Ostrom [8], and to study the transformation methods of designs and other incidence structures introduced in [9] and generalized in [1] and [10].Work done under the auspicies of G.N.S.A.G.A. supported by 40% grants of M.U.R.S.T.