Flat tori, lattices and bounds for commutative group codes

We show that commutative group spherical codes in R(n), as introduced by D. Slepian, are directly related to flat tori and quotients of lattices. As consequence of this view, we derive new results on the geometry of these codes and an upper bound for their cardinality in terms of minimum distance and the maximum center density of lattices and general spherical packings in the half dimension of the code. This bound is tight in the sense it can be arbitrarily approached in any dimension. Examples of this approach and a comparison of this bound with Union and Rankin bounds for general spherical codes is also presented.

Robust integration of real time optimization with linear model predictive control

Here, we study the stable integration of real time optimization (RTO) with model predictive control (MPC) in a three layer structure. The intermediate layer is a quadratic programming whose objective is to compute reachable targets to the MPC layer that lie at the minimum distance to the optimum set points that are produced by the RTO layer. The lower layer is an infinite horizon MPC with guaranteed stability with additional constraints that force the feasibility and convergence of the target calculation layer. It is also considered the case in which there is polytopic uncertainty in the steady state model considered in the target calculation. The dynamic part of the MPC model is also considered unknown but it is assumed to be represented by one of the models of a discrete set of models. The efficiency of the methods presented here is illustrated with the simulation of a low order system. (C) 2010 Elsevier Ltd. All rights reserved.

Spatial genetic structure of Hymenaea stigonocarpa Mart. ex Hayne assessed with chloroplast microsatellite markers

The use of chloroplast DNA markers (cpDNA) helps to elucidate questions related to ecology, evolution and genetic structure. The knowledge of inter-and intra-population genetic structure allows to design effective conservation and management strategies for tropical tree species. With the aim to help the conservation of Hymenaea stigonocarpa of the Cerrado (Brazilian savanna) in Sao Paulo State, an analysis of the spatial genetic structure (SGS) was conducted in two populations using five universal chloroplast microsatellite loci (cpSSR). The population of 68 trees of H. stigonocarpa in the Ecological Station of Itirapina (ESI) had a single haplotype, indicating a strong founder effect. In turn, the population of 47 trees of H. stigonocarpa in a contiguous area that includes the Ecological Station of Assis and the Assis State Forest (ESA), showed six haplotypes ((n) over cap (h) = 6) with a moderate haplotype diversity ((h) over cap = 0667 + 0094), revealing that it was founded by a small number of maternal lineages. The SGS analysis for the population ESA/ASF, using Moran`s I index, indicated limited seed dispersal. Considering SGS, for ex situ conservation strategies in the population ESA/ASF, seed harvesting should require a minimum distance of 750 m among seed-trees.

Movements of feral camels in central Australia determined by satellite telemetry

Movements of two female one-humped camels in central Australia were tracked using satellite telemetry between March 1986 and July 1987. During that time both animals travelled a minimum distance of over 1000 km within a radius of 125 km for one animal, and 200 km for the other. However, their movements were uite punctuated and both animals spent periods of up to several months in rleatively small areas before moving over longer distances to new areas. Both camels moved at greater rates overnight. An activity index, probably measuring feeding rate, declined during the study period for both animals. Patchy and sporadic rainfall may explain some of these results.

Unveiling the Biometric Potential of Finger-Based ECG Signals

The ECG signal has been shown to contain relevant information for human identification. Even though results validate the potential of these signals, data acquisition methods and apparatus explored so far compromise user acceptability, requiring the acquisition of ECG at the chest. In this paper, we propose a finger-based ECG biometric system, that uses signals collected at the fingers, through a minimally intrusive 1-lead ECG setup recurring to Ag/AgCl electrodes without gel as interface with the skin. The collected signal is significantly more noisy than the ECG acquired at the chest, motivating the application of feature extraction and signal processing techniques to the problem. Time domain ECG signal processing is performed, which comprises the usual steps of filtering, peak detection, heartbeat waveform segmentation, and amplitude normalization, plus an additional step of time normalization. Through a simple minimum distance criterion between the test patterns and the enrollment database, results have revealed this to be a promising technique for biometric applications.

Rapid assessment of fruit-color selection by birds using artificial fruits at local scale in Central Amazonia

Modeling clays have been used in several ecological experiments and have proved to be an important tool to variables control. The objective of our study was to determine if fruit color in isolated and grouped displays influences the fruit selection by birds in the field using artificial fruits. Data were collected in six plots distributed homogeneously in 3 km long trails with a minimum distance of 0.5 km. We used a paired experimental design to establish our experiments, so that all treatments were available to the local bird community in each plot. Overall, red was more pecked than brown and white. Isolated red and brown displays were significantly more pecked than others display. Even though our study was conducted in small spatial scales, artificial fruits appeared to be efficient in register fruit consumption attempts by bird. Although inconclusive about selective forces that sharp the dynamics of fruit color polymorphisms and choice by frugivorous birds, our findings corroborate recent studies wherein birds showed preferences by high- over low-contrast fruit signals.

Alpine and pre-Alpine magmatism in the root-zone of the western Central Alps

The highest grade of metamorphism and associated structural elements in orogenic belts may be inherited from earlier orogenic events. We illustrate this point using magmatic and metamorphic rocks from the southern steep belt of the Lepontine Gneiss Dome (Central Alps). The U-Pb zircon ages from an anatectic granite at Verampio and migmatites at Corcapolo and Lavertezzo yield 280-290 Ma, i.e., Hercynian ages. These ages indicate that the highest grade of metamorphism in several crystalline nappes of the Lepontine Gneiss Dome is pre-Alpine. Alpine metamorphism reached sufficiently high grade to reset the Rb-Sr and K-Ar systematics of mica and amphibole, but generally did not result in crustal melting, except in the steep belt to the north of the Insubric Line, where numerous 29 to 26 Ma old pegmatites and aplites had intruded syn- and post-kinematically into gneisses of the ductile Simplon Shear Zone. The emplacement age of these pegmatites gives a minimum estimate for the age of the Alpine metamorphic peak in the Monte Rosa nappe. The U-Pb titanite ages of 33 to 31 Ma from felsic porphyritic veins represent a minimum-age estimate for Alpine metamorphism in the Sesia Zone. A porphyric vein emplaced at 448 +/- 5 Ma (U-Pb monazite) demonstrates that there existed a consolidated Caledonian basement in the Sesia Zone.

On Distributed Storage Codes

Distributed storage systems are studied. The interest in such system has become relatively wide due to the increasing amount of information needed to be stored in data centers or different kinds of cloud systems. There are many kinds of solutions for storing the information into distributed devices regarding the needs of the system designer. This thesis studies the questions of designing such storage systems and also fundamental limits of such systems. Namely, the subjects of interest of this thesis include heterogeneous distributed storage systems, distributed storage systems with the exact repair property, and locally repairable codes. For distributed storage systems with either functional or exact repair, capacity results are proved. In the case of locally repairable codes, the minimum distance is studied. Constructions for exact-repairing codes between minimum bandwidth regeneration (MBR) and minimum storage regeneration (MSR) points are given. These codes exceed the time-sharing line of the extremal points in many cases. Other properties of exact-regenerating codes are also studied. For the heterogeneous setup, the main result is that the capacity of such systems is always smaller than or equal to the capacity of a homogeneous system with symmetric repair with average node size and average repair bandwidth. A randomized construction for a locally repairable code with good minimum distance is given. It is shown that a random linear code of certain natural type has a good minimum distance with high probability. Other properties of locally repairable codes are also studied.

Bounds on edit metric codes with combinatorial DNA constraints

The design of a large and reliable DNA codeword library is a key problem in DNA based computing. DNA codes, namely sets of fixed length edit metric codewords over the alphabet {A, C, G, T}, satisfy certain combinatorial constraints with respect to biological and chemical restrictions of DNA strands. The primary constraints that we consider are the reverse--complement constraint and the fixed GC--content constraint, as well as the basic edit distance constraint between codewords. We focus on exploring the theory underlying DNA codes and discuss several approaches to searching for optimal DNA codes. We use Conway's lexicode algorithm and an exhaustive search algorithm to produce provably optimal DNA codes for codes with small parameter values. And a genetic algorithm is proposed to search for some sub--optimal DNA codes with relatively large parameter values, where we can consider their sizes as reasonable lower bounds of DNA codes. Furthermore, we provide tables of bounds on sizes of DNA codes with length from 1 to 9 and minimum distance from 1 to 9.

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.

A Sub-block Based Image Retrieval Using Modified Integrated Region Matching.

This paper proposes a content based image retrieval (CBIR) system using the local colour and texture features of selected image sub-blocks and global colour and shape features of the image. The image sub-blocks are roughly identified by segmenting the image into partitions of different configuration, finding the edge density in each partition using edge thresholding, morphological dilation. The colour and texture features of the identified regions are computed from the histograms of the quantized HSV colour space and Gray Level Co- occurrence Matrix (GLCM) respectively. A combined colour and texture feature vector is computed for each region. The shape features are computed from the Edge Histogram Descriptor (EHD). A modified Integrated Region Matching (IRM) algorithm is used for finding the minimum distance between the sub-blocks of the query and target image. Experimental results show that the proposed method provides better retrieving result than retrieval using some of the existing methods

Simultaneous Embeddings Of Graphs As Median And Antimedian Subgraphs

The distance DG(v) of a vertex v in an undirected graph G is the sum of the distances between v and all other vertices of G. The set of vertices in G with maximum (minimum) distance is the antimedian (median) set of a graph G. It is proved that for arbitrary graphs G and J and a positive integer r 2, there exists a connected graph H such that G is the antimedian and J the median subgraphs of H, respectively, and that dH(G, J) = r. When both G and J are connected, G and J can in addition be made convex subgraphs of H.

Content Based Video Retrieval using SURF Descriptor

This paper presents a Robust Content Based Video Retrieval (CBVR) system. This system retrieves similar videos based on a local feature descriptor called SURF (Speeded Up Robust Feature). The higher dimensionality of SURF like feature descriptors causes huge storage consumption during indexing of video information. To achieve a dimensionality reduction on the SURF feature descriptor, this system employs a stochastic dimensionality reduction method and thus provides a model data for the videos. On retrieval, the model data of the test clip is classified to its similar videos using a minimum distance classifier. The performance of this system is evaluated using two different minimum distance classifiers during the retrieval stage. The experimental analyses performed on the system shows that the system has a retrieval performance of 78%. This system also analyses the performance efficiency of the low dimensional SURF descriptor.

Evaluation of the use of high-density SNP genotyping to implement UPOV Model 2 for DUS testing in barley

Developments in high-throughput genotyping provide an opportunity to explore the application of marker technology in distinctness, uniformity and stability (DUS) testing of new varieties. We have used a large set of molecular markers to assess the feasibility of a UPOV Model 2 approach: “Calibration of threshold levels for molecular characteristics against the minimum distance in traditional characteristics”. We have examined 431 winter and spring barley varieties, with data from UK DUS trials comprising 28 characteristics, together with genotype data from 3072 SNP markers. Inter varietal distances were calculated and we found higher correlations between molecular and morphological distances than have been previously reported. When varieties were grouped by kinship, phenotypic and genotypic distances of these groups correlated well. We estimated the minimum marker numbers required and showed there was a ceiling after which the correlations do not improve. To investigate the possibility of breaking through this ceiling, we attempted genomic prediction of phenotypes from genotypes and higher correlations were achieved. We tested distinctness decisions made using either morphological or genotypic distances and found poor correspondence between each method.

Classificação de imagens de ambientes coralinos: uma abordagem empregando uma combinação de classificadores e máquina de vetor de suporte

The use of the maps obtained from remote sensing orbital images submitted to digital processing became fundamental to optimize conservation and monitoring actions of the coral reefs. However, the accuracy reached in the mapping of submerged areas is limited by variation of the water column that degrades the signal received by the orbital sensor and introduces errors in the final result of the classification. The limited capacity of the traditional methods based on conventional statistical techniques to solve the problems related to the inter-classes took the search of alternative strategies in the area of the Computational Intelligence. In this work an ensemble classifiers was built based on the combination of Support Vector Machines and Minimum Distance Classifier with the objective of classifying remotely sensed images of coral reefs ecosystem. The system is composed by three stages, through which the progressive refinement of the classification process happens. The patterns that received an ambiguous classification in a certain stage of the process were revalued in the subsequent stage. The prediction non ambiguous for all the data happened through the reduction or elimination of the false positive. The images were classified into five bottom-types: deep water; under-water corals; inter-tidal corals; algal and sandy bottom. The highest overall accuracy (89%) was obtained from SVM with polynomial kernel. The accuracy of the classified image was compared through the use of error matrix to the results obtained by the application of other classification methods based on a single classifier (neural network and the k-means algorithm). In the final, the comparison of results achieved demonstrated the potential of the ensemble classifiers as a tool of classification of images from submerged areas subject to the noise caused by atmospheric effects and the water column