Miracle-dz/UniFAR-FTUs huggingface dataset:
Algorithms in C++, Parts 1-4: Fundamentals, Data Structure, Sorting, Searching, Third Edition

Robert Sedgewick has thoroughly rewritten and substantially expanded and updated his popular work to provide current and comprehensive coverage of important algorithms and data structures. Christopher Van Wyk and Sedgewick have developed new C++ implementations that both express the methods in a concise and direct manner, and also provide programmers with the practical means to test them on real applications.Many new algorithms are presented, and the explanations of each algorithm are much more detailed than in previous editions. A new text design and detailed, innovative figures, with accompanying commentary, greatly enhance the presentation. The third edition retains the successful blend of theory and practice that has made Sedgewick's work an invaluable resource for more than 250,000 programmers! This particular book, Parts 1-4, represents the essential first half of Sedgewick's complete work. It provides extensive coverage of fundamental data structures and algorithms for sorting, searching, and related applications. Although the substance of the book applies to programming in any language, the implementations by Van Wyk and Sedgewick also exploit the natural match between C++ classes and ADT implementations.Highlights Expanded coverage of arrays, linked lists, strings, trees, and other basic data structures Greater emphasis on abstract data types (ADTs), modular programming, object-oriented programming, and C++ classes than in previous editions Over 100 algorithms for sorting, selection, priority queue ADT implementations, and symbol table ADT (searching) implementations New implementations of binomial queues, multiway radix sorting, randomized BSTs, splay trees, skip lists, multiway tries, B trees, extendible hashing, and much more Increased quantitative information about the algorithms, giving you a basis for comparing them Over 1000 new exercises to help you learn the properties of algorithms Whether you are learning the algorithms for the first time or wish to have up-to-date reference material that incorporates new programming styles with classic and new algorithms, you will find a wealth of useful information in this book.
Congestion Control for Packetised Video in the Internet

There exist a number of algorithms for compressing digital video, such as the ISDN H.261 standard, and MPEG I and II. With all these algorithms, it is possible to vary the degree of compression within the codec and thus the output data rate, by manipulating the parameters of the algorithm. Using intelligent codec implementations, it becomes possible to send compressed video over packet switched networks and adapt the rates at which the compressed video is produced to maximise video quality, whilst protecting the network from congestion. This thesis presents two viable schemes which use results from human factors experiments that prove this is possible with minimal support from the intermediate switches. First we derive the requirements for transmitting video over packet switched networks, surveying the reported work on human factors, and survey and compare the various algorithms for compressing video and determine their suitability for use over packet switched networks. We produce a taxonomy of congestion control schemes for packet switched networks. We present two novel approaches to congestion control which build on results from human factors experiments: a unicast scheme that we prove is analytically stable under some simple assumptions, and demonstrate working in simulations; and a multicast scheme that is designed to work over heterogeneous hosts and networks, and which has been proven in the wide-spread use of a particular workstation based video conferencing tool, known as IVS. We conclude with ruminations on the extent to which resource protection schemes need to be elded in packet switches to support multimedia. 2 Acknowledgements Jon Crowcroft has been my supervisor, boss and friend whilst at UCL. His intellectual curiosity and ability to discover new ways of thinking about problems have inspired much of this work, whilst without his patience and good-natured encouragement, the thesis would never have been written. Nearly everyone in the UCL Computer Science Department seems to have helped me at some point; in particular I'd like to thank Mark Handley, Atanu Ghosh, Dave Lewis, Zheng Wang, Angela Sasse, Simon Arridge, Nermin Ismail, Vicky Hardman, Stuart Clayman and Natalie May. I'd like to thank Van Jacobson and Sally Floyd at LBL for their guidance and code in building the CBQ router and for inspiring the work in Chapter 5; a footnote from Van in [1] stated that proportional control was impossible in the Internet. I'm very grateful to Thierry Turletti and Jean Bolot for allowing me to hold up releases of IVS whilst I worked on the integration of the congestion control code. I'm deeply indebted to Joel Halpern and Paul Francis for their code and help on Patricia derived algorithms, to the folks at University of London Computer Centre, SuraNet and BBN for their work and help in putting the CBQ code on the FATpipe and to Greg Minshall and other referees for their helpful comments on the parts of this thesis which have made it into papers. Finally I'd like to dedicate the thesis to my partner Helen. Without her love and support, I would never have nished it. 3
Reasoning about imperative and higher-order programs

Contextual equivalence, namely the property that two expressions are indistinguishable inside any program context, is a fundamental property of program expressions. Discovering methods that enable formal reasoning about contextual equivalence is hard and highly dependent on the features of the programming language. In this dissertation we present a technique for systematically deriving reasoning methods for contextual equivalence, which are sound and complete in a variety of languages, but also useful for proving many equivalences. The advantages of the derived reasoning methods are that they successfully deal with imperative as well as higher-order features. We demonstrate our technique by deriving sound and complete methods for proving contextual equivalence in the call-by-value lambda calculus, a lambda calculus with higher-order store, the nu-calculus, an imperative object calculus, and an imperative core of Java.
The Bottom-Up Design of a

This report describes a set of tools developed to help define an efficient computer architecture for executing Prologt programs. These tools decompose Prolog source code into basic register-transfer level operations compact these operations into more complex instructions while enforcing various architectural limits within the processor, and simulate and gather statistics on the resulting programs. This report also describes a group of Prolog benchmarks that have been analyzed by this set of tools, and presents some necessary features of an efficient Prolog architecture that were revealed by the analysis of these benchmarks.
Survivability: Beyond Fault Tolerance and Cryptography

Survivability of a distributed system is the system’s ability to function as expected despite adverse events such as component failures and malicious attacks. By definition, survivability demands reliability and security—two subjects that have been studied in isolation for a long time. On the one hand, the study on reliability fosters research on fault tolerant distributed systems, which centers around the notion of replication and consensus. Various system models have been proposed to capture different types of failures and timing assumptions. On the other hand, security requirements such as confidentiality, integrity, and authenticity have yielded cryptographic building blocks such as encryption/decryption schemes, one-way hash functions, and digital signatures. A misconception naturally arises that a simple integration of fault tolerance mechanisms (such as replicated state machines [13, 15, 4] and Byzantine quorum systems [14]) and cryptography leads to a survivable distributed system. This is unfortunately not true. System models in fault tolerance traditionally rely on the probability distribution of random faults. Malicious attacks, by exploiting worse-case scenarios, often render such statistical analysis inappropriate, thereby debasing the foundation of existing fault tolerance solutions. Replication, a key element for fault tolerance, dictates a distributed architecture that requires protocols for multiple parties. Although such problems have been studied in cryptography as secure multiparty computation [7], the proposed schemes are not nearly as practical and accessible as those for encryption/decryption and digital signatures. Furthermore, survivability raises new types of concerns (such as denial-of-service attacks) that are beyond the current means of fault tolerance and cryptography. This position paper outlines some new challenges posed by survivability, as well as opportunities and new research directions.
Network Behavior of a Busy Web Server and its Clients

The 1994 California Election server, which provided ‘‘live’’ election returns, handled over 1.5 million individual requests, including almost 1 million in a single 24-hour period. This may have been the most intensive single event on the Internet, to date, and so represented a novel experiment in how the network responds to heavy loads. We collected comprehensive traces and logs of server and network operation, allowing offline analysis of numerous statistics. This paper reports the results. d i g i t a l Western Research Laboratory 250 University Avenue Palo Alto, California 94301 USA
Casting the Wireless Sensor Net

"I didn’t know this before, but plants have sex,” says Kevin Delin. He’s gesturing toward two huge cycads, palmlike fugitives from the Dinosaur Age growing in a corner of the Huntington Botanical Gardens, a sanctuary for 15,000 rare plant species in San Marino, CA. Delin’s ignorance of botany is excusable. He’s an engineer from NASA’s nearby Jet Propulsion Laboratory, and what truly interest him are not the male and female cycads but the pair of “sensor web pods” lodged in the ground under the plants. Each pod is the size of a handheld computer and contains a processor, battery, solar cell, radio, memory, and sensors to monitor heat, humidity, and soil moisture. The pods are the surrogate eyes, ears, and even brains of the garden’s curators, keeping track of how much sunlight and rain the plants are getting—critical factors for cycads, which need specific conditions to reproduce.
Linking badminton racket design and performance through motion capture

Although badminton racket technology has advanced considerably, the relationship between design and performance are still rather poorly understood. By studying the dynamic behaviour of the racket during a stroke, different stroke parameters (e.g. racket speed at impact, maximum deflection) can be used to analyse the effects of different racket properties and different player skill levels. Motion capture is used to determine racket dynamics during a stroke. Standard kinematic analysis and an optimisation-based kinematic analysis implemented in the AnyBody Modelling System are compared. The optimised method proves effective in reducing position error and producing smoother kinematic profiles. Using this method, applications of studying racket dynamics through motion capture are presented. Analysing player skill level and racket stiffness can help link racket design and performance.
Excavations in the Acheulean Levels at the Earlier Stone Age Site of Canteen Koppie, Northern Province, South Africa

The fluvial gravels of the river Vaal in South Africa have long been known as a source for Earlier Stone Age (ESA) artefacts. Most were discovered through the open cast mining for diamonds that has left very little in situ fluvial sediment remaining today. The site of Canteen Koppie is an internationally famous location with a reputation for prolific Acheulean artefacts, especially handaxes and the enigmatic prepared core and Levallois-like technology known as Victoria West. Our understanding of this site, and most other Vaal locations, is almost solely based on highly selected artefact collections. Here, we report on the first controlled excavations ever to be conducted at Canteen Koppie. The deposits are likely to date to the Early and Middle Pleistocene, and our excavations sample the full depth of the stratigraphic sequence. The lower units, first identified in these excavations, add a considerable time depth to the Acheulean occupation of the site, making this the longest chrono-stratigraphic sequence in South Africa to our knowledge. Given the current international interest in the origins of Levallois/prepared core technology (PCT), its occurrence in Unit 2b Upper, and its presence alongside Victoria West technology in Unit 2a has significant implications for debates on the role of Victoria West in the origins of PCT. From the Canteen Koppie evidence, Levallois and Victoria West are clearly rooted in the Acheulean.
Hybrid cytological image segmentation method based on competitive neural network and adaptive thresholding

The paper provides a preview of research on the computer system to support breast cancer diagnosis. The approach is based on analysis of microscope images of fine needle biopsy material. The article is devoted mainly to the segmentation problem. Hybrid segmentation algorithm based on competitive learning neural network and adaptive thresholding is presented. The system was tested on a set of real case medical images obtained from patients of the hospital in Zielona Góra with promising results.
The beginnings of prehistoric agriculture in the Russian Far East: Current evidence and concepts

The current situation with studies of prehistoric plant cultivation in the Russian Far East is presented. A critical analysis of existing concepts and models of the oldest agriculture in this region is also included. Reliable data allows us to conclude that humans in the southern Russian Far East (Primorye Province) began to cultivate millet at c. 4700–4600 BP (c. 3600–3400 calBC) in the context of the early Zaisanovka cultural complex of the Late Neolithic. The most probable source area for prehistoric agriculture in the Russian Far East was neighbouring Northeast China (Manchuria).
Neuro-Fuzzy Modeling with Standard Feedforward Neural Networks 1

Extraction of models for complex systems from numerical data of behavior is studied. In particular, systems representable as sets of fuzzy if-then rules where the premises are not connected by t-norms, but by a compensating aggregation operator are discussed. A method is presented to extract this kind of fuzzy rules with support of neural networks. Finally it is shown that the method may be applied to already existent neural networks to extract rule-based models.
Djuna: The Life and Work of Djuna Barnes

An in-depth biography of Djuna Barnes (1892-1992), a familiar figure in Greenwich Village and Left Bank literary and lesbian circles during the 1920s and 1930s. Mostly remembered for her novel "Nightwood", she wrote many poems, plays and stories now all but forgotten, as are her drawings and paintings. The book explores Djuna Barnes's family life, including her possibly erotic relationship with her feminist and spiritualist grandmother, and her relationship with her bigamist father (who, some critics claim, may have sexually abused her). There are also chapters on her years as a journalist, and on the writing and publication of "Nightwood".
TEACHING TRANSLATION BY USING A COOPERATIVE WORK PROCEDURE

Translating Indonesian texts into English versions is a complicated task for students to do. It isshown by them when they do translation in the classroom. The problems usually come intotheir mind when they have to search equivalent words, appropriate grammar and acceptedstructure for target language they will produce. This scene can be observed when they dotranslating activity individually. They just do it themselves without doing collaboration with theirfriends. They only look up a dictionary and think of it themselves. In this situation a teacher justassigns the task and assesses it, no more to do. As a result, the translation products of thestudents are poor. Therefore, in order to improve the studentsâ€™ translation ability and quality oftranslation, the teacher should teach the students translation by using a Cooperative WorkProcedure (CWP) in their translation process. This procedure can lead the students be able totranslate well and produce good translation products because they do translating process in acollaborative group.
USAA-IBM Partnerships in information technology: managing the image project

The introduction of a large-scale image processing system at United Services Automobile Association (USAA) required both external and internal partnerships. The USAA-IBM external partnership demonstrates how the traditional arms-length relationship between a vendor and a customer evolved into a close relationship of mutual benefit with blurred boundaries between buyer and seller. Two internal partnerships, one within USAA and the other within IBM, illustrate the importance of external partnerships in making an external partnership successful. This paper discusses the "mosaic" of relationships and the "squiggly lines" of responsibility that characterized the internal and external partnerships from the perspective of senior information systems management. The article also provides conceptual frameworks that help in generalizing form the partnership arrangements within USAA's environments to those of other organizations.
Automatic Classification of Nasals and Semivowels

In this paper, we discuss acoustic parameters and a classifier we developed to distinguish between nasals and semivowels. Based on the literature and our own acoustic studies, we use an onset/offset measure to capture the consonantal nature of nasals, and an energy ratio, a low spectral peak measure and a formant density measure to capture the nasal murmur. These acoustic parameters are combined using Support Vector Machine based classifiers. Classification accuracies of 88.6%, 94.9% and 85.0% were obtained for prevocalic, postvocalic and intervocalic sonorant consonants, respectively. The overall classification rate was 92.4% for nasals and 88.1% for semivowels. These results have been obtained for the TIMIT database, which was collected from a large number of speakers and contains substantial coarticulatory effects.
Expérience corporelle et sens du mouvement : matérialisation via l'actimétrie du « contexte altéré par l'action » dans l'évolution du joueur de badminton

Cette etude a pour objet de materialiser l’experience corporelle « in situ », sans recours a la conscience, via l’etude de la direction de jeu dans l’activite badminton. L’originalite de l’approche est d’utiliser l’actimetrie (cet outil mesure les accelerations sur les trois plans de l’espace : vertical, antero-posterieur et medio lateral) comme indicateur de corps mobilise afin de mettre en perspective le sens en termes d’etapes conatives (mobiles d’action) avec un sens ergonomique ou « sens du mouvement ». Le cadre conceptuel de cette recherche repose sur une hypothese ergo-conative fondee sur une approche a la fois contextuelle (le contexte d’activite n’est pas un « deja la », il est dynamique et resulte d’une codetermination acteur-contexte) et incorporee de l’action (le sens de l’action est davantage lie aux mobiles qu’aux motifs). Nous montrons qu’en fonction des etapes conatives du joueur de badminton, le sens qualitatif ou direction du mouvement change. Ce changement du sens en action, l’experience corporelle « percue » n’en rend que partiellement compte. L’objectivation de celui-ci via l’actimetrie nous semble riche pour des applications pedagogiques qui respectent le sens de la mobilisation du sujet.
High interpretability using a fuzzy system in a manufacturing process inspection

The authors have been involved in developing an automated inspection system, based on machine vision, to improve the repair coating quality control (RCQ control) in can ends of metal containers for fish food. The RCQ of each end is assesed estimating its average repair coating quality (ARCQ). In this work we present a fuzzy model building to make the acceptance/rejection decision for each can end from the information obtained by the vision system. In addition it is interesting to note that such model could be interpreted and supplemented by process operators. Firstly, the easy open can end manufacturing process, and the current, conventional method for quality control of easy open can end repair coating, are described. Then, we show the machine vision system operations. After that, the fuzzy modeling, results obtained and their discussion are presented. Finally, concluding remarks are stated.
Service Advertisement and Discovery in Mobile Ad hoc Networks

Service advertisement and discovery is an important component for ad hoc communications and collaboration in ubiquitous computing environments. In this paper, a lightweight service advertisement and discovery protocol for MANET (Mobile Ad hoc NETworks) based on ODMRP (On-Demand Multicast Routing Protocol) is presented. Its service advertisement and discovery information is piggybacked in ODMRP routing control packets. Thus the implementation workload and resource consumption are lightweight as long as mobile devices in MANET support multicast routing functionality. The protocol avoids excessive traffic overhead of periodic advertisements since only updated service advertisements are distributed and the service query/reply mechanism in the pull model is used. Moreover, the pull model deals with mobility in MANET because the advertised and registered service can be obsolete after a certain period of time due to the mobility of either the server or client devices.
Rigi User’s Manual

This software is provided " as is " and without any express or implied warranties, including, without limitation, any implied warranties of its merchantability, or fitness for a particular purpose. You bear all risk as to the quality and performance of this software. This manual and the software described in it are copyrighted, with all rights reserved .
Improving Text Classification through Web Corpora

A major difficulty with supervised approaches for text classification is that they require a great number of training instances (manually labeled examples) in order to construct an accurate classifier. In this paper we propose a semi-supervised method for text classification that is specially suited to work with very few training examples. This method consists of two main processes. The first one considers the automatic extraction of unlabeled examples from the Web. The second one focuses on the learning procedure, in particular, on the integration of the unlabeled examples into the original training set. Preliminary results indicate that our proposal can significantly improve the classification accuracy in scenarios where there are less than ten training examples available per class.
Eliciting Architectural Decisions from Requirements using a Rule-based Framework.

Making architectural decisions based on requirements, analyzing cost-benefit trade-offs, and keeping design options open is a difficult task. Existing work on classification of architectural styles and features of reusable components, and derivation of relevant architectural styles provides useful heuristics to the task, but it remains to be largely a laborintensive activity. In this paper, we propose a rule-based framework with automated reasoning for eliciting architectural decisions from requirements. Our goal is to gain a deeper understanding of the relationships between requirements and architectural decisions, define generic mappings based on these relationships, and use these mappings to guide architectural design with a higher degree of automation.