In this paper, we solve the sum mean-squared error (MSE)optimal 1-bit quantized precoding problem exactly for smallto-moderate sized multiuser multiple-input multiple-output (MU-MIMO) systems via branch and bound. To this end, we reformulate the original NP-hard precoding problem as a tree search and deploy a number of strategies that improve the pruning efficiency without sacrificing optimalit...

Many algorithms suppress skeleton associated with boundary perturbation by preventing their formation or by costly branch pruning. This work proposes a novel concept of structural and textural skeletons. The former is associated with the general shape structure and the latter with boundary perturbations. These skeletons remain disconnected to facilitate gross shape matching without the need for...

The purpose of this study was to determine the effect branch pruning and tuber weight on growth yield potato. research carried out from April July 2021 in Mberas Hamlet, Tukul Village, Sumber District, Probolinggo Regency. This conducted using a factorial randomized block design method with two factors. first factor secondary branches which consisted 4 treatment levels. second seed tubers 3 Var...

The effect of four different levels of irrigation periods, including normal irrigation, irrigation after 100, 150, and 200mm evaporation, with three different bio-fertilizer including control, Mycorrhiza, and Rhizobium were investigated on morphological and yield traits of guar. The experiment was conduct in form of split-plot design with irrigation periods as main plots and bio-fertilizers as ...

We consider the problem of separating two distinct classes of k similar sequences of length n over an alphabet of size s that have been optimally multi-aligned. An objective function based on minimizing the consensus score of the separated halves is introduced and we present an O(k3n) heuristic algorithm and two optimal branch-and-bound algorithms for the problem. The branch-and-bound algorithm...

in order to investigate the effect of concentration, time and consumption instruction of seaweed on some morphological characteristics of root and shoots of safflower, the present experiment in factorial form in a completely randomized design with three replications in research greenhouse of agriculture faculty, ferdowsi university of mashhad was conducted in 2014-15. factors examined included ...

in order to study of nitrogen application time and seed inoculation with plant growth promotingrhizobacteria on yield, fertilizer use efficiency and grain filling rate of sunflower, a factorial experimentwas conducted based on randomized complete block design with three replications in research farm ofislamic azad university, ardabil branch in 2011. the first factor was time of nitrogen applica...

in order to study the effect of bio-fertilizers  in decrease the effects of water stress on yield, yield components and oil percentage of goldasht spring safflower cultivars (carthamus tinctorius l.), an experiment on split plot in a randomized complete block design with three replications was carried out  in 2012 at the agricultural research station of islamic azad university of roudehen branc...

The multiple knapsack problem (MKP) is a classical combinatorial optimization problem. A recent algorithm for some classes of the MKP is bin-completion, a bin-oriented, branch-and-bound algorithm. In this paper, we propose path-symmetry and path-dominance criteria for pruning nodes in the MKP branch-and-bound search space. In addition, we integrate the “bound-and-bound” upper bound validation t...

Similarity search on time series is a frequent operation in large-scale data-driven applications. Sophisticated similarity measures are standard for time series matching, as they are usually misaligned. Dynamic Time Warping or DTW is the most widely used similarity measure for time series because it combines alignment and matching at the same time. However, the alignment makes DTW slow. To spee...