Miracle-dz/UniFAR-FTUs huggingface dataset:
Named Entity Recognition for Icelandic Research Report

A lossless data compression system and method compresses a set of M data words stored in a computer memory. A first table stores data representing last occurrence positions among those of the M data words already processed for all distinct word values. A second table stores for each data word an entry indicating the position, if any, of a most recent prior occurrence of another data word with the same word value. A dictionary index indicates how many distinct data word values have been encountered during processing of M data words. The M data words are processed in in said M data words previously processed, identifying a longest sequence of data words starting with said each data word referencing said second table to identify data words earlier in said M data words than said each data word that match said each data word's value, identifying a longest sequence of data words earlier in said M data words than said data word which match an equal number of data words starting with said each data word, (B1) when said longest sequence's length is greater than one data word, outputting a run length code that indicates said longest sequence's length and position, and updating said first and second tables for the equal number of data words starting said each data word, and (B2) when said longest sequence's length is equal to one data word, outputting a code that indicates the position of said identified longest sequence, and updating said first and second tables for said each data word.
Developing second-language listening comprehension

Disclaimer/Complaints regulations If you believe that digital publication of certain material infringes any of your rights or (privacy) interests, please let the Library know, stating your reasons. In case of a legitimate complaint, the Library will make the material inaccessible and/or remove it from the website. Please Ask the Library: https://uba.uva. nl/en/contact, or a letter to: Library of the University of Amsterdam, Secretariat, Singel 425, 1012 WP Amsterdam, The Netherlands. You will be contacted as soon as possible.
Biophysics of Computation: Information Processing in Single Neurons (Computational Neuroscience Series)

1. The membrane equation 2. Linear cable theory 3. Passive dendritic trees 4. Synaptic input 5. Synaptic interactions in a passive dendritic tree 6. The Hodgkin-Huxley model of action-potential generation 7. Phase space analysis of neuronal excitability 8. Ionic channels 9. Beyond Hodgkin and Huxley: calcium, and calcium-dependent potassium currents 10. Linearizing voltage-dependent currents 11. Diffusion, buffering, and binding 12. Dendritic spines 13. Synaptic plasticity 14. Simplified models of individual neurons 15. Stochastic models of single cells 16. Bursting cells 17. Input resistance, time constants, and spike initiation 18. Synaptic input to a passive tree 19. Voltage-dependent events in the dendritic tree 20. Unconventional coupling 21. Computing with neurons - a summary
Tisado – A graphics intense smartphone game

This bachelor's thesis describes the design- and implementation process of a 3D smartphone game, where the developers are restricted by both time and hardware limitations. It explores the various aspects of creating a modern game, including effective real-time rendering and the creation of a 3D world, as well as related fields, such as collision detection, optimization techniques and visual effects. The thesis investigates the most commonly used techniques for developing a fun and visually appealing smartphone game, and presents our implementations and solutions to the obstacles facing the modern game developer.
EXTRACTION DE RÈGLES SELON DES CRITÈRES MULTIPLES : L'ART DU COMPROMIS

In this paper, we are interested in the interestingness of rules extracted from data. Our approach is experimental and based on the following remark : the quality of discovered rules in data mining process has to be measured according several criteria such as accuracy, interestingness and comprehensibility, but most work on rule interestingness do not take into account the integration of multiple factors. We present a comparative study which highlights the relative behaviour of different quality measures. We plot sets of rules according a pair of criteria. We obtain graphical representations which show several antagonisms among quality measures. This situation suggests to look in the rule search space for compromise rather than for best rules. We study different solutions and show the advantage of a scalar method for multi-criteria optimisation. The solution is implemented via a genetic algorithm. We have run the algorithm several times in order to propose a set of compromise to the user.
Evaluation of global system state thanks to local phenomenona

This paper presents a new approach for the evaluation of a system's global state properties. The approach is intented for the application to reactive multiagent system (RMAS) and adresses the evaluation of emergent properties such as global stabilisation. This approach is inspired by statistical physics and thermodynamics, as a way to link the microscopic and a macroscopic points of view. It gives an important role to partition function Z as defined in statistical physics. From this mathematical function can be extracted indicators that represent the global evaluation of the system state based on local phenomena. In this paper, the approach is put into practice by considering a classical reactive multiagent system: bird flocks simulation. The methodology was applied to analyze system stability. Experimental results obtained with a multiagent simulation platform are presented.
Volume Visualization of the Heart Using MRI 4D Cardiac Images

This paper deals with a system for volume visualization of the heart using multiphase-multislice cardiac MRI data. The proposed system is based on a generalized 4D form of a fuzzy object extraction algorithm in order to distinguish voxels belonging to cardiac object from noisy points and surrounding tissues. The system is initialized by interactive selection of a pixel placed inside the cardiac muscle in a slice. In some cases, complementary information might be necessary for segmentation because of the similarity in grey level information between the heart and surrounding tissues. We applied an active contour model and a contour propagation technique to a variance image for a rough segmentation of epicardium. The fuzzy approach in combination with the use of a deformable model for isolation enables us to segment cardiac object without modifying voxel grey levels and preserving anatomical details. Fuzzy object extraction involves problems of enormous combinatorial complexity, but t his ca n be reduced by dynamic programming leading to practical algorithms for cardiac data sets. We have implemented these algorithms and tested their efficiency in preserving heart data during preprocessing. Different anatomical presentations of the heart have been used for this purpose, consisting of only a small number of slices per volume.
A New Global Consistent Checkpoint Based on OS Virtualization

Checkpoint can store and recovery applications when faults happen and is becoming critical to large information systems. Unfortunately, existing checkpoint tools have some limitations such as: not transparent to applications, ignoring file system states, cluster checkpoint is not well supported, and so on. We present a light weight OS virtualization based cluster checkpoint. Firstly, a virtual container, IPG (Isolated Process Group), is designed to wrap all target applications together and produce checkpoint transparently and completely. Secondly, each IPG has its independent namespace built on an exclusively owned LV (Logical Volume), which can be checkpointed synchronously with the IPG’s memory to guarantee the consistency. Finally, distributed applications can be deployed on many IPGs and a cluster checkpoint protocol is presented to orchestrate all IPGs to produce global checkpoints. Experiments and evaluations results illustrate that no overhead will be introduced for applications running in IPGs, and our prototype system works more stable than the traditional library base checkpoint tools.
Speeding Up Back-Propagation Neural Networks

There are many successful applications of Backpropagation (BP) for training multilayer neural networks. However, it has many shortcomings. Learning often takes long time to converge, and it may fall into local minima. One of the possible remedies to escape from local minima is by using a very small learning rate, which slows down the learning process. The proposed algorithm presented in this study used for training depends on a multilayer neural network with a very small learning rate, especially when using a large training set size. It can be applied in a generic manner for any network size that uses a backpropgation algorithm through an optical time (seen time). The paper describes the proposed algorithm, and how it can improve the performance of backpropagation (BP). The feasibility of proposed algorithm is shown through out number of experiments on different network architectures.
Crache perforée dans le Gravettien du sire (Mirefleurs, Puy-de-Dôme). Étude archéozoologique, technologique et fonctionnelle

Le gisement gravettien ancien du Sire a livre une unique crache de cerf utilisee comme objet de parure. L’analyse archeozoologique, technologique et traceologique de cette piece revele qu’il s’agit de la canine droite d’un cerf male âge d’environ dix ans. La couronne a ete modifiee par abrasion et la racine perforee par raclage et par rotation, avant d’etre partiellement sciee a la hauteur de la perforation et fracturee par flexion. L’usure de la perforation temoigne du port de l’objet etale dans le temps. Des traces de pigments s’observent sur l’ensemble de l’objet, y compris sur les surfaces de fracture. L’extreme rarete du Cerf dans la faune du gisement et le fait que la piece a ete conservee apres le sciage indiquent que les Gravettiens attribuaient une valeur certaine a cette crache. Une revue bibliographique des parures gravettiennes rapproche Le Sire des sites localises dans la zone meridionale de l’aire de distribution de ce technocomplexe.
Simulation et validation de la dynamique urbaine par automate cellulaire

Cet article, redige en 2008, presente les evolutions importantes la plateforme SpaCelle pour simuler l'evolution d'un espace a l'aide d'automate cellulaire. En particulier, la version 5 permet la structuration multi-couches des cellules pour gerer la dynamique de plusieurs variables definies sur un maillage. Elle permet aussi d'utiliser des cellules de type lineaires ou ponctuelles a travers des couches de type reseau. Les differentes couches ont leur propre dynamique et les regles peuvent faire interagir les couches entre elles. Ces fonctionnalites avancees ont permis de construire un nouveau modele sur l'evolution de l'agglomeration rouennaise plus proche de la realite terrain en utilisant trois couches, dont une de type reseau. Le modele a ete valide par des techniques de comparaison de cartes relativement recente mieux adaptees aux problematiques de la croissance urbaine.
Sharing Cloud Computing Resources

We address the issue of sharing the CPU and RAM resources of a cloud computing system. Specifically, we argue that these resources should be shared according to proportional fairness instead of dominant resource fairness. The latter has recently been proposed as a desirable scheduling objective mainly because of its strategy-proofness property. We show that proportional fairness, which satisfies a weaker form of strategy-proofness that we refer to as scale-invariance, yields a much better resource utilization and outperforms dominant resource fairness in the realistic setting where jobs arrive and leave at random times.
Detecting Spammers with SNARE: Spatio-temporal Network-level Automatic Reputation Engine

Users and network administrators need ways to filter email messages based primarily on the reputation of the sender. Unfortunately, conventional mechanisms for sender reputation--notably, IP blacklists--are cumbersome to maintain and evadable. This paper investigates ways to infer the reputation of an email sender based solely on network-level features, without looking at the contents of a message. First, we study first-order properties of network-level features that may help distinguish spammers from legitimate senders. We examine features that can be ascertained without ever looking at a packet's contents, such as the distance in IP space to other email senders or the geographic distance between sender and receiver. We derive features that are lightweight, since they do not require seeing a large amount of email from a single IP address and can be gleaned without looking at an email's contents--many such features are apparent from even a single packet. Second, we incorporate these features into a classification algorithm and evaluate the classifier's ability to automatically classify email senders as spammers or legitimate senders. We build an automated reputation engine, SNARE, based on these features using labeled data from a deployed commercial spam-filtering system. We demonstrate that SNARE can achieve comparable accuracy to existing static IP blacklists: about a 70%detection rate for less than a 0.3%false positive rate. Third, we show how SNARE can be integrated into existing blacklists, essentially as a first-pass filter.
Framework for Evaluation of Network-Based Intrusion Detection System

A framework was created which consists of three components: Attack Traffic, Background Traffic and Evaluation Metrics. The attack and background traffic component aims to meet the first criterion (realistic traffic) whilst the Evaluation Metrics component meets the third criterion. Finally, a graphical user interface was developed which wraps the three components together in order to achieve both ease of use and, more importantly, automation of testing. Using the framework, the evaluation was carried on the NIDS known as Snort. Snort was chosen due to it’s popularity and being freely avaliable.
Uso do corpo como interface: reconciliação entre imersão e interatividade em jogos de videogame

Este artigo visa investigar o uso do corpo como interface de comando na relacao entre interatividade e imersao em jogos narrativos de videogame. A principio o fato de o sistema exigir a participacao do jogador chamaria a atencao para a artificialidade da acao, quebrando, assim, o transe imersivo. Uma forma de permitir a coexistencia entre interatividade e imersao na mesma obra e utilizar o corpo do jogador como interface de comando. Por outro lado, pretende-se mostrar que mesmo consoles que nao utilizam movimentos isomorficos podem criar ambientes imersivos, pois a imersao e o sentimento de posse do corpo virtual dependem, dentre outros elementos, da transparencia da interface de comando, assim como de estimulos audiovisuais.
A lexical analyzer generator

Lex helps write programs whose control flow is directed by instances of regular expressions in the input stream. It is well suited for editor-script type transformations and for segmenting input in preparation for a parsing routine. Lex source is a table of regular expressions and corresponding program fragments. The table is translated to a program which reads an input stream, copying it to an output stream and partitioning the input into strings which match the given expressions. As each such string is recognized the corresponding program fragment is executed. The recognition of the expressions is performed by a deterministic finite automaton generated by Lex. The program fragments written by the user are executed in the order in which the corresponding regular expressions occur in the input stream. The lexical analysis programs written with Lex accept ambiguous specifications and choose the longest match possible at each input point. If necessary, substantial lookahead is performed on the input, but the input stream will be backed up to the end of the current partition, so that the user has general freedom to manipulate it. Lex can generate analyzers in either C or Ratfor, a language which can be translated automatically to portable Fortran. It is available on the PDP-11 UNIX, Honeywell GCOS, and IBM OS systems. This manual, however, will only discuss generating analyzers in C on the UNIX system, which is the only supported form of Lex under UNIX Version 7. Lex is designed to simplify interfacing with Yacc, for those with access to this compiler-compiler system.
Accreting x-ray pulsars. The high energy picture

El objetivo principal de esta tesis ha sido el estudio del comportamiento transitorio durante estallidos de distinto tipo, de una seleccion de pulsares acretores en rayos X, localizados en el plano galactico, Con ello se pretende haber avanzado hacia una explicacion mas clara de la naturaleza de estas objetos binarios de alta masa (con estrella de neutrones como objeto compacto), asi como de los mecanismos fisicos que operan en este escenario. Para todo esto se han analizado datos de dos misiones espaciales: INTEGRA Y RXTE. El segundo objetivo ha sido el estudio de la zona del brazo galactico de Scutum. Al ser esta una region de fuerte absorcion se cree de la existencia de sistemas del tipo anteriormente mencionado este todavia escondidos, y los cuales solo pueden ser descubiertos a altas energias. En esta tesis se han podido presentar resultados esperanzadores, con la deteccion de varios objetos posibles nuevos candidatos a pulsares acretores de rayos X.
Building and exhibition layout: SainsburyWing compared with Castelvecchio

It has always been thought that there are two dimensions in museum experience: the experience of space which can be distinguished from that of exhibits, as the former is largely non-discursive while the latter is more in the discursive domain. This paper aims to contribute to the description and understanding of the intricate pattern of interdependencies between the two parameters of the microstructure of the gallery space, the design of space and of the display layout. The paper uses rigorous methods of ‘spatial data’ collection and analysis (analytic representations of spatial relationships, and systematic representations of the movement pattern) and on this objective foundation builds an interpretative and critical argument.
Especificação e geração automática de navegadores para redes semânticas baseados emiInterfaces web

Resumo. Os Topic Maps sao um conjunto de standards que resultam da investigacao contemporânea numa nova area – “Web Semântica”. A premissa deste trabalho foi investigar a teoria subjacente a norma ISO/IEC 13250, mais conhecida por Topic Maps, e propor uma arquitectura aplicacional para o desenvolvimento de um navegador Web de Topic Maps, dinamicamente sustentado por um modelo relacional de dados e especialmente concebido para o armazenamento de documentos Xml Topic Maps (XTM), o standard mais difundido da familia. O estudo da norma, a apresentacao e discussao das questoes estruturais mais importantes, e a concepcao de uma framework de Topic Maps que alicerce o desenvolvimento de aplicacoes baseadas no paradigma, constituem simultaneamente o objectivo e o resultado final deste trabalho.
De Praktijkondersteuner Huisarts-Jeugd : Een verkennende studie

De POH-Jeugdfunctie is volop in ontwikkeling. In verschillende regio’s is en wordt ervaring opgedaan met deze functie. Het doel van dit onderzoek is om leemtes in de huidige kennis te vullen ten aanzien van de invulling, uitvoering en vormgeving van de POH-Jeugdfunctie.
An analytical model for the performance of concurrent B tree algorithms

A dictionary is an abstract data type supporting the actions search, insert, and delete. Search structures are data structure used to implement a dictionary, e.g. B trees, hash structures, grid files, etc. Many concurrent algorithms for search structures have been proposed, but relatively little work has addressed their performance. This paper proposes an analytic performance model for a range of concurrent algorithms on B+ trees. It uses this model to propose a high performance, simple-to-program variant of lockcoupling algorithms. The model actually consists of two mutually exclusive models: a ‘‘constant flow’’ model in which the throughput is assumed to remain at its average value; and a ‘‘bursty flow’’ model in which the throughput is predicted to oscillate with a certain frequency and amplitude based on the number of processes, the height of the tree, and the size of the nodes. We find that the data points from simulation fall between these two predictive models, tending towards the bursty flow one as the number of processors increases. Inasmuch as the analytical model characterizes B+ trees in terms of fanout, height, probability of restructuring, and node size, it does not depend on the details of B+ trees and so can be extended, at least in spirit, to other structures.
Load Awareness in FliX

The rapid growth of XML repositories over the past several years and using XML as a universal data exchange format between heterogeneous systems and in the World Wide Web, poses interesting challenges to database researchers, namely, managing and querying large collections of XML documents. While there are many proposals for path indexes on XML documents, none of them is perfectly suited for indexing large-scale collections of interlinked XML documents. FliX (Framework for indexing large collections of interlinked XML documents) [1] was developed to support an efficient incremental evaluation of descendants queries on large, heterogeneous, strongly linked document collections, using existing path indexing strategies as building blocks. By studying and analyzing the performance of the current implementation of this framework, this thesis aims to improve the query evaluation efficiency in FliX. To achieve this, a theoretic model for the cost of evaluating a collection of queries is built and used a long with statistical information to minimize the total cost of a given query load. FliX is extended by integrating a special-purpose load-aware caching unit into its current implementation. A complete implementation and evaluation of the extended version of FliX is provided.
Practical robust optimization techniques and improved inverse planning of HDR brachytherapy

We propose a new way to derive tractable robust counterparts of a linear program by using the theory of Beck and Ben-Tal (2009) on the duality between the robust (“pessimistic”) primal problem and its “optimistic” dual. First, we obtain a new convex reformulation of the dual problem of a robust linear program, and then show how to construct the primal robust solution from the dual optimal solution. Our result allows many new uncertainty regions to be considered. We give examples of tractable uncertainty regions that were previously intractable. The results are illustrated by solving a multi-item newsvendor problem. We also apply the new method to the globalized robust counterpart scheme and show its tractability. 2.
Onto4AR: a framework for mining association rules

Despite the efforts made on last decades to center the process of knowledge discovery on the user, the balance between the discovery of unknown and interesting patterns is far from being reached. The discovery of association rules is a paradigmatic case, where this balance is quite difficult to establish. In this paper, we propose a new framework for pattern mining – the Onto4AR. This framework is centered on the use of ontologies, for the representation and introduction of domain knowledge into the mining process. By defining constraints based on an ontology, the framework provides a mining environment independent of the problem domain. With this simplification on the definition and use of constraints, the framework contributes to reduce the gap between discovered rules and user expectations.