Miracle-dz/UniFAR-FTUs huggingface dataset:
Traffic Estimation, Prediction and Provisioning in IP Networks

The study of Internet traffic behavior in a real IP network is the subject of this thesis. Traffic Matrix of a telecommunication network represents the exchanged traffic volume between the source and destination nodes in the network and is a critical input for network studies. However, in most cases, traffic matrices are not readily available. Existing network management protocols such as the ‘Simple Network Management Protocol’ (SNMP) have been used to gather other observable measures, such as link load observations. The first part of this thesis reviews famous methods and approaches that try to infer and estimate the source-destination traffic matrix from the observable link loads. Another important subject in networks is to predict bandwidth requirements in the future. The second part of this thesis reviews some existing methods and approaches of traffic prediction. Recently a traffic prediction method which uses multiple TimeSeries analysis, each operating on a different time-scale, has been proposed. This method uses multiple ‘AutoRegressive Integrated Moving Average’ (ARIMA) filters to predict the future bandwidth requirements. Each ARIMA filter operates on a different time scale, i.e., quarter-hour, hour, day, and week. The proposed method associates a weight with each ARIMA filter, and adjusts the weights according to which filter iv is currently the most accurate predictor. A review of this newly proposed method is presented. Extensive experimental results have been gathered to test the robustness of the method. The filter coefficients of each ARIMA filter have been varied, and the accuracy of the predicted traffic has been measured. Extensive experimental measurements indicate that the model is very robust, and that large changes to each filter’s coefficients have only a small effect on the accuracy. In all cases we evaluated, the method is very robust, predicting short-term future traffic demands with typically ≈ 95% success rates.
Scheduling jobs on two uniform parallel machines to minimize the makespan

The problem of scheduling n independent jobs on m uniform parallel machines such that the total completion time is minimized is a NP-Hard problem. We propose several heuristic-based online algorithms for machines with different speeds called Q2||Cmax. To show the efficiency of the proposed online algorithms, we compute the optimal solution for Q2||Cmax using a pseudo-polynomial algorithms based on dynamic programming method. The pseudo-polynomial algorithm has time complexity O(n T )and can be run on reasonable time for small number of jobs and small processing times. This optimal offline algorithm is used to benchmark the efficiency of the proposed online algorithms.
Adapting a DHT to a Self-Reliant M2M Network

Machine-to-machine (M2M) communications is a field of research expected to grow in the following years. New business opportunities arise in this area, for instance the 50 Billion Project and the Future Internet Project at Ericsson. Thus new protocols and architectures need to be defined for the different scenarios where this technology is applicable. At the same time well known structured P2P networks, for instance by means of a Distributed Hash Table (DHT), present great synergy possibilities with M2M, in particular in the Wireless Sensor Networks (WSN) Area. M2M scenarios in which sensors become more autonomous and self-reliant, independent from a centralized decision-making entity can benefit from the use of DHTs. This thesis aims at adapting current DHT (Distributed Hash Table) procedures to a M2M (Machine-to-Machine) environment. Moreover it will consist on implementing a layer for M2M communication on top of an existing DHT. We analyze the state of the art in both sensor and P2P technologies. Based on that, we explain the motivations to create such a layer and the its benefits. Following the design we implement a fully working prototype and prepare some use case scenarios. Finally, we draw conclusions from the experience and trace future paths of research for our project.
Cognitive ergonomics: contributions from experimental psychology

Theoretical issues. Task knowledge structures: Psychological basis and integration into system design (H. Johnson, P. Johnson). Formal modelling techniques in human-computer interaction (G. de Haan, G.C. van der Veer, J.C. van Vliet). Errors and theory in human-computer interaction (P.A. Booth). Knowledge retrieval and frequency maps (G.M. Brown). Event controllability in counterfactual thinking (V. Girotto, P. Legrenzi, A. Rizzo). Computer programming and program debugging. Training of Pascal novices' error handling ability (C.M. Allwood, C.-G. Bjorhag). Models of debugging (D.J. Gilmore). Analogical software reuse: Emprirical investigations of analogy-based reuse and software engineering practices (A. Sutcliffe, N. Maiden). Database interrogation. An experimental study of the interpretation of logical operators in database querying (P.J.M.D. Essens, C.A. McCann, M.A. Hartevelt). Analysing the deep structure of queries: Transfer effect on learning a query language (L. Linde, M. Bergstrom). Adapting systems to differences between individuals (F. Jennings, D. Benyon, D. Murray). Text editing. Interference among text-editing commands: Fan-effects and the role of system consistency (M. Heydemann, R. Hoffmann, R. Schmidt). On the microstructure of learning a wordprocessor (Y. Warn). Graphics design. The constraint satisfaction approach to design: A psychological investigation (F. Darses). Author index. Subject index.
Ready-to-Run Java 3D

Getting Started A 3D Graphics Primer Meet the Java 3D API Beautiful Geometry Translation, Rotation, and Scaling Light and Transparency Behaviors, Interpolators, and Event Detection Fog Effects Texture Mapping Java 3D Sound 3D Text and Fonts Java 3D Web Tools and Utilities Appendices Index.
Using particle swarm optimization to determine visit times in community nurse timetabling

In the problem of community nurse timetabling where the visits have accompanying time windows, knowing the order of the visits is not enough, the actual times of the visits need to be known. This is normally solved using a simple greedy approach, but the solutions reached this way can exhibit serious flaws . We show how the determination of these times can be modelled as a convex optimization problem, and demonstrate how this can be solved using Particle Swarm Optimization. Initial results show that this approach is far superior to the greedy approach.
Faculty scheduling using genetic algorithms

The problem of developing a class schedule for a department of faculty has been proven to be NP-complete. Therefore when the schedule is large enough, finding just one feasible solution can be impossible for any direct search algorithm within a reasonable time. This project is geared toward investigating the possibility of using genetic-based algorithms to solve faculty scheduling problems of 100 courses or larger quickly. Multiple versions of genetic algorithms and heuristics are tested. Many parameter levels for these algorithms are optimized for fastest convergence.
Words Their Way Letter and Picture Sorts for Emergent Spellers

Overview Chapter 1 Phonological Awareness Picture Sorts"/p> Notes for the Teacher Chapter 2 Notes for the Teacher Chapter 3 Beginning Sound Sorts Notes for the Teacher Selection 1 The Gingerbread Man Sort 1 Beginning Sounds: M & R Sort 2 Rhyming Words (man and cat) Sort 3 Fonts for M, R, D, C Selection 2 Hey Diddle Diddle Sort 4 Beginning Sounds: D & C Sort 5 Concepts: Real and Make Believe Chapter 4 Concept of Word in Print Notes for the Teacher Appendices Template 3 X 4 Template 4 x 5 Template 5 X 6 List of Pictures on Letter Pages
Using Hardware Tokens for Authentication of Multiple Client Application Making Single Sign-On Possible

The present invention relates to compounds of formula (I) ArCH2R1 (I) or a monomethyl or a monoethyl ether thereof (the compound of formula (I) including these ethers may contain no more than 30 carbon atoms in total); ethers, esters thereof; acid addition salts thereof; wherein Ar is a chrysene or substituted chrysene ring system; R1 contains not more than eight carbon atoms and is a group wherein m is 0 or 1; R5 is hydrogen; R6 and R7 are the same or different and each is hydrogen or C1-3 alkyl optionally substituted by hydroxy; R8 and R9 are the same or different and each is hydrogen or C1-3 alkyl; -C-C- is a five- or six-membered saturated carbocyclic ring; R10 is hydrogen, methyl or hydroxymethyl; R11, R12 and R13 are the same or different and each is hydrogen or methyl; R14 is hydrogen, methyl, hydroxy, or hydroxymethyl.
Dynamics in Boolean Networks

In this thesis several random Boolean networks are simulated. Both completely computer generated network and models for biological networks are simulated. Several different tools are used to gain knowledge about the robustness. These tools are Derrida plots, noise analysis and mean probability for canalizing rules. Some simulations on how entropy works as an indicator on if a network is robust are also included. The noise analysis works by measuring the hamming distance between the state of the network when noise is applied and when no noise is applied. For many of the simulated networks two types of rules are applied: nested canalizing and flat distributed rules. The computer generated networks consists of two types of networks: scale-free and ER-networks. One of the conclusions in this report is that nested canalizing rules are often more robust than flat distributed rules. Another conclusion is that the mean probability for canalizing rules has, for flat distributed rules, a very dominating effect on if the network is robust or not. Yet another conclusion is that the probability distribution for indegrees, for flat distributed rules, has a strong effect on if a network is robust due to the connection between the probability distribution for indegrees and the mean probability for canalizing rules.
Applying an ethological perspective of art to the community arts and socially engaged arts

ABSTRACT This article argues and demonstrates that a distinction between artistic and non-artistic methods in community/socially engaged arts can open new discussions that advance and challenge the practice. While the boundary between art and non-art is far from clear, several widely read publications on community/socially engaged arts have categorized such works as the same class of engagement, investigating primarily their political and cultural impact, leaving the experiential dimension of the engagement overlooked. The ethological perspective of art presented by anthropologist Ellen Dissanayake is drawn upon for a definition of art that connects the experiential and social experience of art with the survival and thriving of individuals and their communities. Through an interdisciplinary approach, this definition of art is integrated with theories of psychology and social psychology for a multifaceted explanation of the phenomenon of collaborative art making. This discussion reconsiders the simplistic understanding of the oft-quoted phrase ‘everyone is an artist’, the ‘lowest-common denominator’ critique of collaborative art making, and the instrumentalization of art.
Linear Algebra for Signal Processing.

Abstract : This grant supported research in Applied Linear Algebra for Signal Processing, part of the IMA 1991-92 program in Applied Linear Algebra. Specifically the grant supported 12 one-month visitors-during the April-May 1992 period devoted to signal processing and also provided support for the workshop Liner Algebra for Signal Processing (April 6-10, 1992) organized by Adam Bojanczyk and George Cybenko, including some funds for publication costs of the proceedings as an IMA Volume.
Allpass based analysis synthesis filter banks : design and application

Filter-banks are an essential component of many algorithms for digital signal processing, which are nowadays employed in a variety of ubiquitous devices. Filter-banks enable signal processing in the frequency-domain and their design has often a significant influence on the performance of a system with regard to its computational complexity, signal quality and delay. In this thesis, novel design approaches for different types of allpass-based analysis-synthesis filter-banks are devised. A substantial benefit of these recursive filter-banks is that they can achieve a high frequency selectivity and/or a non-uniform time-frequency resolution with a low signal delay. One focus of this work is the design of allpass-based quadrature-mirror filter-banks (QMF-banks) with near-perfect reconstruction. New synthesis filter-banks are presented which consist of allpass polyphase filters. They are designed by simple analytical expressions such that the trade-off between reconstruction error and signal delay of the filter-bank can be controlled in a simple manner. The devised QMF-bank has been employed in a candidate proposal for a new ITU-T speech and audio codec and has helped to achieve a high speech and audio quality with a low signal delay. A key issue in the design of allpass-based filter-banks is to compensate non-linear phase distortions caused by the recursive analysis filter-bank. Therefore, known as well as novel phase equalizer designs for this purpose are presented and analyzed. Another focus of this work is the design of allpass transformed analysis-synthesis filter-banks. They can achieve a non-uniform time-frequency resolution similar to that of the human auditory system, which is beneficial for speech and audio processing systems. Novel closed-form and numerical designs for the synthesis filter-bank are introduced, which aim for different design objectives. A benefit of the closed-form designs is their simplicity, while the numerical designs allow the explicit control of specific properties of the filter-bank such as signal delay, reconstruction error, bandpass characteristic of the synthesis filters etc. The new numerical designs are all stated as a convex optimization problem which can be solved rather easily. Finally, an efficient implementation for the special case of an allpass transformed filter-bank without subsampling is derived. This system, termed as filter-bank equalizer, allows to perform adaptive subband filtering with a low signal delay. It is shown how this filter-bank can be used for noise reduction, speech dereverberation, or speech intelligibility improvement in noisy environments. These low delay speech enhancement systems are of particular interest for applications within cell phones, hands-free devices, or digital hearing aids.
Phatic Technologies: Sustaining Sociability through Ubiquitous Computing

Recent research in ubiquitous computing has mostly concerned systems that support personal and informational issues. This workshop paper introduces the concept of phatic technologies ‐ systems that establish and maintain the possibility of social interactions. These systems are not concerned with capturing and communicating information as such, but with building relationships. We present details of two field-based studies looking at strong-tie relationships, and explore the consequences for emerging ubiquitous and pervasive technologies.
How to use the Machine Learning Plugins forMay- day

Note: When using Mayday via WebStart, you can skip this entire section and proceed to the next section. If you have it installed using an Installer, you can skip the first step, but you must take care of the external libraries. The installation of the Mayday machine learning plugins is very straightforward. For the installation of Mayday itself, please refer to the Mayday user guide [1]. To install the machine learning plugins, please copy the plugin JAR, named mayday-learning-20060430.jar (the date may change, as new versions emerge) to your Mayday plugin folder. The following external libraries are required for running the plugins:
RENDEZVOUS: Self-Organizing Services in an Active Network

Abstract : We propose to explore a rendezvous model that has three characteristics: self-organization, heterogeneity, and administrator for friendliness. Not only do we believe that active network techniques have much to offer the overlay, proxy and interposition models that are prevalent in the Internet, but for the most part previous active networks research has not explored models with these characteristics. Our approach builds on our earlier experience with active networks, and specifically the ANTS active network toolkit. We model the network as an Internet-like arrangement of IP routers, some of which are co-located with active nodes that support additional computation in the form of a well-known runtime. We assume this to be ANTS, although our strategies will be applicable to other runtimes too.
Identification of microorganisms on stone and mural paintings using molecular methods

Weitreichende Untersuchungen haben gezeigt, dass Mikroorganismen, zusatzlich zu chemischen und physikalischen Prozessen, eine Hauptrolle in der Zerstorung von Malereien, Kunstwerken aus Glas, Metall, Stein, Papier, Leder oder Pergament spielen. Diese Organismen sind am Zerstorungsprozess beteiligt und konnen schwere Schaden am Objekt anrichten. Daher ist es wichtig, um kulturelles Erbe zu erhalten oder zu restaurieren, zu wissen welche Organismen die wertvollen Substrate kolonisieren, woher sie stammen, um ihr Zerstorungspotenzial einzuschatzen bzw. festzustellen, ob manche Organismen auch dem Schutz des Kunstwerks dienen. Mit klassischen Kultur-abhangigen mikrobiologischen Methoden konnen weniger als 1% aller Bakterien in Umweltproben erfasst werden. Daher haben sich Kultur-unabhangige Methoden als nutzliches Werkzeug zur Untersuchung von mikrobiellen Gemeinschaften auf Kunstobjekten, erwiesen. In dieser Studie wurde der folgende molekulare Ansatz verwendet: ein speziell fur kleine Probenmengen ausgelegtes DNS Extraktionsprotokoll, PCR fur spezifische molekulare Marker und die Fingerabdruck Technik Denaturierende Gradient Gel Elektrophorese (DGGE). Proben wurden von Wandmalereien im `Berglzimmer` und im `Kindermuseum` des Schlosses Schonbrunn (Wien), als auch von Salzkrusten auf Wanden der mittelalterlichen Virgilkapelle (Wien) genommen. Bakterien-, Pilz- und Archengemeinschaften wurden analysiert. Hauptsachlich wurden Bakterien der Gamma-Proteobacteria detektiert, als auch diverse moderat halophile Bakterien verschiedener Genera. Weiters wurden in den stark salzhaltigen Proben der Virgilkapelle halophile Archen gefunden. Pilzspezies der Phyla Ascomycota und Basidiomycota wurden auf den Wandmalereien des Schloss Schonbrunns identifiziert. Die Ergebnisse dieser Diplomarbeit geben Hinweise auf den Ursprung der Bakterien, Pilze und Archen. Zerstorerische Effekte konnen mit diesen Mikroorganismen in Verbindung gebracht werden.
Cristóbal de Villalpando’s Adoration of the Magi: A Discussion of Artist Technique

As a key participant in the 1686 revitalization of the Guild of Painters and Gilders of Mexico City, Cristobal de Villalpando (c. 1649–1714) played a critical role in establishing a high standard of practice for painters in seventeenth-century Mexico and beyond. [1][1] Signed and dated at the
MOVA control of isolated traffic signals-recent experience

MOVA is a control strategy using a new detector layout for isolated traffic signals (ie not co-ordinated with any other traffic signalled junctions). It is a self-optimising system designed to reduce delays and stops, and to maximise capacity during peak periods. The paper presents some of the results and experiences of the 20 site trial programme. The objective of the trial is to validate and verify the installation of MOVA add-on units into a variety of approved traffic signal controller types and junction layouts. The MOVA equipment has undergone an approval exercise with the Department of Transport, and will be approved for use as an add-on unit throughout Britain.
New Trends in Multiscale and Multiphysics Simulation of Transport Phenomena in Novel Engineering Systems

The paper reports on the progress made in predicting large- and small-scale single and two-phase flows with heat transfer using the CMFD code TransAT. In the multi-phase context, the code uses the Level Set approach as the “Interface Tracking Method” of reference. The solver incorporates phase-change capabilities, surface tension and triple-line dynamics models, Marangoni effects, electric and magnetic fields, and a wall micro-film sub-grid scale model for lubrication. Complex 3D examples shown here were treated using a fully automatized version of the code, using the Immersed Surfaces Technique (IST) to map complex components into a simple rectangular Cartesian grid. It is shown that real coupled two-phase heat transfer (conjugate) problems are within reach of modern CMFD code using interface tracking, with relatively fast response times: 3D coupled two-phase flow heat transfer can run on a simple Linux PC cluster within 24 H time.
Code reuse through polymorphic variants

Their support for code reuse has made object-oriented languages popular. However, they do not succeed equally in all areas, particularly when data has a complex structure, making hard to keep the parallel between data and code. On the other hand, functional programming languages, which separate data from code, are better at handling complex structures, but they do not provide direct ways to reuse code for a dierent datatype. We show here a way to achieve code reuse, even when data and code are separated. The method is illustrated by a detailed example.
Abstracting, Information Retrieval and the Humanities: Providing Access to Historical Literature

From the impact of the Anglo-American Cataloguing Rules, including amendments, to technology's potential for increasing productivity, you need to keep abreast of the latest changes and the newest innovations. These detailed guides will help you: -- Determine hardware and software needs for technical services workstations -- Accurately catalog material from serials to reproductions to interactive multimedia -- Integrate preservation activities into the acquisition process "A rich introduction to the subject.always clear, logically organized, and highly readable. The tables and figures are simple in design and easy to read.The research and insights will be fascinating and invaluable for oil interested in information retrieval". -- Canadian Journal of Information and Library Science
An outcome-based framework for technology integration in higher education statistics curricula for non-majors

This paper draws from current research on the role of technology in statistics education and presents an outcome-based framework for technology integration in teaching statistics for non- majors. Anchored on the principles of Outcome-Based Education, this framework is grounded on the goals and intended learning outcomes for teaching statistics with technology as expanded opportunity and support for learning success. Based on the Gradual Release of Responsibility Model, it describes how responsibility of learning shifts gradually over time from teacher to student ownership and from modeled and guided instruction to collaborative and independent learning. The framework also draws ideas from Taggart’s Reflective Thinking Model where focus in teaching with technology moves from technical to contextual, and then to dialectical, in the transition from undergraduate to graduate-level statistics.