Miracle-dz/UniFAR-FTUs huggingface dataset:
Tone and Voice : A Derivation of the Rules of Voice-Leading from Perceptual Principles

The traditional rules of voice-leading in Western music are explicated using experimentally established perceptual principles. Six core principles are shown to account for the majority of voice-leading rules given in historical and contemporary music theory tracts. These principles are treated in a manner akin to axioms in a formal system from which the traditional rules of voice-leading are derived. Nontraditional rules arising from the derivation are shown to predict formerly unnoticed aspects of voice-leading practice. In addition to the core perceptual principles, several auxiliary principles are described. These auxiliary principles are occasionally linked to voice-leading practice and may be regarded as compositional “options” that shape the music-making in perceptually unique ways. It is suggested that these auxiliary principles distinguish different types of part writing, such as polyphony, homophony, and close harmony. A theory is proposed to account for the aesthetic origin of voiceleading practices.
Research on Test Automation in the Field of Book Publishing Based on CNMARC Standards

In view of the problem of the non-uniform on bibliographic information standardization existed in the field of book publishing informationization construction, this paper brings forward a new method of automatic generation of test cases based on CNMARC standard. By using the principle of automatic machine to analysis the rules series based on CNMARC standard, and taking use of both decision table techniques and technologies of generating random data to generate test data, we give the design scheme of a tool for automatic generation of test cases. Finally, the concrete examples demonstrate the effectiveness and practicability of the proposed algorithm.
Overview of our approach 2 Line Tracking ( LT ) : Updating of Homographies

This article proposes a global approach to the rectification of sport sequences, to estimate the mapping from the video images to the terrain in the ground plane without using position sensors on the TV camera. Our strategy relies on three complementary techniques: (1) initial homography estimation using line-feature matching, (2) homography estimation with line-feature tracking, and (3) incremental homography estimation through point-feature tracking. Together, they allow continuous homography estimation over time, even during periods where the video does not contain sufficient line features to determine the homography from scratch. We illustrate the complementarity of the 3 techniques on a set of challenging examples.
Detecting Design Patterns in Object-Oriented Program Source Code by Using Metrics and Machine Learning

Detecting well-known design patterns in object-oriented program source code can help maintainers understand the design of a program. Through the detection, the understandability, maintainability, and reusability of object-oriented programs can be improved. There are automated detection techniques; however, many existing techniques are based on static analysis and use strict conditions composed on class structure data. Hence, it is difficult for them to detect and distinguish design patterns in which the class structures are similar. Moreover, it is difficult for them to deal with diversity in design pattern applications. To solve these problems in existing techniques, we propose a design pattern detection technique using source code metrics and machine learning. Our technique judges candidates for the roles that compose design patterns by using machine learning and measurements of several metrics, and it detects design patterns by analyzing the relations between candidates. It suppresses false negatives and distinguishes patterns in which the class structures are similar. As a result of experimental evaluations with a set of programs, we confirmed that our technique is more accurate than two conventional techniques.
The Effects of Media Exposure to Students’ Core Values

As the third millennium of the Christian era begins, humankind is well along in creating a global network for the instantaneous transmission of information, ideas, and value judgments in science, commerce, education, entertainment, politics, the arts, religion, and every other field. And one of key players in this globalized era is media. The use of media is recognizable and undeniably reaching all forms of institutions including the church, family, schools and government. In fact, the church uses the various instruments of mass media in promoting genuine Christian values [1] [2] [3]. Schools use media in making learning become more relevant. Government use media to disseminate pertinent and urgent national concerns to the people. With all these, media become instrumental in the integral growth of all people. Media has become one of the basic needs of the people, so that without, they could hardly live their life in its fullness [4]. It makes the lives of the people without any difficulty, along with information and communication technologies. Families continue to nurture relationships with their members who work abroad because of media. People around the world become more socially and politically aware because of media.
Efficient Mercantilism? Rent Seeking under Leviathan: Buchanan and Tullock Meet Olson and Ramsey

The economics literature on mercantilism tends to emphasize gold hoarding and external barriers to trade as defining characteristics. However, medieval institutions included a host of internal barriers to trade as well as external ones. High offices were often for sale as were monopoly privileges. We analyze how a stable unitary government's regulatory policies may be affected by revenues generated by the expenditures of rent seekers. The sale of monopoly privilege can be a significant source of government revenue that augments tax revenues, especially in settings in which collecting ordinary tax revenues is problematic. Our analysis provides a possible political-economy explanation for relatively successful authoritarian states that have relatively little corruption, but many internal and external barriers to trade. A revenue-maximizing government encourages greater monopolization than is compatible with economic efficiency, but sells monopoly privileges in a manner that promotes innovation and partially accounts for the deadweight losses associated with monopolized markets.
Quantifying the correctness , computational complexity , and security of privacy-preserving string comparators for record linkage Reviewed by Liyue Fan 1 Summary

This paper provides an overview of recently proposed privacy-preserving string comparators (PPSCs), including Exact Matching with SHA-1 [9], Bloom Filters [12], Trigrams [7], Embedding [11], secure Edit Similarity [1], and Phonetic Filter [8]. While two parties hold private databases, a third party is needed to perform the matching. Once individual field has been compared, Winkler modification for continuous Fellegi-Sunter [10] is used to produce a similarity score for each record pair. For each method, N top-ranked record pairs out of N ×N candidates are emitted as matches, where N is the size of one party database. The above methods are evaluated with respect to correctness, computation time, and security. The correctness is measured by TPR (True Positive Rate). Computation time is measured from the program running time. Security is measured by mutual information entropy since the third party only sees the encoded data without any knowledge of the protocol. The dataset used for evaluation is North Carolina voter registration (NCVR) files, which is NOT available anymore at the provided link1. 1000 records are selected for each database, and a “data corrupter” based on [2] is used to generated the database to be matched. 100 iterations of such experiments have been conducted. According to their results, Embedding has lowest TPR but provides high security and Edit Similarity incurs infeasible computation time while providing highest security. Several methods are excluded from the survey, such as [3, 13, 4], due to reported poor performance. A few other surveys are mentioned in the paper [5, 14, 6, 15].
Approximation Schemes for Partitioning: Convex Decomposition and Surface Approximation

Recently, Adamaszek and Wiese [1, 2] presented a quasi-polynomial time approximation scheme (QPTAS) for the problem of computing a maximum weight independent set for certain families of planar objects. This major advance on the problem was based on their proof that a certain type of separator exists for any independent set. Subsequently, Har-Peled [22] simplified and generalized their result. Mustafa et al. [36] also described a simplification, and somewhat surprisingly, showed that QPTAS's can be obtained for certain, albeit special, type of covering problems. Building on these developments, we revisit two NP-hard geometric partitioning problems -- convex decomposition and surface approximation. Partitioning problems combine the features of packing and covering. In particular, since the optimal solution does form a packing, the separator theorems are potentially applicable. Nevertheless, the two partitioning problems we study bring up additional difficulties that are worth examining in the context of the wider applicability of the separator methodology. We show how these issues can be handled in presenting quasi-polynomial time algorithms for these two problems with improved approximation guarantees.
The impacts of micro-grid on the reliability of distribution system

Micro-grid connect to the grid changed the traditional distribution system with single power source and radial network into a new distribution system with several power sources, power sources and loads can be found everywhere. So the reliability of distribution system with micro-grid would change greatly from the theory to the method. This paper introduce the micro-grid operation modes and the impacts to distribution system reliability, then apply the FMEA to evaluate the distribution system with micro-grid. In the last part of the paper apply the method proposed in the paper to evaluate feeder F4 in RTBS-BUS6 so as to prove the conclusion that the micro-grid should improve the reliability of distribution system.
Cheaters in a gaming social network

The popularity of online gaming has raised signi cantinterest in understanding the technological needs for sup-porting gaming platforms. Consequently, various studiescharacterized network trac due to gaming, resource pro-visioning, work load prediction, and player churn in onlinegames [1]. Other studies have focused on the psycholog-ical and social properties of gamers and gaming commu-nities [5]. Gamers form strong communities around theiractivity, with recent work suggesting that explicitly de nedrelationships of gamers tend to be supported by real worldrelationships [6]. One major problem with gaming is cheating. For somecheaters, the motivation is monetary. Virtual goods areworth real world money on eBay, and online game econo-mies provide a lucrative opportunity for cyber criminals [2]. For other cheaters, a competitive advantage and the desireto win is motivation enough [3]. In this work, we analyze how cheaters are embedded in theSteam Community, a large online social network for gam-ing with millions of active users. Cheaters are identi ed byan automated mechanism operated by the Steam gamingservice and their pro les are permanently agged in a pub-licly visible way. We analyze di erences in gaming-speci cproperties of cheaters and non-cheaters. We also examinewhether cheaters occupy a particular position in the socialnetwork when compared to non-cheaters, and characterizethe relationships they have among themselves, and with non-cheaters.Our study shows that cheaters are well embedded in thesocial network, having similar connectivity to non-cheaters;their social position is largely undistinguishable from thatof fair players; and their geographic distribution does notcorrespond to real world population nor is it determinedby the popularity of the Steam Community at a given realworld location.
Counterfactual computation

Suppose that we are given a quantum computer programmed ready to perform a computation if it is switched on. Counterfactual computation is a process by which the result of the computation may be learnt without actually running the computer. Such processes are possible within quantum physics and to achieve this effect a computer embodying the possibility of running the computation must be available, even though the computation is, in fact, not run. We study the possibilities and limitations of protocols for the counterfactual computation of decision problems (where the result r is either 0 or 1). If p⊂r denotes the probability of learning the result r 'for free' in a protocol, then one might hope to design a protocol which simultaneously has large p⊂0 and p⊂1. However, we prove that p⊂0 + p⊂1 ≤ 1 in any protocol of this type and derive further constraints on p⊂0 and p⊂1 in terms of N, the number of times that the computer is not run. In particular, we show that any protocol with p⊂0 + p⊂1 = 1 – ∈ must have N tending to infinity as ∈ tends to 0. We show that ‘interaction–free’ measurements can be regarded as counterfactual computations, and our results then imply that N must be large if the probability of interaction is to be close to zero. Finally, we consider some ways in which our formulation of counterfactual computation can be generalized.
Chernoff survey in Argentine and Hungarian schools

In 2008 and 2009 a Hungarian-Argentine project was developed under “The possible uses of the Chernoff faces for data visualisation in school cartography”. This research was divided into two parts. First the international experiences using the statistical method known as Chernoff faces in thematic cartography were studied by analyzing the results of investigations completed during the last 15 to 20 years. In the second part the possibilities of this method were investigated in a more specific cartographic field: the thematic representation in school atlases and maps, trying to find answers to questions related to the possible use of this method in thematic maps published for school pupils, organizing a survey with the participation of pupils from elementary and secondary schools in both countries. The data were stored in digital format and the results of the analysis were presented using charts and were placed on the website of the project.
Discriminative feature extraction for speech recognition in noise

Signal representation is crucial for designinga speechrecognizer. The feature extractor selects the information to be used by the classifier to perform the recognition. In noisy environments, the data vectors representing the speech signal are changed and the recognizer performance is degraded by two main facts: (1) the mismatch between the training and the recognition conditions and (2) the degradation of the signal to be recognized. In such a situation, the representation of the speech signal plays an important role. In this paper, we analyze the importance of the representation for speechrecognition in noise. We apply the Discriminative Feature Extraction (DFE) method to optimize the representation. The experiments presented in this work show that the DFE method, which has been successfully applied in clean environments, leads also to improvements of the speech recognizers in noise.
Assessing Test Set Adequacy for Object-Oriented Programs Using Class Mutation

The object-oriented paradigm has seen widespread acceptance by the software development community but the testing of programs written in object oriented languages is less well developed than the testing of programs written in conventional ones. This paper introduces Class Mutation which is a form of OO-directed selective mutation testing that provides a means of assessing how good developed test sets are for OO programs. Experimental results are given for the application of three particular mutation operators for the Java language to assess test sets developed to satisfy a conventional criterion.
Time-Varying Gaussian Graphical Models of Molecular Dynamics Data

We introduce an algorithm for learning sparse, time-varying undirected probabilistic graphical models of Molecular Dynamics (MD) data. Our method computes a maximum a posteriori (MAP) estimate of the topology and parameters of the model (i.e., structure learning) using L1regularization of the negative log-likelihood (aka ‘Graphical Lasso’) to ensure sparsity, and a kernel to ensure smoothly varying topology and parameters over time. The learning problem is posed as a convex optimization problem and then solved optimally using block coordinate descent. The resulting model encodes the time-varying joint distribution over all the dihedral angles in the protein. We apply our method to three separate MD simulations of the enzyme Cyclophilin A, a peptidylprolyl isomerase. Each simulation models the isomerization of a different substrate. We compare and contrast the graphical models constructed from each data set, providing insights into the differences in the dynamics experienced by the enzyme for the different substrate.
Long-term outcomes for bilinguals in minority language contexts: Welsh–English teenagers’ performance on measures of grammatical gender and plural morphology in Welsh

Abstract This study explored the long-term effects of limited input on bilingual teenagers’ acquisition of complex morphology in Welsh. Study 1 assessed 168 12–13 and 16–17-year-old teenagers, across three bilingual groups: those whose first language was Welsh (L1 Welsh), those who learned Welsh and English simultaneously (L1 Welsh–English), and those who learned Welsh as a second language (L2 Welsh), on their receptive knowledge of grammatical gender. Study 2 assessed the same participants on their production of plural morphology. While the results of Study 1 revealed continuous progression toward adult norms among L1 Welsh-speaking bilinguals, with the simultaneous bilinguals progressing at a slower rate, the results of Study 2 revealed performances on plural morphology that were comparable to adult norms among the 16–17-year-old L1 Welsh-speaking bilinguals, and some progression among the simultaneous bilinguals. In contrast, delayed progression was seen among the L2 Welsh-speaking bilinguals across the board, with 16–17-year-old L2 participants lagging behind their L1 peers on both grammatical gender and plural morphology. The implications of these findings for our understanding of the long-term outcomes for bilinguals learning complex structures under minority language conditions are discussed.
Cluster based template generation for fast and secure fingerprint matching

Most of the fingerprint recognition systems depend on pair-wise matching of the minutia feature vectors which consist of several spatial properties associated with the minutia points. Due to various non-linear deformations like translation and rotation, minutia based matching is quite a challenging issue. To deal with this problem, most of the techniques in the literature solely depend upon a reference point selection. In this paper, we propose a novel cluster based template generation and matching algorithm which is invariant to translation and rotation of the minutia points. The cardinality of minutia clusters are stored as fingerprint template instead of minutia feature vectors. The stored template reveals no information regarding the spatial pattern of the fingerprint which provides a strong security against information leakage. Finally, a robust match score estimation technique is introduced to increase the matching efficiency. Moreover, the proposed method produces a faster execution. We present the performance on FVC2004 database to show the effectiveness of our method along with a comparative study against some other existing matching algorithms which establishes the efficacy of the proposed method.
Evaluation and Delay of the Routing Protocols in Ad-Hoc Wireless Networks

A wireless Ad-hoc network consists of wireless nodes communicating without the need for a centralized administration, in which all nodes potentially contribute to the routing process. A user can move anytime in an ad hoc scenario and, as a result, such a network needs to have routing protocols which can adopt dynamically changing topology. To accomplish this, a number of ad hoc routing protocols have been proposed and implemented, which include Dynamic Source Routing (DSR), Destination Sequenced Distance Vector (DSDV) and ad hoc on-demand distance vector (AODV) routing. In this paper, we analyze the performance differentials to compare the above-mentioned commonly used ad hoc network routing protocols. We report the simulation results of three different protocols for wireless ad hoc networks having thirty nodes. The performances of proposed networks are evaluated in terms of number of retransmission attempts, Control traffic sent, Control traffic received, Data Traffic sent, Data Traffic received and throughput with the help of OPNET simulator. Data rate 2Mbps and simulation time 20 minutes were taken. For this above simulation environment, AODV shows better performance over the other two on-demand protocols, that is, DSR and DSDV. Index Terms DSDV, DSR, Ad-hoc On-Demand Distance Vector Routing.
Functional role of a specialized class of spinal commissural inhibitory neurons during fast escapes in zebrafish

In teleost fish, the Mauthner (M) cell, a large reticulospinal neuron in the brainstem, triggers escape behavior. Spinal commissural inhibitory interneurons that are electrotonically excited by the M-axon have been identified, but the behavioral roles of these neurons have not yet been addressed. Here, we studied these neurons, named CoLo (commissural local), in larval zebrafish using an enhancer-trap line in which the entire population of CoLos was visualized by green fluorescent protein. CoLos were present at one cell per hemi-segment. Electrophysiological recordings showed that an M-spike evoked a spike in CoLos via electrotonic transmission and that CoLos made monosynaptic inhibitory connections onto contralateral primary motoneurons, consistent with the results in adult goldfish. We further showed that CoLos were active only during escapes. We examined the behavioral roles of CoLos by investigating escape behaviors in CoLo-ablated larvae. The results showed that the escape behaviors evoked by sound/vibration stimuli were often impaired with a reduced initial bend of the body, indicating that CoLos play important roles in initiating escapes. We obtained several lines of evidence that strongly suggested that the impaired escapes occurred during bilateral activation of the M-cells: in normal larvae, CoLo-mediated inhibitory circuits enable animals to perform escapes even in these occasions by silencing the output of the slightly delayed firing of the second M-cell. This study illustrates (1) a clear example of the behavioral role of a specialized class of interneurons and (2) the capacity of the spinal circuits to filter descending commands and thereby produce the appropriate behavior.