Miracle-dz/UniFAR-FTUs huggingface dataset:
Linear Logic, -Autonomous Categories and Cofree Coalgebras

A brief outline of the categorical characterisation of Girard's linear logic is given, analagous to the relationship between cartesian closed categories and typed-calculus. The linear structure amounts to a-autonomous category: a closed symmetric monoidal category G with nite products and a closed involution. Girard's exponential operator, ! , is a cotriple on G which carries the canonical comonoid structure on A with respect to cartesian product to a comonoid structure on ! A with respect to tensor product. This makes the Kleisli category for ! cartesian closed. 0. INTRODUCTION. In \Linear logic" 1987], Jean-Yves Girard introduced a logical system he described as \a logic behind logic". Linear logic was a consequence of his analysis of the structure of qualitative domains (Girard 1986]): he noticed that the interpretation of the usual conditional \)" could be decomposed into two more primitive notions, a linear conditional \? " and a unary operator \! " (called \of course"), which is formally rather like an interior operator: (1) The purpose of this note is to answer two questions (and perhaps pose some others.) First, if \linear category" means the structure making valid the proportion linear logic : linear category = typed-calculus : cartesian closed category then what is a linear category? This question is quite easy, and in true categorical spirit, one nds that it was answered long before being put, namely by Barr 1979]. Our intent here is mainly to supply a few details to make the matter more precise (though we leave many more details to the reader), to point out some similarities with work of Lambek 1987] (see these proceedings), and to appeal for a change in some of the notation of Girard 1987]. Second, what is the meaning of Girard's exponential operator ! Since Girard has in fact ooered several variants of ! in 1987], and another in Girard and Lafont 1987], one cannot be too dogmatic here, but some certainty as to the minimal demands ! makes is possible | in particular we show that ! ought to be a cotriple, and its Kleisli category ought to be cartesian closed, in order to capture the initial motivation of the exponential. Acknowledgement. This note should be regarded as a \gloss" on Girard 1987], providing the categorical context and terminology for that work; I think the categorical setting provides a genuine improvement, and in particular, indicates how the notation may be made clearer. Others …
A methodology for the design and implementation of a functional object database using Haskell

Semantic data modelling has been a traditional abstract way of representing data and relationships between data for database systems. Recently database designers and developers have been looking to object oriented modelling methods which incorporate the modelling of behaviour as well as data and their relationships. Databases can also be considered to be functional structures. All operations on databases are functional in that they return values. Transaction and update operations return a new version of the database; queries return values contained in the database; and reports return values from the database in some strictly formatted form. This thesis firstly develops an extended version of the Entity-Relationship model, called the Entity-Relationship-Object model (ERO model) that incorporates object oriented concepts including behaviour. Secondly, a methodology is defined for mapping this model directly to the functional. programming language, Haskell, where all Entity and Relationship objects are implemented as abstract data types and all attributes and methods are implemented as functions. The modularity and polymorphism of the proposed models and their implementation allow for easy schema extension and modification. Lazy evaluation in the implementation allows for a simple form of persistent data store.
Data Analysis With Spreadsheets

Each chapter concludes with "Chapter Summary" and "References. " 1. An Introduction to Spreadsheets. Spreadsheets -- First Facts. The Brief History of Spreadsheets. Why Use Spreadsheets for Data Analysis in the Social Services? Spreadsheet Basics. Using Formulas and Functions. Advanced Tools for Understanding Data. A Comparison of Spreadsheets to Statistical Analysis Software. The Paradox of Spreadsheets and Statistical Software in Social Service Practice. 2. Data Collections Waysand Means. The Many Paths to Data Acquisition. Levels of Measurement. Data Coding. Basic Data Entry. Creating Data Entry Forms. Downloading Data. Web-Based Data Retrieval. Relating to Database Software. Web-based Data Collection. Relating to Database Software. Saving What You Have and Using What You Need. 3. Selecting Samples. Samples: First Facts. Simple Random Samples. Systematic Sampling. Stratified Sampling. Random Assignment. 4. Data Cleaning Types of Problem Data. Detecting Data Errors. Contingency Cleaning. Missing Data: Its Detection and Handling. Detecting Missing Data. Handling Missing Data. 5. Frequency Distributions and Histograms. Understanding the Distribution of Values. Frequency Distributions. Producing Histograms Using the Chart Wizard. 6. Descriptive Statistics. Measures of Central Tendency. Formulas for Measures of Central Tendency. Measures of Dispersion or Variability. Data Analysis Tools: Descriptive Statistics. Producing Frequency Polygrams. 7. Statistical Inference and Hypothesis Testing. Normal Distributions. Probability Distributions. Skewness. Understanding Hypothesis Testing. Statistical Significance. Effect Size and Sample Size Estimation. 8. Bivariate Statistics. Chi-square Test of Independence. t-Test. ANOVA. Post hoc Tests of Means. 9. Cross-Tabulation Tables. Using the Pivot Tables Wizard. Graphing Cross-tabulation Tables. 10. Single System Design. Basic Elements of Single System Design. Advanced Designs. Dynamic Chart Production. Single System Group Designs. 11. Correlation and Regeression. Pearson's r and R2. Bivariate Regressions. Regression. Two Variable Regression. Creating Scatterplots. Trendlines in Scatterplots. Interpreting Scatterplots. Ordinary Least Squares (OLS) Regression. Interpreting Multivariate Regression (OLS) Output in Excel. Creating a Control Variable for Regression Analysis in Excel. 12. Graphical Representation of Practice Information. Thinking Visually. Graphical Representation. Tools for Graphical Representation of Information. Matching Data to Type of Graph. Enhancing Graphs. Spreadsheets Drawing Tools. Ecomaps. Genograms.
Learning Parameter Selection in Continuous Reinforcement Learning: Attempting to Reduce Tuning Effords

The reinforcement learning (RL) framework enables to construct controllers that try to find find an optimal control strategy in an unknown environment by trial-and-error. After selecting a control action, the controller receives a numerical reward. The reward signal is based on the current state of the environment and the applied control action. The controller aims to maximize the cumulative reward, known as the return. In this thesis actor-critic and criticonly RL algorithms are considered. Actor-critic algorithms consist of an element that selects the actions (the actor) and an element that learns the expectation of the return (the critic). This expectation is captured in a value function. The critic is used to improve the control policy of the actor. Critic-only algorithms select the action by direct optimization over a value function. Before a RL algorithm can be applied to a control problem, a number of learning parameters need to be set. The optimal values of some of these parameters are highly problem dependent. It is not straightforward how these parameters should be chosen and often these are often determined by trying a large set of parameters. The main focus of thesis is to devise an action selection method that is able to select continuous actions without problem dependent parameters. Two approaches are taken: first, it is investigated if Levenberg Marquardt (LM), a popular optimization method, can be used to determine the actor update step. Second, an action selection method is treated that lacks an explicit actor, called Value-Gradient Based Policy (VGBP). The LM algorithm uses the gradient and the Hessian to compute the update step. Therefore the policy gradient and Hessian need to be found. A novel actor-critic method has been devised, called Vanilla Actor-Critic (VAC), that efficiently learns the policy gradient. On the inverted pendulum swing-up task this algorithm outperformed Natural Actor-Critic (NAC). A number of different approaches have been taken to approximate the policy Hessian, but none delivered a proper Hessian estimate. Therefore, no LM actor update method was created. In VGBP the action is found by optimization of the right hand side of the Bellman equation. VGBP uses the provided reward function and a process model for this optimization. The process model is learned online using local linear regression (LLR). Due to the efficient use of information VGBP shows fast learning on the pendulum and a 2-DOF robotic arm.
Automatically generated runtime checks for design-level constraints

In recent years, componentand service-orientation has gained importance as the new paradigm in software engineering, and it has introduced the challenge of dynamic component look-up and binding into the validation and verification process. This introduces a new class of inherently dynamic properties that have to be verified when the system is running in its target environment rather than at development time. Additionally, the separation of interface specification and the implementation combined with uses of Application Programming Interfaces (API) in contexts not envisioned by their developers often lead to subtle faults and consequent failures that are hard to diagnose. This problem is exacerbated when components or services are bound dynamically during deployment, and hence are not known during development and testing. One important implication of this is that it significantly limits the assurance of quality and reliability that testing at development time can give. Consequently, more quality assurance has to take place after the deployment of systems at runtime. Most runtime verification techniques rely on monitoring state and behavior of systems and reasoning over the measured data to verify whether or not pre-defined properties are maintained. This dissertation is about runtime monitoring for structural design-level properties of component-based software systems. Such properties arise for example when a framework imposes requirements that must be met by all components, including components developed by third parties, connected within the framework. The working hypothesis is that there are useful design-level properties, violations of which lead to failures that exhibit enough commonalities to distinguish them from failures caused by other defects, and that these clusters of failures can be exploited to define reusable runtime monitoring mechanisms. Based on this hypothesis, this dissertation’s first contribution is a set of designlevel properties that can be identified by clearly distinct classes of failures. Using these failure classes as guideline, the second contribution is defining templates for runtime monitors. These templates are similar in spirit to design patterns, even though their implementation is solving a monitoring, rather than a software design problem. The third contribution is a specification language to express the identified properties in design models, and a tool processing such models to automatically generate effective runtime monitors for the specified properties. The applicability of the identified properties and the effectiveness of the generated monitors is assessed in several case studies.
Reaching a sustainable cultural landscape through pedagogical evaluation of technology

Ziel des LAMB-Projektes ist es, Schuler darin zu unterstutzen, im Klassenzimmer erworbenes Wissen uber die lokale Kulturlandschaft nach drausen in ihre aktuelle Umgebung mitzunehmen. Das Verknupfen wissenschaftlicher Erkenntnisse mit Hilfe von GPS und mobilen Technologien stimuliert an technischen Spielereien interessierte Schuler, die realen Landschaften zu erkunden. Mobile Anwendungen sind besonders bei archaologischen Statten nutzlich, von denen man nur wenig sehen kann oder welche die Wahrnehmung und Interpretation langfristiger Veranderungen in der Umwelt erfordern, um ihre Bedeutung zu verstehen. LAMB vermittelt gleichzeitig verschiedene standortbezogene Informationen, wie z. B. Karten, Bilder oder Texte, sobald die entsprechenden GPS-Koordinaten empfangen werden. Es ermoglicht zudem die Visualisierung von Landhebungsprozessen mit Hife von Hohenlinien, thematischen Karten oder rekonstruierten Kustenlinien. Die Verwendung von technologisch anspruchsvollen Materialien in der Schulbildung entwickelt die Forschungskompetenz der Schuler und verbessert ihre Moglichkeiten, sich selbstandig zusatzliches Wissen anzueignen. Auf Grundlage unserer Studie zeigen wir, das LAMB die Moglichkeiten von Schulern verbessert, ihre lokalen Kulturlandschaft zu erkunden und sich mit ihr zu identifizieren. Das padagogische Modell von LAMB verbessert die Fertigkeit der Schuler, sowohl die Interaktion zwischen Menschen und ihrer sich verandernden Umwelt wahrzunehmen als auch den menschlichen Einfluss auf die Landschaft zu verstehen.
Statistical Parsing of the French Treebank

This thesis presents the first ever results of applying probilistic models to the task of parsing French using the newly available French Le Monde corpus. We start off by describing the annotation scheme of this brand new corpus, and highlight its differences compared to the Penn Treebank. We then use an unlexicalised PCFG to give us a baseline parsing model. This model is steadily enriched to the level of Collins’ Model 2 by adding lexicalisation and subcategorisation information. Wordlevel orthographical and morphological information is incorporated as feature vectors to help reduce Part of Speech tag assignment ambiguity for unknown words. This enriched model significantly outperforms the baseline model, achieving labeled precision and recall of up to 80% on sentences with 40 words, an improvement of almost 15% over the baseline. We also examine an alternative ”bigram” model, where modifying nonterminals are also conditioned on the previously generated nonterminal, in an attempt to take into account the flatness of the French Treebank. This model achieves precision and recall of up to 81 %.
Shape grammar parsing : application to image-based modeling

The purpose of this thesis was to perform facade image parsing with shape grammars in order to tackle single-view image-based 3D building modeling. The scope of the thesis was lying at the border of Computer Graphics and Computer Vision, both in terms of methods and applications.Two different and complementary approaches have been proposed: a bottom-up parsing algorithm that aimed at grouping similar regions of a facade image so as to retrieve the underlying layout, and a top-down parsing algorithm based on a very powerful framework: Reinforcement Learning. This novel parsing algorithm uses pixel-wise image supports based on supervised learning in a global optimization of a Markov Decision Process.Both methods were evaluated quantitatively and qualitatively. The second one was proved to support various architectures, several shape grammars and image supports, and showed robustness to challenging viewing conditions; illumination and large occlusions. The second method outperformed the state-of-the-art both in terms of segmentation and speed performances. It also provides a much more flexible framework, in which many extensions may be envisioned.The conclusion of this work was that the problem of single-view image-based 3D building modeling could be solved elegantly by using shape grammar as a Rosetta stone to decipher the language of Architecture through a well-suited Reinforcement Learning formulation. This solution was a potential answer to large-scale reconstruction of urban environments from images, but also suggested the possibility of introducing Reinforcement Learning in other vision tasks such as generic image parsing, where it have been barely explored so far.
Program Dependence Graphs for the Rest of Us

This report presents new control dependence analysis techniques that succeed in constructing a control dependence graph (CDG) in all of the common cases without requiring either the control flow graph or the auxiliary structures needed by the fully general algorithm. In the worst case, the intermediate structures built by our algorithms are used to derive a simplified form of the control flow graph that is then used by the general algorithm. In this eventuality, the general algorithm may run more quickly, since a portion of its analysis has already been performed. The report also presents an adaptation of Tarjan’s interval analysis algorithm for data flow analysis that uses the control dependence graph instead of the control flow graph. Using the CDG-based analysis algorithm allows us to construct a program dependence graph (PDG) without first constructing a control flow graph. This approach offers several advantages over the conventional models. It eliminates a complete program representation (the control flow graph), it simplifies the construction of the PDG and it supports efficient data flow analysis using the internal representations available. Also, understanding the direct construction of a control dependence graph increases one’s understanding of control dependence and its relation to control flow. Finally, this report presents a case study of goto usage in C programs which confirms the assumptions that (1) goto s are relatively infrequent and (2) goto usage in C programs largely follows predictable patterns that can be exploited to produce PDGs without resorting to global control dependence analysis in many cases.
Bridging Theater and Mathematics: a Playwright's View

The goal of this paper is to offer a playwright’s perspective on how mathematical objects could be included in the design of a play. This is an attempt to communicate the meaning of the term “structure of the play” for the playwright by providing an example. The goal is to elicit ideas from others about mathematical objects, proof ideas, etc. that can be used as inspirational structures in playwriting.
Extremely low overhead off-chip memory encryption

Over the last decade, advancements in performance and efficiency of portable computing devices have allowed them to provide much of the functionality previously restricted to larger computers. Instant communication, GPS navigation, remote banking, and even online shopping are only a few of the activities that can be performed from almost anywhere. However, these conveniences may come at the cost of physical security since portable devices are often operated in a public environment where there is a possibility of being physically exposed or obtained by untrustworthy users. While it is a common practice to secure the data that is transferred from one point to another, the contents of system memory often go unprotected. When physical access to a device is attained, this so called “data-atrest” can be exploited to reveal private information. Emails, GPS location data, financial transactions, etc. could be harmful if revealed to the wrong party. This thesis investigates the design trade-offs of obscuring data stored within low latency memory on an embedded device. This was achieved by implementing a parameterizable system based on the keystream cache concept. While this solution could be implemented for almost any embedded system, the design was evaluated using reconfigurable hardware in order to reduce development costs. A prototype was built and tested on an Altera FPGA development board where parameters of the architecture were varied to find a solution that reduced performance overhead, while minimizing hardware usage. The resulting application benchmarks show as little as 1% performance overhead while using minimal hardware resources.
Language-Based Prior Knowledge and Transition to Mathematics.

The paper provides a college mathematics student’s concept maps, definitions, and essays to support the thesis that language-based prior knowledge can influence students’ cognitive processes of mathematical concepts. A group of intermediate algebra students who displayed terms mainly from the spoken language on the first and the second concept maps and essays included terms reflecting more of an equation/formula-based conceptualization of the function concept on their third and the last concept maps and essays. INTRODUCTION Common language meanings students bring into the mathematics classroom may influence or hinder the learning process. We use the term “common language” for the knowledge and meaning of concepts that are used outside the context of mathematics (used in spoken language). As Tobias (1993) states, students struggle to make sense of new information and their common language knowledge of many mathematics concepts. For instance, “multiply”, meaning increase in common language, may dominate students’ cognitive processes so much so that they may struggle or not understand why multiplying fractions results in a smaller value/quantity. A student struggling to make sense of the mathematical meaning of a concept in the presence of his or her prior knowledge may fail to construct meaningful links between the two meanings, and eventually, out of frustration, turn to rote learning. That is, he or she may choose to focus on fragmented
Computer Adaptive Testing for Small Scale Programs and Instructional Systems

This study investigates measurement decision theory (MDT) as an underlying model for computer adaptive testing when the goal is to classify examinees into one of a finite number of groups. The first analysis compares MDT with a popular item response theory model and finds little difference in terms of the percentage of correct classifications. The second analysis examines the number of examinees needed to calibrate MDT item parameters and finds accurate classifications even with calibration sample sizes as small as 100 examinees.
Collaborative Conceptual Modeling Using the SKETCH Framework

This paper introduces NetSketch, an application that supports distributed conceptual design by providing tools for modelessly creating, manipulating and viewing 3D models in a shared virtual space. Inherent problems exist with collaborative design tools because of the simultaneous group interaction required for users to smoothly and effectively work together in the same virtual space. With NetSketch, we provide solutions to these problems by providing a fast and direct gesture-based user interface, a set of visual effects that better enable a user's awareness of operations done by other participants, and a set of tools for enhancing visual communication between participants.