Miracle-dz/UniFAR-FTUs huggingface dataset:
Cues and Signals: An Ethological Approach to Music-Related Emotion

L’ethologie — l’etude du comportement animal — apporte des connaissances permettant une meilleure comprehension de la maniere dont les sons evoquent des emotions chez les auditeurs. La recherche ethologique moderne a associe des concepts semiotiques tels que signaux et indices a la theorie de l’evolution. Les concepts sont illustres par l’utilisation de recherches empiriques sur la tristesse, le chagrin, le sourire, la bouderie, la mignonnerie et le sarcasme. Une perspective evolutionnaire devoile d’importants problemes concernant le modele habituellement accepte de la communication emotionnelle (ECM : Emotion Communication Model). Me fondant sur le travail de Morton (1977), je propose un modele acoustique ethologique (AEM : Acoustic Ethological Model). Je suggere que les signaux ethologiques offrent un quatrieme mecanisme — combine aux associations acquises, aux processus de miroir et aux evaluations cognitives — grâce auquel les sons peuvent suggerer des emotions chez les auditeurs.
Designing a survey to examine an anonymisation method for driver videos

Data collected during naturalistic driving studies often includes video of the driver’s face. Due to the Data Privacy Act (“Personuppgiftslagen” (PuL) in Swedish), it is desirable to find a good method that can make the driver’s face anonymous, while keeping the original driver‘s facial expressions. In the unEye project, an attempt to create such method was made. Using this method, the original driver’s facial expressions are coded into action units which are then used to construct a corresponding video in which the driver face is replaced by an animated face model. This thesis project was conducted to validate whether the anonymisation method built in the unEye project could really achieve its objectives. In particular, this thesis contributes in validating whether a human viewer can identify who the original driver was from the animated version of the video and examining how well the facial expressions are translated when creating the animated driver videos. For this, a computer-based survey was designed and performed. The survey has two different parts corresponding to the two different validation tasks. The results from the survey showed some unexpectedly high number of correct classifications in the identification part. However, some explanations were found which suggest that these high numbers were most likely due to other reasons than the ability of the test participants to identify the driver. For the expressions part, the result showed that surprise was the best preserved expression and that anger was the most poorly preserved one. The average recognition proportion of the expressions was 24% and some patterns were found in the results which indicate that the details in the face are not translated well enough, especially in the regions around the mouth, eyes and eyebrows. In conclusion, while the method is able to make the driver face anonymous, it should be improved so that the facial expressions are better translated. The results were also examined with respect to the age, gender, area of occupation and education level of the test participants and no clear difference could be found within these groups. This indicates that the result could be generalised to a larger population.
Building blocks for speech

For parents: (Lynch, Brookshire & Fox, 1980) 18 months ~25% intelligible 2 year olds 50-75% intelligible 3 year olds 75%-100% intelligible For unfamiliar listener: (Flipsen, 2006) 18 months ~25% intelligible 2 year olds ~50% intelligible 3 year olds ~75% intelligible 4 year olds 100% intelligible Building Blocks for Language 0-1 month – crying and vegetative sounds 2-3 months eye gaze 6-9 months-joint attention 9-12 months -using gestures 12-15 months--following simple commands 18 months – symbolic play, pretend play 24 months – sequencing of activities 36 months – episodic play
Instructional Design in Technical Areas

Advances in the field of cognitive science have yielded a large amount of information about how we learn, think and solve problems which can now be used to develop much more effective instructional processes. In this book, cognitive principles and a large range of experiments have been used to devise a variety of instructional designs. Topics covered include: aspects of cognitive architecture relevant to instructional design; cognitive load theory; instructional designs associated with learning to solve problems; and mixing audio and visual materials. Instructional designers, teachers, trainers and education students are provided with techniques to develop students' understanding, learning and problem solving, with the rationale behind these techniques clearly explained.
Xyce parallel electronic simulator design : mathematical formulation, version 2.0.

This document is intended to contain a detailed description of the mathematical formulation of Xyce, a massively parallel SPICE-style circuit simulator developed at Sandia National Laboratories. The target audience of this document are people in the role of 'service provider'. An example of such a person would be a linear solver expert who is spending a small fraction of his time developing solver algorithms for Xyce. Such a person probably is not an expert in circuit simulation, and would benefit from an description of the equations solved by Xyce. In this document, modified nodal analysis (MNA) is described in detail, with a number of examples. Issues that are unique to circuit simulation, such as voltage limiting, are also described in detail.
Collaborative Object Tracking Based on Co-Training

Moving object tracking is a key problem in computer vision and has many applications in various fields. This paper proposes a collaborative tracking method based on Co-Training frame work. The method fuses information from two types of features space to describe the object. The model is updated with Co-Training,which avoids the error accumulation problem. The experiment demonstrates the performance of the method under complex scenarios.
Bayesian Parametric and Nonparametric Methods for Multiple QTL Mapping and SNP-Set Analysis

Wonil Chung: Bayesian Parametric and Nonparametric Methods for Multiple QTL Mapping and SNP-Set Analysis (Under the direction of Professor Fei Zou) Many complex traits and human diseases, such as blood pressure and body weight, are known to change over time. The genetic basis of such traits can be better understood by repeatedly collecting data over time. The resulting longitudinal data provide us useful resources for studying the joint action of multiple time-dependent genetic factors. In the first part of the dissertation, we extend two existing Bayesian multiple quantitative trait loci (QTL) mapping methods from univariate traits to longitudinal traits. Our first approach focuses on mapping genes with main effects and two-way gene-gene and gene-environment interactions. Multiple QTL are selected by a variable selection procedure based on the composite model space framework. Our second approach presents a Bayesian Gaussian process method to map multiple QTL without restricting to pairwise interactions. Rather than modeling each main and interaction term explicitly, the nonparametric Bayesian method measures the importance of each QTL, regardless whether it is mostly due to a main effect or some interaction effect(s), via an unspecified function. We assign a Gaussian process prior to this unknown function. For the unstructured covariance matrix, both approaches employ a modified Cholesky decomposition. For data where phenotype measurements are not collected at a fixed set of time points across all samples, we propose a grid-based approach which parsimoniously approximates the covariance matrix of each subject as a function of a covariance matrix defined on a set of pre-selected time points. For most genome-wide association studies (GWAS), power to detect an association
Decentralized object finding using forwarding addresses (object, network, distribution)

A problem that must be solved in designing a large distributed computing system is ensuring that processors can "find" all of the "objects" that they have the right to access. To avoid the potential reliability problems and bottlenecks that can be introduced by centralized services it is desirable that object finding be decentralized and allow any group of processors to proceed independently and autonomously. Given a model of a decentralized system in which objects are analogous to moveable physical objects and in which access rights are carried only by proper names, we examine in detail the implications of using forwarding addresses for finding objects. Special emphasis is placed on the issues of performance, active resource management, and high availability through distribution. We analyze the cost of using each of several object finding protocols based on forwarding addresses, deriving ammortized worst case upper and lower bounds as well as estimates for the average case. The average case costs of two simple protocols are analyzed using Markov chains, revealing that the mean cost per access is order of the square root of N, where N is the number of distinct processors that an object visits. The worst case costs of a path compressing protocol are determined to be order of log N. If the object is accessed a times and moves m times, then all cost estimates are decreasing functions of a/m. We provide a detailed specification of a possible implementation of the PCacc protocol. One extension of the basic implementation involves the addition of a mechanism called an inexact reference set. This extension enables a processor to actively manage its resources, both enabling it to reclaim the storage occupied by forwarding addresses and to control the use of storage occupied by objects. Another extension that we describe is that of allowing forwarding addresses to point to the multiple processors that host distributed objects. We show that this extension ensures enhanced accessibility in the presence of processor faults.
Contextualizing Collections: Using Virtual Reality in Archaeology Exhibitions

com/group/NAME-AAM/. Not all museum objects are great works of art, exceptional examples of craftsmanship, or mementoes of world changing historical events. We as museum professionals know this, of course, but for our visitors it might be challenging to make sense of domestic objects that are not aesthetically pleasing or of uncertain historical importance. Especially for museums with historical collections, the same question can arise again and again: How can we engage our visitors with the tools or everyday household items that were used by people who lived centuries ago? In the Allard Pierson Museum (APM), the classical antiquities museum of the University of Amsterdam, we are considering this question as we plan the redevelopment of our permanent exhibition space. While many of the objects in our collections were once everyday items, it can be challenging for our modern visitors to interpret them. For example, visitors might struggle to associate a metal hook-shaped object with personal hygiene, while in Roman times the strigil was as ubiquitous as the towel is today. It was used in bath houses, or after sporting events, to scrape oil and dirt from the body. Objects like this make us reflect upon the visitor experience and ask ourselves how we can help our visitors understand the original uses for the objects in our collections.
Specifying and verifying multiagent systems using the cognitive agents specification language (CASL)

In this thesis, we introduce a specification language (CASL) and verification environment (CASLve) for multiagent systems. We use the situation calculus [52] with Reiter's solution to the frame problem [62]—enhanced with predicates to describe agents' knowledge [64], beliefs, and goals—to formally, perspicuously, and systematically describe the effects of actions on the world and the mental states of agents. We add INFORM, REQUEST, and CANCELREQUEST actions to model inter-agent communication, and investigate properties of multiagent knowledge change and goal change, as well as belief change. We use the notation of the concurrent, logic programming language ConGolog [17] to specify the behaviour of agents. ConGolog has a formal semantics defined in the situation calculus, which facilitates the process of reasoning about the behaviour of individual agents and the system as a whole. We provide an environment for verifying properties of CASL specifications, by encoding the situation calculus, its extensions to handle mental states, and ConGolog in the PVS verification system [54], and proving lemmas which are useful for verifying CASL specifications. These include proving that bounded-loop ConGolog programs terminate, and providing a framework far compositional verification of ConGolog programs. We then specify three multiagent systems using CASL and prove some properties of the specifications.
State-space derivation of an interleaved boost converter

Nowadays applications of the DC converters are not only importance for low power DC application, but also for high DC applications. By these reason developments of the interleaved converters to increase the DC converter power rating become very important. However, increasing phase numbers in the interleaved converter also will increase the switching components number and will increase the complexity of the converter model. In this paper a modeling of the two phases interleaved boost converter by using an state space averaging model analysis is presented. With thorough analysis of the operating principle of the converter and equivalent circuits model for continuous conduction mode are derived. The effectiveness of the model is verified by computer simulations model in the MATLAB/SIMULINK environment. The simulations result shown that the simulation model can generate output voltage of the converter in condition, dynamic and steady state response.
SYNOD: An Environment for Neural Systems Simulations Language Interface and Tutorial

Computer simulations of neural systems, ranging from very detailed compartmental models of single neurons to large scale neu-ral networks are quite common. Often their results are used as evidence for or against a certain theory. However, many neuro-simulations share a number of problematic features. Results from one laboratory are hard to reproduce in another, since diierent neuron or network models are used, each with their own speciic software and implicit assumptions. Also, the mapping from measures obtained in simulations onto their 'real world' counterparts is not always well deened. From this we draw two conclusions: First, the simulations should allow for identical processing of simulated and experimental data, preferably using the same analysis tools; we refer to such simulations as in virtu experiments. Second, and more important, it should be possible to implement diierent models , not necessarily at the same level of description, within a single common scheme. With this goal in mind, we developed a new conceptual framework for neural simulations, using an object-oriented approach. Based on these principles we implemented a C++ class library for neural system simulations (SYNOD), together with a language interface (SLI) for the description and execution of in virtu experiments. In this document we describe the language interface, and provide a tutorial for using the SYNOD/SLI environment to perform neural network simulations. PostScript is a trademark of Adobe Systems Incorporated. Scientiic WorkPlace is a trademark of TCI Software Research. All other brand and product names are trademarks of their respective companies. Parts of the gure on the back cover were taken with permission from the September 1979 issue of Scientiic American (Edward V. Evarts Brain Mechanisms of Movement, gure by Bunji Tagawa). Preface SYNOD is a simulation environment, developed for the study of artiicial neuronal systems. Its main objective is to create a exible and computationally eecient tool to simulate realistic neural networks models, providing the means to combine diierent levels of discription (e.g. ionic channels, stochastic point processes, population activity) within a single network. The SYNOD project was started in 1993 in the framework of the MSc studies of Marc-Oliver Gewaltig and Markus Diesmann at the Institut f ur Neuroinformatik at the Ruhr-Universitt at Bochum (Bochum, Germany), and has been operational since early 1994. This document describes its present status and provides an introduction to its usage. Further developments on SYNOD are currently being pursued in a joint eeort at the Center …
NUMACROS: data parallel programming on NUMA multiprocessors

Data parallel programming has been widely used in developing scientific applications on various types of parallel machines: SIMD, MIMD distributed memory machines, and UMA shared memory machines. On NUMA shared memory machines, data locality is the key to good performance of parallel applications. In this paper, we propose a set of macros (NUMACROS) for data parallel programming on NUMA machines. NUMACROS attempts to achieve both ease of programming and data locality for performance. Programs written using NUMACROS are nearly as short and easily readable as sequential versions of the programs. To obtain data locality, data and loops are distributed and partitioned in a coordinated fashion among the processors. Although global address spaces facilitate data distribution on NUMA systems, a naive implementation of an application will suffer from high costs. To reduce the cost, a number of approaches have been proposed and evaluated. These include index precomputing, index checking, loop transformation, and others. Our experimental results, with the Hector multiprocessor, show that these approaches are effective. While such facilities will be provided by compilers in the long run, NUMACROS is a helpful interim step.
Characterizing Application Runtime Behavior from System Logs and Metrics

Large-scale systems are heavily shared resource environments where a mix of applications are launched concurrently competing for network and storage resources. It is essential to characterize the runtime behavior of these applications for provisioning system resources and understanding the impact of application s performance when competing for resources. In this paper, we study the use of zero- and low-overhead system logs and other system metric data for characterizing the runtime behavior of several applications. We present our preliminary work on estimating individual application s I/O demands by observing file system usage pattern over multiple runs, and interpreting application s network utilization characteristics by observing link-layer error logs. We also present preliminary findings on using such information in making context-sensitive scheduling decisions that minimize potentially negative interactions between applications competing for shared resources. Our analysis is based on four months of system log data collected on one of the world s largest supercomputing facilities, the Jaguar XT5 petaflop system at Oak Ridge National Laboratory.
La rendición de Menorca. Un análisis de prensa

Durante la guerra civil espanola (1936-1939), la isla de Menorca fue la ultima en caer en manos franquistas del conjunto de las islas Baleares, el resto de las cuales llevaba mas de 2 anos en poder de los sublevados. Su posicion geoestrategica y los hechos acaecidos desde el golpe de estado de 1936 generaron una intensa actividad diplomatica y de espionaje de todas las potencias europeas que despues acabarian combatiendo en la 2a Guerra Mundial. Los medios no escapan a estos efectos, reflejando tanto en sus coberturas como en las limitaciones de estas su posicion delante de este evento, especialmente los medios editados en el estado espanol, donde se situaba el epicentro del conflicto. Por ello, se aplica un analisis de contenido a la cobertura de medios republicanos, franquistas e internacionales, con el objetivo de inferir la relacion entre la informacion brindada por los medios y los hechos verificables de este episodio historico, para el cual se desarrolla un marco especifico. En esencia, buscamos profundizar en un episodio historico relativamente desconocido en el conjunto de la guerra civil espanola pero con una gran importancia por los recursos y paises implicados en la situacion que se desenvolvia en la isla, cuyas acciones podian desencadenar en cualquier momento una guerra mundial que todos los implicados querian retrasar hasta estar preparados militarmente. During the Spanish Civil War (1936-1939), the island of Menorca was the last to fall into the insurgent hands of the Balearic Islands, the rest of which, had fallen 2 years ago. Its geostrategic position and the events since the coup of 1936 generated a intense diplomatic and intelligence activity of all the European powers that would end fighting after in the II World War. Media don’t escape from these effects, reflecting at this coverage and limitations of these, their position at this event, especially the media published in the Spanish state, the epicenter of the conflict. Therefore, a content analysis is applied to cover loyalty, insurgent and international media in order to infer the relationship between the information provided by the media and verifiable facts of this historical episode, for which a framework is developed specific. In essence, we seek to deepen a relatively unknown historical episode in the whole of the Spanish civil war, but with great importance based of the resources and countries involved in the island situation, whose actions could trigger at any time a world war that everyone involved are interesting to delay to be prepared militarily.
Real Time Conflict Resolution in Automated Guided Vehicle Scheduling

Abstract : While there have been significant advances in material handling techniques over the past decade, the primary growth in this technology has been in the areas of robotics, automated guided vehicle (AGV) systems, and automated storage and retrieval systems (AS/RS). The control of AGVs and the development of efficient algorithms to manage material handling problems have been areas of research recently demanding much attention. Previous researchers addressed the control of AGVs over networks containing uni-directional paths. In this work, a shortest path algorithm is embedded within a branch-and-bound procedure to generate conflict-free AGV routes through bi-directional networks. The resulting methodology efficiently resolves conflicts that would normally occur among AVGs traveling in complex AGV systems. Development of this method is discussed in detail and the computational performance of a most encouraging representative algorithm is presented. Keywords: Routing and scheduling algorithms. Theses.
Open source software from commercial firms--tools, complements, and collective invention

In recent years, open source software such as GNU/Linux, Apache, or Perl has received considerable attention. Commonly, the term is understood to imply that the software is developed by geographically dispersed volunteers. While this is true in many cases, corporate interest in and contributions to open source software have recently increased enormously, IBM being the most prominent example. The purpose of this paper is to analyze firms’ benefits and risks from contributing to software that does not allow to charge licensing fees, and that can be freely used and even modified by anyone. Corporate contributors to open source software are classified into users of the software and sellers of complements. For both groups, one of the biggest potential benefits from contributing to open source software is that outside parties, individuals as well as other firms, join in the collaborative development of the software. The central question is if this benefit does indeed materialize. Case studies, literature analysis, and a theoretical discussion show that an “open source community of commercial firms” is indeed possible, provided certain conditions are fulfilled. Finally, a parallel to the phenomenon of “collective invention” is drawn.