Miracle-dz/UniFAR-FTUs huggingface dataset:
The dynamically varying digital waveguide mesh

The digital waveguide mesh (DWM) is a multi-dimensional numerical simulation technique used to model vibrating objects capable of supporting acoustic wave propagation, with the result being sound output for excitation by a given stimulus. To date most DWM based simulations result in the static system impulse response for given initial and boundary value conditions. This method is often applied to room acoustics modelling problems, where the offline generation of impulse responses for computationally large or complex systems might be rendered in real-time using convolution based reverberation. More recently, work has explored how the DWM might be extended to allow dynamic variation and the possibility for real-time interactive sound synthesis. This paper introduces the basic DWM model and how it might be extended to include dynamic changes and user interaction as part of the simulation. Example applications that make use of this new dynamic DWM are explored including the synthesis of simple sound objects and the more complex problem of articulatory speech and singing synthesis based on a multi-dimensional simulation of the vocal tract.
OHP: A Draft Proposal for a Standard Open Hypermedia Protocol

This paper describes a proposal for a protocol known as OHP, for communication between applications and hypermedia link services. If hypermedia viewers were written to use this protocol, or third party applications were adapted to use the protocol, then these applications could be used with any link service which adhered to the protocol. The paper proposes the use of shims for converting between the OHP protocol and the linkservice's native protocol.
C# 3.0 THE COMPLETE REFERENCE 3/E

The Most Comprehensive C# Resource Available With its support for Language-Integrated Query (LINQ), C# 3.0 has revolutionized C# programming, and bestselling author Herb Schildt has updated and expanded his classic programming reference to cover it. Using carefully crafted explanations, insider tips, and hundreds of examples, this book presents in-depth coverage of all aspects of C#, including its keywords, syntax, and core libraries. Of course, details on the new C# 3.0 features, such as LINQ, lambda expressions, implicitly typed variables, and anonymous types are included. Essential for every C# programmer, this comprehensive guide is written in the clear, crisp, uncompromising style that has made Herb the choice of millions worldwide. Whether you are a novice programmer or a seasoned pro, the answers to all of your C# questions can be found in this definitive resource. Coverage includes: Data types and operators Control statements Classes and objects Constructors, destructors, and methods Interfaces, arrays, enumerations, and structures Method and operator overloading Inheritance and virtual methods Reflection and runtime type ID Exception handling Delegates, properties, events, and indexers Attributes Multithreading Generics LINQ (Language-Integrated Query) Lambda expressions Anonymous types Extension methods Implicitly typed variables I/O, networking, and collections The preprocessor and much, much more Table of contents Part One: The C# Language Chapter 1: The Creation of C# Chapter 2: An Overview of C# Chapter 3: Data Types, Literals, and Variables Chapter 4: Operators Chapter 5: Program Control Statements Chapter 6: Introducing Classes and Objects Chapter 7: Arrays and Strings Chapter 8: A Closer Look at Methods and Classes Chapter 9: Operator Overloading Chapter 10: Indexers and Properties Chapter 11: Inheritance Chapter 12: Interfaces, Structures, and Enumerations Chapter 13: Exception Handling Chapter 14: Using I/O Chapter 15: Delegates, Events, and Lampda Expressions Chapter 16: Namespaces, The Preprocessor, and Assemblies Chapter 17: Runtime Type ID, Reflection, and Attributes Chapter 18: Generics Chapter 19: Lambda Expressions Chapter 20: LINQ Chapter 21: Unsafe Code, Pointers, Nullable Types, and Miscellaneous Topics Part Two: Exploring the C# Library Chapter 22: Exploring the System Namespace Chapter 23: Strings and Formatting Chapter 24: Multithreaded Programming Chapter 25: Collections, Enumerators, and Iterators Chapter 26: Networking Through the Internet Using System.Net Appendix A: Documentation Comment Quick Reference Index
Implementation of a transport system with stateful consumers

When handling large amounts of data, parallel processing is key. Distributed computation makes Big Data work, but it presents new challenges for scaling and reliability. These challenges are made even more interesting when computations are stateful, and done in near real-time as in stream processing. To make a stateful distributed system scalable and resilient to failures, a framework for message passing and state persistence is needed. As of today no such system is available but the components are all there to build one. This thesis gives an outline of how such a framework could be constructed using Apache ZooKeeper and Apache Kafka, describing algorithms and components which could be used for such a system. Also provided are some experimental performance benchmarks of Kafka running in Amazon's EC2 cloud, to use as a measuring stick for its viability as a transport system for messages.
Performance comparison of cache coherence protocol on multi-core architecture

Number of cores in multi-core processors is steadily increased to make it faster and more reliable. Increasing the number of cores comes with a numerous issues that need to be addressed. In this dissertation we looked at the cache coherence issue, its importance and solution. Cache coherence is important as two or more cores sharing the same data must maintain the recent updated value to avoid reading of stale value. We have made an extensive study of existing cache coherence methods, such as Snoopy coherence technique and Directory coherence technique. Snoopy coherence technique is studied with the help of MOESI coherence protocol and Directory coherence technique is observed with the help of MI, MESI TWO LEVEL, MESI THREE LEVEL, MOESI, and MOESI TOKEN coherence protocol. We have used GEM5 simulator and Splash-2 benchmark to compare their performance. For simulation a precompiled program called MemTest, Ruby random tester, and Splash-2 suite is used. It is observed that the performance is improved as we move from MI, MESI TWO LEVEL, MESI THREE LEVEL, MOESI, and MOESI TOKEN in Directory coherence technique and for Snoopy coherence we observed the performance through varying parameters like, cache size, block size and associativity. It is also observed that that adding L3 level cache the performance of MESI Three Level is improved over MESI Two Level.
Power Aware Disk Scheduling Algorithms for Real-Time Systems

Improving the power consumption attributes of embedded and real-time systems has become an important area of interest as processors and other system components have become increasingly powerful and demanding in their energy consumption. The focus of this thesis is on examining the characteristics of real-time hard-disk scheduling algorithms, as hard-disk power usage can amount to a substantial portion of the total system power consumption. Conventional disk scheduling algorithms typically either disregard power consumption completely, or at best apply a fairly naïve power management policy. Given the potential implications for improving the efficiency and longevity of real-world disk systems, we investigate the problem of scheduling a set of independent real-time disk requests such that the total power consumption is minimized, while the efficacy of the disk system is not compromised. We define a power consumption model that can reasonably approximate the performance characteristics of real-world disks. Next, we discuss two power-aware power management policies, I/O Burstiness for Energy Conservation (IBEC) and Speed-Aware Real-time Disk Scheduling for energy conservation (SARDS), which integrate differing power management policies into the disk scheduling algorithms for real-time I/O-intensive applications. Furthermore, to evaluate the performance of the proposed algorithms against existing solutions and ensure that the efficacy of the system is not compromised, we incorporate the earliest deadline first (EDF) and least laxity first (LLF) scheduling policies into SARDS and IBEC to implement poweraware real-time scheduling algorithms. Experimental results from real-world traces and synthetically generated workloads show that the dynamic algorithms have the potential to substantially reduce power consumption over existing scheduling algorithms and power management policies without compromising the overall performance of disk systems.
Cox process goodness-of-fit test. A Matlab file.

The Cox Process (CP) models many real phenomena dealing with counting data. Having observed sample paths of a counting process in a discrete set of time points and assuming that the phenomenon can be modeled by a Cox process or compound Cox process, an important task is to decide if those paths fit a given model. A goodnes-of-fit test to assess the coherence of the new observed data with the given Cox process has been proposed by the authors, taking into account if the process is parametrically known or it has to be estimated. This paper deals with a computational tool to support the test.
Compiling Feature Structures into Terms: an Empirical Study in Prolog

This paper explores the issue of feature structure representation and its eeect on the eeciency of parsing within the context of prolog: it compares four diierent representation systems whilst holding the parsing strategy xed. The representations are: i) interpreted patr equations; ii) partially evaluated patr feature structures; iii) feature structures compiled to lists; and iv) feature structures compiled to at terms. The parser uses a simple shift-reduce strategy with a grammar based loosely on Generalized Phrase Structure Grammar (gpsg). I begin by considering why partial information is important in computational linguistics and compare directed acyclic graphs (dags) and xed arity terms as representations for partial information. I present details of the basic compiler and then go on to consider the four representations in detail. I assume a familiarity with prolog notation and with the basic notions of feature structure representation. An emergent property of the compilation process, namely automatic type generation for category structures, is discussed: these types are implemented so as to ensure that uniication of the compiled representations automatically respects them. The use of additional user speciied information to guide the compiler is also discussed. This involves axioms for explicit type checking during compilation and a notion of designated features. with whom I developed the original system on which these techniques have been tested; to Carl Vogel, who read and commented extensively upon an early draft; to the participants at the 5th Annual Cognitive Science Conference (Part 1) at the Centre for Cognitive Science, Edinburgh, where this paper was rst presented, for valuable feedback; and to the anonymous reviewers of the rst submission. This research was done whilst studying for an MSc at the Centre for Cognitive Science, Edinburgh, on ESRC award number K00429113301.
New-value Logging in the Echo Replicated File System

The Echo replicated file system uses new-value logging. Echo’s use of new-value logging provides a clean separation of the internals of the system into one module that is concerned with logging and recovery, and another module that is concerned with accessing and updating the file system’s on-disk structures. The logging module provides a restricted form of transaction. The restrictions simplify its implementation but impose constraints on the file system module. The file system module easily satisfies these constraints, resulting in a good match overall.
Annotating the World Wide Web

Motivation: Keyword search engines are popular because they provide results—often, too many results! If we could understand, at least partially, the meaning of documents, rather than just recognizing the words, we could answer queries with much higher precision. Natural language is the most convenient and most intuitive method of information access, and people should be able to retrieve information using a system capable of understanding and answering natural language questions.
Disasters in the Literature of Human Factors: An Analysis of Subject and Application Terms

In this preliminary study, we analyzed the literature of disasters as covered by the field of human factors. The purpose is to reach a better understanding of the structure of human factors information and its major components as they relate to disaster technological information. Classification terms from Ergonomics Abstracts were used for a co-occurrence analysis. Six clusters have been identified. Correspondence analysis to determine associations between classification terms and applications terms produced a description of their relationship.
Replication and nested transactions in the eden distributed system (superdatabase, object-oriented)

Hardware redundancy in distributed systems offers the potential for increased availability and performance, but this requires software support if the full potential is to be realized. We have designed and implemented two mechanisms for such support. The first provides crash-resistant resources, replicated transparently and consistently to increase the availability of distributed data. To update multiple copies despite down nodes, we have introduced the Regeneration method, used in the implementation of a replicated system directory. Regeneration restores inaccessible copies elsewhere in the network, maintains the availability of resources, and adapts to configuration changes. The second mechanism is a system supporting nested transactions, which can manage the complex failure modes in a distributed system, synchronize concurrent resource access internal to applications, and facilitate safe module composition. In the tree-structured nesting, each transaction has a Transaction Manager (TM), responsible for the concurrency control and crash recovery of its subtransactions. Many concurrency control and recovery techniques can be combined in this TM Tree design framework. We chose locking and versions for the first implementation. Using Eden objects and the replicated directory, our nested transactions provide consistent concurrent access to location-independent, crash-resistant resources. In summary, the principal contributions of this research are the Regeneration method and the TM Tree framework. Regeneration uses the separation of hardware repair from data restoration to increase replicated data availability. TM Tree composes existing techniques to derive many different designs for nested transactions. Both have been proven in the design and implementation of actual systems.
Communication needs of online students

All learning requires a mix of formal and informal communication. As learning shifts from face-to-face to computer-supported environments, explicit support of informal communication is crucial. An assessment of the formal and informal aspects of communication in Web-based learning environments is provided. The current focus on supporting the formal aspects of communication is questioned. The authors hope that this information will further the recognition of organizational and technical support of informal communication in Web-based education as an issue of prime importance.
Foundations of Perception

Chapter 1: General Principles. Introduction. Classification of the Senses. Methods Used to Study Perception. General Principles of Sensation and Perception. Chapter Summary. Tutorials. Chapter 2: The Chemical Senses. Introduction. Smell. Taste. Flavour. Chapter Summary. Tutorials. Chapter 3: The Body Senses. Introduction. The Somatosensory System. The Vestibular System. Chapter Summary. Tutorials. Chapter 4: The Physics and Biology of Audition. Introduction. Sound as a Physical Stimulus. The Physiology of the Auditory System. Chapter Summary. Tutorials. Chapter 5: Perception of Sound. Intorduction. Loudness Perception. Pitch Perception. Auditory Localisation. Speech Perception. Auditory Scene Analysis. Hearing Dysfunction. Chapter Summary. Tutorials. Chapter 6: The Physics of Vision -- Light and the Eye. Introduction. What is Light? Some Important Properties of Light. The Eye. Chapter Summary. Tutorials. Chapter 7: Visual Physiology. Introduction. The Retina. The Visual Pathway. The Visual Cortex. Chapter Summary. Tutorials. Chapter 8: Spatial Vision. Introduction. Fundamental Functions. Representaion at Multiple Spatial Scales. Uses of Spatial Filters. Chapter Summary. Tutorials. Chapter 9: Shape and Object Perception. Introduction: the Three Stage Model. Shape Representation. Object Representation. Chapter Summary. Tutorials. Chapter 10: Depth Perception. Introduction. The Multiplicity of Depth Cues. Cue Combination. Chapter Summary. Tutorials. Chapter 11: Visual Motion Perception. Introduction. Detecting Movement. The Integration of Motion Detector Responses. Multiple Processes in Motion Perception. Chapter Summary. Tutorials. Chapter 12: Colour Vision. Introduction. Colour Space. Colour Mixture. Dual-process Theory. Colour Interactions. Colour Deficiency. Chapter Summary. Tutorials. Chapter 13: Individual Differences in Perception. Introduction. Age. Sex. Culture. Expertise. Idiosyncratic Individual Differences. Chapter Summary. Tutorials.
An introduction to intelligent and autonomous control

Part 1 Theory and architectures: introduction to intelligent control systems with high degrees of autonomy, P.A. Antsaklis and K.M. Passino a reference model architecture for intelligent systems design, J.S. Albus model-based architecture concepts for autonomous systems design and simulation, B.P. Zeigler and Sungdo Chi design of structure-based hierarchies for distributed intelligent control, L. Acar and U. Ozguner modelling and design of distributed intelligence systems, A.H. Levis nested hierarchical control, A. Meystel. Part 2 Design approaches and techniques: expert control, K.J. Astrom and K. -E. Arzen modelling and analysis of artificially intelligent planning systems, K.M. Passino and P.J. Antsaklis fuzzy and neural control, H.R. Berenji learning control systems, J.A. Farrell and W. Baker learning control methods, needs and architectures, M.M. Kokar learning in control, E. Grant. Part 3 Applications: intellingent robot prehension, Thang N. Nguyen and H. Stephanou modelling of multi-sensory robotic systems with failure diagnostic capabilities, K.P. Valavanis and G. Seetharaman AUTOCREW - a paradigm for intelligent flight control, B.L. Belkin and R.F. Stengel a framework for knowledge-based diagnosis in process operations, P.R. Prased and J.F. Davis.
The PADDY Partial Deduction System

make any warranty, express or implied, or assume any legal liability for the accuracy, completeness or usefulness of any information, apparatus, product or process disclosed, or represent that its use would not infringe privately owned rights. Permission to copy in whole or in part is granted for non-proot educational and research purposes, provided that all such whole or partial copies include the following: a notice that such copying is by the permission of the an acknowledgement of the authors and individual contributors to the work; all applicable portions of this copyright notice. Copying, reproducing or republishing for any other purpose shall require a license with payment of fee to the European Abstract This report describes the PADDY partial deduction system. Its main features are that it
DIVIDED RANGE GENETIC ALGORITHMS IN MULTIOBJECTIVE OPTIMIZATION PROBLEMS

In this paper, Divided Range Genetic Algorithm in Multi objective optimization Problems (DRGA) is proposed. In this method, population of GAs is sorted with respect to the objective function and divided into sub populations. In this model, the Pareto optimum solutions which are close to each other are collected by one sub population. Therefore, by this algorithm, the calculation efficiency is increased, and the neighborhood search can be performed. Through the numerical examples, the followings are made cleared . DRGA is very suitable GA model for parallel processing. DRGA can derive the good solutions compared to the single population model and the distributed model.
Growth and Change Dynamics in Open Source Software Systems

In this thesis we address the problem of identifying where, in successful software systems, maintenance effort tends to be devoted. By examining a larger data set of open source systems we show that maintenance effort is, in general, spent on addition of new classes. Interestingly, efforts to base new code on stable classes will make those classes less stable as they need to be modified to meet the needs of the new clients. This thesis advances the state of the art in terms of our understanding of how evolving software systems grow and change. We propose an innovative method to better understand growth dynamics in evolving software systems. Rather than relying on the commonly used method of analysing aggregate system size growth over time, we analyze how the probability distribution of a range of software metrics change over time. Using this approach we find that the process of evolution typically drives the popular classes within a software system to gain additional clients over time and the increase in popularity makes these classes change-prone. Furthermore, we show that once a set of classes have been released, they resist change and the modifications that they do undergo are in general, small adaptations rather than substantive rework. The methods we developed to analyze evolution can be used to detect releases with systemic and architectural changes as well as identify presence of machine generated code. Finally, we also extend the body of knowledge with respect to validation of the Laws of Software Evolution as postulated by Lehman. We find consistent support for the applicability of the following laws of software evolution: first law Continuing Change, third law Self Regulation, fifth law Conservation of Familiarity, and the sixth law Continuing Growth. However, our analysis was unable to find evidence to support the other laws.
Lime revisited : Reverse engineering an agent communication model

Lime is a middleware communication infrastructure for mobile computation that addresses physical mobility of devices and logical mobility of software components through a rich set of local and remote primitives. The system's key innovation is the concept of transiently shared tuple spaces. In Lime, mobile programs are equipped with tuple spaces that move whenever the program moves and are transparently shared with tuple spaces of other co-located programs. The Lime specification is surprisingly complex and tricky to implement. In this paper, we start by deconstructing the Lime model to identify its core components, then we attempt to reconstruct a simpler model, which we call CoreLime, that supports fine-grained access control and can better scale to large configurations.
An analysis of a communication network structure on BBS in an e-learning course

At the last Annual Conference of Japan Society of Educational Technology (JSET) in 2005 and the Third WebCT Workshop in Japan, we have proposed a new mathematical analysis method of learning process via e-Learning which applied Complex Networks Theory. There, we have indicated that it is possible to identify some characteristics of communication network structure from log data of Bulletin Board System (BBS). The purpose of this paper is to develop the former studies and to clarify the following matters that is: 1) Uneven distribution in terms of network centrality and clustering coefficient is found in the learners' network structure which is formed on a virtual learning environment such as BBS: 2) The centrality and the coefficient are correlated; 3) Some interesting characteristics are observed among Knowledge Transforming Process, Knowledge Telling Process, and the learners' communication network structure.