Miracle-dz/UniFAR-FTUs huggingface dataset:
Transformational maintenance by reuse of design histories

This thesis provides theory and procedures for modifying software artifacts implemented by a formal transformation process. Installing modifications requires knowing not only what transformations were applied (a derivation history) to construct the artifact, but also why the application sequence ensures that the artifact meets its specification. The derivation history and the justification are collectively called a design history. A Design Maintenance System (DMS), when provided with a formal change called a maintenance delta, revises a design history to guide construction of a new artifact. A DMS can be used to integrate a stream of deltas into a history, providing implementations as a side effect, leading to an incremental-evolution model for software construction. We provide a broadly applicable formal model of transformation systems in which specifications are performance predicates, subsuming the functional specifications which are traditional for transformation systems. Such performance predicates provide vocabulary used in the design history to describe the effect of applying sets of transformations. A nonprocedural, performance-goal-oriented Transformation Control Language (TCL) is defined to control navigation of the design space for a transformation system. Recording the execution of a TCL metaprogram directly provides a design history. A complete classification of, and representation for, the set of possible maintenance deltas is given in terms of the inputs defined by the transformation system model. Such deltas include not only specification changes, but also changes to implementation support technologies. Delta integration procedures for revising derivation histories given functional or support technology deltas are provided, based on rearranging the order of transformations in the design space. Building on these operations, integration procedures that revise the design history for each type of delta are described. An agenda-oriented TCL execution process dovetails smoothly with the integration procedures. Our DMS is compared to a number of other maintenance systems. By using an explicit delta and verified commutativity, our DMS often reuses transformations correctly when others fail.
The Cambridge Handbook of Multimedia Learning: An Integrated Model of Text and Picture Comprehension

Abstract This chapter presents an integrated model of text and picture comprehension that takes into account that learners can use multiple sensory modalities. The model encompasses reading comprehension, listening comprehension, visual picture comprehension, and sound comprehension (i.e., auditory picture comprehension). The model's cognitive architecture consists of sensory registers, working memory, and long-term memory. It furthermore includes a cognitive level and a perceptual level. The cognitive level is characterized by two representational channels: a verbal channel and a pictorial channel. The perceptual level is characterized by multiple sensory channels. After presenting the model, the chapter derives predictions, which can be empirically tested. It reports research findings that can be explained by the model, and it derives practical suggestions for instructional design. Finally, the chapter discusses limitations of the model and points out directions for further research. Introduction The term multimedia means different things on different levels. On the level of technology, it means the use of multiple delivery media such as computers, screens, and loudspeakers. On the level of presentation formats, it means the use of different forms of representation such as texts and pictures. On the level of sensory modalities, it means the use of multiple senses such as the eye and the ear. The level of technology is of course very important in practice, but it is not of high interest from a psychological point of view, because comprehension is not fundamentally different when a text passage is delivered either by a computer screen or by a printed book, or if a picture is presented by a poster or by a slide.
John Dewey's Pragmatic Technology

EditorOs Foreword by Don Ihde Acknowledgments Introduction Abbreviations Chapter 1: Locating DeweyOs Critique of Technology Chapter 2: Knowing as a Technological Artifact Chapter 3: Productive Skills in the Arts Chapter 4: From Techne to Technology Chapter 5: Theory, Practice, and Production Chapter 6: Instruments, History, and Human Freedom Chapter 7: Publics as Products Epilogue: Responsible Technology Appendix: Pagination Key to Works Cited Notes Index
Trellis-Based Detecting the Insertion and Deletion Bits for Bit-Patterned Media Recording

Bit-patterned media recording (BPMR) is one of the promising technologies for realizing an areal density up to 4 Tb/in2; however, it poses new challenges to read channel design, including the two-dimensional (2D) interference, media noise, and track mis-registration. Furthermore, the BPMR system encounters the insertion, deletion and substitution errors, which are primarily caused by mis-synchronization between the write clock and the island positions. In this paper, we propose a novel detection method that exploits the trellis structure to detect the occurrence of insertion/deletion bits. Specifically, the specific marker bits are inserted periodically inside an input data sequence before recording onto a magnetic medium. Hence, the branch metric calculation is monitored during the marker bits to determine if there is any insertion/deletion error in the system. Numerical results indicate that the proposed method can performs better than the conventional one in terms of the percentage of detection and the percentage of missed detection and false-alarm, especially at low signal-to-noise ratio scenario.
Improving locality and parallelism in nested loops

Researchers have identified a core set of program transformations that are effective in array-based loop nest optimization: these loop transformations include interchange, skewing, reversal and tiling. Researchers have studied these transformations individually for their legality and effect on parallelism and memory hierarchy performance; but they have not discussed in any detail how to choose the combination of transformations that best optimizes a loop nest. Other researchers have taken another approach: they consider each loop nest as a whole, applying an elegant matrix theory of loop nest transformation, but one that is only applicable to a limited class of loop nests, those whose dependences can be expressed as distance vectors. In this limited context, the problems of memory hierarchy improvement and parallelization are simplified, but their approach has not been extended to apply to general loop nests. We have combined the elegance of the matrix theory with the generality of general dependence vectors into a new theory of loop transformation. This theory has enabled us to apply an algorithmic approach to solving optimization goals. Using this theory, we have developed efficient algorithms for the compiler to use to improve memory hierarchy utilization and parallelism of general loop nests. The parallelization improving algorithm maximizes the degree of parallelism within a loop nest, at either a coarse or fine granularity. The locality improving algorithm uses the same theory, and also reuse information about array accesses within loop nests, to guide the transformation process. The parallelization and locality improvement algorithms are unified so that locality and parallelism can be improved simultaneously without significantly reducing either. We have implemented versions of these algorithms in Stanford's SUIF compiler and performed experimentation on the Perfect Club and the NASA kernels. We have found compiler locality improvement to significantly improve performance when applicable. We have also demonstrated a tremendous sensitivity of performance on tile size for tiled codes on machines with direct-mapped or low set associativity caches.
The Universal Transactional Memory Construction

The universal construction shows how to convert a sequential algorithm into a concurrent wait-free algorithm. We introduce a variant of this construction that (1) keeps a bounded state, (2) provides wait-free parallel processing, (3) tolerates thread crashes, and (4) handles non-terminating operations. The foundation of this construction is a wait-free transactional memory that is capable of isolating crash failures and non-termination failures.
Continuous-speech recognition using a stochastic language model

The authors describe the design of a stochastic language model and its integration into a continuous-speech recognition system that is part of the SPICOS system for understanding database queries spoken in natural language. The recognition strategy is based on statistical decision theory. The stochastic language model for the recognition of database queries is based on probabilities of trigrams, bigrams, and unigrams of word categories, which are intended to reflect lexical and semantic aspects of the SPICOS task. The implementation of stochastic language models in the search procedure is described, and results of recognition experiments are given. By using a stochastic model (perplexity = 124) a reduction of the word error rate from 21.8% without language model (perplexity = 917) to 9.1% was achieved. <<ETX>>
Performance-oriented technology mapping

This thesis presents a variety of techniques to minimize circuit delay during the translation of a set of Boolean equations into a list of connected logic gates that can be used for the manufacturing of combinational digital circuits. This translation process is called technology mapping. The first contribution of this work is to present an optimal algorithm to implement a Boolean circuits that can be represented as trees using an extension of known tree covering algorithms. The second and more important contribution of this work is an in-depth analysis of fanout optimization. The fanout problem is the problem of distributing a signal to several destinations, where the signal may be required at different times, in order to minimize the overall delay. This work presents the most detailed theoretical study of the complexity of fanout optimization published so far, and a spectrum of heuristics to solve the fanout problem under realistic delay models. This thesis also introduces a simple algorithm that can be used to apply fanout optimization to an entire network. This algorithm yields an optimal application of fanout optimization in terms of delay, while keeping area increase of the circuit to a low value. To study the integration of tree covering and fanout optimization, this work introduces a technology independent delay model that characterizes precisely suboptimalities due to inbalances in a network. This is the first technology independent delay model that models the delay through a node as a function of the arrival time distribution at a node. This delay model can be used to derive analytically optimal solutions in simple cases, which can be used to measure the suboptimality of heuristics. An extension to tree covering is then suggested, and shown to provide significant delay reductions for a relatively heavy cost in area. Finally this work investigates technology independent delay optimization techniques based on partial or total collapsing of logic, and shows that further delay reductions can be achieved with these techniques possibly at a higher cost in area.
Cost and Performance of Computer-Assisted Instruction for Education of Disadvantaged Children

MF-$0.65 HC-$3.29 Achievement Gains; Arithmetic; *Computer Assisted Instruction; *Disadvantaged Youth; *Evaluation; Instructional Media; Program Costs; Reading; *Research This paper is divided into three sections. The first section describes three programs in computer-assisted instruction (CAI) that have been developed by the Institute for Mathematical Studies in the Social Sciences at Stanford University and have performed well with underachieving children. These programs are in elementary arithmetic, initial reading, and computer programing for high school students. The second section, the major part of this paper, reports a detailed evaluation of these programs. Two criteria for successful performance are examined: simple achievement gain, and reduction of achievement inequality. The final section deals with the problem of making CAI available in rural as well as urban areas, and attempts a realistic assessment of the total costs. An estimate is also made of the increase in student to teacher ratio required to provide CAI without an increase in expenditure per student. (MM) U.S. DEPARTMENT OF HEALTH. EDUCATION & WELFARE OFFICE OF EDUCATION THIS DOCUMENT HAS BEEN REPRODUCED EXACTLY AS RECEIVED FROM THE PERSON OR ORGANIZATION ORIGINATING IT. POINTS OF VIEW on OPINIONS STATED DO NOT NECESSARILY REPRESENT OFFICIAL OFFICE OF EDUCATION POSITION OR pouce Graduate School of Business
Sentiment Analysis of Web Forums: Comparison Between SentiWordNet and SentiStrength

Internet has become a major tool for communication, training, fundraising, media operations, and recruitment, and these processes often use web forums. This paper intended to find suitable technique for analysing selected web forums that included radical content by presenting a comparison between SentiWordNet and SentiStrength. SentiWordNet is a lexical resource for supporting opinion mining by assigning a positivity score and a negativity score to each WordNet. SentiStrength is a technique that was developed from comments on MySpace. It uses human-designed lexical and emotional terms with a set of amplification, diminishing and negation rules. The results have been presented and discussed.
ROC Analysis by FCM Classifier with Particle Swarm Optimization

—Since different types of classiﬁers work best for different types of data, our approach is to parameterize the classiﬁer and tailor them to individual data set. In the proposed fuzzy c -means (FCM) classiﬁer, parameter values are chosen by evolutionary algorithms such as the particle swarm optimization (PSO). The free parameters of membership functions are optimized in order to increase true positive rate or true positive count. The golden section search is applied to select a cut-off point, which realizes a preselected positive count or false positive count. This makes classiﬁcation decisions more pragmatic than those by the standard methods with missclassiﬁcation rates or loss functions.
A Comparative study of ANN and SVM for EEG Classification

One of the research areas in biomedical signal processing is EEG signal processing. Epileptic seizures are disclosure of epilepsy. Brain disorders can be studied with the help of an electroencephalogram (EEG) signal for detection of epilepsy. In this proposed method, EEG signal is decomposed using DWT. Various dimension reduction methods are used for dimension reduction of decomposed data. The Classification is done with two classifiers for data as normal or abnormal. Performance of classifiers is compared to show the improved method.
Discriminators for use in flow-based classification

Any assessment of classification techniques requires data. This document describes sets of data intended to aid in the assessment of classification work. A number of data sets are described; each data set consists a number of objects, and each object is described by a group of features (also referred to as discriminators). Leveraged by a quantity of hand-classified data, each object within each data set represents a single flow of TCP packets between client and server. The features for each object consist of the (application-centric) classification derived elsewhere and a number of features derived as input to probabilistic classification techniques. In addition to describing the features, we also provide information allowing interested parties to retrieve these data sets for use in their own work. The data sets contain no site-identifying information; each object is only described by a set of statistics and a class that defines the causal application.
The Wall Street Journal Guide to Information Graphics: The Dos and Don'ts of Presenting Data, Facts, and Figures

In today's data-driven world, professionals need to know how to express themselves in the language of graphics effectively and eloquently. Yet information graphics is rarely taught in schools or is the focus of on-the-job training. Now, for the first time, Dona M. Wong, a student of the information graphics pioneer Edward Tufte, makes this material available for all of us. In this book, you will learn: * to choose the best chart that fits your data; * the most effective way to communicate with decision makers when you have five minutes of their time; * how to chart currency fluctuations that affect global business; * how to use color effectively; * how to make a graphic "colorful" even if only black and white are available. The book is organized in a series of mini-workshops backed up with illustrated examples, so not only will you learn what works and what doesn't but also you can see the dos and don'ts for yourself. This is an invaluable reference work for students and professional in all fields.
Haskell 98 language and libraries : the revised report

Part I. The Haskell 98 Language: 1 Introduction 2 Lexical structure 3 Expressions 4 Declarations and bindings 5 Modules 6 Predefined types and classes 7 Basic input/output 8 Standard prelude 9 Syntax reference 10 Specification of derived instances 11 Compiler pragmas Part II The Haskell 98 Libraries: 12 Rational numbers 13 Complex numbers 14 Numeric functions 15 Indexing operations 16 Arrays 17 List utilities 18 Maybe utilities 19 Character utilities 20 Monad utilities 21 Input/output 22 Directory functions 23 System functions 24 Dates and times 25 Locales 26 CPU time 27 Random numbers Bibliography.
Enhancing Virtual-Environment-Based Teamwork Training with Non-Verbal Communication

Virtual reality simulations for training surgical skills are increasingly used in medical education and have been shown to improve patient outcome. While advances in hardware and simulation techniques have resulted in many commercial applications for training technical skills, most of these simulators are extremely expensive and do not consider non-technical skills like teamwork and communication. This is a major drawback since recent research suggests that a large percentage of mistakes in clinical settings are due to communication problems. In addition, training teamwork can also improve the efficiency of a surgical team and as such reduce costs and workload. We present an inexpensive camera-based system for capturing aspects of non-verbal communication of users participating in virtual environment-based teamwork simulations. This data can be used for the enhancement of virtual-environment-based simulations to increase the realism and effectiveness of team communication.
Authorship Attribution of Short Messages Using Multimodal Features

Abstract : In this thesis, we develop a multimodal classifier for authorship attribution of short messages. Standard natural language processing authorship attribution techniques are applied to a Twitter text corpus. Using character n-gram features and a Na ve Bayes classifier, we build statistical models of the set of authors. The social network of the selected Twitter users is analyzed using the screen names referenced in their messages. The timestamps of the messages are used to generate a pattern-of-life model. We analyze the physical layer of a network by measuring modulation characteristics of GSM cell phones. A statistical model of each cell phone is created using a Na ve Bayes classifier. Each phone is assigned to a Twitter user, and the probability outputs of the individual classifiers are combined to show that the combination of natural-language and network-feature classifiers identifies a user to phone binding better than when the individual classifiers are used independently.
Active controls: A look at analytical methods and associated tools

A review of analytical methods and associated tools for active controls analysis and design problems is presented. Approaches employed to develop mathematical models suitable for control system analysis and/or design are discussed. Significant efforts have been expended to develop tools to generate the models from the standpoint of control system designers' needs and to develop the tools necessary to analyze and design active control systems. Representative examples of these tools are discussed. Examples where results from the methods and tools have been compared with experimental data are also presented. Finally, a perspective on future trends in analysis and design methods is presented.
GPU-ACELERATED POLYGONIZATION OF IMPLICIT SURFACES

In this paper we discuss an algorithm that approximates dynamically changing implicit surfaces with a polygonal representation. The algorithm is loosely based on the ”Marching tetrahedrons” algorithm, but is designed to run on modern GPUs, taking advantage of their highly parallelized architecture and computational power. Unlike algorithms that approximate static surfaces and store the representation for subsequent rendering, this algorithm is better suited for situations where the surface definition changes over time and its polygonal representation at a particular moment in time is rendered only once and then discarded.
CyberOrgs: A Model for Resource Bounded Complex Agents

The ubiquity of networked computing devices combined with recent advances in computer networks technology have created the possibility of harnessing the collective computational power of peer computational resources to carry out very large computations. Agents offer a natural framework for abstracting distributed computations. However, the framework needs to be adapted to explicitly model resources and their ownership in a way that transforms a network of peer-owned resources into a distributed execution environment that can hosts peer-initiated multi-agent computations. Additionally, mechanisms are required for supporting trade in peer-owned resources as well as control of available resources. This thesis proposes CyberOrgs as a model for resource bounded multi-agent computations over a network of peer-owned resources. CyberOrgs compose Agents with a model for resource acquisition and control, so that computations carried out by ensembles of agents along with resources committed to their execution are encapsulated inside resource boundaries. Specifically, each cyberorg owns resources and eCash to purchase additional resources with; it manages a concurrent computation being pursued by an ensemble of agents, and supports their execution by purchasing resources for them from other cyberorgs; and, it provides resources to other cyberorgs in exchange for eCash in accordance with contracts negotiated with them. A transition system has been developed to concretize the operational semantics of CyberOrgs, and some properties of the model have been examined. A prototype implementation has been developed as an Actor program which offers programming constructs to support acquisition and control of resources, while allowing a programmer to keep resource and functional concerns of an application separate. The expressive power of these constructs is illustrated using examples.