Supporting ad hoc collaborations in peer-to-peer networks

Traditionally, applications and tools supporting collaborative computing have been designed only with personal computers in mind and support a limited range of computing and network platforms. These applications are therefore not well equipped to deal with network heterogeneity and, in particular, do not cope well with dynamic network topologies. Progress in this area must be made if we are to fulfil the needs of users and support the diversity, mobility, and portability that are likely to characterise group work in future. This paper describes a groupware platform called Coco that is designed to support collaboration in a heterogeneous network environment. The work demonstrates that progress in the p development of a generic supporting groupware is achievable, even in the context of heterogeneous and dynamic networks. The work demonstrates the progress made in the development of an underlying communications infrastructure, building on peer-to-peer concept and topologies to improve scalability and robustness.

Building collaborative environments for advanced computing

Synchronous collaborative systems allow geographically distributed users to form a virtual work environment enabling cooperation between peers and enriching the human interaction. The technology facilitating this interaction has been studied for several years and various solutions can be found at present. In this paper, we discuss our experiences with one such widely adopted technology, namely the Access Grid [1]. We describe our experiences with using this technology, identify key problem areas and propose our solution to tackle these issues appropriately. Moreover, we propose the integration of Access Grid with an Application Sharing tool, developed by the authors. Our approach allows these integrated tools to utilise the enhanced features provided by our underlying dynamic transport layer.

Perspex machine VII: The universal perspex machine

The perspex machine arose from the unification of projective geometry with the Turing machine. It uses a total arithmetic, called transreal arithmetic, that contains real arithmetic and allows division by zero. Transreal arithmetic is redefined here. The new arithmetic has both a positive and a negative infinity which lie at the extremes of the number line, and a number nullity that lies off the number line. We prove that nullity, 0/0, is a number. Hence a number may have one of four signs: negative, zero, positive, or nullity. It is, therefore, impossible to encode the sign of a number in one bit, as floating-, point arithmetic attempts to do, resulting in the difficulty of having both positive and negative zeros and NaNs. Transrational arithmetic is consistent with Cantor arithmetic. In an extension to real arithmetic, the product of zero, an infinity, or nullity with its reciprocal is nullity, not unity. This avoids the usual contradictions that follow from allowing division by zero. Transreal arithmetic has a fixed algebraic structure and does not admit options as IEEE, floating-point arithmetic does. Most significantly, nullity has a simple semantics that is related to zero. Zero means "no value" and nullity means "no information." We argue that nullity is as useful to a manufactured computer as zero is to a human computer. The perspex machine is intended to offer one solution to the mind-body problem by showing how the computable aspects of mind and. perhaps, the whole of mind relates to the geometrical aspects of body and, perhaps, the whole of body. We review some of Turing's writings and show that he held the view that his machine has spatial properties. In particular, that it has the property of being a 7D lattice of compact spaces. Thus, we read Turing as believing that his machine relates computation to geometrical bodies. We simplify the perspex machine by substituting an augmented Euclidean geometry for projective geometry. This leads to a general-linear perspex-machine which is very much easier to pro-ram than the original perspex-machine. We then show how to map the whole of perspex space into a unit cube. This allows us to construct a fractal of perspex machines with the cardinality of a real-numbered line or space. This fractal is the universal perspex machine. It can solve, in unit time, the halting problem for itself and for all perspex machines instantiated in real-numbered space, including all Turing machines. We cite an experiment that has been proposed to test the physical reality of the perspex machine's model of time, but we make no claim that the physical universe works this way or that it has the cardinality of the perspex machine. We leave it that the perspex machine provides an upper bound on the computational properties of physical things, including manufactured computers and biological organisms, that have a cardinality no greater than the real-number line.

Classification of lactose and mandelic acid THz spectra using subspace and wavelet-packet algorithms

This work compares classification results of lactose, mandelic acid and dl-mandelic acid, obtained on the basis of their respective THz transients. The performance of three different pre-processing algorithms applied to the time-domain signatures obtained using a THz-transient spectrometer are contrasted by evaluating the classifier performance. A range of amplitudes of zero-mean white Gaussian noise are used to artificially degrade the signal-to-noise ratio of the time-domain signatures to generate the data sets that are presented to the classifier for both learning and validation purposes. This gradual degradation of interferograms by increasing the noise level is equivalent to performing measurements assuming a reduced integration time. Three signal processing algorithms were adopted for the evaluation of the complex insertion loss function of the samples under study; a) standard evaluation by ratioing the sample with the background spectra, b) a subspace identification algorithm and c) a novel wavelet-packet identification procedure. Within class and between class dispersion metrics are adopted for the three data sets. A discrimination metric evaluates how well the three classes can be distinguished within the frequency range 0. 1 - 1.0 THz using the above algorithms.

Induction of aquaporin 1 but not aquaporin 4 messenger RNA in rat primary brain microvessel endothelial cells in culture

Aquaporins (AQPs) are a family of proteins that mediate water transport across cells, but the extent to which they are involved in water transport across endothelial cells of the blood-brain barrier is not clear. Expression of AQP1 and AQP4 in rat brain microvessel endothelial cells was investigated in order to determine whether these isoforms were present and, in particular, to examine the hypothesis that brain endothelial expression of AQPs is dynamic and regulated by astrocytic influences. Reverse-transcriptase-polymerase chain reaction (RT-PCR) and immunocytochemistry showed that AQP1 mRNA and protein are present at very low levels in primary rat brain microvessel endothelial cells, and are up-regulated in passaged cells. Upon passage, endothelial cell expression of mdr1a mRNA is decreased, indicating loss of blood-brain barrier phenotype. In passage 4 endothelial cells, AQP1 mRNA levels are reduced by coculture above rat astrocytes, demonstrating that astrocytic influences are important in maintaining the low levels of AQP1 characteristic of the blood-brain barrier endothelium. Reverse-transcriptase-PCR revealed very low levels of AQP1 mRNA present in the RBE4 rat brain microvessel endothelial cell line, with no expression detected in primary cultures of rat astrocytes or in the C6 rat glioma cell line. In contrast, AQP4 mRNA is strongly expressed in astrocytes, but no expression is found in primary or passaged brain microvessel endothelial cells, or in RBE4 or C6 cells. Our results support the concept that expression of AQP1, which is seen in many non-brain endothelia, is suppressed in the specialized endothelium of the blood-brain barrier.

A universal primer for isolation of fragments of a gene encoding phytoene desaturase for use in virus-induced gene silencing (VIGS) studies

We have been using Virus-Induced Gene Silencing (VIGS) to test the function of genes that are candidates for involvement in floral senescence. Although VIGS is a powerful tool for assaying the effects of gene silencing in plants, relatively few taxa have been studied using this approach, and most that have are in the Solanaceae. We typically use silencing of phytoene desaturase (PDS) in preliminary tests of the feasibility of using VIGS. Silencing this gene, whose product is involved in carotene biosynthesis, results in a characteristic photobleaching phenotype in the leaves. We have found that efficient silencing requires the use of fragments that are more than 90% homologous to the target gene. To simplify testing the effectiveness of VIGS in a range of species, we designed a set of universal primers to a region of the PDS gene that is highly conserved among species, and that therefore allows an investigator to isolate a fragment of the homologous PDS gene from the species of interest. We report the sequences of these primers and the results of VIGS experiments in horticultural species from the Asteraceae, Leguminosae, Balsaminaceae and Solanaceae.

Ontology supported competency system

Traditionally representation of competencies has been very difficult using computer-based techniques. This paper introduces competencies, how they are represented, and the related concept of competency frameworks and the difficulties in using traditional ontology techniques to formalise them. A “vaguely” formalised framework has been developed within the EU project TRACE and is presented. The framework can be used to represent different competencies and competency frameworks. Through a case study using an example from the IT sector, it is shown how these can be used by individuals and organisations to specify their individual competency needs. Furthermore it is described how these representations are used for comparisons between different specifications applying ontologies and ontology toolsets. The end result is a comparison that is not binary, but tertiary, providing “definite matches”, possible / partial matches, and “no matches” using a “traffic light” analogy.