In this work, a new drilling and blasting design methodology is introduced and applied at a case study mine to improve productivity. For the case study copper mine, a blast diameter of 203 mm is proposed to be used in the ore zone to meet the new required production rate of 90mtpa from 75mtpa. Currently, the Konya and Walter’s model is used to generate drilling and blasting design at a bl...

MOTIVATION The BLAST program for comparing two sequences assumes independent sequences in its random model. The resulting random alignment matrices have correlations across their diagonals. Analytic formulas for the BLAST p-value essentially neglect these correlations and are equivalent to a random model with independent diagonals. Progress on the independent diagonals model has been surprising...

The purpose of this study was to evaluate the performance of porous vegetation concrete block made from blast furnace slag cement containing industrial by-products such as blast furnace slag aggregate and powder. The blocks were tested for void ratio, compressive strength and freeze-thaw resistance to determine the optimal mixing ratio for the porous vegetation block. An economic analysis of th...

A design of systolic array-based Field Programmable Gate Array (FPGA) parallel architecture for Basic Local Alignment Search Tool (BLAST) Algorithm is proposed. BLAST is a heuristic biological sequence alignment algorithm which has been used by bioinformatics experts. In contrast to other designs that detect at most one hit in one-clock-cycle, our design applies a Multiple Hits Detection Module...

This paper revisits the existence and construction problems for polygonal designs (a special class of partially balanced incomplete block designs associated with regular polygons). We present new polygonal designs with various parameter sets by explicit construction. In doing so we employ several construction methods – some conventional and some new. We also establish a link between a class of ...

In 1963, Shrikhande and Raghavarao [5] published a recursive construction for designs that starts with a resolvable design (the “master design”) and then uses a second design (“the indexing design”) to take certain unions of blocks in each parallel class of the master design. Several variations of this construction have been studied by different authors. We revisit this construction, concentrat...

We show that if G is a finite Abelian group and the block size is 3, then the necessary conditions for the existence of a (v, 3, λ;G) GBRD are sufficient. These necessary conditions include the usual necessary conditions for the existence of the associated (v, 3, λ) BIBD plus λ ≡ 0 (mod |G|), plus some extra conditions when |G| is even, namely that the number of blocks be divisible by 4 and, if...

It is shown here that the necessary conditions for the existence of MGD[4, A m, n] for A ~ 2 are sufficient with the exception of MGO(4, 3, 6,23].