Search results for "Minification"
showing 10 items of 91 documents
The role of perceptual contrast non-linearities in image transform quantization
2000
Abstract The conventional quantizer design based on average error minimization over a training set does not guarantee a good subjective behavior on individual images even if perceptual metrics are used. In this work a novel criterion for transform coder design is analyzed in depth. Its aim is to bound the perceptual distortion in each individual quantization according to a non-linear model of early human vision. A common comparison framework is presented to describe the qualitative behavior of the optimal quantizers under the proposed criterion and the conventional rate-distortion based criterion. Several underlying metrics, with and without perceptual non-linearities, are used with both cr…
A tabu search algorithm for the bipartite drawing problem
1998
Graphs are used to represent reality in several areas of knowledge. This has generated considerable interest in graph drawing algorithms. Arc crossing minimization is a fundamental aesthetic criterion to obtain a readable map of a graph. The problem of minimizing the number of arc crossings in a bipartite graph (BDP) is NP-complete. In this paper we present a Tabu Search (TS) scheme for the BDP. Several algorithms can be obtained with this scheme by implementing different evaluators in the move definitions. In this paper we propose two variants. Computational results are reported on a set of 300 randomly generated test problems. The two algorithms have been compared with the best heuristics…
Formulations for an inventory routing problem
2014
In this paper, we present and compare formulations for the inventory routing problem (IRP) where the demand of customers has to be served, over a discrete time horizon, by capacitated vehicles starting and ending their routes at a depot. The objective of the IRP is the minimization of the sum of inventory and transportation costs. The formulations include known and new mathematical programming formulations. Valid inequalities are also presented. The formulations are tested on a large set of benchmark instances. One of the most significant conclusions is that the formulations that use vehicle-indexed variables are superior to the more compact, aggregate formulations.
Method to find the Minimum 1D Linear Gradient Model for Seismic Tomography
2016
The changes in the state of a geophysical medium before a strong earthquake can be found by studying of 3D seismic velocity images constructed for consecutive time windows. A preliminary step is to see changes with time in a minimum 1D model. In this paper we develop a method that finds the parameters of the minimum linear gradient model by applying a two-dimensional Taylor series of the observed data for the seismic ray and by performing least-square minimization for all seismic rays. This allows us to obtain the mean value of the discrete observed variable, close to zero value.
Reconstruction Problem of Reinforced Concrete Beams under Harmonic Excitations
2007
A damage detection method based on harmonic structural vibrations has been applied to reconstruct realistic damage patterns of reinforced concrete beams. It was shown that the application of a hybrid method (genetic algorithm and Levenberg-Marquardt minimization technique) makes it possible to effectively reconstruct the flexural stiffness drops as small as 10-20% with the maximum error of 4%. The error increases to about 7 to 9% with the presence of 1% measurement noise.
Data-Driven Pump Scheduling for Cost Minimization in Water Networks
2021
Pumps consume a significant amount of energy in a water distribution network (WDN). With the emergence of dynamic energy cost, the pump scheduling as per user demand is a computationally challenging task. Computing the decision variables of pump scheduling relies over mixed integer optimization (MIO) formulations. However, MIO formulations are NP-hard in general and solving such problems is inefficient in terms of computation time and memory. Moreover, the computational complexity of solving such MIO formulations increases exponentially with the size of the WDN. As an alternative, we propose a data-driven approach to estimate the decision variables of pump scheduling using deep neural netwo…
A powerful route minimization heuristic for the vehicle routing problem with time windows
2009
We suggest an efficient route minimization heuristic for the vehicle routing problem with time windows. The heuristic is based on the ejection pool, powerful insertion and guided local search strategies. Experimental results on the Gehring and Homberger's benchmarks demonstrate that our algorithm outperforms previous approaches and found 18 new best-known solutions.
A challenging family of automata for classical minimization algorithms
2010
In this paper a particular family of deterministic automata that was built to reach the worst case complexity of Hopcroft's state minimization algorithm is considered. This family is also challenging for the two other classical minimization algorithms: it achieves the worst case for Moore's algorithm, as a consequence of a result by Berstel et al., and is of at least quadratic complexity for Brzozowski's solution, which is our main contribution. It therefore constitutes an interesting family, which can be useful to measure the efficiency of implementations of well-known or new minimization algorithms.
Metric regularity and second-order necessary optimality conditions for minimization problems under inclusion constraints
1994
In this paper, we establish some general metric regularity results for multivalued functions on Banach spaces. Then, we apply them to derive second-order necessary optimality conditions for the problem of minimizing a functionf on the solution set of an inclusion 0?F(x) withx?C, whenF has a closed convex second-order derivative.
Sensitivity analysis for discretized unilateral plane elasticity problem
1992
Abstract Numerical realization of optimal shape design problems requires gradient information which is used in minimization procedures. There are several possibilities for obtaining this information. Here we present a method, based on the use of the material derivative approach, applied to the finite element discretization of the problem. The advantage of this approach is that is gives the exact values of gradient and it can be very easily implemented on computers. We apply this method in the case of contact problems, where the situation is more involved compared with the case of elasticity problems with classical boundary conditions. We concentrate on a special choice of the cost functiona…