Miracle-dz/UniFAR-FTUs huggingface dataset:
Macroscopic Data Structure Analysis and Optimization

Providing high performance for pointer-intensive programs on modern architectures is an increasingly difficult problem for compilers. Pointer-intensive programs are often bound by memory latency and cache performance, but traditional approaches to these problems usually fail: Pointer intensive programs are often highly-irregular and the compiler has little control over the layout of heap allocated objects. This thesis presents a new class of techniques named “Macroscopic Data Structure Analyses and Optimizations”, which is a new approach to the problem of analyzing and optimizing pointer-intensive programs. Instead of analyzing individual load/store operations or structure definitions, this approach identifies, analyzes, and transforms entire memory structures as a unit. The foundation of the approach is an analysis named Data Structure Analysis and a transformation named Automatic Pool Allocation. Data Structure Analysis is a context-sensitive pointer analysis which identifies data structures on the heap and their important properties (such as type safety). Automatic Pool Allocation uses the results of Data Structure Analysis to segregate dynamically allocated objects on the heap, giving control over the layout of the data structure in memory to the compiler. Based on these two foundation techniques, this thesis describes several performance improving optimizations for pointer-intensive programs. First, Automatic Pool Allocation itself provides important locality improvements for the program. Once the program is pool allocated, several pool-specific optimizations can be performed to reduce inter-object padding and pool overhead. Second, we describe an aggressive technique, Automatic Pointer Compression, which reduces the size of pointers on 64-bit targets to 32-bits or less, increasing effective cache capacity and memory bandwidth for pointer-intensive programs. This thesis describes the approach, analysis, and transformation of programs with macroscopic techniques, and evaluates the net performance impact of the transformations. Finally, it describes a large class of potential applications for the work in fields such as heap safety and reliability, program understanding, distributed computing, and static garbage collection.
Machine Learning: The Necessity of Order (is order in order ?)

In myriad of human-tailored activities, whether in the classroom or listening to a story, human learners receive selected pieces of information, presented in a chosen order and pace. This is what it takes to facilitate learning. Yet, when machine learners exhibited sequencing effects, showing that some data sampling, ordering and tempo are better than others, it almost came as a surprise. Seemingly simple questions had suddenly to be thought anew : what are good training data? How to select them? How to present them? Why is it that there are sequencing effects? How to measure them? Should we try to avoid them or take advantage of them? This chapter is intended to present ideas and directions of research that are currently studied in the machine learning field to answer these questions and others. As any other science, machine learning strives to develop models that stress fundamental aspects of the phenomenon under study. The basic concepts and models developed in machine learning are presented here, as well as some of the findings that may have significance and counterparts in related disciplines interested in learning and education.
Design Aloud: A Designer-Centred Design (DCD) Method

Designer-centred design methods build on the knowledge and skills of the designers to improve user interface design. Unlike users, designers are trained to handle complexity and to make design trade-offs. They are the people centrally in control of the design process. Designer-centred design complements and refocuses user-centred design methods. A particular designer-centred design approach, “Design Aloud” is introduced and justified. Computer systems do not often perform as well as they could do. The reason for this is sometimes blamed on the lack of a user-centred approach to design. Designers concentrate on features and system performance and, indeed, often the user is ignored. In reaction to this, user-centred design is promoted (Landauer, 1995): orient the design process to understand the users, collect empirical data on users’ behaviour and performance, and iterate designs to improve them. Quite rightly, usability has been emphasised in HCI; Monk et al. (1993) even say that close involvement with users is the only way to produce a good design. By studying how users really perform, usability of systems can be significantly improved, and engaging users in the process, as a political act, builds their commitment to the design. Once one adopts this view, it is seen to have many problems (e.g., expert users may find it hard to articulate what they do) and it has become an active area of research and progress. There are many techniques such as ‘think aloud’ (Lewis, 1982) that are available to inform the usability process; see Baecker, Grudin, Buxton and Greenberg (1995) for a review. Whilst such methods are necessary, they emphasise the two opposite ends of design — requirements and final product — rather than the designers themselves, who are the people best placed to influence the process of design for the better. It is true that many ‘designers’ may in practice be programmers with little experience of real design: but this is not how it should be. The method described here will help programmers become better designers. There are many design-centred approaches, such as: QOC (questions, options and criteria): MacLean, Young, Bellotti and Moran, 1991; Design Rationale: Lee and Lai, 1991; — this list is not exhaustive. A recent method, Contextual Design (Beyer and Holtzblatt, 1998), is a holistic user-centred approach. Contextual Design is ‘customer-centred,’ aiming to find out what customers want, negotiate with them in design teams, and hence deliver more finely targeted systems. It provides well-defined steps suitable for ISO9000 compliance. Throughout, the emphasis is on being customer-led, facilitating customers to contribute to the
Traffic Analysis Toolbox Volume IV: Guidelines for Applying CORSIM Microsimulation Modeling Software

This report describes a process and acts as guidelines for the recommended use of CORSIM traffic simulation software in transportation analyses. The seven-step process presented in these guidelines highlights the aspects of a CORSIM analysis from project start to project completion. The seven steps in the process include: 1) scope project, 2) data collection, 3) base model development, 4) error checking, 5) calibration - comparing model measures of effectiveness (MOEs) to field data (and adjusting model parameters), 6) alternatives analysis, and 7) final report. Each step is described in detail and an example problem applying the process is carried through the entire document. The report appendices contain detailed information covering areas such as: fundamentals of CORSIM model theory, an overview of CORSIM capabilities and limitations, guidance on the initialization period, a discussion on actuated signal control in CORSIM, coding techniques for complex situations, and run-time extension.
Detection of esophageal cancer (Necrosis) in endoscopic images using color image segmentation

An automatic method for segmenting the endoscopic images of the esophageal cancer and necrosis growth is proposed. The RGB components of the image are separated and the range of intensity values for Red, Green and Blue components are identified for classifying the images as normal, initial or advanced stages of growth of cancer in the lower esophagus. The bright spots due to the reflection of light sources in ROI (Region of Interest) are eliminated by region filling. The results are compared with the manual segmentation of cancerous region.
L'étude des médias est-elle soluble dans l'informatique et la physique ? À propos du recours aux digital methods dans l'analyse de l'information en ligne

Les recherches portant sur l’information en ligne sont marquees par une certaine emprise des methodes quantitatives et statistiques. Elles rejoignent pour partie une autoproclamee nouvelle science des reseaux, appuyee sur la physique et les mathematiques, ainsi que le plaidoyer pour des methodes d’observation specifiques (digital methods), tirant profit des capacites de traitement informatique et des materiaux numeriques de l’internet. L’examen detaille de tels travaux permet d’en cerner les apports (exhaustivite du corpus, representation synthetique des resultats) et les limites (analyses parfois insuffisamment approfondies, categorisations reductrices pour les besoins d’automatisation). Il fait egalement apparaitre la necessite de croiser les digital methods avec des methodes plus classiques en sciences humaines et sociales, afin de saisir les multiples dimensions des phenomenes mediatiques.
Architecture and CAD for speed and area optimization of FPGAs

Architecture and CAD for Speed and Arta Optimization of FPGAs Doctor of Philosophy, 1998 Vaughn Betz Department of Electrical and Computer Engineering University of Toronto In the thirteen years since their introduction, Field-Programmable Gate Arrays (FPGAs) have become one of the most popular implementation media for digital circuits. Their programmability has been the key to the success of FPGAs, but this programmability also makes them ten times larger and three times slower than Masked Programmed Gate Arrays (MPGAs). This thesis investigates three aspects of FPGA architecture in order to find ways to reduce these speed and area penalties. Our investigation method is experimental -we technology map, place and route circuits in eacn architecture of interest and measure the resulting speed and density of the circuit. To enable this architectural exploration, we create new, flexible ComputerAided Design (CAD) tools to perform logic block packing, placement and routing into a wide variety of FPGA architectures. These CAD tools incorporate new algorithms that result in better result quality than previous approaches, and theirflexibility enables rapid exploration of radically different FPGA architectures in a way that was not previously possible. The three FPGA architectural issues we investigate are global routing architecture, clusterbased logic blocks, and detailed routing architecture. In the global routing architecture investigation, we determine how FPGA architects can best ailocate wiring tracks to the various channels within an FPGA. We show that an island-style FPGA should make ail channels the same width, while a row-based FPGA should make the horizontal channels twice as wide as the vertical channels. We also find that an island-style FPGA has 5% better area-efficiency than a row-based FPGA. In Our investigation of cluster-based logic blocks, we show that any logic block composed of a cluster of one to ten look-up tables has reasonable area-efficiency. The absolute best areaefficiencies are obtained by logic blocks with 1 or with 4 look-up tables per logic block. As well, we found that the nurnber of look-up tables in a logic block must be considered when choosing other FPGA parameters, such as the flexibility of the logic block routing interface.
The GRAIL Language and Operations

Abstract : The important organizational concepts of the flowchart language are the sequential flow of control, the hierarchy of subroutines, and the language (flow diagrams) that pictorially relates their interdependence. A fundamental facility of the man-machine interface is the automatic recognition of appropriate symbols, which allows the man to print or draw appropriate symbols freehand. GRAIL's text-editing features include placement, replacement, and deletion of characters, character-string insertion of deletion, and line deletion. Control functions include displaying text page-by-page, requesting specified display frames, moving symbols, and text line editing. The flowchart processes may be compiled and executed at CPU speeds or the man may control interpretative execution by direct stylus actions. He may use overlay displays or split screen displays to debug. This is the second part of a final report on GRAIL.
An Indoor-Location Sensing System using WLAN and Ultrasonic/Radio Technologies

Ubiquitous location-aware systems and services are becoming a reality as made evident by the widely known Global Position System (GPS). However, indoor locationaware sensing systems are not yet commercially viable since: (i) for a GPS-based system, the signals attenuate and can multipath indoors causing weak signal and poor location (ii) for a Radiolocation-based system, the propagation of radio signals are complex and difficult to model. In this paper, we present RadLoco, a locationsensing system that uses IEEE 802.11 Wireless LAN survey techniques to create a radio Received Signal Strength (RSS) map of the propagation environment. To provide accurate location estimation, we make use of a kernel-window estimation algorithm that is used to approximate the probability density function of RSS measurement and location. Unlike parametric estimators, this non-parametric kernel approach requires less knowledge of the distributions of location and measurements, and also makes use of the prior knowledge of mobile terminal location to reduce the estimation error. The novelty of the system is an innovative radio/ultrasonic sensory network which allows for rapid data collection whereas the standard technique of defining a grid of survey points with measuring rulers, chalk, and tape would require a great amount of
Architecture and Modeling for a SMT system

1 Introduction 31.1 Fundamentals of SMT . 41.2 Objective of this thesis . 52 State-of-the-art 62.1 Alignment . 72.2 Current SMT approaches . 82.2. 1 Phrase-based . 82.2. 2 Ngram-based . 102.3 Decoding . 112.3. 1 Log-linear model combination . 122.4 Use of linguistic knowledge . 133 Previous contributions 143.1 TALP: An Ngram-based SMT system . 143.2 MARIE: An Ngram-based SMT decoder . 143.3 Preliminary addition of reordering capabilities . 143.4 Preliminary re nement of bilingual units . 144 Work Plan 154.1 Distortion modeling . 154.2 Re nement of translation units . 164.3 Coupling with an ASR module . 174.4 Decoding eciency . 174.5 Experimentation . 185 Publications 192
A low-power radar imaging system

A Low-Power Radar Imaging System, 2nd Edition By Gregory Louis Charvat A near real-time radar-based imaging system is developed in this dissertation. This system uses the combination of a spatially diverse antenna array, a high sensitivity range-gated frequency-modulated continuous wave (FMCW) radar system, and an airborne synthetic aperture radar (SAR) imaging algorithm to produce near real-time high resolution imagery of what is behind a dielectric wall. This system is capable of detecting and providing accurate imagery of target scenes made up of objects as small as 6 inch tall metallic rods and cylinders behind a 4 inch thick dielectric slab. A study is conducted of through-dielectric slab imaging by the development of a 2D model of a dielectric slab and cylinder. The SAR imaging algorithm is developed and tested on this model for a variety of simulated imaging scenarios and the results are then used to develop an unusually high sensitivity range-gated FMCW radar architecture. An S-band rail SAR imaging system is developed using this architecture and used to image through two different dielectric slabs as well as free-space. All results are in agreement with the simulations. It is found that freespace target scenes could be imaged using low transmit power, as low as 5 picowatts. From this result it was decided to develop an X-band front end which mounts directly on to the S-band rail SAR so that objects as small as groups of pushpins and aircraft models in free-space could be imaged. These results are compared to previous Xband direct conversion FMCW rail SAR work. It was found that groups of pushpins and models could be imaged at transmit powers as low as 10 nanowatts. A spatially diverse S-band antenna array will be shown to be developed for use with the S-band radar; thereby providing the ability for near real-time SAR imaging of objects behind dielectric slabs with the same performance characteristics of the S-band rail SAR. The research presented in this dissertation will show that near real-time radar imaging through lossy-dielectric slabs is accomplished when using a highly sensitive radar system located at a stand-off range from the slab using a free-space SAR imaging algorithm.
Spin-down age: the key to magnetic field decay

The properties of the spin-down age are investigated. Based on assumption about a uniform magnetic field decay law we suggest a new method which allows us to shed light on magnetic field decay. This method is applied for following selection: isolated non-millisecond pulsars from the ATNF catalog are chosen. Pulsars in the selection are with the spin-down ages from 4 \cdot 10^4 to 2 \cdot 10^6 years. In order to avoid observational selection we take into account only pulsars which are closer to the Sun than 10 kpc. For this selection we restore the uniform magnetic field decay law. It appears that the magnetic field decays three times from 4 \cdot 10^4 to 3.5 \cdot 10^5 years. This function is approximated by modified power-law. We also estimate the birthrate of pulsars in our Galaxy and find that it should be about 2.9 pulsars per century.
Evaluating interprocedural code optimization techniques

Compilers traditionally base optimization techniques on intraprocedural information. That is, the information contains little knowledge about specific events that may happen at the point of a procedure call. We analyze such techniques in their traditional intraprocedural contexts and evaluate their extension to the interprocedural domain. A brief study of the information used by compilers to optimize computer programs provides the basis for a look at past and future optimization techniques. In particular, we examine ways of gathering and using interprocedural information in an attempt to more accurately perform traditional optimization techniques. We discuss the results of a scientific experiment using interprocedural dataflow information to optimize a set of benchmarks. As an alternative to interprocedural dataflow analysis, we examine the established technique of procedure integration, also called procedure inlining. More experimentation serves to point out the strengths and weaknesses of this technique in the context of global program optimization. Finally, we use the knowledge gained thus far to present a new optimization technique, tailored integration. Tailored integration builds on the strengths of procedure integration, while avoiding some of the pitfalls associated with using integration in an optimizing compiler.
Automatic structuring and augmentation of a lifelog of images

The SenseCam is a passively capturing wearable camera that takes approximately 3,000 images on average per day. This provides a user with an extensive visual diary. Possible applications making use of this device include helping dementia sufferers recall events from short-term memory, and also this device can be used by tourists to maintain an extensive image collection of their trip. However a large image collection will quickly build up, with an average of 1 million images captured each year. This presents a considerable challenge in terms of managing such a large collection and to make it accessible for users. This proposal addresses the problem in 4 steps: 1) Identifying distinct events within the 3,000 images per day 2) Highlighting the most unique of those events 3) Finding similar events to a given event 4) Augmenting the low-quality images from the wearable camera with higher quality images from external sources.
PRACTI Replication for Large-Scale Systems

Many replication mechanisms for large scale distributed systems exist, but they require a designer to compromise a system’s replication policy (e.g., by requiring full replication of all data to all nodes), consistency policy (e.g., by supporting per-object coherence but not multiobject consistency), or topology policy (e.g., by assuming a hierarchical organization of nodes.) In this paper, we present the first PRACTI (Partial Replication, Arbitrary Consistency, and Topology Independence) mechanisms for replication in large scale systems. These new mechanisms allow construction of systems that replicate or cache any data on any node, that provide a broad range of consistency and coherence guarantees, and that permit any node to communicate with any other node at any time. Our evaluation of a prototype suggests that by disentangling mechanism from policy, PRACTI replication enables better trade-offs for system designers than possible with existing mechanisms. For example, for one workload we study, PRACTI’s partial replication reduces bandwidth requirements by over an order of magnitude compared to full replication for nodes that only care about a subset of the system’s data.
Nonlinear Dependence of LB on LFIR and MH2 among Spiral Galaxies and the Effects of Tidal Interaction

Through the study of a carefully selected sample of isolated spiral galaxies, we have established that two important global physical quantities for tracing star-forming activities, LFIR and MH2, have a nonlinear dependence on another commonly cited global quantity, LB. Furthermore, we show that simple power-law relations can effectively describe these nonlinear relations for spiral galaxies spanning 4 orders of magnitude in FIR and MH2, and nearly 3 orders of magnitude in LB. While the existence of a nonlinear dependence of MH2 (assuming a constant CO-to-H2 conversion) and LFIR on optical luminosity (LB) has been previously noted in the literature, an improper normalization consisting of simple scaling by LB has been commonly used in many previous studies to claim enhanced molecular gas content and induced activity among tidally interacting and other types of galaxies. We remove these nonlinear effects using the template relations derived from an isolated galaxy sample and conclude that strongly interacting galaxies do not have enhanced molecular gas content, contrary to previous claims. With these nonlinear relations among LB, LFIR, and MH2 properly taken into account, we confirm again that FIR emission and star formation efficiency (LFIR/MH2) are indeed enhanced by tidal interactions. Virgo galaxies show the same levels of MH2 and LFIR as isolated galaxies. We do not find any evidence for enhanced star-forming activity among barred galaxies.
Mediated gates between spin qubits

In a typical quantum circuit, nonlocal quantum gates are applied to nonproximal qubits. If the underlying physical interactions are short-range (e.g., exchange interactions between spins), intermediate swap operations must be introduced, thus increasing the circuit depth. Here we develop a class of "mediated" gates for spin qubits, which act on nonproximal spins via intermediate ancilla qubits. At the end of the operation, the ancillae return to their initial states. We show how these mediated gates can be used (1) to generate arbitrary quantum states and (2) to construct arbitrary quantum gates. We provide some explicit examples of circuits that generate common states [e.g., Bell, Greenberger-Horne-Zeilinger (GHZ), W, and cluster states] and gates (e.g.,square-root-SWAP, SWAP, CNOT, and Toffoli gates). We show that the depths of these circuits are often shorter than those of conventional swap-based circuits. We also provide an explicit experimental proposal for implementing a mediated gate in a triple-quantum-dot system.