Framework for the Shape Optimization of Aerodynamic Profiles Using Genetic Algorithms

This study developed a framework for the shape optimization of aerodynamics profiles using computational fluid dynamics (CFD) and genetic algorithms. Agenetic algorithm code and a commercial CFD code were integrated to develop a CFD shape optimization tool. The results obtained demonstrated the effectiveness of the developed tool. The shape optimization of airfoils was studied using different strategies to demonstrate the capacity of this tool with different GA parameter combinations.

Avances en algoritmos de estimación de distribuciones. Alternativas en el aprendizaje y representación de problemas

131 p.: graf.

Design of an optimised wheel profile for rail vehicles operating on two track gauges

This paper sets out an optimum synthesis methodology for wheel profiles of railway vehicles in order to secure good dynamic behaviour with different track configurations. Specifically, the optimisation process has been applied to the case of rail wheelsets mounted on double gauge bogies, that move over two different gauges, which also have different types of rail: the Iberian gauge (1668 mm) and the UIC gauge (1435 mm). Optimisation is performed using Genetic Algorithms and traditional optimisation methods in a complementary way. The objective function used is based on an ideal equivalent conicity curve which ensures good stability on straight sections and also proper negotiation of curves. To this end the curve is constructed in such a way that it is constant with a low value for small lateral wheelset displacements (with regard to stability), and increases as the displacements increase (to facilitate negotiation of curved sections). Using this kind of ideal conicity curve also enables a wheel profile to be secured where the contact points have a larger distribution over the active contact areas, making wear more homogeneous and reducing stresses. The result is a wheel profile with a conicity that is closer to the target conicity for both gauges studied, producing better curve negotiation while maintaining good stability on straight sections of track. The paper shows the resultant wheel profile, the contact curves it produces, and a number of dynamic analyses demonstrating better dynamic behaviour of the synthesised wheel on curved sections with respect to the original wheel.

On parallel computing for stochastic optimization models and algorithms

167 p.

Linear Chromatic Adaptation Transform Based on Delaunay Triangulation

Computer vision algorithms that use color information require color constant images to operate correctly. Color constancy of the images is usually achieved in two steps: first the illuminant is detected and then image is transformed with the chromatic adaptation transform ( CAT). Existing CAT methods use a single transformation matrix for all the colors of the input image. The method proposed in this paper requires multiple corresponding color pairs between source and target illuminants given by patches of the Macbeth color checker. It uses Delaunay triangulation to divide the color gamut of the input image into small triangles. Each color of the input image is associated with the triangle containing the color point and transformed with a full linear model associated with the triangle. Full linear model is used because diagonal models are known to be inaccurate if channel color matching functions do not have narrow peaks. Objective evaluation showed that the proposed method outperforms existing CAT methods by more than 21%; that is, it performs statistically significantly better than other existing methods.

Improving Content Delivery Efficiency through Multi-Layer Mobile Edge Adaptation

This paper presents a novel architecture for optimizing the HTTP-based multimedia delivery in multi-user mobile networks. This proposal combines the usual client-driven dynamic adaptation scheme DASH-3GPP with network-assisted adaptation capabilities, in order to maximize the overall Quality of Experience. The foundation of this combined adaptation scheme is based on two state of the art technologies. On one hand, adaptive HTTP streaming with multi-layer encoding allows efficient media delivery and improves the experienced media quality in highly dynamic channels. Additionally, it enables the possibility to implement network-level adaptations for better coping with multi-user scenarios. On the other hand, mobile edge computing facilitates the deployment of mobile services close to the user. This approach brings new possibilities in modern and future mobile networks, such as close to zero delays and awareness of the radio status. The proposal in this paper introduces a novel element, denoted as Mobile Edge-DASH Adaptation Function, which combines all these advantages to support efficient media delivery in mobile multi-user scenarios. Furthermore, we evaluate the performance enhancements of this content- and user context-aware scheme through simulations of a mobile multimedia scenario.

Radio-aware service-level scheduling to minimize downlink traffic delay through Mobile Edge Computing

One of the most challenging problems in mobile broadband networks is how to assign the available radio resources among the different mobile users. Traditionally, research proposals are either speci c to some type of traffic or deal with computationally intensive algorithms aimed at optimizing the delivery of general purpose traffic. Consequently, commercial networks do not incorporate these mechanisms due to the limited hardware resources at the mobile edge. Emerging 5G architectures introduce cloud computing principles to add flexible computational resources to Radio Access Networks. This paper makes use of the Mobile Edge Computing concepts to introduce a new element, denoted as Mobile Edge Scheduler, aimed at minimizing the mean delay of general traffic flows in the LTE downlink. This element runs close to the eNodeB element and implements a novel flow-aware and channel-aware scheduling policy in order to accommodate the transmissions to the available channel quality of end users.

Linear Chromatic Adaptation Transform Based on Delaunay Triangulation

Computer vision algorithms that use color information require color constant images to operate correctly. Color constancy of the images is usually achieved in two steps: first the illuminant is detected and then image is transformed with the chromatic adaptation transform ( CAT). Existing CAT methods use a single transformation matrix for all the colors of the input image. The method proposed in this paper requires multiple corresponding color pairs between source and target illuminants given by patches of the Macbeth color checker. It uses Delaunay triangulation to divide the color gamut of the input image into small triangles. Each color of the input image is associated with the triangle containing the color point and transformed with a full linear model associated with the triangle. Full linear model is used because diagonal models are known to be inaccurate if channel color matching functions do not have narrow peaks. Objective evaluation showed that the proposed method outperforms existing CAT methods by more than 21%; that is, it performs statistically significantly better than other existing methods.