Miracle-dz/UniFAR-FTUs huggingface dataset:
Detection of microcalcifications in mammograms using multi-chromosome Cartesian genetic programming

Mammograms are high resolution x-rays of the breast that are widely used to screen for cancer in women. This paper describes the first stage of development of a novel representation of Cartesian Genetic Programming as part of a computer aided diagnostic system. Specifically, this work is concerned with automated recognition of microcalcifications, one of the key structures used to identify cancer. Results are presented for the application of the proposed algorithm to a number of mammogram sections taken from the Lawrence Livermore National Laboratory database. These demonstrate the proposed representation is effective in locating microcalcifications and will provide a promising basis on which to conduct future work in discriminating between microcalcifications that are indicative of cancer and those that are not.
Mass estimation and its applications

This paper introduces mass estimation--a base modelling mechanism in data mining. It provides the theoretical basis of mass and an efficient method to estimate mass. We show that it solves problems very effectively in tasks such as information retrieval, regression and anomaly detection. The models, which use mass in these three tasks, perform at least as good as and often better than a total of eight state-of-the-art methods in terms of task-specific performance measures. In addition, mass estimation has constant time and space complexities.
Enabling data-intensive biomedical science: gaps, opportunities, and challenges.

The challenges of data-intensive computing have been summarized (Gorton et al., 2008) as ‘‘managing and processing exponentially growing data volumes, often arriving in time-sensitive streams from arrays of sensors and instruments’’ and ‘‘significantly reducing data analysis cycles so that researchers can make timely decisions. ’’ The management of such data requires integrated services for the (high-speed) transfer, storage, indexing, and retrieval of data. Enabling technologies for data management are under active development and investigation (including high-speed networks such as those studied by GENI (http://www.geni.net/), high-performance file systems and semantic ontologies for data access). In addition to existing cluster-based highperformance computing solutions, data-intensive cloud programming environments (e.g., MapReduce and Dryad) are emerging technologies that show promise. The Ohio Supercomputer Center (OSC) has supported data-intensive science projects in the physical sciences [e.g., ALICE—A Large Ion Collider Experiment (http://www .osc.edu/press/releases/2010/supercollider.shtml)] and the environmental sciences [e.g., ASR—Arctic System Reanalysis (http://www.osc.edu/press/releases/2007/bromwich.shtml)]. In biomedical sciences, OSC is actively supporting dataintensive biomedical research groups located at the Comprehensive Cancer Center (CCC) at The Ohio State University’s Medical Center as well as those at the Research Institute at Nationwide Children’s Hospital (RINCH). These organizations contain a number of core facilities, common laboratories providing analysis to a collection of research and clinical groups. Currently, OSC is engaged with the following core facilities at the CCC:
Models for longitudinal network datain

This chapter treats statistical methods for network evolution. It is argued that it is most fruitful to consider models where network evolution is represented as the result of many (usually non-observed) small changes occurring between the consecutively observed networks. Accordingly, the focus is on models where a continuous-time network evolution is assumed although the observations are made at discrete time points (two or more). Three models are considered in detail, all based on the assumption that the observed networks are outcomes of a Markov process evolving in continuous time. The independent arcs model is a trivial baseline model. The reciprocity model expresses effects of reciprocity, but lacks other structural effects. The actor-oriented model is based on a model of actors changing their outgoing ties as a consequence of myopic stochastic optimization of an objective function. This framework offers the flexibility to represent a variety of network effects. An estimation algorithm is treated, based on a Markov chain Monte Carlo implementation of the method of moments. Preprint of: Snijders, Tom A.B. (2005). Models for Longitudinal Network Data. Chapter 11 (pp. 215–247) in P. Carrington, J. Scott, and S. Wasserman (Eds.), Models and methods in social network analysis. New York: Cambridge University Press.
Concurrent Multipath Transfer Using SCTP Multihoming Over Independent End-to-End Paths

Concurrent multipath transfer (CMT) uses the Stream Control Transmission Protocol's (SCTP) multihoming feature to distribute data across multiple end-to-end paths in a multihomed SCTP association. We identify three negative side-effects of reordering introduced by CMT that must be managed before efficient parallel transfer can be achieved: (1) unnecessary fast retransmissions by a sender; (2) overly conservative congestion window (cwnd) growth at a sender; and (3) increased ack traffic due to fewer delayed acks by a receiver. We propose three algorithms which augment and/or modify current SCTP to counter these side-effects. Presented with several choices as to where a sender should direct retransmissions of lost data, we propose five retransmission policies for CMT. We demonstrate spurious retransmissions in CMT with all five policies and propose changes to CMT to allow the different policies. CMT is evaluated against AppStripe, which is an idealized application that stripes data over multiple paths using multiple SCTP associations. The different CMT retransmission policies are then evaluated with varied constrained receive buffer sizes. In this foundation work, we operate under the strong assumption that the bottleneck queues on the end-to-end paths used in CMT are independent
ABF++: fast and robust angle based flattening

Conformal parameterization of mesh models has numerous applicationsin geometry processing. Conformality is desirable for remeshing,surface reconstruction, and many other mesh processingapplications. Subject to the conformality requirement, theseapplications typically benefit from parameterizations with smallerstretch. The Angle Based Flattening (ABF) method, presented a fewyears ago, generates provably valid conformal parameterizationswith low stretch. However, it is quite time-consuming and becomeserror prone for large meshes due to numerical error accumulation.This work presents ABF&plus;&plus;, a highly efficientextension of the ABF method, that overcomes these drawbacks whilemaintaining all the advantages of ABF. ABF++ robustly parameterizesmeshes of hundreds of thousands and millions of triangles withinminutes. It is based on three main components: (1) a new numericalsolution technique that dramatically reduces the dimension of thelinear systems solved at each iteration, speeding up the solution;(2) a new robust scheme for reconstructing the 2D coordinates fromthe angle space solution that avoids the numerical instabilitieswhich hindered the ABF reconstruction scheme; and (3) an efficienthierarchical solution technique. The speedup with (1) does not comeat the expense of greater distortion. The hierarchical technique(3) enables parameterization of models with millions of faces inseconds at the expense of a minor increase in parametricdistortion. The parameterization computed by ABF++ are provablyvalid, that is they contain no flipped triangles. As a result ofthese extensions, the ABF++ method is extremely suitable forrobustly and efficiently parameterizing models forgeometry-processing applications.
Young school-aged children's behaviour and their participation in extracurricular activities

WHILE RESEARCH HAS REPEATEDLY shown the benefits of participation in extracurricular activities for adolescents, few studies have focused on very young children. Extracurricular activities afford children opportunities for development and can also influence their behaviour. Children's behaviour is an important predictor of their future successes or failures. This study investigated the relationship between behaviour and participation in extracurricular activities in children aged between five and eight years. Mothers of children (n = 906) in Prep to Year 3 from seven schools in middle- to high-SES areas from a regional city participated in the study. Mothers gave details of their child's extracurricular activities and used the Strengths and Difficulties Questionnaire (SDQ) (Goodman, 1997) to measure their child's behaviour. Low scores on the SDQ indicate normal behaviour while high scores indicate borderline or abnormal behaviour. Participation, number of activities, and duration of activities were all associated with children's behaviour. Children who participated in extracurricular activities had lower behaviour scores than those who did not. The results suggest that children benefit from participating in two or more activities for 80–90 minutes per week.
Effective Density Queries on ContinuouslyMoving Objects

This paper assumes a setting where a population of objects move continuously in the Euclidean plane. The position of each object, modeled as a linear function from time to points, is assumed known. In this setting, the paper studies the querying for dense regions. In particular, the paper defines a particular type of density query with desirable properties and then proceeds to propose an algorithm for the efficient computation of density queries. While the algorithm may exploit any existing index for the current and near-future positions of moving objects, the Bx-tree is used. The paper reports on an extensive empirical study, which elicits the performance properties of the algorithm.
A proof of the identifiability of a subspace-based blind channel estimation for OFDM systems

Muquet et al. (2002) have proposed a subspace-based blind method for estimating the channel responses of cyclic-prefixed OFDM systems. Their proof for the channel identifiability uses the roots of channel transfer function and therefore depends on the channel order. When only an upper bound is known for the channel order, the proof fails. In this letter, a new proof for the identifiability is given which does not require knowledge of the precise channel order and can handle various choices of length of the OFDM block.
Fractal Dimension of EEG Activity Senses Neuronal Impairment in Acute Stroke

The brain is a self-organizing system which displays self-similarities at different spatial and temporal scales. Thus, the complexity of its dynamics, associated to efficient processing and functional advantages, is expected to be captured by a measure of its scale-free (fractal) properties. Under the hypothesis that the fractal dimension (FD) of the electroencephalographic signal (EEG) is optimally sensitive to the neuronal dysfunction secondary to a brain lesion, we tested the FD’s ability in assessing two key processes in acute stroke: the clinical impairment and the recovery prognosis. Resting EEG was collected in 36 patients 4–10 days after a unilateral ischemic stroke in the middle cerebral artery territory and 19 healthy controls. National Health Institute Stroke Scale (NIHss) was collected at T0 and 6 months later. Highuchi FD, its inter-hemispheric asymmetry (FDasy) and spectral band powers were calculated for EEG signals. FD was smaller in patients than in controls (1.447±0.092 vs 1.525±0.105) and its reduction was paired to a worse acute clinical status. FD decrease was associated to alpha increase and beta decrease of oscillatory activity power. Larger FDasy in acute phase was paired to a worse clinical recovery at six months. FD in our patients captured the loss of complexity reflecting the global system dysfunction resulting from the structural damage. This decrease seems to reveal the intimate nature of structure-function unity, where the regional neural multi-scale self-similar activity is impaired by the anatomical lesion. This picture is coherent with neuronal activity complexity decrease paired to a reduced repertoire of functional abilities. FDasy result highlights the functional relevance of the balance between homologous brain structures’ activities in stroke recovery.
Three-dimensional control of Tetrahymena pyriformis using artificial magnetotaxis

We demonstrate three-dimensional control with the eukaryotic cell Tetrahymena pyriformis (T. pyriformis) using two sets of Helmholtz coils for xy-plane motion and a single electromagnet for z-direction motion. T. pyriformis is modified to have artificial magnetotaxis with internalized magnetite. To track the cell’s z-axis position, intensity profiles of non-motile cells at varying distances from the focal plane are used. During vertical motion along the z-axis, the intensity difference is used to determine the position of the cell. The three-dimensional control of the live microorganism T. pyriformis as a cellular robot shows great potential for practical applications in microscale tasks, such as target transport and cell therapy.
Distortion-optimized video encoding and streaming in multi-rate wireless lans

In this paper, we present a cross-layer methodology for video streaming in wireless LANs that employs joint source coding and rate adaptation at the wireless physical layer (PHY). More specifically, we investigate the impact of adapting the PHY transmission rate, and thus changing the throughput and packet loss channel characteristics, on the rate-distortion (RD) performance of a transmitted video sequence. We develop an algorithm that jointly optimizes source coding, application-layer channel coding, and the PHY rate adaptation. Simulation results obtained with the H.264/AVC codec, demonstrate video quality improvements when compared with a system that employs PHY rate adaptation independently from the application layer.
A Correctness Condition for High-Performance Multiprocessors

Hybrid consistency, a consistency condition for shared memory multiprocessors, attempts to capture the guarantees provided by contemporary high-performance architectures. It combines the expressiveness of strong consistency conditions (e.g., sequential consistency, linearizability) and the efficiency of weak consistency conditions (e.g., pipelined RAM, causal memory). Memory access operations are classified as either strong or weak. A global ordering of strong operations at different processes is guaranteed, but there is very little guarantee on the ordering of weak operations at different processes, except for what is implied by their interleaving with the strong operations. A formal and precise definition of this condition is given and an algorithm for providing hybrid consistency on distributed memory machines is presented. The response time of the algorithm is proved to be within a constant multiplicative factor of the (theoretical) optimal time bounds.
A body-oriented method for finding a linear form of the dynamic equation of fully parallel robots

In order to identify the dynamic parameters in nonlinear adaptive control the robot's dynamic equation has to be written in a linear form. Many methods have been proposed for serial robots, but for parallel robots, the few solutions proposed so far lead to complicated equations that are not readily usable for real-time implementation. In this paper we propose a new method based on the virtual work principle to find a linear form of the dynamic equation of robots. Compared to other methods, it has the advantage that it does not need to open the closed loop structure into a tree-structure robot. It considers rather each body separately using its Jacobian matrix to project the forces into the joint space of the robot. Thus, simplification can be made at the very beginning of the modeling. This is very efficient when used to model fully parallel robots. As an illustration, the proposed method is applied to the 3dof DELTA parallel robot.
Supplementary Information for The Carbon Abatement Potential of High Penetration Intermittent Renewables

The statistical model for wind power employed in [Hart and Jacobson(2011)] relied on the application of a power curve to simulated wind speeds at each site in order to approximate the output of wind power from each farm. This model used a single average wind speed at each time step for each site in order to reduce computational complexity. This approximation was later found to overestimate the wind power produced in aggregate, when compared to the predicted wind power output supplied in the Western Wind Dataset [3TIER(2010)]. To improve the treatment of wind power, an autoregressive-like model was developed for the forecast error of the total aggregated wind power output (the sum of the power output reported for each site in the dataset). In the updated model, the normalized aggregated wind power, g(t) is approximated from the forecasted wind power, ĝ(t) according to:
Organizational Work Groups Experiencing a Sudden and Unexpected Loss of a Member

vii List of Figures . xii Chapter 1: Introduction . 1 Topic and Research Problem . 1 Research Concern and Purpose of the Study . 1 Delimitations . 6 Group Definitions . 6 Dissertation Organization . 7 Chapter 2: Literature Review . 9 Tuckman’s Stages . 9 William Bridges’ Theories on Organizations in Transition . 11 Symbolic Interactionism . 12 Peter Vaill’s Permanent White Water . 18 Self-Organization . 19 Kenneth J. Doka . 20 Therese A. Rando. 21 Resilience . 24 ix Emotional Intelligence . 26 A Challenge to the Notion of Stage Theories . 27 Relevance of Literature Review . 27 Chapter 3: Methodology . 29 Qualitative Research . 29 Grounded Theory . 29 Examples of Possible Sudden and Unexpected Losses That Will Be Studied . 29 One Organizational Event through Many Lenses . 30 Analytical Approach . 31 Timing of Event Data Collection . 33 Sample, Sampling Criteria, Recruitment, and Definition of a Work-Group . 35 Data Collection . 37 Scope of the Research . 46 Definition of Terms. 46 Summary . 48 Chapter 4: Research Findings . 49 Introduction . 49 Theme Development from Individual Groups . 49 Case #1: Terry’s University Work-Group name of work-group member lost – “John”. 49 x Case #2: Bert’s Work-Group name of work-group member lost: “Buddy” . 58 Case #3: Scott’s Work-Group name of work-group member lost: “Susan” . 66 Case #4: Kelly’s Work-Group Name of Work-Group Member Lost: “Renee” . 76 Case #5: Mark’s Work-Group Name of Work-Group Member Lost: “Lou Anne” . 87 Case #6” Denny’s Work-Group name of work-group member lost: “Russ”. 96 Emergent Ideas. 106 Bruce Tuckman’s Stages of Group Development . 106 William Bridges’ Theories on Organizations in Transition . 106 Peter Vaill’s “Permanent White Water” . 108 Meredith Belbin’s Team Role Inventories . 110 The Concept of Collective Intelligence . 112 Symbolic Interactionism . 113 Susan A. Berger’s Five Identities of Grievers . 115 Disenfranchised Grief . 116 Frank Eyetsemitan’s Stifled Grief . 117 Chapter 5: Discussion, Conclusions, and Recommendations for Further Research . 119 Theory Development . 119 Model Based Upon Theme Progressions (Emergent Theory) . 121 Importance of This Research . 133 Future Research . 133 xi Implications for Organization Development . 134 Personal Impact . 134 References . 137 Appendix A: “The Darcy Principle” . 142 Appendix B: “Kireji (or the “cutting word”) . 143 Appendix C: Rex Gall Retires . 145 Appendix D: “In The Aeroplane Over The Sea” by Neutral Milk Hotel (by Jeff Mangum) . 146
Towards Opinion Mining Through Tracing Discussions on the Web

This paper reports on our ongoing work regarding opinion mining from Web-based discussion forums in the realm of the Understanding Advertising (UAd) project. Our approach to opinion mining is to first RDFise discussion forums in SIOC, and in a second phase to interlink the so created data with linked datasets such as DBpedia. We are confident that this should allow a market researcher to formulate queries using domain semantics and hence understand what people think about a certain product or service. The system’s architecture, preliminary results, and the current available demonstrator are discussed in this work.
Early Psychosis Prevention and Intervention: Evolution of a Comprehensive Community-Based Specialised Service

This article describes the Early Psychosis Prevention and Intervention Centre (EPPIC) — an innovative and comprehensive service that attempts to address the needs of older adolescents and young adults experiencing their first episode of psychosis. Some of the key theoretical concepts and philosophical tenets which underpin the service delivery model are adumbrated. Furthermore, the historical antecedents of the current service, and the “successive approximations” approach taken in developing the same, are delineated. Given the evolutionary nature of the program, the perceived future needs and developments are stipulated.
Compiling for fine-grain concurrency: planning and performing software thread integration

Embedded systems require control of many concurrent real-time activities, leading to system designs which feature multiple hardware peripherals with each providing a specific, dedicated service. These peripherals increase system size, cost, weight, power and design time. Software thread integration (STI) provides low-cost thread concurrency on general-purpose processors by automatically interleaving multiple (potentially real-time) threads of control into one. This simplifies hardware to software migration (which eliminates dedicated hardware) and can help embedded system designers meet design constraints. This paper introduces automated methods for planning and performing the code transformations needed for integration of functions with more sophisticated control flows than in previous work. We demonstrate the methods by using Thrint, our post-pass thread-integrating compiler, to automatically integrate multiple threads for a sample real-time embedded system with fine-grain concurrency. The sample application generates an NTSC monochrome video signal (sending out a stream of pixels to a video DAC) with STI to replace a video refresh controller IC Using Thrint reduces integration time from days to minutes and, by reclaiming idle time, speeds up graphics rendering by 3.2/spl times/ to 3.8/spl times/ in the three functions examined.