Non-commutative symbolic coding

We give a non-commutative generalization of classical symbolic coding in the presence of a synchronizing word. This is done by a scattering theoretical approach. Classically, the existence of a synchronizing word turns out to be equivalent to asymptotic completeness of the corresponding Markov process. A criterion for asymptotic completeness in general is provided by the regularity of an associated extended transition operator. Commutative and non-commutative examples are analysed.

Selection of candidate coding DNA barcoding regions for use on land plants

An in silico screen of 41 of the 81 coding regions of the Nicotiana plastid genome generated a shortlist of 12 candidates as DNA barcoding loci for land plants. These loci were evaluated for amplification and sequence variation against a reference set of 98 land plant taxa. The deployment of multiple primers and a modified multiplexed tandem polymerase chain reaction yielded 85–94% amplification across taxa, and mean sequence differences between sister taxa of 6.1 from 156 bases of accD to 22 from 493 bases of matK. We conclude that loci should be combined for effective diagnosis, and recommend further investigation of the following six loci: matK, rpoB, rpoC1, ndhJ, ycf5 and accD.

Well-posed boundary value problems for integrable evolution equations on a finite interval

We consider boundary value problems posed on an interval [0,L] for an arbitrary linear evolution equation in one space dimension with spatial derivatives of order n. We characterize a class of such problems that admit a unique solution and are well posed in this sense. Such well-posed boundary value problems are obtained by prescribing N conditions at x=0 and n–N conditions at x=L, where N depends on n and on the sign of the highest-degree coefficient n in the dispersion relation of the equation. For the problems in this class, we give a spectrally decomposed integral representation of the solution; moreover, we show that these are the only problems that admit such a representation. These results can be used to establish the well-posedness, at least locally in time, of some physically relevant nonlinear evolution equations in one space dimension.

A parametric model for the interval censored survival times of Acacia mangium plantation in a spacing trial

Survival times for the Acacia mangium plantation in the Segaliud Lokan Project, Sabah, East Malaysia were analysed based on 20 permanent sample plots (PSPs) established in 1988 as a spacing experiment. The PSPs were established following a complete randomized block design with five levels of spacing randomly assigned to units within four blocks at different sites. The survival times of trees in years are of interest. Since the inventories were only conducted annually, the actual survival time for each tree was not observed. Hence, the data set comprises censored survival times. Initial analysis of the survival of the Acacia mangium plantation suggested there is block by spacing interaction; a Weibull model gives a reasonable fit to the replicate survival times within each PSP; but a standard Weibull regression model is inappropriate because the shape parameter differs between PSPs. In this paper we investigate the form of the non-constant Weibull shape parameter. Parsimonious models for the Weibull survival times have been derived using maximum likelihood methods. The factor selection for the parameters is based on a backward elimination procedure. The models are compared using likelihood ratio statistics. The results suggest that both Weibull parameters depend on spacing and block.

Coding of visual space during motor preparation: approaching objects rapidly modulate corticospinal excitability in hand-centered coordinates

Defensive behaviors, such as withdrawing your hand to avoid potentially harmful approaching objects, rely on rapid sensorimotor transformations between visual and motor coordinates. We examined the reference frame for coding visual information about objects approaching the hand during motor preparation. Subjects performed a simple visuomanual task while a task-irrelevant distractor ball rapidly approached a location either near to or far from their hand. After the distractor ball appearance, single pulses of transcranial magnetic stimulation were delivered over the subject's primary motor cortex, eliciting motor evoked potentials (MEPs) in their responding hand. MEP amplitude was reduced when the ball approached near the responding hand, both when the hand was on the left and the right of the midline. Strikingly, this suppression occurred very early, at 70-80ms after ball appearance, and was not modified by visual fixation location. Furthermore, it was selective for approaching balls, since static visual distractors did not modulate MEP amplitude. Together with additional behavioral measurements, we provide converging evidence for automatic hand-centered coding of visual space in the human brain.

Temporal interval production and short-term memory

Interference with time estimation from concurrent nontemporal processing has been shown to depend on the short-term memory requirements of the concurrent task (Fortin Breton, 1995; Fortin, Rousseau, Bourque, & Kirouac, 1993). In particular, it has been claimed that active processing of information in short-term memory produces interference, whereas simply maintaining information does not. Here, four experiments are reported in which subjects were trained to produce a 2,500-msec interval and then perform concurrent memory tasks. Interference with timing was demonstrated for concurrent memory tasks involving only maintenance. In one experiment, increasing set size in a pitch memory task systematically lengthened temporal production. Two further experiments suggested that this was due to a specific interaction between the short-term memory requirements of the pitch task and those of temporal production. In the final experiment, subjects performed temporal production while concurrently remembering the durations of a set of tones. Interference with interval production was comparable to that produced by the pitch memory task. Results are discussed in terms of a pacemaker-counter model of temporal processing, in which the counter component is supported by short-term memory.

Evidence for unusual spatial location coding in Williams syndrome: an explanation for the local bias in visuo-spatial construction tasks?

Individuals with Williams syndrome (WS) display poor visuo-spatial cognition relative to verbal abilities. Furthermore, whilst perceptual abilities are delayed, visuo-spatial construction abilities are comparatively even weaker, and are characterised by a local bias. We investigated whether his differentiation in visuo-spatial abilities can be explained by a deficit in coding spatial location in WS. This can be measured by assessing participants' understanding of the spatial relations between objects within a visual scene. Coordinate and categorical spatial relations were investigated independently in four participant groups: 21 individuals with WS; 21 typically developing (TD) children matched for non-verbal ability; 20 typically developing controls of a lower non-verbal ability; and 21 adults. A third task measured understanding of visual colour relations. Results indicated first, that the comprehension of categorical and coordinate spatial relations is equally poor in WS. Second, that the comprehension of visual relations is also at an equivalent level to spatial relational understanding in this population. These results can explain the difference in performance on visuo-spatial perception and construction tasks in WS. In addition, both the WS and control groups displayed response biases in the spatial tasks. However, the direction of bias differed across the groups. This finding is explored in relation to current theories of spatial location coding. (c) 2005 Elsevier Inc. All rights reserved.

Orientation coding: a specific deficit in Williams syndrome?

Williams syndrome (WS) is a rare genetic disorder with a unique cognitive profile in which verbal abilities are markedly stronger than visuospatial abilities. This study investigated the claim that orientation coding is a specific deficit within the visuospatial domain in WS. Experiment I employed a simplified version of the Benton Judgement of Line Orientation task and a control, length-matching task. Results demonstrated comparable levels of orientation matching performance in the group with WS and a group of typically developing (TD) controls matched by nonverbal ability, although it is possible that floor effects masked group differences. A group difference was observed in the length-matching task due to stronger performance from the control group. Experiment 2 employed an orientation-discrimination task and a length-discrimination task. Contrary to previous reports, the results showed that individuals with WS were able to code by orientation to a comparable level as that of their matched controls. This demonstrates that, although some impairment is apparent, orientation coding does not represent a specific deficit in WS. Comparison between Experiments I and 2 suggests that orientation coding is vulnerable to task complexity. However, once again, this vulnerability does not appear to be specific to the population with WS, as it was also apparent in the TD controls.

Performance of GPRS coding scheme detection under severe multipath and co-channel interference as a function of soft-bit width

The General Packet Radio Service (GPRS) has been developed for the mobile radio environment to allow the migration from the traditional circuit switched connection to a more efficient packet based communication link particularly for data transfer. GPRS requires the addition of not only the GPRS software protocol stack, but also more baseband functionality for the mobile as new coding schemes have be en defined, uplink status flag detection, multislot operation and dynamic coding scheme detect. This paper concentrates on evaluating the performance of the GPRS coding scheme detection methods in the presence of a multipath fading channel with a single co-channel interferer as a function of various soft-bit data widths. It has been found that compressing the soft-bit data widths from the output of the equalizer to save memory can influence the likelihood decision of the coding scheme detect function and hence contribute to the overall performance loss of the system. Coding scheme detection errors can therefore force the channel decoder to either select the incorrect decoding scheme or have no clear decision which coding scheme to use resulting in the decoded radio block failing the block check sequence and contribute to the block error rate. For correct performance simulation, the performance of the full coding scheme detection must be taken into account.

Two-pass hexagonal algorithm with parallel implementation for video coding

This paper presents a paralleled Two-Pass Hexagonal (TPA) algorithm constituted by Linear Hashtable Motion Estimation Algorithm (LHMEA) and Hexagonal Search (HEXBS) for motion estimation. In the TPA, Motion Vectors (MV) are generated from the first-pass LHMEA and are used as predictors for second-pass HEXBS motion estimation, which only searches a small number of Macroblocks (MBs). We introduced hashtable into video processing and completed parallel implementation. We propose and evaluate parallel implementations of the LHMEA of TPA on clusters of workstations for real time video compression. It discusses how parallel video coding on load balanced multiprocessor systems can help, especially on motion estimation. The effect of load balancing for improved performance is discussed. The performance of the algorithm is evaluated by using standard video sequences and the results are compared to current algorithms.