Miracle-dz/UniFAR-FTUs huggingface dataset:
Presenting the self in cyberspace: identity play in MOOS

The use of the Internet has increased exponentially over the last decade. Individuals across all continents are progressively engaging in cyberspace interactions at work, in education, and for leisure. These online interactions, unconstrained by the limitations of corporeal reality, offer the potential for unique presentations of the self. The general aim of the research described in this thesis was to examine self‐presentation in cyberspace. The research focused on MOOs, multi‐user, text‐based, user‐extensible online environments, as a likely site for identity experimentation and play in cyberspace. Two studies are described. In the first quantitative study, 75 university students logged on to the front page of a social MOO where they selected a screen name, chose their gender, and provided a character description. As hypothesised, self‐presentations were more likely to be based on actual identity rather than hoped for or feared selves. Contrary to expectation, little evidence was found of gender play. Self‐presentations were typically positively biased and results suggested that players also perceived themselves more positively in the online context. Although sex and age were generally unrelated to self‐presentation strategies, previous online experience, ethnicity, and personality profiles helped to explain self‐presentation behaviour. A qualitative study of a further 20 students in an educational MOO explored players’ understanding of their initial self‐presentational choices and their management of these self‐presentations over a 12‐week period. Findings from the second study were consistent with the results from the first quantitative study and confirmed a strong desire for authentic self‐ presentation. Despite this emphasis on authenticity, the intention to play with identity was manifest in the form of selective self‐disclosure, fantasy play, and exaggeration of traits. Participants also reported behaving in less inhibited
Teaching Technology: A How-To-Do-It Manual for Librarians. How-To-Do-It Manuals for Librarians.

Designing and developing successful technology training programs for our library's users is no small undertaking but we can learn a great deal from other's successes and failures. D. Scott Brandt has created Internet training courses at the libraries of MIT and Purdue University and he has monitored closely the efforts of many others teaching technology in the library world. Brandt clearly demonstrates how to gather and analyze information on user needs, articulate the vision and mission of your training, create an infrastructure of administrative workflow, construct individual training courses, measure your training's effectiveness, and make revisions along the way. This practical guide emphasizes teaching the use of the Internet and the Web, taking you step-by-step through various possible approaches to designing an overall program and developing individual courses. A special section highlights the different successful approaches various kinds and sizes of libraries have adopted to teach technology to users of all ages and backgrounds. Whether you have elements of a training program already in place at your library or you are starting from scratch, this book is filled with tried-and-true methods and solid advice.
Modelling Turbulence in Engineering and the Environment: Second-Moment Routes to Closure

Preface Nomenclature 1. Introduction 2. The exact equations 3. Characterization of stress and flux dynamics: elements required for modelling 4. Approaches to closure 5. Modelling the scale-determining equations 6. Modelling in the immediate wall vicinity and at low Ret 7. Simplified schemes 8. Wall functions References Index.
SUMMARIZING SEARCH RESULTS WITH AUTOMATICTABLES OF CONTENTS

Methods to help efficiently digest and use information have become an important research area in resolving information overload. While automatic text summarization research demonstrates significant efforts in this regard, the processes are complex and results have poorer quality than those created manually by experts. The generated summary tends to be rigid as the systems are designed for specific domains and applications. Our Automatic Table of Content Developer system, based on the Probability of Co-occurrence Analysis (POCA) technique, creates outputs that are content dependent, and yet the system can adapt to all document domains. We thus propose the resultant table-of-contents (TOC) display as an alternative to help users digest a large document collection using less time and effort.
Statistical analysis Techniques for Error Propagation in Large-Scale Missile Systems

Abstract : The statistical covariance technique is proposed as a computer analysis tool for missile systems error propagation studies. It is shown that on representative examples the statistical covariance technique performs better, based on speed and accuracy, than the traditional Monte Carlo approach of averaging a large number of random simulation runs. Although exact only for linear, time-varying systems, the covariance technique gives attractive approximate results for wide range of nonlinear missile systems. The extension to nonlinear systems utilizes incremental equations about the noise-free solution. Except in the extreme cases of very harsh nonlinearities and high input noise levels, the statistical covariance technique has been shown to yield, for the systems considered, results comparable to 1000 Monte Carlo runs.
POLENG–Adjusting a Rule-Based Polish–English Machine Translation System by Means of Corpus Analysis

POLENG is a transfer text-to-text Polish-English MT system. It operates on an electronic dictionary annotated for morphological, syntactic, and partly semantic information. The dictionary is based on the corpus of Polish texts from the domain of computer science. The local version of the system has the form of a two-window editor. The client-server version is available at http://poleng.wmid. amu.edu. pl/. The system is intended to deal with HTML Polish texts as well as cooperate with Microsoft Word. The detailed structure of the system is described in (Wypych 2000). In our short presentation we will concentrate on corpus-based methods we adopt in order to improve the efficiency of the translation.
Symulacyjna optymalizacja wyboru procedury klasyfikacyjnej dla danego typu danych – charakterystyka problemu

W literaturze przedmiotu w typowej procedurze klasyfikacyjnej wyodrebnia sie osiem etapow: 1) wybor obiektow do klasyfikacji; 2) wybor zmiennych charakteryzujących obiekty; 3) wybor formuly normalizacji wartości zmiennych; 4) wybor miary odleglości; 5) wybor metody klasyfikacji; 6) ustalenie liczby klas; 7) walidacja wynikow klasyfikacji; 8) opis (interpretacja) i profilowanie klas. Do newralgicznych zalicza sie etapy dotyczące wyboru formuly normalizacji wartości zmiennych, miary odleglości, metody klasyfikacji i ustalenia liczby klas, ktore mają w znacznej mierze arbitralny charakter. W artykule zaprezentowano szczegolową charakterystyke dziewieciu ścieŜek w symulacyjnej optymalizacji wyboru procedury klasyfikacyjnej dla danego typu danych, a wyodrebnionych w zaleŜności od typu skali pomiaru zmiennych. Liczba rozpatrywanych wariantow procedury klasyfikacyjnej zaleŜy od liczby formul normalizacyjnych, liczby typow miar odleglości i liczby
Similarity inheritance: a model of inheritance for declarative visual programming languages

We are interested in advancing the expressive power of visual programming languages (VPLs), especially those that are both declarative and responsive. By declarative we mean that programming is a matter of specifying the relationships among data in the program. (This is in contrast to languages in which data is changed directly or by sending messages to objects to modify their state.) By responsive, we mean that whenever any new piece of information enters the system-such as when the system computes new values or the programmer edits the program-the effects are immediately and automatically reflected in the displayed portion of the program''s results.
Ekonomiczne aspekty wdrożenia modelu cloud computing

W niniejszym artykule omowiono zagadnienia ekonomicznych aspektow implementacji modelu cloud computing. W pracy zaprezentowano definicje pojecia cloud computing oraz glowne cechy modelu w aspekcie perspektyw wykorzystania i funkcjonowania przedsiebiorstw po wdrozeniu rozwiązan opartych na chmurze obliczeniowej. Scharakteryzowano rowniez glowne modele uslugowe przetwarzania w chmurze z uwzglednieniem porownania tych rozwiązan z tradycyjnym modelem w aspekcie podzialu kontroli nad poszczegolnymi elementami infrastruktury informatycznej. Opisano rodzaje modeli wdrozeniowych idei przetwarzania danych w chmurze obliczeniowej. Autor dokonuje porownania tradycyjnego modelu zarządzania infrastrukturą IT z modelem cloud computing z uwzglednieniem poziomu wykorzystania zasobow IT w czasie w warunkach funkcjonowania na rynku. Bazując na zestawieniu dwoch modeli, autor analizuje ekonomiczne aspekty decyzji migracji systemow informatyczno-informacyjnych do chmury. Ekonomia cloud computing analizowana jest z perspektywy kosztow operacyjnych i inwestycyjnych. Ukazano korzyści finansowe wynikające ze zmiany kwalifikacji kosztow inwestycyjnych na operacyjne po zmianie systemu na cloudowy. Tekst odnosi sie takze do podstawowych wskaźnikow, ktore kwantyfikują efektywnośc ekonomiczną projektow, a takze prezentuje korzyści, jakie niesie ze sobą zmiana sposobu kwalifikowania uslug typu cloud w odniesieniu do wyniku finansowego przedsiebiorstwa. Opisano calkowity koszt posiadania aktywow IT, koszt alternatywny i czas wejścia przedsiebiorstwa na rynek z nową aplikacją lub produktem po implementacji przetwarzania w chmurze. Tekst charakteryzuje rowniez glowne ryzyka strategiczne i operacyjne wdrozenia koncepcji cloudowych. Slowa kluczowe: cloud computing, ekonomia chmury obliczeniowej, optymalizacja kosztow
Gruppo di ricerca coordinato da Marta Vigorelli

Il nostro gruppo di ricerca e nato nel 2001, nel contesto degli insegnamenti esterni all'Universita di Milano-Bicocca: “Valutazione dell’efficacia in psicoterapia” e “Interventi psicologici nel servizio pubblico”. Inizialmente era formato da me, Mariangela Villa e Riccardo Scognamiglio per quanto riguardava le ricerche sull’outcome in area clinica; da me, Valentina Stirone e Ilaria Peri per gli interventi nei centri di salute e nelle comunita terapeutiche. Le aree di ricerca che abbiamo approfondito in questi anni sono state: 1) La valutazione multi-strumentale del processo psicoterapeutico in “single cases”; 2) Alessitimia e psicosomatica: ricerca che ha portato allo sviluppo della scala di intelligenza emotiva (Scognamiglio, 2008, 2009); 3) Contributo alla validazione di nuove tecniche psicoterapeutiche, in particolare l’EMDR; 4) Monitoraggio del percorso clinico degli interventi nelle istituzioni (DSM e comunita terapeutica): ricerca che ha portato alla costruzione del Community Functioning Questionnaire, CFQ-28 (Vigorelli, Zanolini, Belfontali, Tatti, Buratti, & Peri, 2008).
Moving Objects Management: Models, Techniques and Applications

The continued advances in wireless communication and positioning technologies such as GPS have made new data management applications possible, such as location-based services (LBS) that store and manage the continuously changing positions of moving objects. "Moving Objects Management - Models, Techniques and Applications" focuses on moving objects management, from the location management perspective to the exploration of how the continually changing locations affect the traditional database and data mining technology. Specifically, the book describes the topics of moving objects modeling and location updating, indexing and querying, clustering, location uncertainty and privacy issues, as well as their application to intelligent transportation systems. This book is intended for developers of database management systems and mobile applications, research scientists and advanced-level students in computer science and geography. Dr. Xiaofeng Meng is a professor at the School of Information, Renmin University of China; Dr. Jidong Chen is a senior research scientist at EMC Research China, one of the research groups of the EMC Corporation.
Calipso: Omnidirectional camera calibration based on particle swarm optimization

In this paper we present a method for calibrating a catadioptric omnidirectional camera that is based on Particle Swarm Optimization (PSO). Like for other known approaches, only a few images, of a known calibration pattern, are required. First the projection model is shortly reviewed, and then it is shown that our proposed method can cope with the realistic noise acting during calibration. The experiments are presented in simulation, so that a comparison with ground truth is available, to characterize the performance of the method. 1 A short introduction Omnidirectional vision systems provide a 360 panoramic view about the optical axis, like traditional perspective ones, but with a much larger vertical field of view. A common approach is to obtain such result by means of the combination of a catoptric (mirror) and a dioptric (lenses) part. Such devices, called catadioptric omnidirectional cameras, play an important role in robotics, and can be divided in two categories, as defined in [2]. On one hand, we have the devices where the Single View Point (SVP) property holds, e.g., hyperbolic mirror under perspective projection. The SVP property, provided the projection parameters are known, allow the un-warping of the panoramic image to perspective one. On the other, we have non-SVP devices, where the designer degrees of freedom are much more, and more complex application requirements might be satisfied, at the price of dealing with a non perspective image. The calibration of the projection parameters of SVP catadioptric omnidirectional cameras have been the topic of relevant literature contributions, like [18], [15], [11], [16], [9], and [5]. Most notable, in our view, are [18] and [15] as the accompanying software toolboxes are available to the general public for use. In general the number of parameters and the choice of the initialization for the optimization required in the calibration of such cameras make the task difficult, citing from [15] “too many parameters make the equations difficult to minimize because of the numerous local minima, the need for a lot of data and the numerical instability introduced into the Jacobian”. The authors of this work approaches the problem by reducing the parameters, in particular leveraging on the assumption that the errors due to the assembly of the system are small, which we believe not being appropriate for most real systems. For instance, catadioptric lenses produced by VStone, a well established company in the field, are not Workshop Proceedings of SIMPAR 2008 Intl. Conf. on SIMULATION, MODELING and PROGRAMMING for AUTONOMOUS ROBOTS Venice(Italy) 2008 November,3-4 ISBN 978-88-95872-01-8 pp. 256-272
Contribution à l'ingénierie des jeux multijoueurs ubiquitaires

Les jeux multijoueur en mobilite (JMMs) permettent aux joueurs de s'adonner a leur activite ludique a tout endroit et a tout moment. Les jeux multijoueur ubiquitaires (JMUs), pour leur part, integrent les notions de mobilite, de contexte et de profil du joueur. Ainsi, le JMU represente une activite ludique contextualisee, personnalisee et unique au joueur, superposant un monde virtuel au monde reel. Les JMMs reposent sur l'informatique embarquee, l'informatique nomade et l'informatique distribuee, tandis que les JMUs y integrent l'informatique ubiquitaire. La complexite de developpement et de modelisation inherentes a ces deux types de jeux est particulierement elevee, plus encore en ce qui concerne le JMU. Cette these presente donc les problematiques scientifiques associees a ces deux domaines. Elle propose egalement des solutions architecturales de type intergiciel pour le support des JMMs et des JMUs, qui implantent et etendent les specifications de l'OMA GS : GASP Online, GASP Bluetooth et uGASP. De plus, un protocole de communication orientee objet a ete elabore specifiquement pour les environnements embarques tels que J2ME : MooDS. En outre, elle propose une classification des jeux multijoueur, un modele centre sur le joueur pour la definition des contextes du joueur au sein du JMU, ainsi qu'un modele evenementiel oriente contexte. UGASP introduit un ensemble de composants de services OSGi/iPOJO dedie s au JMU, supportant au sein de la session de jeu: la geolocalisation, la gestion des tags RFID, l'interfacage de dispositifs et le profil de joueur sur carte a puce NFC
Um Estudo Preliminar do Uso de Memória Persistente Através da Biblioteca Mnemosyne

The recent non-volatile memory technologies have caused a disruption in computational systems, making it possible to reduce the overhead related to data persistence. However, some precautions are required to ensure data consistency in occasional power outage or system failures. This paper presents a preliminary study of persistent memory usage through the sofware solution Mnemosyne, responsible for ensuring consistency through a transactional support. Resumo. As recentes tecnologias de memória não-volátil tem causado uma disrupção nos sistemas computacionais, possibilitando a redução do overhead associado a persistência de dados. Entretanto são necessárias algumas precauções para manter a consistência destes em eventuais quedas de energia ou falhas de sistema. Este trabalho apresenta um estudo preliminar do uso de memória persistente através da solução em software Mnemosyne, responsável por garantir a consistência através de um suporte transacional. 1. Introdução As emergentes tecnologias de memória não-volátil, conhecidas como Non-Volatile Memory (NVM), são caracterizadas pela durabilidade, endereçamento por byte, acesso via instruções de memória (read e write) e tempo de acesso semelhante à memória DRAM (Dynamic Random Access Memory). Tais caracterı́sticas possibilitam a organização da hierarquia de memória com uma memória principal hı́brida, constituı́da pela DRAM (volátil) e pela NVM (não-volátil), conectadas diretamente no barramento de memória. Porém a simples adição da NVM no barramento de memória não possibilita a extração do máximo potencial desta, pois apenas parte do overhead associado ao caminho crı́tico dos dados, como a serialização destes e a utilização de drivers para comunicação através do barramento de I/O, é removido. As camadas intermediárias presentes na pilha de software, como o sistema de arquivos e o Kernel, também adicionam overhead, e consequentemente deterioram o desempenho de aplicações com grande volume de atualizações em dados persistentes. O mapeamento de regiões de memória persistente no espaço de endereçamento dos processos possibilita eliminar essas camadas, tornando a persistência dos dados mais ágil, porém tal procedimento não garante a consistência destes em eventuais falhas de sistema ou quedas de energia. As inconsistências são originadas pelo fato de a memória cache, presente nos processadores contemporâneos, adotar a polı́tica de write-back, caracterizada por atualizar
Theory of Heat Equations for Sigma Functions

We consider the heat equations satisfied by the sigma function associated with a planar curve, extending and developing earlier pioneering work of Buchstaber and Leykin. These heat equations lead to useful {\em linear} recursive relations for the coefficients of power series expansion of the sigma function. In particular we exhibit explicit results for curves of genus 3, and give a new constructive proof of an explicit expression for the main matrix in the theory for {\em any} hyperelliptic curve. We also state and prove a new explicit formula for the eigenvalues of the linear operators associated with this matrix, as well as other practical formulae.
Research aspects of rapid prototyping

Finding effective and efficient methods for determining and validating the requirements for a software system is an important unsolved problem in software engineering. Prototyping is a promising approach for requirements validation. Current prototyping methods require an impractical amount of time and effort. The objective of the proposed research is to make automated rapid prototyping possible
Core Points - Variable and Reduced Parameterization for Symbol Recognition

Recent research in the field of on-line handwriting recognition has been focused on statistical systems such as Hidden Markov Models, Neural Networks or a combination of these. There are however merits of employing an approach based on template matching. The first part of this thesis presents a new strategy for parameterization of on-line handwritten character samples. A novel efficient template matching method enabled by this parameterization is also proposed. In consecutive chapters of the thesis it is also shown that the proposed structural parameterization enables an effective application of template matching methods to the recognition of cursive script. Ambiguity of the shapes of individual characters in unconstrained cursive handwriting necessitates dictionary interaction for real applications. A fast technique for applying dictionary information to the language independent graph approach has also been developed. A large data set of on-line cursive writing has been collected and the developed system for mixed and cursive on-line handwriting recognition has been shown to produce state of the art results on this data set. One of the obvious potential weaknesses of a structural parameterization technique such as the one presented in this thesis is its sensitivity to digital noise in the form of superfluous coordinates. Possible remedies to deal with such effects have also been studied. (Less)
Improvement of the Linear Predictive Coding with Windowed Autocorrelation

In this paper, we propose a new procedure for improvement of the linear predictive coding. To reduce the error power incurred by the coding, we interchanged the order of the two procedures of windowing on the signal and linear prediction. This scheme corresponds to LPC extraction with windowed autocorrelation. The proposed method requires more calculational time because it necessitates matrix inversion on more parameters than the conventional technique where an efficient Levinson-Durbin recursive procedure is applicable with smaller parameters. Experimental test over various speech phonemes showed, however, that our procedure yields about 5 % less power distortion compared to the conventional technique. Consequently, the proposed method in this paper is thought to be preferable to the conventional technique as far as the fidelity is concerned. In a separate study of speaker-dependent speech recognition test for 50 isolated words pronounced by 40 people, our approach yielded better performance too.