In this article, optimization of a black box using designs of experiments is studied. There are two fundamental different branches in optimization using Design of Experiments; higher order Taylor expansions, i.e., response surface methodology, and underdetermined experimental designs, i.e., supersaturated designs. In this article, supersaturated designs are studied. Optimization using design of...

In most major search engines, the interface for image search is the same as traditional Web search: a keyword query followed by a paginated, ranked list of results. Although many image search innovations have appeared in both the literature and on the Web, few have seen widespread use in practice. In this work, we explore the differences between image and general Web search to better support us...

The project of upgrading the detector CMD-2 is presented. The upgraded detector is called CMD-2M and is going to take data with new collider VEPP-2000 at BINP. The general structure of the detector CMD-2 will remain as is but major parameters of the detector, such as momentum and angular resolution for charged particle and energy and spatial resolution for photons, will be substantially improved.

Adaptive designs have the potential to improve efficiency in the evaluation of new medical treatments in comparison to traditional fixed sample size designs. However, they are still not widely used in practice in clinical research. Little research has been conducted to investigate what adaptive designs are being undertaken. This review highlights the current state of registered adaptive designs...

The goal of this work is to develop an improved procedure for the solution of the lexicographic bottleneck variant of the assembly line balancing problem (LB-ALBP). The objective of the LB-ALBP is to minimize the workload of the most heavily loaded workstation, followed by the workload of the second most heavily loaded workstation and so on. This problem —recently introduced to the literature (...

Stochastic local search methods such as GSAT, WalkSAT and their variants have been used successfully at solving propositional satisfiability problems (SAT). The key operation in these local search algorithms is the speed of variable flipping. We present a parallel FPGA designs for CSAT capable of one flip per clock cycle which is achieved by exploiting maximal parallelism and “multi-try” pipeli...

We introduce a new global constraint which combines together a lexicographic ordering constraint with some sum constraints. Applications for this constraint include balanced incomplete block designs and the ternary Steiner problem. We develop an efficient linear time algorithm for propagating this constraint. This combination of constraints increases the filtering, leading to significant decrea...

Genetic algorithms are used to search for optimal structural topologies. Modifications to basic genetic algorithm techniques are implemented to increase computational efficiency, avoid premature convergence to a single solution, and solve new categories of problems. GA's are a search and optimization tool based on the principles of evolution and survival of the fittest. Potential designs are re...

for $q in {7,8,9,11,13,16}$, we consider the primitive actions of $l_2(q)$ and use key-moori method 1 as described in [codes, designs and graphs from the janko groups {$j_1$} and{$j_2$}, {em j. combin. math. combin. comput.}, {bf 40} (2002) 143--159., correction to: ``codes, designs and graphs from the janko groups{$j_1$} and {$j_2$}'' [j. combin. math. combin. comput. {bf 40} (2002) 143--159],...

In this paper we describe a backtrack search over parallel classes with a partial isomorph rejection to classify resolvable 2-(12, 6, 5c) designs. We use the intersection pattern between the parallel classes and the fact that any resolvable 2-(12, 6, 5c) design is also a resolvable 3-(12, 6, 2c) design to effectively guide the search. The method was able to enumerate all nonsimple resolutions a...