Miracle-dz/UniFAR-FTUs huggingface dataset:
P2P Streaming Capacity

Peer-to-peer (P2P) systems provide a scalable way to stream content to multiple receivers over the Internet. The maximum rate achievable by all receivers is the capacity of a P2P streaming session. We provide a taxonomy of sixteen problem formulations, depending on whether there is a single P2P session or there are multiple concurrent sessions, whether the given topology is a full mesh graph or an arbitrary graph, whether the number of peers a node can have is bounded or not, and whether there are non-receiver relay nodes or not. In each formulation, computing P2P streaming capacity requires the computation of an optimal set of multicast trees, with an exponential complexity, except in three simplest formulations that have been recently solved with polynomial time algorithms. These solutions, however, do not extend to the other more general formulations. In this paper, we develop a family of constructive, polynomialtime algorithms that can compute P2P streaming capacity and the associated multicast trees, arbitrarily accurately for seven formulations, to a factor of 4-approximation for two formulations, and to a factor of log of the number of receivers for two formulations. The optimization problem is reformulated in each case so as to convert the combinatorial problem into a linear program with an exponential number of variables. The linear program is then solved using a primal-dual approach. The algorithms combine an outer loop of primal-dual update with an inner loop of smallest price tree construction, driven by the update of dual variables in the outer loop. We show that when the construction of smallest price tree can be carried out arbitrarily accurately in polynomial time, so can the computation of P2P streaming capacity. We also develop several efficient algorithms for smallest price tree construction. Using the developed algorithms, we investigate the impact of several factors on P2P streaming capacity using topologies derived from statistics of uplink capacities of Internet hosts.
Managin speaker identity and user profiles in a spoken dialogue system

In this paper we present an approach to capture user preferences dur- ing their interactions with a spoken dialogue system (SDS) and to exploit these preferences into the dialogue manager module. We use the output of an unsuper- vised speaker identification module and a natural language understanding module to adapt the behaviour of the SDS to each particular user by developing a statistic analysis of the preferred goals of each user. This way we can adapt the behaviour of the system to each user's preference, anticipating the goals that a user wants to fulfill. We have evaluated the speaker identification system with two different databases, and we have obtained identification errors below 4%. The initial evalu- ation of the profile manager shows an improvement on subjective metrics, such as users' perception of efficiency or naturalness of the system responses.
A Governance Framework for ICT Supply Chain Risk Management

Abstract This article proposes a unified model of best practice for information and communications technologies (ICT) supply chain risk management (SCRM). Ensuring proper ICT–SCRM governance is an important national priority because of the vulnerability of current supply chains to attack by nation-states and other adversaries. This article presents a comprehensive control framework based on lifecycle practices, which is designed to address ICT product integrity concerns in the global marketplace. Hence that general is skilful in attack whose opponent does not know what to defend. —Sun Tzu ( Giles, 1910 ), 496 BC
Register-analysis as a means for eliciting the meaning of literary texts : research article

Register-analysis as a means for eliciting the meaning of literary texts Intuitive reading of a literary text does not enable one to understand howthe text means. For that purpose one needs a suitable semantic theory.This article proposes such a theory, based on the concept of register asmeaning-potential. Situation-types have semiotic properties, which set upexpectations of the kind of meaning likely in that kind of situation, andthose expectations constitute the meaning-potential of the situation, that isthe register, which is realised in whatever texts are actually uttered there.So register determines meaning; and register is determined by situationtype,which can be precisely defined by means of categories of (discourse-)situation. Five such categories are put forward. Their application constitutesregister-analysis. The process is demonstrated on a literary text; andit is claimed that an intuitive, practical-criticism-type analysis could not beas clear, precise and comprehensive as a register-analysis. And the coherenttheory of meaning which supplies the categories also provides aconsistent, defined metalanguage to work in. So register-analysis offers asignificant advance on intuitive reading.
Information Seeking in Full-Text End-User-Oriented Search Systems: The Roles of Domain and Search Expertise

Information seeking is a problem-solving activity that depends on a variety of individual and systemic characteristics. As part of an ongoing investigation of how highly interactive electronic access to primary information affects information seeking, a series of studies explored the effects of domain expertise and search expertise. Professional search intermediaries and experts in computer science, business/economics, and law conducted assigned searches in hypertext or full-text CD-ROM databases. Domain experts were content-driven; they sometimes used technical query terms based on their knowledge, formed expectations related to possible answers, and browsed the full text freely
Application of ABM to Spectral Features for Emotion Recognition

ER (Emotion Recognition) from speech signals has been among the attractive subjects lately. As known feature extraction and feature selection are most important process steps in ER from speech signals. The aim of present study is to select the most relevant spectral feature subset. The proposed method is based on feature selection with optimization algorithm among the features obtained from speech signals. Firstly, MFCC (Mel-Frequency Cepstrum Coefficients) were extracted from the EmoDB. Several statistical values as maximum, minimum, mean, standard deviation, skewness, kurtosis and median were obtained from MFCC. The next process of study was feature selection which was performed in two stages: In the first stage ABM (Agent-Based Modelling) that is hardly applied to this area was applied to actual features. In the second stageOpt-aiNET optimization algorithm was applied in order to choose the agent group giving the best classification success. The last process of the study is classification. ANN (Artificial Neural Network) and 10 cross-validations were used for classification and evaluation. A narrow comprehension with three emotions was performed in the application. As a result, it was seen that the classification accuracy was rising after applying proposed method. The method was shown promising performance with spectral features.
Simulation and Analysis of Multicarrier Code-Division Multiple Access

Multicarrier Code Division Multiple Access (MCCDMA) combines conventional Code Division Multiple Access (CDMA) and Orthogonal Frequency Division Multiplexing (OFDM), so as to allow high transmission rates over severe time-dispersive multi-path channels without the need of a complex receiver implementation. Also MC-CDMA exploits frequency diversity via different subcarriers, and therefore allows the high code rate systems to achieve good BER performances. In this paper, performance analysis of MC-CDMA under various channels, AWGN channel and Rayleigh channel, is done using various spreading techniques such as Walsh spreading and PN sequence spreading. BER versus SNR graphs are plotted and PAPR values were calculated. These results were compared for finding out which type of MC-CDMA system gives a better performance.
The Effects of Microblogging in the Classroom on Communication

This is to certify that the thesis/dissertation prepared By Entitled For the degree of Is approved by the final examining committee: Chair To the best of my knowledge and as understood by the student in the Research Integrity and Copyright Disclaimer (Graduate School Form 20), this thesis/dissertation adheres to the provisions of Purdue University's " Policy on Integrity in Research " and the use of copyrighted material. Further, I certify that this work is free of plagiarism and all materials appearing in this thesis/dissertation have been properly quoted and attributed. I certify that all copyrighted material incorporated into this thesis/dissertation is in compliance with the United States' copyright law and that I have received written permission from the copyright owners for my use of their work, which is beyond the scope of the law. I agree to indemnify and save harmless Purdue University from any and all claims that may be asserted or that may arise from any copyright violation. ______________________________________ Printed Name and Signature of Candidate ______________________________________ Date (month/day/year) ii This is dedicated to my family. Without them I would be nothing. iii ACKNOWLEDGEMENTS I would like to thank all Purdue University faculty members who helped guide me in the writing of this paper. I would like to specifically thank Dr. Mihaela Vorvoreanu for her continued guidance throughout my graduate career. Thank you to all Purdue University faculty of the Computer Graphics Technology department who have helped to shape me into the person I am today. Lastly, I would like to thank my family for always helping and believing in me. This study explored the integration of a microblogging platform, Twitter, into higher education, and how it affected the perceived communication between students and their professors and amongst students. McCroskey (1977) states every individual has a different communication apprehension score, which is a level of anxiety or fear one experiences when communication is anticipated. This research aims to relate this score to the change in communication perception. Data was gathered via surveys, interviews, and observations and was then analyzed using grounded theory methods presented by Strauss and Corbin (1990). The theory generated suggests individuals with average and lower communication apprehension scores had a better experience using Twitter and experienced more of a positive change in perceived communication. This suggests Twitter can be an effective teaching tool in higher education. 1 CHAPTER 1 INTRODUCTION This chapter provides an overview of …
Organic Chemistry: Structure and Reactivity

This text's clear explanations and descriptions of the mechanisms of chemical reactions teach students how to apply principles in order to predict the outcomes of reactions. The Fifth Edition offers a focus on biological applications that renders the text accessible to the majority of organic chemistry students and consistent with the interdisciplinary nature of scientific research.One Small Step features apply familiar concepts to new reagents and reactions, encouraging students to analyze material rather than memorize the outcome to each new reaction.Visualizing the Reaction features help students recognize important reactions by demonstrating the complete mechanisms for each type of reaction. HM ClassPrep with HM Testing CD-ROM includes lecture outlines and line art from the textbook in PowerPoint, the Computerized Test Bank and the Word files of the Test Bank in a new, easy-to-use interface with complete cross-platform flexibility, electronic versions of materials from the Instructor's Resource Manual, and a transition guide that directs instructors through this new edition.
On the bus arbitration for MPEG 2 video decoder

A bus arbitration scheme for the MPEG-2 video decoder VLSI developed by NCTU is proposed in this paper. Compared to the traditional pure stochastic bus scheduling scheme, the internal buffer requirement and bus arbitration overheads are reduced due to the deterministic nature of this strategy. This bus arbitration scheme has been verified using a Verilog simulator and will be implemented in the NCTU MPEG-2 decoder.
Evaluation of optical technologies for home networking at very high-speed

Pendant la derniere decennie, le nombre des ordinateurs portables, assistants personnel numerique et autres terminaux mobiles a massivement augmente. Cela a conduit a une enorme demande de communications sans fil pour offrir la mobilite dans differents endroits tels que les bureaux de travail, les gares ferroviaires ou les aeroports. A ce jour, cette mobilite est principalement offerte par les communications radiofrequences tel que le WiFi, ayant un debit maximal de 300 Mbit/s. Cependant, des nouvelles applications telles que le transfert des videos HD non-compressees ou le sauvegarde des disques durs a distance necessitent une bande passante plus importante (> 2 Gbit/s). Ce debit peut etre transmis en utilisant les communications optiques sans fil. Dans cette these, une nouvelle architecture de transmissions optiques sans fil est proposee et etudiee selon le critere GROWTH (GReen Optical Wireless InTo Home network). Cette architecture est basee sur la distribution des pico-cellules optiques en espace libre dans les differentes pieces de la maison par l? intermediaire d? une interconnexion fibree offrant un debit depassant le Gbit/s. Ce travail est divise en quatre parties : le dimensionnement du systeme et la selection des technologies optoelectroniques associees, la simulation su canal optique hybride (fibre optique + espace libre) en utilisant les logiciel VPI Transmission Maker et Matlab, le choix de la longueur d? onde et finalement, les mesures experimentales pour valider la performance du systeme.
Design and evaluation of communication latency hiding/reduction techniques for message-passing environments

With the availability of fast microprocessors and small-scale multiprocessors, internode communication has become an increasingly important factor that limits the performance of parallel computers. Essentially, message-passing parallel computers require extremely short communication latency such that message transmissions have minimal impact on the overall computation time. This thesis concentrates on issues regarding hardware communication latency in single-hop reconfigurable networks, and software communication latency regardless of the type of network. The first contribution of this thesis is the design and evaluation of two different categories of prediction techniques for message-passing systems. This thesis utilizes the communications locality property of message-passing parallel applications to devise a number of heuristics that can be used to predict the target of subsequent communication requests, and to predict the next consumable message at the receiving ends of communications. Specifically, I propose two sets of predictors: Cycle-based predictors, which are purely dynamic predictors, and Tag-based predictors, which are static/dynamic predictors. The performance of the proposed predictors, specially Better-cycle2 and Tag-bettercycle2, are very well on the application benchmarks studied in this thesis. The proposed predictors could be easily implemented on the network interface due to their simple algorithms and low memory requirements. As the second contribution of this thesis, I show that majority of reconfiguration delays in single-hop reconfigurable networks can be hidden by using one of the proposed high hit ratio predictors. The proposed predictors can be used in establishing a communication pathway between a source and a destination in such networks before this pathway is to be used. This thesis' third contribution is the analysis of a broadcasting algorithm that utilizes latency hiding and reconfiguration in the network to speed the broadcasting operation. The analysis brings up closed formulations that yields the termination time of the algorithms. The thesis' fourth contribution is a new total exchange algorithm in single-hop reconfigurable networks. I conjecture that this algorithm ensures a better termination time than what can be achieved by either of the direct, and standard exchange algorithms. The fifth contribution of this thesis is the use and evaluation of the proposed predictors to predict the next consumable message at the receiving ends of communications. This thesis contributes by claiming that these message predictors can be efficiently used to drain the network and cache the incoming messages even if the corresponding receive calls have not been posted yet. This way, there is no need to copy the early arriving messages into a temporary buffer. The performance of the proposed predictors, Single-cycle, Tag-cycle2 and Tag-bettercycle2, on the parallel applications are quite promising and suggest that prediction has the potential to eliminate most of the remaining message copies.
On the security of XOR-method in biometric authentication systems

A biometric authentication system can be partitioned into a layer that extracts common randomness out of a pair of related biometric sequences [Maurer, 1993] and a layer that masks a key sequence with this common randomness. We will analyze the performance of such a layered system first, and will show that an alternative method, the XOR- echnique, is not always secure.
Signal-to-interference ratio of CDMA in low Earth-orbital satellite communication systems with nonuniform traffic distribution

The performance of a satellite communication system in which the satellites are in non-geostationary orbits, with nonuniform geographical distribution of the traffic load is estimated through analysis. It is shown that when CDMA is applied to the reverse link, the traffic nonuniformity results in a large difference in the signal qualities. The signal above a dense traffic area has a low signal-to-interference ratio (SIR), while the signal over a sparse traffic area has an excessive SIR. In addition, a traffic assignment scheme, which makes the load of the satellite over the dense traffic area smaller, is proposed and its performance improvement is estimated.
Fully Anonymous Privacy Protection Profile Matching in Mobile Social Networks

We analyze the communication overhead and the anonymity strength of the protocols. We then present an enhanced version of the eCPM, called eCPM+, by combining the eCPM with a novel prediction-based adaptive pseudonym change strategy. The performance of the eCPM and the eCPM+ are comparatively studied through extensive trace-based simulations. Simulation results demonstrate that the eCPM+ achieves significantly higher anonymity strength with slightly larger number of pseudonyms than the eCPM.
La idea de centro en la música tonal y su manifestación corporeizada en la performance instrumental

Trabajo publicado en Isabel C. Martinez, Alejandro Pereira Ghiena, Monica Valles y Matias Tanco (eds.). Actas de ECCoM. “La Experiencia Musical: Cuerpo, Tiempo y Sonido en el Escenario de Nuestra Mente". 12o ECCoM. Vol. 2, No 2, Buenos Aires, 2015.
Linguistics of American Sign Language: An Introduction

Completely reorganized to reflect the growing intricacy of the study of ASL linguistics, the 5th edition presents 26 units in seven parts. Part One: Introduction presents a revision of Defining Language and an entirely new unit, Defining Linguistics. Part Two: Phonology has been completely updated with new terminology and examples. The third part, Morphology, features units on building new signs, deriving nouns from verbs, compounds, fingerspelling, and numeral incorporation. Part Four: Syntax includes units on basic sentence types, lexical categories, word order, time and aspect, verbs, and the function of space. The fifth part, Semantics, offers updates on the meanings of individual signs and sentences.Part Six: Language in Use showcases an entirely new section on Black ASL in the unit on Variation and Historical Change. The units on bilingualism and language and ASL discourse have been thoroughly revised and updated, and the Language as Art unit has been enhanced with a new section on ASL in film. Two new readings update Part Seven, and all text illustrations have been replaced by video stills from the expanded DVD. Also, signs described only with written explanations in past editions now have both photographic samples in the text and full demonstrations in the DVD.
Visualization for biological models, simulation, and ontologies

In this dissertation, I present three browsers that I have developed for the purpose of exploring, understanding, and analyzing models, simulations, and ontologies in biology and medicine. The first browser visualizes multidimensional simulation data as an animation. The second browser visualizes the equations of a complex model as a network and puts structure and organization on top of equations and variables. The third browser is an ontology viewer and editor, directly intended for the Foundational Model of Anatomy (FMA), but applicable to other ontologies as well. This browser has two contributions. First, it is a lightweight deliverable that lets someone easily dabble with the FMA. Second, it lets the user edit an ontology to create a view of it. For the ontology browser, I also conduct user studies to refine and evaluate the software.
A flexible methodology for outdoor/indoor building reconstruction from occluded point clouds

Abstract. Terrestrial Laser Scanning data are increasingly used in building survey not only in cultural heritage domain but also for as-built modelling of large and medium size civil structures. However, raw point clouds derived from laser scanning generally not directly ready for the generation of such models. A time-consuming manual modelling phase has to be taken into account. In addition the large presence of occlusion and clutter may turn out in low-quality building models when state-of-the-art automatic modelling procedures are applied. This paper presents an automated procedure to convert raw point clouds into semantically-enriched building models. The developed method mainly focuses on a geometrical complexity typical of modern buildings with clear prevalence of planar features A characteristic of this methodology is the possibility to work with outdoor and indoor building environments. In order to operate under severe occlusions and clutter a couple of completion algorithms were designed to generate a plausible and reliable model. Finally, some examples of the developed modelling procedure are presented and discussed.
A Modified Kernel Fisher Discriminant Analysis Algorithm for Fault Diagnosis

Sampling data of chemical industry process are generally large size, intense nonlinear and noisy. To solve these problems of process state monitoring, a improved fisher discriminant analysis (FDA) algorithm for fault diagnose is proposed. This new algorithm firstly deals with the process data with wavelet transform for de-noising. And then maps the de-noised data onto a high-dimension feature space by a nonlinearity mapping which is built by the kernel function. Finally applies linearity FDA in the feature space. Tennessee Eastman process(TE process) simulation results show that the proposed algorithm is effective, and improves the accuracy rate of fault diagnosis.
Qualitative Research in Education: A User's Guide

PART I: TRADITIONS AND INFLUENCES Chapter 1: Introduction and Overview of the Field Chapter 2: Insights From the Past Chapter 3: Learning How to Be a Qualitative Researcher Chapter 4: Ethical Issues in Qualitative Research Chapter 5: Designing Your Research: Choosing From a Variety of Approaches PART II: GATHERING, ORGANIZING, AND ANALYZING Chapter 6: Embarking on Qualitative Research Chapter 7: Self-Reflexivity and Subjectivity Chapter 8: The Role and Function of a Literature Review Chapter 9: Learning About Others Through Interviewing Chapter 10: Learning About Others Through Observations and Other Techniques PART III: PUTTING IT ALL TOGETHER Chapter 11: Making Meaning From Your Data Chapter 12: Communicating Your Ideas Chapter 13: Judging and Evaluating Chapter 14: Thinking About the Future