Permutation tests for nonparametric detection

In this paper, the authors provide a methodology to design nonparametric permutation tests and, in particular, nonparametric rank tests for applications in detection. In the first part of the paper, the authors develop the optimization theory of both permutation and rank tests in the Neyman?Pearson sense; in the second part of the paper, they carry out a comparative performance analysis of the permutation and rank tests (detectors) against the parametric ones in radar applications. First, a brief review of some contributions on nonparametric tests is realized. Then, the optimum permutation and rank tests are derived. Finally, a performance analysis is realized by Monte-Carlo simulations for the corresponding detectors, and the results are shown in curves of detection probability versus signal-to-noise ratio

Tunable Fano resonance in symmetric multilayered gold nanoshells

Fano resonances (FRs) are produced when a discrete state is coupled with a continuum. In addition to fundamental scientific interests, FRs in plasmonic systems give rise to the so-called plasmon-induced transparency. In this work we have studied the evolution of dipole-dipole all-plasmonic FRs in symmetric multilayered nanoshells as the function of their geometrical parameters. We demonstrate that symmetry breaking is not mandatory for controlling the Fano resonance in such multilayered nanoshells. Generation of FRs in these symmetric nanostructures presents clear advantages over their asymmetric counterparts, as they are easier to fabricate and can be used in a wider range of technological applications.

Design of spherical symmetric gradient index lenses

Spherical symmetric refractive index distributions also known as Gradient Index lenses such as the Maxwell-Fish-Eye (MFE), the Luneburg or the Eaton lenses have always played an important role in Optics. The recent development of the technique called Transformation Optics has renewed the interest in these gradient index lenses. For instance, Perfect Imaging within the Wave Optics framework has recently been proved using the MFE distribution. We review here the design problem of these lenses, classify them in two groups (Luneburg moveable-limits and fixed-limits type), and establish a new design techniques for each type of problem.

Tunable Fano resonance in symmetric multilayered gold nanoshells

We have studied the evolution of dipole–dipole all-plasmonic Fano resonances (FRs) in symmetric multilayered nanoshells as a function of their geometrical parameters. We demonstrate that symmetry breaking is not mandatory for controlling the Fano resonance in such multilayer structures. By carefully selecting the geometrical parameters, the position of the FR can be tuned between 600 and 950 nm and its intensity can be increased up to four fold with respect to the non-optimized structures. Generation of FRs in such symmetric nanostructures presents clear advantages over their asymmetric counterparts, as they are easier to fabricate and can be used in a wider range of technological applications.

Generation of Fission Yield covariance data and application to Fission Pulse Decay Heat calculations

Generation of Fission Yield covariance data and application to Fission Pulse Decay Heat calculations

Variance and covariance of actual relationship between relatives at one locus.

The relationship between pairs of individuals is an important topic in many areas of population and quantitative genetics. It is usually measured as the proportion of thegenome identical by descent shared by the pair and it can be inferred from pedigree information. But there is a variance in actual relationships as a consequence of Mendelian sampling, whose general formula has not been developed. The goal of this work is to develop this general formula for the one-locus situation,. We provide simple expressions for the variances and covariances of all actual relationships in an arbitrary complex pedigree. The proposed method relies on the use of the nine identity coefficients and the generalized relationship coefficients; formulas have been checked by computer simulation. Finally two examples for a short pedigree of dogs and a long pedigree of sheep are given.

Automatic design of Ant Colony Optimization for permutation problems

In this study, we present a framework based on ant colony optimization (ACO) for tackling combinatorial problems. ACO algorithms have been applied to many diferent problems, focusing on algorithmic variants that obtain high-quality solutions. Usually, the implementations are re-done for various problem even if they maintain the same details of the ACO algorithm. However, our goal is to generate a sustainable framework for applications on permutation problems. We concentrate on understanding the behavior of pheromone trails and specific methods that can be combined. Eventually, we will propose an automatic offline configuration tool to build an efective algorithm. ---RESUMEN---En este trabajo vamos a presentar un framework basado en la familia de algoritmos ant colony optimization (ACO), los cuales están dise~nados para enfrentarse a problemas combinacionales. Los algoritmos ACO han sido aplicados a diversos problemas, centrándose los investigadores en diversas variantes que obtienen buenas soluciones. Normalmente, las implementaciones se tienen que rehacer, inclusos si se mantienen los mismos detalles para los algoritmos ACO. Sin embargo, nuestro objetivo es generar un framework sostenible para aplicaciones sobre problemas de permutaciones. Nos centraremos en comprender el comportamiento de la sendas de feromonas y ciertos métodos con los que pueden ser combinados. Finalmente, propondremos una herramienta para la configuraron automática offline para construir algoritmos eficientes.

Preliminary design of symmetric arch-gravity dams

In this paper, a set of design parameters, such as the slopes of upstream and downstream faces of the dam, radius of the upper arch, width of the dam at the top level and height of the vertical upper part of the dam, are given as function of the valley characteristics when the dam is situated, such as its geometry and its geotechnical properties. These tables have been obtained using a regression of the design parameters of an arch-gravity dam with a minimum concrete volume, placed in a large number of valleys with different characteristics and properties. Elasticites for these design parameters are also discussed.

Inelastic torsional seismic response of nominally symmetric reinforced concrete frame structures: shaking table tests

This paper discusses the torsional response of a scaled reinforced concrete frame structure subjected to several uniaxial shaking table tests. The tested structure is nominally symmetric in the direction of shaking and exhibits torsion attributable to non-uniform yielding of structural components and uncertainties in the building process. Asymmetric behavior is analyzed in terms of displacement, strain in reinforcing bars, energy dissipated at plastic hinges, and damage at section and frame levels. The results show that for low levels of seismic hazard, for which the structure is expected to perform basically within the elastic range, the accidental eccentricity is not a concern for the health of the structure, but it significantly increases the lateral displacement demand in the frames (about 30%) and this might cause significant damage to non-structural components. For high levels of seismic hazard the effects of accidental torsion become less important. These results underline the need to consider accidental eccentricity in evaluating the performance of a structure for very frequent or frequent earthquakes, and suggest that consideration of torsion may be neglected for performance levels associated with rare or very rare earthquakes.

Analyzing size-symmetric vs. size-asymmetric and intra-vs. inter-specific competition in beech (Fagus sylvatica L.) mixed stands

In mixed stands, inter-specific competition can be lower than intra-specific competition when niche complementarity and/or facilitation between species prevail. These positive interactions can take place at belowground and/or aboveground levels. Belowground competition tends to be size symmetric while the aboveground competition is usually for light and almost always size-asymmetric. Interactions between forest tree species can be explored analyzing growth at tree level by comparing intra and inter-specific competition. At the same time, possible causes of niche complementarity can be inferred relating intra and inter-specific competition with the mode of competition, i.e. size-symmetric or sizeasymmetric. The aim of this paper is to further our understanding of the interactions between species and to detect possible causes of competition reduction in mixed stands of beech (Fagus sylvatica L.) with other species: pine?beech, oak?beech and fir?beech. To test whether species growth is better explained by size-symmetric and/or size-asymmetric competition, five different competition structures where included in basal area growth models fitted using data from the Spanish National Forest Inventory for the Pyrenees. These models considered either size-symmetry only (Reineke?s stand density index, SDI), size-asymmetry only (SDI of large trees or SDI of small trees), or both combined. In order to assess the influence of the admixture, these indices were introduced in two different ways, one of which was to consider that trees of all species compete in a similar way, and the other was to split the stand density indices into intra- and inter-specific competition components. The results showed that in pine?beech mixtures, there is a slightly negative effect of beech on pine basal area growth while beech benefitted from the admixture of Scots pine; this positive effect being greater as the proportion of pine trees in larger size classes increases. In oak?beech mixtures, beech growth was also positively influenced by the presence of oaks that were larger than the beech trees. The growth of oak, however, decreased when the proportion of beech in SDI increased, although the presence of beech in larger size classes promoted oak growth. Finally, in fir?beech mixtures, neither fir nor beech basal area growth were influenced by the presence of the other species. The results indicate that size-asymmetric is stronger than size-symmetric competition in these mixtures, highlighting the importance of light in competition. Positive species interactions in size-asymmetric competition involved a reduction of asymmetry in tree size-growth relationships.

Evolutionary computation of forests with Degree- and Role-Constrained Minimum Spanning Trees

Finding the degree-constrained minimum spanning tree (DCMST) of a graph is a widely studied NP-hard problem. One of its most important applications is network design. Here we deal with a new variant of the DCMST problem, which consists of finding not only the degree- but also the role-constrained minimum spanning tree (DRCMST), i.e., we add constraints to restrict the role of the nodes in the tree to root, intermediate or leaf node. Furthermore, we do not limit the number of root nodes to one, thereby, generally, building a forest of DRCMSTs. The modeling of network design problems can benefit from the possibility of generating more than one tree and determining the role of the nodes in the network. We propose a novel permutation-based representation to encode these forests. In this new representation, one permutation simultaneously encodes all the trees to be built. We simulate a wide variety of DRCMST problems which we optimize using eight different evolutionary computation algorithms encoding individuals of the population using the proposed representation. The algorithms we use are: estimation of distribution algorithm, generational genetic algorithm, steady-state genetic algorithm, covariance matrix adaptation evolution strategy, differential evolution, elitist evolution strategy, non-elitist evolution strategy and particle swarm optimization. The best results are for the estimation of distribution algorithms and both types of genetic algorithms, although the genetic algorithms are significantly faster.

Computación evolutiva de bosques de expansión mínimos con restricción de grado y de rol

Encontrar el árbol de expansión mínimo con restricción de grado de un grafo (DCMST por sus siglas en inglés) es un problema NP-complejo ampliamente estudiado. Una de sus aplicaciones más importantes es el dise~no de redes. Aquí nosotros tratamos una nueva variante del problema DCMST, que consiste en encontrar el árbol de expansión mínimo no solo con restricciones de grado, sino también con restricciones de rol (DRCMST), es decir, a~nadimos restricciones para restringir el rol que los nodos tienen en el árbol. Estos roles pueden ser nodo raíz, nodo intermedio o nodo hoja. Por otra parte, no limitamos el número de nodos raíz a uno, por lo que, en general, construiremos bosques de DRCMSTs. El modelado en los problemas de dise~no de redes puede beneficiarse de la posibilidad de generar más de un árbol y determinar el rol de los nodos en la red. Proponemos una nueva representación basada en permutaciones para codificar los bosques de DRCMSTs. En esta nueva representación, una permutación codifica simultáneamente todos los árboles que se construirán. Nosotros simulamos una amplia variedad de problemas DRCMST que optimizamos utilizando ocho algoritmos de computación evolutiva diferentes que codifican los individuos de la población utilizando la representación propuesta. Los algoritmos que utilizamos son: algoritmo de estimación de distribuciones (EDA), algoritmo genético generacional (gGA), algoritmo genético de estado estacionario (ssGA), estrategia evolutiva basada en la matriz de covarianzas (CMAES), evolución diferencial (DE), estrategia evolutiva elitista (ElitistES), estrategia evolutiva no elitista (NonElitistES) y optimización por enjambre de partículas (PSO). Los mejores resultados fueron para el algoritmo de estimación de distribuciones utilizado y ambos tipos de algoritmos genéticos, aunque los algoritmos genéticos fueron significativamente más rápidos.---ABSTRACT---Finding the degree-constrained minimum spanning tree (DCMST) of a graph is a widely studied NP-hard problem. One of its most important applications is network design. Here we deal with a new variant of the DCMST problem, which consists of finding not only the degree- but also the role-constrained minimum spanning tree (DRCMST), i.e., we add constraints to restrict the role of the nodes in the tree to root, intermediate or leaf node. Furthermore, we do not limit the number of root nodes to one, thereby, generally, building a forest of DRCMSTs. The modeling of network design problems can benefit from the possibility of generating more than one tree and determining the role of the nodes in the network. We propose a novel permutation-based representation to encode the forest of DRCMSTs. In this new representation, one permutation simultaneously encodes all the trees to be built. We simulate a wide variety of DRCMST problems which we optimize using eight diferent evolutionary computation algorithms encoding individuals of the population using the proposed representation. The algorithms we use are: estimation of distribution algorithm (EDA), generational genetic algorithm (gGA), steady-state genetic algorithm (ssGA), covariance matrix adaptation evolution strategy (CMAES), diferential evolution (DE), elitist evolution strategy (ElististES), non-elitist evolution strategy (NonElististES) and particle swarm optimization (PSO). The best results are for the estimation of distribution algorithm and both types of genetic algorithms, although the genetic algorithms are significantly faster. iv

Vector Boolean Functions: Applications in Symmetric Cryptography

Esta tesis establece los fundamentos teóricos y diseña una colección abierta de clases C++ denominada VBF (Vector Boolean Functions) para analizar funciones booleanas vectoriales (funciones que asocian un vector booleano a otro vector booleano) desde una perspectiva criptográfica. Esta nueva implementación emplea la librería NTL de Victor Shoup, incorporando nuevos módulos que complementan a las funciones de NTL, adecuándolas para el análisis criptográfico. La clase fundamental que representa una función booleana vectorial se puede inicializar de manera muy flexible mediante diferentes estructuras de datas tales como la Tabla de verdad, la Representación de traza y la Forma algebraica normal entre otras. De esta manera VBF permite evaluar los criterios criptográficos más relevantes de los algoritmos de cifra en bloque y de stream, así como funciones hash: por ejemplo, proporciona la no-linealidad, la distancia lineal, el grado algebraico, las estructuras lineales, la distribución de frecuencias de los valores absolutos del espectro Walsh o del espectro de autocorrelación, entre otros criterios. Adicionalmente, VBF puede llevar a cabo operaciones entre funciones booleanas vectoriales tales como la comprobación de igualdad, la composición, la inversión, la suma, la suma directa, el bricklayering (aplicación paralela de funciones booleanas vectoriales como la empleada en el algoritmo de cifra Rijndael), y la adición de funciones coordenada. La tesis también muestra el empleo de la librería VBF en dos aplicaciones prácticas. Por un lado, se han analizado las características más relevantes de los sistemas de cifra en bloque. Por otro lado, combinando VBF con algoritmos de optimización, se han diseñado funciones booleanas cuyas propiedades criptográficas son las mejores conocidas hasta la fecha. ABSTRACT This thesis develops the theoretical foundations and designs an open collection of C++ classes, called VBF, designed for analyzing vector Boolean functions (functions that map a Boolean vector to another Boolean vector) from a cryptographic perspective. This new implementation uses the NTL library from Victor Shoup, adding new modules which complement the existing ones making VBF better suited for cryptography. The fundamental class representing a vector Boolean function can be initialized in a flexible way via several alternative types of data structures such as Truth Table, Trace Representation, Algebraic Normal Form (ANF) among others. This way, VBF allows the evaluation of the most relevant cryptographic criteria for block and stream ciphers as well as for hash functions: for instance, it provides the nonlinearity, the linearity distance, the algebraic degree, the linear structures, the frequency distribution of the absolute values of the Walsh Spectrum or the Autocorrelation Spectrum, among others. In addition, VBF can perform operations such as equality testing, composition, inversion, sum, direct sum, bricklayering (parallel application of vector Boolean functions as employed in Rijndael cipher), and adding coordinate functions of two vector Boolean functions. This thesis also illustrates the use of VBF in two practical applications. On the one hand, the most relevant properties of the existing block ciphers have been analysed. On the other hand, by combining VBF with optimization algorithms, new Boolean functions have been designed which have the best known cryptographic properties up-to-date.

Estimation of Symmetric Channels for Discrete Cosine Transform Type-I Multicarrier Systems: A Compressed Sensing Approach

The problem of channel estimation for multicarrier communications is addressed. We focus on systems employing the Discrete Cosine Transform Type-I (DCT1) even at both the transmitter and the receiver, presenting an algorithm which achieves an accurate estimation of symmetric channel filters using only a small number of training symbols. The solution is obtained by using either matrix inversion or compressed sensing algorithms. We provide the theoretical results which guarantee the validity of the proposed technique for the DCT1. Numerical simulations illustrate the good behaviour of the proposed algorithm.