Search results for "Simulation."
showing 10 items of 4779 documents
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…
Modeling Energy Demand Aggregators for Residential Consumers
2013
International audience; Energy demand aggregators are new actors in the energy scenario: they gather a group of energy consumers and implement a demand- response paradigm. When the energy provider needs to reduce the current energy demand on the grid, it can pay the energy demand aggregator to reduce the load by turning off some of its consumers loads or postponing their activation. Currently this operation involves only greedy energy consumers like industrial plants. In this paper we want to study the potential of aggregating a large number of small energy consumers like home users as it may happen in smart grids. In particular we want to address the feasibility of such approach by conside…
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…
A model for torque losses in variable displacement axial piston motors
2018
This paper includes a comparison of earlier presented models for torque losses in hydraulic motors and several proposed models that all rely on data typically available for a system engineer. The new models and the old ones are compared. The new models are all based on a model developed by Jeong 2007 with an expansion that include variable displacement. All of the new models yield very good accuracy down to approximately 50% of maximum displacement and down to approximately 15% of maximum speed. In these operational ranges the deviation in torque is less than 1%. The main purpose of the new models is to facilitate simulations of hydraulically actuated winches with a balance between accuracy…
Onset of cohesion in cement paste
2004
It is generally agreed that the cohesion of cement paste occurs through the formation of a network of nanoparticles of a calcium-silicate-hydrate ("C-S-H"). However, the mechanism by which these particles develop this cohesion has not been established. Here we propose a dielectric continuum model which includes all ionic interactions within a dispersion of C-S-H particles. It takes into account all co-ions and counterions explicitly (with pure Coulomb interactions between ions and between ions and the surfaces) and makes no further assumptions concerning their hydration or their interactions with the surface sites. At high surface charge densities, the model shows that the surface charge of…
A note on best proximity point theory using proximal contractions
2018
In this paper, a reduction technique is used to show that some recent results on the existence of best proximity points for various classes of proximal contractions can be concluded from the corresponding results in fixed point theory.
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…
The minimum mean cycle-canceling algorithm for linear programs
2022
Abstract This paper presents the properties of the minimum mean cycle-canceling algorithm for solving linear programming models. Originally designed for solving network flow problems for which it runs in strongly polynomial time, most of its properties are preserved. This is at the price of adapting the fundamental decomposition theorem of a network flow solution together with various definitions: that of a cycle and the way to calculate its cost, the residual problem, and the improvement factor at the end of a phase. We also use the primal and dual necessary and sufficient optimality conditions stated on the residual problem for establishing the pricing step giving its name to the algorith…
Best proximity point theorems for proximal cyclic contractions
2017
The purpose of this article is to compute a global minimizer of the function $$x\longrightarrow d(x, Tx)$$ , where T is a proximal cyclic contraction in the framework of a best proximally complete space, thereby ensuring the existence of an optimal approximate solution, called a best proximity point, to the equation $$Tx=x$$ when T is not necessarily a self-mapping.
Combined column-and-row-generation for the optimal communication spanning tree problem
2018
Abstract This paper considers the exact solution of the optimal communication spanning tree problem (OCSTP), which can be described as follows: Given an undirected graph with transportation costs on every edge and communication requirements for all pairs of vertices, the OCSTP seeks for a spanning tree that minimizes the sum of the communication costs between all pairs of vertices, where the communication cost of a pair of vertices is defined as their communication requirement multiplied by the transportation cost of the unique tree path that connects the two vertices. Two types of compact formulations for OCSTP were presented in the literature. The first one is a four-index model based on …