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

A structure for implementing lapped transforms with time-varying block sizes is discussed. It allows full orthogonality in the transitions based on a factorization of the transfer matrix into orthogonal factors. Such an approach can be viewed as a sequence of stages with variable-block-size transforms intermediated by sampleshuffling (delay) stages. Details for a first order system are given an...

We present external memory data structures for efficiently answering range-aggregate queries. The range-aggregate problem is defined as follows: Given a set of weighted points in R, compute the aggregate of the weights of the points that lie inside a d-dimensional orthogonal query rectangle. The aggregates we consider in this paper include COUNT, SUM, and MAX. First, we develop a structure for ...

A resolvable modified group divisible design (RMGDD) is an MGDD whose blocks can be partitioned into parallel classes. In this article, we investigate the existence of RMGDDs with block size three and show that the necessary conditions are also sufficient with two exceptions. # 2005 Wiley Periodicals, Inc. J Combin Designs 15: 2–14, 2007

A hybrid watermark that consists of a robust part and a fragile part can be used to serve multiple purposes. The robust part can protect copyright information, the fragile part can detect tampering, and their combination enables identification of attacks encountered. This paper analyses an overlap and a non-overlap implementation of the robust and fragile parts in a hybrid system. The differenc...

Measurement of particles, whether grains on a microscope slide or image of a muck or stock pile, is two dimensional. Principles of geometric probability and stereology can be used to reconstruct or unfold a three dimensional size distribution. This analytical solution or unfolding function can be calibrated with an empirical calibration function.