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 ?...

A highly efficient unbiased global optimization method called dynamic lattice searching (DLS) was proposed. The method starts with a randomly generated local minimum, and finds better solution by a circulation of construction and searching of the dynamic lattice (DL) until the better solution approaches the best solution. The DL is constructed adaptively based on the starting local minimum by s...

Present peer-to-peer (P2P) file distribution methods in mobile ad hoc networks (MANETs) can be divided into three categories: local broadcasting based advertisement (push) and discovery (pull)-based and contact-based. The first two techniques can simply be time consuming and low ability to accommodate when the demand grows higher. They are mainly developed for linked MANETs, in which end-to-end...