Chroma binary similarity and local alignment applied to cover song identification

We present a new technique for audio signal comparison based on tonal subsequence alignment and its application to detect cover versions (i.e., different performances of the same underlying musical piece). Cover song identification is a task whose popularity has increased in the Music Information Retrieval (MIR) community along in the past, as it provides a direct and objective way to evaluate music similarity algorithms.This article first presents a series of experiments carried outwith two state-of-the-art methods for cover song identification.We have studied several components of these (such as chroma resolution and similarity, transposition, beat tracking or Dynamic Time Warping constraints), in order to discover which characteristics would be desirable for a competitive cover song identifier. After analyzing many cross-validated results, the importance of these characteristics is discussed, and the best-performing ones are finally applied to the newly proposed method. Multipleevaluations of this one confirm a large increase in identificationaccuracy when comparing it with alternative state-of-the-artapproaches.

On codes, matroids, and secure multiparty computation from linear secret-sharing schemes

Error-correcting codes and matroids have been widely used in the study of ordinary secret sharing schemes. In this paper, the connections between codes, matroids, and a special class of secret sharing schemes, namely, multiplicative linear secret sharing schemes (LSSSs), are studied. Such schemes are known to enable multiparty computation protocols secure against general (nonthreshold) adversaries.Two open problems related to the complexity of multiplicative LSSSs are considered in this paper. The first one deals with strongly multiplicative LSSSs. As opposed to the case of multiplicative LSSSs, it is not known whether there is an efficient method to transform an LSSS into a strongly multiplicative LSSS for the same access structure with a polynomial increase of the complexity. A property of strongly multiplicative LSSSs that could be useful in solving this problem is proved. Namely, using a suitable generalization of the well-known Berlekamp–Welch decoder, it is shown that all strongly multiplicative LSSSs enable efficient reconstruction of a shared secret in the presence of malicious faults. The second one is to characterize the access structures of ideal multiplicative LSSSs. Specifically, the considered open problem is to determine whether all self-dual vector space access structures are in this situation. By the aforementioned connection, this in fact constitutes an open problem about matroid theory, since it can be restated in terms of representability of identically self-dual matroids by self-dual codes. A new concept is introduced, the flat-partition, that provides a useful classification of identically self-dual matroids. Uniform identically self-dual matroids, which are known to be representable by self-dual codes, form one of the classes. It is proved that this property also holds for the family of matroids that, in a natural way, is the next class in the above classification: the identically self-dual bipartite matroids.

On fast-decodable space-time block codes

We focus on full-rate, fast-decodable space–time block codes (STBCs) for 2 x 2 and 4 x 2 multiple-input multiple-output (MIMO) transmission. We first derive conditions and design criteria for reduced-complexity maximum-likelihood (ML) decodable 2 x 2 STBCs, and we apply them to two families of codes that were recently discovered. Next, we derive a novel reduced-complexity 4 x 2 STBC, and show that it outperforms all previously known codes with certain constellations.

On high-rate full-diversity 2x2 space-time codes with low-complexity optimum detection

The 2×2 MIMO profiles included in Mobile WiMAX specifications are Alamouti’s space-time code (STC) fortransmit diversity and spatial multiplexing (SM). The former hasfull diversity and the latter has full rate, but neither of them hasboth of these desired features. An alternative 2×2 STC, which is both full rate and full diversity, is the Golden code. It is the best known 2×2 STC, but it has a high decoding complexity. Recently, the attention was turned to the decoder complexity, this issue wasincluded in the STC design criteria, and different STCs wereproposed. In this paper, we first present a full-rate full-diversity2×2 STC design leading to substantially lower complexity ofthe optimum detector compared to the Golden code with only a slight performance loss. We provide the general optimized form of this STC and show that this scheme achieves the diversitymultiplexing frontier for square QAM signal constellations. Then, we present a variant of the proposed STC, which provides a further decrease in the detection complexity with a rate reduction of 25% and show that this provides an interesting trade-off between the Alamouti scheme and SM.

Low-density parity-check codes for nonergodic block-fading channels

We design powerful low-density parity-check (LDPC) codes with iterative decoding for the block-fading channel. We first study the case of maximum-likelihood decoding, and show that the design criterion is rather straightforward. Since optimal constructions for maximum-likelihood decoding do not performwell under iterative decoding, we introduce a new family of full-diversity LDPC codes that exhibit near-outage-limit performance under iterative decoding for all block-lengths. This family competes favorably with multiplexed parallel turbo codes for nonergodic channels.

Full diversity product codes for block erasure and block fading channels

We show how to build full-diversity product codes under both iterative encoding and decoding over non-ergodic channels, in presence of block erasure and block fading. The concept of a rootcheck or a root subcode is introduced by generalizing the same principle recently invented for low-density parity-check codes. We also describe some channel related graphical properties of the new family of product codes, a familyreferred to as root product codes.

A comparison of full-rate full-diversity 2x2 space-time codes for WiMAX systems

Multiple-input multiple-output (MIMO) techniques have become an essential part of broadband wireless communications systems. For example, the recently developed IEEE 802.16e specifications for broadband wireless access include three MIMOprofiles employing 2×2 space-time codes (STCs), and two of these MIMO schemes are mandatory on the downlink of Mobile WiMAX systems. One of these has full rate, and the other has full diversity, but neither of them has both of the desired features. The third profile, namely, Matrix C, which is not mandatory, is both a full rate and a full diversity code, but it has a high decoder complexity. Recently, the attention was turned to the decodercomplexity issue and including this in the design criteria, several full-rate STCs were proposed as alternatives to Matrix C. In this paper, we review these different alternatives and compare them to Matrix C in terms of performances and the correspondingreceiver complexities.

Outage thresholds of LDPC codes over nonergodic block-fading channels

This paper derives approximations allowing the estimation of outage probability for standard irregular LDPC codes and full-diversity Root-LDPC codes used over nonergodic block-fading channels. Two separate approaches are discussed: a numerical approximation, obtained by curve fitting, for both code ensembles, and an analytical approximation for Root-LDPC codes, obtained under the assumption that the slope of the iterative threshold curve of a given code ensemble matches the slope of the outage capacity curve in the high-SNR regime.

On iterative performance of LDPC and Root-LDPC codes over block-fading channels

This paper presents our investigation on iterativedecoding performances of some sparse-graph codes on block-fading Rayleigh channels. The considered code ensembles are standard LDPC codes and Root-LDPC codes, first proposed in and shown to be able to attain the full transmission diversity. We study the iterative threshold performance of those codes as a function of fading gains of the transmission channel and propose a numerical approximation of the iterative threshold versus fading gains, both both LDPC and Root-LDPC codes.Also, we show analytically that, in the case of 2 fading blocks,the iterative threshold root of Root-LDPC codes is proportional to (α1 α2)1, where α1 and α2 are corresponding fading gains.From this result, the full diversity property of Root-LDPC codes immediately follows.

Transcriptional activation of the macrophage migration-inhibitory factor gene by the corticotropin-releasing factor is mediated by the cyclic adenosine 3',5'- monophosphate responsive element-binding protein CREB in pituitary cells.

Macrophage migration-inhibitory factor (MIF) has recently been identified as a pituitary hormone that functions as a counterregulatory modulator of glucocorticoid action within the immune system. In the anterior pituitary gland, MIF is expressed in TSH- and ACTH-producing cells, and its secretion is induced by CRF. To investigate MIF function and regulation within pituitary cells, we initiated the characterization of the MIF 5'-regulatory region of the gene. The -1033 to +63 bp of the murine MIF promoter was cloned 5' to a luciferase reporter gene and transiently transfected into freshly isolated rat anterior pituitary cells. This construct drove high basal transcriptional activity that was further enhanced after stimulation with CRF or with an activator of adenylate cyclase. These transcriptional effects were associated with a concomitant rise in ACTH secretion in the transfected cells and by an increase in MIF gene expression as assessed by Northern blot analysis. A cAMP-responsive element (CRE) was identified within the MIF promoter region which, once mutated, abolished the cAMP responsiveness of the gene. Using this newly identified CRE, DNA-binding activity was detected by gel retardation assay in nuclear extracts prepared from isolated anterior pituitary cells and AtT-20 corticotrope tumor cells. Supershift experiments using antibodies against the CRE-binding protein CREB, together with competition assays and the use of recombinant CREB, allowed the detection of CREB-binding activity with the identified MIF CRE. These data demonstrate that CREB is the mediator of the CRF-induced MIF gene transcription in pituitary cells through an identified CRE in the proximal region of the MIF promoter.

Cyclic AMP induces differentiation in vitro of human melanoma cells.

Treating human melanoma lines with dibutyryl adenosine 3':5'-cyclic monophosphate (dbc AMP) resulted in morphologic changes associated with the altered expression of cell surface antigens. After treatment, cells developed long cellular projections characteristic of mature melanocytes and showed the presence of an increased number of Stage II premelanosomes. In addition, induction of melanin synthesis, detected as brown perinuclear pigmentation, was observed. The AMP further drastically reduced the growth rate of the five melanoma cell lines that were tested. The influence of dbc AMP was completely reversible 3 days after the agent was removed from the culture medium. The antigenic phenotype of the melanoma lines was compared before and after dbc AMP treatment. This was done with four monoclonal antibodies directed against major histocompatibility complex (MHC) Class I and II antigens and 11 monoclonal antibodies defining eight different melanoma-associated antigenic systems. Treatment with dbc AMP reduced the expression of human leukocyte antigen (HLA)-ABC antigens and beta-2-microglobulin in five of five melanoma lines. In the two HLA-DR-positive cell lines dbc AMP reduced the expression of this antigen in one line and enhanced it in the other. No induction of HLA-DR or HLA-DC antigens was observed in the Class II negative cell lines. Furthermore, dbc-AMP modulated the expression of the majority of the melanoma antigenic systems tested. The expression of a 90-kilodalton (KD) antigen, which has been found to be upregulated by interferon-gamma, was markedly decreased in all the five cell lines. A similar decrease in the expression of the high molecular weight proteoglycan-associated antigen (220-240 KD) was observed. The reduced expression of Class I and II MHC antigens as well as the altered expression of the melanoma-associated antigens studied were shown to be reversible after dbc AMP was removed. Our results collectively show that the monoclonal antibody-defined melanoma-associated molecules are linked to differentiation. They could provide useful tools for monitoring the maturation of melanomas in vivo induced by chemical agents or natural components favoring differentiation.

Developmental stage-specific expression of cyclic adenosine 3',5'-monophosphate response element-binding protein CREB during spermatogenesis involves alternative exon splicing.

Spermatogenesis is a temporally regulated developmental process by which the gonadotropin-responsive somatic Sertoli and Leydig cells act interdependently to direct the maturation of the germinal cells. The metabolism of Sertoli and Leydig cells is regulated by the pituitary gonadotropins FSH and LH, which, in turn, activate adenylate cyclase. Because the cAMP-second messenger pathway is activated by FSH and LH, we postulated that the cAMP-responsive element-binding protein (CREB) plays a physiological role in Sertoli and Leydig cells, respectively. Immunocytochemical analyses of rat testicular sections show a remarkably high expression of CREB in the haploid round spermatids and, to some extent, in pachytene spermatocytes and Sertoli cells. Although most of the CREB antigen is detected in the nuclei, some CREB antigen is also present in the cytoplasm. Remarkably, the cytoplasmic CREB results from the translation of a unique alternatively spliced transcript of the CREB gene that incorporates an exon containing multiple stop codons inserted immediately up-stream of the exons encoding the DNA-binding domain of CREB. Thus, the RNA containing the alternatively spliced exon encodes a truncated transcriptional transactivator protein lacking both the DNA-binding domain and nuclear translocation signal of CREB. Most of the CREB transcripts detected in the germinal cells contain the alternatively spliced exon, suggesting a function of the exon to modulate the synthesis of CREB. In the Sertoli cells we observed a striking cyclical (12-day periodicity) increase in the levels of CREB mRNA that coincides with the splicing out of the restrictive exon containing the stop codons. Because earlier studies established that FSH-stimulated cAMP levels in Sertoli cells are also cyclical, and the CREB gene promoter contains cAMP-responsive enhancers, we suggest that the alternative RNA splicing controls a positive autoregulation of CREB gene expression mediated by cAMP.

Simple models for multi-attribute choice with many alternatives: When it does and does not pay to face tradeoffs with binary attributes

Working Paper no longer available. Please contact the author.

Take-the-best and other simple strategies: Why and when they work 'well' in binary choice

The effectiveness of decision rules depends on characteristics of bothrules and environments. A theoretical analysis of environments specifiesthe relative predictive accuracies of the lexicographic rule 'take-the-best'(TTB) and other simple strategies for binary choice. We identify threefactors: how the environment weights variables; characteristics of choicesets; and error. For cases involving from three to five binary cues, TTBis effective across many environments. However, hybrids of equal weights(EW) and TTB models are more effective as environments become morecompensatory. In the presence of error, TTB and similar models do not predictmuch better than a naïve model that exploits dominance. We emphasizepsychological implications and the need for more complete theories of theenvironment that include the role of error.

Cumulative dominance and heuristic performance in binary multi-attribute choice

Several studies have reported high performance of simple decision heuristics multi-attribute decision making. In this paper, we focus on situations where attributes are binary and analyze the performance of Deterministic-Elimination-By-Aspects (DEBA) and similar decision heuristics. We consider non-increasing weights and two probabilistic models for the attribute values: one where attribute values are independent Bernoulli randomvariables; the other one where they are binary random variables with inter-attribute positive correlations. Using these models, we show that good performance of DEBA is explained by the presence of cumulative as opposed to simple dominance. We therefore introduce the concepts of cumulative dominance compliance and fully cumulative dominance compliance and show that DEBA satisfies those properties. We derive a lower bound with which cumulative dominance compliant heuristics will choose a best alternative and show that, even with many attributes, this is not small. We also derive an upper bound for the expected loss of fully cumulative compliance heuristics and show that this is moderateeven when the number of attributes is large. Both bounds are independent of the values ofthe weights.