Simplified method for the measurement of segmental colonic transit time

Segmental colonic transit has been measured in 101 patients. Two MBq of 111Indium absorbed on resin pellets and encapsulated in an enteric coated capsule was given at 7 00 am. Hourly images during the first day, and three images during each subsequent day were acquired for up to three days. Using all scan and patient data the scans were categorised in one of the five patterns of colonic transit: normal, rapid, right delay, left delay, or generalised delay. The geometric centres and per cent activity at each time point was compared between the five groups of colonic transit patients to find the best time for imaging and so to distinguish the five groups. During the first day, early images did not help in diagnosis of patterns of transit, however, in the later images (six hours onwards after the ingestion of the activity) the rapid transit groups could be identified. Images at 27 and 51 hours were both required to distinguish all five groups of patients from each other. Only in the 'normal' transit patients was there some excretion of the activity during the course of the second day, otherwise there was no difference in the images taken in the course of a day (second or third day). A simplified protocol requires a minimum of three images to distinguish all five patterns of colonic transit. The activity should be ingested in the morning (7 00 am) and the first image taken at the end of the working day (8-10 hours after ingestion), the second image on the morning of the second day, and the third image during the course of the third day. This simple protocol would provide all the clinically relevant information necessary for correct classification of the colonic transit.     

Distributed memory systems for simulating artificial neural networks

In executing tasks involving intelligent information processing, the human brain performs better than the digital computer. The human brain derives its power from a large number [O(10¹¹)] of neurons which are interconnected by a dense interconnection network [O(10⁵) connections per neuron]. Artificial neural network (ANN) paradigms adopt the structure of the brain to try to emulate the intelligent information processing methods of the brain. ANN techniques are being employed to solve problems in areas such as pattern recognition, and robotic processing. Simulation of ANNs involves implementation of large number of neurons and a massive interconnection network. In this paper, we discuss various simulation models of ANNs and their implementation on distributed memory systems. Our investigations reveal that communication-efficient networks of distributed memory systems perform better than other topologies in implementing ANNs.     

Electrical properties and positron annihilation study of (Ba<Subscript>1−<Emphasis Type="Italic">x</Emphasis></Subscript>Ho<Subscript><Emphasis Type="Italic">x</Emphasis></Subscript>)TiO<Subscript>3</Subscript> ceramics

DC resistivity, dielectric constant, dielectric loss and positron annihilation spectra of (Ba_1−x Ho _x )TiO₃ ceramics have been measured as a function of holmium concentration x. It has been found that the DC resistivity of (Ba_1−x Ho _x )TiO₃ is strongly dependent on the Ho content: it decreases three orders of magnitude and reaches a minimum at x = 0.4%. Doping with 0.6% holmium increases the permittivity of BaTiO₃ by approximately three times (from ∼1,300 to ∼4,000), with only a slight increase in the corresponding dielectric loss. The local electron density and defect concentration estimated using positron annihilation technique conforms well to the features found in the dielectric and resistivity measurements. The results have been discussed in terms of a mixed compensation model.     

A Study of Integrated Document and Connection Caching in the WWW

Document caching and connection caching are extensively studied problems. In document caching, one has to maintain caches containing documents accessible in a network. In connection caching, one has to maintain a set of open network connections that handle data transfer. Previous work investigated these two problems separately while in practice the problems occur together: In order to load a document, one has to establish a connection between network nodes if the required connection is not already open. In this paper we present the first study that integrates document and connection caching. We first consider a very basic model in which all documents have the same size and the cost of loading a document or establishing a connection is equal to 1. We present deterministic and randomized online algorithms that achieve nearly optimal competitive ratios unless the size of the connection cache is extremely small. We then consider general settings where documents have varying sizes. We investigate a FAULT model in which the loading cost of a document is 1 as well as a BIT model in which the loading cost is equal to the size of the document.     

Non-redundant data clustering

Data clustering is a popular approach for automatically finding classes, concepts, or groups of patterns. In practice, this discovery process should avoid redundancies with existing knowledge about class structures or groupings, and reveal novel, previously unknown aspects of the data. In order to deal with this problem, we present an extension of the information bottleneck framework, called coordinated conditional information bottleneck, which takes negative relevance information into account by maximizing a conditional mutual information score subject to constraints. Algorithmically, one can apply an alternating optimization scheme that can be used in conjunction with different types of numeric and non-numeric attributes. We discuss extensions of the technique to the tasks of semi-supervised classification and enumeration of successive non-redundant clusterings. We present experimental results for applications in text mining and computer vision.