The conventional cryptography solutions are ill-suited to strict memory, size and power limitations of resourceconstrained devices, so lightweight cryptography solutions have been specifically developed for this type of applications. In this domain of cryptography, the term lightweight never refers to inadequately low security, but rather to establishing the best balance to maintain sufficient ...

This paper describes an empirical investigation into the nature of challenge within the context of flow or effortless attention. An important condition of the flow state is that the challenges of the task are commensurate with the person’s level of skill. However when considering movement interaction those challenges could be composite in the sense that they could comprise physical as well as i...

The blocks of a balanced ternary design, BTD(V,B; ρ1, ρ2, R;K,Λ), can be partitioned into two sets: the b1 blocks that each contain no repeated elements, and the b2 = B − b1 blocks containing repeated elements. In this note, we address, and answer in some particular cases, the following question. For which partitions of the integer B as b1 + b2 does there exist a BTD(V,B; ρ1, ρ2, R;K,Λ)?

Given a set of n black and n white points in general position in the plane, a line l determined by them is said to be balanced if each open half-plane bounded by l contains precisely the same number of black points as white points. It is proved that the number of balanced lines is at least n. This settles a conjecture of George Baloglou.

Let S be a set of r red points and b = r + 2δ blue points in general position in the plane, with δ ≥ 0. A line l determined by them is balanced if in each open half-plane bounded by l the difference between the number of blue points and red points is δ. We show that every set S as above has at least r balanced lines. The main techniques in the proof are rotations and a generalization, sliding r...

Many parallel algorithms have recently been developed to accelerate solving the subset-sum problem on a heterogeneous CPU–GPU system. However, within each compute node, only one CPU core is used to control one GPU and all the remaining CPU cores are in idle state, which leads to a large number of CPU cores being wasted. In this paper, based on a cost-optimal parallel two-list algorithm, we prop...