Miracle-dz/UniFAR-FTUs huggingface dataset:
Efficiency evaluation of external environments control using bio-signals

There are many types of bio-signals with various control application prospects. This dissertation regards possible application domain of electroencephalographic signal. The implementation of EEG signals, as a source of information used for control of external devices, became recently a growing concern in the scientific world. Application of electroencephalographic signals in Brain-Computer Interfaces (BCI) (variant of Human-Computer Interfaces (HCI)) as an implement, which enables direct and fast communication between the human brain and an external device, has become recently very popular. Currently available on the market, BCI solutions require complex signal processing methodology, which results in the need of an expensive equipment with high computing power. In this work, a study on using various types of EEG equipment in order to apply the most appropriate one was conducted. The analysis of EEG signals is very complex due to the presence of various internal and external artifacts. The signals are also sensitive to disturbances and non-stochastic, what makes the analysis a complicated task. The research was performed on customised (built by the author of this dissertation) equipment, on professional medical device and on Emotiv EPOC headset. This work concentrated on application of an inexpensive, easy to use, Emotiv EPOC headset as a tool for gaining EEG signals. The project also involved application of embedded system platform - TS-7260. That solution caused limits in choosing an appropriate signal processing method, as embedded platforms characterise with a little efficiency and low computing power. That aspect was the most challenging part of the whole work. Implementation of the embedded platform enables to extend the possible future application of the proposed BCI. It also gives more flexibility, as the platform is able to simulate various environments. The study did not involve the use of traditional statistical or complex signal processing methods. The novelty of the solution relied on implementation of the basic mathematical operations. The efficiency of this method was also presented in this dissertation. Another important aspect of the conducted study is that the research was carried out not only in a laboratory, but also in an environment reflecting real-life conditions. The results proved efficiency and suitability of the implementation of the proposed solution in real-life environments. The further study will focus on improvement of the signal-processing method and application of other bio-signals - in order to extend the possible applicability and ameliorate its effectiveness.
Signal detection theory as data analysis method and psychological decision model

Apparatus and method embodying a novel representation of a floating point number. The novel representation utilizes a computer word having two fields of fixed length one of which is subdivided into two fields of variable length, thereby effectively resulting in three fields. This novel representation allows a large trade-off to be made between accuracy and exponent range within the bounds of a single fixed-length data word.
Grammatically interpreted task analysis for supply chain forecasting

Traditional task analysis models have contributed to a more effective understanding of the tasks involved in different industries. As part of a broader study of interfaces for forecasting systems, we have used hierarchical task analysis to describe the normative process of producing sales forecasts. In order to validate this against reported scenarios and observations of actual use, we are applying an approach that uses a parallel to the grammar of everyday language to map tasks and sub-tasks to scenarios. In this paper we describe the technique and progress in applying this to observed tasks that users follow to produce forecasts in an organizational setting. We hope that the combination of grammar-based task analysis with interviews with users and software designers will enhance our understanding of sales forecasts.
Power-performance adaptation in Intel core i7

In this paper, we describe our experiences in building a framework for power/performance run-time management for the Intel core family. Our underlying methodology (in contrast to previous work which relied on empirical models) is based on a simple processor performance model in which frequency scaling is expressed as a change (in cycles) of the main memory latency. Based on this model and utilizing performance monitoring hardware, the proposed model is shown to be powerful enough to i) describe and explain how Intel processors are affected by frequency scaling with respect to workload behavior, ii) predict with reasonable accuracy the effect of frequency scaling (in terms of performance loss), and iii) predict the energy consumed by the core under different V/f combinations by directly measuring from the off-chip voltage regulator the power consumed by the core. Our long-term plans include integrating in the proposed framework various power-aware OS/application-driven DVFS policies. As a first step towards this direction, we show our experimental methodology to justify the power/performance measurements and verify the correctness of our framework in which any target DVFS policy can be embedded as kernel module.
Contributions to QoE management of live IP media.

Increased public access to broadband networks has led to a fast-growing demand for Voice and Video over IP (VVoIP) applications such as Internet telephony (VoIP), video conferencing, and IP television (IPTV). While the evaluation of Video (or Speech) communication systems has been an important field for both academia and industry for decades, the introduction of VVoIP systems has created a new set of issues that require new evaluation methods. Moreover, since we have moved to a unique network for multiple services, it has appeared that traditional QoS measures do not tell a sufficient story and the focus has moved to end user’s perceptual quality. Perceived video quality is affected by distortion caused by the encoder and the network impairments. The effect of these distortions depends on different video specifications such as video content, video resolutions, etc., but these parameters have not been widely used in existing perceptual video quality prediction and management models. The main goal of our research is the development of a control algorithm for perceptual video quality for online video streaming applications. This aim has led to five main contributions as follows: • Investigation and improvement of packet loss probability estimation methods; • Investigation and improvement of One Way Delay (OWD) estimation methods; • Investigation of effects of packet/frame loss on multimedia/video quality according to codec characteristics; • Accurate (subjective) measurement of the perceived quality of videos with different codec characteristics (Quantization parameter and frame-rate). • Investigation of different video bit rate-controlling mechanisms/models to manage the end user’s perceived quality and development of an algorithm to control the perceptual video quality for video conferencing applications
An unified framework for 3D fragmented object patching

Computer aided digital patching of the fragmented object has the great ad- vantages in efficiency, re-operation and avoiding of inadvertent damage, which is widely used in restoring and repairing of culture heritages. In this paper, we propose a uni�ed framework for 3D fragmented object patching, and the contributions lies in: 1) a uni�ed framework for 3D fragmented object patching consisting of 3D shape feature extraction, 3D surface region segmentation and 3D surface matching is proposed; 2) a novel geom- etry projection based 3D histogram model is proposed to extract the shape feature of 3D fragmented object robust to noise and sampling of 3D model; 3) a surface segmentation based on region dilation method is presented with the enough considering of the in uence of surface coarseness on 3D surface region segmentation instead of handling the debris with regular shape, at surface and few broken surfaces using the current algorithms; 4) a 3D surface matching based on height-map using 3D shape features directly instead of using curves of debris as match features as the current algorithms. The experiments are implemented on the simulation data and the real 3D scanning data of the fragmented object with a Roland LPX-250 3D laser scanner, and the results show that the proposed algorithm is feasible and effective.
A model of dia-logue moves and information state revision

Copies of reports and other material can also be accessed from the project's homepage, No part of this document m a y be reproduced or transmitted in any form, or by a n y means, electronic or mechanical, including photocopy, recording, or any information storage and retrieval system, without permission from the copyright o wner.
Data Mining and Automatic Quality Assurance of Survey Data

Data mining is an emerging field in the computer science world, which stands in between the fields of statistics, machine learning and pattern recognition. Classification is one of the main tasks of data mining and its ultimate goal is to describe or predict certain unknown data into predefined categories based on knowledge acquired on data of the same type beforehand. Programmatic quality checking of field survey data is difficult as it requires manual supervision to be able to identify and differentiate data trends. This paper attempts to explore the possibility to run various classifiers on field survey data and then use different techniques to build classification models to mimic manual supervision of data to programmatically check the quality of field survey data. The choice of the right classifiers and model testing techniques are of crucial importance for the whole process as the main purpose is to ensure high reliability of the predictive classification models that will be used to predict the category where new and previously unknown data pertains. Emphasis is placed on picking and utilizing the best classifiers as well as to test with several manners and combine them for a classification task in order to provide more accurate results than just using one single algorithm, which might suffer from structural problems.
Étude et optimisation de l'interaction processeurs-architectures reconfigurables dynamiquement

Les applications de telecommunications mobiles et de multimedia, notamment dans le domaine de l'embarque, deviennent de plus en plus complexes au niveau calculatoire et consomment de plus en plus d'energie. Afin de palier aux besoins calculatoires et energetiques de ces applications, les concepteurs se sont orientes vers les architectures hybrides, associant des systemes de nature et paradigme differents. Ces architectures ont retenu l'attention des concepteurs parce qu'elles presentent un bon compromis cout/performances calculatoires d'autant plus qu'elles possedent des proprietes energetiques interessantes. En outre, l'emergence dans la derniere decade des architectures reconfigurables dynamiquement associant haute performance et encore plus de flexibilite, a fait que les dernieres generations des architectures hybrides associent un ou plusieurs processeurs a une ou plusieurs architectures reconfigurables dynamiquement (ARD). Cette these s'inscrit dans cette thematique et a ainsi pour objectif d'apporter une modelisation precise de ces architectures ainsi que des methodologies permettant d'exploiter leurs potentiels de performances. Une modelisation des mecanismes d'echange d'informations entre un processeur couple a une ressource reconfigurable est d'abord proposee ce qui a permis une identification precise de modeles de performances. En utilisant ces modeles de performances, une methodologie d'adequation algorithme architecture permettant suivant les parametres de l'application de determiner le couplage CPU/ARD adequat est presentee. Nous introduisons ces modeles de performances dans le flot de developpement logiciel de ces architectures afin de permettre un partitionnement temporel automatique base sur la determination de la surface (en nombre d'unites fonctionnelles) de l'ARD necessaire pour avoir des performances optimales et ce en trouvant le facteur de deroulage de boucle qui assure le maximum de performances pour l'architecture hybride. Le dernier aspect de ce travail concerne la validation de ces methodologies et leur mise en oeuvre. Nous presentons pour cela les mecanismes d'implementation d'un demodulateur multimode DVB-T/H et d'un recepteur WCDMA dynamique sur une architecture hybride reconfigurable dynamiquement.
An analysis of the TUX web server

We report on a high-performance in-kernel web server for Linux known as the Threaded linUX http layer, or TUX, for short. TUX uses aggressive network layer data caching to accelerate static content delivery, and invokes CGI scripts directly from the kernel to accelerate dynamic content generation. We describe the TUX web server architecture, modifications included in the patch, and how they affect kernel operation and web server performance.
Counting liberties in Go capturing races

Applications of combinatorial game theory to Go have, so far, been focused on endgames and eyespace values, but CGT can be applied to any situation that involves counting. In this paper, we will show how CGT can be used to count liberties in Go semeai (capturing races). Our method of analyzing capturing races applies when there are either no shared liberties or only simple shared liberties. It uses combinatorial game values of external liberties to give an evaluation formula for the outcome of the capturing races.
Partial Formalizations And The Lemmings Game

The computer game Lemmings can serve as a new Drosophila for AI research connecting logical formalizations with information that is incompletely formalizable in practice. In this article we discuss the features of the Lemmings world that make it a challenge to both experimental and theoretical AI and present some steps toward formalizing the game using situation calculus. Preliminary versions of this paper lack important formulas and references to the literature on reactive AI and to computer vision. The formulas present are not yet integrated into a coherent whole. 1 ∗Work partly supported by ARPA (ONR) grant N00014-94-1-0775 and partly done while the author was Meyerhoff Visiting Professor at the Weizmann Institute of Science, Rehovot, Israel This document is reachable from the WWW page http://www-formal.stanford. edu/jmc/home.html.
Machine-translatability and post-editing effort: an empirical study using translog and choice network analysis

Studies on Controlled Language (CL) suggest that by removing features that are known to be problematic for MT (termed here “negative translatability indicators”, or “NTIs”), the MT output can be improved. It is assumed that an improvement in the output will result in lower post-editing effort. This study tests that assumption by measuring the technical, temporal and cognitive post-editing effort (Krings 2001) for English sentences in a user manual that have been translated into German using an MT system and that have been subsequently postedited by nine professional translators. The post-editing effort for sentences containing known NTIs is compared with the post-editing effort for sentences where all known NTIs have been removed In addition, relative post-editing effort (Krings 2001) - a comparison of post-editing effort and translation effort - is also measured. The methodologies employed include the keyboard monitoring tool, Translog, and Choice Network Analysis Results indicate that temporal and technical effort is greater for those sentences that contain known NTIs. Other findings are that some NTIs result in higher post-editing effort than others and that post-editing effort can also be expended for sentences where NTIs have been removed.
ROSA: Un Réseau de Recouvrement Adaptable, Auto-Organisant et Extensible

Les reseaux de recouvrement ont ete popularises avec l'expension des reseaux pair-a-pair (peer-to-peer networks) dans les annees 2000. Il existe de nombreux types de reseaux de recouvrement, certains sont extensibles d'autres non, certains ont pour role d'assurer une topologie resiliente, certain offre un service de routage fiable, etc. Mais aucun des reseaux de recouvrement n'est adaptables a differents types de reseaux recouvert et ne proposer un large eventail de services. Tout reseau de recouvrement existant est uniquement dedie a une tâche particuliere. On peut imaginer un reseau qui pourrait etre deploye a cheval sur de nombreux types differents de reseau et ne se consacrant pas seulement a une tâche particuliere. Cette these a pour objectif de definir les bases et de developper un tel reseau de recouvrement. Dans ces travaux de recherches, nous proposons un nouveau reseau de recouvrement appele ROSA. ROSA est concu de facon a pouvoir facilement etre adapte aux differents reseaux physiques et d'etre en mesure de fournir un large eventail de services differents. Les nœuds de ROSA sont organises en cluster appele grumeaux (lump) et ROSA peut etre considere comme un enchevetrement de grumeaux. Les nœuds organisent leurs ensembles de voisin en fonction des densites associees a ces grumeaux. ROSA est extensible car le nombre maximal de voisins qu'un noeud peut avoir est borne, et cette limite ne depend pas du nombre total de nœuds participant au reseau. ROSA est adaptable car la definition de la densite des grumeaux peuvent etre modifies et adaptes aux proprietes du reseau recouvert. La densite definit le comportement de ROSA
Project Proposal: Pointer Analysis 15-745: Optimizing Compilers Spring, 2005

In this project we plan to implement Andersen’s points-to-analysis [1] for the Pegasus IR. This is a flow and context insensitive analysis that is reported to be fast and scalable. It works by generating constraints which can be solved to obtain the points-to sets. BANSHEE [2] is a constraint solver that simplifies the task of building constraint-based program analyses. To use BANSHEE, the analysis designer provides a short specification file describing the kinds of constraints used in the analysis. From this specification, BANSHEE builds a customized constraint resolution engine which solves those constraints efficiently. An implementation of Andersen’s points-to analysis using BANSHEE as the constraint solver is reported to be very fast [3]. We plan to implement a similar analysis for Pegasus. If we get time we would like to experiment with other pointer analysis. In order to evaluate our implementation, we will identify a set of benchmarks and measure the performance in terms of time taken, memory requirements, accuracy of the points-to sets. We believe there is an existing pointer analysis implemented for Pegasus. We will compare our implementation against it also.
A multi-range vision strategy for autonomous offroad navigation

Vision-based navigation and obstacle detection must be sophisticated in order to perform well in complicated and diverse terrain, but that complexity comes at the expense of increased system latency between image capture and actuator signals. Increased latency, or a longer control loop, degrades the reactivity of the robot. We present a navigational framework that uses a self-supervised, learning-based obstacle detector without paying a price in latency and reactivity. A long-range obstacle detector uses online learning to accurately see paths and obstacles at ranges up to 30 meters, while a fast, short-range obstacle detector avoids obstacles at up to 5 meters. The learning-based long-range module is discussed in detail, and field experiments are described which demonstrate the success of the overall system.
Mechanical Design and Integration of a Tracking Fluoroscope System

The Tracking Fluoroscope System (TFS) – patent pending serial number 60/606,480 – is a robotic platform designed to follow a patient's natural, uninhibited walking motion and obtain full-range-of-motion x-ray videos of a patient's ankle, knee, or hip. The video data can be used to analyze dynamics within the human body and develop mathematical models of the joints. The TFS can also be used to study artificial implants under various conditions in order to design more effective versions. Similar systems could be used to aid surgeons in artificial implant procedures. Athletic motions could be analyzed to design more effective sports equipment or aid in rehabilitation. The objective of this thesis is to present the evolution of the mechanical design of the TFS, analyze different strategies for the fluoroscope system, discuss safety concerns, and present future design improvements. Anthropomorphic, geometric, speed, acceleration, inertial, electrical and budgetary constraints have all influenced the mechanical design of the TFS. These issues are presented in detail. The TFS weighs approximately 454 kg, can move at a maximum speed of 2.2 m/s, and operates in close proximity to humans. Therefore, many safety concerns are presented as well as suggestions for future design improvements and alternative applications.
The effects of age of acquisition in processing people's faces and names.

Word frequency and age of acquisition (AoA) influence word and object recognition and naming. High frequency and early acquired items are processed faster than low frequency and/or late acquired items. The high correlation between word frequency and AoA make these effects difficult to distinguish. However, this difficulty can be avoided by investigating the effects of AoA in the domain of recognising and naming famous faces and names. Face processing a suitable domain because the functional models of face processing were developed by analogy to word and object processing models. Nine experiments on the effects of AoA on face and name processing are reported. Experiment 1 investigated the influence of variables on naming famous faces. The variables were regressed on the speed and accuracy of face naming. Only familiarity and AoA significantly predicted successful naming. A factorial analysis and full replication revealed a consistent advantage for name production to early acquired celebrities' faces (Experiments 2 & 3). Furthermore this advantage was apparent from the first presentation (Experiment 4). Faster face and name recognition occured for early acquired than late acquired celebrities (Experiments 5 & 8). Early acquired names were read aloud faster than late acquired names (Experiment 7). Conversly semantic classifications were made faster to late acquired celebrities' faces (Experiment 6), but there was no effect in the same task to written names (Experiment 9). An effect of AoA for celebrities, whose names are acquired later in life than object names is problematic for the developmental account of AoA. Effects of AoA in recognition tasks are problematic for theorists who propose that speech output is the locus of AoA. A mechanism is proposed to account for the empirical findings. The data also presents a challenge for computer modelling to simulate the combined effects of AoA and cumulative frequency.