Miracle-dz/UniFAR-FTUs huggingface dataset:
Automatic Discovery and Exposition of Parallelism in Serial Applications for Compiler-Inserted Runtime Adaptation

Automatic Discovery and Exposition of Parallelism in Serial Applications for Compiler-Inserted Runtime Adaptation David Greenland Department of Electrical and Computer Engineering Master of Science Compiler-Inserted Runtime Adaptation (CIRA) is a compilation and runtime adaptation strategy which has great potential for increasing performance in multicore systems. In this strategy, the compiler inserts directives into the application which will adapt the application at runtime. Its ability to overcome the obstacles of architectural and environmental diversity coupled with its flexibility to work with many programming languages and styles of applications make it a very powerful tool. However, it is not complete. In fact, there are many pieces still needed to accomplish these lofty goals. This work describes the automatic discovery of parallelism inherent in an application and the generation of an intermediate representation to expose that parallelism. This work shows on six benchmark applications that a significant amount of parallelism which was not initially apparent can be automatically discovered. This work also shows that the parallelism can then be exposed in a representation which is also automatically generated. This is accomplished by a series of analysis and transformation passes with only minimal programmer-inserted directives. This series of passes forms a necessary part of the CIRA toolchain called the concurrency compiler. This concurrency compiler proves that a representation with exposed parallelism and locality can be generated by a compiler. It also lays the groundwork for future, more powerful concurrency compilers. This work also describes the extension of the intermediate representation to support hierarchy, a prerequisite characteristic to the creation of the concurrency compiler. This extension makes it capable of representing many more applications in a much more effective way. This extension to support hierarchy allows much more of the parallelism discovered by the concurrency compiler to be stored in the representation.
Data Mining: The Textbook

This textbook explores the different aspects of data mining from the fundamentals to the complex data types and their applications, capturing the wide diversity of problem domains for data mining issues. It goes beyond the traditional focus on data mining problems to introduce advanced data types such as text, time series, discrete sequences, spatial data, graph data, and social networks. Until now, no single book has addressed all these topics in a comprehensive and integrated way. The chapters of this book fall into one of three categories: Fundamental chapters: Data mining has four main problems, which correspond to clustering, classification, association pattern mining, and outlier analysis. These chapters comprehensively discuss a wide variety of methods for these problems. Domain chapters: These chapters discuss the specific methods used for different domains of data such as text data, time-series data, sequence data, graph data, and spatial data. Application chapters: These chapters study important applications such as stream mining, Web mining, ranking, recommendations, social networks, and privacy preservation. The domain chapters also have an applied flavor. Appropriate for both introductory and advanced data mining courses, Data Mining: The Textbook balances mathematical details and intuition. It contains the necessary mathematical details for professors and researchers, but it is presented in a simple and intuitive style to improve accessibility for students and industrial practitioners (including those with a limited mathematical background). Numerous illustrations, examples, and exercises are included, with an emphasis on semantically interpretable examples. Praise for Data Mining: The Textbook - As I read through this book, I have already decided to use it in my classes. This is a book written by an outstanding researcher who has made fundamental contributions to data mining, in a way that is both accessible and up to date. The book is complete with theory and practical use cases. Its a must-have for students and professors alike! " -- Qiang Yang, Chair of Computer Science and Engineering at Hong Kong University of Science and Technology"This is the most amazing and comprehensive text book on data mining. It covers not only the fundamental problems, such as clustering, classification, outliers and frequent patterns, and different data types, including text, time series, sequences, spatial data and graphs, but also various applications, such as recommenders, Web, social network and privacy. It is a great book for graduate students and researchers as well as practitioners. " -- Philip S. Yu, UIC Distinguished Professor and Wexler Chair in Information Technology at University of Illinois at Chicago
A Framework Design for Utilization in Facilitating Contextualised mLearning

This paper presents an intelligent, light-weight, distributed and Java-based framework design for the presentation of mobile services (mServices) within a mobile eLearning (mLearning) InfoStation-based environment. The framework has been developed by incorporating inversion of control (IoC) design patterns and is maintained by a light-weight HTTP container. A multi-agent system (MAS) acts as a bridge between the mService applications and mobile users. The concept for the light-weight, intelligent and distributed design of the framework is presented.
RITSim: distributed systemC simulation

Parallel or distributed simulation is becoming more than a novel way to speedup design evaluation; it is becoming necessary for simulating modern processors in a reasonable timeframe. As architectural features become faster, smaller, and more complex, designers are interested in obtaining detailed and accurate performance and power estimations. Uniprocessor simulators may not be able to meet such demands. The RITSim project uses SystemC to model a processor microarchitecture and memory subsystem in great detail. SystemC is a C++ library built on a discrete-event simulation kernel. Many projects have successfully implemented parallel discrete-event simulation (PDES) frameworks to distribute simulation among several hosts. The field promises significant simulation speedup, possibly leading to faster turnaround time in design space exploration and commercial production. However, parallel implementation of such simulators is not an easy task. It requires modification of the simulation kernel for effective partitioning and synchronization. This thesis explores PDES techniques and presents a distributed version of the SystemC simulation environment. With minimal user interaction, SystemC models can be executed on a cluster of workstations using a message-passing library such as the Message Passing Interface (MPI). The implementation is designed for transparency; distribution and synchronization happen with little intervention by the model author. Modification of SystemC is fashioned to promote maintainability with future releases. Furthermore, only freely available libraries are used for maximum flexibility and portability.
Performance Controlled Power Optimization for Virtualized Internet Datacenters

Modern data centers must provide performance assurance for complex system software such as web applications. In addition, the power consumption of data centers needs to be minimized to reduce operating costs and avoid system overheating. In recent years, more and more data centers start to adopt server virtualization strategies for resource sharing to reduce hardware and operating costs by consolidating applications previously running on multiple physical servers onto a single physical server. In this dissertation, several power efficient algorithms are proposed to effectively reduce server power consumption while achieving the required application-level performance for virtualized servers. First, at the server level this dissertation proposes two control solutions based on dynamic voltage and frequency scaling (DVFS) technology and request batching technology. The two solutions share a performance balancing technique that maintains performance balancing among all virtual machines so that they can have approximately the same performance level relative to their allowed peak values. Then, when the workload intensity is light, we adopt the request batching technology by using a controller to determine the time length for periodically batching incoming requests and putting the processor into sleep mode. When the workload intensity changes from light to moderate, request batching is automatically switched to DVFS to increase the processor frequency for performance guarantees. Second, at the datacenter level, this dissertation proposes a performancecontrolled power optimization solution for virtualized server clusters with multi-tier
Representing Software Traceability using UML and XTM with an investigation into Traceability Patterns

A walking sole which enables a person wearing in-line skates to walk freely. The walking sole includes a U-shaped member having a longitudinal trough into which a skate's wheels are inserted, and two slidably adjustable alignment posts which are brought into pressing contact with the outer wheels. Each post is securely fixed to the base of the U-shaped member by interfacing corrugations in its bottom surface with corrugations in the base upper surface before connecting the post and base with a bolt.
A complexity measure based on information contained in the software

Cognitive Informatics is a field that studies internal information processing mechanism of the human brain and its application in software coding and computing. This paper attempts to empirically demonstrate the amount of information contained in software and develops a concept of cognitive information complexity measure based on the information contained in the software. It is found that software with higher cognitive information complexity measure has more information units contained in it. Therefore cognitive information complexity measure can be used to understand the cognitive information complexity and the information coding efficiency of the software. For any complexity measure to be robust, Weyuker properties must be satisfied to qualify as good and comprehensive one. In this paper, an attempt has also been made to evaluate cognitive information complexity measure in terms of nine Weyuker properties, through examples. It has been found that all the nine properties have been satisfied by cognitive information complexity measure and hence establishes cognitive information complexity measure based on information contained in the software as a robust and well-structured one.
Service Infrastructure of Wearable Computing

The future information technologies and service paradigm will move from PC, the general purpose desktop computing environment, to the next-generation PC that provides information any where, any time, and any device. The next-generation PC such as wearable computers are specialized to the human-centric functionalities and always-on connected services. In this study, service infrastructure of wearable computing with WBAN(Wearable Body Area Network) was suggested for the ubiquitous computing environment.
The science of radio

"Instead of being an abstraction, the math in this book comes alive as the tool that EEs have always thought it to be.It has a place in the libraries of experienced EEs: It does a good job not only of teaching the underlying theory of radio, but also of entertaining readers. " EDN Explore the fascinating world of AM radio with this unique book and master key concepts in electrical engineering and physics. Unlike most texts that begin with a deluge of scientific detail, The Science of Radio takes a "top down" approach. It starts from a global perspective and gradually introduces theory and formula. Dr. Nahin also employs a "just in time" strategy, introducing new mathematical and physical theories only as they are needed to understand a topic. Paul Nahin's engaging style is accessible to any student who's completed a first- year calculus and physics course. About the Author Paul J. Nahin is Professor of Electrical Engineering at the University of New Hampshire. Along with dozens of nationally published science fiction stories, he is the author of the AIP Press bestseller Time Machines.
Latchup in CMOS Integrated Circuits

Sensitivity to ion beams is studied. Latchup effect subject of paper presenting results of testing 19 types of complementary metal-oxide semiconductor (CMOS) chips from six manufacturers. Report gives details of sensitivity of chips to latchup caused by argon and krypton ion beams. Identifies parasitic npnp paths and proides latchup cross section and qualitative explanation of latchup sensitivity for each chip type.
Situacion nematologica en un cafetal de la meseta central de Costa Rica y posibilidades de control

Les cafeieres du Costa Rica sont frequemment infestees de facon simultanee par #Meloidogyne exigua# et #Pratylenchus# sp. L'etude menee dans une plantation de la station de ICAFE, a San Pedro de Barva de Heredia (1100 m d'altitude) a revele des niveaux d'infestation plus importants pour #M. exigua# que pour #Pratylenchus# sp. La dynamique de ces populations est tres variable. La repartition speciale de #M. exigua# est moins heterogene que celle de #Pratylenchus# sp. Il appparait que les populations importantes de #M. exigua# coincident avec des populations peu elevees de #Pratylenchus# sp. et vice-versa, ce qui laisserait supposer une competition entre les deux especes. La variete de cafeier Arabica IAPAR56, resistante a #M. exigua# provoque une forte augmentation de la population de #Pratylenchus#, ce qui confirme la competition entre les deux et permet d'affirmer que #M. exigua# est l'espece dominante. Les descendances de #Coffea canephora# ont ete testees pour leur sensibilite aux nematodes et leur resistance a #M. exigua# a pu etre confirmee. Cependant, lors d'une experimentation a plus de 1100 m, les varietes sur porte-greffes de robusta produisent moins que les temoins non greffes. Ce serait du a la mauvaise adaptation du robusta aux basses temperatures prevalant a plus de 800 m. Differents nematicides ont ete testes. Aucun n'a demontre son efficacite pour augmenter la production sur trois recoltes. Il appparait donc necessaire de creer une variete de porte-greffe resistante aux deux nematodes et supportant les conditions en altitude
Combining Qualitative Preferences using Belief Function Theory

The process of eliciting and aggregating experts opinions becomes very important in many application fields. It plays a crucial role for getting relevant information and making decision. Usually, experts prefer to give their opinions qualitatively using natural language. For making decision, these qualitative opinions are generally transformed into quantitative beliefs, in order to combine them using evidence theory. The major drawback of this transformation process is the possibility of modification or even lost of information. Dealing with this problem, we propose in this paper, to avoid this transformation process by combining qualitatively experts preferences using qualitative conjunctive and disjunctive rules of combination.
Language Teaching Awareness: A Guide to Exploring Beliefs and Practices

1. Exploring Our Teaching 2. Processes of Exploration Part 2 PROCESSES 3. Seeing Teaching Differently through Observation 4. Problem Posing and Solving 5. Reflecting through Teaching Journals 6. Exploring with a Supervisor 7. Connecting Who we ARe with Who we Are as Teachers Part 3 EXAMPLES 8. Teachers Taling about Teaching 9. Microteaching and Self-observation 10 . Two Action Research Projects 11. How Yoga Was Taught.
The Cinderella.2 Manual: Working with The Interactive Geometry Software

Cinderella.2, the new version of the well-known interactive geometry software, has become an even more versatile tool than its predecessor. The geometry component extends the functionality to such spectacular objects as dynamic fractals, and the software includes two major new components: physical simulation such as of mechanical objects, virtual electronic devices, and electromagnetic properties. Cinderella.2 Documentation offers complete instruction and techniques for using Cinderella.2.
Interactions within a shared graphic space

This study is an examination of issues affecting the use of a shared graphic space (SGS). A working definition for an SGS is a virtual, computer-mediated blackboard that allows the simultaneous presentation and editing of visual information by two or more participants. The issues affecting the use of an SGS involve how people communicate with it. The addition of any technology into an already complicated situation like distance learning should be examined from multiple angles. In order to examine an SGS as a channel for communications, this study framed the SGS in terms of the nature of the feedback and noise that are present when we examine interactions in this space. This study examined 16 dyads interacting with whiteboard software to communicate solutions to 6 tangram puzzles. In all problem sets, participants used the text inherent in the whiteboard software as well as graphics to communicate potential solutions with each other in dyads. The participants also had access to audio for communications during either the first 4 or final 2 problem sets. Analysis of the results of this study show that the use of graphics for communication is dependent on accompanying communication channels. The addition of an audio channel for communications inhibited the use of text for communications. Graphics were used concurrently with audio as a dynamic enhancement to verbal communications. Graphics were not used concurrently with text. Graphics either occurred before or after text and were used as static illustrations or were used independent of text. The feedback mechanisms for the SGS were largely through the text or audio modes of communication. The graphic capabilities inherent to the SGS were an affordance to present and manipulate visual information. The SGS encourages new ways to interact and unique patterns of interactions between users. The manner in which graphics were used by each dyad was determined by the dyad and did not conform across the dyads. The unstructured nature of the SGS was a contributing factor in causing differentiation of the inter-dyad communication from intra-dyad communication. This lack of structure in the SGS was a source of noise in, as well as a source of freedom for, interactions in the SGS. The development of an etiquette for interacting in this unstructured space was developed dynamically and pragmatically and should be a source of future study. Shared space, that can be used for simultaneous, real time communications with graphics, changes the manner in which teachers and students can collaborate and construct new learning environments.
Automatic Application-Specific Customization of Softcore Processor Microarchitecture, Masters Thesis, May 2006

Applications for constrained embedded systems are subject to strict runtime and resource utilization bounds. With soft core processors, application developers can customize the processor for their application, constrained by available hardware resources but aimed at high application performance. The more reconfigurable the processor is, the more options the application developers will have for customization and hence increased potential for improving application performance. However, such customization entails developing in-depth familiarity with all the parameters, in order to configure them effectively. This is typically infeasible, given the tight time-to-market pressure on the developers. Alternatively, developers could explore all possible configurations, but being exponential, this is infeasible even given only tens of parameters. This thesis presents an approach based on an assumption of parameter independence, for automatic microarchitecture customization. This approach is linear with the number of parameter values and hence, feasible and scalable. For the dimensions that we customize, namely application runtime and hardware Type of Report: Other Department of Computer Science & Engineering Washington University in St. Louis Campus Box 1045 St. Louis, MO 63130 ph: (314) 935-6160 WASHINGTON UNIVERSITY THE HENRY EDWIN SEVER GRADUATE SCHOOL DEPARTMENT OF COMPUTER SCIENCE AND ENGINEERING AUTOMATIC APPLICATION-SPECIFIC CUSTOMIZATION OF SOFTCORE PROCESSOR MICROARCHITECTURE
Simulated Overloading using Generic Functions in Scheme

This paper investigates using generic routines, as provided in the language EL1, to simulate overloading in the dynamically-typed, functional programming language Scheme. Overloading improves the possibilities for code reuse and advocates an incremental style of programming. An extension is described which provides both explicit and inference mechanisms for describing the domain of an overloaded function. A simple type inference algorithm, used in domain inference is described.
PASSER IV-96, VERSION 2.1, USER/REFERENCE MANUAL

PASSER IV is a program for timing traffic signals in networks based on progression bandwidth optimization. This manual describes how to use PASSER IV-96, Version 2.1, to obtain optimal signal timings. PASSER IV is capable of optimizing signal timings for arterials as well as multi-arterial closed-loop networks. The program explicitly handles one-way and two-way arterials in a network and thus is able to deal with conventional and three-level diamond interchanges in isolation or as sub-networks within a larger network of arterials. The program is composed of two modules: the user interface and the optimization module. The user interface is extremely easy to use and provides the following features: file management functions, data entry/edit modes, graphic display of network, running the optimization routine, and running the TRANSYT-7F program. Further, it provides full mouse support. The optimization module performs bandwidth maximization. In addition to its own output report, the optimization routine is capable of generating input data files for use with the TRANSYT-7F program to perform bandwidth-constrained delay minimization. Thus, PASSER IV provides a network signal-timing optimization capability that was previously available only for arterial problems through the combined use of the two programs PASSER II and AAP.
Sampling Essentials: Practical Guidelines for Making Sampling Choices

Preface List of Tables, Figures, and Research Notes Chapter 1. Preparing to Make Sampling Choices Chapter 2. Choosing Between Taking a Census and Sampling Chapter 3. Choosing Between Nonprobability Sampling and Probability Sampling Chapter 4. Choosing the Type of Nonprobability Sampling Chapter 5. Choosing the Type of Probability Sampling Chapter 6. Sampling Based on the Nature of the Sampling Unit and Mixed-Methods Sample Designs Chapter 7. Choosing the Size of the Sample Glossary References Index