Parallel pipelined histogram architectures

Proposed is a unique cell histogram architecture which will process k data items in parallel to compute 2q histogram bins per time step. An array of m/2q cells computes an m-bin histogram with a speed-up factor of k; k ⩾ 2 makes it faster than current dual-ported memory implementations. Furthermore, simple mechanisms for conflict-free storing of the histogram bins into an external memory array are discussed.

Hyper-parallel tempering Monte Carlo simulations of Ar adsorption in new models of microporous non-graphitizing activated carbon: effect of microporosity

The adsorption of gases on microporous carbons is still poorly understood, partly because the structure of these carbons is not well known. Here, a model of microporous carbons based on fullerene- like fragments is used as the basis for a theoretical study of Ar adsorption on carbon. First, a simulation box was constructed, containing a plausible arrangement of carbon fragments. Next, using a new Monte Carlo simulation algorithm, two types of carbon fragments were gradually placed into the initial structure to increase its microporosity. Thirty six different microporous carbon structures were generated in this way. Using the method proposed recently by Bhattacharya and Gubbins ( BG), the micropore size distributions of the obtained carbon models and the average micropore diameters were calculated. For ten chosen structures, Ar adsorption isotherms ( 87 K) were simulated via the hyper- parallel tempering Monte Carlo simulation method. The isotherms obtained in this way were described by widely applied methods of microporous carbon characterisation, i. e. Nguyen and Do, Horvath - Kawazoe, high- resolution alpha(a)s plots, adsorption potential distributions and the Dubinin - Astakhov ( DA) equation. From simulated isotherms described by the DA equation, the average micropore diameters were calculated using empirical relationships proposed by different authors and they were compared with those from the BG method.

Parallel pipelined array architectures for real-time histogram computation in consumer devices

The real-time parallel computation of histograms using an array of pipelined cells is proposed and prototyped in this paper with application to consumer imaging products. The array operates in two modes: histogram computation and histogram reading. The proposed parallel computation method does not use any memory blocks. The resulting histogram bins can be stored into an external memory block in a pipelined fashion for subsequent reading or streaming of the results. The array of cells can be tuned to accommodate the required data path width in a VLSI image processing engine as present in many imaging consumer devices. Synthesis of the architectures presented in this paper in FPGA are shown to compute the real-time histogram of images streamed at over 36 megapixels at 30 frames/s by processing in parallel 1, 2 or 4 pixels per clock cycle.

Implementation of Parallel (p,q) Counters for High Speed Digital Multipliers

Both the (5,3) counter and (2,2,3) counter multiplication techniques are investigated for the efficiency of their operation speed and the viability of the architectures when implemented in a fast bipolar ECL technology. The implementation of the counters in series-gated ECL and threshold logic are contrasted for speed, noise immunity and complexity, and are critically compared with the fastest practical design of a full-adder. A novel circuit technique to overcome the problems of needing high fan-in input weights in threshold circuits through the use of negative weighted inputs is presented. The authors conclude that a (2,2,3) counter based array multiplier implemented in series-gated ECL should enable a significant increase in speed over conventional full adder based array multipliers.

Parallel Architectures for High Speed Multipliers

The authors compare various array multiplier architectures based on (p,q) counter circuits. The tradeoff in multiplier design is always between adding complexity and increasing speed. It is shown that by using a (2,2,3) counter cell it is possible to gain a significant increase in speed over a conventional full-adder, carry-save array based approach. The increase in complexity should be easily accommodated using modern emitter-coupled-logic processes.

Expression of the collagen receptor glycoprotein VI during megakaryocyte differentiation

This study examined the expression of the platelet collagen receptor glycoprotein VI (GPVI) in megakaryocyte cell lines and primary megakaryocytes by reverse transcriptase-polymerase chain reaction and by flow cytometry and ligand blotting using the snake venom toxin convulxin. Expression of GPVI is increased in the megakaryoblastic cell lines HEL and CMK on differentiation with the phorbol ester phorbol 12-myristate 13-acetate (PMA), along with the Fc receptor gamma-chain (FcR gamma-chain). The increase in GPVI expression is associated with marked potentiation of tyrosine phosphorylation and Ca(++) elevation in response to convulxin. Syk, linker for activated T cells, and phospholipase C gamma 2 (PLC gamma 2) are among the proteins tyrosine phosphorylated on convulxin stimulation in PMA-differentiated HEL cells. Studies on primary murine megakaryocytes grown in vitro confirmed that GPVI is up-regulated in parallel with functional activation, assessed by measurement of [Ca(++)](i), during differentiation. The results demonstrate that expression of GPVI is up-regulated along with the FcR gamma-chain during differentiation of megakaryocytes. (Blood. 2000;96:2740-2745)

Between the lines: Konrad Wolf's 'Mama, ich lebe' and the dilemmas of betrayal

The article offers a close reading of Konrad Wolf’s anti-fascist Second World War film 'Mama, ich lebe' (DEFA, 1977). 'Mama, ich lebe', like all East German films about the Nazi past, deals with the re-founding of post-war Germany. Unlike the usual approach which focused on political redemption of the past crimes, Wolf’s approach explores rupture and failure of political agency as the pre-condition for a new beginning. The rupture is effected by the defection of four Wehrmacht soldiers who decide to cooperate with the Soviet enemy. Their betrayal of the national collective is ethically motivated and arises from their responsibility for the Soviet ‘other’. Its radicalness opens up a moment of utopian freedom and conciliation for the traitors. Yet the back side of betrayal is insecurity and confliction with regard to their role and roots. While the four meet their role as traitors with self-deception about their ambivalent position, they are eventually forced to acknowledge their position as one of self-defeat. Their ‘ethical betrayal’ (Parikh 2009) does therefore not lead to utopian fulfilment but to the traitors’ expiatory sacrifice as the only form of accountability and self-justification. In Wolf’s film antifascism as a tale of political redemption is thus revised and becomes a tale of necessary individual atonement.

Membrane ruffling and invasion of human and avian cell lines is reduced for aflagellate mutants of Salmonella enterica serotype Enteritidis

Independent studies have demonstrated that flagella are associated with the invasive process of Salmonella enterica serotypes, and aflagellate derivatives of Salmonella enterica serotype Enteritidis are attenuated in murine and avian models of infection. One widely held view is that the motility afforded by flagella, probably aided by chemotactic responses, mediates the initial interaction between bacterium and host cell. The adherence and invasion properties of two S. Enteritidis wild-type strains and isogenic aflagellate mutants were assessed on HEp-2 and Div-1 cells that are of human and avian epithelial origin, respectively. Both aflagellate derivatives showed a significant reduction of invasion compared with wild type over the three hours of the assays. Complementation of the defective fliC allele recovered partially the wild-type phenotype. Examination of the bacterium-host cell interaction by electron and confocal microscopy approaches showed that wild-type bacteria induced ruffle formation and significant cytoskeletal rearrangements on HEp-2 cells within 5 minutes of contact. The aflagellate derivatives induced fewer ruffles than wild type. Ruffle formation on the Div-1 cell line was less pronounced than for HEp-2 cells for wild-type S. Enteritidis. Collectively, these data support the hypothesis that flagella play an active role in the early events of the invasive process.

PMCRI: a parallel modular classification rule induction framework

In a world where massive amounts of data are recorded on a large scale we need data mining technologies to gain knowledge from the data in a reasonable time. The Top Down Induction of Decision Trees (TDIDT) algorithm is a very widely used technology to predict the classification of newly recorded data. However alternative technologies have been derived that often produce better rules but do not scale well on large datasets. Such an alternative to TDIDT is the PrismTCS algorithm. PrismTCS performs particularly well on noisy data but does not scale well on large datasets. In this paper we introduce Prism and investigate its scaling behaviour. We describe how we improved the scalability of the serial version of Prism and investigate its limitations. We then describe our work to overcome these limitations by developing a framework to parallelise algorithms of the Prism family and similar algorithms. We also present the scale up results of a first prototype implementation.

Parallel induction of modular classification rules

The Distributed Rule Induction (DRI) project at the University of Portsmouth is concerned with distributed data mining algorithms for automatically generating rules of all kinds. In this paper we present a system architecture and its implementation for inducing modular classification rules in parallel in a local area network using a distributed blackboard system. We present initial results of a prototype implementation based on the Prism algorithm.

Parallel rule induction with information theoretic pre-pruning

In a world where data is captured on a large scale the major challenge for data mining algorithms is to be able to scale up to large datasets. There are two main approaches to inducing classification rules, one is the divide and conquer approach, also known as the top down induction of decision trees; the other approach is called the separate and conquer approach. A considerable amount of work has been done on scaling up the divide and conquer approach. However, very little work has been conducted on scaling up the separate and conquer approach.In this work we describe a parallel framework that allows the parallelisation of a certain family of separate and conquer algorithms, the Prism family. Parallelisation helps the Prism family of algorithms to harvest additional computer resources in a network of computers in order to make the induction of classification rules scale better on large datasets. Our framework also incorporates a pre-pruning facility for parallel Prism algorithms.

Scaling up classification rule induction through parallel processing

The fast increase in the size and number of databases demands data mining approaches that are scalable to large amounts of data. This has led to the exploration of parallel computing technologies in order to perform data mining tasks concurrently using several processors. Parallelization seems to be a natural and cost-effective way to scale up data mining technologies. One of the most important of these data mining technologies is the classification of newly recorded data. This paper surveys advances in parallelization in the field of classification rule induction.

Parallel random prism: a computationally efficient ensemble learner for classification

Generally classifiers tend to overfit if there is noise in the training data or there are missing values. Ensemble learning methods are often used to improve a classifier's classification accuracy. Most ensemble learning approaches aim to improve the classification accuracy of decision trees. However, alternative classifiers to decision trees exist. The recently developed Random Prism ensemble learner for classification aims to improve an alternative classification rule induction approach, the Prism family of algorithms, which addresses some of the limitations of decision trees. However, Random Prism suffers like any ensemble learner from a high computational overhead due to replication of the data and the induction of multiple base classifiers. Hence even modest sized datasets may impose a computational challenge to ensemble learners such as Random Prism. Parallelism is often used to scale up algorithms to deal with large datasets. This paper investigates parallelisation for Random Prism, implements a prototype and evaluates it empirically using a Hadoop computing cluster.

The glacial question, unsolved: a specimen commentary on lines 1-31

A commentary on J.H. Prynne's poem 'The Glacial Question, Unsolved', from The White Stones (1969)