Miracle-dz/UniFAR-FTUs huggingface dataset:
Curve and Surface Reconstruction

Many applications in science and engineering require a digital model of a real physical object. Advanced scanning technology has made it possible to scan such objects and generate point samples on their boundaries. This book, first published in 2007, shows how to compute a digital model from this point sample. After developing the basics of sampling theory and its connections to various geometric and topological properties, the author describes a suite of algorithms that have been designed for the reconstruction problem, including algorithms for surface reconstruction from dense samples, from samples that are not adequately dense and from noisy samples. Voronoi- and Delaunay-based techniques, implicit surface-based methods and Morse theory-based methods are covered. Scientists and engineers working in drug design, medical imaging, CAD, GIS, and many other areas will benefit from this first book on the subject.
Linux System Programming: Talking Directly to the Kernel and C Library

This book is about writing software that makes the most effective use of the system you're running on -- code that interfaces directly with the kernel and core system libraries, including the shell, text editor, compiler, debugger, core utilities, and system daemons. The majority of both Unix and Linux code is still written at the system level, and Linux System Programming focuses on everything above the kernel, where applications such as Apache, bash, cp, vim, Emacs, gcc, gdb, glibc, ls, mv, and X exist. Written primarily for engineers looking to program (better) at the low level, this book is an ideal teaching tool for any programmer. Even with the trend toward high-level development, either through web software (such as PHP) or managed code (C#), someone still has to write the PHP interpreter and the C# virtual machine. Linux System Programming gives you an understanding of core internals that makes for better code, no matter where it appears in the stack. Debugging high-level code often requires you to understand the system calls and kernel behavior of your operating system, too. Key topics include: An overview of Linux, the kernel, the C library, and the C compilerReading from and writing to files, along with other basic file I/O operations, including how the Linux kernel implements and manages file I/OBuffer size management, including the Standard I/O libraryAdvanced I/O interfaces, memory mappings, and optimization techniquesThe family of system calls for basic process managementAdvanced process management, including real-time processesFile and directories-creating, moving, copying, deleting, and managing themMemory management -- interfaces for allocating memory, managing the memory you have, and optimizing your memory accessSignals and their role on a Unix system, plus basic and advanced signal interfacesTime, sleeping, and clock management, starting with the basics and continuing through POSIX clocks and high resolution timers With Linux System Programming, you will be able to take an in-depth look at Linux from both a theoretical and an applied perspective as you cover a wide range of programming topics.
Information sharing in academic communities: Types and levels of collaboration in information seeking and use.

Research and theories of information behavior have traditionally focused on the "information man," i.e., on the individual as a seeker and user of information. The collective aspects of information behavior have been conceptualized, for instance, as consulting, informal seeking, use of person sources, and peer influence. These conceptualizations suggest a one-way process in which an individual consults another individual, however, information acquisition and filtering often is undertaken as a collective and collaborative effort. The paper develops a conceptual framework for the description of types and levels of information sharing in relation to document retrieval in academic communities. The concepts of strategic information sharing, paradigmatic information sharing, directive information sharing, and social information sharing are introduced to describe differences in the goals and purposes of information sharing in different groups and contexts of interaction.
Pikiuuring õpetajaks õppijate professionaalse identideedi kujunemisest

Artiklis antakse ulevaade viieaastase pikiuuringu tulemustest, keskendudes uuringus osalenud uliopilastega opetajakoolituse lopus tehtud intervjuudele ( N = 13). Artiklis otsitakse vastust kusimustele, kuidas opetajakoolituse lopetanud tudengid interpreteerivad enda opetaja identiteedi kujunemist opingute kaudu; milline on see opetaja identiteet, mille poole soovitakse puuelda, lahtudes opetaja ideaalist; ning millised on need pohitegurid, mis on mojutanud tulevase opetaja arusaamu opingute kaigus. Mittestruktureeritud intervjuus kasutati taustinfona ja intervjueeritavate malutugedena nende poolt kolmel opinguaastal kirja pandud metafoore opetaja rolli kohta ning kusimustiku abil kogutud infot. Intervjuudest ja varasematest kusitlustest saadud info korvutamine ning analuus voimaldavad paremini moista aspekte, mis mojutavad tulevaste opetajate professionaalse identiteedi kujunemist. Tulemuste pohjal voib oelda, et opetajakoolitust alustatakse naiivse ettekujutusega opetaja toost, lahtudes isiklikust varasemast koolikogemusest. Aine- ja klassiopetajad vaartustavad opetaja ideaali kirjeldamisel eri aspekte. Arusaamad opetaja toost ja rollist muutuvad opingute jooksul komplekssemaks, opetajakoolituse lopus vaartustatakse enim pedagoogilist asjatundlikkust. Koige tugevamalt mojutab tulevase opetaja arusaamu aga pedagoogiline praktika. Uurimuse tulemused voimaldavad paremini moista algajate opetajate arengut opingute jooksul ning annavad viiteid opetajate koolitajatele, kuidas tohusamalt toetada professionaalse identiteedi kujunemist kui uht olulist aspekti opetajahariduse omandamisel. Summary
Ranking USPTO Patent Documents by Importance Using Random Surfer Method (PageRank)

This study attempted to construct an alternative method for ranking patents by their importance in order to improve the existing techniques of determining citation weighted patent stocks. We apply the random surfer PageRank method to the problem of ranking the importance of the patent documents issued to inventors by the United States Patent and Trademark Office. PageRank patent importance weights turn out to differ systematically from the weights based on the number of backward or forward citations. Yet PageRanks perform similarly to the knowledge transfer indicator, which is the ratio of forward to backward citations.
Classification of phylogenetic data via Bayesian mixture modelling

Conventional probabilistic models for phylogenetic inference assume that an evolutionary tree,andasinglesetofbranchlengthsandstochasticprocessofDNA evolutionare sufficient to characterise the generating process across an entire DNA alignment. Unfortunately such a simplistic, homogeneous formulation may be a poor description of reality when the data arise from heterogeneous processes. A well-known example is when sites evolve at heterogeneous rates. This thesis is a contribution to the modelling and understanding of heterogeneityin phylogenetic data. Weproposea methodfor the classificationof DNA sites based on Bayesian mixture modelling. Our method not only accounts for heterogeneous data but also identifies the underlying classes and enables their interpretation. We also introduce novel MCMC methodology with the same, or greater, estimation performance than existing algorithms but with lower computational cost. We find that our mixture model can successfully detect evolutionary heterogeneity and demonstrate its direct relevance by applying it to real DNA data. One of these applications is the analysis of sixteen strains of one of the bacterial species that cause Lyme disease. Results from that analysis have helped understanding the evolutionary paths of these bacterial strains and, therefore, the dynamics of the spread of Lyme disease. Our method is discussed in the context of DNA but it may be extendedto othertypesof molecular data. Moreover,the classification scheme thatwe propose is evidence of the breadth of application of mixture modelling and a step forwards in the search for more realistic models of theprocesses that underlie phylogenetic data.
Triple Module Redundancy Design Techniques for Virtex FPGAs, Application Note 197

The present invention relates to compositions for the treatment of the skin containing up to 25% by weight of at least one N-polyhydroxyalkyl-amine of the formula wherein R1 is hydrogen, lower alkyl, hydroxy-lower alkyl or aminoalkyl, as well as heterocyclic aminoalkyl, R is the same as R1 except that both cannot be hydrogen at the same time, R2 is -CH2OH or -COOH, m is the integer 3 or 4, and n is the integer O, or, when m is 3 and R2 is -CH2OH, 1; and the method of skin treatment therewith.
On using wavelets for detecting attacks to web-based applications

Detection attacks to web-based applications have recently received considerable attention, specially intrusion detection system (IDS) for use with HTTP. This work present the use of signal techniques to detect abnormal behavior in query send to web servers by application users. More specifically, we use wavelet transform to detecting anomalous length attribute in queries and then to the applications installed on the servers.
Prototyping Whole Body Navigation of Musical Harmony

We present a Wizard-of-Oz study where we explored the design requirements needed to transform an existing desktop music application to a system using whole body interaction. The desktop tool used is called Harmony Space [1,2]. It is grounded in two well-established theories of music cognition and perception [3,4] providing a parsimonious, unified, and expressive graphical representation of musical harmonic relationships [1,5,6]. This level of description focuses on objects, locations, shapes, centres, moveable ‘allowed’ and ‘forbidden’ areas, trajectories and motions in space, to be navigated while meeting rhythmically-felt, layered, time constraints. This approach makes it possible to characterise such disparate concepts as scales, chords, triads, tonal centres, chord sequences, bass lines, harmonic progressions, modes and modulations, using a single, consistent, parsimonious extended spatial metaphor.
A Study in Java ByteCode Engineering with PCESjava

This thesis reports on experience with PCESjava, a collection of tools which we have developed for the purpose of aiding programmers. Particular applications optimize and instrument JAVA bytecode programs. Using these tools, we have successfully identified impediments to real-time performance in a popular JAVA collections object. Our approach here is based on automatic instruction to obtain traces that show paths whose execution time is not reasonably bounded. We also report on the application of our tool to reduce program footprint in JAVA programs by rewriting the bytecodes to occupy less space. Our transformations also improves the running time of. Read complete abstract on page 2.
Transformation of Jacobian matrices for noisy speech recognition

Robustness of automatic speech recognition systems to noise is still an issue, especially for small footprint systems. This paper addresses the problem of noise robustness using model compensation. Jacobian adaptation is an example of model compensation, which is also computationally efficient. However, its performance drops when the mismatch between training and testing environments increases. Our new adaptation algorithm is based on finding the best linear transformation for compensating the mismatch between training and testing conditions. In this paper, it is shown that, using a dimensionality reduction technique, time and memory requirements of the algorithm can be further decreased compared to the classical Jacobian adaptation. Furthermore, experimental results for an English digit recognition task, recorded in a car at 60 mph, show that the error rate decreases by 66 %, compared to the classical Jacobian adaptation.
The Machine-SUIF Control Flow Graph Library

The Machine-SUIF CFG library provides an abstraction of control flow graphs with nodes containing lists of machine instructions. Such a CFG can be used to replace the linear instruction-list representation of the body of a procedure being compiled. The library supports translation of the linear representation to and from CFG form, transformation of a CFG by adding, reconnecting, and removing nodes, and fine-grained control over individual program instructions within CFG nodes. It allows precise control of program layout, to ensure that re-linearization leaves instructions in the desired order. The CFG library is lean by design. We have factored tools for control-flow and data-flow analysis into separate libraries, based on this one. Users can pick the functionality they need, and they can build other CFG-based tools without incurring overhead for features they don’t need.
Self-adapting genetic algorithms with an application to project scheduling

This paper introduces a new general framework for genetic algorithms to solve a broad range of optimization problems. When designing a genetic algorithm, there may be several alternatives for a component such as crossover, mutation or decoding procedure, and it may be difficult to determine the best alternative (e.g., the best crossover strategy) a priori. For such cases, we suggest to include alternative components into the genetic algorithm. Indicating the component to be actually used in the genotype, this allows the genetic algorithm to adapt itself. That is, the genetic algorithm learns which of the alternative components is the most successful by means of genetic optimization. In order to demonstrate the potential of the self-adapting genetic algorithm concept, we apply it to the classical resource-constrained project scheduling problem (RCPSP). Motivated by previous computational studies as well as theoretical insight, we employ two different decoding procedures and leave the decision which of them to select to the evolution. The approach is further enhanced by a problem-specific local search extension. An in-depth computational experimental analysis shows that the self-adapting genetic algorithm approach is currently the most promising heuristic for the RCPSP.
Describing Human Decisions in Agent-Based Social-Ecological Models - ODD+D an Extension of the ODD Protocol

Multiple agent-based models (ABM) on social-ecological systems exist in parallel investigating similar research questions. However, the choice of a particular human decision model is often not sufficiently empirically or theoretically substantiated in the model documentation. Furthermore, model comparison is difficult because model descriptions are often incomplete, intransparent and difficult to understand. Therefore we expand and refine the ‘ODD’ (Overview, Design Concepts, and Details) protocol to establish a standard to describe ABMs which includes human decision making (ODD+D). Since the original ODD is mainly from an ecological perspective, some adaptations are necessary for the social-ecological context. We extended and rearranged the design concepts and related guiding questions to differentiate and describe decision making, adaptation and learning of the agents in a comprehensive and clearly structured way. Furthermore, ODD+D encompasses a section on ‘Theoretical and empirical background’ to encourage that model design and model assumptions are related more closely to theory. The application of ODD+D is illustrated with a description of a social-ecological ABM on water use. We believe that our expansions help to make the ODD protocol a most suitable protocol to describe social-ecological ABMs and may support the review process of related manuscripts. The ODD+D protocol does not only improve the quality of model descriptions but also improves our understanding of models and is an important necessary step forward developing theory respectively frameworks for social-ecological ABMs.
Architects of the Information Society: 35 Years of the Laboratory for Computer Science at Mit

From the Publisher: The Massachusetts Institute of Technology's Laboratory for Computer Science (LCS) has been responsible for some of the most significant technological achievements of the past few decades. Much of the hardware and software driving the information revolution has been, and continues to be, created at LCS. Anyone who sends and receives email, communicates with colleagues through a LAN, surfs the Web, or makes decisions using a spreadsheet is benefiting from the creativity of LCS members. " "LCS is an interdepartmental laboratory that brings together faculty, researchers, and students in a broad program of study, research, and experimentation. Their principal goal is to pursue innovations in information technology that will improve people's lives. LCS members have been instrumental in the development of ARPAnet, the Internet, the Web, Ethernet, time-shared computers, UNIX, RSA encryption, the X Windows system, NuBus, and many other technologies. " "This book, published in celebration of LCS's thirty-fifth anniversary, chronicles its history, achievements, and continued importance to computer science. The essays are complemented by historical photographs.
Tokenizing an Arabic Script Language

In any naturallanguageprocessingproject, the input text needsto undergo tokenization beforemorphologicalanalysisor parsing. For Arabic script languagesthe tokenizationprocessfacesmoreproblemsand it plays a more crucial role in natural languageprocessing(NLP) systemsfor Arabic script languages.In this work we elaborate on someof theseproblemsandpresentsolutionsfor these.Theresearchis basedon a projectfor tokenizationandparsingPersian, Arabic andKurdishtexts.
Context-awareness in mobile tourist information systems: challenges for user interaction

Context in mobile tourist information systems is typically captured as the current location of the user. Few systems consider the user’s interests or wider context of the sights. This paper explores ideas of how to model, observe, evaluate, and exploit a richer notion of context in this application area. We discuss the influence of such a richer context model on the user interaction for both the capturing of context and the context-aware user/device interactions.
Electro-magnetic Analysis for 750kV Double Circuit Compact Transmission System When Applying Controllable Shunt Reactor

Presently, CSR has not been applied into 750kV power grid through the worldwide. Based on a planning 750kV double circuit compact transmission project in China, this paper researches some electromagnetic issues such as power frequency overvoltage, secondary-arc current and recovery voltage, and load rejection switching surge characteristics of this system when applying controllable shunt reactors (CSR for short) by EMTP program. Aiming at suppressing the electromagnetic issues below the relevant standards, a kind of operating control strategy for 750kV CSR is put forward in this paper. Thereby, it makes CSR to be able to settle the contradiction between suppressing overvoltage level and improving reactive power equivalence performance effectively, which is helpful to enhance system stability and operation economical efficiency. Because of the merits, CSR has good foreground in EHV and UHV power grid in and abroad.
De TTO-methode en correctie voor tijdsvoorkeur

textabstractInleiding: De time tradeoff (TTO-) methode is een veelgebruikte methode voor het waarderen van gezondheidstoestanden (Dolan, 1997; Dolan e.a., 1996). In een TTO dienen individuen een afweging te maken tussen kwaliteit van leven en levensduur. Een typische TTO-procedure omvat een afweging tussen het leven in een bepaalde imperfecte gezondheidstoestand gedurende tien jaar en het leven in perfecte gezondheid gedurende een periode van minder dan tien jaar, waarna in beide gevallen dood volgt.
Girls and Gaming: A Summary of the Research with Implications for Practice.

INTRODUCTION Over the last two decades, girls and computer gaming has become a major topic of research interest. Researchers have examined a number of related issues, including the relative frequency with which girls and boys use computer games, the educational benefits of computer game use, and the types of games and game features that appeal to girls and young women. Most researchers have come to agree that although boys and girls can be equally skilled at using computers and computer games, boys are more likely than girls to choose to play with them, and children of both sexes consider both computers and computer games to be boys' toys (Cassell & Jenkins, 1998, p. 14). This report organizes the major findings from this body of research into thematic issues and considers the practical implications of each issue for teachers, librarians, parents, and other adults who work to connect girls to computer technology. These suggestions are summarized in Appendix A. Incorporating these ideas into the school, library, and home lives of girls can help to alter this perception of computer games as “boys' toys'” to computer games as a medium of entertainment and education for all young people.
Session Management Algorithms for Solving K-Token Dissemination Using Network Coding

In this thesis report we consider k-token dissemination algorithms that makes use of network coding. The k-token dissemination problem consists of propagating a total number of k tokens to all nodes in the network. The tokens are distributed between one or more nodes before the algorithm is executed, and the final goal is that all nodes must eventually have the same set of k-tokens. Network coding is a recent technique that, implemented in a proper way, helps to save bandwidth and improves the speed of distributed computation. The network model consists of a network that can change completely from round to round, therefore the nodes do not know anything about their neighbours. Moreover, when a node broadcasts a message, it does not know which are the receivers, thus, it is not possible for the nodes to know which are the tokens that their neighbours need. By using network coding, the time needed to achieve the final goal (all nodes possess the same k tokens) is drastically reduced in comparison to a simple random forwarding algorithm, which, as its name infers, randomly broadcasts the tokens possessed by a node. We study the session management problem, and present two algorithms to solve it. The problem consists of limiting the total number of sessions that concurrently coexist in the system. In the context of dissemination problems and network coding, we consider a session as an index according to which the information is codded by the session initiator. Since in dynamic networks nodes can crash and recover, we wish to allow sessions to accomplish their tasks, while limiting the amount of overall system resources in use. We propose solutions for the session management problem, and by that facilitate the solution of the k-token dissemination problem in dynamic networks. By solving the session management problem, we can also solve the k-token dissemination problem in a more robust way, in the sense that the algorithms can deal with several types of failures, such as, crashes and crashes-recoveries.
Real-Time Signal Reconstruction from Short-Time Fourier Transform Magnitude Spectra Using FPGAs

Real Time implementation of new frequential domain synthesizer algorithm based on the Nawab approach for signal reconstruction from short-time Fourier transform magnitude spectra is proposed in this paper. A register-transferlevel (RTL) synthesizer based on our algorithm was designed and simulated using VHDL as the hardware description language in respecting real time delay. The implemented RTL model was verified by comparing its performances with those obtained from a Python language implementation of the same synthesizer. We prove in particular that the proposed algorithm can be implemented in real time with a sampling frequency up to 60 kHz. Finally a real time implementation using an Altera DE2 development kit, generating good quality audio signals, was implemented.