A widely accepted view of the human information processing system is that most of the symbol manipulation takes place in a central processor, sometimes referred to as the active memory (Neisser, 1967), working memory (Newell & Simon, 1963), operational memory (Posner, 1967), or the immediate processor (Newell, 1973). This paper is concerned with the rapid mental operations of the central proces...

This paper describes our current research on how a robot, through observation of human demonstrations, can learn task level representations of human hand-work tasks. Representations proposed so far typically handle a human hand trajectory as it is or segment the entire task into a discrete pre-determined symbol sequence; but to make a generalized model of human hand-work tasks, both types of in...

       Inabilities to attain adequate aqueous solubility and stability have made the preparation of a clinically suitable formulation of taxol difficult. Addition of nicotinamide (ND), 2-hydroxypropyl- b-cyclodextrin (HPßCD), polyethylene glycol, (PEG), bile salts (BS, 50:50 sodium cholate: deoxycholate...

We aim at constructing a model for an agent showing symbolic activities. Based on a discussion of the concept of a symbolic system we propose correspondences between symbolic activities and the behaviour of dynamical systems in which attractors develop in response to inputs. We examine correspondences such as, symbols to attractors, symbol manipulations to transitions among attractors, and regu...

In this paper we introduce a new approach in the decoding of variable length codes. Based on the tree structure of these codes a trellis representation is derived which allows the application of the BCJR algorithm. This algorithm provides us with the a posteriori probabilities of the transmitted source symbols. Therefore we do not only use soft information from an outer decoding stage but also ...

A decoding rule is presented which minimizes the probability of symbol error over a time-discrete memoryless channel for any linear error-correcting code when the code words are equiprobable. The complexity of this rule varies inversely with code rate, making the technique particularly attractive for high rate codes. Examples are given for both block and convolutional codes.

poetic analysis involves the explication of a poem by focusing on the process of semiosis in it. through semiosis linguistic meaning is transformed into stylistic meaning. an examination of semiosis brings us to look at the hypersemanticized poetic structures which are none other than the style features of a poem. since style functions in a literary text by conveying meanings other than literal...

When is uncoded transmission optimal? This paper derives easy-to-check necessary and suÆcient conditions that do not require nding the rate-distortion and the capacity-cost functions. We consider the symbol-by-symbol communication of discretetime memoryless sources across discrete-time memoryless channels, using single-letter coding and decoding. This is an optimal communication system if and o...