Miracle-dz/UniFAR-FTUs huggingface dataset:
Fin-germouse: A wearable hand tracking system

In this paper, we describe a system that implements limited hand tracking and gesture recognition capabilities in a small low power module. A first application is a mouse replacement, worn on the body, that captures the hand movement and allows the user to control a mouse pointer. The hardware is based on 2 image sensors, a distance sensor and a low power DSP. The software consists of different tracking algorithms supported by stereo vision based background clutter removal. Our system proves that computer vision can be useful even for mobile systems with strictly limited computational and power resources.
A Face Based Real Time Communication for Physically and Speech Disabled People

The main purpose of this research is to enhance the communication of the disabled community. The authors of this chapter propose an enhanced interpersonal-human interaction for people with special needs, especially those with physical and communication disabilities. The proposed model comprises of automated real time behaviour monitoring, designed and implemented with the ubiquitous and affordable concept in mind to suit the underprivileged. In this chapter, the authors present the prototype which encapsulates an automated facial expression recognition system for monitoring the disabled, equipped with a feature to send Short Messaging System (SMS) for notification purposes. The authors adapted the Viola-Jones face detection algorithm at the face detection stage and implemented template matching technique for the expression classification and recognition stage. They tested their model with a few users and achieved satisfactory results. The enhanced real time behaviour monitoring system is an assistive tool to improve the quality of life for the disabled by assisting them anytime and anywhere when needed. They can do their own tasks more independently without constantly being monitored physically or accompanied by their care takers, teachers, or even parents. The rest of this chapter is organized as follows. The background of the facial expression recognition system is reviewed in Section 2. Section 3 is the description and explanations of the conceptual model of facial expression recognition. Evaluation of the proposed system is in Section 4. Results and findings on the testing are laid out in Section 5, and the final section concludes the chapter.
Structured hardware design transformations

Studies of formal hardware designs are motivated by fast growing complexity of VLSI designs which have outpaced development of methodologies and tools. One area of study in formal methods for VLSI is design transformation. It establishes a design path, using a set of predefined transformations, between a specification and a design description which satisfies certain constraints. This thesis develops three results for design transformations of synchronous circuits. (1) An equational specification of hardware architectures and corresponding characterization of hardware controls extracted from recursive definitions. (2) A specification framework for sequential operations. In this framework, temporal relationship of sequential operations is formulated as a system of inequalities. A solution to inequalities is a synchronization mechanism which coordinates sequential operations to preserve the temporal relationship represented by the system of inequalities. (3) Applications of solving system of inequalities are sequential operation composition and sequential control integration. This allows designer to derive a circuit control from its recursive definition and sequential description of its architecture implementation.
Modeling of PWM converters in discontinuous conduction mode. A reexamination

Six existing methods for modeling PWM converters in discontinuous conduction mode (DCM) are reviewed. They are classified as either reduced-order or full-order model methods, and the methods in each group are shown to produce exactly the same averaged models. Using the concept of duty-ratio constraints, a new method is presented that leads to either the conventional reduced-order model or a new full-order model, depending on how the duty-ratio constraint is derived. With a boost converter as an example, the new full-order averaged model is shown to be more accurate than previously published models.
UML 2.0 in a nutshell

System developers have used modeling languages for decades to specify, visualize, construct, and document systems. The Unified Modeling Language (UML) is one of those languages. UML makes it possible for team members to collaborate by providing a common language that applies to a multitude of different systems. Essentially, it enables you to communicate solutions in a consistent, tool-supported language. Today, UML has become the standard method for modeling software systems, which means you're probably confronting this rich and expressive language more than ever before. And even though you may not write UML diagrams yourself, you'll still need to interpret diagrams written by others. UML 2.0 in a Nutshell from O'Reilly feels your pain. It's been crafted for professionals like you who must read, create, and understand system artifacts expressed using UML. Furthermore, it's been fully revised to cover version 2.0 of the language. This comprehensive new edition not only provides a quick-reference to all UML 2.0 diagram types, it also explains key concepts in a way that appeals to readers already familiar with UML or object-oriented programming concepts. Topics include: The role and value of UML in projectsThe object-oriented paradigm and its relation to the UMLAn integrated approach to UML diagramsClass and Object, Use Case, Sequence, Collaboration, Statechart, Activity, Component, and Deployment DiagramsExtension MechanismsThe Object Constraint Language (OCL) If you're new to UML, a tutorial with realistic examples has even been included to help you quickly familiarize yourself with the system.
The Specification and Implementation of Constraint-Based Unification Grammars

Our aim is to motivate and provide a specification for a unification-based natural language processing system where grammars are expressed in terms of principles which constrain linguistic representations. Using typed feature structures with multiple inheritance for our linguistic representations and definite attribute-value logic clauses to express constraints, we will develop the bare essentials required for an implementation of a parser and generator for the Head-driven Phrase Structure Grammar (HPSG) formalism of Pollard and Sag (1987).
Automatic Identification of Cognates and False Friends in French and English

Cognates are words in different languages that have similar spelling and meaning. They can help a second-language learner on the tasks of vocabulary expansion and reading comprehension. The learner also needs to pay attention to pairs of words that appear similar but are in fact false friends: they have different meaning in some contexts or in all contexts. In this paper we propose a method to automatically classify a pair of words as cognates or false friends. We focus on French and English, but the methods are applicable to other language pairs. We use several measures of orthographic similarity as features for classification. We study the impact of selecting different features, averaging them, and combining them through machine learning techniques.
Using Ad-Hoc Services for Mobile Augmented Reality Systems

A multiple cell electrophoresis elution device is disclosed. Gels are fractionated to locate, by scanning, the component of interest and the gel is sliced to isolate this band. In one embodiment, it is then placed in one compartment of the elution device and recast in place using a dilute gel. This recasting mechanically holds the gel and acts as a separating barrier from one buffer compartment to another. The gel casting procedure prevents both dilution of the eluted fractions by mixing due to mechanical or convective influences as well as insuring that the current must pass through the gel and not around it in the more conductive free buffer. In another embodiment, the cut gel is covered with an element to occupy the remaining volume of the gel compartment and compress the gel.
Discovery service design in the EPCglobal network: towards full supply chain visibility

The EPCglobal Network, an emerging standard for RFID, aims to raise visibility in supply chains by enabling interested parties to query item-level data. To get there, however, a critical piece is yet missing: a Discovery Service to identify possibly unknown supply chain actors holding relevant data for specific EPC numbers of individual products. Unfortunately, the Discovery Service architecture as initially conceived by EPCglobal needs revision as it either infringes the confidentiality of participating companies or its use is limited to identifying only participants already known. Against this background, this paper first discuusses the limitations of the architecture under consideration by EPCglobal and presents an alternative, more adequate Discovery Service design. Our concept encourages participation in the network while ensuring information provider confidentiality. Secondly, we present a roadmap for extending the existing EPCglobal Network with two critical services: an automated contract negotiation service and a billing service.
Parallel Database Techniques

From the Publisher: Describes how the use of parallel processing technology in the next generation of Database management Systems (DBMSs) has made it possible to meet new challenging requirements. Database technology in rapidly expanding new application areas brings with them challenges such as the increased functionality and the efficient handling of very large heterogeneous databases. The objective of this book is to review the latest techniques in parallel relational databases. It emphasizes techniques for achieving high performance in parallel database systems. The text is structured according to the overall architecture of a parallel database system. Its nine chapters present a number of state of the art techniques that can be adopted in the design of parallel database software and hardware execution environments. These techniques can directly or indirectly lead to high-performance parallel database implementation.
MIMO Wireless Communications: From Real-World Propagation to Space-Time Code Design

1. Introduction to multi-antenna communications 2. Physical MIMO channel modelling 3. Analytical MIMO channel representations for system design 4. Mutual information and capacity of real-world random MIMO channels 5. Space-time coding over I.I. D. Rayleigh flat fading channels 6. Error probability in real-world MIMO channels 7.Space-time coding over real-world MIMo channles with no transmit channel knowledge 8. Space-time coding with partial transmit channel knowledge 9.Space-time coding for frequency selective channels Appendices.
UBIWISE, A Simulator for Ubiquitous Computing Systems Design

We describe UbiWise, a simulator for ubiquitous computing. The simulator concentrates on computation and communications devices situated within their physical environments. It presents two views, each in a separate window on the desktop of the users' PC. One of the views provides a three dimensional world, built on the Quake III Arena graphics engine and serves to simulate a first-person view of the physical environment of a user. The other view, built using Java, shows a close-up view of devices and objects the user may manipulate. These views act as one unified whole by maintaining a clientserver model with a central server. Multiple users can attach to the same server to create interactive ubiquitous computing scenarios. We describe how UbiWise looks to researchers and examples of its use as tool for ubiquitous computing research.
Japanese Passives in Acquisition

A large number of grammar acquisition studies in recent years have convincingly shown that many properties of the allegedly biologically determined Universal Grammar (UG) constrain grammar acquisition from a very early age (see e.g. Crain 1991, Otsu 1981, Wexler 1994). A natural prediction to be drawn from this observation is that the constructions which are generated by the interactions of various modules of UG should also emerge early. One such construction is the passive construction (Boeckx 1998, Chomsky 1981, Baker, et al. 1989, Jaeggli 1986). Several experimental studies have tested this prediction with respect to the acquisition of passives in English (e.g. Maratsos, et al. 1985, Pinker, et al. 1987). However, the prediction was not borne out; it was found that children seem to have difficulty in comprehending full passives (i.e. passives with by-phrase). To account for these observations, Borer and Wexler (1987, 1992) proposed that young children do not have the ability to form A-chains, and that this ability is maturationally controlled (and does not emerge until around the age of four or so).
Architectures and algorithms for mitigation of soft errors in nanoscale VLSI circuits

The occurrence of transient faults like soft errors in computer circuits poses a significant challenge to the reliability of computer systems. Soft error, which occurs when the energetic neutrons coming from space or the alpha particles arising out of packaging materials hit the transistors, may manifest themselves as a bit flip in the memory element or as a transient glitch generated at any internal node of combinational logic, which may subsequently propagate to and be captured in a latch. Although the problem of soft errors was earlier only a concern for space applications, aggressive technology scaling trends have exacerbated the problem to modern VLSI systems even for terrestrial applications. In this dissertation, we explore techniques at all levels of the design flow to reduce the vulnerability of VLSI systems against soft errors without compromising on other design metrics like delay, area and power. We propose new models for estimating soft errors for storage structures and combinational logic. While soft errors in caches are estimated using the vulnerability metric, soft errors in logic circuits are estimated using two new metrics called the glitch enabling probability (GEP) and the cumulative probability of observability (CPO). These metrics, based on signal probabilities of nets, accurately model soft errors in radiation-aware synthesis algorithms and helps in efficient exploration of the design solution space during optimization. At the physical design level, we leverage the use of larger netlengths to provide larger RC ladders for effectively filtering out the transient glitches. Towards this, a new heuristic has been developed to selectively assign larger wirelengths to certain critical nets. This reduces the delay and area overhead while improving the immunity to
Algorithms And Tools For Computational Analysis Of Human Transcriptome Using Rna-Seq

ALGORITHMS AND TOOLS FOR COMPUTATIONAL ANALYSIS OF HUMAN TRANSCRIPTOME USING RNA-SEQ by NAN DENG December 2014 Advisor: Dr. Dongxiao Zhu Major: Computer Science Degree: Doctor of Philosophy Alternative splicing plays a key role in regulating gene expression, and more than 90% of human genes are alternatively spliced through different types of alternative splicing. Dysregulated alternative splicing events have been linked to a number of human diseases. Recently, high-throughput RNA-Seq technologies have provided unprecedented opportunities to better characterize and understand transcriptomes, in particular useful for the detection of splicing variants between healthy and diseased human transcriptomes. We have developed two novel algorithms and tools and a computational workflow to interrogate human transcriptomes between healthy and diseased conditions. The first is a read count-based Expectation-Maximization (EM) algorithm and tool, which is called RAEM. It estimates relative transcript isoform proportions by maximizing the likelihood in each gene. The RAEM algorithm has been encoded in our published software suite, SAMMate. We have employed RAEM to predict isoformlevel microRNA-155 targets. The second is called dSpliceType, which is a read coverage-based algorithm and tool to detect differential splicing events. It utilizes sequential dependency of normalized base-wise read coverage signals and a change-point
The Lucky language Reference Manual

The main challenge to automate a testing or a simulation process is to be able to automate the generation of realistic input sequences to feed the program. In other words, we need an executable model of the program environment which inputs are the program outputs, and which outputs are the program inputs. In the first Lurette prototype – an automated testing tool of reactive programs designed at Verimag –, the System Under Test (SUT) environment behaviour was described by Lustre observers which were specifying what realistic SUT inputs should be. In other words, the environment was modelled by a set of (linear) constraints over Boolean and numeric variables. The work of Lurette was to solve those constraints, and to draw a value among the solutions to produce one SUT input vector. But, from a language expressing power point of view, Lustre observers happen to be too restrictive, in particular to express sequences of different testing scenarios, or to have some control on the probabilistic distribution of the drawn solution. It was precisely to overcome those limitations that a new language, Lucky, was designed. A Lucky program is an interpreted automaton whose transitions define the reactions of the machine. More precisely, each transition is associated to (1) a set of constraints (a lustre-like formula) that defines the set of the possible outputs, and (2) a weight that defines the relative probability for each transitions to be taken, i.e., to be used to produce the output vector for the current step.
SEDA: An Architecture for Highly Concurrent Server Applications

SEDA is an acronym for staged event-driven architecture, and decomposes a complex, event-driven application into a set of stages connected by queues. This design avoids the high overhead associated with thread-based concurrency models, and decouples event and thread scheduling from application logic. By performing admission control on each event queue, the service can be well-conditioned to load, preventing resources from being overcommitted when demand exceeds service capacity. SEDA employs dynamic control to automatically tune runtime parameters (such as the scheduling parameters of each stage), as well as to manage load, for example, by performing adaptive load shedding. Decomposing services into a set of stages also enables modularity and code reuse, as well as the development of debugging tools for complex event-driven applications.
OTTER 3.0 Reference Manual and Guide

OTTER (Organized Techniques for Theorem-proving and Effective Research) is a resolution-style theorem-proving program for first-order logic with equality. OTTER includes the inference rules binary resolution, hyperresolution, UR-resolution, and binary paramodulation. Some of its other abilities and features are conversion from first-order formulas to clauses, forward and back subsumption, factoring, weighting, answer literals, term ordering, forward and back demodulation, evaluable functions and predicates, and Knuth-Bendix completion. OTTER is coded in C, is free, and is portable to many different kinds of computer.
GoPhone - A Software Product Line in the Mobile Phone Domain

Zusammenfassung This report provides insights into component-based product line engineering on the basis of a case study from the mobile phones domain. The reader follows the systematic creation of a hypothetical software product line according to the PuLSE TM and KobrA methods developed at Fraunhofer IESE. Scoping as well as Application and Framework Engineering are covered. Our goal was to provide as broad an overview as possible. For that reason many details haven been intentionally left out. Das diesem Bericht zugrundeliegende Vorhaben wurde mit Mitteln des Bundesministeriums für Bildung und Forschung unter dem Förderkennzeichen 01 IS A02 gefördert. Die Verantwortung für den Inhalt dieser Veröffentlichung liegt bei den Autoren.
Dynamic Language Learning Tools

In this paper, we present prototypes of individualized language learning tools. We show how Natural Language Processing (NLP) technology developed at Microsoft Research (MSR) facilitates the dynamic creation of language exercises and provides new user experiences in language learning, while raising the bar for educational technology. We demonstrate how our technology, with its rich linguistic resources, enables the dynamic creation of language exercises which are individualized and user-centric. We present some user scenarios to illustrate the flexibility and unlimited potential of our language learning tools. We show that with innovative ideas and vision, our NLP technology can shed new light on the way technology is used in language learning/teaching.
Darmstadt Knowledge Processing Repository Based on UIMA

The Ubiquitous Knowledge Processing (UKP) Group at Darmstadt University of Technology pursues the vision of using information management, information retrieval, and text mining technologies to create innovative applications, such as intuitive information access in Web 2.0 (O’Reilly, 2005) and eLearning. Thereby, semantic information processing technologies are utilized to transform unstructured information into structured knowledge for different media types, including text and handwriting. In order to support the interoperability of components created in various research projects of UKP, we decided to build upon Unstructured Information Management Architecture (UIMA) (Ferrucci and Lally, 2004), released as an open-source project by IBM in 2006. The mid-term goal is to provide a collection of software components for semantic information processing based on UIMA, called Darmstadt Knowledge Processing Software Repository (DKPro). DKPro should support semantic information processing along several dimensions, such as:
Modelisation de la longue decharge negative par des circuits electriques equivalents - Application a la foudre

Cet article presente un modele de decharge negative autonome permettant de predire le comportement de longs intervalles d'air soumis a une tension donnee. Ce modele utilise un schema electrique equivalent dont les composants varient avec le temps selon les caracteristiques du canal et de la geometrie de la decharge. Il permet de decrire les differentes phases de la propagation de la decharge negative obtenue en laboratoire et de determiner l'evolution des courants de decharge, la charge correspondante, la trajectoire de la decharge et sa vitesse. Les resultats obtenus par ce modele sont en bon accord avec les resultats experimentaux rapportes dans la litterature. Ce modele peut etre etendu a la decharge de foudre negative comme cela a ete fait pour la decharge positive, en se basant sur la grande similarite, grande etincelle-decharge atmospherique.
Dendritic Morphology : Function shapes structure

Users may download and print one copy of any publication from the public portal for the purpose of private study or research You may not further distribute the material or use it for any profit-making activity or commercial gain You may freely distribute the URL identifying the publication in the public portal Take down policy If you believe that this document breaches copyright, please contact us providing details, and we will remove access to the work immediately and investigate your claim.