Distinction between familial and sporadic forms of colorectal cancer showing DNA microsatellite instability

Attempts to classify colorectal cancer into subtypes based upon molecular characterisation are overshadowed by the classical stepwise model in which the adenoma-carcinoma sequence serves as the morphological counterpart. Clarity is achieved when cancers showing DNA microsatellite instability (MSI) are distinguished as sporadic MSI-low (MSI-L), sporadic MSI-high (MSI-H) and hereditary non-polyposis colorectal cancer (HNPCC). Divergence of the 'methylator' pathway into MSI-L and MSI-H is at least partly determined by the respective silencing of MGMT and hMLH1. Multiple differences can be demonstrated between sporadic and familial (HNPCC) MSI-H colorectal cancer with respect to early mechanisms, evolution, molecular characterisation, demographics and morphology. By acknowledging the existence of multiple pathways, rapid advances in the fields of basic and translational research will occur and this will lead to improved strategies for the prevention, early detection and treatment of colorectal cancer. (C) 2002 Elsevier Science Ltd. All rights reserved.

Distribution of two splice variants of the glutamate transporter GLT-1 in rat brain and pituitary

We have performed immunocytochemistry on rat brains using a highly specific antiserum directed against the originally described form of the glutamate transporter GLT-1 (referred to hereafter as GLT-1alpha), and another against a C-terminal splice variant of this protein, GLT-1B. Both forms of GLT-1 were abundant in rat brain, especially in regions such as the hippocampus and cerebral cortex, and macroscopic examination of sections suggested that both forms were generally regionally coexistent. However, disparities were evident; GLT-1alpha was present in the intermediate lobe of the pituitary gland, whereas GLT-1B was absent. Similar marked disparities were also noted in the external capsule, where GLT1A labeling was abundant but GLT-1B was only occasionally encountered. Conversely, GLT-1B was more extensively distributed, relative to GLT-1alpha, in areas such as the deep cerebellar nuclei. In most regions, such as the olfactory bulbs, both splice variants were present but differences were evident in their distribution. In cerebral cortex, patches were evident where GLT-1B was absent, whereas no such patches were evident for GLT-1alpha. At high resolution, other discrepancies were evident; double-labeling of areas such as hippocampus indicated that the. two splice variants may either be differentially expressed by closely apposed glial elements or that the two splice variants may be differentially targeted to distinct membrane domains of individual glial cells. (C) 2002 Wiley-Liss, Inc.

Localization of taurine transporters, taurine, and H-3 taurine accumulation in the rat retina, pituitary, and brain

The nervous system contains an abundance of taurine, a neuroactive sulfonic acid. Antibodies were generated against two cloned high-affinity taurine transporters, referred to in this study as TAUT-1 and TAUT-2. The distribution of such was compared with the distribution of taurine in the rat brain, pituitary, and retina. The cellular pattern of [H-3] taurine uptake in brain slices, pituitary slices, and retinas was examined by autoradiography. TAUT-2 was predominantly associated with glial cells, including the Bergmann glial cells of the cerebellum and astrocytes in brain areas such as hippocampus. Low-level labeling for TAUT-2 was also observed in some neurones such as CA1 pyramidal cells. TAUT-1 distribution was more limited; in the posterior pituitary TAUT-1 was associated with the pituicytes but was absent from glial cells in the intermediate and anterior lobes. Conversely, in the brain TAUT-1 was associated with cerebellar Purkinje cells and, in the retina, with photoreceptors and bipolar cells. Our data suggest that intracellular taurine levels in glial cells and neurons may be regulated in part by specific high-affinity taurine transporters. The heterogeneous distribution of taurine and its transporters in the brain does not reconcile well with the possibility that taurine acts solely as a ubiquitous osmolyte in nervous tissues. (C) 2002 Wiley-Liss, Inc.

Static-priority scheduling of sporadic messages on a wireless channel

Consider the problem of scheduling sporadic messages with deadlines on a wireless channel. We propose a collision-free medium access control (MAC) protocol which implements static-priority scheduling and present a schedulability analysis technique for the protocol. The MAC protocol allows multiple masters and is fully distributed; it is an adaptation to a wireless channel of the dominance protocol used in the CAN bus. But unlike that protocol, our protocol does not require a node having the ability to receive an incoming bit from the channel while transmitting to the channel.

Using WorldFIP networks to support periodic and sporadic real-time traffic

In this paper we address the ability of WorldFIP to cope with the real-time requirements of distributed computer-controlled systems (DCCS). Typical DCCS include process variables that must be transferred between network devices both in a periodic and sporadic (aperiodic) basis. The WorldFIP protocol is designed to support both types of traffic. WorldFIP can easily guarantee the timing requirements for the periodic traffic. However, for the aperiodic traffic more complex analysis must be made in order to guarantee its timing requirements. This paper describes work that is being carried out to extend previous relevant work, in order to include the actual schedule for the periodic traffic in the worst-case response time analysis of sporadic traffic in WorldFIP networks

A PTAS for assigning sporadic tasks on two-type heterogeneous multiprocessors

Consider the problem of determining a task-toprocessor assignment for a given collection of implicit-deadline sporadic tasks upon a multiprocessor platform in which there are two distinct kinds of processors. We propose a polynomialtime approximation scheme (PTAS) for this problem. It offers the following guarantee: for a given task set and a given platform, if there exists a feasible task-to-processor assignment, then given an input parameter, ϵ, our PTAS succeeds, in polynomial time, in finding such a feasible task-to-processor assignment on a platform in which each processor is 1+3ϵ times faster. In the simulations, our PTAS outperforms the state-of-the-art PTAS [1] and also for the vast majority of task sets, it requires significantly smaller processor speedup than (its upper bound of) 1+3ϵ for successfully determining a feasible task-to-processor assignment.

Preemption-light multiprocessor scheduling of sporadic tasks with high utilisation bound

Known algorithms capable of scheduling implicit-deadline sporadic tasks over identical processors at up to 100% utilisation invariably involve numerous preemptions and migrations. To the challenge of devising a scheduling scheme with as few preemptions and migrations as possible, for a given guaranteed utilisation bound, we respond with the algorithm NPS-F. It is configurable with a parameter, trading off guaranteed schedulable utilisation (up to 100%) vs preemptions. For any possible configuration, NPS-F introduces fewer preemptions than any other known algorithm matching its utilisation bound. A clustered variant of the algorithm, for systems made of multicore chips, eliminates (costly) off-chip task migrations, by dividing processors into disjoint clusters, formed by cores on the same chip (with the cluster size being a parameter). Clusters are independently scheduled (each, using non-clustered NPS-F). The utilisation bound is only moderately affected. We also formulate an important extension (applicable to both clustered and non-clustered NPS-F) which optimises the supply of processing time to executing tasks and makes it more granular. This reduces processing capacity requirements for schedulability without increasing preemptions.

A preliminary idea for an 8-competitive, log2 DMAX + log2 log2 1/U asymptotic-space, interface generation algorithm for two-level hierarchical scheduling of constrained-deadline sporadic tasks on a uniprocessor

Consider a single processor and a software system. The software system comprises components and interfaces where each component has an associated interface and each component comprises a set of constrained-deadline sporadic tasks. A scheduling algorithm (called global scheduler) determines at each instant which component is active. The active component uses another scheduling algorithm (called local scheduler) to determine which task is selected for execution on the processor. The interface of a component makes certain information about a component visible to other components; the interfaces of all components are used for schedulability analysis. We address the problem of generating an interface for a component based on the tasks inside the component. We desire to (i) incur only a small loss in schedulability analysis due to the interface and (ii) ensure that the amount of space (counted in bits) of the interface is small; this is because such an interface hides as much details of the component as possible. We present an algorithm for generating such an interface.

Provably good scheduling of sporadic tasks with resource sharing on a two-type heterogeneous multiprocessor platform

Consider the problem of scheduling a set of implicit-deadline sporadic tasks to meet all deadlines on a two-type heterogeneous multiprocessor platform where a task may request at most one of |R| shared resources. There are m1 processors of type-1 and m2 processors of type-2. Tasks may migrate only when requesting or releasing resources. We present a new algorithm, FF-3C-vpr, which offers a guarantee that if a task set is schedulable to meet deadlines by an optimal task assignment scheme that only allows tasks to migrate when requesting or releasing a resource, then FF-3Cvpr also meets deadlines if given processors 4+6*ceil(|R|/min(m1,m2)) times as fast. As far as we know, it is the first result for resource sharing on heterogeneous platforms with provable performance.

Intra-type migrative scheduling of implicit-deadline sporadic tasks on two- type heterogeneous multiprocessor

Consider the problem of scheduling a set of implicit-deadline sporadic tasks to meet all deadlines on a two-type heterogeneous multiprocessor platform. Each processor is either of type-1 or type-2 with each task having different execution time on each processor type. Jobs can migrate between processors of same type (referred to as intra-type migration) but cannot migrate between processors of different types. We present a new scheduling algorithm namely, LP-Relax(THR) which offers a guarantee that if a task set can be scheduled to meet deadlines by an optimal task assignment scheme that allows intra-type migration then LP-Relax(THR) meets deadlines as well with intra-type migration if given processors 1/THR as fast (referred to as speed competitive ratio) where THR <= 2/3.

A 12*(1+|R|/(4m))-speed algorithm for scheduling constrained-deadline sporadic real-time tasks on a multiprocessor comprising m processors where a task may request one of |R| sequentially-reusable shared resources

We present a 12*(1+|R|/(4m))-speed algorithm for scheduling constrained-deadline sporadic real-time tasks on a multiprocessor comprising m processors where a task may request one of |R| sequentially-reusable shared resources.

Scheduling sporadic tasks on multiprocessors with mutual exclusion constraints

Consider the problem of scheduling sporadic tasks on a multiprocessor platform under mutual exclusion constraints. We present an approach which appears promising for allowing large amounts of parallel task executions and still ensures low amounts of blocking.

A pseudo-medium-wide 8-competitive interface for two-level compositional real-time scheduling of constrained- deadline sporadic tasks on a uniprocessor

Compositional real-time scheduling clearly requires that ”normal” real-time scheduling challenges are addressed but challenges intrinsic to compositionality must be addressed as well, in particular: (i) how should interfaces be described? and (ii) how should numerical values be assigned to parameters constituting the interfaces? The real-time systems community has traditionally used narrow interfaces for describing a component (for example, a utilization/bandwidthlike metric and the distribution of this bandwidth in time). In this paper, we introduce the concept of competitive ratio of an interface and show that typical narrow interfaces cause poor performance for scheduling constrained-deadline sporadic tasks (competitive ratio is infinite). Therefore, we explore more expressive interfaces; in particular a class called medium-wide interfaces. For this class, we propose an interface type and show how the parameters of the interface should be selected. We also prove that this interface is 8-competitive.