Search results for "SIMULATION"
showing 10 items of 5095 documents
On smoothing problems with one additional equality condition
2009
Two problems of approximation in Hilbert spaces are considered with one additional equality condition: the smoothing problem with a weight and the smoothing problem with an obstacle. This condition is a generalization of the equality, which appears in the problem of approximation of a histogram in a natural way. We characterize the solutions of these smoothing problems and investigate the connection between them. First published online: 14 Oct 2010
Gradient-based shape optimisation of ultra-wideband antennas parameterised using splines
2010
Methodology enabling the gradient-based optimisation of antennas parameterised using B-splines is presented. Use of the spline parametrisation allows us to obtain versatile new shapes, whereas the geometry can be represented with a small set of design variables. Moreover, good control over admissible geometries is retained. Advantages of gradient-based optimisation methods are quick convergence, and the fact that the obtained design can be guaranteed to be a local optimum. Focus of this study is to present techniques that enable the computation of exact gradients of the discrete problem, even though the complexity of the geometries does not permit establishing analytical expressions for the…
On the evaluation of the global heat transfer coefficient in cutting
2007
The use of numerical simulations for investigating machining processes is remarkably increasing because of the simulation cost is lower than the experiments and the possibility to analyze local variables such as pressures, strains, and temperatures is allowable. Process simulation is very hard from a computational point of view, since it frequently requires remeshing phases and very small time steps. As a consequence, the simulated cutting time is usually of the order of few milliseconds and no steady cutting conditions are generally achieved, at least as far as thermal conditions are concerned. Therefore, nowadays numerical prediction of cutting temperatures cannot be considered fully reli…
Hedging of Spatial Temperature Risk with Market-Traded Futures
2011
The main objective of this work is to construct optimal temperature futures from available market-traded contracts to hedge spatial risk. Temperature dynamics are modelled by a stochastic differential equation with spatial dependence. Optimal positions in market-traded futures minimizing the variance are calculated. Examples with numerical simulations based on a fast algorithm for the generation of random fields are presented.
Methodological Approach to Studying the dynamics of production networks: a Discrete Event Simulation Model
2013
This paper shows how discrete-event simulation represents an appropriate tool for approaching the dynamics of production networks. Three important factors influencing production network dynamics, specifically finite production capacity, manufacturing lead time, and its variability are discussed and a basic discrete-event simulation model is presented. Such model, which in its basic form represents a simple retail/distribution two-stage supply chain, is then extended in order to take into account those factors that can not be included in a classical control theoretical model.
Incremental bipartite drawing problem
2001
Abstract Layout strategies that strive to preserve perspective from earlier drawings are called incremental. In this paper we study the incremental arc crossing minimization problem for bipartite graphs. We develop a greedy randomized adaptive search procedure (GRASP) for this problem. We have also developed a branch-and-bound algorithm in order to compute the relative gap to the optimal solution of the GRASP approach. Computational experiments are performed with 450 graph instances to first study the effect of changes in grasp search parameters and then to test the efficiency of the proposed procedure. Scope and purpose Many information systems require graphs to be drawn so that these syst…
Parametric and nonparametric methods to generate time-varying surrogate data.
2009
We present both nonparametric and parametric approaches to generating time-varying surrogate data. Nonparametric and parametric approaches are based on the use of the short-time Fourier transform and a time-varying autoregressive model, respectively. Time-varying surrogate data (TVSD) can be used to determine the statistical significance of the linear and nonlinear coherence function estimates. Two advantages of the TVSD are that it keeps one from having to make an arbitrary decision about the significance of the coherence value, and it properly takes into account statistical significance levels, which may change with time. Our simulation examples and experimental results on blood pressure …
Optimal Paths on Urban Networks Using Travelling Times Prevision
2012
We deal with an algorithm that, once origin and destination are fixed, individuates the route that permits to reach the destination in the shortest time, respecting an assigned maximal travel time, and with risks measure below a given threshold. A fluid dynamic model for road networks, according to initial car densities on roads and traffic coefficients at junctions, forecasts the future traffic evolution, giving dynamical weights to a constrained 𝐾 shortest path algorithm. Simulations are performed on a case study to test the efficiency of the proposed procedure.
Representation of capacity drop at a road merge via point constraints in a first order traffic model
2018
We reproduce the capacity drop phenomenon at a road merge by implementing a non-local point constraint at the junction in a first order traffic model. We call capacity drop the situation in which the outflow through the junction is lower than the receiving capacity of the outgoing road, as too many vehicles trying to access the junction from the incoming roads hinder each other. In this paper, we first construct an enhanced version of the locally constrained model introduced by Haut et al. (Proceedings 16th IFAC World Congress. Prague, Czech Republic 229 (2005) TuM01TP/3), then we propose its counterpart featuring a non-local constraint and finally we compare numerically the two models by c…
The Rural Postman Problem on mixed graphs with turn penalties
2002
In this paper we deal with a problem which generalizes the Rural Postman Problem defined on a mixed graph (MRPP). The generalization consists of associating a non-negative penalty to every turn as well as considering the existence of forbidden turns. This new problem fits real-world situations more closely than other simpler problems. A solution tour must traverse all the requiring service arcs and edges of the graph while not making forbidden turns. Its total cost will be the sum of the costs of the traversed arcs and edges together with the penalties associated with the turns done. The Mixed Rural Postman Problem with Turn Penalties (MRPPTP) consists of finding such a tour with a total mi…