Miracle-dz/UniFAR-FTUs huggingface dataset:
Porting a TreeMap Library from AWT/Swing to SWT/JFace

Hierarchical structures are commonly used for storing data and information. Especially in computer science, the state of the art are still hierarchical file systems storing data in treelike containment structures having the two elements: files and folders. The increasing storage capacities and quantities of data make it more and more complex to keep track of where and data are stored, since the data structures grow both in depth and breath. E.g., finding with one look large, potentially unnecessary, files that could be deleted is not with the current graphical file system browsers like the Windows Explorer. It requires command-line tools or search dialogs to identify files in question, which are usually represented in list or tree form. Over the years, many visualisation techniques have been developed that can help people have a better overview about the hierarchical data. They allow seeing the single elements in context and proportion to the other elements in the hierarchy. One of the most prominent techniques for visualising hierarchical data are Treemaps which were first presented by Ben Shneiderman in 1991. In spite of VizzAnalyzer being a flexible tool for software analyzing, it still lacks a good overview about the containment hierarchy. Expanding it with a treemap visualisation technique will help in solving this problem. Since VizzAnalyzer is integrated into Eclipse as a plug-in, it is in our interest for treemap viewer to be implemented in SWT GUI so it can be integrated more easily into the VizzAnalyzer. This bachelor thesis examines the way of making the implementation of a treemap viewer integrable into the VizzAnalyzer.
Step skipping acceleration techniques on recursive logical circuits

This paper presents step skipping acceleration techniques for a class of convergence algorithms computing arithmetic functions. In particular, an extension of the fast adder carry-skip procedure [1, 2] is carried out for special purpose cellular array circuits implementing iterative logical functions for which some propagating information may be fruitfully computed ahead of the current step output computation. This information is thus carried to the next stage, accelerating the overall calculation. An application is given for the 2 ́s complement sign changing circuit, then for the step-skipping acceleration circuits used in the implementation of the ln(x) convergence algorithm. FPGA implementations on Xilinx Virtex IV [6] have been achieved with comparative analysis of 32to 512-bit computing algorithms.
10,000 Libraries, 4 Years: A Large-Scale Study of E-Book Usage and How You Can Use the Data to Move Forward

Michael Levine-Clark and Kari Paulson examine 2013 worldwide usage data for ebrary and E-book Library (EBL) covering hundreds of thousands of titles. They examine usage patterns across academic libraries globally and establish benchmarks useful to libraries and consortia for local planning. Sessions versus availability, the use of higher-quality e-books, broad disciplinary differences, performance relative to predicted use, and level of immersion are considered. Levine-Clark is in the process of analyzing ebrary and EBL data for a forthcoming white paper, and this presentation and associated discussion will inform the development of that study.
JavaFX in Action

HIGHLIGHT A clear, comprehensive tutorial that shows developers how to use JavaFX to build rich web and desktop applications that build on their investment in Java skills and tools, and interact smoothly with other Java applications. DESCRIPTION JavaFX is a Java-based rich user interface technology that sits atop the existing Java Standard and Micro Editions. Using it, developers can build rich user interfaces with access to all Java components already installed on their systems. At its heart is the easy to learn JavaFX Script language that lets developers describe what they want to accomplish in clear, declarative terms rather than abstract code. JavaFX also provides numerous libraries to make development extremely fast and efficient. JavaFX in Action is a hands-on tutorial that introduces and explores JavaFX through numerous bite-sized projects. The book provides a solid grounding in the JavaFX syntax and related APIs by showing web developers how to apply the key features of the JavaFX platform. Readers quickly absorb the fundamentals of the technology while exploring the possibilities JavaFX provides for creative, rich designs. Readers learn to transform variables and operators into bouncing raindrops, brilliant colors, and dancing interface components. They also learn how to interact with existing Java code to give old apps some new JavaFX sparkle. KEY POINTS * Includes techniques for desktop, web, and mobile development * Current to the latest release of JavaFX
ADIGMA - A European Initiative on the Development of Adaptive Higher-Order Variational Methods for Aerospace Applications : Results of a collaborative research project funded by the European Union, 2006-2009

The ADIGMA Project. - The ADIGMA Project. - Research Activities. - Exploiting Data Locality in the DGM Discretisation for Optimal Efficiency. - Very High-Order Accurate Discontinuous Galerkin Computation of Transonic Turbulent Flows on Aeronautical Configurations. - Incorporating a Discontinuous Galerkin Method into the Existing Vertex-Centered Edge-Based Finite Volume Solver Edge. - Explicit One-Step Discontinuous Galerkin Schemes for Unsteady Flow Simulations. - RKDG with WENO Type Limiters. - IPG Discretizations of the Compressible Navier-Stokes Equations. - Development of Discontinuous Galerkin Method for RANS Equations on Multibloc Hexahedral Meshes. - Construction of High-Order Non Upwind Distribution Schemes. - High Order Residual Distribution Schemes Based on Multidimensional Upwinding. - Higher-Order Stabilized Finite Elements in an Industrial Navier-Stokes Code. - A Third-Order Finite-Volume Residual-Based Scheme on Unstructured Grids. - Investigation of Issues Relating to Meshing for Higher-Order Discretizations. - Synthesis Report on Shock Capturing Strategies. - Implicit Strategy and Parallelization of a High Order Residual Distribution Scheme. - Hybrid Multigrid DG/FV Methods for Viscous Turbulent Flows. - Semi-implicit Time Discretization of the Discontinuous Galerkin Method for the Navier-Stokes Equations. - Multigrid Optimization for Space-Time Discontinuous Galerkin Discretizations of Advection Dominated Flows. - COOLFluiD - A Collaborative Simulation Environment for Research in Aerodynamics. - Robust and Efficient Implementation of Very High-Order Discontinuous Galerkin Methods in CFD. - Agglomeration Multigrid for the Vertex-Centered Dual Discontinuous Galerkin Method. - Higher-Order Aerodynamic Computations Using an Edge Based Finite Volume Scheme. - Dynamic Load Balancing for Parallelization of Adaptive Algorithms. - Error Estimation and Adaptive Mesh Refinement for Aerodynamic Flows. - Adjoint-Based Correction of Aerodynamic Coefficients on Structured Multiblock Grids. - Goal-Oriented Mesh Adaptation in an Industrial Stabilized Finite Element Navier-Stokes Code. - Application of Feature-Based Grid Adaptation to Helicopter Rotor Flow. - High-Order hp-Adaptive Discontinuous Galerkin Finite Element Methods for Compressible Fluid Flows. - Treatment of the Non-polygonal Boundary with the Aid of NURBS. - HP-Adaption in Space-Time within an Explicit Discontinuous Galerkin Framework. - Anisotropic Mesh Adaptation in the Presence of Complex Boundaries. - Industrial Assessment of Newly Developed Technologies. - Requirements and Assessment Methodology. - Verification and Assessment. - Conclusion and Recommendations. - Conclusions and Recommendations.
Video Watermarking Algorithms Using the SVD Transform

Video watermarking is relatively a new technology that has been proposed to solve the problem of illegal manipulation and distribution of digital video. It is the process of embedding copyright information in video bit streams. In this paper, we propose two effective, robust and imperceptible video watermarking algorithms. The two algorithms are based on the algebraic transform of Singular Value Decomposition (SVD). In the first algorithm, watermark bit information are embedded in the SVD-transformed video in a diagonal-wise fashion, and in the second algorithm bits are embedded in a blocks-wise fashion. The performance of the two proposed algorithms was evaluated with respect to imperceptibility, robustness and data payload. Both algorithms showed similar but high level of imperceptibility, however their performance varied with respect to robustness and payload. The diagonal-wise based algorithm achieved better robustness results, while the block-wise algorithm gave higher data payload rate.
Structured Modeling Language for Representing Active Template Libraries (Causal Modeling)

Abstract : In this report we give a high-level description of the computational approach for the Causal Modeler (CModeler) tool. The tool provides a capability for capturing the cause/effect constraints in a Special Operations plan and for reasoning tasks in support of plan execution. The input to the tool is a plan created by a human planner in a mixed initiative environment using custom graphical interface (a program called SOFTools TPE) and the output is a minimal directed acyclic graph (DAG) representing a parsimonious potential causality graph. The nodes of the DAG are the actions and the directed arcs represent potential causal links. The term "potential" emphasizes the uncertainty in the abduced links since no requirement is placed on the availability of domain theory. Our approach relies on the structural information only; namely the temporal ordering of the actions and the task hierarchy of the plan. We describe one main application of the tool for the Special Operations domain to support the task of run-time replanning. The replanning task takes the unexpected events in the execution of the plan (e.g., late or aborted actions) and uses the causal model to compute the impact on future actions and reconfigure the plan. We summarize at the end of the report our views of the lessons learned and give concluding remarks about future directions for developing this technology.
Self-localization in ubiquitous computing using sensor fusion

The widespread availability of small and inexpensive mobile computing devices and the desire to connect them at any time in any place has driven the need to develop an accurate means of self-localization. Devices that typically operate outdoors use GPS for localization. However, most mobile computing devices operate not only outdoors but indoors where GPS is typically unavailable. Therefore, other localization techniques must be used. Currently, there are several commercially available indoor localization systems. However, most of these systems rely on specialized hardware which must be installed in the mobile device as well as the building of operation. The deployment of this additional infrastructure may be unfeasible or costly. This work addresses the problem of indoor self-localization of mobile devices without the use of specialized infrastructure. We aim to leverage existing assets rather than deploy new infrastructure. The problem of self-localization utilizing single and dual sensor systems has been well studied. Typically, dual sensor systems are used when the limitations of a single sensor prevent it from functioning with the required level of performance and accuracy. A second sensor is often used to complement and improve the measurements of the first one. Sometimes it is better to use more than two sensors. In this work the use of three sensors with complementary characteristics was explored. The three sensor system that was developed included a positional sensor, an inertial sensor and a visual sensor. Positional information was obtained via radio localization. Acceleration information was obtained via an accelerometer and visual object identification was performed with a video camera. This system was selected as representative of typical
Subjective Evaluation of Perception of Delay Time between Visual Information and Tactile Information (Special Section of Letters Selected from the 1995 Society Conference of IEICE)

筆者らが検討している人工現実感を応用した臨場感 通信会議システム1)では,3次 元の仮想の協調作業空 間(CG技 術および立体映像表示装置などで生成され た3次 元モデル世界)を 用いて,遠 く離れた何人かの 設計者や参加者による高度な協調作業を可能とする環 境の実現を目指している. 例 えば,遠 隔地で形状デザ イナや人間工学の専門家が共通の部品データベースか ら必要な部品を検索し,変 形や移動等の操作を仮想空 間中で行い,同 じ視点,同 じ感覚で製品の設計をする ことができるようになる. こ のような人工現実感を応 用したシステムでは,視 覚,聴 覚,触 覚などの人間の 持つ複数の感覚を積極的に利用することにより,利 用 者である人間にとって現実以上に使い勝手の良いユー ザインタフェースの提供 も可能となる. そ の際,人 間 の各種の知覚特性を充分に把握しておくことが重要で ある. 本稿では,仮 想環境と実環境の融合した状況におい て仮想物体を操作する際に,力 フィードバック装置か ら受ける力感覚情報 と,表 示装置から受ける視覚情報 との問に時間の遅れがある場合を想定し,視 覚情報と 触覚情報の間の遅延知覚を主観評価実験により調べ た.
Novel Memetic Computing Structures for Continuous Optimisation

This thesis studies a class of optimisation algorithms, namely Memetic Computing Structures, and proposes a novel set of promising algorithms that move the first step towards an implementation for the automatic generation of optimisation algorithms for continuous domains. This thesis after a thorough review of local search algorithms and popular meta-heuristics, focuses on Memetic Computing in terms of algorithm structures and design philosophy. In particular, most of the design carried out during my doctoral studies is inspired by the lex parsimoniae, aka Ockham’s Razor. It has been shown how simple algorithms, when well implemented can outperform complex implementations. In order to achieve this aim, the design is always carried out by attempting to identify the role of each algorithmic component/operator. In this thesis, on the basis of this logic, a set of variants of a recently proposed algorithms are presented. Subsequently a novel memetic structure, namely Parallel Memetic Structure is proposed and tested against modern algorithms representing the state of the art in optimisation. Furthermore, an initial prototype of an automatic design platform is also included. This prototype performs an analysis on separability of the optimisation problem and, on the basis of the analysis results, designs some parts of the parallel structure. Promising results are included. Finally, an investigation of the correlation among the variables and problem dimensionality has been performed. An extremely interesting finding of this thesis work is that the degree of correlation among the variables decreases when the dimensionality increases. As a direct consequence of this fact, large scale problems are to some extent easier to handle than problems in low dimensionality since, due to the lack of correlation among the variables, they can effectively be tackled by an algorithm that performs moves along the axes.
Buy 'Til You Die - A Walkthrough

The BTYD package contains models to capture non-contractual purchasing behavior of customers—or, more simply, models that tell the story of people buying until they die (become inactinve as customers). The main models presented in the package are the Pareto/NBD model and the BG/BB models, which describe scenario of the firm not being able to observe the exact time at which a customer drops out. We will cover each in turn. If you are unfamiliar with these models, Fader et al. (2005) provides a description of the Pareto/NBD model and Fader et al. (2010) provides a description of the BG/BB model.
A Submodularity Framework for Data Subset Selection

Abstract : This report describes the outcome of the project A Submodularity Framework for Data Subset Selection. The goal of the project was to develop and evaluate novel submodular functions for the purpose of subselecting large sets of acoustic and text data. The subselected data sets were used to train acoustic models for automatic speech recognition or translation models for machine translation, respectively. The submodular selection techniques were evaluated against random data selection and the best comparable data selection technique previously reported in the literature. Our results demonstrate that submodular data selection outperforms all baseline techniques, i.e. for a fixed data subset size, submodular selection resulted in systems with better performance. Additionally, submodular selection was applied to the problem of feature selection, where it outperformed standard modular feature selection techniques.
Beyond Conventional Recognition: Concept of a Conversational System Utilizing Metaphor Misunderstanding as a Source of Humor

Although we are still quite far from constructing a human-like conversational system, researchers all over the world keep investigating numerous factors that make conversations between humans. In this work we focus on two such factors: humor and metaphors. Numerous research projects exist in the area of metaphor understanding and generation. We propose a unique approach to this subject, based on an observation that humans can not only properly understand and generate metaphors, but also make fun of their misunderstandings. For instance, an utterance “you have legs like a deer” can be understood as a compliment (“long and graceful”), as well as an insult (“very hairy”). If used properly, such misunderstanding can serve as source of humor in human-computer conversations. In this paper we first briefly describe our previous research on humor-equipped conversational systems. We then summarize the state of the art in the metaphor processing research, and mention works showing that the salience imbalance theory, widely use in the field of metaphor understanding, can be slightly modified to be used for explaining humor understanding. On this basis, we propose a research project aimed to construct a humorous metaphor misunderstandings generator, which will be implemented into a non-task oriented conversational system (chatterbot). The system, named HumMeR, takes as an input sentences possibly including metaphors. It will include procedures for processing known as well as novel metaphors, and, basing on salience imbalance degree changes, will try to find such common properties of source and target of metaphor that would allow to generate humorous misunderstandings. We describe the project’s development steps, algorithms and procedures of the HumMeR system, as well as the overall algorithm outline of the chatterbot in which the system will be implemented.
Optimistic Timed HW-SW Cosimulation

In this paper, we present a single processor timed cosimu-lation algorithm using optimistic simulation run. The algorithm optimistically estimates the time for synchronization between HW and SW simulators and runs simulation through the time point. If a simulator is found to run beyond the synchronization time point due to the optimistic estimation, it rolls back and re-executes the simulation. The proposed algorithm minimizes the overhead of synchronization at a negligible cost for rollback and re-execution. Experimental results show the eeciency of the proposed approach.
Distributed Mobile Device Based Shooter Detection Simulation

Abstract : In this report we develop a system for simulating shooter detection under varying system parameters and configurations. First, we discuss the mathematical details of the shooter detection problem. Next, we detail the simulation software that we developed to enable these analyses. We go on to study the performance of the system under various forms of error, including microphone localization error, inter-microphone clock synchronization error, and microphone count and configuration. Analysis is performed to determine, for many different configurations of these system variables, the ability to locate the shooter, as well as the accuracy of the computed location. Finally, we summarize the findings and make recommendations for future system design.
Automatic Domain Adaptation of Word Sense Disambiguation Based on Sublanguage Semantic Schemata Applied to Clinical Narrative.

Domain adaptation of natural language processing systems is challenging because it requires human expertise. While manual effort is effective in creating a high quality knowledge base, it is expensive and time consuming. Clinical text adds another layer of complexity to the task due to privacy and confidentiality restrictions that hinder the ability to share training corpora among different research groups. Semantic ambiguity is a major barrier for effective and accurate concept recognition by natural language processing systems. In my research I propose an automated domain adaptation method that utilizes sublanguage semantic schema for all-word word sense disambiguation of clinical narrative. According to the sublanguage theory developed by Zellig Harris, domain-specific language is characterized by a relatively small set of semantic classes that combine into a small number of sentence types. Previous research relied on manual analysis to create language models that could be used for more effective natural language processing. Building on previous semantic type disambiguation research, I propose a method of resolving semantic ambiguity utilizing automatically acquired semantic type disambiguation rules applied on clinical text ambiguously mapped to a standard set of concepts. This research aims to provide an automatic method to acquire Sublanguage Semantic Schema (S3) and apply this model to disambiguate terms that map to more than one concept with different semantic types. The research is conducted using unmodified MetaMap version 2009, a concept recognition system provided by the National Library of Medicine, applied on a large set of clinical text. The project includes creating and comparing models, which are based on unambiguous concept mappings found in seventeen clinical note types. The effectiveness of the final application was validated through a manual review of a subset of processed clinical notes using recall, precision and F-score metrics.
Student success on face-to-face instruction and MOOCs

There are fundamental differences between the face-to-face instruction model and that of Massive Open Online Courses. This paper hypothesises that despite these fundamental differences, the success factors in these learning contexts are comparable. The factors contributing to student success might be related to the same basic principles, even if manifesting themselves differently in each context - especially as the very definition of success is closely dependent on what can be measured.
The Actor Model

Abstract : The objective of the Actor Model project is to contribute to the science of large scale concurrent systems and the technology which is enabled by this science. This work is based on the Actor Model, a universal paradigm for concurrent computation in which primitive computational entities (actors) communicate by passing messages. The inherent concurrency, reconfigurability, and asynchronous nature of the actor paradigm make it ideally suited for modeling and constructing sophisticated large scale concurrent systems on general purpose concurrent computers. This actor paradigm can also be used as a foundation for study and implementing other diverse concurrency paradigms. The Actor Model project involves study of the Actor model, implementation of a prototype Actor language (Acore), and study of large scale experimental actor systems.