4 resultados para Weighted sum
em AMS Tesi di Dottorato - Alm@DL - Università di Bologna
Resumo:
Over the years the Differential Quadrature (DQ) method has distinguished because of its high accuracy, straightforward implementation and general ap- plication to a variety of problems. There has been an increase in this topic by several researchers who experienced significant development in the last years. DQ is essentially a generalization of the popular Gaussian Quadrature (GQ) used for numerical integration functions. GQ approximates a finite in- tegral as a weighted sum of integrand values at selected points in a problem domain whereas DQ approximate the derivatives of a smooth function at a point as a weighted sum of function values at selected nodes. A direct appli- cation of this elegant methodology is to solve ordinary and partial differential equations. Furthermore in recent years the DQ formulation has been gener- alized in the weighting coefficients computations to let the approach to be more flexible and accurate. As a result it has been indicated as Generalized Differential Quadrature (GDQ) method. However the applicability of GDQ in its original form is still limited. It has been proven to fail for problems with strong material discontinuities as well as problems involving singularities and irregularities. On the other hand the very well-known Finite Element (FE) method could overcome these issues because it subdivides the computational domain into a certain number of elements in which the solution is calculated. Recently, some researchers have been studying a numerical technique which could use the advantages of the GDQ method and the advantages of FE method. This methodology has got different names among each research group, it will be indicated here as Generalized Differential Quadrature Finite Element Method (GDQFEM).
Resumo:
We deal with five problems arising in the field of logistics: the Asymmetric TSP (ATSP), the TSP with Time Windows (TSPTW), the VRP with Time Windows (VRPTW), the Multi-Trip VRP (MTVRP), and the Two-Echelon Capacitated VRP (2E-CVRP). The ATSP requires finding a lest-cost Hamiltonian tour in a digraph. We survey models and classical relaxations, and describe the most effective exact algorithms from the literature. A survey and analysis of the polynomial formulations is provided. The considered algorithms and formulations are experimentally compared on benchmark instances. The TSPTW requires finding, in a weighted digraph, a least-cost Hamiltonian tour visiting each vertex within a given time window. We propose a new exact method, based on new tour relaxations and dynamic programming. Computational results on benchmark instances show that the proposed algorithm outperforms the state-of-the-art exact methods. In the VRPTW, a fleet of identical capacitated vehicles located at a depot must be optimally routed to supply customers with known demands and time window constraints. Different column generation bounding procedures and an exact algorithm are developed. The new exact method closed four of the five open Solomon instances. The MTVRP is the problem of optimally routing capacitated vehicles located at a depot to supply customers without exceeding maximum driving time constraints. Two set-partitioning-like formulations of the problem are introduced. Lower bounds are derived and embedded into an exact solution method, that can solve benchmark instances with up to 120 customers. The 2E-CVRP requires designing the optimal routing plan to deliver goods from a depot to customers by using intermediate depots. The objective is to minimize the sum of routing and handling costs. A new mathematical formulation is introduced. Valid lower bounds and an exact method are derived. Computational results on benchmark instances show that the new exact algorithm outperforms the state-of-the-art exact methods.
Resumo:
In this thesis I have characterized the trace measures for particular potential spaces of functions defined on R^n, but "mollified" so that the potentials are de facto defined on the upper half-space of R^n. The potential functions are kind Riesz-Bessel. The characterization of trace measures for these spaces is a test condition on elementary sets of the upper half-space. To prove the test condition as sufficient condition for trace measures, I had give an extension to the case of upper half-space of the Muckenhoupt-Wheeden and Wolff inequalities. Finally I characterized the Carleson-trace measures for Besov spaces of discrete martingales. This is a simplified discrete model for harmonic extensions of Lipschitz-Besov spaces.
Resumo:
The introduction of molecular criteria into the classification of diffuse gliomas has added interesting practical implications to glioma management. This has created a new clinical need for correlating imaging characteristics with glioma genotypes, also known as radiogenomics or imaging genomics. Whilst many studies have primarily focused on the use of advanced magnetic resonance imaging (MRI) techniques for radiogenomics purposes, conventional MRI sequences still remain the reference point in the study and characterization of brain tumours. Moreover, a different approach may rely on diffusion-weighted imaging (DWI) usage, which is considered a “conventional” sequence in line with recently published directions on glioma imaging. In a non-invasive way, it can provide direct insight into the microscopic physical properties of tissues. Considering that Isocitrate-Dehydrogenase gene mutations may reflect alterations in metabolism, cellularity, and angiogenesis, which may manifest characteristic features on an MRI, the identification of specific MRI biomarkers could be of great interest in managing patients with brain gliomas. My study aimed to evaluate the presence of specific MRI-derived biomarkers of IDH molecular status through conventional MRI and DWI sequences.