Miracle-dz/UniFAR-FTUs huggingface dataset:
The Potential and Limitations of Sentence Extraction for Summarization

Compositions of matter are provided comprising a stable, non-vaporous monomeric methylene base selected from a 2-methylenethiazoline; a 2-methylenebenzothiazoline; a 2-methylenenaphthothiazoline; a 2-methylenebenzoselenazoline; and a 2-methylenenaphthoselenazoline. The compositions of the invention are prepared by reacting the parent 2-methyl quaternary salt with a non-hydroxylic base which removes a proton of the heterocyclic salt together with a proton acceptor which inhibits build-up of the hydro salt of the non-hydroxylic base, the reaction being conducted under anhydrous conditions in a non-hydroxylic liquid in which the heterocyclic quaternary salt is sufficiently insoluble to inhibit dimer formation. The compositions of the invention are employed in the preparation of methine dyes.
The Leaf Path Projection View of Parse Trees: Exploring String Kernels for HPSG Parse Selection

We present a novel representation of parse trees as lists of paths ( leaf projection paths ) from leaves to the top level of the tree. This representation allows us to achieve signiﬁcantly higher accuracy in the task of HPSG parse selection than standard models, and makes the application of string kernels natural. We deﬁne tree kernels via string kernels on projection paths and explore their performance in the context of parse disambiguation. We apply SVM ranking models and achieve an exact sentence accuracy of 85.40% on the Redwoods corpus.
The development of real-time rendering for large-scale 3D virtual heritage

Today's computing technology has been able to create a complex 3D environment for the development of interactive graphical applications such as computer games and simulations. Geometric models in this 3D environment consist of thousands and even millions of polygons. This causes the graphics hardware system to experience difficulty rendering the entire model formed by a large number of polygons at a good interactive rate. Indirectly the cost of computation and processing time for each polygon for geometric objects also increases. The main goal of this research is to develop techniques to reduce the cost of computing for a large-scale Virtual Heritage System (SWM) environment. At the same time SWM can maintain the complexity of the 3D environment. This is intended to enable SWMs that are usually only feasible on high-performance computer systems in order to be implemented using lower-powered computer systems. Overall, this research has succeeded in generating new techniques for real-time display generation for SWM. These techniques are virtual environment management techniques, level-of-detail (LOD) techniques, culling portal techniques, and environmental detection techniques. The techniques produced are based on analysis of techniques for the optimization of memory space usage. The development of this project indirectly achieves the goal of overcoming the problem of computing costs and managing 3D objects in a complex virtual search system efficiently.
Context-aware and location systems

Computing systems are becoming increasingly mobile, with users interacting with many networked devices, both xed and portable, over the course of a day. This has lead to the emergence of a new paradigm of computing, the context-aware system. A user's context can be described as their relationship to computing devices, colleagues and the surrounding physical environment. Applications using such a system are made aware of changes in the physical and computing environment, and adjust themselves accordingly. For example, with knowledge of the locations of people and equipment, a suitable nearby display can be determined to deliver a message to a mobile user. Context-aware systems are currently ad-hoc in nature, typically developed around a particular technology and oriented towards supporting a particular type of application. Current location systems are similarly ad-hoc with no notion of abstraction above a particular locating technology. Furthermore, little analysis has been conducted into the application requirements of a location system. This general lack of systems design makes current approaches di cult to extend and generalise. This thesis proposes a systems architecture for the support of context-aware applications. It is asserted that such an architecture requires three main areas of capability. Firstly, a context-aware system needs to monitor the physical environment and make this information available in a uniform way. Secondly, location information requires higher-level management together with a representation of static parts of the physical domain. Further, support is required to enable complex, asynchronous monitoring of spatial areas. Thirdly, application support is required to access distributed sensor and location services, so facilitating the simple speci cation of context-aware scenarios.
Traffic Engineering & QoS Methods for IP-,ATM-,& TDMased Multiservice Networks

An isogrid structure having inset strips of composite materials at the top and bottom of the grid webs. A preferably flanged isogrid basically consists of I-beam members arranged in an integral repeating pattern of substantially equilateral triangles. One flange may be integral with a skin sheet covering the structure. At least some of these flanges are provided with grooves running parallel to the beam webs, filled with advanced composite materials comprising high-strength fibers in a supporting matrix. Preferably, the fibers run parallel to the beam webs. Preferred arrangements of the fibers are described.
Winning some of the document preprocessing challenges in a text mining process

Considering the huge growth of the number of documents in the digital universe and the possibility of obtaining some competitive advantage in processing them, this paper describes some of the difficulties of working with text collections. More specifically, it shows some of the challenges on the step considered one of the most important of the Text Mining process the data preprocessing focusing on two of its main tasks: attribute generation and selection, considering not only single terms but composed terms too. In order to overcome the challenges imposed by these problems, this paper presents efficient unsupervised solutions. The application of these solutions in three real data sets is presented in order to evaluate them and to show a way to treat the data step by step. Good results were obtained at the end of the whole process.
XExt3: The Design and Implementation of a Security Enhanced Ext3 File System

In this paper we develop an extended Ext3(XExt3) which means security enhanced file system. It can be used in generic Linux systems or trusted operating systems (TOS) as a file system. The XExt3 file system can protect data of a computer system from physical theft by encrypting them. We concentrate on balancing security, transparency and portability while minimizing computational overheads. For security and transparency, the XExt3 supports file protection, Linux group sharing, and the minimization of interactions between users and the system. In the aspect of performance, we minimize the overheads by implementing the proposed method on a native Ext3 file system in a Linux operating system. Finally we implement our system as a Linux kernel module for high portability. Our experimental results show that the XExt3 is about 3 or 4 times faster than previous cryptographic file systems.
The 2008 Visualization Design Contest: A Functional DSL for Multifield Data

1 OVERVIEW We report results for the 2008 design contest obtained using a novel approach to visualization development. Our ‘visualization system’ is implemented as a domain specific language (DSL) [1] embedded within the purely functional language Haskell. A DSL, or ‘little language’, provides a simple set of primitives, and combinators for gluing these elements into larger structures. In our case the primitives are simple visualization techniques such as isosurfacing, contouring, and probing, and the combinators allow us to assemble multi-variate visualizations both as static compositions and animations. As an example: Anim [Draw [ Slice mgreens (zslice 124 t Hp) , Contour mreds (Sampled 0 0.04 0.4) (zslice 124 t H2xD) ] | t <- [5,10.195] ] As the language is embedded, we can use Haskell’s rich expressiveness to exercise fine-grained control over display generation. For the contest, we augmented our Haskell visualization tools with a small utility to manage slicing, downsampling and derivation of data from the contest files. A further small DSL describes the desired slice; a high-level planner (written in Haskell) then decides the cheapest way to generate that slice from other slices already in existence; the actual work of slicing, downsampling, and derivation is performed by a small fast loop written in C. We implemented exploration via a two-stage process. Once we had determined the variables, time slices and resolutions to be inspected, we first used the downsampling utility to generate the required files. These were then used to synthesise images and animations expressed within the DSL. From the outset, we were concerned with the wide range of values found in the data, and implications for numerical accuracy once we started to derive new values by calculation. We implemented a Haskell library to provide fixed-precision arithmetic, and subjected this to thorough testing using the SmallCheck test case generator [2]. A C version of the library was also implemented, with the Haskell code providing a reference implementation for testing. This attention to the details of numerical computation extended to us identifying a flaw in the code for curl computation distributed via the contest web site. Our entire system is remarkably compact, consisting of 620 lines of C code (the downsampler, and the C implementation of fixedprecision arithmetic), and i 4K lines of Haskell. The latter includes the downsampling planner, the implementation of the visualization DSL, a module for rendering and mouse-based interaction, and code for visualization techniques including generic 3D isosurfacing, pseudovolume rendering, 2D contour mapping, probing and slicing, and two versions of a 3D scatterplot. Finally, our entry demonstrates that progress can be made with modest human and machine resources; much of the experimental work
Recent Functionality Improvements to the T 3 Speech Decoder

Thefundamentalgoalsofthecoreenginearespeed,per-formance and resource usage. Recently we have focu-sed on portability and platform support. Developing ahighly scalable single code base which can make use ofwiderangeofhardwareisasignicantchallenge,inpar-ticular the engine should be able to scale up and downwith the target hardware. The recent efforts to realizethis aim are as follows: TosupportGraphicsProcessingUnits(GPUs)andparallel processors from multiple vendors. Alayered approach has been added to allow dif-ferent device specic Application ProgrammingInterfaces (APIs) to be evaluated more easily.  For the PowerPC and other big endian processorsthe byte ordering is automatically handled inter-nally to allow binary compatibility with the stan-dard x86 byte ordered models.  The decoder has been compiled and tested onUnix, Windows and MacOS platforms and onx86, AMD64, PowerPC and ARM (via an emu-lator) processors.2. 1 Layered Acoustic ScoringA unied abstraction layer has been implemented to en-capsulate the GPGPU scheme we proposed in [4]. Un-derneath this layer various device layers are used to per-form the actual computation. The motivation is to allowfor different device layers to be implemented around thevarious GPUs and data parallel APIs such as OpenCLor DirectX compute shaders. Device layers are not justrestricted to GPUs, alternatively they could be the Sy-nergistic Processing Units (SPUs) on the Cell processor,a conventional multicore processor or a totally differentclassofadevicesuchasaFieldProgrammableGateAr-ray (FPGA). The abstraction layer provides the high level inter-faces needed by the decoder to create the matrices ofacoustic parameters and launch the transfers or compu-tations. A Synchronization barrier is also available toallow the acoustic computations to be performed in anasynchronous fashion. In this overlapped mode the up-coming acoustic scores are computed whilst the searchalgorithm operates on the current window of acousticscores.2. 2 High-level APIPreviously there were two levels at which to interactwith the T
Social research methods

PART ONE: SOCIAL RESEARCH METHODS Introduction to Your Companion PART TWO: CORE AREAS OF THE CURRICULUM Theoretical Background Research Basics Research Strategies and Design The Nature of Data Defining the Research Problem Sampling Data Collection Methods Experimental Design Quantitative Data Analysis Qualitative Data Analysis Ethics PART THREE: STUDY AND REVISION SKILLS How To Get the Most Out of Your Lectures - (written in collaboration with David McIlroy) How To Make the Most of Seminars Revision Hints and Tips Exam Tips Tips on Interpreting Essay and Exam Questions Essay Writing Writing a Literature Review Writing a Research Proposal Writing Up a Dissertation or Research Project
JLP: A linear programming package for management planning.

JLP is a linear programming software package designed for management planning systems that generate several treatment schedules for management units and select optimal schedule combinations with linear programming. Constraints can be specified to domains, i.e., subsets of management units. The optimization algorithm is based on the generalized upper bound technique. The optimization algorithm can be accessed through a flexible command interface that includes data transformations. The program is written in portable FORTRAN 77, and it is currently running in Macintosh, VMS, UNIX, and OS/2 environments. User defined data input, transformations, report writer and interface routines can be linked to the program. The report includes i) a user's guide for the built-in interface, ii) a guide for installing the program into user's system, and iii) description of the mathematical basis of the optimization algorithm.
Module System Architect Toolkit

This module addresses tools and techniques available to the System Architect. It explains the basic CAFCR method and addresses story telling as method. Distribution This article or presentation is written as part of the Gaudi project. The Gaudi project philosophy is to improve by obtaining frequent feedback. Frequent feedback is pursued by an open creation process. This document is published as intermediate or nearly mature version to get feedback. Further distribution is allowed as long as the document remains complete and unchanged. September 25, 2014 status: concept version: 1.4 Basic Working Methods of a System Architect by Gerrit Muller Buskerud University College e-mail: gaudisite@gmail.com www.gaudisite. nl Abstract The challenge for the architect is to cover a wide range of subjects, with many unknowns and uncertainties, while decisions are required all the time. The basic working methods, such as viewpoint hopping, modelling, handling uncertainties and WWHWWW questions are described.The challenge for the architect is to cover a wide range of subjects, with many unknowns and uncertainties, while decisions are required all the time. The basic working methods, such as viewpoint hopping, modelling, handling uncertainties and WWHWWW questions are described. Distribution This article or presentation is written as part of the Gaudi project. The Gaudi project philosophy is to improve by obtaining frequent feedback. Frequent feedback is pursued by an open creation process. This document is published as intermediate or nearly mature version to get feedback. Further distribution is allowed as long as the document remains complete and unchanged. September 25, 2014 status: concept version: 1.5 tprocessing= toverhead+ nrows* trow+ nrow* ncol* tpixel formal analytical model Req Ack Strobe synchronization model position control actual position required position (time) feedback frequency: 4 kHz (0.25 msec) feedback model model of coordinate system semiconductor supplier box-maker consumer retailer service provider content provider value chain model
Sierra/solid mechanics 4.22 user's guide.

Sierra/SolidMechanics (Sierra/SM) is a Lagrangian, three-dimensional code for the analysis of solids and structures. It provides capabilities for explicit dynamic and implicit quasistatic and dynamic analyses. The explicit dynamics capabilities allow for the efficient and robust solution of models subjected to large, suddenly applied loads. For implicit problems, Sierra/SM uses a multi-level iterative solver, which enables it to effectively solve problems with large deformations, nonlinear material behavior, and contact. Sierra/SM has a versatile library of continuum and structural elements, and an extensive library of material models. The code is written for parallel computing environments, and it allows for scalable solutions of very large problems for both implicit and explicit analyses. It is built on the SIERRA Framework, which allows for coupling with other SIERRA mechanics codes. This document describes the functionality and input structure for Sierra/SM.
Detecting the trend component for selected network parameters

The goal of the project is the analysis of a communication network based on real data obtained by Network Management Control supervisory center and set up a useful tool for effective solving of network modernization problems. The data has been collected continuously since 2005. With regard to the nature and amount of the data, data mining methods were selected for the purpose of analyses and experiments. The aim of the paper is to identify the role of long-term trends in the monitored network parameters. Knowledge of the trend will allow us more precise predictions of the future network traffic and also help us better determine the dimensioning of the network to both the future projected growth in volume of transmitted information, and in time the increased of demands in the network, caused by irregular activities of network users
Long Range Automated Persistent Surveillance

Acknowledgement First and foremost, I am deeply indebted to my parents, Zhongqing Jin and Qi Yao, who have always encouraged me to pursue higher education. To my husband, Yanzhen Li, who has always supported me during this journey. To my sister, Lan Jin, and her family for their love. I would like to thank my advisor, Dr. Mongi Abidi, who has made me who I am and who I will be in my professional career. His willingness to support my work and his guidance throughout my studies has allowed me to develop my abilities to think through the problems and skills to find the answers. I thank him for that opportunity. Special thanks indeed go to Dr. Besma Abidi, whose regular technical comments provided me valuable guidance throughout my research. Also, I would like to thank Dr. Paul Crilly, Dr. Hairong Qi, and Dr. Hamparsum Bozdogan. Their advice and counsel have been of equal importance. I greatly appreciate their time and input to this dissertation. Within the IRIS group, to Dr. David Page and Dr. Andreas Koschan I express my sincerest gratitude for the opportunity and many conversations that have had tremendous impacts on my research. I owe many thanks to my fellow graduate students, Abstract This dissertation addresses long range automated persistent surveillance with focus on three topics: sensor planning, size preserving tracking, and high magnification imaging. For an automated and persistent surveillance, a sufficient overlap of the camera's field of view should be reserved so that camera handoff can be executed successfully before the object of interest becomes unidentifiable or untraceable. We design a sensor planning algorithm that not only maximizes coverage but also ensures uniform and sufficient overlapped camera's field of view for an optimal handoff success rate. This algorithm works for environments with multiple dynamic targets using different types of cameras. Significantly improved handoff success rates are illustrated via experiments using floor plans of various scales. Size preserving tracking automatically adjusts the camera's zoom for a consistent view of the object of interest. Target scale estimation is carried out based on the paraperspective projection model which compensates for the center offset and considers system latency and tracking errors. A computationally efficient foreground segmentation strategy, 3D affine shapes, is proposed. The 3D affine shapes feature direct and real-time implementation and improved flexibility in accommodating the target's 3D motion, including off-plane rotations. The effectiveness of the scale estimation …
Multi-Modal sensory Fusion with Application to Audio-Visual Speech Recognition

Abstract : In this work we consider the bimodal fusion problem in audio-visual speech recognition. A novel sensory fission architecture based on the coupled hidden Markov models (CHMMs) is presented. CHMMs are directed graphical models of stochastic processes and are a special type of dynamic Bayesian networks. The proposed fusion architecture allows us to address the statistical modeling and the fission of audio-visual speech in a unified framework. Furthermore, the architecture is capable of capturing the asynchronous and temporal inter-modal dependencies between the two information channels. We describe a model transformation strategy to facilitate inference and learning in CHMMs. Results from audio-visual speech recognition experiments confirmed the superior capability of the proposed fusion architecture.
CLUTO - A Clustering Toolkit

Abstract : Clustering algorithms divide data into meaningful or useful groups, called clusters, such that the intra-cluster similarity is maximized and the inter-cluster similarity is minimized. These discovered clusters can be used to explain the characteristics of the underlying data distribution and thus serve as the foundation for various data mining and analysis techniques. The applications of clustering include characterization of different customer groups based upon purchasing patterns, categorization of documents on the World Wide Web, grouping of genes and proteins that have similar functionality, grouping of spatial locations prone to earth quakes from seismological data, etc. CLUTO is a software package for clustering low and high dimensional datasets and for analyzing the characteristics of the various clusters.