Miracle-dz/UniFAR-FTUs huggingface dataset:
Living as Form : Socially Engaged Art from 1991-2011

"Over the past twenty years, an abundance of art forms have emerged that use aesthetics to affect social dynamics. These works are often produced by collectives or come out of a community context; they emphasize participation, dialogue, and action, and appear in situations ranging from theater to activism to urban planning to visual art to health care. Engaged with the texture of living, these art works often blur the line between art and life. This book offers the first global portrait of a complex and exciting mode of cultural production — one that has virtually redefined contemporary art practice. Living as Form grew out of a major exhibition at Creative Time in New York City. Like the exhibition, the book is a landmark survey of more than 100 projects selected by a thirty-person curatorial advisory team; each project is documented by a selection of color images. The artists include the Danish collective Superflex, who empower communities to challenge corporate interest; Turner Prize nominee Jeremy Deller, creator of socially and politically charged performance works; Women on Waves, who provide abortion services and information to women in regions where the procedure is illegal; and Santiago Cirugeda, an architect who builds temporary structures to solve housing problems" -- p. [4] of cover.
Nuovi paradigmi per la pianificazione urbanistica: i servizi ecosistemici per il buon uso del suolo

I Servizi Ecosistemici (SE) sono diventati un tema centrale per lo sviluppo di buone pratiche di pianificazione. Cio nonostante, sono ancora deboli le connessioni tra la conoscenza teorica dei SE e il loro reale utilizzo nella pianificazione urbanistica. In particolare, gli aspetti che riguardano i) la condivisione delle metodologie per la quantificazione e mappatura dei SE propedeutiche alla valutazione delle previsioni di trasformazione d'uso del suolo e ii) la strutturazione di un sistema di conoscenze che possa essere condiviso nei processi di VAS con gli Enti sovralocali del governo del territorio, costituiscono gli ambiti e il terreno di maggiore interesse per la ricerca. Il progetto europeo LIFE SAM4CP (www.lifesam4cp.eu) sta traguardando alcuni importanti risultati rispetto all'aggiornamento del profilo scientifico e disciplinare della pianificazione urbanistica, e delle sue ricadute nel rapporto tra i soggetti deliberatori delle scelte di piano e del coinvolgimento con i cittadini. Nell'ambito di una parziale valutazione dei risultati delle azioni di progetto, il paper argomenta sulla capacita dell'analisi quali-quantitativa biofisica ed economica dei SE di sostenere una migliore pianificazione urbanistica attenta ai valori del suolo ed alla necessita di un forte risparmio del suo consumo. Contemporaneamente, si evidenzia la necessita di accrescere, fra i diversi portatori di interessi ai differenti i livelli, la consapevolezza sui temi del suolo e sull'importanza dei SE e di costruire consenso attorno a scelte urbanistiche basate sulla loro analisi, utilizzando meglio e potenziando il ruolo della VAS.
Traffic analysis of some uk-us academic network data

The first section describes the network. The following section describes the monitoring and analysis tools. The subsequent section details the results. The last section draws some conclusions. The analysis performed concentrates very heavily upon presenting aggregate collections of data, rather then detailed analysis of traffic dynamics, as it is hoped that these will reveal areas of weakness in the network, upon which further work could be performed.
Finite-state error/edit-systems and difference-measures for languages and words

We onsider a spe ial type of automaton, the weighted nite-state e-system (wfse-system), that allows us to des ribe formally the ombinations of errors (edit operations) that are permitted in some information pro essing appli ation. Given two regular languages and a wfse-system we an ompute the set of all edit-strings that an transform a word of the rst language to a word of the se ond one using only the edit operations permitted by the given wfse-system. Ea h wfse-system an be used to de ne a measure of the di eren e between words and languages. Our presentation provides a uniform treatment of ertain algorithmi problems pertaining to the di eren es between su h obje ts. In parti ular, we show how to nd the Hamming distan e of a given regular language in quadrati time and how to ompute eÆ iently the general string to regular-language orre tion problem. Moreover, we dis uss an implementation of our solution to this problem, whi h uses Grail to represent automata.
A Guide to the World’s Languages

Specialists consulted Abbreviations A note on notation Introduction 1. Genetic classification: principles and methods 2. Europe 3. Africa 4. Asia 5. Oceania 6. North and South America 7. Prospects for future research 8. Genetic classification of the world's languages Postscript 1991 Index of personal names Language group index Language index.
AKUISISI DATA VIDEO UNTUK KENDALI KEAMANAN

Sistem keamanan atau monitoring adalah banyak bergantung pada visualisasi objek. Metode yang banyak digunakan adalah dengan memanfaatkan sensor video seperti kamera yang berbasiskan CCD. Selama ini proses monitoring dilakukan secara traditional dan belum memiliki database, sekian banyak monitor yang telah terpasang dengan kamera di suatu tempat, namun masih ada kekuranganya akibat kelalaian karyawan sehingga proses monitoring masih belum bisa berjalan dengan baik Contoh kelalaian yang bisa terjadi diantaranya kelalaian akibat pegawai kelelahan dan mengantuk sehingga proses pegawasan monitoring belum dilaksanakan secara seksama, kejadian yang mungkin terjadi yaitu pencurian saat karyawan tertidur tanpa disadari. Pada penelitian ini akan dilihat pemanfaatan video montioring dengan menggabungkan teknik pendeteksi gerak dan broadcast memanfaatkan jaringan 3G ke mobile phone. Permasalah utama adalah untuk mendefinisikan keaktifan sebuah sensor, apakah objek bergerak sebagai hal yang dicurigai atau tidak. Selama ini proses monitoring mempunyai kendala dalam hal mendeteksi gerakan seperti tingkat level gerakan yang seperti apa yang dapat ditangkap sistem apabila objek dianggap bergerak. Sistem ini menjelaskan bagaiman level pergerakan objek ditangkap oleh kamera. Sehingga kita dapat menangkap pergerakan objek secara tepat dan akurat. Dengan adanya sistem ini kita bisa dengan mudah mengontrol suatu objek pada waktu dan tempat tertentu meskipun dari jarak yang sangat jauh serta bisa mengakses databasenya melaui mobile Device ataupun dari komputer yang berada di tempat objek tersebut. Sistem ini bisa diterapkan untuk individu yang ingin mengawasi barang berharganya maupun Instansi pemerintah atau perusahaan-persahaan.
Colour Tracking for Unintrusive Real-Time Human Motion Capture to Drive an Avatar

This report presents two colour tracking techniques developed for use in a real-time interactive motion capture system. The aim of these trackers is to remove the need for special clothing and markers in these systems. The first colour tracker, designed for simplicity and robustness, tracked colours using a static colour model for each of the objects. The second colour tracker, designed to adapt and adjust for colour changes, tracked colours using a dynamic colour model for each of the objects. The dynamic model used the movements of colour in colour space to correct the model to help correctly locate the object.
A Model Checking Algorithm for Temporal Logics of Knowledge in Multi-Agent Systems

Model checking has being used mainly to check if a system satisfies the specifications expressed in temporal logic and people pay little attention to the model checking problem for logics of knowledge. However, in the distributed systems community, the desirable specifications of systems and protocols have been expressed widely in logics of knowledge. In this paper, the model checking approaches for the temporal logic of knowledge are discussed. On the base of SMV (symbolic model verifier), according to the semantics of knowledge and set theory, several approaches for model checking of knowledge and common knowledge are presented. These approaches make SMV's functions extended from temporal logics to temporal logics of knowledge. They also correspond to other model checking approaches and tools where the output is the set of states.
QUERY REWRITING BERBASIS SEMANTIK MENGGUNAKAN WORDNET DAN LCh PADA SEARCH ENGINE GOOGLE

Saat ini sumber dari informasi semakin bertambah secara cepat pada kurun waktu terakhir ini, terlebih dengan makin berkembangnya teknologi internet. Besarnya jumlah sumber informasi juga melahirkan keragaman dari sumber informasi tersebut. Pengumpulan data dengan memanfaatkan Internet seperti adanya fasilitas Google adalah dengan cara memasukkan kata kunci. Mesin pencari tidak selalu memberikan informasi yang akurat. Kekurangan ini biasanya disebabkan oleh dua masalah utama. Pertama, mesin pencari tidak mampu menemukan pola dari dokumen relevan. Kedua, pengguna tidak menyatakan permintaannya dengan benar. Pada artikel ini menjelaskan teknik bahwa penulisan ulang permintaan (query) dengan menggunakan semantik similarity yaitu leacock & chodrow pada saat pencarian informasi di mesin pencari dapat memberikan hasil informasi yang lebih tepat.
Optimising The Web for a GPRS Link

My aim was to develop a system to improve the performance of web browsing over a GPRS link. I aimed to do this by implementing the following enhancements: An aggressive caching scheme, using a content-based hash keying to improve hit rates for dynamic content; a pre-emptive push of web page support resources to the client; resource adaptation to suit client capabilities, delta-encoding transfers over GPRS link; DNS lookups moved to wired-side; and a Custom Protocol over the link itself, with fixed window flow control, rapid start-up, and negative acknowledgements. These enhancements are implemented using HTTP proxies. The aims have been met. The content based caching scheme works effectively and significantly improves performance; delta encoding where applicable cuts the page load time considerably; resource adaptation reduces the size of JPEG images and speeds up their transfer; the custom protocol provides rapid and reliable data transfer; and parse and push delivers great speed benefits, but has some client-server synchronisation issues. I Andrew Clark of King's College, being a candidate for Part II of the Computer Science Tripos, hereby declare that this dissertation and the work described in it are my own work, unaided except as may be specified below, and that the dissertation does not contain material that has already been used to any substantial extent for a comparable purpose. 1 INTRODUC TION BACKGROUND The General Packet Radio Service (GPRS) is part of the new generation of mobile phones offering an always-on, packet based system for internet connection, with significantly higher bandwidth than is currently available with older mobile phone networks. GPRS, however, has its limitations. Current implementations allow connection to the GPRS Internet at rates of around 40Kbps – around four times faster than GSM. In practice, the experience is much slower than this suggests, especially when web browsing. IP over GPRS has different characteristics to most wired IP links. Firstly, the propagation delay for an IP packet over the link is huge – in the order of 500ms each way. Secondly, the link layers below IP in the GPRS network employ an efficient retransmission and forward error-correction scheme. This leads to a negligible error rate over the wireless link, and thus IP is rarely troubled by end-to-end packet loss. Thirdly, packets are sometimes delayed significantly during 'service outages', leading applications to falsely assume that a connection has been lost. These characteristics cause problems for protocols such as TCP. TCP's three-way …
Contraloría social y decisiones de política pública en el ámbito local: binomio necesario

Este trabajo desarrolla la perspectiva politica, misma que utiliza elementos de los diversos marcos interpretativos de la politica publica. Lo anterior somete a debate la obcecada necesidad de analizar la politica desde una unica perspectiva, lo cual frecuentemente se hace. Esta vision analitica conduce a la solucion de las grandes preguntas que la realidad social exige sin postergacion alguna. La politica y su interpretacion se tienen que complejizar para poder comprender el ejercicio del poder per se y el poder ejercido desde la toma de decisiones que involucra el bien colectivo. La tesis que entreteje este trabajo abona y se nutre de la construccion de figuras ciudadanas como actores protagonicos de la toma de decisiones en lo publico, pero fundamentalmente en la trasparencia y rendicion de cuentas del proceso y los resultados del ejercicio democratico de la decision politica.
The Semantics and Implementation of Bindings in Higher-Order Programming Languages

A fundamental activity in programming language design is the association of a name to a syntactic phrase. This is called a de nition binding, since the name de nes the syntactic phrase. Bindings can also arise as a consequence of parameter transmission, via the association of a formal parameter name to an actual parameter, and are termed parameter bindings. Bindings can be understood in many di erent ways: we study two popular semantics of bindings, namely, eager (or call-by-value) semantics and lazy (or call-by-name) semantics. We validate Landin's correspondence principle, a benchmark of programming language design, by developing a categorical model for a higher-order, modular language. The model provides a uniform semantics of de nition and parameter bindings. If the language satis es the correspondence principle, the categorical model is a weakly symmetric, monoidal-closed category. This allows the understanding of de nitions as records, their invocation as record indexing, and parameterized de nitions as -abstractions. Applications of the framework to compiling are given. Next, we discuss the implementation and e cient memory allocation of bindings. Higher-order programming languages support a variety of run-time data values, many of which are highly memory intensive. Consequently, it is desirable to allocate storage for and retain bindings to such data values only as long as truly necessary, and to free storage once the data values become obsolete. Stack-based implementations not only provide a simple method to perform such allocations and deallocations, but also allow them to be represented by a syntactic construct in the source language. We study how a functional language, namely, the simply-typed -calculus, can be implemented with an environment modelled as a stack-of-bindings. We also study how a higher-order, call-byvalue imperative language, namely, the -calculus, can be implemented with a storage stack that holds dynamically-allocated locations. In both these studies we develop simple analyses for statically determining when run-time values can be safely deallocated. Such values are never referenced by the rest of the computation, so their deallocation (popping) is safe. Finally, we present an implementation of the environment stack and provide some benchmarks. Table of
Modeling problem-solving methods in new KARL

New KARL (Knowledge Acquisition and Representation Language) allows to specify all parts of a problem-solving method (PSM). It is a formal language with a well-defined semantics and thus allows to represent PSMs precisely and unambiguously yet abstracting from implementation detail. In this paper it is shown how the language KARL has been modified and extended to New KARL to better meet the needs for the representation of PSMs. Based on a conceptual structure of PSMs new language primitives are introduced for KARL to specify such a conceptual structure and to support the configuration of methods. An important goal for this extension was to preserve three important properties of KARL: to be (i) a conceptual, (ii) a formal, and (iii) an executable language.
Content Conversion and Generalisation on the Web: A Pattern Language

Content conversion and generation is required by many interactive, web-based applications. Simplistic implementations of content converters, creators, and templates often cannot satisfy typical requirements such as high performance, end-user customizability, personalization, dynamic system updates, and integration with multiple channels. We present a pattern language resolving central forces in this context. A GENERIC CONTENT FORMAT can be used to integrate content from different supported content sources. PUBLISHER AND GATHERER are central instances to trigger back and forth conversion to the GENERIC CONTENT FORMAT, and to handle other central content management tasks such as c ache lookup and storage. Conversions are performed by CONTENT CONVERTERS. The patterns CONTENT CREATOR, CONTENT FORMAT TEMPLATES, and FRAGMENTS generate content on request. A CONTENT CACHE is used to store and retrieve the content in a central repository, and FRAGMENTS are the basic elements stored in the cache.
Parallel log structured file system (PLFS)

Gary Grider, HPC-DO; John Bent, EMC Corporation; Chuck Cranor, Carnegie Mellon University; Jun He, New Mexico Consortium; Aaron Torres, HPC-3; Meghan McClelland, HPC-5; Brett Kettering, HPC-5 To improve the checkpoint bandwidth of critical applications at LANL, we developed the Parallel Log Structured File System (PLFS)[1]. PLFS is a transformative I/O middleware layer placed within our storage stack. It transforms a concurrently written single shared file into non-shared component pieces. This reorganized I/O has made write size a non-issue and improved checkpoint performance by orders of magnitude, meeting the project’s L2 milestone to show increased performance for checkpointing with LANL codes. LANL is working together with EMC under an umbrella Cooperative Research and Development Agreement (CRADA) to further enhance, design, build, test, and deploy PLFS. PLFS has been integrated with multiple types of storage systems, including cloud storage, and has shown improvements in file storage sizes and metadata rates.
Validación de las inferencias de la Escala de Optimismo usando la Teoría Clásica de Medición en una muestra de empleados de la región norte de Puerto Rico

The learned Optimism Scale was validated using Classic Test Theory. The validation simple consisted of 525 puertorrican adults from the north region of Puerto Rico. At the moment of the study they were working on a full or partime basis. The average age was 32 years, and 57% was female, and 43% was male. An item analysis was performed. The item discrimination indexes averaged . 68 with a Cronbach’s alfa reliability index of . 91. An exploratory and confirmatory factor analysis were executed to understand the construct validity behind the scale. The eigen factor was 5.7, explaining 56% of the total variance of the optimism construct. The confirmatory test used was a Chi Square test, which demonstrated that there is a fit between the data gathered and the one factor model. The average communality was . 52 with average factor loadings of . 72. The results suggest that there is enough evidence of validity and reliability of the Learn Optimism Scale using Classic Test Theory. The limitations and recommendations for future studies are presented. How to reference this article: Andujar Rojas, C. , Nieves Recinto, M. , Santiago, B. , Delgado, K. & Otero, E. (2013). Validacion de las inferencias de la Escala de Optimismo usando la Teoria Clasica de Medicion en una muestra de empleados de la region norte de Puerto Rico. Revista Interamericana de Psicologia Ocupacional. 32(1), pp. 74-84
Communication Software Performance for Linux Clusters with Mesh Connections

Recent progress in copper based commodity Gigabit Ethernet interconnects enables constructing clusters to achieve extremely high I/O bandwidth at low cost with mesh connections. However, the TCP/IP protocol stack cannot match the improved performance of Gigabit Ethernet networks especially in the case of multiple interconnects on a single host. In this paper, we evaluate and compare the performance characteristics of TCP/IP and M-VIA software that is an implementation of VIA.In particular, we focus on the performance of the software systems for a mesh communication architecture and demonstrate the feasibility of using multiple Gigabit Ethernet cards on one host to achieve aggregated bandwidth and latency that are not only better than what TCP provides but also compare favorably to some of the special purpose high-speed networks. In addition, implementation of a new M-VIA driver for one type of Gigabit Ethernet card will be discussed.
Publication quality tables in L A T E X

This article describes some additional commands to enhance the quality of tables in LATEX. Guidelines are given as to what constitutes a good table in this context. The 2000 release (Version 1.61) of the booktabs package, described herein, adds some enhancements to the 1995 release (Version 1.00), most notably longtable compatibility. Releases (Versions 1.618, 1.6180 and 1.61803) are only bug patches and support for the colortbl package. 1
Knowledge-based problem solving without production rules

Most expert computer systems are based on production rules, and to some readers the terms expert computer system and production system may seem almost synonymous. However, there are problem domains for which the best way to represent the knowledge appears not to be production rules at all. The paper discusses one alternative to production rules which has proven useful in several medical diagnostic problems and at least one nonmedical nondiagnostic problem. This method, which is based on a generalization of the set covering problem, provides an intuitively plausible method for diagnostic reasoning which is sometimes preferable to production rule techniques. 14 references.
Synergistic caching in single-chip multiprocessors

This dissertation addresses one of the fundamental questions driving all computer architecture and design: how do we make computers faster? In this work, we explore the direction of caching systems as they are driven by developing technology, particularly the confluence of many processors onto a single die. We call these systems Chip Multiprocessors (CMPs). We explore how we can exploit the advantages uncovered by these developments – most significantly, high on-chip bandwidth and low latency – to develop a more efficient, adaptable and elegant caching system. With increasing numbers of transistors on a chip and the subsequent convergence of many processing nodes onto a single chip, we see three dominant effects. First, because the entire system is on chip, the cost of communication between nodes is changing. In the on-chip environment, wires are cheap and area is expensive. Instead of sacrificing large amounts of area to decrease bandwidth requirements – as is often done in the multi-chip multiprocessor environment – it is better to minimize area and make use of the high on-chip bandwidth. Second, in CMP systems we see a larger range of memory access times. The delay to memory can no longer be lumped into a single number. The physical location of the memory greatly affects the delay to retrieve the data. In previous architectures, the time to get from the processor to data was an all-or-nothing gamble. Either the data was on chip, in the processor’s local cache, or it would take a long time to get the data from off-chip memory. Finally, processors working on the same problem encourage synergy in the use and sharing of data. With a group of processors working on the same problem, data needed by one processor may have already been pulled in from main memory by a