On t-designs and bounds relating query complexity to error resilience in locally correctable codes

An n-length block code C is said to be r-query locally correctable, if for any codeword x ∈ C, one can probabilistically recover any one of the n coordinates of the codeword x by querying at most r coordinates of a possibly corrupted version of x. It is known that linear codes whose duals contain 2-designs are locally correctable. In this article, we consider linear codes whose duals contain t-designs for larger t. It is shown here that for such codes, for a given number of queries r, under linear decoding, one can, in general, handle a larger number of corrupted bits. We exhibit to our knowledge, for the first time, a finite length code, whose dual contains 4-designs, which can tolerate a fraction of up to 0.567/r corrupted symbols as against a maximum of 0.5/r in prior constructions. We also present an upper bound that shows that 0.567 is the best possible for this code length and query complexity over this symbol alphabet thereby establishing optimality of this code in this respect. A second result in the article is a finite-length bound which relates the number of queries r and the fraction of errors that can be tolerated, for a locally correctable code that employs a randomized algorithm in which each instance of the algorithm involves t-error correction.

Correlation between local structural dynamics of proteins inferred from NMR ensembles and evolutionary dynamics of homologues of known structure

Conformational changes in proteins are extremely important for their biochemical functions. Correlation between inherent conformational variations in a protein and conformational differences in its homologues of known structure is still unclear. In this study, we have used a structural alphabet called Protein Blocks (PBs). PBs are used to perform abstraction of protein 3-D structures into a 1-D strings of 16 alphabets (a-p) based on dihedral angles of overlapping pentapeptides. We have analyzed the variations in local conformations in terms of PBs represented in the ensembles of 801 protein structures determined using NMR spectroscopy. In the analysis of concatenated data over all the residues in all the NMR ensembles, we observe that the overall nature of inherent local structural variations in NMR ensembles is similar to the nature of local structural differences in homologous proteins with a high correlation coefficient of .94. High correlation at the alignment positions corresponding to helical and beta-sheet regions is only expected. However, the correlation coefficient by considering only the loop regions is also quite high (.91). Surprisingly, segregated position-wise analysis shows that this high correlation does not hold true to loop regions at the structurally equivalent positions in NMR ensembles and their homologues of known structure. This suggests that the general nature of local structural changes is unique; however most of the local structural variations in loop regions of NMR ensembles do not correlate to their local structural differences at structurally equivalent positions in homologues.

Codes With Local Regeneration and Erasure Correction

Regenerating codes and codes with locality are two coding schemes that have recently been proposed, which in addition to ensuring data collection and reliability, also enable efficient node repair. In a situation where one is attempting to repair a failed node, regenerating codes seek to minimize the amount of data downloaded for node repair, while codes with locality attempt to minimize the number of helper nodes accessed. This paper presents results in two directions. In one, this paper extends the notion of codes with locality so as to permit local recovery of an erased code symbol even in the presence of multiple erasures, by employing local codes having minimum distance >2. An upper bound on the minimum distance of such codes is presented and codes that are optimal with respect to this bound are constructed. The second direction seeks to build codes that combine the advantages of both codes with locality as well as regenerating codes. These codes, termed here as codes with local regeneration, are codes with locality over a vector alphabet, in which the local codes themselves are regenerating codes. We derive an upper bound on the minimum distance of vector-alphabet codes with locality for the case when their constituent local codes have a certain uniform rank accumulation property. This property is possessed by both minimum storage regeneration (MSR) and minimum bandwidth regeneration (MBR) codes. We provide several constructions of codes with local regeneration which achieve this bound, where the local codes are either MSR or MBR codes. Also included in this paper, is an upper bound on the minimum distance of a general vector code with locality as well as the performance comparison of various code constructions of fixed block length and minimum distance.

Estimation of voice-onset time in continuous speech using temporal measures

This paper proposes an automatic acoustic-phonetic method for estimating voice-onset time of stops. This method requires neither transcription of the utterance nor training of a classifier. It makes use of the plosion index for the automatic detection of burst onsets of stops. Having detected the burst onset, the onset of the voicing following the burst is detected using the epochal information and a temporal measure named the maximum weighted inner product. For validation, several experiments are carried out on the entire TIMIT database and two of the CMU Arctic corpora. The performance of the proposed method compares well with three state-of-the-art techniques. (C) 2014 Acoustical Society of America

Improved subject-independent acoustic-to-articulatory inversion

In subject-independent acoustic-to-articulatory inversion, the articulatory kinematics of a test subject are estimated assuming that the training corpus does not include data from the test subject. The training corpus in subject-independent inversion (SII) is formed with acoustic and articulatory kinematics data and the acoustic mismatch between training and test subjects is then estimated by an acoustic normalization using acoustic data drawn from a large pool of speakers called generic acoustic space (GAS). In this work, we focus on improving the SII performance through better acoustic normalization and adaptation. We propose unsupervised and several supervised ways of clustering GAS for acoustic normalization. We perform an adaptation of acoustic models of GAS using the acoustic data of the training and test subjects in SII. It is found that SII performance significantly improves (similar to 25% relative on average) over the subject-dependent inversion when the acoustic clusters in GAS correspond to phonetic units (or states of 3-state phonetic HMMs) and when the acoustic model built on GAS is adapted to training and test subjects while optimizing the inversion criterion. (C) 2014 Elsevier B.V. All rights reserved.

Large-Scale Multiuser SM-MIMO Versus Massive MIMO

Spatial modulation (SM) is attractive for multiantenna wireless communications. SM uses multiple transmit antenna elements but only one transmit radio frequency (RF) chain. In SM, in addition to the information bits conveyed through conventional modulation symbols (e.g., QAM), the index of the active transmit antenna also conveys information bits. In this paper, we establish that SM has significant signal-to-noise (SNR) advantage over conventional modulation in large-scale multiuser (multiple-input multiple-output) MIMO systems. Our new contribution in this paper addresses the key issue of large-dimension signal processing at the base station (BS) receiver (e.g., signal detection) in large-scale multiuser SM-MIMO systems, where each user is equipped with multiple transmit antennas (e.g., 2 or 4 antennas) but only one transmit RF chain, and the BS is equipped with tens to hundreds of (e.g., 128) receive antennas. Specifically, we propose two novel algorithms for detection of large-scale SM-MIMO signals at the BS; one is based on message passing and the other is based on local search. The proposed algorithms achieve very good performance and scale well. For the same spectral efficiency, multiuser SM-MIMO outperforms conventional multiuser MIMO (recently being referred to as massive MIMO) by several dBs. The SNR advantage of SM-MIMO over massive MIMO can be attributed to: (i) because of the spatial index bits, SM-MIMO can use a lower-order QAM alphabet compared to that in massive MIMO to achieve the same spectral efficiency, and (ii) for the same spectral efficiency and QAM size, massive MIMO will need more spatial streams per user which leads to increased spatial interference.

Generalized Spatial Modulation in Large-Scale Multiuser MIMO Systems

Generalized spatial modulation (GSM) uses n(t) transmit antenna elements but fewer transmit radio frequency (RF) chains, n(rf). Spatial modulation (SM) and spatial multiplexing are special cases of GSM with n(rf) = 1 and n(rf) = n(t), respectively. In GSM, in addition to conveying information bits through n(rf) conventional modulation symbols (for example, QAM), the indices of the n(rf) active transmit antennas also convey information bits. In this paper, we investigate GSM for large-scale multiuser MIMO communications on the uplink. Our contributions in this paper include: 1) an average bit error probability (ABEP) analysis for maximum-likelihood detection in multiuser GSM-MIMO on the uplink, where we derive an upper bound on the ABEP, and 2) low-complexity algorithms for GSM-MIMO signal detection and channel estimation at the base station receiver based on message passing. The analytical upper bounds on the ABEP are found to be tight at moderate to high signal-to-noise ratios (SNR). The proposed receiver algorithms are found to scale very well in complexity while achieving near-optimal performance in large dimensions. Simulation results show that, for the same spectral efficiency, multiuser GSM-MIMO can outperform multiuser SM-MIMO as well as conventional multiuser MIMO, by about 2 to 9 dB at a bit error rate of 10(-3). Such SNR gains in GSM-MIMO compared to SM-MIMO and conventional MIMO can be attributed to the fact that, because of a larger number of spatial index bits, GSM-MIMO can use a lower-order QAM alphabet which is more power efficient.

Minimum-Error-Probability CFO Estimation for Multiuser MIMO-OFDM Systems

We consider carrier frequency offset (CFO) estimation in the context of multiple-input multiple-output (MIMO) orthogonal frequency-division multiplexing (OFDM) systems over noisy frequency-selective wireless channels with both single- and multiuser scenarios. We conceived a new approach for parameter estimation by discretizing the continuous-valued CFO parameter into a discrete set of bins and then invoked detection theory, analogous to the minimum-bit-error-ratio optimization framework for detecting the finite-alphabet received signal. Using this radical approach, we propose a novel CFO estimation method and study its performance using both analytical results and Monte Carlo simulations. We obtain expressions for the variance of the CFO estimation error and the resultant BER degradation with the single- user scenario. Our simulations demonstrate that the overall BER performance of a MIMO-OFDM system using the proposed method is substantially improved for all the modulation schemes considered, albeit this is achieved at increased complexity.

Sibilantes tras consonante sonante en euskera: inserción vs. africación, fonética y fonología

[ES] Este artículo trata sobre el proceso fonológico que en euskera convierte en africadas las fricativas sibilantes tras consonante sonante. El análisis de dicho proceso es particularmente adecuado para la discusión de la relación recíproca entre fonética y fonología tal y defendida por la Fonología Natural. Es ese marco teórico, este trabajo estudia la motivación fonética de la fonología; por otro lado, explora las consecuencias perceptivas –tal vez también productivas– de los distintos inventarios fonémicos de cada lengua, comparando el proceso de africación vasco con el más conocido proceso inglés de inserción oclusiva. Se argumenta que la opción terminológica africación vs. inserción podría no ser una cuestión trivial sino el reflejo de alguna diferencia en el procesamiento fonológico de condiciones fonéticas básicamente equivalentes. La optimización de la estructura silábica se presenta como otro posible elemento de la configuración del proceso y como factor que contribuye a la mayor o menor relevancia de éste en lenguas tipológicamente distintas. Se ofrecen en la sección 3 algunos comentarios sobre imágenes espectrográficas como muestra de las observaciones que dieron lugar al trabajo de investigación en curso.

Enseñanza de español a alumnado anglófono

Este trabajo ofrece un análisis contrastivo entre los idiomas inglés y español en sus diferentes niveles: fonético-fonológico, morfosintáctico, léxico-semántico, rasgos paralingüísticos y pragmático-cultural, poniendo especial énfasis en las principales diferencias que se dan entre ambos. Está especialmente dirigido a todo el profesorado de español que enseñe esta lengua al alumnado anglófono, ya sea como LE o L2, ya que resulta útil para comprender las principales dificultades que presenta este alumnado en su proceso de aprendizaje de la lengua española.

Ruas imaginárias: o humor linguístico-expressivo nas crônicas de Aldir Blanc

O objetivo desta pesquisa é analisar as marcas linguísticas que compõem as relações de sentido no que diz respeito ao humor da crônica de Aldir Blanc. A partir da percepção da estrutura da Língua Portuguesa, verificar quais as ações na produção textual da crônica sejam estas morfológicas, gramaticais, lexicais, sintáticas, fonéticas, estilísticas ou semânticas que, ao aliar-se à práxis cotidiana (contexto) oferecida pelos jornais, propiciam o discurso humorístico do autor. Os pressupostos teóricos que corroboram as respectivas demarcações linguísticas terão ênfase no tocante aos aspectos semânticos, com Stephen Ullman, Pierre Guiraud e Edward Lopes. Os traços característicos da crônica, o humor e a ironia como recursos discursivos, a seleção lexical, as inferências, o jogo lúdico da grafia das palavras, as formas textuais serão inferidos dialogicamente em grande parte pelos estudos estilísticos de Marcel Cressot, Pierre Guiraud, Mattoso Câmara, Nilce SantAnna Martins e José Lemos Monteiro. Desse modo, apontamos para um estudo da língua sob uma ótica semântico-discursiva, levando em conta sua expressividade estilística. Dessa forma, à valorização do manuseamento linguístico, quer pela escritura, quer pela leitura, acrescenta-se o dado crítico da língua através do discurso presente no humor, tendo em vista o gênero textual que é a crônica e sua grande penetração social pelos jornais de grande circulação

A leitura da tira de quadrinhos: para uma gramática contrastiva do não verbal com o verbal

O objetivo desta tese foi sugerir à prática didática subsídios que possam contribuir com a condução da leitura de Tiras de Quadrinhos. Promove-se a ideia de que é possível elaborar uma gramática contrastiva do não verbal a partir da gramática do verbal, na consideração de que a leitura da imagem deve estar maciçamente atrelada à vivência diária do ser humano. Perspectivas da Linguística textual, da Semiótica peirceana e da Gramática tradicional foram entrelaçadas para obter-se um suporte teórico julgado eficaz na sustentação da hipótese de que a leitura multifacetada oferecida pela Tira de Quadrinhos é promissora quanto à formação de leitores proficientes. Fazem parte dessa conjuntura a Análise da conversação, a Organicidade do tópico discursivo, a Iconicidade diagramática e focalizações fonéticas, morfológicas e sintáticas envolvidas pelo semântico. No amálgama da tradição com a modernidade, sugeriram-se análises e interpretações da imagem no contexto linguístico-textual. O corpus é constituído de Tiras de Quadrinhos, publicadas diariamente no jornal O Globo, referentemente ao período de cinco anos, de 2005 a 2009

El cierre -e- > -ei- en la antroponimia hispana y su delimitación geográfica

[ES] Tradicionalmente se ha intentado explicar de igual manera la "i" de los diptongos "oi", "ai", "ei" presentes en nombres antiguos tanto de personas como de divinidades del occidente peninsular. Sin embargo, la alternancia visible en dobletes del tipo "ei"/"e" no se produce en los diptongos "oi" y "ai", que carecen de variantes con "o" y "a", respectivamente. Por otro lado, la dispersión de las formas "ei"/"e" sitúa el fenómeno en un lugar muy delimitado geográficamente: Lusitania. Una vez aislado el objeto de estudio (la pareja "ei"/"e"), se intenta dar una explicación a la grafía "ei" cuando está en lugar de una "e" etimológica: el cierre fonético en contextos principalmente nasales.

An automatic speaker recognition system for intelligence applications

This paper presents an automatic speaker recognition system for intelligence applications. The system has to provide functionalities for a speaker skimming application in which databases of recorded conversations belonging to an ongoing investigation can be annotated and quickly browsed by an operator. The paper discusses the criticalities introduced by the characteristics of the audio signals under consideration - in particular background noise and channel/coding distortions - as well as the requirements and functionalities of the system under development. It is shown that the performance of state-of-the-art approaches degrades significantly in presence of moderately high background noise. Finally, a novel speaker recognizer based on phonetic features and an ensemble classifier is presented. Results show that the proposed approach improves performance on clean audio, and suggest that it can be employed towards improved real-world robustness. © EURASIP, 2009.