The Mere Exposure Effect in the Domain of Haptics

Background: Zajonc showed that the attitude towards stimuli that one had been previously exposed to is more positive than towards novel stimuli. This mere exposure effect (MEE) has been tested extensively using various visual stimuli. Research on the MEE is sparse, however, for other sensory modalities. Methodology/Principal Findings: We used objects of two material categories (stone and wood) and two complexity levels (simple and complex) to test the influence of exposure frequency (F0 = novel stimuli, F2 = stimuli exposed twice, F10 = stimuli exposed ten times) under two sensory modalities (haptics only and haptics & vision). Effects of exposure frequency were found for high complex stimuli with significantly increasing liking from F0 to F2 and F10, but only for the stone category. Analysis of ‘‘Need for Touch’ ’ data showed the MEE in participants with high need for touch, which suggests different sensitivity or saturation levels of MEE. Conclusions/Significance: This different sensitivity or saturation levels might also reflect the effects of expertise on the haptic evaluation of objects. It seems that haptic and cross-modal MEEs are influenced by factors similar to those in the visual domain indicating a common cognitive basis

Codelength Distributions of T-Code Codesets under Simple Strictly Minimal Augmentation

Experimental evidence shows that the codelength distribution of some T-Code sets resembles a Gaussian bell shape. This paper presents some further plausibility arguments for this as well as some of the experimental evidence

Representing Variable-Length Codes in Fixed-Length T-Depletion Format in Encoders and Decoders

T-Codes are a class of variable-length codes. Their self-synchronisation properties are useful in compression and communication applications where error recovery rather than error correction is at issue, for example, in digital telephony. T-Codes may be used without error correction or additional synchronisation mechanisms. Typically, the representation of variable-length codes is a problem in computers based on a fixed-length word architecture. This presents a problem in encoder and decoder applications. The present paper introduces a fixed-length format for storing and handling variable-length T-Code codewords, the T-depletion codewords, which are derived from the recursive construction of the T-Code codewords. The paper further proposes an algorithm for the conversion of T-Code codewords into T-depletion codewords that may be used as a decoder for generalized T-Codes. As well as representing all codewords of a T-Code set (the leaf nodes in the set's decoding tree), the T-depletion co..

T-Code compression for Arabic computational morphology

It is impossible to perform root-based searching, concordancing, and grammar checking in Arabic without a method to match words with roots and vice versa. A comprehensive word list is essential for incremental searching, predictive SMS messaging, and spell checking, but due to the derivational and inflectional nature of Arabic, a comprehensive word list is taxing on storage space and access speed. This paper describes a method for compactly storing and efficiently accessing an extensive dictionary of Arabic words by their morphological properties and roots. Compression of the dictionary is based on T-Code encoding, which follows the Huffman encoding model. The special characteristics inherent in the recursive augmentation method with which codes are created allow compact storage on disk and in memory. They also facilitate the efficient use of bandwidth, for Arabic text transmission, over intranets and the Internet

Even T-Code Sets

A finite set of strings formed over an alphabet A may be called "even" if and only if the total number of occurences of each of the alphabet characters a 2 A is constant, i.e., jSj a = constant. The present paper proves that sets generated by augmentation from an even set S, using prefixes p 1 ; : : : ; pn and expansion parameters k 1 ; : : : ; kn , are even provided the string p k1 1 p k2 2 : : : p kn n is even. In particular, this requirement is shown to hold for the T-Code sets. Division of Science and Technology (Computer Science); Tamaki Campus; The University of Auckland, Private Bag 92019, Auckland, New Zealand Table of Symbols symbol description IN the set of natural numbers (including 0) IN + the set of positive natural numbers INnf0g #M number of elements in set M (cardinality of M) A alphabet A ? free monoid generated by A under concatenation A + set of all non-empty strings in A ? a; a 0 ; a k characters in A, indexed where appropriate Q number of..

Representing Variable-Length Codes in Fixed-Length T-Depletion Format in Encoders and Decoders

T-Codes are a class of variable-length codes. Their self-synchronization properties are useful in compression and communication applications where error recovery rather than error correction is at issue, for example, in digital telephony. T-Code s may be used without error correction or additional synchronization mechanisms. Typically, the representation of variable-length codes is a problem in computers based on a fixed-length word architecture. This presents a problem in encoder and decoder applications. The present paper introduces a fixed-length format for storing and handling variable-length T-Code codewords, the T-depletion codewords, which are derived from the recursive construction of the T-Code codewords. The paper further proposes an algorithm for the conversion of T-Code codewords into T-depletion codewords that may be used as a decoder for generalized T-Codes. As well as representing all codewords of a T-Code set (the leaf nodes in the set s decoding tree), the T-depletion code format also permits the representation of "pseudo-T codewords" --- strings that are not in the T-Code set. These strings are shown to correspond uniquely to all proper prefixes of T-Code codewords, thus permitting the representation of both intermediate and final decoder states in a single format. We show that this property may be used to store arbitrary finite and prefix-free variable-length codes in a compact fixed-length format. 1.) The authors' research is supported by the Department of Computer Science, the Division of Science and Technology (Tamaki Campus), and the Graduate Research Fund, all of The University of Auckland, the Centre for Discrete Mathematics and Theoretical Computer Science (CDMTCS) of the University of Auckland and the University of Waikato, and by the Deutsche Forschungsgemeinschaft (DFG). 2.) Proceedings of the First Japan-New Zealand Workshop on Logic in Computer Science, special issue editors D.S. Bridges, C.S. Calude, M.J. Dinneen and B. Khoussainov