Miracle-dz/UniFAR-FTUs huggingface dataset:
Separation of simultaneous word sequences using Markov model techniques

Abstract : This thesis develops a method of separating multiple simultaneous conversations through the use of Markov models. Test samples which represent the conversations to be used as training data are described by a grammar base upon word and word-pair occurrences within the text. This grammar is then used to establish a Markov model for the text. These models are then combined to form a Markov model which describes the simultaneous occurrence of multiple conversations. Artificially generated word sequences which have the same grammar as the training conversations are supplied as input to the conversation filter, whose purpose is to listen to one of the input sequences. The conversation filter takes on either an optimal form in which the grammars of all input sequences to the filter are known, or a sub-optimal form which uses only the grammar of the desired output sequence. The conversation filter utilizes the Viterbi algorithm to extract the optimal text sequence for a best match to the grammar of the desired output. Analysis is performed to determine the efficiency of the algorithm and the performance of the algorithm for varying degrees of similarity between the grammars being separated.
Constructive defecits in brain damaged patients. Effect of the localized and/or diffuse cerebral lesions.

構成行為障害におよぼす局在性およびび慢性脳病変の影響を検討した. 対象は右半球損傷47例, 左半球損傷54例, び慢性脳損傷43例の計144例である. 構成行為は立方体透視図模写をもって判定した. 脳病変はCTの面積計による測定によった. 結果は以下の如くである. a) 局在性病変のみの群では, 1) 右半球とくに後部損傷では左半側視空間無視と関連する描画障害が高度である. 左半球損傷では構成障害は軽度であるが, 右下方での誤りが多い. 2) 立方体模写の線分数には左右半球損傷例内に明らかな差異は認めない. b) び慢性病変のみの群でも構成障害は高度となる. 1) とくに頭頂部萎縮群では左側無視傾向と, 保続と関連すると思われる線分増加がみられる. 2) 脳室拡大群では無為によると思われる行為の中断と注意力散浸か特徴的である. c) び慢性脳病変の構成行為障害におよぼす影響を強調したい.
Tracking Events at Magnet.me

A lot of interesting information can be extracted from the way users interact with a website. The regular way of extracting this information is through Google Analytics. Unfortunately, Google Analytics has two limitations. First, because Google Analytics uses a pageview as unit of measurement, it is unable to describe all user interactions. For example, tracking users on different devices is hard. Second, the reports generated by Google Analytics are not tailored for a specific business. For example, Google Analytics’ support for key performance indicators is very limited. We investigated how to build a system that is capable of providing these deeper insights. An event is used as the unit of measurement to provide the flexibility that is required to track all user interactions. We designed the system to cope with the data volume required by Magnet.me. This is done by using MongoDB as storage engine. We have shown that our system satisfies our requirements by performing performance tests.
The use of graph databases in file retrieval

Files and the unique terms they contain can be modeled as a graph where the vertices are files and terms and the edges describe containment. Can a graph databases be used for search and retrieval of local files? What problems arise and which optimizations can be done? How does such a method compare to today's file retrieval methods? The problem is approached in this project as a potentially commerciallizable software application. The intent is to create an environment where graph based file retrieval algorithms can easily be created, explored, tested and put in production. A highly modifiable Ruby based client server file retrieval application using Titan Aurelius Graph Database and rexpro is created. The server side consists of a Ruby on Rails back end with a rexpro connection to the graph database. The server can manage connections from several clients. The client side allows the user to index their files in the graph database on the server and run search queries for strings. Algorithms in groovy for Titan Aurelius can easily be implemented and tested on the server. Though the application is well suited for testing graph database file retrieval algorithms, only one was designed, implemented and tested. This is due to the time constraints on the project. The algorithm that was implemented and tested was ran on the indexed files of one of the project members on a handful of subjectively chosen search terms. It was a relatively simple algorithm that did not benefit from the full potential of a graph based file retrieval solution. The test was done to get an initial feel for the precision and recall of the algorithm and compare it to OSX Spotlight, which is the most highly developed local file retrieval service. The framework has proved simple enough to run and test algorithms. Because there was little test driven development involved, some uncertainty remains in the results in terms of what results the algorithms that were tested actually produced. The one algorithm that was designed and tested was pitted against OSX Spotlight. The algorithm showed a significantly lower performance than OSX Spotlight in terms of average precision and recall. Many reasons for this were identifiable. For instance, file types that were very unlikely to be a match were not filtered out. In a few cases, the application performed better than OSX Spotlight. It is too soon to determine for certain that a graph based file retrieval solution can compete with todays solutions. It does however have some precision and recall and has the potential to be significantly improved from its current state.
Les pâtes chimicothermomécaniques blanchies obtenues avec le procédé bivis

Description de l'installation pilote bivis de l'usine Aussedat-Rey de Lancey, avec sulfonation dans la premiere machine bivis et blanchiment dans la seconde pour les bois resineux, l'installation etant limitee a une seule machine pour les bois feuillus. Caracteristiques mecaniques et optiques des pâtes obtenues. Essai de fabrication sur machine industrielle d'un papier support de couche contenant de la pâte bivis blanchie de resineux
Lesson Plan and Workbook for Introducing Python Game Programming to Support the Advancing Out-of-School Learning in Mathematics and Engineering (AOLME) Project

In recent years, research has started to show a distressing trend in the world of science, technology, engineering, and mathematic (STEM) fields. It has become apparent that students from under-represented groups get little to no experience or practice in the field of engineering. This apparent lack of exposure to engineering knowledge and practice is likely to be the cause as to why students from underrepresented groups may not become interested in engineering careers. The Advancing Out-of-School Learning in Mathematics and Engineering (AOLME) project was created specifically for providing integrated mathematics and engineering experiences to middle-school students from under-represented groups. The thesis presents a new approach to introducing game programming to middleschool students that have undergone AOLME-training while still maintaining a fun and relaxed environment. The thesis provides a discussion of three different educational, visual-programming environments that are also designed for younger programmers and provides motivation for the proposed approach based on Python.
Segmentation collective d'images à base d'objets polyédriques et courbés

Dans cet article, nous utilisons le paradigme multi-agents pour proposer une nouvelle methode de segmentation d'images. Les images considerees dans ce travail sont les images de profondeur qui peuvent contenir a la fois des objets polyedriques et des objets courbes. La methode proposee utilise une approche multi-agents pour l'alignement des bordures de regions afin de faire emerger une segmentation collective de l'image. Les agents se deplacent sur l'image et alignent les pixels de contours a leurs surfaces respectives. L'alignement competitif qui en resulte permet a la fois l'emergence des contours et l'effacement des regions de bruit. Lors de leurs mouvements les agents s'auto- organisent dans l'espace de l'image via un champ de potentiel. Les resultats de test obtenus avec des images reelles montrent la pertinence de la methode proposee pour une segmentation precise des images de profondeur.
Oracle8 Design Tips

Preface. 1. What's New in Oracle8? Oracle's Marketing Message Oracle8 Features Scalability Reliability Security More Manageable Data More Copies of Data More Ways to Represent Data Faster Access to Data Towards Object Orientation The Type System Object Views. 2. Methodologies for Oracle8 Oracle8 and Traditional Methods Oracle8 and OOAD Component-Based Development Bottom-Up or Top-Down Development. 3. Miscellaneous Oracle8 Enhancements INSTEAD OF Triggers How INSTEAD OF Triggers Work A Trigger Example The Role of INSTEAD OF Triggers PL/SQL Improvements 3GL Callouts Restrictions on 3GL Callouts Example of a 3GL Callout Deferred Constraint Checking ENFORCE Option Safeguarding Data DB_VERIFY Utility Recovery Manager Utility Using the Recovery Catalog Recovery Manager features. 4. Oracle8's "Big" Features What Is a Really Big Database? Partitioned Objects Partitioned Tables Declarative partitioning Selecting a partition strategy Date-based partitioning Using partitions explicitly Determining the partition key Partitioned Indexes Unusable index partitions Locally prefixed partitions Locally non-prefixed partitions Global partitions Index-Only Tables Reversed Key Indexes Unstructured Data and LOBs Long and Unstructured Data in Oracle7 Introducing LOBs Design Considerations BFILE or LOB Recoverability and consistency Multiple LOBs Using LOBs in cartridges Primary key indexes Piecewise operations Supporting Large Populations of Users Connection Sharing User Identification Bitmap Indexes Cooperative Indexing NOLOGGING Option APPEND Hint Direct-Path Inserts. 5. Objects Introducing ORDBMS Pick Your Analogy Carefully Arguments For and Against Decomposition The Role of the LOB Interfaces Client-side Cache The Type System Reference Pointers (REFs) Abstract Data Types (ADTs) Methods MAP function ORDER function Collections VARRAYs Nested Tables Which Collection Type? Object Views Looking Ahead. 6. Tool Support for Oracle8 Sedona Developer/2000 Designer/2000 Object Designer SQL*Plus PL/SQL C, C++, and OCI Approaches to Extracting the Data Reasons to Use OCI Java Other Tools Conclusion.
Fibrin(ogen) - ein neuer Träger für nicht virale Genvektoren

Nicht viraler, lokaler Matrix-vermittelter Gentransfer mit Fibrin(ogen), bietet gegenuber dem alleinigen Einsatz rekombinanter Wachstumsfaktoren in der Wundheilung wesentliche Vorteile. Durch Lyophilisation eines handelsublichen Fibrinklebers zusammen mit nicht viralen Formulierungen der Genvektoren (pDNA, PEI-pDNA-Komplexe, COPROG’s), konnte eine lagerstabile Gen-aktivierte Fibrin-Matrix (GAFM) hergestellt und der Einflus der Genvektoren auf die Fibrinpolymerisation reduziert werden. Hullpolymer-geschutzte Genvektoren (COPROG’s) verblieben uber Wochen in der GAFM, wahrend nackte pDNA rasch freigesetzt wurde. PEI-pDNA-Komplexe oder COPROG’s mit Fibrinogen formuliert, zeigten eine effiziente Transfektion humaner Kreatinozyten uber mehrere Wochen. Eine GAFM mit PEI-pDNA-Komplexen oder COPRG’s last sich effektiv fur den lokalen, nicht viralen Matrix-vermittelten Gentransfer einsetzen, wie erste Tierversuche belegen.
Automatic Right Ventricle Segmentation using Multi-Label Fusion in Cardiac MRI

Accurate segmentation of the right ventricle (RV) is a crucial step in the assessment of the ventricular structure and function. Yet, due to its complex anatomy and motion segmentation of the RV has not been as largely studied as the left ventricle. This paper presents a fully automatic method for the segmentation of the RV in cardiac magnetic resonance images (MRI). The method uses a coarse-to-fine segmentation strategy in combination with a multi-atlas propagation segmentation framework. Based on a cross correlation metric, our method selects the best atlases for propagation allowing the refinement of the segmentation at each iteration of the propagation. The proposed method was evaluated on 32 cardiac MRI datasets provided by the RV Segmentation Challenge in Cardiac MRI.
Literature and Product Review of Visual Analytics for Maritime Awareness

Abstract : This is a study of the state-of-the-art in Visual Analytics (VA) technologies that might support the maintenance of the Recognized Maritime Picture (RMP). It begins with an analysis of the term Visual Analytics, including what qualifies and does not qualify under that term, and proposes a 4-point checklist of required elements. It reviews what interaction patterns are typical in VA and what topics need to be visualized for the RMP, and thus establishes a list of required tool capabilities. Links are then provided to approximately 70 papers that address these requirements. Global VA researchers, research groups, journals, and conferences are summarized. Fifteen VA products that are particularly relevant to the identified requirements are tabulated. An annotated bibliography, attached as an appendix, lists and provides an educated assessment of 146 relevant papers, websites, and product brochures.
Evaluation by Electronic Mail

For 3 years, the Diagnostic and Evaluative Procedures course of an education college was offered by electronic mail as well as by a more traditional "chalk and talk" approach, enabling a comparison of the two approaches. In the electronic setting, papers were submitted and questions asked and answered electronically. In the traditional class, students were expected to attend and listen to prepared lectures or participate in class discussions or activities. For this evaluation , there were 78 participants in the electronic classes and 65 in the traditional classes. Both groups were pretested and posttested to assess knowledge of course content. No significant differences in knowledge gain were found between the classes, suggesting that it is possible to conduct the class electronically without loss of academic performance. Attachments include the description of the course, an evaluation survey, and analysis of co-variance results. (Contains 26 references.) (Author/SLD) ******************************************************************************** Reproductions supplied by EDRS are the best that can be made from the original document. ******************************************************************************** PERMISSION TO REPRODUCE AND DISSEMINATE THIS MATERIAL HAS BEEN GRANTED BY f \eotqe.r:i TO THE EDUCATIONAL RESOURCES INFORMATION CENTER (ERIC) Evaluation by Electronic Mail Robert L. Kennedy rlkennedy@ualr.edu W. Newton Suter Melanie K. Perry U.S. DEPARTMENT OF EDUCATION Office of Educational Research and Improvement EDUCATIONAL RESOURCES INFORMATION CENTER (ERIC) This document has been reproduced as received from the person or organization originating it. Minor changes have been made to improve reproduction quality. Points of view or opinions stated in this document do not necessarily represent official OERI position or policy. Department of Educational Leadership University of Arkansas, Little Rock 2801 S. University, Little Rock AR 72204-1099 Mid-South Educational Research Association Annual Meeting November 13, 1997 Adam's Mark Memphis Memphis, Tennessee
Bio-Linguistics: The Santa Barbara lectures

Is human language an evolutionary adaptation? Is linguistics a natural science? These questions have bedeviled philosophers, philologists and linguists from Plato through Chomsky. Prof. Givon suggests that the answers fall naturally within an integrated study of living organisms. In this new work, Givon points out that language operates between aspects of both complex biological design and adaptive behavior. As in biology, the whole is an adaptive compromise to competing demands. Variation is the indispensable tool of learning, change and adaptation. The contrast between innateness and input-driven emergence is an interaction between genetically-coded and behaviorally-coded experience. In enlarging the cross-disciplinary domain, the book examines the parallels between language evolution and language diachrony. Sociality, cooperation and communication are shown to be rooted in a common evolutionary source, the kin-based hunting-and-gathering society of intimates. The book pays homage to the late Joseph Greenberg and his visionary integration of functional motivation, typological diversity and diachronic change.
Use of Tabu Search in a Solver to Map Complex Networks onto Emulab Testbeds

Abstract : The University of Utah's solver for the testbed mapping problem uses a simulated annealing metaheuristic algorithm to map a researcher's experimental network topology onto available testbed resources. This research uses tabu search to find near-optimal physical topology solutions to user experiments consisting of scale-free complex networks. While simulated annealing arrives at solutions almost exclusively by chance, tabu search incorporates the use of memory and other techniques to guide the search towards good solutions. Both search algorithms are compared to determine whether tabu search can produce equal or higher quality solutions than simulated annealing in a shorter amount of time. It is assumed that all testbed resources remain available, and that hardware faults or another competing mapping process do not remove testbed resources while either search algorithm is executing. The results show that tabu search produces a higher proportion of valid solutions for 34 out of the 38 test networks than simulated annealing. For cases where a valid solution was found, tabu search executes more quickly for scale-free networks and networks with less than 100 nodes.
Systemy SCADA w środowisku Android

In the paper an implementation of SCADA at mobile device, working under Android is presented. The application was prepared with use of Java and SDK Android for Eclipse with respect to Object Oriented Programming rules. The connection to supervised PLC is realized with the use of Modbus TCP and wireless Ethernet. Results of tests show, that the proposed system runs properly.
EmStar Software Environment

EmStar is a software system for developing and deploying wireless sensor networks involving Linux-based platforms. As the wireless sensor network community has attempted to deploy more complex designs---large-scale, long-lived systems that need self-organization and adaptivity---a number of difficult software design issues have arisen. Advances in software design have not kept pace with the capabilities of hardware. This is because designing for an adaptive, efficient, and useful sensor network has turned out to be surprisingly complex and difficult. EmStar is a Linux-based software framework, whose goal is to dramatically reduce this complexity, enabling work to be shared and reused, and simplifying and speeding the design of new sensor network applications.
Elaboración de Base de Datos de Fotografías de Granos de Café Seco con Diferentes Defectos Físicos, Caracterizados con Métodos Estándar de PDI y Clasificación.

Se desarrollo un sistema de procesamiento digital de imagenes para la clasificacion de granos de cafe seco, en 5 tipos, dependiendo de sus defectos fisicos. Para la caracterizacion de la forma, el color y la textura de un grano de cafe, se extrajeron 63 caracteristicas conocidas en la literatura, y se propusieron algunas caracteristicas mas. Usando la correlacion, se redujeron las caracteristicas con las cuales se evaluaron cuatro tecnicas de clasificacion: Perceptron multicapa, Bayesiano, Maquina de soporte vectorial y arbol de decision J48. Con el clasificador Perceptron multicapa se obtuvo el mejor resultado con un error de clasificacion del 5,48%.
Social coordination : principles, artefacts and theories (SOCIAL.PATH).

Coordination is a basic feature of human interaction. Indeed, failure to achieve coordination might expose you ridicule, censure, or concerns about your mental capacity. On the other hand, human coordination is fragile, difficult to achieve, and often short-lived. At first sight, it may seem an easy task to engineer coordination in artificial societies to match that found in human ones. But, as I hope to show in this talk, understanding and modelling coordination is much more difficult than it seems. There are some fundamental problems in identifying coordination that computational systems tend at the moment to sidestep. I start from a definition of coordination that it is ‘the state of working together’ (definition derived from http://en.wiktionary.org/wiki/ coordination) The first problem is to identify instances of coordination. Simply observing the behaviours of two actors that take place simultaneously is not sufficient: we don’t know from observation of physical events that there is coordination involved. The behaviours may be the same, but performed independently and even without knowledge of the other. Or the behaviours may be different, yet coordinated. The second problem is that even when we are told or come to understand what is going on, we still don’t know whether the actions are really coordinated, especially if the intended coordination fails. This is because humans, unlike some computational agents, are not able to look inside the cognitions of their colleagues. The third problem is that coordination may be on the basis of cooperation (the case we usually think of), or competition. The Prisoner’s Dilemma is a good case of where it is not so clear whether coordination exists, in a context of cooperation and competition. The fourth problem is that it may seem that coordination is best identified by asking the actors involved, but they face much the same kinds of difficulty as observers do in attributing intentionality to their allegedly coordinating partners or even to their own behaviours. The fifth problem is that ‘working together’ implies some rules (or norms) about what to do, yet there are difficulties in applying rules to action that make the idea of ‘rule-governed action’ deeply problematic. In this talk, I shall illustrate these problems with a real example, and begin to suggest what might be involved in designing a computational model that respects the limitations faced by human actors in attempting to achieve coordination.