The whole song is greater than the sum of its parts: Local and structural features in music listening

Four experiments reported here demonstrate the importance of structural as well as local features in listening to contemporary popular music. Experiment 1 established that listeners without formal musical training regard as salient the formal structure that links individual sections of songs. When asked to listen to and assemble the individual sections of unfamiliar contemporary songs to form new compositions, participants positioned the sections in ways consistent with the true structure of the music. In Experiment 2, participants were provided with only the song lyrics with which to arrange the individual sections of contemporary songs. It was found that in addition to musical features
studied in Experiment 1, lyrical content of contemporary music also acts as a strong cue to a song’s formal structure. Experiments 3 and 4 revealed that listeners’ enjoyment of music is influenced both by structural features and local features of music, which were carried by the individual song sections.
The influence of structural features on music listening was most apparent over repeated hearings. In Experiment 4, listeners’ liking for contemporary music followed an inverted U-shape trend with repeated exposure, in which liking for music took a downward turn after just four repeated hearings. In contrast, liking for restructured music increased with repeated hearings and almost eliminated an initial negative effect of restructuring by the sixth hearing. In sum, our findings demonstrate that structural features as well as local features of contemporary music are salient and important to
listeners.

Approximate Computing with Unreliable Dynamic Memories

Embedded memories account for a large fraction of the overall silicon area and power consumption in modern SoC(s). While embedded memories are typically realized with SRAM, alternative solutions, such as embedded dynamic memories (eDRAM), can provide higher density and/or reduced power consumption. One major challenge that impedes the widespread adoption of eDRAM is that they require frequent refreshes potentially reducing the availability of the memory in periods of high activity and also consuming significant amount of power due to such frequent refreshes. Reducing the refresh rate while on one hand can reduce the power overhead, if not performed in a timely manner, can cause some cells to lose their content potentially resulting in memory errors. In this paper, we consider extending the refresh period of gain-cell based dynamic memories beyond the worst-case point of failure, assuming that the resulting errors can be tolerated when the use-cases are in the domain of inherently error-resilient applications. For example, we observe that for various data mining applications, a large number of memory failures can be accepted with tolerable imprecision in output quality. In particular, our results indicate that by allowing as many as 177 errors in a 16 kB memory, the maximum loss in output quality is 11%. We use this failure limit to study the impact of relaxing reliability constraints on memory availability and retention power for different technologies.

Sum-Rate and Power Scaling of Massive MIMO Systems with Channel Aging

This paper investigates the achievable sum-rate of massive multiple-input multiple-output (MIMO) systems in the presence of channel aging. For the uplink, by assuming that the base station (BS) deploys maximum ratio combining (MRC) or zero-forcing (ZF) receivers, we present tight closed-form lower bounds on the achievable sum-rate for both receivers with aged channel state information (CSI). In addition, the benefit of implementing channel prediction methods on the sum-rate is examined, and closed-form sum rate lower bounds are derived. Moreover, the impact of channel aging and channel prediction on the power scaling law is characterized. Extension to the downlink scenario and multi-cell scenario are also considered. It is found that, for a system with/without channel prediction, the transmit power of each user can be scaled down at most by 1= p M (where M is the number of BS antennas), which indicates that aged CSI does not degrade the power scaling law, and channel prediction does not enhance the power scaling law; instead, these phenomena affect the achievable sum-rate by degrading or enhancing the effective signal to interference and noise ratio, respectively.

Semantics for possibilistic answer set programs: uncertain rules versus rules with uncertain conclusions

Although Answer Set Programming (ASP) is a powerful framework for declarative problem solving, it cannot in an intuitive way handle situations in which some rules are uncertain, or in which it is more important to satisfy some constraints than others. Possibilistic ASP (PASP) is a natural extension of ASP in which certainty weights are associated with each rule. In this paper we contrast two different views on interpreting the weights attached to rules. Under the first view, weights reflect the certainty with which we can conclude the head of a rule when its body is satisfied. Under the second view, weights reflect the certainty that a given rule restricts the considered epistemic states of an agent in a valid way, i.e. it is the certainty that the rule itself is correct. The first view gives rise to a set of weighted answer sets, whereas the second view gives rise to a weighted set of classical answer sets.

Approximating Credal Network Inferences by Linear Programming

An algorithm for approximate credal network updating is presented. The problem in its general formulation is a multilinear optimization task, which can be linearized by an appropriate rule for fixing all the local models apart from those of a single variable. This simple idea can be iterated and quickly leads to very accurate inferences. The approach can also be specialized to classification with credal networks based on the maximality criterion. A complexity analysis for both the problem and the algorithm is reported together with numerical experiments, which confirm the good performance of the method. While the inner approximation produced by the algorithm gives rise to a classifier which might return a subset of the optimal class set, preliminary empirical results suggest that the accuracy of the optimal class set is seldom affected by the approximate probabilities

Fast Rule Mining over Multi-dimensional Windows

Association rule mining is an indispensable tool for discovering
insights from large databases and data warehouses.
The data in a warehouse being multi-dimensional, it is often
useful to mine rules over subsets of data defined by selections
over the dimensions. Such interactive rule mining
over multi-dimensional query windows is difficult since rule
mining is computationally expensive. Current methods using
pre-computation of frequent itemsets require counting
of some itemsets by revisiting the transaction database at
query time, which is very expensive. We develop a method
(RMW) that identifies the minimal set of itemsets to compute
and store for each cell, so that rule mining over any
query window may be performed without going back to the
transaction database. We give formal proofs that the set of
itemsets chosen by RMW is sufficient to answer any query
and also prove that it is the optimal set to be computed
for 1 dimensional queries. We demonstrate through an extensive
empirical evaluation that RMW achieves extremely
fast query response time compared to existing methods, with
only moderate overhead in pre-computation and storage

Exploiting Significance of Computations for Energy-Constrained Approximate Computing

Approximate execution is a viable technique for environments with energy constraints, provided that applications are given the mechanisms to produce outputs of the highest possible quality within the available energy budget. This paper introduces a framework for energy-constrained execution with controlled and graceful quality loss. A simple programming model allows developers to structure the computation in different tasks, and to express the relative importance of these tasks for the quality of the end result. For non-significant tasks, the developer can also supply less costly, approximate versions. The target energy consumption for a given execution is specified when the application is launched. A significance-aware runtime system employs an application-specific analytical energy model to decide how many cores to use for the execution, the operating frequency for these cores, as well as the degree of task approximation, so as to maximize the quality of the output while meeting the user-specified energy constraints. Evaluation on a dual-socket 16-core Intel platform using 9 benchmark kernels shows that the proposed framework picks the optimal configuration with high accuracy. Also, a comparison with loop perforation (a well-known compile-time approximation technique), shows that the proposed framework results in significantly higher quality for the same energy budget.

Review of Slavery by Any Other Name: African Life under Company Rule in Colonial Mozambique.

Book review of Slavery by Any Other Name: African Life under Company Rule in Colonial Mozambique, by Eric Allina, Charlottesville, University of Virginia Press, 2012, 255 pp., £44.50, ISBN 978-0-8139-3272-9.

Thanking the Greeks: The Crisis of the Rule of Law in EU Enlargement Regulation

This paper showcases the weaknesses of EU enlargement law and demonstrates how one Member State – namely, Greece – is notable for abusing this weakness, for harming the candidate countries, the EU, and the institutions alike, for stripping the EU position of its predictability, and for undermining the EU Commission’s efforts. Accordingly, Greece has severely incapacitated the key procedural rule of law component of the EU’s enlargement regulation, turning it into a randomised political game and ignoring any long-term goals of stability, prosperity, and peace that the process is to stand for. Following a walk through Greece’s engagement throughout a number of enlargement rounds, the paper concludes that the duty of loyalty – which is presumably able to discipline Member States that undermine the common effort – should find a new meaning in the context of EU enlargement.