Miracle-dz/UniFAR-FTUs huggingface dataset:
Isoperimetry and noise sensitivity in Gaussian space

Author(s): Neeman, Joseph Oliver | Advisor(s): Mossel, Elchanan | Abstract: We study two kinds of extremal subsets of Gaussian space: sets which minimize the surface area, and sets which minimize the noise sensitivity. For both problems, affine half-spaces are extremal: in the case of surface area, this is was discovered independently by Borell and by Sudakov and Tsirelson in the 1970s; for noise sensitivity, it is due to Borell in the 1980s. We give a self-contained treatment of these two subjects, using semigroup methods. For Gaussian surface area, these methods were developed by Bakry and Ledoux, but their application to noise sensitivity is new. Compared to other approaches to these two problems, the semigroup method has the advantage of giving accurate characterizations of the extremal and near-extremal sets. We review the Carlen-Kerce argument showing that (up to null sets) half-spaces are the unique minimizers of Gaussian surface area. We then give an analogous argument for noise sensitivity, proving that half-spaces are also the unique minimizers of noise sensitivity. Unlike the case of Gaussian isoperimetry, not even a partial characterization of the minimizers of noise sensitivity was previously known. After characterizing the extremal sets, we study near-extremal sets. For both surface area and noise sensitivity, we show that near-extremal sets must be close to half-spaces. Our bounds are dimension-independent, but they are not sharp. Finally, we discuss some applications of noise sensitivity: in economics, we characterize the extremal voting methods in Kalai's quantitative version of Arrow's impossibility theorem. In computer science, we characterize the optimal rounding methods in Goemans and Williamson's semidefinite relaxation of the Max-Cut problem.
COMPARISON OF DIFFERENT CHROMOSOME REPRESENTATIONS USED BY GENETIC ALGORITHMS FOR SCHEDULING ENGINEERING MISSIONS

The focus of this study is to find an appropriate chromosome representation for scheduling engineering missions on the battlefield. Chromosome representation is a key issue in Genetic Algorithms (GAs). An appropriate representation that stores problem specific information can enhance the performance of the algorithm and expand the search of the problem space. This report explores three different data structures for representing chromosomes. The experimental results indicate that different chromosome representations have different performance under different problem sizes. Chapter I briefly reviews some typical scheduling approaches. At the same time, it also introduces the problem and discusses why GAs are used to solve it. Chapter II explains the problem in detail. Chapter III describes how GAs work, and the major steps of GAs are discussed. In Chapter IV, design and implementation of a GA-based scheduler are presented in detail, including the evaluation function, chromosome representation, selection strategy etc. Chapter V analyzes the performance of different chromosome representations with various problem sizes. The conclusions are included in Chapter VI.
The student-teacher relationship in a one-to-one technology classroom: a case study

v List of Figures ix Chapter One: Introduction 1 Background 1 Conceptual Underpinnings of the Study 4 Statement of the Problem 7 Purpose of the Study 8 Research Questions 9 Limitations and Assumptions 10 Organization of the Study 11 Chapter Two: Review of the Literature 13 Setting of the Study 13 The One-to-One Environment 14 The Student-Teacher Relationship 19 Research Tool 21 The Self-System Theory 22 Summary 25 Chapter Three: Methodology 27 Introduction 27 Purpose Statement 27 Research Questions 28 Strategy of Inquiry 29
A shallow syntactic annotation scheme for Icelandic text

We describe a shallow syntactic annotation scheme for Icelandic text. The scheme comprises a set of grammatical descriptors and their application guidelines. The descriptors consist of brackets and labels which indicate constituent structure and functional relations. Additionally, we describe a grammar de nition corpus, annotated using the annotation scheme. The annotation scheme has been developed as a part of a shallow parsing project.
Traffic grooming and wavelength conversion in optical networks

xii CHAPTER 1. Optical Networking A Gentle Introduction 1 1.1 Optical Networks The story thus far 1 1.2 First Generation Optical Networks SONET/SDH 5 1.3 Point-to-point WDM Systems 9 1.4 Second Generation Optical Networks 10 1.4. 1 Broadcast-and-Select WDM Networks 10 1.5 Wavelength-Routing Networks 12 1.5. 1 Routing and Wavelength Assignment 13 1.5. 2 Node Architecture 14 1.5. 3 Wavelength Conversion 16 1.6 Issues and Motivation 20 1.7 Contributions and Outline of the Dissertation 25 CHAPTER 2. Wavelength Conversion and Optical Converter Placement in Arbitrary-Topology Wavelength-Routed Networks 28 2.
Algorithmes de classification répartis sur le cloud

Les themes de recherche abordes dans ce manuscrit ont trait a la parallelisation d’algorithmes de classiﬁcation non-supervisee (clustering) sur des plateformes de Cloud Computing. Le chapitre 2 propose un tour d’horizon de ces technologies. Nous y presentons d’une maniere generale le Cloud Computing comme plateforme de calcul. Le chapitre 3 presente l’offre cloud de Microsoft : Windows Azure. Le chapitre suivant analyse certains enjeux techniques de la conception d’applications cloud et propose certains elements d’architecture logicielle pour de telles applications. Le chapitre 5 propose une analyse du premier algorithme de classiﬁcation etudie : le Batch K-Means. En particulier, nous approfondissons comment les versions reparties de cet algorithme doivent etre adaptees a une architecture cloud. Nous y montrons l’impact des couts de communication sur l’efﬁcacite de cet algorithme lorsque celui-ci est implemente sur une plateforme cloud. Les chapitres 6 et 7 presentent un travail de parallelisation d’un autre algorithme de classiﬁcation : l’algorithme de Vector Quantization (VQ). Dans le chapitre 6 nous explorons quels schemas de parallelisation sont susceptibles de fournir des resultats satisfaisants en terme d’acceleration de la convergence. Le chapitre 7 presente une implementation de ces schemas de parallelisation. Les details pratiques de l’implementation soulignent un resultat de premiere importance : c’est le caractere en ligne du VQ qui permet de proposer une implementation asynchrone de l’algorithme reparti, supprimant ainsi une partie des problemes de communication rencontres lors de la parallelisation du Batch K-Means.
Organization Theory: An Integrated Approach

A comprehensive treatment of a broad range of work organizations, their environment, and their components, incorporating measurement instruments, exercises, and cases to allow for different emphases on theory and applications. Follows a logical, systematic, topdown approach that introduces both macro and micro criteria of success and then moves from environment to context, structure, and subsystems parts. Includes contingency chapters that further integrate all theoretical material; also includes a thorough and detailed review of current empirical and theoretical literature.
Design and analysis of nonlinear sampled data control systems

Nonlinear sampled-data control systems represent an important system configuration that often arises in engineering practice. This thesis contributes a number of novel analysis and design tools for a quite general class of nonlinear sampled-data systems. The overall work in this thesis is divided into three parts. In Part I, a general and unified framework for discrete-time controller design using emulation for nonlinear sampled-data systems with disturbances is presented. A preservation of dissipativity properties under sampling and controller emulation is studied. It is shown that if a (dynamic) continuous-time controller, which is designed so that the continuous-time closed-loop system satisfies a certain dissipation inequality, is appropriately discretized and implemented digitally, then the discrete-time model of the closed-loop sampleddata system satisfies a similar dissipation inequality in a semiglobal practical sense. Part II focuses on the direct discrete-time stabilization of sampled-data systems based on approximate discrete-time models of the plant. A robust stability of nonlinear systems with inputs, which is known as input-to-state stability (ISS), is investigated and a framework for direct discrete-time controller design is proposed. An important ingredient in our approach is finding an appropriate family of Lyapunov functions for testing ISS properties of the family of discrete-time approximate models. We propose two methods for partially constructing a Lyapunov function for quite a general class of nonlinear systems. The first uses techniques of changing supply rates for input-output to state stable (IOSS) discrete-time nonlinear systems, and the second is derived from the Lyapunov based small-gain theorem for ISS discrete-time nonlinear systems. A case study is presented in Part III, to illustrate an engineering application of results from Part I and Part II. Input to state stabilization problem of a two-link manipulator is considered. Two controllers are designed using the proposed framework. It is demonstrated that the controller designed using direct discrete-time design may outperform the controller designed using emulation. Simulation studies are supporting the theoretical results and this strongly motivates further research in this area.
HEP - A semaphore-synchronized multiprocessor with central control. [Heterogeneous Element Processor]

The paper describes the design concept of the Heterogeneous Element Processor (HEP), a system tailored to the special needs of scientific simulation. In order to achieve high-speed computation required by simulation, HEP features a hierarchy of processes executing in parallel on a number of processors, with synchronization being largely accomplished by hardware. A full-empty-reserve scheme of synchronization is realized by zero-one-valued hardware semaphores. A typical system has, besides the control computer and the scheduler, an algebraic module, a memory module, a first-in first-out (FIFO) module, an integrator module, and an I/O module. The architecture of the scheduler and the algebraic module is examined in detail.
Link Adaptive MAC protocol for Wi-Fi

A novel protocol is proposed to achieve sub-carner-based rate adaptation in OFDM-based wireless systems. The protocol requires the addition of one OFDM symbol to the Clear-to-Send (CTS) packet defined in the IEEE 802.11 standard_ When receiving a Ready-To-Send (RTS) packet, the receiver determines the number of bits to be allocated in each sub-carrier through channel estimation. This decision is delivered to the sender using an additional OFDM symbol. That is, bit-allocation over sub-carriers is achieved using only one additional OFDM symbol. The protocol also provides an error recovery process to synchronize the bit-allocation information between the sender and receiver. The protocol enhances the channel efficiency in spite of the overhead of one additional OFDM symbol.
Bayesian text analytics for document collections

Modern document collections are too large to annotate and curate manually. As increasingly large amounts of data become available, historians, librarians and other scholars increasingly need to rely on automated systems to efficiently and accurately analyze the contents of their collections and to find new and interesting patterns therein. Modern techniques in Bayesian text analytics are becoming wide spread and have the potential to revolutionize the way that research is conducted. Much work has been done in the document modeling community towards this end, though most of it is focussed on modern, relatively clean text data. We present research for improved modeling of document collections that may contain textual noise or that may include real-valued metadata associated with the documents. This class of documents includes many historical document collections. Indeed, our specific motivation for this work is to help improve the modeling of historical documents, which are often noisy and/or have historical context represented by metadata. Many historical documents are digitized by means of Optical Character Recognition (OCR) from document images of old and degraded original documents. Historical documents also often include associated metadata, such as timestamps, which can be incorporated in an analysis of their topical content. Many techniques, such as topic models, have been developed to automatically discover patterns of meaning in large collections of text. While these methods are useful, they can break down in the presence of OCR errors. We show the extent to which this performance breakdown occurs. The specific types of analyses covered in this dissertation are document clustering, feature selection, unsupervised and supervised topic modeling for documents with and without OCR errors and a new supervised topic model that uses Bayesian nonparametrics to improve the modeling of document metadata. We present results in each of these areas, with an emphasis on studying the effects of noise on the performance of the algorithms and on modeling the metadata associated with the documents. In this research we effectively: improve the state of the art in both document clustering and topic modeling; introduce a useful synthetic dataset for historical document researchers; and present analyses that empirically show how existing algorithms break down in the presence of OCR errors.
Quantitative indicators of a successful mobile application

The smartphone industry has grown immensely in recent years. The two leading platforms, Google Android and Apple iOS, each feature marketplaces offering hundreds of thousands of software applications, or apps. The vast selection has facilitated a maturing industry, with new business and revenue models emerging. As an app developer, basic statistics and data for one's apps are available via the marketplace, but also via third-party data sources.This report regards how mobile software is evaluated and rated quantitatively by both endusers and developers, and which metrics are relevant in this context. A selection of freely available third-party data sources and app monitoring tools is discussed, followed by introduction of several relevant statistical methods and data mining techniques. The main object of this thesis project is to investigate whether findings from app statistics can provide understanding in how to design more successful apps, that attract more downloads and/or more revenue.After the theoretical background, a practical implementation is discussed, in the form of an in-house application statistics web platform. This was developed together with the app developer company The Mobile Life, who also provided access to app data for 16 of their published iOS and Android apps. The implementation utilizes automated download and import from online data sources, and provides a web based graphical user interface to display this data using tables and charts.Using mathematical software, a number of statistical methods have been applied to the collected dataset. Analysis findings include different categories (clusters) of apps, the existence of correlations between metrics such as an app’s market ranking and the number of downloads, a long-tailed distribution of keywords used in app reviews, regression analysis models for the distribution of downloads, and an experimental application of Pareto’s 80-20 rule which was found relevant to the gathered dataset.Recommendations to the app company include embedding session tracking libraries such as Google Analytics into future apps. This would allow collection of in-depth metrics such as session length and user retention, which would enable more interesting pattern discovery.
Design and analysis of an FPGA-based, multi-processor HW-SW system for SCC applications

The last 30 years have seen an increase in the complexity of embedded systems from a collection of simple circuits to systems consisting of multiple processors managing a wide variety of devices. This ever increasing complexity frequently requires that high assurance, fail-safe, and security design techniques be applied to protect against possible failures and breaches. To facilitate the implementation of these embedded systems in an efficient way, the FPGA industry recently created new families of devices. New features added to these devices include anti-tamper monitoring, bit stream encryption, and optimized routing architectures for physical and functional logic partition isolation. These devices have high capacities and are capable of implementing processors using their reprogrammable logic structures. This allows for an unprecedented level of hardware and software interaction within a single FPGA chip. High assurance and fail-safe systems can now be implemented within the reconfigurable hardware fabric of an FPGA, enabling them to maintain flexibility and achieve high performance while providing a high level of data security. The objective of this thesis is to design and analyze an FPGA-based system containing two isolated, softcore Nios processors that share data through two crypto-engines. FPGAbased Single Chip Cryptographic (SCC) techniques will be employed to ensure proper component isolation when the design is placed on a device supporting the appropriate security primitives. Each crypto-engine will be an implementation of the Advanced Encryption Standard (AES), operating in Galois/Counter mode (GCM) for high performance and authentication. The features of the microprocessors and architectures of the AES cryptoengines will be varied with the goal of determining combinations which best target high performance, minimal hardware usage, or a combination of the two.
Gradual Featherweight Typestate

Typestate oriented programming integrates notions of typestate directly into the semantics of an objectoriented programming language. This document presents the formalization of Gradual Featherweight Typestate, a typestate oriented language modeled after Featherweight Java. This language supports a classesas-states model of typestates, and utilizes a flow-sensitive type system for checking access permissions and state guarantees, thereby enabling safe and modular typestate checking.
RSRR: A Routing Interface For RSVP

Status of Memo This document is an Internet-Draft. Internet-Drafts are working documents of the Internet Engineering Task Force (IETF), its areas, and its working groups. Note that other groups may also distribute working documents as Internet-Drafts. Internet-Drafts are draft documents valid for a maximum of six months and may be updated, replaced, or obsoleted by other documents at any time. It is inappropriate to use Internet-Drafts as reference material or to cite them other than as \work in progress. " To learn the current status of any Internet-Draft, please check the \1id-abstracts.txt" listing contained in the Internet-Drafts Shadow Directories on ds.internic. net (US East Coast), nic.nordu. net (Europe), ftp.isi. edu (US West Coast), or munnari.oz. au (Paciic Rim). Abstract This memo describes version 2 of RSRR, a routing interface for RSVP. By using this interface, RSVP may obtain forwarding information from routers and use it to place reservation state within the network. Version 1 of this interface was designed primarily for RSVP interaction with IPv4 multicast routing protocols. Version 2 explicitly addresses IPv4 unicast support and adds support for IPv6 unicast and multicast routing. In addition, the Initial Query/Reply exchange has been renamed to Interface Query/Reply, and these new messages include a mechanism to determine the version of RSRR that a routing protocol is using. This document also describes how to implement RSRR within RSVP.
Microsoft Visual C++ 2005 Express Edition Programming for the Absolute Beginner

Introduction 1. Getting Started 2. Programming the Basics 3. Controlling Programs with Control Structures 4. Taming Complexity with Functions 5. Advancing on to Advanced Data Types 6. Building More Powerful Programs With OOP 7. Delving Deeper into OOP 8. Handling Errors and Debugging 9. Writing and Reading to and from Files 10. Amazing Escape Appendix A: C++ Keywords Appendix B: Operators and Precedence Appendix C: Data Types Appendix D: ASCII Table Reference Appendix E: Online Resources
Gentleman R: R: A language for data analysis and graphics

Abstract In this article we discuss our experience designing and implementing a statistical computing language. In developing this new language, we sought to combine what we felt were useful features from two existing computer languages. We feel that the new language provides advantages in the areas of portability, computational efficiency, memory management, and scoping.
Usability and enjoyability of natural language interface technology in computer games

This report aims to examine the application of natural language interface (NLI) technology in computer games in terms of usability and enjoyability. To test this a NLI is compared to a formal language interface (FLI), using the system usability scale (SUS) to determine usability. Results show that even though the NLI scored less mean SUS score than the FLI, it was measured to be more enjoyable. It is concluded that using NLI technology is well motivated since the primary focus of a computer game is enjoyability.
Adding Parallel I/O to PARA-BMU

VOX-FE[1] is a voxel-based bone modelling suite. The solver part of the suite PARA-BMU currently uses only serial I/O routines which lead to poor scalability. We enhance the code by adding parallel I/O routines based on the netCDF[2] and HDF5[3] libraries. We demonstrate that this gives a reduction in file sizes of up to 190x and a reduction in wall-clock time of 7x at 512 cores. This paves the way for PARA-BMU to be used effectively on HECToR and allows users to perform research with much larger and more complex models than was previously possible.
Navigating Through Algebra in Grades 6-8

This book shows how middle school students can use mathematical models and represent and analyse mathematical situations and structures to explore the concept of function. The activities and problems require students to use representations related to work with functions and they highlight some of the interactions that may occur among these representations. The supplemental CD-ROM features interactive electronic activities, master copies of activity pages for students and additional readings for teachers.