Search results for "Polygon"
showing 10 items of 282 documents
Branch-and-Cut-and-Price for the Vehicle Routing Problem with Time Windows and Convex Node Costs
2019
Two critical yet frequently conflicting objectives for logistics and transportation service companies are improving customer satisfaction and reducing transportation cost. In particular, given a network of customer requests with preferred service times, it is very challenging to find vehicle routes and service schedules simultaneously that respect all operating constraints and minimize the total transportation and customers’ inconvenience costs. In this paper, we introduce the vehicle routing problem with time windows and convex node costs (VRPTW-CNC), in which we model each customer’s inconvenience cost as a convex function of the service start time at that customer. The VRPTW-CNC combine…
Adaptation based on interpolation errors for high order mesh refinement methods applied to conservation laws
2012
Adaptive mesh refinement is nowadays a widely used tool in the numerical solution of hyperbolic partial differential equations. The algorithm is based on the numerical approximation of the solution of the equations on a hierarchical set of meshes with different resolutions. Among the different parts that compose an adaptive mesh refinement algorithm, the decision of which level of resolution is adequate for each part of the domain, i.e., the design of a refinement criterion, is crucial for the performance of the algorithm. In this work we analyze a refinement strategy based on interpolation errors, as a building block of a high order adaptive mesh refinement algorithm. We show that this tec…
A Multi-Port Approach to Solve Distribution Networks with Meshes and PV Nodes
2007
A new methodology based on the backward/forward (b/f) technique for the load flow solution in distribution systems is here proposed. The methodology takes efficiently into account the fixed voltage nodes and uses a reduced bus impedance matrix. In this way, it is possible to attain, for the unknowns at the PV nodes, the same values that are attainable solving the network with the methods adopted for transmission systems. With the same methodology it is possible to take into account also the meshes. If the network contains only meshes, the relevant model is linear and it is the one including the compensation currents. The presence of PV nodes introduces non linearity in the model and an iter…
MAST solution of irrotational flow problems in 2D domains with strongly unstructured triangular meshes
2010
A new methodology for the solution of irrotational 2D flow problems in domains with strongly unstructured meshes is presented. A fractional time step procedure is applied to the original governing equations, solving consecutively a convective prediction system and a diffusive corrective system. The non linear components of the problem are concentrated in the prediction step, while the correction step leads to the solution of a linear system, of the order of the number of computational cells. A MArching in Space and Time (MAST) approach is applied for the solution of the convective prediction step. The major advantages of the model, as well as its ability to maintain the solution monotonicit…
A comparison of local parametric C0 Bézier interpolants for triangular meshes
2011
Parametric curved shape surface schemes interpolating vertices and normals of a given triangular mesh with arbitrary topology are widely used in computer graphics for gaming and real-time rendering due to their ability to effectively represent any surface of arbitrary genus. In this context, continuous curved shape surface schemes using only the information related to the triangle corresponding to the patch under construction, emerged as attractive solutions responding to the requirements of resource-limited hardware environments. In this paper we provide a unifying comparison of the local parametric C^0 curved shape schemes we are aware of, based on a reformulation of their original constr…
A new weighted normal-based filter for 3D mesh denoising
2018
In this paper, we propose a normal based filtering method for 3D mesh denoising. For this purpose, we compute the new triangle normal vectors by using a weighted sum of the average (smoothness) and the myriad (sharpness) filters in each neighborhood. These weights, that reflect the degree of the surface sharpness, are calculated according to the statistical distribution of the angles between the normal vectors of the triangles. The histogram of the angles between surface normal vectors is accurately fitted by the well known Cauchy distribution. Here, we justify the use of the myriad filter whose estimated value represents the optimum of the location parameter of the investigated distributio…
Generalized dimension estimates for images of porous sets under monotone Sobolev mappings
2014
We give an essentially sharp estimate in terms of generalized Hausdorff measures for images of porous sets under monotone Sobolev mappings, satisfying suitable Orlicz-Sobolev conditions.
Strengthened splitting methods for computing resolvents
2021
In this work, we develop a systematic framework for computing the resolvent of the sum of two or more monotone operators which only activates each operator in the sum individually. The key tool in the development of this framework is the notion of the “strengthening” of a set-valued operator, which can be viewed as a type of regularisation that preserves computational tractability. After deriving a number of iterative schemes through this framework, we demonstrate their application to best approximation problems, image denoising and elliptic PDEs. FJAA and RC were partially supported by the Ministry of Science, Innovation and Universities of Spain and the European Regional Development Fund …
Improvements and Modifications of Tarone's Multiple Test Procedure for Discrete Data
1998
Tarone (1990, Biometrics 46, 515-522) proposed a multiple test procedure for discrete test statistics improving the usual Bonferroni procedure. However, Tarone's procedure is not monotone depending on the predetermined multiple level a. Roth (1998, Journal of Statistical Planning and Inference, in press) developed a monotone version of Tarone's procedure. We present a similar procedure that is both monotone and an improvement of Tarone's proposal. Based on this extension, we derive a step-down procedure that is a corresponding improvement of Holm's (1979, Scandinavian Journal of Statistics 6, 65-70) sequentially rejective procedure. It is shown how adjusted p-values can be computed for the …
Differential geometric least angle regression: a differential geometric approach to sparse generalized linear models
2013
Summary Sparsity is an essential feature of many contemporary data problems. Remote sensing, various forms of automated screening and other high throughput measurement devices collect a large amount of information, typically about few independent statistical subjects or units. In certain cases it is reasonable to assume that the underlying process generating the data is itself sparse, in the sense that only a few of the measured variables are involved in the process. We propose an explicit method of monotonically decreasing sparsity for outcomes that can be modelled by an exponential family. In our approach we generalize the equiangular condition in a generalized linear model. Although the …