Miracle-dz/UniFAR-FTUs huggingface dataset:
Design Patterns for Multimedia Mobile Applications

This paper presents a Multimedia Mobile Framework, MMF, to provide mobile applications with flexibility and reusability. The proposed framework integrates fundamental design patterns (GoF), visualization patterns, and sound patterns. The fundamental design patterns include factory method, composite, state, and flyweight after adapting them for Android environment. The visualization patterns are modified and adapted to match MMF. Eventually, the sound patterns to convert from text to speech and vice versa are introduced as new patterns for mobile applications. In all stages, the Android Activity class is employed throughout MMF patterns. To emphasize the significance of MMF, it has been relied upon to develop a multimedia editor for M-Learning applications running on Android platform. In addition, specific quality metrics were selected and the performance of such pattern based editor is quantitatively compared with that of traditionally developed one.
Providing Probabilistic Performance Guarantees in Multi-Source Video Streaming over the Internet

current best-effort Internet does not guarantee bandwidth availability between a receiver and a sender, and so renders any quality-of-service (QoS) control difficult, if not impossible. This paper approaches this QoS challenge from a different angle - streaming video not from one, but from multiple senders to a receiver. Our investigation reveals that the aggregate bandwidth from multiple senders, while still varies randomly, is far more predictable than a single sender. This increased predictability enables us to devise probabilistic QoS control algorithms to achieve near-optimal performance even in the best-effort Internet. This paper reports our initial findings from trace-driven simulations using synthetic as well as real Internet traffic traces.
When TEX and Metafont Work Together

When TEX and Metafont communicate to each other, they can do more together than they can alone. This presentation concentrates on two illustrations of this principal, and urges readers to come up with more. When TEX becomes sensitive to information passed to it from Metafont, it is possible to prepare diagrams and figures using Metafont and then to have TEX prepare labels which can be precisely positionedwithin the figure. When communication goes the other way, TEX and Metafont can prepare special purpose fonts which (among other things) can be set along curved baselines. Illustrations of both techniques are presented.
The Priority-Based Register Allocation

Global register allocation plays a major role in determining the efficacy of an optimizing compiler. Graph coloring has been used as the central paradigm for register allocation in modern compilers. A straightforward coloring approach can suffer from several shortcomings. These shortcomings are addressed in this paper by coloring the graph using a priority ordering. A natural method for dealing with the spilling emerges from this approach. The detailed algorithms for a priority-based coloring approach are presented and are contrasted with the basic graph-coloring algorithm. Various extensions to the basic algorithms are also presented. Measurements of large programs are used to determine the effectiveness of the algorithm and its extensions, as well as the causes of an imperfect allocation. Running time of the allocator and the impact of heuristics aimed at reducing that time are also measured.
Shape Modeling and GPU Based Image Warping

approved: Prof. Mike Bailey This project addresses the problems of manually placing facial landmarks on a portrait and finding a fast way to warp the annotated image of a face. While there are many approaches to automatically find facial landmarks, most of them provide insufficient results in uncontrolled environments. Thus I introduce a method to manually adjust a non-rigid shape on a portrait. This method utilizes a statistical shape model based on point distribution models. With these manually placed landmarks the image of a face can be warped into another shape. To warp the image I use a piecewise affine transformation. This way of transforming, however, tends to be computationally intense and therefore slow. Thus in the second part of the project I introduce a way to perform a piecewise affine transformation with enhanced performance using shaders in OpenGL. This project is made in collaboration with the Pedagogical University of Berne, Switzerland and will be part of a system for diversity research named chic-o-mat. Eventually the system will run on an iPhone as an application available to the public. Therefore, the provided solutions are based on iPhone programming using the multi-touch screen for the shape adjustment and the GPU of the latest iPhone 4S. A test application demonstrates up to 20X speedup performing piecewise warping using the GPU. c ©Copyright by David Burri August 14, 2012 All Rights Reserved Shape Modeling and GPU Based Image Warping
Organisation d'une masse documentaire électronique présentée à des lecteurs potentiels

Since the early 90’s, and thanks to the facilities of communication technologies developed such as the Internet, the number of electronic documents has continuously increased so that it seems more and more difficult and time-consuming for a user, drowned in this documentary space, to find relevant information. To reduce this effect of critical documentary mass and to decrease the access time to relevant resources, we describe in this article a method to organize electronic documents. This organization contains two levels: the first level being described by the concept of “points of view”, the second one by the concept of “expert key-words”. The method has to be a few time-consuming algorithm in order to be included into a real project. Résumé À l’heure où le nombre de documents électroniques ne cesse d’augmenter, et ce depuis plus de dix ans, grâce aux facilités de communication qui se sont développées, notamment l’Internet, il semble de plus en plus difficile et de plus en plus long pour un utilisateur, noyé dans cet espace documentaire, de trouver de l’information pertinente. Pour réduire cet effet de masse documentaire et diminuer le temps d’accès aux ressources importantes, nous décrivons dans cet article une méthode d’organisation de documents électroniques. La méthode doit être très simple et rapide pour s’inclure dans un système informatique réel. L’organisation est à deux niveaux : le premier niveau est décrit par la notion de « points de vue », et le second niveau par la notion de « mots experts ». Mots-clés : organisation documentaire, information, rapidité d’exécution, « points de vue », « mots experts ».
Mesh adaptation for compressible flows

We describe here some recent developments in mesh adaption for compressible viscous inviscid flow simulation. One of the most challenging task is to capture efficiently thin layers such as boundary layers, mixing layers. Two important issues, the coupling between mesh and flow, and the use of flat elements for stretching are considered in the case of deformation mesh systems.
On shared systems

﻿ Most computing systems are shared between users of various kinds. This thesis treats such systems as mathematical objects, and investigates two of their properties: refinement and security. The first is the analysis of the conditions under which one shared system can be replaced by another, the second the determination of a measure of the information flow through a shared system. Under the heading of refinement we show what it means for one shared system to be a suitable replacement for another, both in an environment of co-operating users and in an environment of independent users. Both refine- ment relations are investigated, and a large example is given to demonstrate the relation for cooperating users. We show how to represent the security of a shared system as an 'inference function', and define several security properties in terms of such functions. A partial order is defined on systems, with the meaning 'at least as secure as'. We generalise inference functions to produce 'security specifications' which can be used to capture the desired degree of security in any shared system. We define what it means for a shared system to meet a security specification and indicate how implementations may be derived from their specifications in some cases. A summary of related work is given.
Bayesian Non-Linear Modelling with Neural Networks

Neural networks are parameterized non-linear models used for empirical regression and classii-cation modelling. Their exibility makes them able to discover more complex relationships in data than traditional statistical models. Bayesian probability theory provides a unifying framework for data modeling which ooers several beneets. First, the overrtting problem can be solved by using Bayesian methods to control model complexity. Second, probabilistic modelling handles uncertainty in a natural manner. There is a unique prescription, marginalization, for incorporating uncertainty about parameters into predictions. Third, we can deene more sophisticated probabilistic models which are able to extract more information from data. I will discuss the practical application of these methods to time series prediction of a building's energy consumption, and prediction of weld toughness.
Mechanistic Bayesian Networks for Integrating Knowledge and Data to Unravel Biological Complexity

The determination of how protein interactions affect gene regulation is an important problem in systems biology. By identifying quantitative relationships between the interactome and transcriptome in complex pathologies, we can better characterize dysfunctional pathways, generate further hypotheses and identify potential targets for therapeutic interventions. This thesis develops methods and software for elucidating biological networks consistent with known mechanisms using Bayesian networks (BN) and high-throughput datasets in a novel methodology termed Mechanistic Bayesian networks (MBN). This thesis contributes new algorithms for data pre-processing and evaluating hidden variable models that are implemented in PEBL, an open-source library for MBN modeling with features unmatched by other software. Due to its ease of use and extensibility, PEBL allows one to run large, distributed analyses using cloud-computing platforms. MBN are used to identify the targets of the Sonic hedgehog signaling pathway that is implicated in development and cancer progression. The use of hidden variable models and the ability of BN to capture nonlinear, combinatorial and stochastic relationships identifies known and novel targets that are more biologically meaningful and outperforms other BN and non-BN methods. The approach developed is useful for identifying pathway targets, upstream regulators or, more generally, to identify additional components of partially-characterized topologies. MBN are next applied to identify subnetworks of the global interactome that govern gene expression during the epithelial-mesenchymal transition (EMT), a developmental process implicated in cancer metastasis. By modeling the effects of a protein interaction on downstream genes, a scoring metric was developed that quantifies the relevance of interactions to EMT. Application of the method to a cell-line lung cancer dataset identifies a core subnetwork that recapitulates EMT biology and makes predictions about protein interactions and their targets. Because the method does not rely on differential expression or the co-regulation assumptions, it is equally useful for microRNA-target, protein-DNA or
Hardware Synthesis From a Traditional Programming Language

An apparatus such as a printing apparatus employing an ink fountain assembly which includes a roller and metering blade, supported between housing walls for purposes of metering ink in the course of a printing operation. Seals are provided for sealing against leakage of ink in the region of the assembly where the roller ends are journalled for rotation. The seals comprise compressible, annular members mounted at each end of the roller. The seals define mating surfaces for engaging with mounting elements so that the seals are held against rotation as the printing operation takes place. The seals are compressed to provide a snug fit with the roller ends, and they define surfaces which develop a minimum of friction with these engaging roller ends.
Bilingual conversation interpreter : a prototype interactive message translator. Final report

This document is the final report for a research project aimed at producing a prototype system for on-line translation of typed dialogues between speakers of different natural languages. The work was carried out jointly by SICS and SRI Cambridge. The resulting prototype system (called Billingual Conversation Interpreter, or BCI) translates between english and Swedish in both directions.The Major components of the BCI are two copies of the SRI Core Language Engine, equipped with English and Swedish grammars respectively. These are linked by the transfer and disambiguation components. Translation takes place by analyzing the source-language sentence into Quasi Logical Form ( QLF), a linguistically motivated logical representation, transferring this into a target-language QLF, and generating a target-language sentence. When ambiguities occur that cannot be resolved automatically, they are clarified by Querying the appropriate user. The clarification dialogue presupposes no knowledge of either linguistics or the other language. The prototype system has a broad grammatical coverage, a initial vocabulary of about 1000 words together with vocabulary expansion tools, and a set of English-Swedish transfer rules. The formalism developed for coding this linguistic information make it relatively easy to extend the system. We believe that the project was successful in demonstrating the feasibility of using these techniques for interactive translation applications, and provides a sound basis for development of a large scale message translator system with potential for commercial exploitation.The main sections of this report are the following: * A non-technical introduction, summarizing the BCI's design , and containing a sample session. * An overview of the Swedish version of the CLE. * A detailed discussion of the theory and practice of QLF transfer. * A description of the interactive disambiguation method. * Suggestions for possible follow-on projects aimed in the direction of practically usable commercial systems.
Free Greenius – New Options and Availability

Recent model extensions of the software Greenius are introduced, namely the simulation of absorption chillers and the addition of user defined operating strategies. Furthermore the impact of considering or neglecting the thermal inertia of HTF inventory and piping in annual performance calculation is discussed as well as the required temporal resolution for these simulations. A new free version of Greenius with full functionality is going to be published soon.
EVALUATING INTRANET IMPLEMENTATIONS

This work in progress proposes a methodology to assess the implementation of Intranets. This study proposes a measure of Intranet implementations in terms of organizational effectiveness and to identify the effect, if any, of the organizations management infrastructure. The results will guide future research and it will provide practitioners with useful guidelines for future Intranet implementations.
Seks en de evolutie

De titel, Seks en de evolutie, geeft in een notendop weer waar deze cursus over gaat. We laten ons licht schijnen op de relatie tussen onze evolutionaire geschiedenis enerzijds en de verhoudingen tussen man en vrouw anderzijds. Hierbij concentreren we ons op de psychologische aspecten van het onderwerp. De cursus laat zien hoe in onze evolutionaire geschiedenis de belangen van man en vrouw met elkaar verstrengeld zijn, en wat de consequenties daarvan zijn voor de relatie tussen man en vrouw in hun dagelijks leven.
Unsupervised context sensitive language acquisition from large, untagged corpora

A central tenet of generative linguistics is that extensive innate knowledge of grammar is essential to explain the acquisition of language from positive-only data (Chomsky, 1986). We explore an alternative hypothesis, according to which syntax is an abstraction that emerges from exposure to language (Hopper, 1998), coexisting with the corpus data within the same representational mechanism. Far from parsimonious, the representation we introduce allows partial overlap of linguistic patterns or constructions (Croft, 2001). The incremental process of acquisition of patterns is driven both by structural similarities and by statistical information inherent in the data, so that frequent strings of similar composition come to be represented by the same pattern. The degree of abstraction of a pattern varies: it may be high, as in the case of a frame with several slots, each occupied by a member of an equivalence class associated with it, or low, as in the extreme case of idioms or formulaic language snippets, where there is no abstraction at all (Langacker, 1987; Wray, 2002). The acquired patterns represent fully the original data, and, crucially, enable structure-sensitive generalization in the production and the assimilation of unseen examples. The ADIOS (Automatic DIstillation Of Structure) model has two components: (1) a representational data structure, which is a directed multi-graph, and (2) a Pattern Acquisition (PA) algorithm that progressively refines the graph in an unsupervised fashion. The PA algorithm aims to detect significant patterns (SPs): similarly structured sequences of primitives that recur in the corpus. Each SP has an associated equivalence class (EC), which is a set of alternative primitives that may fit into the slot in the SP to construct a given path through the graph (see Figure 1a). The manner whereby the model supports generalization is exemplified in Figure 1c. The algorithm requires neither prior classification of the primitives into syntactic categories, nor even a pre-setting of their scope: it can bootstrap itself from a corpus in which all the words have been broken down into their constituent characters. The algorithm repeatedly scans the graph for significant patterns (SPs), which are then used to modify it. Each SP consists of a non-empty prefix (a sequence of graph edges), an equivalence class of vertices, and a non-empty suffix (another sequence of edges; cf. Figure 1(a)). For each path path i , the algorithm constructs a set s j = {p 1 ,. , p m } of paths of …
The Java 3d API Specification with Cdrom

From the Book: PREFACE: This document describes the Java 3D™ API, version 1.2, and presents some details on the implementation of the API. This specification is not intended as a programmer's guide. This specification is written for 3D graphics application programmers. We assume that the reader has at least a rudimentary understanding of computer graphics. This includes familiarity with the essentials of computer graphics algorithms as well as familiarity with basic graphics hardware and associated terminology. Related Documentation This specification is intended to be used in conjunction with the browser-accessible, javadoc-generated API reference. Style Conventions The following style conventions are used in this specification: Lucida type is used to represent computer code and the names of files and directories. Bold Lucida type is used for Java 3D API declarations. Bold type is used to represent variables. Italic type is used for emphasis and for equations. Changes to the Java 3D API, version 1.2, are indicated by an icon in the margin. The icon ("New in 1.2" enclosed in arrows) appears in the outside margin for all new methods and constructors. Programming Conventions Java 3D uses the following programming conventions: The default coordinate system is right-handed, with +y being up, +x horizontal to the right, and +z directed toward the viewer. All angles or rotational representations are in radians. All distances are expressed in units or fractions ofmeters. Acknowledgments We gratefully acknowledge Warren Dale for writing the Sound API portion of this specification and Daniel Petersen for writing the scene graph sharing portion of the specification. We especially acknowledge Bruce Bartlett for his invaluable assistance with the editing, formatting, and indexing of the specification. Without Bruce's considerable help, this book would not have been possible. We also thank the many individuals and companies that provided comments and suggestions. They have improved the Java 3D API. Henry Sowizral Kevin Rushforth Michael Deering Sun Microsystems, Inc. April 2000 0201710412P04062001
Declarative Language Denitions and Code Generation as Linearization

This paper presents a compiler for a fragment of the C programming language, with JVM (Java Virtual Machine) as target language. The compiler is implemented in a purely declarative way: its denition consists of an abstract syntax of program structures and two concrete syntaxes matching the abstract syntax: one for C and one for JVM. From these grammar components, the compiler is derived by using the GF (Grammatical Framework) grammat tool: the front end consists of parsing and semantic checking in accordance to the C grammar, and the back end consists of linearization in accordance to the JVM grammar. The tool provides other functionalities as well, such as decompilation and interactive editing.
Introducing numerical analysis tools in engineering: a Scilab user case in electronics course

Software tools in education became popular since the widespread of personal computers. Engineering courses lead the way in this development and these tools became almost a standard. Engineering graduates are familiar with numerical analysis tools but also with simulators (e.g. electronic circuits), computer assisted design tools and others, depending on the degree. One of the main problems with these tools is when and how to start use them so that they can be beneficial to students and not mere substitutes for potentially difficult calculations or design. In this paper a software tool to be used by first year students in electronics/electricity courses is presented. The growing acknowledgement and acceptance of open source software lead to the choice of an open source software tool – Scilab, which is a numerical analysis tool – to develop a toolbox. The toolbox was developed to be used as standalone or integrated in an e-learning platform. The e-learning platform used was Moodle. The first approach was to assess the mathematical skills necessary to solve all the problems related to electronics and electricity courses. Analysing the existing circuit simulators software tools, it is clear that even though they are very helpful by showing the end result they are not so effective in the process of the students studying and self learning since they show results but not intermediate steps which are crucial in problems that involve derivatives or integrals. Also, they are not very effective in obtaining graphical results that could be used to elaborate reports and for an overall better comprehension of the results. The developed tool was based on the numerical analysis software Scilab and is a toolbox that gives their users the opportunity to obtain the end results of a circuit analysis but also the expressions obtained when derivative and integrals calculations, plot signals, obtain vector diagrams, etc. The toolbox runs entirely in the Moodle web platform and provides the same results as the standalone application. The students can use the toolbox through the web platform (in computers where they don't have installation privileges) or in their personal computers by installing both the Scilab software and the toolbox. This approach was designed for first year students from all engineering degrees that have electronics/electricity courses in their curricula.