We give some constructions of new infinite families of group divisible designs, GDD(n, 2, 4; 1, 2), including one which uses the existence of Bhaskar Rao designs. We show the necessary conditions are sufficient for 3 n 8. For n= 10 there is one missing critical design. If 1> 2, then the necessary conditions are sufficient for n ≡ 4, 5, 8 (mod 12). For each of n=10, 15, 16, 17, 18, 19, and 20 we...

In this paper, we complete the existence of near generalized balanced tournament designs (NGBTDs) with block size 3 and 5. As an application, we obtain new classes of optimal constant composition codes.

The necessary conditions for the existence of a (2 × 4, λ)-splitting GDD of type g are gv ≥ 8, λg(v−1) ≡ 0 (mod 4), λg2v(v−1) ≡ 0 (mod 32). It is proved in this paper that these conditions are also sufficient except for λ ≡ 0 (mod 16) and (g, v) = (3, 3).

In Bitcoin system, transactions are prioritized according to attributes such as the remittance amount and transaction fees, and transactions with low priority are likely to wait for confirmation. Because the demand of micro payment in Bitcoin is expected to increase due to low remittance cost, it is important to quantitatively investigate how the priority mechanism of Bitcoin affects the transa...

We present a new approach to multiresolution vector quantisation. Its main advantage is exploitation of long-range correlations in the image by keeping vector size constant, independent of the image scale. We also developed a variable block-rate version of the algorithm, which allows better utilisation of the available bit budget by re ning only those areas of the image which are not e ciently ...

This paper shows how a rational Bitcoin miner should select transactions from his node’s mempool, when creating a new block, in order to maximize his profit in the absence of a block size limit. To show this, the paper introduces the block space supply curve and the mempool demand curve. The former describes the cost for a miner to supply block space by accounting for orphaning risk. The latter...

In this paper, we seek to generalize a construction of Hanani which produces a Steiner 3design on a larger set of points starting from a smaller Steiner 3-design, with constant block size 6. We achieve this by constructing new infinite families of uniform Candelabra Systems with block size 6 and stem size 2.

This paper presents a new image sensor with programmable multiresol~~tion rearlout capability. The proposed image sensor can o11tp11t data at varying resolutions. Differing to our previollsly reported spatially variant snnlpling sensor which sub-samples witho ~ ~ t filtering[l], in the m~lltiresollltion sensor, 11locks of the pixels are averaged and read out then, the new sensor does not suffer...

We show the necessary conditions are su6cient for the existence of GDD(n; 2; 4; 1, 2) with two groups and block size four in which every block intersects each group exactly twice (even GDD’s) or in which every block intersects each group in one or three points (odd GDD’s). We give a construction for near 3-resolvable triple systems TS(n; 3; 6) for every n¿ 4, and these are used to provide const...

In mining projects, the design and production programmes are developed on the basis of a block model. This model requires defining, assessing and assuring many important parameters used in the feasibility study and that may have relevant consequences over the future results of the project. The selection of such parameters is a complex engineering decision due to their great economic impact on t...