Constrained Optimal Querying: Huffman Coding and Beyond

Huffman coding is well known to be useful in certain decision problems involving minimizing the average number of (freely chosen) queries to determine an unknown random variable. However, in problems where the queries are more constrained, the original Huffman coding no longer works. In this paper, we proposed a general model to describe such problems and two code schemes: one is Huffman-based, and the other called GBSC (Greedy Binary Separation Coding). We proved the optimality of GBSC by induction on a binary decision tree, telling us that GBSC is at least as good as Shannon coding. We then compared the two algorithms based on these two codes, by testing them with two problems: DNA detection and 1-player Battleship, and found both to be decent approximating algorithms, with Huffman-based algorithm giving an expected length 1.1 times the true optimal in DNA detection problem, and GBSC yielding an average number of queries 1.4 times the theoretical optimal in 1-player Battleship

Changes-Aware Transformer: Learning Generalized Changes Representation

Difference features obtained by comparing the images of two periods play an indispensable role in the change detection (CD) task. However, a pair of bi-temporal images can exhibit diverse changes, which may cause various difference features. Identifying changed pixels with differ difference features to be the same category is thus a challenge for CD. Most nowadays' methods acquire distinctive difference features in implicit ways like enhancing image representation or supervision information. Nevertheless, informative image features only guarantee object semantics are modeled and can not guarantee that changed pixels have similar semantics in the difference feature space and are distinct from those unchanged ones. In this work, the generalized representation of various changes is learned straightforwardly in the difference feature space, and a novel Changes-Aware Transformer (CAT) for refining difference features is proposed. This generalized representation can perceive which pixels are changed and which are unchanged and further guide the update of pixels' difference features. CAT effectively accomplishes this refinement process through the stacked cosine cross-attention layer and self-attention layer. After refinement, the changed pixels in the difference feature space are closer to each other, which facilitates change detection. In addition, CAT is compatible with various backbone networks and existing CD methods. Experiments on remote sensing CD data set and street scene CD data set show that our method achieves state-of-the-art performance and has excellent generalization

Automaticity in processing spatial-numerical associations: Evidence from a perceptual orientation judgment task of Arabic digits in frames.

Human adults are faster to respond to small/large numerals with their left/right hand when they judge the parity of numerals, which is known as the SNARC (spatial-numerical association of response codes) effect. It has been proposed that the size of the SNARC effect depends on response latencies. The current study introduced a perceptual orientation task, where participants were asked to judge the orientation of a digit or a frame surrounding the digit. The present study first confirmed the SNARC effect with native Chinese speakers (Experiment 1) using a parity task, and then examined whether the emergence and size of the SNARC effect depended on the response latencies (Experiments 2, 3, and 4) using a perceptual orientation judgment task. Our results suggested that (a) the automatic processing of response-related numerical-spatial information occurred with Chinese-speaking participants in the parity task; (b) the SNARC effect was also found when the task did not require semantic access; and (c) the size of the effect depended on the processing speed of the task-relevant dimension. Finally, we proposed an underlying mechanism to explain the SNARC effect in the perceptual orientation judgment task