Some MDS Codes over Gf(64) Connected with the Binary Doubly-Even [72,36,16] Code

* The author is supported by a Return Fellowship from the Alexander von Humboldt Foundation.

First stars XI. Chemical composition of the extremely metal-poor dwarfs in the binary CS 22876-032

Context. Unevolved metal-poor stars constitute a fossil record of the early Galaxy, and can provide invaluable information on the properties of the first generations of stars. Binary systems also provide direct information on the stellar masses of their member stars. Aims. The purpose of this investigation is a detailed abundance study of the double-lined spectroscopic binary CS 22876-032, which comprises the two most metal-poor dwarfs known. Methods. We used high-resolution, high-S/N ratio spectra from the UVES spectrograph at the ESO VLT telescope. Long-term radial-velocity measurements and broad-band photometry allowed us to determine improved orbital elements and stellar parameters for both components. We used OSMARCS 1D models and the TURBOSPECTRUM spectral synthesis code to determine the abundances of Li, O, Na, Mg, Al, Si, Ca, Sc, Ti, Cr, Mn, Fe, Co and Ni. We also used the (COBOLD)-B-5 model atmosphere code to compute the 3D abundance corrections, notably for Li and O. Results. We find a metallicity of [Fe/H] similar to -3.6 for both stars, using 1D models with 3D corrections of similar to -0.1 dex from averaged 3D models. We determine the oxygen abundance from the near-UV OH bands; the 3D corrections are large, -1 and -1.5 dex for the secondary and primary respectively, and yield [O/Fe] similar to 0.8, close to the high-quality results obtained from the [OI] 630 nm line in metal-poor giants. Other [alpha/Fe] ratios are consistent with those measured in other dwarfs and giants with similar [Fe/H], although Ca and Si are somewhat low ([X/Fe] less than or similar to 0). Other element ratios follow those of other halo stars. The Li abundance of the primary star is consistent with the Spite plateau, but the secondary shows a lower abundance; 3D corrections are small. Conclusions. The Li abundance in the primary star supports the extension of the Spite Plateau value at the lowest metallicities, without any decrease. The low abundance in the secondary star could be explained by endogenic Li depletion, due to its cooler temperature. If this is not the case, another, yet unknown mechanism may be causing increased scatter in A( Li) at the lowest metallicities.

Cyclic variability of the circumstellar disk of the Be star zeta Tauri II. Testing the 2D global disk oscillation model

Context. About 2/3 of the Be stars present the so-called V/R variations, a phenomenon characterized by the quasi-cyclic variation in the ratio between the violet and red emission peaks of the HI emission lines. These variations are generally explained by global oscillations in the circumstellar disk forming a one-armed spiral density pattern that precesses around the star with a period of a few years. Aims. This paper presents self-consistent models of polarimetric, photometric, spectrophotometric, and interferometric observations of the classical Be star zeta Tauri. The primary goal is to conduct a critical quantitative test of the global oscillation scenario. Methods. Detailed three-dimensional, NLTE radiative transfer calculations were carried out using the radiative transfer code HDUST. The most up-to-date research on Be stars was used as input for the code in order to include a physically realistic description for the central star and the circumstellar disk. The model adopts a rotationally deformed, gravity darkened central star, surrounded by a disk whose unperturbed state is given by a steady-state viscous decretion disk model. It is further assumed that this disk is in vertical hydrostatic equilibrium. Results. By adopting a viscous decretion disk model for zeta Tauri and a rigorous solution of the radiative transfer, a very good fit of the time-average properties of the disk was obtained. This provides strong theoretical evidence that the viscous decretion disk model is the mechanism responsible for disk formation. The global oscillation model successfully fitted spatially resolved VLTI/AMBER observations and the temporal V/R variations in the H alpha and Br gamma lines. This result convincingly demonstrates that the oscillation pattern in the disk is a one-armed spiral. Possible model shortcomings, as well as suggestions for future improvements, are also discussed.

Coding mode decision algorithm for binary descriptor coding

In visual sensor networks, local feature descriptors can be computed at the sensing nodes, which work collaboratively on the data obtained to make an efficient visual analysis. In fact, with a minimal amount of computational effort, the detection and extraction of local features, such as binary descriptors, can provide a reliable and compact image representation. In this paper, it is proposed to extract and code binary descriptors to meet the energy and bandwidth constraints at each sensing node. The major contribution is a binary descriptor coding technique that exploits the correlation using two different coding modes: Intra, which exploits the correlation between the elements that compose a descriptor; and Inter, which exploits the correlation between descriptors of the same image. The experimental results show bitrate savings up to 35% without any impact in the performance efficiency of the image retrieval task. © 2014 EURASIP.

Compact SMB chromatography for binary separation

A thesis submitted for the degree of Doctor of Philosophy

A semi-automatic approach to code smells detection

Eradication of code smells is often pointed out as a way to improve readability, extensibility and design in existing software. However, code smell detection remains time consuming and error-prone, partly due to the inherent subjectivity of the detection processes presently available. In view of mitigating the subjectivity problem, this dissertation presents a tool that automates a technique for the detection and assessment of code smells in Java source code, developed as an Eclipse plugin. The technique is based upon a Binary Logistic Regression model that uses complexity metrics as independent variables and is calibrated by expert‟s knowledge. An overview of the technique is provided, the tool is described and validated by an example case study.

Solving large 0–1 multidimensional knapsack problems by a new simplified binary artificial fish swarm algorithm

The artificial fish swarm algorithm has recently been emerged in continuous global optimization. It uses points of a population in space to identify the position of fish in the school. Many real-world optimization problems are described by 0-1 multidimensional knapsack problems that are NP-hard. In the last decades several exact as well as heuristic methods have been proposed for solving these problems. In this paper, a new simpli ed binary version of the artificial fish swarm algorithm is presented, where a point/ fish is represented by a binary string of 0/1 bits. Trial points are created by using crossover and mutation in the different fi sh behavior that are randomly selected by using two user de ned probability values. In order to make the points feasible the presented algorithm uses a random heuristic drop item procedure followed by an add item procedure aiming to increase the profit throughout the adding of more items in the knapsack. A cyclic reinitialization of 50% of the population, and a simple local search that allows the progress of a small percentage of points towards optimality and after that refines the best point in the population greatly improve the quality of the solutions. The presented method is tested on a set of benchmark instances and a comparison with other methods available in literature is shown. The comparison shows that the proposed method can be an alternative method for solving these problems.

Generator Matrix Based Search for Extremal Self-Dual Binary Error-Correcting Codes

Self-dual doubly even linear binary error-correcting codes, often referred to as Type II codes, are codes closely related to many combinatorial structures such as 5-designs. Extremal codes are codes that have the largest possible minimum distance for a given length and dimension. The existence of an extremal (72,36,16) Type II code is still open. Previous results show that the automorphism group of a putative code C with the aforementioned properties has order 5 or dividing 24. In this work, we present a method and the results of an exhaustive search showing that such a code C cannot admit an automorphism group Z6. In addition, we present so far unpublished construction of the extended Golay code by P. Becker. We generalize the notion and provide example of another Type II code that can be obtained in this fashion. Consequently, we relate Becker's construction to the construction of binary Type II codes from codes over GF(2^r) via the Gray map.

The symmetry group of Z(q)(n) in the Lee space and the Z(qn)-linear codes

The Z(4)-linearity is a construction technique of good binary codes. Motivated by this property, we address the problem of extending the Z(4)-linearity to Z(q)n-linearity. In this direction, we consider the n-dimensional Lee space of order q, that is, (Z(q)(n), d(L)), as one of the most interesting spaces for coding applications. We establish the symmetry group of Z(q)(n) for any n and q by determining its isometries. We also show that there is no cyclic subgroup of order q(n) in Gamma(Z(q)(n)) acting transitively in Z(q)(n). Therefore, there exists no Z(q)n-linear code with respect to the cyclic subgroup.

Genetic Algorithms (Binary and Real Codes) for the Optimisation of a Fermentation Process for Butanol Production

Fundação de Amparo à Pesquisa do Estado de São Paulo (FAPESP)

A formalized optimum code search for q-ary trellis codes

Coordenação de Aperfeiçoamento de Pessoal de Nível Superior (CAPES)

Is a Genome a Codeword of an Error-Correcting Code?

Since a genome is a discrete sequence, the elements of which belong to a set of four letters, the question as to whether or not there is an error-correcting code underlying DNA sequences is unavoidable. The most common approach to answering this question is to propose a methodology to verify the existence of such a code. However, none of the methodologies proposed so far, although quite clever, has achieved that goal. In a recent work, we showed that DNA sequences can be identified as codewords in a class of cyclic error-correcting codes known as Hamming codes. In this paper, we show that a complete intron-exon gene, and even a plasmid genome, can be identified as a Hamming code codeword as well. Although this does not constitute a definitive proof that there is an error-correcting code underlying DNA sequences, it is the first evidence in this direction.

Genome characterization through a mathematical model of the genetic code: an analysis of the whole chromosome 1 of A. thaliana

The objective of this work is to characterize the genome of the chromosome 1 of A.thaliana, a small flowering plants used as a model organism in studies of biology and genetics, on the basis of a recent mathematical model of the genetic code. I analyze and compare different portions of the genome: genes, exons, coding sequences (CDS), introns, long introns, intergenes, untranslated regions (UTR) and regulatory sequences. In order to accomplish the task, I transformed nucleotide sequences into binary sequences based on the definition of the three different dichotomic classes. The descriptive analysis of binary strings indicate the presence of regularities in each portion of the genome considered. In particular, there are remarkable differences between coding sequences (CDS and exons) and non-coding sequences, suggesting that the frame is important only for coding sequences and that dichotomic classes can be useful to recognize them. Then, I assessed the existence of short-range dependence between binary sequences computed on the basis of the different dichotomic classes. I used three different measures of dependence: the well-known chi-squared test and two indices derived from the concept of entropy i.e. Mutual Information (MI) and Sρ, a normalized version of the “Bhattacharya Hellinger Matusita distance”. The results show that there is a significant short-range dependence structure only for the coding sequences whose existence is a clue of an underlying error detection and correction mechanism. No doubt, further studies are needed in order to assess how the information carried by dichotomic classes could discriminate between coding and noncoding sequence and, therefore, contribute to unveil the role of the mathematical structure in error detection and correction mechanisms. Still, I have shown the potential of the approach presented for understanding the management of genetic information.

Cyclic nucleotide specific phosphodiesterases of Leishmania major

Background Leishmania represent a complex of important human pathogens that belong to the systematic order of the kinetoplastida. They are transmitted between their human and mammalian hosts by different bloodsucking sandfly vectors. In their hosts, the Leishmania undergo several differentiation steps, and their coordination and optimization crucially depend on numerous interactions between the parasites and the physiological environment presented by the fly and human hosts. Little is still known about the signalling networks involved in these functions. In an attempt to better understand the role of cyclic nucleotide signalling in Leishmania differentiation and host-parasite interaction, we here present an initial study on the cyclic nucleotide-specific phosphodiesterases of Leishmania major. Results This paper presents the identification of three class I cyclic-nucleotide-specific phosphodiesterases (PDEs) from L. major, PDEs whose catalytic domains exhibit considerable sequence conservation with, among other, all eleven human PDE families. In contrast to other protozoa such as Dictyostelium, or fungi such as Saccharomyces cerevisiae, Candida ssp or Neurospora, no genes for class II PDEs were found in the Leishmania genomes. LmjPDEA contains a class I catalytic domain at the C-terminus of the polypeptide, with no other discernible functional domains elsewhere. LmjPDEB1 and LmjPDEB2 are coded for by closely related, tandemly linked genes on chromosome 15. Both PDEs contain two GAF domains in their N-terminal region, and their almost identical catalytic domains are located at the C-terminus of the polypeptide. LmjPDEA, LmjPDEB1 and LmjPDEB2 were further characterized by functional complementation in a PDE-deficient S. cerevisiae strain. All three enzymes conferred complementation, demonstrating that all three can hydrolyze cAMP. Recombinant LmjPDEB1 and LmjPDEB2 were shown to be cAMP-specific, with Km values in the low micromolar range. Several PDE inhibitors were found to be active against these PDEs in vitro, and to inhibit cell proliferation. Conclusion The genome of L. major contains only PDE genes that are predicted to code for class I PDEs, and none for class II PDEs. This is more similar to what is found in higher eukaryotes than it is to the situation in Dictyostelium or the fungi that concomitantly express class I and class II PDEs. Functional complementation demonstrated that LmjPDEA, LmjPDEB1 and LmjPDEB2 are capable of hydrolyzing cAMP. In vitro studies with recombinant LmjPDEB1 and LmjPDEB2 confirmed this, and they demonstrated that both are completely cAMP-specific. Both enzymes are inhibited by several commercially available PDE inhibitors. The observation that these inhibitors also interfere with cell growth in culture indicates that inhibition of the PDEs is fatal for the cell, suggesting an important role of cAMP signalling for the maintenance of cellular integrity and proliferation.

Compressed sensing based cyclic feature spectrum sensing for cognitive radios

Spectrum sensing is currently one of the most challenging design problems in cognitive radio. A robust spectrum sensing technique is important in allowing implementation of a practical dynamic spectrum access in noisy and interference uncertain environments. In addition, it is desired to minimize the sensing time, while meeting the stringent cognitive radio application requirements. To cope with this challenge, cyclic spectrum sensing techniques have been proposed. However, such techniques require very high sampling rates in the wideband regime and thus are costly in hardware implementation and power consumption. In this thesis the concept of compressed sensing is applied to circumvent this problem by utilizing the sparsity of the two-dimensional cyclic spectrum. Compressive sampling is used to reduce the sampling rate and a recovery method is developed for re- constructing the sparse cyclic spectrum from the compressed samples. The reconstruction solution used, exploits the sparsity structure in the two-dimensional cyclic spectrum do-main which is different from conventional compressed sensing techniques for vector-form sparse signals. The entire wideband cyclic spectrum is reconstructed from sub-Nyquist-rate samples for simultaneous detection of multiple signal sources. After the cyclic spectrum recovery two methods are proposed to make spectral occupancy decisions from the recovered cyclic spectrum: a band-by-band multi-cycle detector which works for all modulation schemes, and a fast and simple thresholding method that works for Binary Phase Shift Keying (BPSK) signals only. In addition a method for recovering the power spectrum of stationary signals is developed as a special case. Simulation results demonstrate that the proposed spectrum sensing algorithms can significantly reduce sampling rate without sacrifcing performance. The robustness of the algorithms to the noise uncertainty of the wireless channel is also shown.