We settle the existence of certain anti-magic cubes using combinatorial block designs and graph decompositions to align a handful small examples.

veryfew attempts have been made in the past to develop instruments to measure pragmatic knowledge of second language (l2) learners. the absence of such instruments in the literature of english language teaching (elt) underscores the need for the researchers to develop new tests that are specifically designed to assess this crucial but less explored aspect of language learners’ (lls) knowledge. ...

Three experiments examined anisotropies of tolerance of perceptual completion at the blind spot when a pair of line segments was presented on opposite sides of the blind spot. The tolerance of perceptual completion is defined as the maximum difference in a stimulus attribute between the line segments on opposite sides of the blind spot when perceptual completion of a line has occurred. The misa...

Human adults are thought to possess two dissociable systems to represent numbers: an approximate quantity system akin to a mental number line, and a verbal system capable of representing numbers exactly. Here, we study the interface between these two systems using an estimation task. Observers were asked to estimate the approximate numerosity of dot arrays. We show that, in the absence of calib...

This paper proposed a parallel automated assembly line system to produce multiple products having multiple autonomous guided vehicles (AGVs). Several assembly lines are configured to produce multiple products in which the technologies of machines are shared among the assembly lines when required. The transportation between the stations in an assembly line (intra assembly line) and among station...

The bin-packing problem is to partition a multiset of n numbers into as few bins of capacity C as possible, such that the sum of the numbers in each bin does not exceed C. We compare two existing algorithms for solving this problem: bin completion (BC) and branch-and-cut-and-price (BCP). We show experimentally that the problem difficulty and dominant algorithm are a function of n, the precision...