The conflict between realism and abstraction in the field of spanish art as an iteration of la "Querelle des Anciens et des Modernes"

Based on the analysis model favored by the study of the conditions in which the seventeenth century Querelle des Anciens et des Modernes took place, we examine the case of confrontation between realism and abstraction, which occurred in the context of Spanish art in the nineties of the twentieth century. Connections are established with other aesthetic conflicts which are considered part of a genealogy whose most explicit antecedent could be placed in the before mentioned complaint, such as the confrontation between realism and abstraction in the American art scene, which occurred in the fifties of the last century, and the more recent controversy on pluralism and the end of art.

A Cyclotomic Lattice Based Quasi-Orthogonal STBC for Eight Transmit Antennas

In this letter, we propose a lattice-based full diversity design for rate-one quasi-orthogonal space time block codes (QSTBC) to obtain an improved diversity product for eight transmit antennas where the information bits are mapped into 4-D lattice points instead of the common modulation constellations. Particularly, the diversity product of the proposed code is directly determined by the minimum Euclidean distance of the used lattice and can be improved by using the lattice packing. We show analytically and by using simulation results that the proposed code achieves a larger diversity product than the rate-one QSTBCs reported previously.

A New Restricted Full-Rank Single-Symbol Decodable Design for Four Transmit Antennas

Recently, a single-symbol decodable transmit strategy based on preprocessing at the transmitter has been introduced to decouple the quasi-orthogonal space-time block codes (QOSTBC) with reduced complexity at the receiver [9]. Unfortunately, it does not achieve full diversity, thus suffering from significant performance loss. To tackle this problem, we propose a full diversity scheme with four transmit antennas in this letter. The proposed code is based on a class of restricted full-rank single-symbol decodable design (RFSDD) and has many similar characteristics as the coordinate interleaved orthogonal designs (CIODs), but with a lower peak-to-average ratio (PAR).

On the Uncoded BER Performance Bound of the IEEE 802.16d Channel

In this letter, the performance bound of the IEEE 802.16d channel is examined analytically in order to gain an insight into its theoretical potential. Different design strategies, such as orthogonal frequency division multiplexing (OFDM) and single-carrier frequency-domain equalization (SC-FDE), time-domain decision feedback equalization (DFE), and sphere decoder (SD) techniques are discussed and compared to the theoretical bound.

Application of Jacobi algorithm for ISI channels

Here, the Jacobi iterative algorithm is applied to combat intersymbol interference (ISI) caused by frequency-selective channels. The performance bound of the equaliser is analysed in order to gain an insight into its asymptotic behaviour. Because of the error propagation problem, the potential of this algorithm is not reached in an uncoded system. However, its extension to a coded system with the application of the turbo-processing principle results in a new turbo equalisation algorithm, which demonstrates comparable performance with reduced complexity compared with some existing filter-based turbo equalisation schemes; and superior performance compared with some frequency domain solutions, such as orthogonal frequency division multiplexing and single-carrier frequency domain equalisation.

The exponentiated convex variable step-size (ECVSS) algorithm

For some time there is a large interest in variable step-size methods for adaptive filtering. Recently, a few stochastic gradient algorithms have been proposed, which are based on cost functions that have exponential dependence on the chosen error. However, we have experienced that the cost function based on exponential of the squared error does not always satisfactorily converge. In this paper we modify this cost function in order to improve the convergence of exponentiated cost function and the novel ECVSS (exponentiated convex variable step-size) stochastic gradient algorithm is obtained. The proposed technique has attractive properties in both stationary and abrupt-change situations. (C) 2010 Elsevier B.V. All rights reserved.

On-line Emotion Recognition in a 3-D Activation-Valence-Time Continuum using Acoustic and Linguistic Cues

For many applications of emotion recognition, such as virtual agents, the system must select responses while the user is speaking. This requires reliable on-line recognition of the user’s affect. However most emotion recognition systems are based on turnwise processing. We present a novel approach to on-line emotion recognition from speech using Long Short-Term Memory Recurrent Neural Networks. Emotion is recognised frame-wise in a two-dimensional valence-activation continuum. In contrast to current state-of-the-art approaches, recognition is performed on low-level signal frames, similar to those used for speech recognition. No statistical functionals are applied to low-level feature contours. Framing at a higher level is therefore unnecessary and regression outputs can be produced in real-time for every low-level input frame. We also investigate the benefits of including linguistic features on the signal frame level obtained by a keyword spotter.

SoC memory hierarchy derivation from dataflow graphs

Hardware synthesis from dataflow graphs of signal processing systems is a growing research area as focus shifts to high level design methodologies. For data intensive systems, dataflow based synthesis can lead to an inefficient usage of memory due to the restrictive nature of synchronous dataflow and its inability to easily model data reuse. This paper explores how dataflow graph changes can be used to drive both the on-chip and off-chip memory organisation and how these memory architectures can be mapped to a hardware implementation. By exploiting the data reuse inherent to many image processing algorithms and by creating memory hierarchies, off-chip memory bandwidth can be reduced by a factor of a thousand from the original dataflow graph level specification of a motion estimation algorithm, with a minimal increase in memory size. This analysis is verified using results gathered from implementation of the motion estimation algorithm on a Xilinx Virtex-4 FPGA, where the delay between the memories and processing elements drops from 14.2 ns down to 1.878 ns through the refinement of the memory architecture. Care must be taken when modeling these algorithms however, as inefficiencies in these models can be easily translated into overuse of hardware resources.

Performance Analysis of Novel Randomly Shifted Certification Authority Authentication Protocol for MANETs

The provision of security in mobile ad hoc networks is of paramount importance due to their wireless nature. However, when conducting research into security protocols for ad hoc networks it is necessary to consider these in the context of the overall system. For example, communicational delay associated with the underlying MAC layer needs to be taken into account. Nodes in mobile ad hoc networks must strictly obey the rules of the underlying MAC when transmitting security-related messages while still maintaining a certain quality of service. In this paper a novel authentication protocol, RASCAAL, is described and its performance is analysed by investigating both the communicational-related effects of the underlying IEEE 802.11 MAC and the computational-related effects of the cryptographic algorithms employed. To the best of the authors' knowledge, RASCAAL is the first authentication protocol which proposes the concept of dynamically formed short-lived random clusters with no prior knowledge of the cluster head. The performance analysis demonstrates that the communication losses outweigh the computation losses with respect to energy and delay. MAC-related communicational effects account for 99% of the total delay and total energy consumption incurred by the RASCAAL protocol. The results also show that a saving in communicational energy of up to 12.5% can be achieved by changing the status of the wireless nodes during the course of operation. Copyright (C) 2009 G. A. Safdar and M. P. O'Neill (nee McLoone).

Parametric FIR Design of Propagation Loss Filters in Digital Waveguide String Models

One of the attractive features of sound synthesis by physical modeling is the potential to build acoustic-sounding digital instruments that offer more flexibility and different options in its design and control than their real-life counterparts. In order to develop such virtual-acoustic instruments, the models they are based on need to be fully parametric, i.e., all coefficients employed in the model are functions of physical parameters that are controlled either online or at the (offline) design stage. In this letter we show how propagation losses can be parametrically incorporated in digital waveguide string models with the use of zero-phase FIR filters. Starting from the simplest possible design in the form of a three-tap FIR filter, a higher-order FIR strategy is presented and discussed within the perspective of string sound synthesis with digital waveguide models.