Consider search designs for searching one nonzero 2- or 3-factor interaction under the search linear model. In the noisy case, search probability is given by Shirakura et al. (Ann. Statist. 24(6) (1996) 2560). In this paper some new properties of the searching probability are presented. New properties of the search probability enable us to compare designs, which depend on an unknown parameter ?...

We introduce strong separation axioms in bitopological spaces. We also introduce the notion of strong pairwise compactness.

New lower bounds for 15 classical Ramsey numbers are established. Several of the colorings are found using a new variation of local search heuristics. Several others are found using known colorings as building blocks. AMS Subject Classifications: 05D10, 05D04

Suppose that a policyholder faces $n$ risks X1, ..., Xn which are insured under the policy limit with the total limit of l. Usually, the policyholder is asked to protect each Xi with an arbitrary limit of li such that ∑ni=1li=l. If the risks are independent and identically distributed with log-concave cumulative distribution function, using the notions of majorization and stochastic orderings, ...

The existence question for the family of 4-(15, 5, λ) designs has long been answered for all values of λ except λ = 2. Here, we resolve this last undecided case and prove that 4-(15, 5, 2) designs are constructible.

MT research requires cooperation between engineers and linguists. It is important, therefore, to develop a uniform linguistic terminology that can be understood and used by engineers. Furthermore, it is necessary that linguists develop an understanding of the engineering problems involved. The results of cooperation between linguists and engineers working with the MT Pilot Model at the Universi...

For two graphs $mathrm{G}$ and $mathrm{H}$ with $n$ and $m$ vertices, the corona $mathrm{G}circmathrm{H}$ of $mathrm{G}$ and $mathrm{H}$ is the graph obtained by taking one copy of $mathrm{G}$ and $n$ copies of $mathrm{H}$ and then joining the $i^{th}$ vertex of $mathrm{G}$ to every vertex in the $i^{th}$ copy of $mathrm{H}$. The neighborhood corona $mathrm{G}starmathrm{H}$ of $mathrm{G}$ and $...