Miracle-dz/UniFAR-FTUs huggingface dataset:
Protocoles de diffusion dans les Réseaux Ad Hoc Sans Fil

The advances in portable computing and wireless technologies are opening up exciting possibilities for the future of wireless mobile networking. A Mobile Ad hoc NETwork (MANET) is a collection of wireless mobile nodes forming dynamical and temporary network without the use of any existing network infrastructure or centralized administration. Its capability of providing rapidly deployable communication makes it an ideal choice for consumer, company and public uses. Most applications are characterized by a close degree of collaboration. Multicasting could prove to be an efficient way of providing necessary services for these kinds of applications. However, due to the limited transmission range of wireless network interfaces, multiple network hops may be needed for one node to exchange data with another one across the network. Consequently, the extra challenges such as frequent topology change and limited network resources are introduced in multicasting protocol design. In this dissertation, we first examine different techniques and strategies, which are used by current multicast routing protocols for MANETs. Then, we present our proposition, multicast routing protocol with dynamic core (MRDC), to provide best effort multicast routing. This protocol addresses the issue of how to optimize packet delivery success rate and overhead. This protocol gives a trade-off between forwarding overhead and routing overhead but also an optimization between delivery success rate and overhead regarding application requirement and network situation. For the applications, which require 100% percent packet delivery, we study a reliable multicasting protocol that activates intermediate nodes to assist retransmission. All these works have the same goal: optimize packet delivery ratio and overhead to satisfy application requirement with good utilization of network resources especially bandwidth. This dissertation also includes our experiences in implementing a mobile ad hoc testbed. We developed this testbed by implementation of DDR, a unicast routing protocol and MRDC so that the testbed can support both one-to-one communications and many-to-many communications. This testbed will allow us to analyze the performance of routing protocols in real network. It can also be used to study protocols and new MANET applications.
A TASK-ANALYTIC APPROACH TO THE AUTOMATED DESIGN OF INFORMATION GRAPHICS

Abstract : Graphical representations popularly thought to be useful for communicating and processing information yield mixed results when tested with real users. Cognitive research suggests that graphic design methodologies that focus primarily on the information to be presented in a graphic fail to exploit the potentials of graphics for expediting human performance of information- processing tasks: (a) allowing users to substitute efficient visual operators in place of more demanding logical operators; and (b) streamlining users' search for needed information. BOZ is a graphic design and presentation tool that constructively applies task-analytic principles of the user tasks. BOZ analyses a procedural description of a user task and derives a provably equivalent visual task by substituting visual operators in place of logical operators. BOZ automatically designs and renders an accompanying graphic, encoding data in the graphic such that performance of each visual operator is supported and visual search is minimized. Graphics produced by BOZ are static 2D images that support interactive manipulations of the graphical objects in a display to allow direct modification of the internally stored information that the graphic depicts. BOZ is used to design a graphical alternative to a standard tabular display of airline schedule information to support an airline reservation task. Keywords: Graphic design, Task analysis, Perception, Visual languages, User interface.
Language Development and Individual Differences: A Study of Auxiliary Verb Learning

Part 1. Introductory Sections: 1. The auxiliary and the young language learner 2. Rate of auxiliary verb learning in thirty-three children Part II. Individual Differences and Auxiliary Verb Learning in Seven Children: 3. Research design 4. Rate of development 5. Indicators of analytic and piecemeal learning 6. The complexity principle as an indicator of holistic learning 7. Individual differences and the development of auxiliaries in tag questions 8. The development of auxiliary DO 9. The development of CAN Part III: Environmental Influences and Individual Differences in Auxiliary Verb Learning: 10. Previous research 11. Yes/No questions and rate of auxiliary learning for thirty-two children 12. Conclusion Notes References Index.
Generalized Additive Models

Likelihood-based regression models such as the normal linear regression model and the linear logistic model, assume a linear (or some other parametric) form for the covariates X1, X2, *--, Xp. We introduce the class of generalized additive models which replaces the linear form E fjXj by a sum of smooth functions E sj(Xj). The sj(.)'s are unspecified functions that are estimated using a scatterplot smoother, in an iterative procedure we call the local scoring algorithm. The technique is applicable to any likelihood-based regression model: the class of generalized linear models contains many of these. In this class the linear predictor q = E fjXj is replaced by the additive predictor E sj(Xj); hence, the name generalized additive models. We illustrate the technique with binary response and survival data. In both cases, the method proves to be useful in uncovering nonlinear covariate effects. It has the advantage of being completely auto- matic, i.e., no "detective work" is needed on the part of the statistician. As a theoretical underpinning, the technique is viewed as an empirical method of maximizing the expected log likelihood, or equivalently, of minimizing the Kullback-Leibler distance to the true model.
Subbotools User's Manual

The SUBBOTOOLS package is intended as an help to the use of the Subbotin family of probability densities in a statistical analysis environment. The package contains various programs for the maximum likelihood estimation of an unknown distribution and for the generation of pseudo random variables. The last version of SUBBOTOOLS can be found at http://bottazzi.sssup.it/~giulio. Comments and bug reports are welcome. E-write to giulio.bottazzi@sssup.it.
The simple genetic algorithm - foundations and theory

From the Publisher: The Simple Genetic Algorithm (SGA) is a classical form of genetic search. Viewing the SGA as a mathematical object, Michael D. Vose provides an introduction to what is known (i.e., proven) about the theory of the SGA. He also makes available algorithms for the computation of mathematical objects related to the SGA. "Although he describes the SGA in terms of heuristic search, the book is not about search or optimization perse. Rather, the focus is on the SGA as an evolutionary system.
Transformation Based Learning for Specialization of Generic Event Extractions

As part of our Evidence Extraction and Link Discovery (EELD) project, we proposed to use Transformation Based Learning (TBL) to learn domain-specific specializations for generic event extractions. The primary goal of our learning task was to reduce the amount of human effort required for specializing generic event extractions to domains that are new and specific. Three initial annotation cycles and one annotation review and correction cycle involving a total of 70 documents were completed, with slightly over 32 hours required for the entire annotation effort; where possible, the annotation cycles started with bootstrapped files resulting from the application of TBL rules learned after the prior annotation cycle. A five-fold evaluation was completed using the annotated files as the gold standard for evaluation purposes. When our analysis was limited to specialized event types with 10 or more examples available for training, we achieved 67.93% Coverage, 88.93% Accuracy, and an F-score of 77.02%. Several conclusions can be drawn from our study: (1) the use of TBL to learn specializations of generic extractions to specific domains is possible, (2) the use of TBL leads to a significant reduction in the human effort involved in specializing to a new domain, (3) sparsity of training data has a large impact on the results of learning, and (4) with more training instances, coverage and accuracy would improve.
Power-efficient high-speed interface circuit techniques

Roa Elkim, Elkim Felipe Ph.D., Purdue University, December 2014. Power-Efficient High-Speed Interface Circuit Techniques. Major Professor: Byunghoo Jung. Interand intra-chip connections have become the new challenge to enable the scaling of computing systems, ranging from mobile devices to high-end servers. Demand for aggregate I/O bandwidth has been driven by applications including high-speed ethernet, backplane micro-servers, memory, graphics, chip-to-chip and network onchip. I/O circuitry is becoming the major power consumer in SoC processors and memories as the increasing bandwidth demands larger per-pin data rate or larger I/O pin count per component. The aggregate I/O bandwidth has approximately doubled every three to four years across a diverse range of standards in different applications. However, in order to keep pace with these standards enabled in part by process-technology scaling, we will require more than just device scaling in the near future. New energy-efficient circuit techniques must be proposed to enable the next generations of handheld and high-performance computers, given the thermal and system-power limits they start facing. In this work, we are proposing circuit architectures that improve energy efficiency without decreasing speed performance for the most power hungry circuits in high speed interfaces. By the introduction of a new kind of logic operators in CMOS, called implication operators, we implemented a new family of high-speed frequency dividers/prescalers with reduced footprint and power consumption. New techniques and circuits for clock distribution, for pre-emphasis and for driver at the transmitter side of the I/O circuitry have been proposed and implemented. At the receiver side, new DFE architecture and CDR have been proposed and have been proven experimentally.
Implementation of genomics in Australia

Australia is in the process of implementing genomic estimated breeding values for Holstein. Direct genetic values (DGVs) are estimated with BLUP, but an animal specific reliability is calculated separately. Blending is used to combine pedigree, herd recording and genomic information (following Harris and Johnson, 2010). The reference set used to derive the prediction equation consists of 2193 bulls. The addition of genomic information to the parent average leads to an increase in reliability of 20 to 31% for the traits investigated. Once a bull has a first set of daughters, inclusion of genomic information does not greatly alter its BV or reliability. The first release of a limited set of traits is planned for September 2010 followed by an official release for all traits and both sexes in April 2011.
Implementing wiki software for supplementing online learning

This paper reports on a study which investigates the implementation of a wiki system as an additional tool to support student learning in an IT related course offered by the Open University of Hong Kong (OUHK). It focuses on a set of interview data related to the tutors' and students' views on and experience of their use or otherwise of the system in the course. The key results on the tutors' and students' participation in the wiki and factors which facilitated or hindered their use of the system are discussed. The findings indicate that the extent of training provision, the wiki pedagogy and participants' readiness for and awareness of their roles in a collaborative online learning environment are major factors affecting the effective use of the wiki. The add on nature of the wiki in this study also caused workload and motivation problems for the participants. Based on the results, strategies are suggested for implementing wiki based learning in both the OUHK and the wider academic context.
Transfer of Learning in the Impact of Recreational Reading on SS 3 Students’ Performance in Reading Comprehension

Premised on the theory of transfer of learning, this study sought to find out the effect of recreational reading on reading comprehension of SS 3 students in Cross River State, Nigeria in 2006. The sample comprised 1000 SS 3 students randomly selected from twelve public and private secondary schools. Questionnaires as well as a reading comprehension test were used in gathering data. The data were analysed using the Oneway Analysis of Variance (ANOVA). The analysis showed significant differences in performance among high, medium and low frequency readers.
THE DEVELOPMENT OF CZECH ASPECTUAL PREFIXES THROUGH GRAMMATICALIZATION AND LEXICALIZATION PROCESSES

This master’s thesis investigates the development of aspectual prefixes in Czech. The analysis in this work incorporates diachronic and synchronic perspectives and presents a theory about the path of development of aspectual prefixes in the framework of construction grammar. It draws from a central notion that grammar emerges from discourse and argues that the development of aspectual prefixes in Czech was fundamentally based in language use and processing. The synchronic layering of prefixed predicates in Czech provides evidence that the development of aspectual prefixes progressed gradually and suggests that grammaticalization and lexicalization processes took place. The analysis in this study is based on the assumption that major stages of development are attested in the synchronic layering of aspectual prefixes. Synchronic layering is transparent in semantically distinct types of prefixed predicate constructions. The semantic analysis of aspectual prefixes suggests that prefixed predicates can be categorized in relation to their characteristic stages of development. The semantic classification of prefixed predicates with prefixes za-,
Virtual memory management for transaction processing systems

To support failure atomicity and permanence, transaction processing systems store data in recoverable storage. Recoverable storage is commonly implemented using a combination of volatile, non-volatile, and stable storage. Data are maintained in non-volatile storage over the long term. While data are being processed, they are cached in volatile, primary memory. Stable storage is used for a log that permits operations to be undone or redone. Transaction processing systems typically implement recoverable storage themselves, using virtual memory or specially mapped physical memory for volatile buffer space. However, many advantages are obtained if the operating system provides recoverable virtual memory: data are mapped into virtual memory and thereby accessed more conveniently; the operating system's fast address translation and paging components provide increased performance; the amount of primary memory allocated to buffering data adapts to system load allowing double paging to be eliminated. Recoverable virtual memory does not preclude the use of other transaction processing techniques. In this dissertation, I show that virtual memory support can be provided for transaction processing systems. I review some novel hardware and special purpose implementations of recoverable virtual memory. I then describe in depth a system for which I have implemented recoverable virtual memory: the Camelot Transaction Processing Facility. The Camelot implementaion utilizes a general software approach that does not use any special purpose hardware (other than standard virtual memory hardware). The implementation is portable: it runs on IBM RTs, Suns, and Vaxes, including shared memory multiprocessor Vaxes. The approach allows the use of a variety of logging and locking techniques. Other specialized implementations of recoverable virtual memory exist, but they impose severe restrictions on users. This implementation demonstrates the feasibility of recoverable virtual memory for general purpose transaction processing systems.
The influence of linguistic structure on memory span : repetition tasks as a measure of language ability

This thesis evaluated the extent to which long-term memory linguistic representations (syntactic, semantic, prosodic and lexical) affect immediate verbal repetition performance. The effects of these linguistic factors on short-term memory span were explored through an experiment with 140 English- and Czech-speaking participants. The experiment employed nine experimental conditions which varied the presence/well-formedness of linguistic information in four domains: the lexicon, morphosyntax, semantics, and suprasegmental phonology. This resulted in a spectrum of stimuli with semantically, syntactically and prosodically well-formed sentences with real lexical items at one end, through to a list of nonwords with lexical, semantic, prosodic and syntactic information removed. One hundred typically developing children (50 Czech-speaking; 50 English-speaking) aged 4-5 years and 40 adults (20 Czech-speaking; 20 English-speaking) participated in the study. In each condition, participants were asked to repeat blocks of successively longer stimuli to establish their maximum spans. The results were similar between age groups and across languages. Each linguistic factor had a significant effect on short-term memory span. The presence of non-words and syntactic violations dramatically reduced memory span, while semantic implausibility and the removal of sentence prosody played a smaller yet significant role. Despite the typological differences between Czech and English, the same robust differences between conditions were found in both languages. The results provide further evidence that immediate verbal repetition is highly sensitive to the linguistic structures present in the stimuli. It is argued that theories which aim to account for data from immediate repetition should not be limited to lexical phonology but also need to address how syntactic, prosodic, semantic and lexical representations contribute to repetition performance. The findings of this thesis support the theoretical framework of verbal short-term memory emerging from a temporary activation of long-term memory representations and reinforce the view that language and memory are inextricable.
Power-balanced instruction scheduling for pipelined VLIW architectures

Very Long Instruction Word (VLIW) processors are capable of executing a number of instructions which are scheduled by the compiler on their independent functional units in parallel. The power consumed at any given time by the processor depends on the number as well as the type of instructions that are being executed. Thus potentially large power fluctuations may occur throughout the duration of program, depending on how the instructions are scheduled by the compiler. Large processor current variation can accelerate battery exhaustion, increase power supply noise and degrade chip reliability. Furthermore, certain cryptographic applications also require relatively uniform processor power consumption to avoid security attacks based on observations of power behavior. The focus of this thesis is on techniques for minimizing power variation for the duration of the whole program. The problem of instruction scheduling for minimal processor power variation while the program execution is not degraded will be referred to as powerbalanced scheduling in this thesis. The optimization problem is first formulated as a mixed-integer program (MIP). While this approach has been proposed before, the original contributions made in this thesis are two-fold. Firstly, an efficient branch-and-bound algorithm is developed specifically for this problem enabling it to be solved much more efficiently than generic techniques. Secondly, a much more complete resource usage model is incorporated. This model takes into account the constraints imposed by multi-cycle functional unit latency as well as shared resources such as limited registers, read/write ports and buses which i ATTENTION: The Singapore Copyright Act applies to the use of this document. Nanyang Technological University Library
A Generalized Software System for Accurate and Efficient Management of Application Performance Goals

A number of techniques have been proposed to provide run- time performance guarantees while minimizing power consumption. One drawback of existing approaches is that they work only on a fixed set of components (or actuators) that must be specified at design time. If new components become available, these management systems must be redesigned and reimplemented. In this paper, we propose PTRADE, a novel performance management framework that is general with respect to the components it manages. PTRADE can be deployed to work on a new system with different components without redesign and reimplementation. PTRADE’s generality is demonstrated through the management of performance goals for a variety of benchmarks on two different Linux/x86 systems and a simulated 128-core system, each with different components governing power and performance tradeoffs. Our experimental results show that PTRADE provides generality while meeting performance goals and ap- proaching optimal power consumption. PTRADE consumes only 7% more power than optimal on the Linux/x86 systems and 3% more power than optimal on the simulated many-core. (Less)
A CMOS 1×-16× speed DVD write channel IC

Optical recording demands a meticulous write strategy to control the laser beam power and regulate the phase change layer temperature tightly. The width, height, and delay of a string of short pulses applied to the laser diode need to be adjusted in fine steps, and the writing speed varies widely per applications. A multi-phase phase-locked loop (PLL) tracks a wide range of clock frequencies, and provides a low-jitter time base for write pulses. With two enabling circuit concepts, PLL loop filter voltage folding/unfolding and switch-in of parallel MOS resistors in delay cells, it is possible to operate a PLL to cover a frequency range spanning over three octaves with one VCO. A 10-stage differential VCO is phase-locked to the input channel clock ranging from 26 to 420 MHz (1×-16× DVD speed), and its 20-phase outputs are used to generate write pulses. The pulsewidth and delay are programmed with 120 ± 40 ps time resolution. The prototype chip fabricated in 0.35 μm CMOS occupies 3.5 × 3.3 mm 2 , and consumes 294 mW at 3.3 V.
How Does it Feel. Point of view in Translation

Abbreviations Introduction Chapter One: Narrative Point of View and Translation Chapter Two: The Different Categories of Point of View Chapter Three: Methodological Tools and Framework Chapter Four: Virginia Woolf, a Case in Point Chapter Five: The Model Demonstrated Case-Study One: To the Lighthouse Chapter Six: The Model Demonstrated Case-Study Two: The Waves Conclusion Bibliography Index
Locating program features using execution slices

An important step towards effective software maintenance is to locate the code relevant to a particular feature. We report a study applying an execution slice-based technique to a reliability and performance evaluator to identify the code which is unique to a feature, or is common to a group of features. Supported by tools called ATAC and /spl chi/Vue, the program features in the source code can be tracked down to files, functions, lines of code, decisions, and then c- or p-uses. Our study suggests that the technique can provide software programmers and maintainers with a good starting point for quick program understanding.
A Family of Attacks upon Authentication Protocols

In this paper we present four similar attacks upon well known au-thentication protocols, and suggest that similar attacks exist for other protocols. Each of these attacks causes an agent B to think that another agent A is attempting to set up two (or more) simultaneous sessions with B, when in fact A is trying to establish only a single session. We describe how such an attack may have serious consequences.