1,721,795 research outputs found
A System of Hamilton-Jacobi Equations Characterizing Geodesic Centroidal Tessellations
We introduce a class of systems of Hamilton-Jacobi equations characterizing geodesic centroidal tessellations, i.e., tessellations of domains with respect to geodesic distances where generators and centroids coincide. Typical examples are given by geodesic centroidal Voronoi tessellations and geodesic centroidal power diagrams. An appropriate version of the Fast Marching method on unstructured grids allows computing the solution of the Hamilton-Jacobi system and, therefore, the associated tessellations. We propose various numerical examples to illustrate the features of the technique
A System of Hamilton-Jacobi Equations Characterizing Geodesic Centroidal Tessellations
We introduce a class of systems of Hamilton-Jacobi equations characterizing geodesic centroidal tessellations, i.e., tessellations of domains with respect to geodesic distances where generators and centroids coincide. Typical examples are given by geodesic centroidal Voronoi tessellations and geodesic centroidal power diagrams. An appropriate version of the Fast Marching method on unstructured grids allows computing the solution of the Hamilton-Jacobi system and, therefore, the associated tessellations. We propose various numerical examples to illustrate the features of the technique
Problematiche e opportunità della valorizzazione economica degli olivi e degli oli monumentali - Un focus sul territorio dell’Irpinia
Reconstruction of independent sub-domains for a class of Hamilton-Jacobi equations and application to parallel computing
A previous knowledge of the domains of dependence of a Hamilton–Jacobi equation can
be useful in its study and approximation. Information of this nature is, in general, difficult to obtain
directly from the data of the problem. In this paper we formally introduce the concept of an independent
sub-domain, discuss its main properties and provide a constructive implicit representation formula.
Through these results, we propose an algorithm for the approximation of these sets that is shown to
be relevant in the numerical resolution, via parallel computin
Going Beyond Counting First Authors in Author Co-citation Analysis
The present study examines one of the fundamental aspects of author co-citation analysis (ACA) - the way co-citation
counts are defined. Co-citation counting provides the data on which all subsequent statistical analyses and mappings
are based, and we compare ACA results based on two different types of co-citation counting - the traditional type that
only counts the first one among a cited work's authors on the one hand and a non-traditional type that takes into
account the first 5 authors of a cited work on the other hand. Results indicate that the picture produced through this non-traditional author co-citation counting contains more coherent author groups and is therefore considerably clearer. However, this picture represents fewer specialties in the research field being studied than that produced through the traditional first-author co-citation counting when the same number of top-ranked authors is selected and analyzed. Reasons for these effects are discussed
The orienteering problem: A hybrid control Formulation
In the last years, a growing number of challenging applications in navigation, logistics, and tourism were modeled as orienteering problems. This problem has been proposed in relation to a sport race where certain control points must be visited in a minimal time. In a certain kind of these competitions, the choice of the number and the order for the control points are left to the competitor. We propose an original approach to solve the orienteering problem based on hybrid control. The continuous state of the system contains information about the navigation toward the next control point. In contrast, the discrete state keeps track of the already visited ones. The control problem is solved using non-standard dynamical programming techniques
Tectonic evolution of the Ligurian accretionary wedge in Monferrato (NW Italy): new data from the analysis of tectonic, sedimentary and diapiric mélanges
L’evoluzione tettonica del Monferrato è ben conosciuta a partire dagli episodi deformativi oligocenici. Al contrario, la sua evoluzione pre-oligocenica legata alle fasi di accrezione del Cretacico superiore-Eocene medio del cuneo di accrezione Ligure è ancora poco conosciuta.
Le Unità Liguri Esterne che costituiscono il substrato della successione del Bacino Terziario Piemontese in Monferrato sono conosciute come un complesso caotico indifferenziato di età Cretacico superiore-Eocene medio. Lo studio dettagliato di queste Unità ha permesso di distinguere al loro interno tre unità litostratigrafiche: le Argille varicolori (Santoniano-Campaniano), il Flysch di Monte Cassio (Campaniano superiore(?)-Maastrichtiano), e le Brecce argillose poligeniche (Oligocene superiore). Le Argille varicolori e le Brecce argillose poligeniche rappresentano il prodotto dell’interazione e sovrapposizione di processi tettonici, sedimentari e diapirici che hanno operato in momenti diversi dell’evoluzione del cuneo di accrezione Ligure formando mélange poligenici. L’analisi della deformazione e la comprensione dei rapporti di sovrapposizione tra i diversi tipi di mélanges poligenici individuati hanno permesso di: (i) distinguere più fasi deformative (Cretacico superiore, Rupeliano e Oligocene superiore); (ii) comprendere i rapporti di interazione e sovrapposizione tra processi tettonici, sedimentari e diapirici che hanno portato alla formazione di diversi tipi di mélanges poligenici; (iii) ridefinire più in dettaglio, rispetto ai dati di letteratura, i tempi della deformazione dell’intervallo di tempo Chattiano–pre Burdigaliano
Stochastic hybrid differential games and match race problems
We discuss the general framework of a stochastic two-player, hybrid differential game, and we apply it to the modelling of a “match race” between two sailing boats, namely a competition in which the goal of both players is to proceed in the windward direction, while trying to slow down the other player. We provide a convergent approximation scheme for the computation of the value function of the game, and we validate the approach on some typical racing scenarios
- …
