Miracle-dz/UniFAR-FTUs huggingface dataset:
Studies in Prolog architectures

This dissertation addresses the problem of how logic programs can be made to execute at high speeds. Prolog, chosen as a representative logic programming language, differs from procedural languages in that it is applicative, nondeterminate and uses unification as its primary operation. Program performance is directly related to memory performance because high-speed processors are ultimately limited by memory bandwidth and architectures that require less bandwidth have greater potential for high performance. This dissertation reports the dynamic data and instruction referencing characteristics of both sequential and parallel Prolog architectures and corresponding uniprocessor and multiprocessor memory-hierarchy performance tradeoffs. Initially, a family of canonical architectures, corresponding closely to Prolog, is defined from the principles of ideal machine architectures of Flynn, and is then refined into the realizable Warren Abstract Machine (WAM) architecture. The memory-referencing behavior of these architectures is examined by tracing memory references during emulation of a set of Prolog benchmarks. Measurements of the canonical architectures indicate the upper memory-performance bounds of sequential execution. Measurements of the WAM provide frequencies of memory references and indicate that the WAM approaches the performance of the canonical Prolog architectures on current hosts. Two-level memory hierarchies for both sequential (WAM) and parallel (PWAM) Prolog architectures are modeled. PWAM is the Restricted-AND Parallel architecture of Hermenegildo. Local memory designs are simulated using memory traces, whereas main memory designs are analyzed with queueing models. The results show that small buffers (256 words or less) can significantly reduce Prolog's memory bandwidth requirement, primarily by capturing shallow backtracking information. Larger, more general local memories, such as caches, are necessary in high-performance systems to further reduce memory traffic. Local memory consistency protocols for a shared memory PWAM multiprocessor are analyzed. Measurements indicate that the memory-referencing overheads of exploiting Restricted-AND Parallelism are minor. These results show, however, that as few as eight high-performance processing elements can saturate a shared bus. With emerging bus technology and properly interleaved shared-memory, limited-size multiprocessors of this type have great potential for cost-effective speedups. This dissertation provides previously unavailable information concerning the memory-referencing characteristics of logic programming languages executing on hierarchical memory organizations, thus contributing to processor memory design.
The field of digital documentary: a challenge to documentary theorists

Documentary has always responded, in an often dynamic fashion, to the possibilities afforded by new technologies. The adoption of portable camera and sound equipment, for example, gave documentary film-makers the means to experiment with innovative approaches to capturing the social-historical world, helped to reinvigorate interest in the genre amongst a new generation of practitioners and reintroduced its potential to audiences. The relationship between documentary and digital technologies, however, offers the potential for a far more extensive and permanent transformation of fundamental aspects of documentary culture. The possible changes are many and varied. They involve a transformation of the very materiality of texts themselves, as their constituent elements are trans-posed into computer files able to be easily accessed, distributed, combined and manipulated for a variety of ends. Those who we might refer to as following “conventional” documentary forms are increasingly experimenting with digital-based means of capturing footage and a new palette of post-production techniques, resulting in the stretching of familiar documentary modes of representation into new directions. The production base of documentary culture itself is broadening as digital platforms foster far more direct, if not yet fully democratic, forms of participation, especially from the ranks of groups we might have previously consigned to the relatively ‘passive’ role of audience members. Both professional and amateur film-makers are also exploiting the varieties of forms of interactive, cross-platform engagement through DVD and the World Wide Web, as well as using these media as new avenues for distribution of more conventional documentary texts. All
Porting Interactive Applications to the Web

Objectives of Tutorial This tutorial is targeted on developers porting interactive applications from personal computers to operate in a client-server mode on World Wide Web (the w b). The tutorial will be useful to those involved in porting, those responsible for estimating and managing porting effort, and those investigating the feasibility of porting applications to the web. A background in software development and basic knowledge of HTML/HTTP are assumed.
Implementing Product-Line Features By Composing Component Aspects

Emerging E-Commerce systems are highly dynamic and require even more flexibility and reduced time to market than that traditionally provided by product-line and component-based development (CBSE). In this paper we describe our work on agent-based product-line CBSE for flexible e-commerce systems. We are integrating several technologies for product-line analysis and component design, implementation and customization to create a basis for systematic product-line development. Largely independent work on reuse ("domain analysis") and object-oriented technology ("design and code") has matured to the degree that integration of the techniques promises a coherent approach. We outline a practical development process that structures a set of common and variable features supporting a product-line, to produce reusable elements ("aspects") that can be combined into customized components and frameworks to support the product-line.
THE CLEANING AND CONSOLIDATION OF EGYPTIAN ENCAUSTIC MUMMY PORTRAITS

AbstractThe Petrie Museum of Egyptian Archaeology (University College, London) contains a large collection of encaustic wax on wood portraits from a Roman-period cemetery at Hawara in Egypt. They received some early conservation treatment during or shortly after excavation, usually consolidation with modern wax, softening the ancient wax with heat or facing with paper. Some of the portraits were cleaned during the 1970s and early 1980s, using solvents such as Shellsol T (a mixture of aliphatic hydrocarbons) or white spirit. Water-soluble dirt was removed with aqueous solution of Synperonic NOB (non-ionic detergent) or Vulpex (potassium oleate soap). Fragmentary areas were consolidated, usually with polyethylene glycol. The authors have found that cleaning the portraits mechanically with a polished scalpel blade removes the early conservation wax and the ancient burial debris which overlie and are sometimes intermixed with the pigmented wax, whilst avoiding many of the problems associated with solvent clea.
Syntax-to-morphology alignment and constituent reordering in factored phrase-based statistical machine translation from English to Turkish

English is a moderately analytic language in which the meaning is conveyed with function words and the order of constituents. On the other hand, Turkish is an agglutinative language with free constituent order. These differences together with the lack of large scale English-Turkish parallel corpora turn Statistical Machine Translation (SMT) between these languages into a challenging problem. SMT between these two languages, especially from English to Turkish has been worked on for several years. The initial findings [El-Kahlout and Of lazer, 2006] strongly support the idea of representing both Turkish and English at the morpheme-level. Furthermore, several representations and groupings for the morphological structure have been tried on the Turkish side. In contrast to these, this thesis mostly focuses on the experiments on the English side rather than Turkish. In this work we firstly introduce a new way to align the English syntax with the Turkish morphology by associating function words to their related content words. This transformation solely depends on the dependency relations between these words. In addition to this improved alignment, a syntactic reordering is performed to get a more monotonic word alignment. Here, we again use dependencies to identify the sentence constituents and perform reordering between them so that the word order of the source side will be close to the target language. We report our results with BLEU which is a measure that is widely used by the MT community to report research results. With improvements in the alignment and the ordering, we have increased our BLEU score from a baseline score of 17.08 to 23.78, which is an improvement of 6.7 BLEU points, or about 39% relative.
On the Performance of Timing-Error Tolerant Programmable FIR Filters

A modified transposed direct-form programmable FIR filter is proposed to combat potential transient timing-errors in low voltage operation. The architecture allows the isolation of errors in the filter taps in combination with simple error correction schemes. Two such schemes are investigated with ideal error detection. The filter stop- band rejection in the presence of timing-errors for both schemes is presented from simulation results of the proposed filter. Timing errors can arise due to sub-critical voltage scaling, process variation and changes in temperature. Architectures that can tolerate a small but non-zero timing error rate while satisfying the required performance specification are highly desirable as they potentially allow reduced power consumption and/or improved fabrication yield. This paper considers the implementation of a fully-parallel programmable FIR filter. Such structures have only data-path logic, and no control logic, which makes for a tractable problem, since tolerating timing-errors in control logic is a considerable challenge. In the following sections we will look briefly at CMOS energy and delay and consider sub-critical voltage scaling as a technique to lower power consumption and hence motivate the study of timing-error tolerant VLSI architectures. We will then propose a new architecture for a programmable FIR filter and present simulation results.
A Simple MAX-CUT Algorithm for Planar Graphs.

The max-cut problem asks for partitioning the nodes V of a graph G = (V, E) into two sets (one of which might be empty), such that the sum of weights of edges joining nodes in different partitions is maximum. Whereas for general instances the max-cut problem is NPhard, it is polynomially solvable for certain classes of graphs. For planar graphs, there exist several polynomial-time methods determining maximum cuts for arbitrary choice of edge weights. Typically, the problem is solved by computing a minimum-weight perfect matching in some associated graph. In this work, we present a new and simple algorithm for determining maximum cuts for arbitrary weighted planar graphs. Its running time can be bounded by O(|V | 3 2 log |V |), similar to the fastest known methods. However, our transformation yields a much smaller associated graph than that of the known methods. Furthermore, it can be computed fast. As the practical running time strongly depends on the size of the associated graph, it can be expected that our algorithm is considerably faster than the methods known in the literature. More specifically, our program can determine maximum cuts in huge realistic and random planar graphs with up to 10 nodes.
Robust and adaptive communication under uncertain interference

Robust and adaptive communication under uncertain interference by Anand Dilip Sarwate Doctor of Philosophy in Engineering—Electrical Engineering and Computer Sciences and the Designated Emphasis in Communication, Computation, and Statistics University of California, Berkeley Professor Michael Gastpar, Chair In the future, wireless communication systems will play an increasingly integral role in society. Cutting-edge application areas such as cognitive radio, ad-hoc networks, and sensor networks are changing the way we think about wireless services. The demand for ubiquitous communication and computing requires flexible communication protocols that can operate in a range of conditions. This thesis adopts and extends a mathematical model for these communication systems that accounts for uncertainty and time variation in link qualities. The arbitrarily varying channel (AVC) is an information theoretic channel model that has a time varying state with no statistical description. We assume the state is chosen by an adversarial jammer, reflecting the demand that our constructions work for all state sequences. In this thesis we show how resources such as secret keys, feedback, and side-information can help communication under this kind of uncertainty. In order to put our results in context we provide a detailed taxonomy of the known results on AVCs in a unified setting. We then prove new results on list decoding
Audio-Visual Automatic Speech Recognition: An Overview

We have made significant progress in automatic speech recognition (ASR) for well-defined applications like dictation and medium vocabulary transaction processing tasks in relatively controlled environments. However, ASR performance has yet to reach the level required for speech to become a truly pervasive user interface. Indeed, even in “clean” acoustic environments, and for a variety of tasks, state of the art ASR system performance lags human speech perception by up to an order of magnitude (Lippmann, 1997). In addition, current systems are quite sensitive to channel, environment, and style of speech variations. A number of techniques for improving ASR robustness have met limited success in severely degraded environments, mismatched to system training (Ghitza, 1986; Nadas et al., 1989; Juang, 1991; Liu et al., 1993; Hermansky and Morgan, 1994; Neti, 1994; Gales, 1997; Jiang et al., 2001). Clearly, novel, non-traditional approaches, that use orthogonal sources of information to the acoustic input, are needed to achieve ASR performance closer to the human speech perception level, and robust enough to be deployable in field applications. Visual speech is the most promising source of additional speech information, and it is obviously not affected by the acoustic environment and noise.
Two Novel Learning-Based Criteria and Methods Based on Multiple Classifiers for Rejecting Poor Handwritten Digits

In pattern recognition, the reliability and the recognition accuracy of a classification system are of same importance, because even a small percentage of errors could cause a huge loss in real-life handwritten numeral recognition systems, like cheque-reading at financial institutions. Aiming at improving the reliability of recognition systems, this thesis presents two novel learning-based rejection criteria for single classifiers including SVM-based measurement (SVMM) and Area Under the Curve measurement (AUCM). Voting based combination methods of multiple classifier system (MCS) are also proposed for rejecting poor handwritten digits. Different rejection criteria (FRM, FTRM and SVMM) are individually combined with MCSs as weight parameters in voting. This method is then evaluated on three renowned databases including MNIST, CENPARMI and USPS. Experimental results indicate that these combinations improve the rejection performances consistently. To further improve the performance of the MCS based rejection method, specialist information has been integrated into the combination process by introducing a new confidence weight parameter. The best result on MNIST is obtained by the simpler one of the two proposed methods of deriving this parameter, which reaches 100% reliability with a rejection rate of only 4.09%, the best value in this field.
A Review of the Benefits and Issues of Speaker Verification Evaluation Campaigns

Evaluating speaker verification algorithms on relevant speech corpora is a key issue for measuring the progress and discovering the remaining difficulties of speaker verification systems. A common evaluation framework is also a key point when comparing systems produced by different labs. The speech group of the National Institute of Standards and Technology (NIST) has been organizing evaluations of text-independent telephony speaker verification technologies since 1996, with an increasing success and number of participants over the years. These NIST evaluations have been recognized by the speaker verification scientific community as a key factor for the improvement of the algorithms over the last decade. However, these evaluations measure exclusively the effectiveness in term of performance of the systems, assuming some conditions of use that are sometimes far away from any real-life commercial context for telephony applications. Other important aspects of speaker verification systems are also ignored by such evaluations, such as the efficiency, the usability and the robustness of the systems against impostor attacks. In this paper we present a review of the current NIST speaker verification evaluation methods, trying to put objectively into evidence their current benefits and limitations. We also propose some concrete solutions for going beyond these limitations.
Experimental exploration over a quantum control landscape through nuclear magnetic resonance

The growing successes in performing quantum control experiments motivated the development of control landscape analysis as a basis to explain these findings.When a quantum system is controlled by an electromagnetic field, the observable as a functional of the control field forms a landscape. Theoretical analyses have revealed many properties of control landscapes, especially regarding their slopes, curvatures, and topologies. A full experimental assessment of the landscape predictions is important for future consideration of controlling quantum phenomena. Nuclear magnetic resonance (NMR) is exploited here as an ideal laboratory setting for quantitative testing of the landscape principles. The experiments are performed on a simple two-level proton system in a H$_2$O-D$_2$O sample. We report a variety of NMR experiments roving over the control landscape based on estimation of the gradient and Hessian, including ascent or descent of the landscape, level set exploration, and an assessment of the theoretical predictions on the structure of the Hessian. The experimental results are fully consistent with the theoretical predictions. The procedures employed in this study provide the basis for future multispin control landscape exploration where additional features are predicted to exist.
Optimal pricing in queueing systems with quality of service constraints

Imagine a queueing system with cost sensitive customers. In this situation the service provider is presented with a simple mechanism for regulating usage. The natural goals of such regularization are to maximize revenue and, for systems with finite capacity, to ensure a given quality of service measure. Quality of service may be defined in various ways, but typical examples include minimizing delays in service or the probability of users being blocked. Therefore, dynamic pricing schemes arise as an alternative to building to capacity. We investigate these issues in the context of the general Erlang blocking system or carried traffic model. More specifically, given such a system where arrival rates are user cost dependent, we attempt to maximize revenue while keeping the probability of blocking below some fixed level. An approximate algorithm based on an exact analysis an infinite server or offered traffic model is presented.
T0 Engineering Data

T0 (Torrent-0) is a single-chip fixed-point vector microprocessor designed for multimedia, human-interface, neural network, and other digital signal processing tasks. T0 includes a MIPS-II compatible 32-bit integer RISC core, a 1 Kbyte instruction cache, a high performance fixed-point vector coprocessor, a 128-bit wide external memory interface, and a byte-serial host interface. T0 implements the Torrent ISA described in a separate "Torrent Architecture Manual" technical report. This manual contains detailed information on the T0 vector microprocessor, including information required to build T0 into a system, instruction execution timings, and information on low level T0 software interfaces required for operating system support.
Biomedical Event Extraction with Machine Learning

Biomedical natural language processing (BioNLP) is a subfield of natural language processing, an area of computational linguistics concerned with developing programs that work with natural language: written texts and speech. Biomedical relation extraction concerns the detection of semantic relations such as protein–protein interactions (PPI) from scientific texts. The aim is to enhance information retrieval by detecting relations between concepts, not just individual concepts as with a keyword search. In recent years, events have been proposed as a more detailed alternative for simple pairwise PPI relations. Events provide a systematic, structural representation for annotating the content of natural language texts. Events are characterized by annotated trigger words, directed and typed arguments and the ability to nest other events. For example, the sentence “Protein A causes protein B to bind protein C” can be annotated with the nested event structure CAUSE(A, BIND(B, C)). Converted to such formal representations, the information of natural language texts can be used by computational applications. Biomedical event annotations were introduced by the BioInfer and GENIA corpora, and event extraction was popularized by the BioNLP’09 Shared Task on Event Extraction. In this thesis we present a method for automated event extraction, implemented as the Turku Event Extraction System (TEES). A unified graph format is defined for representing event annotations and the problem of extracting complex event structures is decomposed into a number of independent classification tasks. These classification tasks are solved using SVM and RLS classifiers, utilizing rich feature representations built from full dependency parsing. Building on earlier work on pairwise relation extraction and using a generalized graph representation, the resulting TEES system is capable of detecting binary relations as well as complex event structures. We show that this event extraction system has good performance, reaching the first place in the BioNLP’09 Shared Task on Event Extraction. Subsequently, TEES has achieved several first ranks in the BioNLP’11 and BioNLP’13 Shared Tasks, as well as shown competitive performance in the binary relation Drug-Drug Interaction Extraction 2011 and 2013 shared tasks.
PISATOOLS: Stata module to facilitate analysis of the data from the PISA OECD study

The pisatools package contains several commands that facilitate analysis of the data from the OECD PISA study. These commands allow analysis with plausible values and derive standard errors using the BRR method implemented in PISA. The command -pisastats- allows calculating basic statistics like mean, median, percentiles, standard deviation etc. The commands -pisareg-, -pisaqreg- and -pisacmd-allows using several regression and estimation commands. The commands -pisadeco- and -pisaoaxaca- facilitate decomposition analysis with the PISA data. All commands save output files as HTML tables that can be easily opened in spreadsheet programs or internet browsers but also save results in Stata matrices. Type -help pisastats-, -help pisareg-, -help pisacmd-, -help pisaoaxaca- or -help pisadeco- after installing commands for more details. Check also data analysis manuals on the OECD website.