Search results for "LEM"

Global sensitivity analysis in welding simulations -- what are the material data you really need ?

2011

In this paper, the sensitivity analysis methodology is applied to numerical welding simulation in order to rank the importance of input variables on the outputs of the code like distorsions or residual stresses. The numerical welding simulation uses the finite element method, with a thermal computation followed by a mechanical one. Classically, a local sensitivity analysis is performed, hence the validity of the results is limited to the neighbourhood of a nominal point, and cross effects cannot be detected. This study implements a global sensitivity analysis which allows to screen the whole material space of the steel family mechanical properties. A set of inputs of the mechanical model-ma…

Using Inverse Reinforcement Learning with Real Trajectories to Get More Trustworthy Pedestrian Simulations

2020

Reinforcement learning is one of the most promising machine learning techniques to get intelligent behaviors for embodied agents in simulations. The output of the classic Temporal Difference family of Reinforcement Learning algorithms adopts the form of a value function expressed as a numeric table or a function approximator. The learned behavior is then derived using a greedy policy with respect to this value function. Nevertheless, sometimes the learned policy does not meet expectations, and the task of authoring is difficult and unsafe because the modification of one value or parameter in the learned value function has unpredictable consequences in the space of the policies it represents…

De la botánica "inútil" a la ciencia aplicada. Simón de Rojas Clemente y Rubio

2015

El ?Alivio de las Indias?. la Real Hacienda Filipina, 1565-1800

2019

Previo al estudio de la Real Hacienda filipina, el trabajo se centrará en la definición del marco territorial, la función del archipiélago en la estrategia imperial y la gran transformación de finales del siglo xVIII que afectó a su situación en el conjunto colonial. En segundo lugar, se expondrá el estado de la cuestión y las principales hipótesis sobre la evolución del Tesoro filipino y los problemas que planteaba su viabilidad, así como las fuentes y la metodología empleadas. A continuación se examinarán las grandes tendencias de la Hacienda en el largo plazo y los componentes del ingreso y el gasto, para finalizar con algunas conclusiones, en especial la respuesta a la siguiente pregunt…

A numerical model for pre-monitoring design of historical colonnade courtyards: The case study of chiaramonte palace in palermo

2016

This paper proposes a numerical model that can be used for theoretical and experimental dynamic characterization of historical colonnade courtyards. Such an architectural element appears often in buildings of historical heritage and, especially under seismic excitation, it represents the most vulnerable structural part. Therefore, it is very important to have reliable as well as simple models available for vulnerability analysis, to evaluate different reinforcing systems if needed, or to plan dynamic characterization tests or monitoring campaigns, as in the present case. Chiaramonte Palace, a wonderful example of the historical heritage of Palermo, is investigated as case study. Firstly, a …

Aesthetic considerations for the min-max K-Windy Rural Postman Problem

2017

[EN] The aesthetic quality of routes is a feature of route planning that is of practical importance, but receives relatively little attention in the literature. Several practitioners have pointed out that the visual appeal of a proposed set of routes can have a strong influence on the willingness of a client to accept or reject a specific routing plan. While some work has analyzed algorithmic performance relative to traditional min-sum or min-max objective functions and aesthetic objective functions, we are not aware of any work that has considered a multi-objective approach. This work considers a multi-objective variant of the Min-Max K-Vehicles Windy Rural Postman Problem, discusses sever…

Stabilized branch-and-price algorithms for vector packing problems

2018

Abstract This paper considers packing and cutting problems in which a packing/cutting pattern is constrained independently in two or more dimensions. Examples are restrictions with respect to weight, length, and value. We present branch-and-price algorithms to solve these vector packing problems (VPPs) exactly. The underlying column-generation procedure uses an extended master program that is stabilized by (deep) dual-optimal inequalities. While some inequalities are added to the master program right from the beginning (static version), other violated dual-optimal inequalities are added dynamically. The column-generation subproblem is a multidimensional knapsack problem, either binary, boun…

Tabu Search to Plan Schedules in a Multiskill Customer Contact Center

2006

International audience; We have studied a realistic case of scheduling problem in a customer contact center, dealing with multiskill agents. Our model combines the last two steps of the standard approach by determining shifts and by assigning them to agents at the same time (scheduling and rostering). Moreover, we have considered realistic vacations, according to legal constraints and preferences of agents. We have envisioned entire weeks of work, with variable meal times and meal durations, without overtime. In this paper, we define the problem and describe a Tabu search based solution.

Learning automata-based solutions to the optimal web polling problem modelled as a nonlinear fractional knapsack problem

2011

We consider the problem of polling web pages as a strategy for monitoring the world wide web. The problem consists of repeatedly polling a selection of web pages so that changes that occur over time are detected. In particular, we consider the case where we are constrained to poll a maximum number of web pages per unit of time, and this constraint is typically dictated by the governing communication bandwidth, and by the speed limitations associated with the processing. Since only a fraction of the web pages can be polled within a given unit of time, the issue at stake is one of determining which web pages are to be polled, and we attempt to do it in a manner that maximizes the number of ch…

Heuristics for the min–max arc crossing problem in graphs

2018

Abstract In this paper, we study the visualization of complex structures in the context of automatic graph drawing. Constructing geometric representations of combinatorial structures, such as networks or graphs, is a difficult task that requires an expert system. The automatic generation of drawings of graphs finds many applications from software engineering to social media. The objective of graph drawing expert systems is to generate layouts that are easy to read and understand. This main objective is achieved by solving several optimization problems. In this paper we focus on the most important one: reducing the number of arc crossings in the graph. This hard optimization problem has been…