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.

Scaling up data mining techniques to large datasets using parallel and distributed processing

Advances in hardware and software technology enable us to collect, store and distribute large quantities of data on a very large scale. Automatically discovering and extracting hidden knowledge in the form of patterns from these large data volumes is known as data mining. Data mining technology is not only a part of business intelligence, but is also used in many other application areas such as research, marketing and financial analytics. For example medical scientists can use patterns extracted from historic patient data in order to determine if a new patient is likely to respond positively to a particular treatment or not; marketing analysts can use extracted patterns from customer data for future advertisement campaigns; finance experts have an interest in patterns that forecast the development of certain stock market shares for investment recommendations. However, extracting knowledge in the form of patterns from massive data volumes imposes a number of computational challenges in terms of processing time, memory, bandwidth and power consumption. These challenges have led to the development of parallel and distributed data analysis approaches and the utilisation of Grid and Cloud computing. This chapter gives an overview of parallel and distributed computing approaches and how they can be used to scale up data mining to large datasets.

A parallel quantum histogram architecture

A parallel formulation of an algorithm for the histogram computation of n data items using an on-the-fly data decomposition and a novel quantum-like representation (QR) is developed. The QR transformation separates multiple data read operations from multiple bin update operations thereby making it easier to bind data items into their corresponding histogram bins. Under this model the steps required to compute the histogram is n/s + t steps, where s is a speedup factor and t is associated with pipeline latency. Here, we show that an overall speedup factor, s, is available for up to an eightfold acceleration. Our evaluation also shows that each one of these cells requires less area/time complexity compared to similar proposals found in the literature.

Time development of small disturbances to plane Couette Flow

The question of linear sheared-disturbance evolution in constant-shear parallel flow is here reexamined with regard to the temporary-amplification phenomenon noted first by Orr in 1907. The results apply directly to Rossby waves on a beta-plane, and are also relevant to the Eady model of baroclinic instability. It is shown that an isotropic initial distribution of standing waves maintains a constant energy level throughout the shearing process, the amplification of some waves being precisely balanced by the decay of the others. An expression is obtained for the energy of a distribution of disturbances whose wavevectors lie within a given angular wedge and an upper bound derived. It is concluded that the case for ubiquitous amplification made in recent studies may have been somewhat overstated: while carefully-chosen individual Fourier components can amplify considerably before they decay. a general distribution will tend to exhibit little or no amplification.

C-slow retimed parallel histogram architectures for consumer imaging devices

A parallel pipelined array of cells suitable for real-time computation of histograms is proposed. The cell architecture builds on previous work obtained via C-slow retiming techniques and can be clocked at 65 percent faster frequency than previous arrays. The new arrays can be exploited for higher throughput particularly when dual data rate sampling techniques are used to operate on single streams of data from image sensors. In this way, the new cell operates on a p-bit data bus which is more convenient for interfacing to camera sensors or to microprocessors in consumer digital cameras.

Median architecture by accumulative parallel counters

The time to process each of W/B processing blocks of a median calculation method on a set of N W-bit integers is improved here by a factor of three compared to the literature. Parallelism uncovered in blocks containing B-bit slices are exploited by independent accumulative parallel counters so that the median is calculated faster than any known previous method for any N, W values. The improvements to the method are discussed in the context of calculating the median for a moving set of N integers for which a pipelined architecture is developed. An extra benefit of smaller area for the architecture is also reported.

The long-run performance of IPOs: the case of the Stock Exchange of Mauritius

This study examines the long-run performance of initial public offerings on the Stock Exchange of Mauritius (SEM). The results show that the 3-year equally weighted cumulative adjusted returns average −16.5%. The magnitude of this underperformance is consistent with most reported studies in different developed and emerging markets. Based on multivariate regression models, firms with small issues and higher ex ante financial strength seem on average to experience greater long-run underperformance, supporting the divergence of opinion and overreaction hypotheses. On the other hand, Mauritian firms do not on average time their offerings to lower cost of capital and as such, there seems to be limited support for the windows of opportunity hypothesis.

IMF control of cusp proton emission intensity and dayside convection: implications for component and anti-parallel reconnection

We study a brightening of the Lyman-alpha emission in the cusp which occurred in response to a short-lived southward turning of the interplanetary magnetic field (IMF) during a period of strongly enhanced solar wind plasma concentration. The cusp proton emission is detected using the SI-12 channel of the FUV imager on the IMAGE spacecraft. Analysis of the IMF observations recorded by the ACE and Wind spacecraft reveals that the assumption of a constant propagation lag from the upstream spacecraft to the Earth is not adequate for these high time-resolution studies. The variations of the southward IMF component observed by ACE and Wind allow for the calculation of the ACE-to-Earth lag as a function of time. Application of the derived propagation delays reveals that the intensity of the cusp emission varied systematically with the IMF clock angle, the relationship being particularly striking when the intensity is normalised to allow for the variation in the upstream solar wind proton concentration. The latitude of the cusp migrated equatorward while the lagged IMF pointed southward, confirming the lag calculation and indicating ongoing magnetopause reconnection. Dayside convection, as monitored by the SuperDARN network of radars, responded rapidly to the IMF changes but lagged behind the cusp proton emission response: this is shown to be as predicted by the model of flow excitation by Cowley and Lockwood (1992). We use the numerical cusp ion precipitation model of Lockwood and Davis (1996), along with modelled Lyman-_ emission efficiency and the SI-12 instrument response, to investigate the effect of the sheath field clock angle on the acceleration of ions on crossing the dayside magnetopause. This modelling reveals that the emission commences on each reconnected field line 2–2.5min after it is opened and peaks 3–5 min after it is opened. We discuss how comparison of the Lyman-alpha intensities with oxygen emissions observed simultaneously by the SI-13 channel of the FUV instrument offers an opportunity to test whether or not the clock angle dependence is consistent with the “component” or the “anti-parallel” reconnection hypothesis.

Towards a parallel computationally efficient approach to scaling up data stream classification

Advances in hardware technologies allow to capture and process data in real-time and the resulting high throughput data streams require novel data mining approaches. The research area of Data Stream Mining (DSM) is developing data mining algorithms that allow us to analyse these continuous streams of data in real-time. The creation and real-time adaption of classification models from data streams is one of the most challenging DSM tasks. Current classifiers for streaming data address this problem by using incremental learning algorithms. However, even so these algorithms are fast, they are challenged by high velocity data streams, where data instances are incoming at a fast rate. This is problematic if the applications desire that there is no or only a very little delay between changes in the patterns of the stream and absorption of these patterns by the classifier. Problems of scalability to Big Data of traditional data mining algorithms for static (non streaming) datasets have been addressed through the development of parallel classifiers. However, there is very little work on the parallelisation of data stream classification techniques. In this paper we investigate K-Nearest Neighbours (KNN) as the basis for a real-time adaptive and parallel methodology for scalable data stream classification tasks.

Fast adaptive real-time classification for data streams with concept drift

An important application of Big Data Analytics is the real-time analysis of streaming data. Streaming data imposes unique challenges to data mining algorithms, such as concept drifts, the need to analyse the data on the fly due to unbounded data streams and scalable algorithms due to potentially high throughput of data. Real-time classification algorithms that are adaptive to concept drifts and fast exist, however, most approaches are not naturally parallel and are thus limited in their scalability. This paper presents work on the Micro-Cluster Nearest Neighbour (MC-NN) classifier. MC-NN is based on an adaptive statistical data summary based on Micro-Clusters. MC-NN is very fast and adaptive to concept drift whilst maintaining the parallel properties of the base KNN classifier. Also MC-NN is competitive compared with existing data stream classifiers in terms of accuracy and speed.

Food geographies I: relational foodscapes and the busy-ness of being more-than-food

The study of foodscapes has spread throughout geography at the same time as food scholarship has spearheaded post-disciplinary research. This report argues that geographers have taken to post-disciplinarity to explore the ways that food is ‘more-than-food’ through analyses of the visceral nature of eating and politics and the vital (re)materializations of food’s cultural geographies. Visceral food geographies illuminate what I call the ‘contingent relationalities’ of food in the critical evaluation of the indeterminate, situated politics of ‘feeling food’ and those of the embodied collectivities of obesity. Questions remain, however, about how a visceral framework might be deployed for broader critiques within foodscapes and the study of human geography. The study of food’s vital materialisms opens up investigation into the practices of the ‘makings’ of meat, food waste and eating networks. Analysis of affect, embodiment and cultural practices is central to these theorizations and suggests consideration of the multiple materialisms of food, space and eating. There is, I contend, in the more radical, ‘post-relational’ approaches to food, the need for a note of caution. Exuberant claims for the ontological, vital agency of food should be tempered by, or at least run parallel to, critical questions of the real politik of political and practical agency in light of recent struggles over austerity, food poverty and food justice.

Absence of Melatonin Induces Night-Time Hepatic Insulin Resistance and Increased Gluconeogenesis Due to Stimulation of Nocturnal Unfolded Protein Response

It is known that the circadian rhythm in hepatic phosphoenolpyruvate carboxykinase expression (a limiting catalytic step of gluconeogenesis) and hepatic glucose production is maintained by both daily oscillation in autonomic inputs to the liver and night feeding behavior. However, increased glycemia and reduced melatonin (Mel) levels have been recently shown to coexist in diabetic patients at the end of the night period. In parallel, pinealectomy (PINX) is known to cause glucose intolerance with increased basal glycemia exclusively at the end of the night. The mechanisms that underlie this metabolic feature are not completely understood. Here, we demonstrate that PINX rats show night-time hepatic insulin resistance characterized by reduced insulin-stimulated RAC-alpha serine/threonine-protein kinase phosphorylation and increased phosphoenolpyruvate carboxykinase expression. In addition, PINX rats display increased conversion of pyruvate into glucose at the end of the night. The regulatory mechanism suggests the participation of unfolded protein response (UPR), because PINX induces night-time increase in activating transcription factor 6 expression and prompts a circadian fashion of immunoglobulin heavy chain-binding protein, activating transcription factor 4, and CCAAT/enhancer-binding protein-homologous protein expression with Zenith values at the dark period. PINX also caused a night-time increase in Tribble 3 and regulatory-associated protein of mammalian target of rapamycin; both were reduced in liver of PINX rats treated with Mel. Treatment of PINX rats with 4-phenyl butyric acid, an inhibitor of UPR, restored night-time hepatic insulin sensitivity and abrogated gluconeogenesis in PINX rats. Altogether, the present data show that a circadian oscillation of UPR occurs in the liver due to the absence of Mel. The nocturnal UPR activation is related with night-time hepatic insulin resistance and increased gluconeogenesis in PINX rats. (Endocrinology 152: 1253-1263, 2011)

Effects of intensity and positional predictability of a visual stimulus on simple reaction time

The influence of visual stimuli intensity on manual reaction time (RT) was investigated under two different attentional settings: high (Experiment 1) and low (Experiment 2) stimulus location predictability. These two experiments were also run under both binocular and monocular viewing conditions. We observed that RT decreased as stimulus intensity increased. It also decreased as the viewing condition was changed from monocular to binocular as well as the location predictability shifted from low to high. A significant interaction was found between stimulus intensity and viewing condition, but no interaction was observed between neither of these factors and location predictability. These findings support the idea that the stimulus intensity effect arises from purely sensory, pre-attentive mechanisms rather than deriving from more efficient attentional capture. (C) 2010 Elsevier Ireland Ltd. All rights reserved.

The Schenberg data acquisition and analysis: results from its first commissioning run

The Mario Schenberg gravitational wave detector has started its commissioning phase at the Physics Institute of the University of Sao Paulo. We have collected almost 200 h of data from the instrument in order to check out its behavior and performance. We have also been developing a data acquisition system for it under a VXI System. Such a system is composed of an analog-to-digital converter and a GPS receiver for time synchronization. We have been building the software that controls and sets up the data acquisition. Here we present an overview of the Mario Schenberg detector and its data acquisition system, some results from the first commissioning run and solutions for some problems we have identified.

PARALLEL ALGORITHMS FOR MAXIMAL CLIQUES IN CIRCLE GRAPHS AND UNRESTRICTED DEPTH SEARCH

We present parallel algorithms on the BSP/CGM model, with p processors, to count and generate all the maximal cliques of a circle graph with n vertices and m edges. To count the number of all the maximal cliques, without actually generating them, our algorithm requires O(log p) communication rounds with O(nm/p) local computation time. We also present an algorithm to generate the first maximal clique in O(log p) communication rounds with O(nm/p) local computation, and to generate each one of the subsequent maximal cliques this algorithm requires O(log p) communication rounds with O(m/p) local computation. The maximal cliques generation algorithm is based on generating all maximal paths in a directed acyclic graph, and we present an algorithm for this problem that uses O(log p) communication rounds with O(m/p) local computation for each maximal path. We also show that the presented algorithms can be extended to the CREW PRAM model.