Miracle-dz/UniFAR-FTUs huggingface dataset:
System-level Prototyping with HyperTransport

The complexity of computer systems continues to increase. Emulation of proposed subsystems is one way to manage this growing complexity when evaluating the performance of proposed architectures. HyperTransport allows researchers to connect directly to microprocessors with FPGAs. This enables the emulation of novel memory hierarchies, non-volatile memory designs, coprocessors, and other architectural changes, combined with an existing system.
Comparative Study of the Parallelization of the Smith-Waterman Algorithm on OpenMP and Cuda C

In this paper, we present parallel programming approaches to calculate the values of the cells in matrix’s scoring used in the Smith-Waterman’s algorithm for sequence alignment. This algorithm, well known in bioinformatics for its applications, is unfortunately time-consuming on a serial computer. We use formulation based on anti-diagonals structure of data. This representation focuses on parallelizable parts of the algorithm without changing the initial formulation of the algorithm. Approaching data in that way give us a formulation more flexible. To examine this approach, we encode it in OpenMP and Cuda C. The performance obtained shows the interest of our paper.
Ambientes de Desenvolvimento Integrado no Apoio ao Ensino da Linguagem de Programação Haskell

A linguagem Haskell e comumente utilizada em universidades para ensino do paradigma de programacao funcional. Neste artigo, defende-se que o uso de um ambiente de desenvolvimento integrado (Integrated Development Environment - IDE) e vantajoso para apoiar o ensino e o aprendizado desta linguagem. Nesta linha, apresenta-se primeiramente uma analise comparativa de IDEs disponiveis para Haskell e, em seguida, relata-se uma experiencia realizada utilizando-se o IDE Eclipse em sala de aula. Os resultados contribuem para a adocao deste tipo de ferramenta no ensino de Haskell.
Current-mode continuous-time filters: two design approaches

Two different ways of implementing current-mode analog signal filtering are proposed. A practical comparison of filter structures using programmable current mirrors and single transistors as current integrators versus filters using an approach involving transconductors and current replica circuits is presented. Experimental results for a bandpass filter using the current mirror approach are presented and discussed. <<ETX>>
Using active learning in college class : a range of options for faculty

In this volume the authors take a second look at the use of active learning in higher education. The chapters describe the concept of the active learning continuum and tie various practical examples of active learning to that concept. They illustrate how important it is to consider context in the design of active learning to get maximum benefit. This is the 67th issue of the journal "New Directions for Teaching and Learning".
Evaluating four and five-year old children's responses to interactive television programs

While it is commonly believed that 'interactive' media provides benefits to young children not obtained from 'non-interactive' media, there has been little research examining this issue, or the kinds of interactivity that elicit these benefits. The present study examined the attention, comprehension, and enjoyment of young children viewing different kinds of interactive television programs compared with those of children viewing the control prototype (non-interactive) programs. Three interactive prototypes and one control prototype of Dora the Explorer, Hi-5, and Play School were examined on these outcome measures. The interactive prototypes allowed participants to make simple choices about program content using a television remote control. Four hundred and ninety eight children aged four (49.4%) and five (50.6%) years individually viewed one of the prototypes, and the children's attention, comprehension, and enjoyment were examined. Participants were boys (49.7%) and girls (50.3%) drawn from Government (64.9%), Catholic (27.6%) and Independent (7.4%) schools in Perth, Western Australia. Significantly higher attention, comprehension, or both were found for children interacting with two of the prototypes allowing increased viewer participation compared to children viewing the control prototype prototypes. Interactive prototypes allowing participants to repeat sections of program content also elicited significantly higher comprehension than control prototypes. However, interactive prototypes allowing participants to customise aspects of the program did not result in differences in the outcome measures compared with control prototypes. It was also found that interactive prototypes offering participants narrative choices were associated with significantly lower attention, comprehension or enjoyment for either interacting or non-interacting participants compared to the control prototypes. It is argued that interactivity, per se, does not bestow any benefits, with only specific models of interactivity resulting in higher comprehension or attention. In fact, some applications allowing young children to make choices about program narrative appears to disrupt program comprehension. It is concluded that successful interactivity builds upon the features of well-designed traditional children's television; opportunities for increased participation, and the repetition of content.
Computational Analysis, Design, and Experimental Validation of Antibody Binding Anity Improvements Beyond In Vivo Maturation

This thesis presents novel methods for the analysis and design of high-affinity protein interactions using a combination of high-resolution structural data and physics-based molecular models. First, computational analysis was used to investigate the molecular basis for the affinity improvement of over 1000-fold of the fluorescein-binding antibody variant 4M5.3, engineered previously from the antibody 4-4-20 using directed evolution. Electrostatic calculations revealed mechanistic hypotheses for the role of four mutations in a portion of the improvement, subsequently validated by separate biochemical experiments. Next, methods were developed to computationally redesign protein interactions in order to rationally improve binding affinity. In the anti-lysozyme model antibody D1.3, modest binding improvements were achieved, with the results indicating potentially increased sucesss using predictions that emphasize electrostatics, as well as the need to address the over-prediction of large amino acids. New methods, taking advantage of the computed electrostatics of binding, yielded robust and significant improvements for both model and therapeutic antibodies. The antibody D44.1 was improved 140-fold to 30 pM, and the FDA-approved antibody cetuximab (Erbitux) was improved 10-fold to 52 pM, with an experimental success rate of greater than 60% for single mutations designed to remove undersatisfied polar groups or improve misbalanced electrostatic interactions. Finally, a physics-based improvement to the calculation of the nonpolar component of solvation free energy was implemented and parameterized to address the over-prediction of large amino acids. These results demonstrate novel computational capabilities and indicate their applicability for enhancing and accelerating development of reagents and therapeutics. Thesis Supervisor: Bruce Tidor Title: Professor of Biological Engineering and Computer Science
Equations in Mathematical Physics: A practical course

Mathematical modeling and numerical simulation in fluid mechanics are topics of great importance both in theory and technical applications. The present book attempts to describe the current status in various areas of research. The 10 chapters, mostly survey articles, are written by internationally renowned specialists and offer a range of approaches to and views of the essential questions and problems. In particular, the theories of incompressible and compressible Navier-Stokes equations are considered, as well as stability theory and numerical methods in fluid mechanics. Although the book is primarily written for researchers in the field, it will also serve as a valuable source of information to graduate students.
A 17 dB gain, 0.1-70 GHz InP HEMT amplifier IC

Over the last five years, the 0.1 /spl mu/m gate length indium phosphide high electron mobility transistor (InP HEMT) has been taken from first demonstration to a high-yield, manufacturable monolithic microwave integrated circuit (MMIC) process. Discrete InP HEMT devices have shown transconductances (g/sub m/) as high as 1740 mS/mm and cutoff frequencies (f/sub T/) up to 340 GHz and thus are extremely attractive devices for high gain amplifiers in the 30-100 GHz range. For very broadband instrumentation applications, this process is used to realize a fully-integrated, three-stage, shunt-feedback amplifier with 17 dB gain from 100 MHz to 70 GHz, a gain-bandwidth product the authors believe to be the highest reported for any amplifier. In comparison to distributed amplifiers typically used for such broadband applications, this amplifier has higher gain, better low-frequency response, uses less dc power, and yet has good output power capability. Potentially low-cost MMICs of this type could open the millimeter-wave frequencies to commercial applications. <<ETX>>
The Application of Support Vector Machines to Medical decision Support: A Case Study

Support Vector Machines have been successfully applied to a number of classiication and regression tasks. This paper outlines their successful application to a medical decision support task aimed at improving the diagnosis of tuberculosis infection. The standard method for diagnosis of tuberculosis is the visual identiication of tubercle bacilli in stained sputum smears. The proposed technique based on image capture, image processing and classiication of image objects is expected to be more accurate than human visual screening. In this application a Support Vector Machine is successfully used for the classiication of image objects. This application is one example of a much broader class of medical imaging tasks to which Support Vector Machines could be applied.
Concurrent Lazy Splay Tree with Relativistic Programming Approach

A splay tree is a self-adjusting binary search tree in which recently accessed elements are quick to access again. Splay operation causes the sequential bottleneck at the root of the tree in concurrent environment. The Lazy splaying is to rotate the tree at most one per access so that very frequently accessed item does full splaying. We present the RCU (Read-copy-update) based synchronization mechanism for splay tree operations which allows reads to occur concurrently with updates such as deletion and restructuring by splay rotation. This approach is generalized as relativistic programming. The relativistic programming is the programming technique for concurrent shared-memory architectures which tolerates different threads seeing events occurring in diﬀerent orders, so that events are not necessarily globally ordered, but rather subject to constraints of per-thread ordering. The main idea of the algorithm is that the update operations are carried out concurrently with traversals/reads. Each update is carried out for new reads to see the new state, while allowing pre-existing reads to proceed on the old state. Then the update is completed after all pre-existing reads have completed.
The Anatomy of Major Projects

Fuel-powered engines are operated in combination with a catalytic converter for the conversion of low octane fuel to high octane fuel which is then introduced into the engine to provide light high octane components for burning in the engine. The catalytic converter includes a catalyst chamber containing a crystalline aluminosilicate catalyst having an alpha value of at least five and preferably of the ZSM-5 or ZSM-8 type of zeolite. On passage through the catalytic converter, low octane fuel is converted to high hydrocarbon gases and introduced into the engine for burning.
Comparing Effectiveness in TDT and IR

Abstract : Many of the research tasks in Topic Detection and Tracking have counterparts in Information Retrieval research. However, the two research communities evaluate their tasks differently, which makes it very difficult to determine the extent to which they can help each other. In this study, we compare the performance of TDT tracking task to the IR filtering task, and show that they have nearly identical effectiveness. We also show a method for using tracking to predict error rates for the TDT First Story Detection (FSD) task. We then show that FSD performance is what tracking predicts. More importantly, we show that with current approaches, FSD performance has probably reached the limits of effectiveness.
Analysis of speedup in distributed algorithms

We present and analyze several practical parallel algorithms for multicomputers. Chapter four presents two distributed algorithms for implementing alpha-beta search on a tree of processors. Each processor is an independent computer with its own memory and is connected by communication lines to each of its nearest neighbors. Measurements of the first algorithm's performance on the Arachne distributed operating system are presented. For each algorithm, a theoretical model is developed that predicts speedup with arbitrarily many processors. Chapter five shows how locally-defined iterative methods give rise to natural multicomputer algorithms. We consider two interconnection topologies, the grid and the tree. Each processor (or terminal processor in the case of a tree multicomputer) engages in serial computation on its region and communicates border values to its neighbors when those values become available. As a focus for our investigation we consider the numerical solution of elliptic partial differential equations. We concentrate on the Dirichlet problem for Laplace's equation on a square region, but our results can be generalized to situations involving arbitrarily shaped domains (of any number of dimensions) and elliptic equations with variable coefficients. Our analysis derives the running time of the grid and the tree algorithms with respect to per-message overhead, per-point communication time, and per-point computation time. The overall result is that the larger the problem, the closer the algorithms approach optimal speedup. We also show how to apply the tree algorithms to non-uniform regions. A large-network algorithm solves a problem of size N on a network of N processors. Chapter six presents a general method for transforming large-network algorithms into quotient-network algorithms, which solve problems of size N on networks with fewer processors. This transformation allows algorithms to be designed assuming any number of processing elements. The implementation of such algorithms on a quotient network results in no loss of efficiency, and often a great savings in hardware cost.
Postmodern Literacy

In this chapter, the author reflects on the importance of today's literality in terms of multimodal reading and literary competence. This competence should include a multidimensional ability and contribute significantly to enrich life. An adequate multimodality is also presented as a co-constructive creation of meanings, so that didactic preconditions for the reception of mulitmodal texts are irreplaceable. As an example of dealing with multimodal texts in the classroom, conceptual foundations of postmodern texts are presented, which also include hypertextual and intertextual reading as part of a new learning experience. This is why practical suggestions and didactic aspects of literary communication are illustrated as a prerequisite for a successful classroom conversation, which should enable the reader to become an intellectual accomplice of the author.
Ferroelectric non-volatile memory

The development of a monolithic 512-bit ferroelectric nonvolatile memory addressed by CMOS circuitry is discussed. This development has demonstrated technical feasibility and has allowed the production of the first 16 K universal random access memory called UniRAM. The 16 K UniRAM is intended to have a 100-ns Read/Write access time, unlimited write capability, and function over the military temperature range. The device characteristics and future applications as related to the aerospace industry are discussed. <<ETX>>
Hybrid-search and storage of semi-structured information

Given today's tangle of digital information, one of the hardest tasks for information systems users is nding anything in the mess. For a number of well documented reasons including the amazing growth in the Internet's popularity and the drop in the cost of storage, the amount of information on the net, as well as on a user's local computer has increased dramatically in recent years. Although this readily available information should be extremely bene cial for computer users, paradoxically it is now much harder to nd anything. Many di erent solutions have been proposed to the general information seeking task of users, but few if any have addressed the needs of individuals or have leveraged the bene t of single-user interaction. The Haystack project is an attempt to answer the needs of the individual user. Creating such a system requires solving two problems. Half the problem addresses the manipulation of the data into a queryable format. Once the user's information is represented in Haystack, the other half of the problem centers around our desire to answer the highly varied questions a user may ask about this information. In this thesis we will propose a means of representing information in a robust model within Haystack and we will describe a corresponding mechanism by which the diverse questions of the individual can be answered. This novel method functions by using a combination of existing information systems. We will call this combined system a hybrid-search system. Thesis Supervisor: David R. Karger Title: Associate Professor Thesis Supervisor: Lynn Andrea Stein Title: Associate Professor
Hierarchical mobile IPv6 mobility management

This document introduces extensions to Mobile IPv6 and IPv6 Neighbour Discovery to allow for local mobility handling. Hierarchical mobility management for Mobile IPv6 is designed to reduce the amount of signalling between the Mobile Node, its Correspondent Nodes, and its Home Agent. The Mobility Anchor Point (MAP) described in this document can also be used to improve the performance of Mobile IPv6 in terms of handover speed.
Asynchronous spike event coding scheme for programmable analogue arrays and its computational applications

This work is the result of the definition, design and evaluati on of a novel method to interconnect the computational elements commonly known as Configurable Analogue Blocks (CABs) of a programmable analogue array. This method is proposed for t otal or partial replacement of the conventional methods due to serious limitations of the latt r in terms of scalability. With this method, named Asynchronous Spike Event Coding (AS EC) scheme, analogue signals from CABs outputs are encoded as time instants (spike events ) dependent upon those signals activity and are transmitted asynchronously by employing t he Address Event Representation (AER) protocol. Power dissipation is dependent upon input s ignal activity and no spike events are generated when the input signal is constant. On-line, programmable computation is intrinsic to ASEC sch eme and is performed without additional hardware. The ability of the communication scheme to perform computation enhances the computation power of the programmable analogue array. T he design methodology and a CMOS implementation of the scheme are presented together wi th test results from prototype integrated circuits (ICs). Declaration of originality I declare that this thesis was composed by myself, that the wo rk c ntained herein is my own except where explicitly stated otherwise in the text, that t is work was developed in the School of Engineering at The University of Edinburgh and that this w ork has not been submitted for any other degree or professional qualification except as spe cified. Luiz Carlos Paiva Gouveia
Contribution à une approche de modélisation et à un flot d'exploration destinés à des architectures MPSoC hétérogènes basées sur des processeurs configurables

Dans le domaine de l'electronique pour la consommation de masse, les concepteurs sont tenus de fournir des systemes embarques qui doivent satisfaire des exigences de performance, de consommation, de co? t et de temps de mise sur le marche. Pour satisfaire toutes ces exigences, nous nous concentrons sur les systemes sur puce multi-processeurs (MPSoCs) avec des processeurs configurables et des architectures heterogenes. Compares aux processeurs generalistes et aux circuits specifiques a une application (ASICs), les processeurs configurables peuvent etre utilises pour equilibrer le rapport performance/nombre de transistors et la flexibilite. Dans cette these, les architectures heterogenes sont definies comme un groupe de processeurs qui sont basees sur le meme jeu d'instructions avec des extensions differentes. Cette these tente de resoudre les difficultes causees par les processeurs configurables et les architectures heterogenes. En raison des processeurs configurables et de l'heterogeneite, le champ des solutions d'implementation devient extremement large et inclue des aussi bien des optimisations logicielles que des optimisationsmaterielles. C'est pourquoi nous presentons 4 niveaux d'abstraction differents avec des niveaux de detail et des vitesses de simulation differentes pour faciliter l'exploration des solutions d'implementation. La methode de simulation hybride est egalement integrees a ces niveaux d'abstraction pour eviter les efforts d'adaption du logiciel dependant du materiel (HdS pour Hardware dependant Software). En utilisant ces niveaux d'abstraction appliques a ce genre de plateformes heterogenes et configurables, nous avons construit un flot base sur une exploration de l'ensemble des solutions d'implementations sur des criteres de budget. Realiser une interface materiel/logiciel bien equilibree est une tache complexe. Pour resoudre ce probleme, nous utilisons le concept de graphe de dependance des services (GdS) pour modeliser l'interface materiel/logiciel. Pour que l'implementation choisie soit hautement performante et flexible, nous proposons un schema de migration de taches dans lequel une tache peut etre executee sur plusieurs processeurs compatibles avec differentes extensions d'instructions. Une application decodeur Motion-JPEG a ete utilisee pour valider tous ces travaux.
A Summary of Research on Model Identification and Target Tracking of Non-cooperative Target

This paper is a survey which mainly studies the model identification and target tracking of the noncooperative target with no visual feature in space. In order to achieve a visual model for non-cooperative target recognition and attitude tracking, we introduce a compressed sensing and particle filter method, especially no prior knowledge of the visual target. Topics include: (1)research on image reconstruction of non-cooperative target based on compressed sensing; (2)research on visual model Identification to non-cooperative targets; (3)research on attitude estimate and target tracking to non-cooperative target gesture based on multiregional joint particle filter. The aims of this paper are: to give sparse reconstruction algorithms for the high dimension image, to give visual model identification method for the non-cooperative target with no visual feature, to solve the problems of attitude estimation and tracking of on-cooperative target based on identification model. Finally, a systematic solution will be given for the docking or capture mission to spacecraft especially the noncooperative target in space.