Miracle-dz/UniFAR-FTUs huggingface dataset:
Investigations of Multi-channel Auralization Technique for Solo Instruments and Orchestra

Computer modeling of room acoustics is a useful tool in the design of acoustically sensitive spaces and an important outcome from these programs is auralizations. This study examined the perceived changes in realism and source width when listening to multi-channel auralizations compared to single channel auralizations for both solo instruments and a full orchestra. The first experiment, which examined subjective judgments of auralizations made from solo instruments, showed that perceived realism increased as the number of channels was increased from one to four to thirteen, while the relationship between source width and number of channels was less clear. In the second experiment, an orchestra was auralized in four different ways: individual instrumental sections with (i) one channel each and (ii) five channels each; and the entire orchestra emanating from (iii) a single omni-directional source and (iv) a surface source. Listeners’ judgments comparing all of the auralizations showed improved perceived realism with the multiple sources (i, ii) compared to the surface source, and wider source width with the multiple sources compared to the single omni-directional source. No improvement in either realism or source width was found as the number of channels was increased from one to five for the individual sources.
Argument Substance and Argument Structure in Educational Assessment. CSE Report.

Educational assessment is reasoning from observations of what students do or make in a handful of particular circumstances, to what they know or can do more broadly. Practice has changed a great deal over the past century, in response to evolving conceptions of knowledge and its acquisition, views of schooling and its purposes, and technologies for gathering and evaluating response data. Conceptions of what constitutes assessment data, how it should be interpreted, and what kind of inferences are to be drawn differ radically when cast under different psychological perspectives. If we distinguish the structure of assessment arguments from their substance, we see greater continuity. Developments here have been more in the nature of extension, elaboration, refinement, and explication of argument structures, as they have been prompted by more radical changes in culture and substance.
Global connectivity for IPv6 Mobile Ad Hoc Networks

This document describes how to provide Internet connectivity with mobile ad-hoc networks. It describes how to obtain a globally routable address and internet gateway operation. Once a manet node obtains a global address from an internet gateway, it may exchange data with nodes on the Internet. This Internet access method is not dependent on a particular manet protocol. Further, use of global connectivity with Mobile IPv6 is specified.
Data processing networks made easy : improving development possibilities for people with limited computer science knowledge

Data processing networks are not only used by computer science people, nowadays researchers in all kinds of research topics are processing large amounts of data. Considering the required knowledge and amount of time, the development of a distributed and/or (de)centralized data processing network is often not an option for them. Sometimes they create scripts for the various processing steps, which are manually executed step-by-step. It is clear that such a procedure is far from optimal, especially in a streaming data environment. Due to the popularity of the internet, distributed data or even decentralized processing is used more often. By introducing decentralization or distributed data, the complexity of the overall processing network is increased dramatically. Both aspects require some overhead which lowers the understandability of the data processing network in general. We consider the following problems in supporting the development of data processing networks by people with limited computer science knowledge. First, a large group of users does not have a good overall understanding of the key concepts and reusable components of a data processing networks. Second, existing architectural styles are not well-suited for documenting a data processing view. Third, the current tool support is insufficient for people with limited computer science knowledge. To tackle the first problem, we introduce a basic model for data processing networks. Implementing a data processing network is a costly-process, it is important that the users have a good understanding of the general structure. This basic model can be used to overcome a potential knowledge gap between the users and developers. To create a more detailed (technical) view of a data processing network, we introduce a specialized model. As a new architectural style, we introduce the data processing style for documenting a data processing view. For documenting a more detailed (technical) view of a data processing network, we introduce the DatProNet style. By creating a specialized data processing view, the understandability of the general structure is increased. As a solution for the third problem, we propose the DatProNet framework that supports the development of data processing networks by people with limited computer science knowledge. The complete development life cycle of data processing networks is covered by the DatProNet framework, which reduces the development and maintenance effort and increases the ease of use. XML-editors can be used for the creation, and validation, of architectural descriptions. Based on a valid architectural description, the framework can generate a concrete implementation. The DatProNet framework provides a set of reusable components, which can be used to extend the framework if needed. Communication with external systems is possible through the use of serializers. The framework is completely implemented in JAVA, which implies a high portability.
A graphical interface for real-time signal routing

This paper describes DspMap, a graphical user interface (GUI) designed to assist the dynamic routing of signal generators and modifiers currently being developed at the International Academy of Media Arts & Sciences. Instead of relying on traditional box-and-line approaches, DspMap proposes a design paradigm where connections are determined by the relative positions of the various elements in a single virtual space.
Signature Scents

ABSTRACT Perfume critique is an underdeveloped academic field, and this includes considerations of perfume as a theme within other art forms such as literature. In this article, Angela Carter's Wise Children and Monika Fagerholm's Wonderful Women by the Sea are read alongside perfume blogs in order to analyze the significance of perfume references in the novels. It is demonstrated that the authors' choice of perfumes for their characters plays a crucial part in their characterization, especially in relation to the theme of identity change. Using Alfred Gell's analysis of perfume use as bound up with “the transcendence of the sweet life,” it is argued that female characters use perfume to become someone else, sometimes a past self. Furthermore, the use of perfume as a literary device in these novels is shown serve as the vehicle for a feminist critique of the division between “masculine” “high” and “feminine” “low” culture.
Efficient Secure Two-Party Protocols: Techniques and Constructions

The authors present a comprehensive study of efficient protocols and techniques for secure two-party computation both general constructions that can be used to securely compute any functionality, and protocols for specific problems of interest. The book focuses on techniques for constructing efficient protocols and proving them secure. In addition, the authors study different definitional paradigms and compare the efficiency of protocols achieved under these different definitions.The book opens with a general introduction to secure computation and then presents definitions of security for a number of different adversary models and definitional paradigms. In the second part, the book shows how any functionality can be securely computed in an efficient way in the presence of semi-honest, malicious and covert adversaries. These general constructions provide a basis for understanding the feasibility of secure computation, and they are a good introduction to design paradigms and proof techniques for efficient protocols. In the final part, the book presents specific constructions of importance. The authors begin with an in-depth study of sigma protocols and zero knowledge, focusing on secure computation, and they then provide a comprehensive study of the fundamental oblivious transfer function. Starting from protocols that achieve privacy only, they show highly efficient constructions that achieve security in the presence of malicious adversaries for both a single and multiple batch executions. Oblivious pseudorandom function evaluation is then presented as an immediate application of oblivious transfer. Finally, the book concludes with two examples of high-level protocol problems that demonstrate how specific properties of a problem can be exploited to gain high efficiency: securely computing the kth-ranked element, and secure database and text search. This book is essential for practitioners and researchers in the field of secure protocols, particularly those with a focus on efficiency, and for researchers in the area of privacy-preserving data mining. This book can also be used as a textbook for an advanced course on secure protocols.This book is essential for practitioners and researchers in the field of secure protocols, particularly those with a focus on efficiency, and for researchers in the area of privacy-preserving data mining. This book can also be used as a textbook for an advanced course on secure protocols.This book is essential for practitioners and researchers in the field of secure protocols, particularly those with a focus on efficiency, and for researchers in the area of privacy-preserving data mining. This book can also be used as a textbook for an advanced course on secure protocols.
Combined Binary and Decimal Floating-Point Unit

There has been renewed interest in a number system for integrated circuits called decimal floating-point. There are inherent problems in todays binary floating-point numbers that require financial computations to be performed in software which is 100-1000 times slower than a hardware based equivalent. For example adding a 5% tax to a $0.70 phone call will round off wrongly in binary floating-point. With the increase in transistor count surpassing the increse in clock speed on modern computer processors, manufacturers are looking into new strategies for speeding up computations including the financial ones and a commercial processor with decimal floating-point already exists. Despite the interest, the problems of decimal arithmetic slower and requiring more area than binary remain. This thesis explores the possibility of combining binary and decimal floating-point units thereby saving area without sacrificing too much speed. In the course of this investigation a novel decimal fused multiply-add (FMA) based floating-point unit is developed and combined with a known binary FMA algorithm. This FMA primarily uses known components, but one major component – the decimal leading one predictor – is new. Synthesis results show that the latencies for the binary and decimal paths are comparable to current solutions, but the area used is much larger than the individual units. In order to make the FMA fulfill the goals of this thesis, further research should look into reducing area in the FMA. Before the area is reduced significantly, it is not recommended to use a combined binary and decimal floating-point unit.
Proceedings of the 29th ACM SIGACT-SIGOPS symposium on Principles of distributed computing

This volume contains 39 regular papers and 48 brief announcements selected for the on Principles of Distributed Computing, held on July 25-28 in Zurich, Switzerland. 179 papers were submitted to the regular papers track, and 57 were submitted to the brief announcements track. The selection of papers was done by the program committee in a meeting that took place in EPFL, Lausanne, on April 9, 2010, following electronic discussions. Richard van de Stadt handled the electronic submissions and discussions with CyberChairPro. This volume also includes abstracts of keynotes by Hagit Attiya, Eric Brewer and Pierre Fraigniaud. The conference also hosted the 60th birthday celebration of Danny Dolev and Eli Gafni, with talks from Hagit Attiya, Yehuda Afek, Amotz Bar-Noy, Idit Keidar, Rachid Guerraoui, Michael Merritt, Sergio Rajsbaum and Nir Shavit. It is expected that many of these papers will appear in more polished form in refereed journals. A selection of papers has been invited to appear in the Journal of the ACM and a special issue of Distributed Computing dedicated to PODC 2010. The program committee decided to share the best paper award between two papers: Deterministic Distributed Vertex Coloring in Polylogarithmic Time by Barenboim and Elkin, and Breaking the O(n2) Bit Barrier: Scalable Byzantine Agreement with an Adaptive Adversary, by Saia and King.
Segmentation Method of MRI Using Fuzzy Gaussian Basis Neural Network

Considering the features of magnetic resonance imaging (MRI), a segmentation method of MRI based on fuzzy Gaussian basis neural network (FGBNN) is proposed. In proposed method, the fuzzy inference is realized by neural network. Gaussian basis function is used as fuzzy membership function, and error backpropagation (BP) algorithm is used to train the neural network. The experimental results show that the proposed method has higher segmentation precision and faster network learning speed than the segmentation method based on traditional radial basis function neural network (RBFNN). Keywords—Fuzzy neural network, magnetic resonance image, image segmentation
Super-peer architectures for distributed computing

Determining the best overall topology for general-purpose distributed computing-Atul Saini Entire contents © Fiorano Software and Affiliates. All rights reserved. Reproduction of this document in any form without prior written permission is forbidden. The information contained herein has been obtained from sources believed to be reliable. Fiorano disclaims all warranties as to the accuracy, completeness or adequacy of such information. Fiorano shall have no liability for errors, omissions or inadequacies in the information contained herein or for interpretations thereof. The opinions expressed herein are subject to change without notice.
Il problema della valutazione psicometrica di soggetti adulti autistici non verbali. Somministrazione del test Leiter-R

L’autismo e un disturbo pervasivo dello sviluppo neurale caratterizzato da un deficit delle interazioni sociali e della comunicazione e da comportamento ripetitivo e stereotipato. Recenti studi hanno evidenziato la presenza di ritardo mentale nel 70% dei soggetti con ASD, di cui il 40% di grado grave. Lo scopo di questo studio e stato quello di trovare un test adeguato per poter misurare le capacita intellettive degli ospiti non verbali di una farm community, Cascina Rossago, che non erano mai stati valutati prima per l’assenza di uno strumento adeguato per poter testare il quoziente intellettivo (IQ) di soggetti adulti autistici non verbali. Si e scelto di utilizzare la scala di valutazione cognitiva Leiter-R per la sua attendibilita nel valutare i soggetti non verbali e per la scarsa influenza degli aspetti socio-culturali e delle competenze scolastiche sui risultati. Questa scala viene comunemente utilizzata per la misurazione dell’IQ di soggetti autistici non verbali con eta inferiore ai 21 anni, ma nel nostro studio abbiamo voluto testare la sua efficacia nel valutare soggetti adulti con eta superiore al limite precedentemente detto.
Suggesting Email View Filters for Triage and Search

Growing email volumes cause flooded inboxes and swelled email archives, making search and new email processing difficult. While emails have rich metadata, such as recipients and folders, suitable for creating filtered views, it is often difficult to choose appropriate filters for new inbox messages without first examining messages. In this work, we consider a system that automatically suggests relevant view filters to the user for the currently viewed messages. We propose several ranking algorithms for suggesting useful filters. Our work suggests that such systems quickly filter groups of inbox messages and find messages more easily during search.
Instagram e celebridades: a utilização da fotografia nas redes sociais

A dicotomia cidade-urbanismo versus casa-lar, a organizacao dos espacos publico e privado e a producao de conteudos como construcao e definicao do espaco individual sao a ignicao da analise imagetica e influenciam a configuracao do espaco fisico. Este artigo reparte-se entre uma reflexao teorica – envolvendo o Homem, o espaco fisico e a utilizacao de smartphones – e uma exegese visual de fotografias capturadas por estes dispositivos de comunicacao movel e exibidas voluntariamente por celebridades nas redes Facebook, Twitter e Instagram. Pretende-se evidenciar a forma como as celebridades lidam com os conceitos de publico e privado, representam o self e expoem as suas dinâmicas diarias, nomeadamente nas redes sociais. Visivel e a crescente publicitacao do privado a par da privatizacao do publico num contexto de microcosmo tecnologico.
Evaluation of the Method to Search Keyword-non-including Files based on the Inter-file Relationship

Since the number of files in a file system explosively increases in recent years, it becomes more and more difficult for users to find desired files. To attack the problem, desktop search functions based on full text search methods have been developed. However, the files which do not include the given keywords, such as picture and experimental data files, still cannot be found by such methods. It becomes much harder when those files are located in different directories, even if they have some association with keywords. Till now, we proposed a method to calculate the inter-file relationship by using file access logs in a file server. In this paper, we evaluate the method to search those keyword-non-including files by using the relationship. The evaluation results by testers indicated that the proposed method capable of searching the keyword-non-including files improves the precision and recall of search results.
P300 Detection Using a Multilayer Neural Network Classifier Based on Adaptive Feature Extraction

This paper proposes two adaptive schemes for improving the accuracy and the transfer rate of EEG P300 evoked potentials: a feature extraction scheme combining the adaptive recursive filter and the adaptive autoregressive model and a classification scheme using multilayer neural network (MNN). Using the signals extracted adaptively, the MNN classifier could achieve 100% accuracy for all the subjects, and its transfer rate was also enhanced significantly. The proposed method may provide a real-time solution to brain computer interface applications
Concert Tour Success in North America: An Examination of the Top 100 Tours from 1997 to 2005

Radio airplay, album sales and concerts provide revenues to songwriters, music labels, and musicians. From 1997 to 2005, concert revenues in North America increased from $1.3 billion to $3.1 billion. We analyze concert trends by investigating pricing and attendance, the superstar phenomenon, and structural changes in the way the concert tour industry operates. To conduct this analysis we look at the performance of the top 100 tours from 1997 to 2005. These data comprise a chart of sorts—an annual review of the performance of the concert industry, with performers being ranked in terms of gross concert revenues.
Computational agents that learn about agents: Algorithms for their design and a predictive theory of their behavior

Computational Agents That Learn About Agents: Algorithms for Their Design and a Predictive Theory of Their Behavior by Jos e M. Vidal Chair: Edmund H. Durfee In this thesis, we show how to build agents that learn about agents in Multi-Agent Systems (MASs) composed of learning agents. We give a framework for describing a MAS and its agents, along with their behaviors and the errors in these behaviors. The framework is supplemented with notation that captures the knowledge of agents with recursive models of other agents. Working under the assumption that agents can generate recursive models of other agents, we design an algorithm (LR-RMM) that works by calculating an agent's expected gain in order to tell the agent when it should stop thinking about other agents and take action. We implement LR-RMM and verify its results in the Pursuit Task. We then consider agents that must learn models of other agents via observation. We extend our framework (CLRI) to capture the agents' learning abilities, regardless of the particular machine learning algorithms used by the agents, and the degree to which the agents impact each others' behaviors. CLRI predicts the correctness of the expected behavior of any learning agent in a MAS. Since agents impact each other, an agent's desired behavior might change due to changes in the other agents' behaviors, as caused by their learning. The CLRI framework takes all these changes into account when predicting the correctness of an agent's expected behavior. We con rm the CLRI predictions with experimental results from our research and from the research literature. While determining the CLRI parameter values requires an analysis of the agent's implementation, we use computational learning theory to calculate bounds on some of these parameters. These bounds apply regardless of the agent's learning algorithm. Finally, we study a speci c market-based MAS in detail. We con rm the agents' behaviors, as predicted by the CLRI framework, and present other ndings speci c to market-based MASs, such as the fact that learning agents make the system more robust to the presence of malicious agents, and that agents can expect decreasing returns for increasing levels of strategic thinking. c Jos e M. Vidal 1998 All Rights Reserved
English Parsers: Some Information based observations

Last decade has seen introduction of sev­ eral parsers for English ranging from rule based to statistical based. In recent years there is also a growing trend towards pro­ ducing dependency output in addition to the constituency trees. The dependency format is preferred over the constituency not only from evaluation point of view but also because of its suitability for a wide range of NLP tasks. However there is no consensus among the dependency parser developers on the number of de­ pendency relations and names of these relations. Paninian Grammar (PG), the first dependen­ cy formalism, though is developed necessari­ ly for Sanskrit, has potential to provide guidelines for producing the dependency out­ put for English. We first summarize the is­ sues involved with reference to English lan­ guage parsing based on the dependency for­ mat output of the current English parsers. Next we highlight the Information theoretic point of view of Paninian Grammar. Fourth section contains guidelines for producing the dependency output for English, in the light of PG. We conclude with some suggestions for evaluation of existing parsers.