Miracle-dz/UniFAR-FTUs huggingface dataset:
A SIMPLE APPROACH TO QUADROCOPTER FORMATION FLYING TEST SETUP FOR EDUCATION AND DEVELOPMENT

A simple test setup has been developed at Institute of Aerospace Information Technology, University of Würzburg, Germany to realize basic functionalities for formation flight of quadrocopters. The test environment is planned to be utilized for developing and validating the algorithms for formation flying capability in real environment as well as for education purpose. An already existing test bed for single quadrocopter was extended with necessary inter-communication and distributed control mechanism to test the algorithms for formation flights in 2 degrees of freedom (roll / pitch). This study encompasses the domain of communication, control engineering and embedded systems programming. Bluetooth protocol has been used for inter-communication between two quadrocopters. A simple approach of PID control in combination with Kalman filter has been exploited. MATLAB Instrument Control Toolbox has been used for data display, plotting and analysis. Plots can be drawn in real-time and received information can also be stored in the form of files for later use and analysis. The test setup has been developed indigenously and at considerably low cost. Emphasis has been placed on simplicity to facilitate students learning process. Several lessons have been learnt during the course of development of this setup. Proposed setup is quite flexible that can be modified as per changing requirements.
Some thoughts on proving clean termination of programs.

Proof of clean termination is a useful sub-goal in the process of proving that a program is totally correct. Clean termination means that the program terminates (no infinite loops) and that it does so normally, without any execution-time semantic errors (integer overflow, use of undefined variables, subscript out of range, etc.). In contrast to proofs of correctness, proof of clean termination requires no extensive annotation of a program by a human user, but the proof says nothing about the results calculated by the program, just that whatever it does, it terminates cleanly. Two example proofs are given, of previously published programs: TREESORT3 by Robert Floyd, and SELECT by Ronald L. Rivest and Robert Floyd.
Special issue on Similarity-based pattern recognition

The goal of this special issue was to solicit and publish high-quality papers that bring a clear picture of the state of the art in this area. We received 71 submissions, confirming that this topic arouses lively interest in the field of Pattern Recognition and Computer Vision. Each paper was reviewed by at least two reviewers, with most being reviewed by three. This meant that we needed the assistance of some 200 reviewers which we thank for their invaluable assistance. Further, each paper was checked out by the editors. Based on the reviews, and giving authors the chance to revise their papers in the light of reviewers, comments, we selected the 10 papers that appear in the current special section, together with five papers that will appear in subsequent regular issues. The papers span a diverse set of methods and applications.
FPGA Implementation of LDPC Codes

Abstract Low Density Parity Check (LDPC) are the linear error correction codes for amendment of mistakes, a technique of transmitting the messages over the noisy channel. With lieu- Shannon’s controlled implementation and typically parallel execution of plan, low-density parity check codes are mainly executed at enquire and well-designed area of applications. Bipartite graph is used for development of LDPC codes. LDPC being limit stirring in the direction of codes which means its actual building exists that enables outer edge to be closely intended for symmetry of a channel with no memory. FPGA or Field Programmable Gate Array is based on configurable logic block (CLB) and is a semiconductor gadget that is associated by virtue of programmable interconnects. FPGAs are highly robust and can be created or designed as per the application or usefulness prerequisite of application. This research paper presents adaptable and more compatible LDPC decoder in change for other general LDPC decoder. This decoder has a completely adaptable LDPC plan in FPGA, which supports distinct codes and rate of information. The design is implemented in Xilinx ISE 14.2 software using VHDL programming and synthesized on SPARTAN 3E FPGA. Keywords: Sparse bipartite graph, threshold, Shannon limit, Very High Speed Integrated Circuit Hardware Description Language (VHDL) Cite this Article Sachit Gupta, Richa, Adesh Kumar. FPGA Implementation of LDPC Codes. Journal of Telecommunication, Switching Systems and Networks . 2018; 5(1): 21–28p.
SDL Modelling with High Level Petri Nets

SDL (the Speciication and Description Language standardized by ITU) is modelled using High Level Petri nets. The aim is to translate the full TeleNokia SDL to the input langage of PROD, the reachability graph analyzer of the Digital Systems Laboratory at the Technical University in Helsinki. The problems in modelling programming concepts used in the concurrent speciication language SDL are investigated.
EGO Ontology Model: law and regulation approach for E-Government

The Electronic Government is a new field of applications for the semantic web where ontologies are becoming an important research technology. The e-Government faces considerable challenges to achieve interoperability given the semantic differences of interpretation, complexity and width of scope. In this paper we present the initial state of an e-Government ontology model called EGO. First as a part of a project commissioned by the Spanish government that seeks strategies for the e-Government and second for an ongoing project commissioned by the Mexican government. A set of ontologies (component of EGO), are used to illustrate this paper. Brief applications of this model on an Information Retrieval and on a Semantic Peer-to-Peer within the e-Government context are shown
Acquiring a Second Language for School.

During the past two decades, rapidly increasing language minority demographics have had a major impact on U.S. schools. Yet even with all the varied instructional approaches that U.S. educators have undertaken to address the concern for providing a "meaningful education" for language minority students (Lau v. Nichols, 1974), we are still struggling to identify the most effective education practices. When newcomers arrive, a school district's first response is usually to provide additional staff development training. To provide current information, trainers work hard to keep up with the latest research, but the issues are complex and difficult to present in a short training session. Given the misinformation that persists about second language acquisition among both educators and the public, this short publication is written to guide the reader through the substantial research knowledge base that our field has developed over the past 25 years.
Cerebellum and Adaptive Control

Preface Part I. Anatomy and Physiology: 1. Introduction 2. Some aspects of comparative anatomy of the cerebellum 3. Aspects of the anatomy and physiology of the cerebellar cortex 4. The mossy fiber afferent system 5. The inferior olivary system and the climbing fibers 6. The cerebellar nuclei and their efferent pathways aspects of voluntary motor learning Part II. Function: 7. Cerebellar memory, long-term depression (LTD), and long-term potentiation (LTP) 8. The vestibulocerebellum and the oculomotor system 9. The cerebellum and cognition 10. Timing functions, classical conditioning, and instrumental conditioning 11. Some aspects of cerebellar pathology in humans and animals genetic alterations 12. Specialized cerebellum-like structures Part III. Models and Theories: 13. Non-adaptive models, forerunners of adaptive models, and earlier adaptive control models 14. Neural networks and adaptive control neural network models 15. Some specific features of adaptive controllers and adaptive signal processors 16. Adaptive control models Part IV. Summary and Conclusions: 17. The cerebellum as an adaptive controller Appendix Author's note Bibliography Index.
Utilisation de patterns dans la construction de specifications en UML et B

Il existe aujourd'hui deux grandes familles d'approches pour la modelisation de systemes : (i) les approches semi-formelles a objets telles que UML et (ii) les approches formelles fondees sur des semantiques algebriques ou ensemblistes telles que B. Ces deux approches sont complementaires. Independamment des approches ou des langages, une technique qui memorise un savoir-faire a ete proposee pour la modelisation des systemes : les patterns. Nous proposons d'utiliser les patterns pour specifier des systemes conjointement en UML et en B et illustrons notre demarche par le developpement de l'etude de cas du controle d'acces.
Analysis and planning of planar manipulation tasks

This thesis addresses the problem of producing reliable solutions to manipulation tasks. Such tasks are strongly influenced by the task geometry, mechanics, and uncertainty. This thesis addresses these issues by applying the techniques of classical mechanics, and extends these techniques to include task geometry and uncertainty. In particular, the thesis addresses manipulation tasks that involve two rigid polygonal objects interacting in a plane; examples include linear pushing, compliant motion, and placing-by-dropping tasks. For this class of tasks, the thesis defines a collection of generic algorithms that analyze the kinematic, static, dynamic, and motion-specification aspects of a given task. These algorithms identify a continuous bounded set of actions that will retiably achieve the task goal, despite uncertainty in every physical parameter except object shape. The algorithms perform a kinematic analysis to construct the set of reachable ($x$, $y$, $\theta$) task configurations, a static analysis to identify the configurations where equilibrium is possible, a dynamic analysis to identify a set of initial configurations that converge to the goal, and a coordinate transformation to identify a set of commanded motions that will achieve the goal. The kinematic and static analysis algorithms have been fully implemented, and the dynamic analysis algorithms have been partially implemented. These programs were used to synthesize linear pushing actions, to analyze a part interacting with an orienting fixture, and to synthesize placing-by-dropping actions. A series of physical experiments were performed to test the validity of the programs' physical predictions; no failures were observed in these experiments, some of which included over 1200 trials. This thesis represents a step toward the application of classical mechanics to general manipulation problems; many open problems remain. The thesis presents a discussion of possible extensions of this work to enhance its generality, as well as a discussion of task domains that appear to require a completely different approach.
A study on classification learning algorithms to predict crime status.

In the recent past, there has been a huge increase in the crime rate, hence the significance of task to predict, prevent or solve the crimes. In this paper, we conducted an experiment to obtain better supervised classification learning algorithms to predict crime status by using two different feature selection methods tested on real dataset. Comparisons in terms of Area Under Curve (AUC), that Naive Bayesian (0.898), k-Nearest Neighbor (k-NN) (0.895) and Neural Networks (MultilayerPerceptron) (0.892) are better classifiers against Decision Tree (J48) (0.727), and Support Vector Machine (SVM) (0.678). Furthermore, the performance of mining results is improved by using Chi-square feature selection technique.
Automatic detection of edited parts in inexact transcribed corpora based on alignment between edited transcription and corresponding utterance

The availability of a large-scale spontaneous speech corpora is crucially important for various domains of spoken language processing. However, the available corpora are usually limited because of its cost to prepare. On the other hand, inexact transcribed corpora have been widely produced in the form of shorthand notes, meeting records, or closed captions. Although these inexact transcribed corpora are more freely available than faithful/exact ones, these are not faithfully transcribed but contains edited transcriptions. Under this background, we are considering to build an efficient semi-automatic framework for converting inexact transcripts to faithful ones or exact transcriptions. This framework consists of two steps: the first step is to automatically detect positions of edited parts, and the second step is to manually transcribe the edited parts. This paper proposes an automatic detection method of edited parts in edited transcribed corpora for this framework. In our proposed method, an automatic alignment between edited transcription and its corresponding utterance is performed, and then a support vector machine based detector is applied to detect edited parts using some features obtained by the automatic alignment. As a result of evaluation on the Japanese National Diet Record, a reasonable result was obtained in speaker-closed condition.
Solution de récupération d'énergie pour les dispositifs hyperfréquences en technologie micro-ruban

Ce papier decrit une methode de recuperation de l'energie, issue des pertes en puissance, de circuits realises en technologie micro-ruban. Un thermo-generateur (TEG), utilisant l'effet Seebeck, convertit la chaleur provenant de la puissance dissipee en puissance electrique DC. Une solution d'integration ainsi que des regles de dessin sont proposees pour optimiser la recuperation d'energie tout en gardant une bonne isolation entre le TEG et la fonction hyperfrequence. Pour une puissance de l'ordre de 1-5 Watts, l'energie recuperee est significative. Un demonstrateur a ete realise a partir d'un filtre passe-bande et d'un TEG et des mesures electriques et thermiques sont presentees.
A dataflow graph based approach to web application development

This paper introduces a methodology for developing web applications within a dataflow graph based environment. In the first section we shortly introduce the programming environment we have extended for this work. The consecutive discussion focuses on the advantages of handling web resources by detaching them from the file system and leads to a conclusion for the implementation of the web-server components into a dataflow graph. We also present a dataflow based method for generating markup content and its style allocation.
Computer Lab Instruction in Elementary Schools: Time for Instructional Transformation or Worksheet Substitution?

Lately, concerns are raised about the ways teachers integrate technology and about their students’ digital literacy skills. Therefore, the purpose of this study was to investigate how elementary school teachers use their scheduled computer lab time. During this observational study emphasis was placed on the integration of literacy and technology and the extent to which integration supported the development of new literacies and promoted transformation of literacy tasks. The study took place in two elementary schools and included three weeks of daily observations in each of the schools. After the observations, interviews were conducted with teachers and school/district administrators. Introduction For many teachers the integration of technology has been central to their teaching (Eagleton, Guinee, & Langlais, 2003; Karchmer, Mallette, Kara-Soteriou, & Leu, 2005; Purcell, Heaps, Buchanan, & Friedrich, 2013). Lately, however, concerns are raised about the ways teachers integrate technology (Linckels et al., 2009) and about students’ abilities to effectively participate in activities that require digital literacy skills (Purcell et al., 2012). Some researchers argue that often new technologies are simply reinforcing old ways of teaching and learning (Resnik, 2007) and describe the use of technology as “fitting it in” rather than as being used in more effective ways (Cartwright & Hammond, 2007). Given that nowadays teachers have good access to educational technologies (Connecticut Association for Reading Research, 2008; Linckels et al., 2009), it is important to continue to
La promozione della capacità di analisi di situazioni educative complesse nei futuri insegnanti di scuola primaria

Il tema della capacita di risoluzione di problemi educativi da parte di coloro che si accingono a svolgere la professione di insegnante, implica l’acquisizione di strategie per reagire in modo adeguato alla complessita dei problemi che connotano le situazioni educative. Si presentano i risultati di una ricerca triennale che ha coinvolto in totale 450 studenti del corso di Laurea in Scienze della Formazione Primaria dell’Universita di Palermo. Con la ricerca ci si e posti l’obiettivo di rilevare la capacita degli studenti di affrontare lo studio con un atteggiamento volto alla comprensione e alla soluzione dei problemi concreti con i quali ci si confronta nel lavoro educativo. Si e inteso promuovere nei futuri maestri la capacita di identificare e affrontare situazioni scolastiche problematiche in modo adeguato. La ricerca costituisce un esempio di come si possa sviluppare negli studenti quell’insieme di abilita che confluiscono nella capacita di identificare e risolvere situazioni educative complesse.
A Catalog of CoWeb Uses

4 Catalog: Collaborative Artifact Creation 6 4.1 Creating a Case Library . 6 4.2 Puzzles . 8 4.3 Collaborative Hypertext . 9 4.4 Student Extra Credit Link Lists . 10 4.5 Student Advice Pages . 10 4.6 Managing a Design Process . 11 4.7 Collaborative Writing. 12 4.8 A Collaborative Glossary . 13 4.9 Collaborative Adventure Game . 13 4.10 Close Reading . 14
Récepteur itératif pour les canaux DS-CDMA sélectifs en fréquence avec réestimation du canal

In this paper, we present a turbo-detector for coded asynchronous DS-CDMA systems over frequency selective channels. In order to achieve good performance, the receiver has to accurately estimate the channel impulse response. The idea is to iteratively improve the initial channel estimate, obtained using training sequences, by exploiting the soft decisions provided by the decoders. To do this, we propose to use the EM algorithm and to include it into our iterative receiver. Assuming that the receiver knows the channel statistics, we propose to iteratively estimate the channel according to the MAP criterion using the EM algorithm. Simulation results show that this yields a significant improvement in performance.
A Call for Engaging Context in HCI/MIS Research with Examples from the Area of Technology Interruptions

This paper contributes to the discussion on future directions of Human-Computer Interaction in Information Systems (HCI/MIS) research by explicating the role of task- and social context. We show that context has not been sufficiently engaged, and argue why it is important to pay more attention to it in theory and design of future HCI/MIS research. Drawing on examples from the core HCI area of technology interruptions, we formulate a set of general research questions and guidelines, which allow us to represent the context of multiple users in continuous collaboration with multiple tools while working on tasks that are intertwined within business processes. These guidelines will generate new insights for HCI/MIS research and allow us to develop research that captures the changing nature of the computing environment.
APPLICATION OF A RAPID NEURAL NETWORK FOR IDENTIFICATION OF A MICRO-MACHINE SYSTEM

This paper describes the application of a rapid neural network for identification of a micro-machine system from the experimental input-output data. The advantage of the rapid learning algorithm is that it does not need repetitive iterations as most learning algorithms. It is capable of achieving a good solution in one training scan. Identification accuracy is assessed by direct comparison between the actual output of the system and the output of the neural network identifier. The results of the rapid neural network are compared with the results of the conventional feedforward neural network with back-propagation learning algorithm. The results show excellent performance of the rapid neural network for an input/output model identification of the micro-machine system from experimental data.
Uplink Interference Cancellation in HSPA: Principles and Practice

This paper provides the principles and practice of how interference cancellation (IC) can be implemented for the uplink in a 3GPP HSPA NodeB (Base Station) receiver. Uplink interference cancellation is a capacity enhancing technique that can be added to a NodeB receiver without the need to modify user equipment (UE), 3GPP specifications or network coverage. Details are provided on the algorithm, implementation and the corresponding system performance.
Large virtual robs by processor checkpointing

Instructions that have long latencies, such as loads that miss in the L2 cache, and have to go to main memory, considerably reduce the execution speed of programs. This phenomenon is expected to worsen in the near future. Furthermore, in-order commit of instructions results in stalls in execution due to the ROB (Reorder Buffer) getting filled with long latency instructions and subsequent instructions. Making the ROB larger is technologically possible, but the cost can be excessive. In this work, we propose a checkpointing mechanism that allows us to construct large, virtual ROBs from physical ones with small number of entries (32 or 64). When the ROB is full and the instruction at the top has a long latency, a checkpoint is made. That is, all the information that is needed by the processor, to restart from that point, is saved. From this point onward, instructions are released from the ROB so new instructions can be placed in the ROB. Processor information needs not to be saved when branches are predicted. Checkpointing also enables to virtually commit instructions out of order. Additionally, physical registers can be early released. This property considerably reduces the pressure on the register file in comparison to the traditional mechanism of in-order commit providing an increase in performance when registers are scarce. Out of order commit though checkpointing can have a signiffcant advantage in SMT processors where the threads compete for processor resources like the ROB and physical registers. We evaluate the performance of the mechanism for a superscalar processor with different memory latencies and internal resources configurations. Using a ROB of 64 entries and for the most realistic configurations, we get significant speedups over the same processor with a 2K entry ROB and in-order commit.
MORPHOLOGICAL COLOR SIZE DISTRIBUTIONS FOR IMAGE CLASSIFICATION AND RETRIEVAL

Current content-based image retrieval techniques can typically perform efficient and effective searches on heterogeneous image databases. This contribution deals with an approach based on the integration of color and texture description which is applied to a very homogeneous database: a blood image bank. The content of images is very similar and therefore it becomes imperative to use very precise descriptors: the color is described by classical color distributions (histograms) and for the texture, we introduce the morphological color size distributions. The similarity is measured by computing distance metrics between histograms. In order to increase the accuracy of retrieval, the results of color-based and texture-based retrieval are integrated by combining the associated dissimilarity values. The effects of different integration methods on classification performance are explained by means of experimental tests in a database of 123 cell images (leukocyte color images). After learning processing, where different feature selection and classifier definition alternatives are tested, a definiti ve integrated approach is proposed (precision ).