Short-term Feature Space and Music Genre Classification

In music genre classification, most approaches rely on statistical characteristics of low-level features computed on short audio frames. In these methods, it is implicitly considered that frames carry equally relevant information loads and that either individual frames, or distributions thereof, somehow capture the specificities of each genre. In this paper we study the representation space defined by short-term audio features with respect to class boundaries, and compare different processing techniques to partition this space. These partitions are evaluated in terms of accuracy on two genre classification tasks, with several types of classifiers. Experiments show that a randomized and unsupervised partition of the space, used in conjunction with a Markov Model classifier lead to accuracies comparable to the state of the art. We also show that unsupervised partitions of the space tend to create less hubs.

FMRI 3D registration based on Fourier space subsets using neural networks

In this work, we present a neural network (NN) based method designed for 3D rigid-body registration of FMRI time series, which relies on a limited number of Fourier coefficients of the images to be aligned. These coefficients, which are comprised in a small cubic neighborhood located at the first octant of a 3D Fourier space (including the DC component), are then fed into six NN during the learning stage. Each NN yields the estimates of a registration parameter. The proposed method was assessed for 3D rigid-body transformations, using DC neighborhoods of different sizes. The mean absolute registration errors are of approximately 0.030 mm in translations and 0.030 deg in rotations, for the typical motion amplitudes encountered in FMRI studies. The construction of the training set and the learning stage are fast requiring, respectively, 90 s and 1 to 12 s, depending on the number of input and hidden units of the NN. We believe that NN-based approaches to the problem of FMRI registration can be of great interest in the future. For instance, NN relying on limited K-space data (possibly in navigation echoes) can be a valid solution to the problem of prospective (in frame) FMRI registration.

The Bergsonian intuition of duration : the time of science is space

According to Bergson, the philosophical tradition had been unanimous in declaring the question of time essential. However, it had neglected its correct framing which, for the author, lies in the metaphysical approach of an immediate and inner experience of concrete duration. In the current paper, we shall present Henri Bergson's concept of time, particularly the author's critique to the scope scientific discourse has of this concept. Simultaneously, we shall explore the central role of time in the Bergsonian thought, metaphorically understood as the very stuff of reality. We shall not, therefore, explore Bergson's ideas on Physics, but some of the metaphysical consequences that he withdraws from certain physics' concepts or theories.

East of Suez and the imaginary tangles of space and self

Drawing on postcolonial studies and the theorization on imperial gothic, this paper centres on three texts: The Hosts of the Lord (1900) by Flora Annie Steel; East of Suez (1901) by Alice Perrin, and The Way of an Eagle (1912)by Ethel Dell. These three texts highlight in different ways the discursive mediation of the Other and its destabilizing effects on the identity of the European-minded colonizer, thus foregrounding the multifarious nature of the British imaginative engagement with India. In this context, it is particularly relevant to examine the political and ideological implications of representing anywhere East of Suez as a locus of primitivism and chaos vis-à-vis the colonizer’s ambivalent reactions. Thus we seek to demonstrate the power of two distinct practices or modes of representation – namely, the power of a metaphorical discourse versus metonymic discourse- within the proces of constructing the East for a vast Western readership.

Fractional dynamics of genetic algorithms using hexagonal space tessellation

The paper formulates a genetic algorithm that evolves two types of objects in a plane. The fitness function promotes a relationship between the objects that is optimal when some kind of interface between them occurs. Furthermore, the algorithm adopts an hexagonal tessellation of the two-dimensional space for promoting an efficient method of the neighbour modelling. The genetic algorithm produces special patterns with resemblances to those revealed in percolation phenomena or in the symbiosis found in lichens. Besides the analysis of the spacial layout, a modelling of the time evolution is performed by adopting a distance measure and the modelling in the Fourier domain in the perspective of fractional calculus. The results reveal a consistent, and easy to interpret, set of model parameters for distinct operating conditions.

Uncertainty assessment approach for composite structures based on global sensitivity indices

The problem of uncertainty propagation in composite laminate structures is studied. An approach based on the optimal design of composite structures to achieve a target reliability level is proposed. Using the Uniform Design Method (UDM), a set of design points is generated over a design domain centred at mean values of random variables, aimed at studying the space variability. The most critical Tsai number, the structural reliability index and the sensitivities are obtained for each UDM design point, using the maximum load obtained from optimal design search. Using the UDM design points as input/output patterns, an Artificial Neural Network (ANN) is developed based on supervised evolutionary learning. Finally, using the developed ANN a Monte Carlo simulation procedure is implemented and the variability of the structural response based on global sensitivity analysis (GSA) is studied. The GSA is based on the first order Sobol indices and relative sensitivities. An appropriate GSA algorithm aiming to obtain Sobol indices is proposed. The most important sources of uncertainty are identified.

Relatório de estágio

I - As minhas expectativas eram elevadas pois este regresso à Escola Superior de Música de Lisboa permitia-me voltar a trabalhar com os professores que me formaram como músico e professor e com eles poder actualizar-me sobre vários temas ligados à pedagogia. Este aspecto é muito importante pois chego à conclusão que o tempo por vezes provoca-nos excesso de confiança que parece “cegar-nos” não nos deixando ver erros pedagógicos muitas vezes evitáveis. Quando ingressei neste estágio sentia-me confiante e seguro quanto às minhas capacidades como professor. O momento de viragem na minha perspectiva do estágio dá-se quando surgem as observações/gravações e respectivas análises e reflexões das aulas. Procurei trabalhar nessas aulas da forma mais natural possível pois o meu objectivo era observar o meu trabalho diário. A primeira observação das aulas permitiu-me anotar algumas coisas menos boas. Contudo, quando essa observação foi feita com o professor de didática os aspectos menos positivos ganharam uma enorme proporção: (1) falhas ao nível da instrução: demasiado longo, (2) feedback de pouca qualidade ou eficácia , (3) pouca percentagem de alunos que atingiam os objectivos., (4) ritmo de aula por vezes baixo devido a períodos longos de instrução ou devido a uma má gestão do espaço. Todos estes problemas eram mais visíveis quando as turmas eram maiores. Ao longo do estágio, e após a detecção destas falhas, fui procurando evitar estas práticas em todas as turmas onde leccionava. Senti que o ritmo de aula aumentou substancialmente não apenas à custa da energia do professor e de boas estratégias mas porque sobretudo se “falava menos e trabalhava-se mais”. Os erros dos alunos passaram a ser corrigos enquanto trabalhavam (feedback corretivo próximo do momento positivo ou negativo), o feedback positivo passou a ser mais destacado, a disposição da sala alterou-se de forma aos alunos estarem mais perto do professor, e este procurou ser menos “criativo” no momento de alterar o plano de aula devido a ideias momentâneas o que provocou mais tempo para cada estratégia e para que mais alunos fossem atingindo os objectivos. Apesar da evolução no sentido de proporcionar aos alunos aulas mais rentáveis e de ainda melhor qualidade, existe a consciência que alguns dos erros cometidos eram hábitos e como tal poderão levar algum tempo a ser corrigidos. Contudo, existe a consciência e a vontade em debelá-los da minha prática docente.

Real-time scheduling with resource sharing on uniform multiprocessors

Consider the problem of scheduling a set of implicit-deadline sporadic tasks to meet all deadlines on a uniform multiprocessor platform where each task may access at most one of |R| shared resources and at most once by each job of that task. The resources have to be accessed in a mutually exclusive manner. We propose an algorithm, GIS-vpr, which offers the guarantee that if a task set is schedulable to meet deadlines by an optimal task assignment scheme that allows a task to migrate only when it accesses or releases a resource, then our algorithm also meets the deadlines with the same restriction on the task migration, if given processors 4 + 6|R| times as fast. The proposed algorithm, by design, limits the number of migrations per job to at most two. To the best of our knowledge, this is the first result for resource sharing on uniform multiprocessors with proven performance guarantee.

A preliminary idea for an 8-competitive, log2 DMAX + log2 log2 1/U asymptotic-space, interface generation algorithm for two-level hierarchical scheduling of constrained-deadline sporadic tasks on a uniprocessor

Consider a single processor and a software system. The software system comprises components and interfaces where each component has an associated interface and each component comprises a set of constrained-deadline sporadic tasks. A scheduling algorithm (called global scheduler) determines at each instant which component is active. The active component uses another scheduling algorithm (called local scheduler) to determine which task is selected for execution on the processor. The interface of a component makes certain information about a component visible to other components; the interfaces of all components are used for schedulability analysis. We address the problem of generating an interface for a component based on the tasks inside the component. We desire to (i) incur only a small loss in schedulability analysis due to the interface and (ii) ensure that the amount of space (counted in bits) of the interface is small; this is because such an interface hides as much details of the component as possible. We present an algorithm for generating such an interface.

Detection of quasi-periodic processes in complex systems: how do we quantitatively describe their properties?

It has been shown that in reality at least two general scenarios of data structuring are possible: (a) a self-similar (SS) scenario when the measured data form an SS structure and (b) a quasi-periodic (QP) scenario when the repeated (strongly correlated) data form random sequences that are almost periodic with respect to each other. In the second case it becomes possible to describe their behavior and express a part of their randomness quantitatively in terms of the deterministic amplitude–frequency response belonging to the generalized Prony spectrum. This possibility allows us to re-examine the conventional concept of measurements and opens a new way for the description of a wide set of different data. In particular, it concerns different complex systems when the ‘best-fit’ model pretending to be the description of the data measured is absent but the barest necessity of description of these data in terms of the reduced number of quantitative parameters exists. The possibilities of the proposed approach and detection algorithm of the QP processes were demonstrated on actual data: spectroscopic data recorded for pure water and acoustic data for a test hole. The suggested methodology allows revising the accepted classification of different incommensurable and self-affine spatial structures and finding accurate interpretation of the generalized Prony spectroscopy that includes the Fourier spectroscopy as a partial case.

Competitive analysis of partitioned scheduling on uniform multiprocessors

Consider the problem of scheduling a set of sporadically arriving tasks on a uniform multiprocessor with the goal of meeting deadlines. A processor p has the speed Sp. Tasks can be preempted but they cannot migrate between processors. We propose an algorithm which can schedule all task sets that any other possible algorithm can schedule assuming that our algorithm is given processors that are three times faster.

Competitive analysis of static-priority partitioned scheduling on uniform multiprocessors

Consider the problem of scheduling a set of sporadically arriving tasks on a uniform multiprocessor with the goal of meeting deadlines. A processor p has the speed Sp. Tasks can be preempted but they cannot migrate between processors. On each processor, tasks are scheduled according to rate-monotonic. We propose an algorithm that can schedule all task sets that any other possible algorithm can schedule assuming that our algorithm is given processors that are √2 / √2−1 ≈ 3.41 times faster. No such guarantees are previously known for partitioned static-priority scheduling on uniform multiprocessors.

A complex protocol layer as a linux user-space process

With the current complexity of communication protocols, implementing its layers totally in the kernel of the operating system is too cumbersome, and it does not allow use of the capabilities only available in user space processes. However, building protocols as user space processes must not impair the responsiveness of the communication. Therefore, in this paper we present a layer of a communication protocol, which, due to its complexity, was implemented in a user space process. Lower layers of the protocol are, for responsiveness issues, implemented in the kernel. This protocol was developed to support large-scale power-line communication (PLC) with timing requirements.

Non-uniform microstrip antenna array for RX DSRC communications

The urgent need to mitigate traffic problems such as accidents, road hazards, pollution and traffic jam have strongly driven the development of vehicular communications. DSRC (Dedicated Short Range Communications) is the technology of choice in vehicular communications, enabling real time information exchange among vehicles V2V (Vehicle-to-Vehicle) and between vehicles and infrastructure V2I (Vehicle-Infrastructure). This paper presents a receiving antenna for a single lane DSRC control unit. The antenna is a non-uniform array with five microstrip patches. The obtained beam width, bandwidth and circular polarization quality, among other characteristics, are compatible with the DSRC standards, making this antenna suitable for this application. © 2014 IEEE.

The impact of different power dividers used in a non-uniform planar antenna array

Wireless communications are widely used for various applications, requiring antennas with different features. Often, to achieve the desired radiation pattern, is necessary to employ antenna arrays, using non-uniform excitation on its elements. Power dividers can be used and the best known are the T-junction and the Wilkinson power divider, whose main advantage is the isolation between output ports. In this paper the impact of this isolation on the overall performance of a circularly polarized planar antenna array using non-uniform excitation is investigated. Results show a huge decrease of the array bandwidths either in terms of return loss or in polarization, without resistors. © 2014 IEEE.