Miracle-dz/UniFAR-FTUs huggingface dataset:
A comparative performance study of four-pole induction motors and synchronous reluctance motors in variable speed drives

Lappeenranta University of Technology Acta Universitatis Lappeenrantaensis 153 Jorma Haataja A comparative performance study of four-pole induction motors and synchronous reluctance motors in variable speed drives Lappeenranta 2003 ISBN 951-764-772-7, ISSN 1456-4491 Design aspects of the Transversally Laminated Anisotropic (TLA) Synchronous Reluctance Motor (SynRM) are studied and the machine performance analysis compared to the Induction Motor (IM) is done. The SynRM rotor structure is designed and manufactured for a 30 kW, four-pole, three-phase squirrel cage induction motor stator. Both the IM and SynRM were supplied by a sensorless Direct Torque Controlled (DTC) variable speed drive. Attention is also paid to the estimation of the power range where the SynRM may compete successfully with a same size induction motor. A technical loss reduction comparison between the IM and SynRM in variable speed drives is done. The Finite Element Method (FEM) is used to analyse the number, location and width of flux barriers used in a multiple segment rotor. It is sought for a high saliency ratio and a high torque of the motor. It is given a comparison between different FEM calculations to analyse SynRM performance. The possibility to take into account the effect of iron losses with FEM is studied. Comparison between the calculated and measured values shows that the design methods are reliable. A new application of the IEEE 112 measurement method is developed and used especially for determination of stray load losses in laboratory measurements. The study shows that, with some special measures, the efficiency of the TLA SynRM is equivalent to that of a high efficiency IM. The power factor of the SynRM at rated load is smaller than that of the IM. However, at lower partial load this difference decreases and this, probably, brings that the SynRM gets a better power factor in comparison with the IM. The big rotor inductance ratio of the SynRM allows a good estimating of the rotor position. This appears to be very advantageous for the designing of the rotor position sensor-less motor drive. In using the FEM designed multi-layer transversally laminated rotor with damper windings it is possible to design a directly network driven motor without degrading the motor efficiency or power factor compared to the performance of the IM. UDC 621.313. 32 : 621.313. 33
Grapheme-to-phoneme rules: A review

A set of mgl ish rules has been written for the speech synthesis system developed a t the Royal Ins t i tu te of Technology (KTH) i n Stockholm. The rules were written in the formalism provided by this system, an important feature of which is a higher-level progranming language which greatly f ac i l i t a t e s the extension of the system t o other languages. A categorization of grapheme-to-phoneme rules i n terms of special contexts is presented here, and som3 aspects of the u t i l i t y of the formalism are discussed. The resul t s of a preliminary evaluat ion of the grapheme-to-phoneme and lexical stress rules are also included.
Text mining with the WEBSOM

The emerging eld of text mining applies methods from data mining and exploratory data analysis to analyzing text collections and to conveying information to the user in an intuitive manner. Visual, map-like displays provide a powerful and fast medium for portraying information about large collections of text. Relationships between text items and collections, such as similarity, clusters, gaps and outliers can be communicated naturally using spatial relationships, shading, and colors. In the WEBSOM method the self-organizing map (SOM) algorithm is used to automatically organize very large and high-dimensional collections of text documents onto two-dimensional map displays. The map forms a document landscape where similar documents appear close to each other at points of the regular map grid. The landscape can be labeled with automatically identi ed descriptive words that convey properties of each area and also act as landmarks during exploration. With the help of an HTML-based interactive tool the ordered landscape can be used in browsing the document collection and in performing searches on the map. An organized map o ers an overview of an unknown document collection helping the user in familiarizing herself with the domain. Map displays that are already familiar can be used as visual frames of reference for conveying properties of unknown text items. Static, thematically arranged document landscapes provide meaningful backgrounds for dynamic visualizations of for example time-related properties of the data. Search results can be visualized in the context of related documents. Experiments on document collections of various sizes, text types, and languages show that the WEBSOM method is scalable and generally applicable. Preliminary results in a text retrieval experiment indicate that even when the additional value provided by the visualization is disregarded the document maps perform at least comparably with more conventional retrieval methods. c © All rights reserved. No part of the publication may be reproduced, stored in a retrieval system, or transmitted, in any form, or by any means, electronic, mechanical, photocopying, recording, or otherwise, without the prior written permission of the author.
Temporale og romlige sedimentasjonstrender i en distal-glasial innsjø, gjennom Den Lille Istid

The sedimentation processes in an arctic distal-glacier fed lake Jægervatn (3 m. a.s.l.), located in northern Norway, has been studied by means of core analysis in addition to quaternary mapping of the catchment area of Jægervatn. The cores consist of six HTH sediment cores (JVS104 – JVS604) and one longer piston core (JVP203), retrieved along a south – north oriented transect in the lake covering 2000 m. The physical properties of the lacustrine sediments have been examined including visual log, X-ray, X-ray fluorescence (XRF), magnetic susceptibility (MS), frequency and temperature susceptibility (χbulk, 293K and 77K), loss on ignition (LOI), water content (WC), dry bulk density (DBD) and grain size distribution. The main focus was to study the temporal and spatial distribution of sediments in Jægervatn and assess to what extent the observed patterns could be related to glacial and extra-glacial activity. Based on result from the laboratory methods a sedimentation model for Jægervatn has been developed. The analysis of the cores have recognized two dominating sedimentary units in Jægervatn; unit B which is dominated by paraglacial processes and unit A which is dominated by glacial activity. Unit B was deposited during the ―Medial Warm Period‖ (MWD), whereas Unit A was deposted during the Little Ice Age (LIA). The latter period started in 1490 AD and lasted until 1920AD in the study area, possibly with two separate advances occurring around 1660 AD and 1830 AD, respectively. A third unit is also revealed and has been deposited during marine environments when Jægervatn was connected to fjord settings. The Equilibrium-line-altitude (ELA) lowering during the LIA was 57m, but even so it lead to over a trippeling of the sedimentation rate as recorded in Jægervatn, although the spatial pattern was much the same as during earlier periods.
Rewriting Logic as a Semantic Framework for Modular Structural Op-erational Semantics

The abstraction level provided by programming languages constructs in the past decade has increased substantially. We moved from low level machine programming in card processing systems to executable mathematical specifications using functions, logic specifications with inference rules, or algebraic specifications with abstract datatypes, all running on laptops. The motto is becoming more and more “what” instead of “how”. A byproduct of this technology evolution is the transformation technology which moved from assembly to machine level code compilation towards high-level specification processing. This is accomplished by transformations from that high level language to another language following a refinement process, that is, a process that preserves semantic properties from the source language into the target language, in a potential network of transformations. Among the high level frameworks that relate to the above mentioned process, are actions semantics (AS ), modular structural operational semantics (MSOS ), and rewriting logic (RWL). AS is a framework for specifying the semantics of programming languages in a very readable way without loosing its mathematical precision. MSOS is an extension to the structural operational semantics framework, that manages the pragmatic issue of modularity in a simple and elegant way. RWL is a generic framework to which many logics and specification languages have been mapped to. This thesis applies state-of-the art transformation technology to the scope of semantic-driven generation of programming languages interpreters. The main contribution of this work is a proven correct mapping from MSOS to RWL and the MSOS-SL Interpreter, an implementation of an interpreter for MSOS specifications. As a case study for the MSOSSL Interpreter, we have implemented the Maude Action Tool (MAT), an executable environment for AS using the MSOS specification of action notation. We have coded our tools in Maude, an efficient implementation for rewriting logic, with a fairly intensive use of its meta-programming capabilities.
Development of Terminology for SCM1

We develop a higher level terminology for the SCM machine defined by Nakamura and Trybulec in [5]. Among numerous technical definitions and lemmas we define a complexity measure of a halting state of SCM and a loader for SCM for arbitrary finite sequence of instructions. In order to test the introduced terminology we discuss properties of eight shortest halting programs, one for each instruction.
THE IMPLEMENTATION OF GENETIC MULTICAST ALGORITHMS IN AD-HOC NETWORKS

Realtime multimedia applications in computer networks require techniques of providing data to a group of users at the same time. Building efficient multicast trees is a challenge for multicast routing protocols and algorithms. The paper focuses on the implementation of genetic multicast algorithms particularly in adhoc networks. It also proposes some approaches in ad-hoc networks modelling. The paper is the first stage of author’s research work with ad-hoc networks.
Analyzing the Conceptual Coherence of Computing Applications Through Ontological Excavation

We are investigating metrics for measuring the usefulness of computing applications relative to a specific use context. We define " usefulness " as " the extent to which an application's features succeed in assisting a set of users to achieve a set of goals, relative to the amount of effort required to engage those features. " We define a feature as a user-accessible behavior or service implemented by a computing application. Computing applications embody and operationalize a set of concepts that correlate to concepts in the domain of the user. The degree to which the application's concepts and the user's concepts agree is its conceptual fitness. We believe that applications with high conceptual fitness to a particular use context will also be perceived as useful by the users in this context. We have chosen in this work to study the problem of measuring conceptual fitness from the application side using conceptual coherence as our unit of interest. Conceptual coherence is an attribute of conceptual integrity, described by Fred Brooks as the property of a system designed under a unified and coordinated set of design ideas. It is the property of a computing application that measures the degree to which that application's concepts are tightly related. In previous work, we established that applications have core concepts – concepts that are essential to defining that application's features. An application will have a low conceptual coherence if it possesses a disproportionate number of non-core (peripheral) concepts. We intend to show that the conceptual coherence of an application determines its perceived usefulness to its users, and features with only tangential relationships to an application are less likely to be used and reduce that application's conceptual coherence. The set of concepts and relationships contained in an application can be said to be its ontology. We have developed methods for the black-box reverse engineering (excavation) of a computing application's ontology from the user interface and use techniques from the user interface and use techniques from graph theory to identify the core concepts of an application and its teleons – tightly connected functional subgroups within the ontology. We have also developed a technique called use case silhouetting which measures the ontological coverage, the number of concepts activated by a use case or set of use cases, and the relative importance of a concept to a set of use cases as a first approximation of conceptual fitness. We …
Secure stream cipher initialisation processes

Stream ciphers are symmetric key cryptosystems that are used commonly to provide confidentiality for a wide range of applications; such as mobile phone, pay TV and Internet data transmissions. This research examines the features and properties of the initialisation processes of existing stream ciphers to identify flaws and weaknesses, then presents recommendations to improve the security of future cipher designs. This research investigates well-known stream ciphers: A5/1, Sfinks and the Common Scrambling Algorithm Stream Cipher (CSA-SC). This research focused on the security of the initialisation process. The recommendations given are based on both the results in the literature and the work in this thesis.
NRL Atmospheric Correction Algorithms for Oceans: Tafkaa User's Guide

Abstract : Tafkaa is an atmospheric correction algorithm for remote sensing of ocean color that has been developed at the Naval Research Laboratory (NRL). This document describes how to use Tafkaa, and presents some background on Tafkaa, including differences and similarities in both the current tabular and 6S versions. Descriptions of various options, restrictions, assumptions, keywords, input files, and output files associated with Tafkaa are also presented.
Block Markov Encoding & Decoding

Various Markov encoding and decoding techniques are often proposed for specific channels, e.g., the multi-access channel (MAC) with feedback, the relay channel, the MAC with cribbing encoders [1], [2], [3]. The goal of this report is to summarize the basic ideas of some block Markov coding techniques and present them using two simple channels, namely the point-to-point channel and the relay channel. Transmission using block Markov coding operates over a number of blocks. In each block, with the exception of the first or the last block, a new message is sent. However, the codeword to send at each block depends on not only “fresh” information but also “past” information from one or more previous blocks. Hence the name “Markov encoding”. The information from previous blocks can be refined information for the previous message or cooperative information for other users, etc. At the receiver, since the channel output at each block is related with messages from previous blocks, different decoding schemes have been proposed. The rest of this summary is organized as follows. Section II discusses the application of Markov coding in the point-to-point, discrete memoryless channel (DMC). Block Markov coding is unnecessarily complicated for a simple point-to-point DMC, but studying this setting allows for a simplified treatment of the scheme’s mechanics. To illustrate the benefits of block Markov coding in multi-user information theory, Section III applies block Markov coding techniques to prove an achievable rate for the relay channel. Section IV concludes the paper.
A Restricted Double-Level Bayesian Classification Model

Naive Bayes classifier is a simple and effective classification method, but its attribute independence assumption makes it unable to express the dependence among attributes, and affects its classification performance. On the basis of analyzing the classification principle of Bayesian classification model and a variant of Bayes theorem, a new classification model based on Bayes theorem, DLBAN (double-level Bayesian network augmented naive Bayes), which adds the dependence among attributes by selecting the key attributes, is proposed. DLBAN classifier is compared with Naive Bayes classifier and TAN (tree augmented naive Bayes) classifier by an experiment. Experimental results show this model has higher classification accuracy in most data sets.
Performance-oriented fully routable dynamic architecture for a field programmable logic dervice

In thisreport we present a new architecture for a Field Programmable LogicDevice. The architec ture is geared towards routing completion and predictable timing performance. The central prin ciple of the new architecture is based on the concept of efficient use of silicon resources. It is performance-oriented, with predictable interconnect and logic delays, and has aguaranteed routability. Latency in the original circuit is exploited in such a manner as to make efficient reuse of in terconnect resources. Specifically, the given circuit is topologically levelized and implemented in a folded-pipeline manner. The new architecture is CAD friendly, thereby eliminating the need for complex time-consuming place and route tools.
Automated Identification of Errors in Data Sets

The paper presents an overview of the current research and methods applied to the problem of data cleansing. It presents a tool for automated data cleansing of data sets. The tool is designed to be domain independent and constitutes the first part in a proposed framework for automated data cleansing. Development of a tool to address the entire framework is the ultimate goal of the research. The paper addresses the data cleansing problem from a different perspective, that is identification of errors in single data sets. This research ties together data quality and data mining issues. Existing outlier detection methods are utilized: clustering, pattern identification, and statistical methods. Real-world data is used for experiments. The methods and results are presented and analyzed. Refinements of these methods and new methods are proposed to address the data cleansing problem. ∗ This research is supported in part by a grant from the Office of Naval Research. Maletic & Marcus Automated Identification of Errors in Data Sets Technical Report CS-00-02 2 2/2/2000
Fault detection, isolation and reconfiguration ff fimp: methods and experimental results

The Fault-Tolerant Multiprocessor (FTMP) is a highly reliable computer designed to meet a goal of 10 to the -10th failures per hour and built with the objective of flying an active-control transport aircraft. Fault detection, identification, and recovery software is described, and experimental results obtained by injecting faults in the pin level in the FTMP are presented. Over 21,000 faults were injected in the CPU, memory, bus interface circuits, and error detection, masking, and error reporting circuits of one LRU of the multiprocessor. Detection, isolation, and reconfiguration times were recorded for each fault, and the results were found to agree well with earlier assumptions made in reliability modeling.
Learning probabilistic lexicalized grammars for natural language processing

A good representation of language is essential to building natural language processing (NLP) applications. In recent years, the growing availability of machine-readable text corpora has popularized the use of corpus-trained probabilistic grammars to represent languages in NLP systems. Although automatically inducing grammars from large corpora is an appealing idea, it faces several challenges. First, the trained grammar must capture the complexity and ambiguities inherent in human languages. Second, to be useful in practical applications, the grammar must be computationally tractable. Third, although there exists an abundance of raw text, the induction of high-quality grammars depends on manually annotated training data, which are scarce; therefore, the learning algorithm must be able to generalize well. Finally, there are inherent trade-offs in attempting to meet all three challenges; a meta-level challenge is to find a good compromise between the competing factors. To address these challenges, this thesis presents a partially supervised induction algorithm based on the Expectation-Maximization principle for the Probabilistic Lexicalized Tree Insertion Grammar (PLTIG) formalism. Using the lexical properties of the PLTIG formalism in the learning algorithm, we show that it is possible to automatically induce a grammar for a natural language that adequately resolves ambiguities and manages domain complexity at a tractable computational cost. By augmenting the basic learning algorithm with training techniques such as grammar adaptation and sample-selection, we show that the induction's dependency on annotated training data can be significantly reduced. Our empirical studies indicate that even with a 36% reduction in annotated training data, the learning algorithm can nonetheless induce grammars without degrading their quality.
Model-Based Implementation of Meta-Variability Constructs: A Case Study using Aspects.

In this paper, we introduce the concept of metavariability, i.e., variability with respect to basic variability attributes like binding time or constraints. While the main focus of this paper is on the introduction of the concept, we will also illustrate the concept by providing a case study. The case study will feature a simple implementation environment based on aspect-oriented programming and will include an example that will exhibit some key characteristics of the envisioned production process.
Creating Integrated Curriculum: Proven Ways to Increase Student Learning

Preface Acknowledgements About the Author 1. What Is Integrated Curriculum and Why Is It Important? 2. Does Integrated Curriculum Work? 3. Creating Multidisciplinary Programs 4. Using Interdisciplinary Approaches 5. Exploring Transdisciplinary Approaches 6. Connecting Standards To Curriculum 7. Aligning Teaching, Learning, and Assessment 8. Overcoming the Obstacles and Finding Success Resources Resource A: Books Resource B: Journals Resource C: Videos Resource D: Newsletters Resource E: Programs References Index
Bebionic Prosthetic Design

The bebionic hand by RSLSteeper is a fully articulating myo-electric hand with multiple preprogrammed grip positions. Increased function and hand flexibility provides design engineers with challenges in maintaining reliability and meeting increasing user demands. This paper will discuss the technical attributes, key design elements and the philosophy of their selection and evolution, as well as thoughts for the future. Special attention will be paid to thumb and digit design, feedback loop, material and hardware selection.
Demonstrating and Assessing Student Learning with E-Portfolios

E-portfolios allow students to demonstrate competencies and reflect upon experiences, documenting academic preparation and career readiness. Creating e-portfolios enables students to enhance their learning by giving them a better understanding of their skills, as well as where and how they need to improve to meet academic and career goals. Additionally, the digital artifacts that students accumulate can be used to assess learning at the course, program, department, and institutional level. This report reviews how selected higher education institutions have implemented assessment e-portfolio systems that demonstrate and assess learning.