248 research outputs found
Towards a deeper understanding of APN functions and related longstanding problems
This dissertation is dedicated to the properties, construction and analysis of APN and AB functions. Being cryptographically optimal, these functions lack any general structure or patterns, which makes their study very challenging. Despite intense work since at least the early 90's, many important questions and conjectures in the area remain open. We present several new results, many of which are directly related to important longstanding open problems; we resolve some of these problems, and make significant progress towards the resolution of others.
More concretely, our research concerns the following open problems: i) the maximum algebraic degree of an APN function, and the Hamming distance between APN functions (open since 1998); ii) the classification of APN and AB functions up to CCZ-equivalence (an ongoing problem since the introduction of APN functions, and one of the main directions of research in the area); iii) the extension of the APN binomial over into an infinite family (open since 2006); iv) the Walsh spectrum of the Dobbertin function (open since 2001); v) the existence of monomial APN functions CCZ-inequivalent to ones from the known families (open since 2001); vi) the problem of efficiently and reliably testing EA- and CCZ-equivalence (ongoing, and open since the introduction of APN functions).
In the course of investigating these problems, we obtain i.a. the following results: 1) a new infinite family of APN quadrinomials (which includes the binomial over ); 2) two new invariants, one under EA-equivalence, and one under CCZ-equivalence; 3) an efficient and easily parallelizable algorithm for computationally testing EA-equivalence; 4) an efficiently computable lower bound on the Hamming distance between a given APN function and any other APN function; 5) a classification of all quadratic APN polynomials with binary coefficients over for ; 6) a construction allowing the CCZ-equivalence class of one monomial APN function to be obtained from that of another; 7) a conjecture giving the exact form of the Walsh spectrum of the Dobbertin power functions; 8) a generalization of an infinite family of APN functions to a family of functions with a two-valued differential spectrum, and an example showing that this Gold-like behavior does not occur for infinite families of quadratic APN functions in general; 9) a new class of functions (the so-called partially APN functions) defined by relaxing the definition of the APN property, and several constructions and non-existence results related to them.Doktorgradsavhandlin
International Conference on Continuous Optimization (ICCOPT) 2019 Conference Book
The Sixth International Conference on Continuous Optimization took place on the campus of the Technical University of Berlin, August 3-8, 2019. The ICCOPT is a flagship conference of the Mathematical Optimization Society (MOS), organized every three years. ICCOPT 2019 was hosted by the Weierstrass Institute for Applied Analysis and Stochastics (WIAS) Berlin. It included a Summer School and a Conference with a series of plenary and semi-plenary talks, organized and contributed sessions, and poster sessions.
This book comprises the full conference program. It contains, in particular, the scientific program in survey style as well as with all details, and information on the social program, the venue, special meetings, and more
Multiscale numerical methods for the simulation of diffusion processes in random heterogeneous media with guaranteed accuracy
The possibility of combining several constituents to obtain properties that cannot be
obtained with any of them alone, explains the growing proliferation of composites in mechanical
structures. However, the modelling of such heterogeneous systems poses extreme
challenges to computational mechanics. The direct simulation of the aforementioned gives
rise to computational models that are extremely expensive if not impossible to solve.
Through homogenisation, the excessive computational burden is eliminated by separating
the two scales (the scale of the constituents and the scale of the structure). Nonetheless,
the hypotheses under which homogenisation applies are usually violated. Traditional
homogenisation schemes provide no means to quantify this error.
The �rst contribution of this thesis is the development of a method to quantify the homogenisation
error. In this method, the heterogeneous medium is represented by a stochastic
partial di�erential equation where each realisation corresponds to a particle layout. This
representation allows us to derive guaranteed error estimates with a low computational cost.
The e�ectivity (ratio between true error and estimate) is characterised and a relation is
established between the error estimates and classical results in micromechanics. Moreover,
a strategy to reduce the homogenisation error is presented.
The second contribution of this thesis is made by developing a numerical method with
guaranteed error bounds that directly approximates the solution of heterogeneous models
by using shape functions that incorporate information of the microscale. The construction
of those shape functions resembles the methods of computational homogenisation where
microscale boundary value problems are solved to obtain homogenised properties
Aircraft Trajectory Planning Considering Ensemble Forecasting of Thunderstorms
Mención Internacional en el título de doctorConvective weather poses a major threat that compromises the safe operation of
flights while inducing delay and cost. The aircraft trajectory planning problem under
thunderstorm evolution is addressed in this thesis, proposing two novel heuristic
approaches that incorporate uncertainties in the evolution of convective cells. In
this context, two additional challenges are faced. On the one hand, studies have
demonstrated that given the computational power available nowadays, the best
way to characterize weather uncertainties is through ensemble forecasting products,
hence compatibility with them is crucial. On the other hand, for the algorithms to be
used during a flight, they must be fast and deliver results in a few seconds.
As a first methodology, three variants of the Scenario-Based Rapidly-Exploring
Random Trees (SB-RRTs) are proposed. Each of them builds a tree to explore the
free airspace during an iterative and random process. The so-called SB-RRT, the
SB-RRT∗ and the Informed SB-RRT∗ find point-to-point safe trajectories by meeting
a user-defined safety threshold. Additionally, the last two techniques converge to
solutions of minimum flight length.
In a second instance, the Augmented Random Search (ARS) algorithm is used to
sample trajectories from a directed graph and deform them iteratively in the search
for an optimal path. The aim of such deformations is to adapt the initial graph to the
unsafe set and its possible changes. In the end, the ARS determines the population of
trajectories that, on average, minimizes a combination of flight time, time in storms,
and fuel consumption
Both methodologies are tested considering a dynamic model of an aircraft flying
between two waypoints at a constant flight level. Test scenarios consist of realistic
weather forecasts described by an ensemble of equiprobable members. Moreover,
the influence of relevant parameters, such as the maximum number of iterations,
safety margin (in SB-RRTs) or relative weights between objectives (in ARS) is analyzed.
Since both algorithms and their convergence processes are random, sensitivity
analyses are conducted to show that after enough iterations the results match.
Finally, through parallelization on graphical processing units, the required computational
times are reduced substantially to become compatible with near real-time
operation.
In either case, results show that the suggested approaches are able to avoid dangerous
and uncertain stormy regions, minimize objectives such as time of flight,
flown distance or fuel consumption and operate in less than 10 seconds.Los fenómenos convectivos representan una gran amenaza que compromete la seguridad
de los vuelos, a la vez que incrementa los retrasos y costes. En esta tesis
se aborda el problema de la planificación de vuelos bajo la influencia de tormentas,
proponiendo dos nuevos métodos heurísticos que incorporan incertidumbre en la
evolución de las células convectivas. En este contexto, se intentará dar respuesta a
dos desafíos adicionales. Por un lado, hay estudios que demuestran que, con los
recursos computacionales disponibles hoy en día, la mejor manera de caracterizar la
incertidumbre meteorológica es mediante productos de tipo “ensemble”. Por tanto,
la compatibilidad con ellos es crucial. Por otro lado, para poder emplear los algoritmos
durante el vuelo, deben de ser rápidos y obtener resultados en pocos segundos.
Como primera aproximación, se proponen tres variantes de los “Scenario-Based
Rapidly-Exploring Random Trees” (SB-RRTs). Cada uno de ellos crea un árbol que
explora el espacio seguro durante un proceso iterativo y aleatorio. Los denominados
SB-RRT, SB-RRT∗ e Informed SB-RRT∗ calculan trayectorias entre dos puntos
respetando un margen de seguridad impuesto por el usuario. Además, los dos últimos
métodos convergen en soluciones de mínima distancia de vuelo.
En segundo lugar, el algoritmo “Augmented Random Search” (ARS) se utiliza
para muestrear trajectorias de un grafo dirigido y deformarlas iterativamente en
busca del camino óptimo. El fin de tales deformaciones es adaptar el grafo inicial
a las zonas peligrosas y a los cambios que puedan sufrir. Finalmente, el ARS calcula
aquella población de trayectorias que, de media, minimiza una combinación
del tiempo de vuelo, el tiempo en zonas tormentosas y el consumo de combustible.
Ambas metodologías se testean considerando un modelo de avión volando punto
a punto a altitud constante. Los casos de prueba se basan en datos meteorológicos
realistas formados por un grupo de predicciones equiprobables. Además, se analiza
la influencia de los parámetros más importantes como el máximo número de iteraciones,
el margen de seguridad (en SB-RRTs) o los pesos relativos de cada objetivo
(en ARS). Como ambos algoritmos y sus procesos de convergencia son aleatorios, se
realizan análisis de sensibilidad para mostrar que, tras suficientes iteraciones, los resultados
coinciden. Por último, mediante técnicas de paralelización en procesadores
gráficos, se reducen enormemente los tiempos de cálculo, siendo compatibles con
una operación en tiempo casi-real.
En ambos casos los resultados muestran que los algoritmos son capaces de evitar
zonas inciertas de tormenta, minimizar objetivos como el tiempo de vuelo, la distancia
recorrida o el consumo de combustible, en menos de 10 segundos de ejecución.Programa de Doctorado en Ingeniería Aeroespacial por la Universidad Carlos III de MadridPresidente: Ernesto Staffetti Giammaria.- Secretario: Alfonso Valenzuela Romero.- Vocal: Valentin Polishchu
Recommended from our members
Proceedings of the Eleventh UK Conference on Boundary Integral Methods (UKBIM 11), 10-11 July 2017, Nottingham Conference Centre, Nottingham Trent University
This book contains the abstracts and papers presented at the Eleventh UK Conference on Boundary Integral Methods (UKBIM 11), held at Nottingham Trent University in July 2017. The work presented at the conference, and published in this volume, demonstrates the wide range of work that is being carried out in the UK, as well as from further afield
A systematic approach for integrated product, materials, and design-process design
Designers are challenged to manage customer, technology, and socio-economic uncertainty causing dynamic, unquenchable demands on limited resources. In this context, increased concept flexibility, referring to a designer s ability to generate concepts, is crucial. Concept flexibility can be significantly increased through the integrated design of product and material concepts. Hence, the challenge is to leverage knowledge of material structure-property relations that significantly affect system concepts for function-based, systematic design of product and materials concepts in an integrated fashion. However, having selected an integrated product and material system concept, managing complexity in embodiment design-processes is important. Facing a complex network of decisions and evolving analysis models a designer needs the flexibility to systematically generate and evaluate embodiment design-process alternatives. In order to address these challenges and respond to the primary research question of how to increase a designer s concept and design-process flexibility to enhance product creation in the conceptual and early embodiment design phases, the primary hypothesis in this dissertation is embodied as a systematic approach for integrated product, materials and design-process design. The systematic approach consists of two components i) a function-based, systematic approach to the integrated design of product and material concepts from a systems perspective, and ii) a systematic strategy to design-process generation and selection based on a decision-centric perspective and a value-of-information-based Process Performance Indicator. The systematic approach is validated using the validation-square approach that consists of theoretical and empirical validation. Empirical validation of the framework is carried out using various examples including: i) design of a reactive material containment system, and ii) design of an optoelectronic communication system.Ph.D.Committee Chair: Allen, Janet K.; Committee Member: Aidun, Cyrus K.; Committee Member: Klein, Benjamin; Committee Member: McDowell, David L.; Committee Member: Mistree, Farrokh; Committee Member: Yoder, Douglas P
- …