Miracle-dz/UniFAR-FTUs huggingface dataset:
Principles of Flight Simulation

About the Author. Preface . Glossary . 1 Introduction . 1.1 Historical Perspective. 1.2 The Case for Simulation. 1.3 The Changing Role of Simulation. 1.4 The Organization of a Flight Simulator. 1.5 The Concept of Real-time Simulation. 1.6 Pilot Cues. 1.7 Training versus Simulation. 1.8 Examples of Simulation. References. 2 Principles of Modelling . 2.1 Modelling Concepts. 2.2 Newtonian Mechanics. 2.3 Axes Systems. 2.4 Differential Equations. 2.5 Numerical Integration. 2.6 Real-time Computing. 2.7 Data Acquisition. 2.8 Flight Data. 2.9 Interpolation. 2.10 Distributed Systems. 2.11 A Real-time Protocol. 2.12 Problems in Modelling. References. 3 Aircraft Dynamics . 3.1 Principles of Flight Modelling. 3.2 The Atmosphere. 3.3 Forces. 3.4 Moments. 3.5 Axes Systems. 3.6 Quaternions. 3.7 Equations of Motion. 3.8 Propulsion. 3.9 The Landing Gear. 3.10 The Equations Collected. 3.11 The Equations Revisited - Long Range Navigation. References. 4 Simulation of Flight Control Systems . 4.1 The Laplace Transform. 4.2 Simulation of Transfer Functions. 4.3 PID Control Systems. 4.4 Trimming. 4.5 Aircraft Flight Control Systems. 4.6 The Turn Coordinator and the Yaw Damper. 4.7 The Auto-throttle. 4.8 Vertical Speed Management. 4.9 Altitude Hold. 4.10 Heading Hold. 4.11 Localizer Tracking. 4.12 Auto-land Systems. 4.13 Flight Management Systems. References. 5 Aircraft Displays . 5.1 Principles of Display Systems. 5.2 Line Drawing. 5.3 Character Generation. 5.4 D Graphics Operations. 5.5 Textures. 5.6 OpenGL (R) . 5.7 Simulation of Aircraft Instruments. 5.8 Simulation of EFIS Displays. 5.9 Head-up Displays. References. 6 Simulation of Aircraft Navigation Systems . 6.1 Principles of Navigation. 6.2 Navigation Computations. 6.3 Map Projections. 6.4 Primary Flight Information. 6.5 Automatic Direction Finding (ADF). 6.6 VHF Omnidirectional Range (VOR). 6.7 Distance Measuring Equipment (DME). 6.8 Instrument Landing Systems (ILS). 6.9 The Flight Director. 6.10 Inertial Navigation Systems. 6.11 Global Positioning Systems. References. Further Reading. 7 Model Validation . 7.1 Simulator Qualification and Approval. 7.2 Model Validation Methods. 7.3 Latency. 7.4 Performance Analysis. 7.5 Longitudinal Dynamics. 7.6 Lateral Dynamics. 7.7 Model Validation in Perspective. References. 8 Visual Systems . 8.1 Background. 8.2 The Visual System Pipeline. 8.3 3D Graphics Operations. 8.4 Real-time Image Generation. 8.5 Visual Database Management. 8.6 Projection Systems. 8.7 Problems in Visual Systems. References. 9 The Instructor Station . 9.1 Education, Training and Instruction. 9.2 Part-task Training and Computer-based Training. 9.3 The Role of the Instructor. 9.4 Designing the User Interface. 9.5 Real-time Interaction. 9.6 Map Displays. 9.7 Flight Data Recording. 9.8 Scripting. References. 10 Motion Systems . 10.1 Motion or No Motion? 10.2 Physiological Aspects of Motion. 10.3 Actuator Configurations. 10.4 Equations of Motion. 10.5 Implementation of a Motion System. 10.6 Hydraulic Actuation. 10.7 Modelling Hydraulic Actuators. 10.8 Limitations of Motion Systems. 10.9 Future Motion Systems. References. Index.
Optimizing Planar and 2-Planar Parsers with MaltOptimizer

alisis sint actico de dependencias, MaltOptimizer, MaltParser, Planar y 2-Planar Abstract: MaltOptimizer is a tool that is capable of nding an optimal congura- tion for MaltParser models, taking into account that nowadays dependency parsers require careful tuning in order to obtain state-of-the-art results, and this tuning is normally based on specialized knowledge. The Planar and 2-Planar parsers are two dierent parsing algorithms included in MaltParser. In the present paper, we show how these two parsers can be included in MaltOptimizer processes comparing them with the rest of MaltParser algorithm families, and how we can dene a deep feature search and selection by using MaltOptimizer for these two algorithms. The experiments show that by using MaltOptimizer we can improve parsing accuracy for Planar and 2-Planar parsers by up to 8 percent absolute (labeled attachment score) compared to default settings. Keywords: Dependency parsing, MaltOptimizer, MaltParser, Planar and 2-Planar
Program Sequence by Ability Interaction in Learning a Hierarchical Task by Computer-Assisted Instruction.

Abstract : The sequence of instruction in a fixed set of highly controlled learning materials was investigated. Computer-assisted instruction (CAI) was used to administer the instructional materials and to collect the data. The role of some cognitive ability variables was also investigated. A survey of the literature showed that there were several ways of analyzing the task to determine its structure. This analysis then should prescribe the sequence of instruction. In general, it was found that a disordering or scrambling of this analyzed sequence made little difference on the student's performance. The methods for analyzing the task did not always yield the same sequence, depending upon who performed the analysis. The rationale for an information processing task analysis was outlined to overcome the shortcomings of the other analytic methods. The new method appeared to have good reliability of sequence determination (i.e., different persons derived the same sequence using this method). Several studies have indicated that students can effectively sequence the learning task for themselves. In order to determine how their selected sequences affected their performance, it was necessary to quantify their different sequences. An index for quantifying the degree of conformity to the information processing sequence was developed. This index was called the hierarchical sequence conformity index.
Large-scale DFT Calculations with the CONQUEST Code

We show our recent theoretical studies using our linear‐scaling DFT code CONQUEST. The code is efficient on massively parallel computers and has an ability to treat the systems containing more than ten thousands of atoms. We overview our recent studies on DNA systems and nano‐structured Ge 3D islands on Si(001). For the latter system, we have succeeded in employing DFT structure optimization on the systems containing more than 20,000 atoms.
Performance analysis and improvement of PostgreSQL

PostgreSQL is a database management system, used in many different applications throughout the industry. As databases often are the bottlenecks in the performance of applications, their performance becomes crucial. Better performance can either be achieved by using more and faster hardware, or by making the software more efficient. In this master thesis we do a performance analysis of the PostgreSQL database server from the perspective of compiler optimizations, file systems and software prefetching. We will also show how a data structure used in PostgreSQL can benefit from manually introducing software prefetching, as it is hard for the compiler to predict cache misses and insert prefetching instructions in a profitable way.
Anthropometry for Computer Graphics Human Figures

Anthropometry as it applies to Computer Graphics is examined in this report which documents the Anthropometry work done in the Computer Graphics Research Laboratory at the University of Pennsylvania from 1986 to 1988. A detailed description of the basis for this work is given along with examples of the variability of computer graphics human figures resulting from this work. Also discussed is the unique and versatile user interface developed to allow easy manipulation of the data used to describe the anthropometric parameters required to define human figure models. The many appendices contain the specifics of our models as well as much of the data used to define the models. Comments University of Pennsylvania Department of Computer and Information Science Technical Report No. MSCIS-89-71. Author(s) Marc R. Grosso, Richard D. Quach, Ernest Otani, Jianmin Zhao, Susanna Wei, Pei-Hwa Ho, Jiahe Lu, and Norman I. Badler This technical report is available at ScholarlyCommons: http://repository.upenn. edu/hms/67 ANTHROPOMETRY FOR COMPUTER GRAPHICS
Improving energy and performance of data cache architectures by exploiting memory reference characteristics

Minimizing power, increasing performance, and delivering effective memory bandwidth are today's primary microprocessor design goals for the embedded, high-end and multimedia workstation markets. In this dissertation, I will discuss three major data cache architecture design optimization techniques, each of which exploits the data memory reference characteristics of the applications written in high-level languages. Through a better understanding of the memory reference behavior, we can design a system that executes at higher performance, while consuming less energy, and delivering more effective memory bandwidth. The first part of this dissertation presents an in-depth characterization of data memory references, including analysis of semantic region accesses and behavior of data stores. This analysis leads to a new organization of the data cache hierarchy called Region-based Cachelets. Region-based Cachelets are capable of improving memory performance of embedded applications while significantly reducing dynamic energy consumption, resulting in a 50% to 70% improvement in energy-delay product efficiency using this approach. Following this, I will discuss a new cache-like structure, the Stack Value File (or SVF), which boosts performance of general purpose applications by routing stack data references to a separate storage structure optimized for the unique characteristics of the stack reference substream. By utilizing a custom structure for stack references, we are able to increase memory level parallelism, reduce memory latency, and reduce off-chip memory activity. The performance can be improved by 24% by implementing an 8KB SVF for a processor with a dual-ported L1 cache. Finally, I will address memory bandwidth issues by proposing a new write policy called Eager Writeback which can effectively improve overall system performance by shifting the writings of dirty cache lines from on-demand to times when the memory bus is less congested. It lessens the criticality of on-demand misses and improves performance by 6% to 16% for the 3D graphics geometry pipeline.
Information Processing Based Thermal Error Modelling for A Machine Tool

A novel concept of thermal error modes analysis is proposed to develop a better understanding of the thermal deformation on a machine tool. The basic thermal error modes for a structural element are the thermal expansion and bending mode. The selection of thermal error sensors location can be improved based on the thermal error modes analysis with finite element method for reference. With thermal error information processing based optimal partition method and stepwise regression, key temperature variables are identified, the number of thermal sensors has been reduced from 16 to 3. The thermal error model has been applied to a machine for verification, and the results show the thermal error model is satisfying for thermal error prediction.
GAUSS and Matlab codes for Multivariate Linear Rational Expectations Models: Characterization of the Nature of the Solutions and Their Fully Recursive Computation

Code for article published in Econometric Theory, 13 (1997), pp. 877-888. Currently, you may download two GAUSS programs and two MATLAB programs from this page. Both programs solve the real business cycle model of Christiano and Eichenbaum (1992). (See also Binder and Pesaran, 1995). The programs RBCQDE.PRG (GAUSS) and RBCQDE.M (MATLAB) solve this model using the quadratic determinantal equation method, and the programs RBCFRM.PRG (GAUSS) and RBCFRM.M (MATLAB) solve this model using the fully recursive method suggested in this paper. To run either one of the GAUSS programs, you will also need to download the procedure MATPOW.G.
Chemical Informatics Functionality in R

The flexibility and scope of the R programming environment has made it a popular choice for statistical modeling and scientific prototyping in a number of fields. In the field of chemistry, R provides several tools for a variety of problems related to statistical modeling of chemical information. However, one aspect common to these tools is that they do not have direct access to the information that is available from chemical structures, such as contained in molecular descriptors. We describe the rcdk package that provides the R user with access to the CDK, a Java framework for cheminformatics. As a result, it is possible to read in a variety of molecular formats, calculate molecular descriptors and evaluate fingerprints. In addition, we describe the rpubchem that will allow access to the data in PubChem, a public repository of molecular structures and associated assay data for approximately 8 million compounds. Currently, the package allows access to structural information as well as some simple molecular properties from PubChem. In addition the package allows access to bio-assay data from the PubChem FTP servers.
Arabic handwritten: pre-processing and segmentation

This paper is concerned with pre-processing and segmentation tasks that influence the performance of Optical Character Recognition (OCR) systems and handwritten/printed text recognition. In Arabic, these tasks are adversely effected by the fact that many words are made up of sub-words, with many sub-words there associated one or more diacritics that are not connected to the sub-word's body; there could be multiple instances of sub-words overlap. To overcome these problems we investigate and develop segmentation techniques that first segment a document into sub-words, link the diacritics with their sub-words, and removes possible overlapping between words and sub-words. We shall also investigate two approaches for pre-processing tasks to estimate sub-words baseline, and to determine parameters that yield appropriate slope correction, slant removal. We shall investigate the use of linear regression on sub-words pixels to determine their central x and y coordinates, as well as their high density part. We also develop a new incremental rotation procedure to be performed on sub-words that determines the best rotation angle needed to realign baselines. We shall demonstrate the benefits of these proposals by conducting extensive experiments on publicly available databases and in-house created databases. These algorithms help improve character segmentation accuracy by transforming handwritten Arabic text into a form that could benefit from analysis of printed text.
Survival Analysis Using SAS: A Practical Guide, Second Edition

Easy to read and comprehensive, Survival Analysis Using SAS: A Practical Guide, Second Edition, by Paul D. Allison, is an accessible, data-based introduction to methods of survival analysis. Researchers who want to analyze survival data with SAS will find just what they need with this fully updated new edition that incorporates the many enhancements in SAS procedures for survival analysis in SAS 9. Although the book assumes only a minimal knowledge of SAS, more experienced users will learn new techniques of data input and manipulation. Numerous examples of SAS code and output make this an eminently practical book, ensuring that even the uninitiated become sophisticated users of survival analysis. The main topics presented include censoring, survival curves, Kaplan-Meier estimation, accelerated failure time models, Cox regression models, and discrete-time analysis. Also included are topics not usually covered in survival analysis books, such as time-dependent covariates, competing risks, and repeated events. Survival Analysis Using SAS: A Practical Guide, Second Edition, has been thoroughly updated for SAS 9, and all figures are presented using ODS graphics. This new edition also documents major enhancements to the STRATA statement in the LIFETEST procedure; includes a section on the PROBPLOT command, which offers graphical methods to evaluate the fit of each parametric regression model; introduces the new BAYES statement for both parametric and Cox models, which allows the user to do a Bayesian analysis using MCMC methods; demonstrates the use of the counting process syntax as an alternative method for handling time-dependent covariates; contains a section on cumulative incidence functions; and describes the use of the new GLIMMIX procedure to estimate random-effects models for discrete-time data.
Herodotus: A Peer-to-Peer Web Archival System

In this thesis, we present the design and implementation of Herodotus, a peer-to-peer web archival system. Like the Wayback Machine, a website that currently offers a web archive, Herodotus periodically crawls the world wide web and stores copies of all downloaded web content. Unlike the Wayback Machine, Herodotus does not rely on a centralized server farm. Instead, many individual nodes spread out across the Internet collaboratively perform the task of crawling and storing the content. This allows a large group of people to contribute idle computer resources to jointly achieve the goal of creating an Internet archive. Herodotus uses replication to ensure the persistence of data as nodes join and leave. Herodotus is implemented on top of Chord, a distributed peer-to-peer lookup service. It is written in C++ on FreeBSD. Our analysis based on an estimated size of the World Wide Web shows that a set of 20,000 nodes would be required to archive the entire web, assuming that each node has a typical home broadband Internet connection and contributes 100 GB of storage.
Usability of Transient VEPs in BCIs

Among non-invasive Brain Computer Interfaces (BCIs), electroencephalogram (EEG) has been the most commonly used for them because EEG is advantageous in terms of its simplicity and ease of use, which meets BCI specifications when considering practical use. In general, EEG signals (EEGs) can be classified into two categories, spontaneous EEGs and stimulus evoked EEGs. Focusing on stimulus evoked EEGs, signals called P300 and Visual Evoked Potentials (VEPs) are often utilized for BCIs. Both types of BCIs extract the intention of users by detecting which target on the PC monitor users are gazing at (Sellers & Donchin, 2006; Sellers, et al., 2006). While P300 signals are thought to be derived from the thoughts of users, VEPs are simply derived from physical reaction to visual stimulation. In that sense, VEP-based BCIs are thus known as the simplest BCIs. Most VEP-based BCIs utilize so-called “steady-state VEPs” (SSVEPs) which are generated in reaction to high-speed blinking light (Allison, et al., 2008; Cheng, et al., 2002). Because SSVEPs are characterized by sinusoidal-like waveforms whose frequencies are synchronized with the frequency of blinking light, the gazing target of users can be identified by using frequency analysis of SSVEPs from among several visual targets with different blinking frequencies. On the other hand, there is another type of VEP called a “transient VEP. ” Transient VEPs are generated in reaction to low-speed blinking light (i.e., blinking frequency of less than 3.5 Hz), and they can be characterized with a negative peak of around 75 ms and a positive peak of around 100 ms (N75 and P100 in Fig. 1). Unlike SSVEPs, transient VEPs are rarely used for BCIs because it is considered that they need longer detection time than SSVEPs. However, there are several issues which need to be addressed regarding the use of SSVEPbased BCIs. The first issue is discomfort caused by blinking light. When gazing at highspeed blinking light, some people exhibit symptoms similar to optically stimulated epileptic seizure such as annoyance, headache, or nausea (Graf, et al., 1994; Guerrini & Genton, 2004). Most of the subjects in the authors’ study group actually felt discomfort caused by the blinking stimuli. The second issue is that SSVEPs are not detected in all people. One of the reasons for this is considered to be that some people unconsciously refuse to gaze at discomfort targets, and the authors’ group included some users in which SSVEPs were not detected. SSVEP-based BCIs cannot be practically used for such kind of users. Considering these issues, the authors have proposed a transient VEP-based BCI which reduces discomfort caused by gazing at high-speed blinking light (Yoshimura & Itakura,
Classification of speech accents with neural networks

Several neural network models including competitive learning and counter propagation are developed to identify individuals as either native or non-native speakers based on their accents. Some important speech features, such as pitch period and the first three formant frequencies, are used as inputs to the neural networks. Comparison results based on experiments are also presented. The primary contribution is that it provides a feasible approach for an assisting automatic speech recognition system in an environment in which different English accents may be used. <<ETX>>
Phonetically sensitive discriminants for improved speech recognition

A phonetically sensitive transformation of speech features has yielded significant improvement in speech-recognition performance. This (linear) transformation of the speech feature vector is designed to discriminate against out-of-class confusion data and is a function of phonetic state. Evaluation of the technique on the TI/NBS connected digit database demonstrates word (sentence) error rates of 0.5% (1.5%) for unknown-length strings and 0.2% (0.6%) for known-length strings. These error rates are two to three times lower than the best previously reported results and suggest that significant improvements in speech-recognition system performance can be achieved by better acoustic-phonetic modeling. <<ETX>>
Image retrieval based on subband energy histograms of reordered DCT coefficients

Nowadays a large number of images are compressed in the JPEG format. In order to retrieve these images, firstly we should decompress these images, then extract feature vectors in the pixel domain. Some of the literature has proposed image retrieval methods directly in the DCT domain, which can reduce computation complication. In this article, we propose a novel method for image retrieval. We firstly reorder the DCT coefficients of the JPEG images in the multiresolution wavelet transform form; this can get a set of subbands. Secondly construct subband energy histograms of these subbands, then construct image keys by using Morton order, and lastly organize the image keys in the form of a variant of the B-tree data structure for image retrieval.
A Hybrid Intelligent Algorithm for Fuzzy Programming Problem under Credibility Theory

Based on the credibility theory, this paper is devoted to the fuzzy programming problem. The expected-value model of fuzzy programming problem is provided under credibility theory. For solving the fuzzy programming problem efficiently, Latin Hypercube Sampling, fuzzy simulation, Support Vector Machine and Artificial Bee Colony algorithm are integrated to build a hybrid intelligent algorithm. The proposed method has excellent consistency and efficiency in solving fuzzy programming problem, and is particularly useful for expensive systems.
A Study on Time Synchronization Algorithm Based on Energy Effective Strategy

With advantages and improvements of HRTS algorithm and DMTS algorithm, a time synchronization algorithm based on energy effective strategy and available to multi-hop network is introduced in this paper. With guarantee of synchronization accuracy, the algorithm prolongs lifetime of WSN. Experiment in Zigbee network indicates that triple-hop synchronization error is less than 15 milliseconds.