Paleontologia e evolução a problemática da espécie em Paleozoologia

The concept of species in Paleontology is of paramount importance since the correct taxonomic determinations are essential to establish the age of the beds where fossils are collected. Particularly since 1940, the concept of species from a biological context, corresponding to the variability of a set of interpopulation compatibility, led us to a new approach, in which a typological conception has been replaced by a populationist one. If the notion of species is not necessarily identical for all living organisms, the greater the difficulties of interpretation in the private world of cephalopod fossils. The latter, lend themselves well to population systematics, and where this concept of species rests primarily on the morphological similarities. Thus, the introduction of general ideas analyse "typological species", "biological species", the problem of the definition of a "population" in Paleontology, and also the importance of the biometric analysis of fossil associations. The classic examples of polymorphism amd polytypism, in existing or extinct organisms, show that the concept of fossil species, observed in a well-defined period of its lifetime, is no different from that of biological species. The study of the evolution of fossil organisms allow us to understand the modelities of evolution and the mechanisms of speciation here synthesized and fully documented, namely the anagenesis or sequential evolution and the cladogenesis or divergent evoltuion; these mechanisms are the basis of the synthetic or gradualist theory of evolution developed by Dobzhansky, Mayr, Huxley, Rensch and impson. This summary ends with a reference to the theory of punctuated (or intermittent) equilibria proposed by Gould and Eldredge, who presented a more objective interpretation of morphological gaps, considered as elements of evolution itself. The interdisciplinary collaboration between zoologists, geneticists and paleontologists, is compulsory in this domain. Paleozoology has a key role since it conveys the dynamism and depth to the dimension of space-time duality.

Molecular details of INH-C-10 binding to wt KatG and Its S315T mutant

Isoniazid (INH) is still one of the two most effective antitubercular drugs and is included in all recommended multitherapeutic regimens. Because of the increasing resistance of Mycobacterium tuberculosis to INH, mainly associated with mutations in the katG gene, new INH-based compounds have been proposed to circumvent this problem. In this work, we present a detailed comparative study of the molecular determinants of the interactions between wt KatG or its S315T mutant form and either INH or INH-C10, a new acylated INH derivative. MD simulations were used to explore the conformational space of both proteins, and results indicate that the S315T mutation did not have a significant impact on the average size of the access tunnel in the vicinity of these residues. Our simulations also indicate that the steric hindrance role assigned to Asp137 is transient and that electrostatic changes can be important in understanding the enzyme activity data of mutations in KatG. Additionally, molecular docking studies were used to determine the preferred modes of binding of the two substrates. Upon mutation, the apparently less favored docking solution for reaction became the most abundant, suggesting that S315T mutation favors less optimal binding modes. Moreover, the aliphatic tail in INH-C10 seems to bring the hydrazine group closer to the heme, thus favoring the apparent most reactive binding mode, regardless of the enzyme form. The ITC data is in agreement with our interpretation of the C10 alkyl chain role and helped to rationalize the significantly lower experimental MIC value observed for INH-C10. This compound seems to be able to counterbalance most of the conformational restrictions introduced by the mutation, which are thought to be responsible for the decrease in INH activity in the mutated strain. Therefore, INH-C10 appears to be a very promising lead compound for drug development.

Unmixing hyperspectral data: independent and dependent component analysis

The development of high spatial resolution airborne and spaceborne sensors has improved the capability of ground-based data collection in the fields of agriculture, geography, geology, mineral identification, detection [2, 3], and classification [4–8]. The signal read by the sensor from a given spatial element of resolution and at a given spectral band is a mixing of components originated by the constituent substances, termed endmembers, located at that element of resolution. This chapter addresses hyperspectral unmixing, which is the decomposition of the pixel spectra into a collection of constituent spectra, or spectral signatures, and their corresponding fractional abundances indicating the proportion of each endmember present in the pixel [9, 10]. Depending on the mixing scales at each pixel, the observed mixture is either linear or nonlinear [11, 12]. The linear mixing model holds when the mixing scale is macroscopic [13]. The nonlinear model holds when the mixing scale is microscopic (i.e., intimate mixtures) [14, 15]. The linear model assumes negligible interaction among distinct endmembers [16, 17]. The nonlinear model assumes that incident solar radiation is scattered by the scene through multiple bounces involving several endmembers [18]. Under the linear mixing model and assuming that the number of endmembers and their spectral signatures are known, hyperspectral unmixing is a linear problem, which can be addressed, for example, under the maximum likelihood setup [19], the constrained least-squares approach [20], the spectral signature matching [21], the spectral angle mapper [22], and the subspace projection methods [20, 23, 24]. Orthogonal subspace projection [23] reduces the data dimensionality, suppresses undesired spectral signatures, and detects the presence of a spectral signature of interest. The basic concept is to project each pixel onto a subspace that is orthogonal to the undesired signatures. As shown in Settle [19], the orthogonal subspace projection technique is equivalent to the maximum likelihood estimator. This projection technique was extended by three unconstrained least-squares approaches [24] (signature space orthogonal projection, oblique subspace projection, target signature space orthogonal projection). Other works using maximum a posteriori probability (MAP) framework [25] and projection pursuit [26, 27] have also been applied to hyperspectral data. In most cases the number of endmembers and their signatures are not known. Independent component analysis (ICA) is an unsupervised source separation process that has been applied with success to blind source separation, to feature extraction, and to unsupervised recognition [28, 29]. ICA consists in finding a linear decomposition of observed data yielding statistically independent components. Given that hyperspectral data are, in given circumstances, linear mixtures, ICA comes to mind as a possible tool to unmix this class of data. In fact, the application of ICA to hyperspectral data has been proposed in reference 30, where endmember signatures are treated as sources and the mixing matrix is composed by the abundance fractions, and in references 9, 25, and 31–38, where sources are the abundance fractions of each endmember. In the first approach, we face two problems: (1) The number of samples are limited to the number of channels and (2) the process of pixel selection, playing the role of mixed sources, is not straightforward. In the second approach, ICA is based on the assumption of mutually independent sources, which is not the case of hyperspectral data, since the sum of the abundance fractions is constant, implying dependence among abundances. This dependence compromises ICA applicability to hyperspectral images. In addition, hyperspectral data are immersed in noise, which degrades the ICA performance. IFA [39] was introduced as a method for recovering independent hidden sources from their observed noisy mixtures. IFA implements two steps. First, source densities and noise covariance are estimated from the observed data by maximum likelihood. Second, sources are reconstructed by an optimal nonlinear estimator. Although IFA is a well-suited technique to unmix independent sources under noisy observations, the dependence among abundance fractions in hyperspectral imagery compromises, as in the ICA case, the IFA performance. Considering the linear mixing model, hyperspectral observations are in a simplex whose vertices correspond to the endmembers. Several approaches [40–43] have exploited this geometric feature of hyperspectral mixtures [42]. Minimum volume transform (MVT) algorithm [43] determines the simplex of minimum volume containing the data. The MVT-type approaches are complex from the computational point of view. Usually, these algorithms first find the convex hull defined by the observed data and then fit a minimum volume simplex to it. Aiming at a lower computational complexity, some algorithms such as the vertex component analysis (VCA) [44], the pixel purity index (PPI) [42], and the N-FINDR [45] still find the minimum volume simplex containing the data cloud, but they assume the presence in the data of at least one pure pixel of each endmember. This is a strong requisite that may not hold in some data sets. In any case, these algorithms find the set of most pure pixels in the data. Hyperspectral sensors collects spatial images over many narrow contiguous bands, yielding large amounts of data. For this reason, very often, the processing of hyperspectral data, included unmixing, is preceded by a dimensionality reduction step to reduce computational complexity and to improve the signal-to-noise ratio (SNR). Principal component analysis (PCA) [46], maximum noise fraction (MNF) [47], and singular value decomposition (SVD) [48] are three well-known projection techniques widely used in remote sensing in general and in unmixing in particular. The newly introduced method [49] exploits the structure of hyperspectral mixtures, namely the fact that spectral vectors are nonnegative. The computational complexity associated with these techniques is an obstacle to real-time implementations. To overcome this problem, band selection [50] and non-statistical [51] algorithms have been introduced. This chapter addresses hyperspectral data source dependence and its impact on ICA and IFA performances. The study consider simulated and real data and is based on mutual information minimization. Hyperspectral observations are described by a generative model. This model takes into account the degradation mechanisms normally found in hyperspectral applications—namely, signature variability [52–54], abundance constraints, topography modulation, and system noise. The computation of mutual information is based on fitting mixtures of Gaussians (MOG) to data. The MOG parameters (number of components, means, covariances, and weights) are inferred using the minimum description length (MDL) based algorithm [55]. We study the behavior of the mutual information as a function of the unmixing matrix. The conclusion is that the unmixing matrix minimizing the mutual information might be very far from the true one. Nevertheless, some abundance fractions might be well separated, mainly in the presence of strong signature variability, a large number of endmembers, and high SNR. We end this chapter by sketching a new methodology to blindly unmix hyperspectral data, where abundance fractions are modeled as a mixture of Dirichlet sources. This model enforces positivity and constant sum sources (full additivity) constraints. The mixing matrix is inferred by an expectation-maximization (EM)-type algorithm. This approach is in the vein of references 39 and 56, replacing independent sources represented by MOG with mixture of Dirichlet sources. Compared with the geometric-based approaches, the advantage of this model is that there is no need to have pure pixels in the observations. The chapter is organized as follows. Section 6.2 presents a spectral radiance model and formulates the spectral unmixing as a linear problem accounting for abundance constraints, signature variability, topography modulation, and system noise. Section 6.3 presents a brief resume of ICA and IFA algorithms. Section 6.4 illustrates the performance of IFA and of some well-known ICA algorithms with experimental data. Section 6.5 studies the ICA and IFA limitations in unmixing hyperspectral data. Section 6.6 presents results of ICA based on real data. Section 6.7 describes the new blind unmixing scheme and some illustrative examples. Section 6.8 concludes with some remarks.

Vertex component analysis: a geometric-based approach to unmix hyperspectral data

Hyperspectral remote sensing exploits the electromagnetic scattering patterns of the different materials at specific wavelengths [2, 3]. Hyperspectral sensors have been developed to sample the scattered portion of the electromagnetic spectrum extending from the visible region through the near-infrared and mid-infrared, in hundreds of narrow contiguous bands [4, 5]. The number and variety of potential civilian and military applications of hyperspectral remote sensing is enormous [6, 7]. Very often, the resolution cell corresponding to a single pixel in an image contains several substances (endmembers) [4]. In this situation, the scattered energy is a mixing of the endmember spectra. A challenging task underlying many hyperspectral imagery applications is then decomposing a mixed pixel into a collection of reflectance spectra, called endmember signatures, and the corresponding abundance fractions [8–10]. Depending on the mixing scales at each pixel, the observed mixture is either linear or nonlinear [11, 12]. Linear mixing model holds approximately when the mixing scale is macroscopic [13] and there is negligible interaction among distinct endmembers [3, 14]. If, however, the mixing scale is microscopic (or intimate mixtures) [15, 16] and the incident solar radiation is scattered by the scene through multiple bounces involving several endmembers [17], the linear model is no longer accurate. Linear spectral unmixing has been intensively researched in the last years [9, 10, 12, 18–21]. It considers that a mixed pixel is a linear combination of endmember signatures weighted by the correspondent abundance fractions. Under this model, and assuming that the number of substances and their reflectance spectra are known, hyperspectral unmixing is a linear problem for which many solutions have been proposed (e.g., maximum likelihood estimation [8], spectral signature matching [22], spectral angle mapper [23], subspace projection methods [24,25], and constrained least squares [26]). In most cases, the number of substances and their reflectances are not known and, then, hyperspectral unmixing falls into the class of blind source separation problems [27]. Independent component analysis (ICA) has recently been proposed as a tool to blindly unmix hyperspectral data [28–31]. ICA is based on the assumption of mutually independent sources (abundance fractions), which is not the case of hyperspectral data, since the sum of abundance fractions is constant, implying statistical dependence among them. This dependence compromises ICA applicability to hyperspectral images as shown in Refs. [21, 32]. In fact, ICA finds the endmember signatures by multiplying the spectral vectors with an unmixing matrix, which minimizes the mutual information among sources. If sources are independent, ICA provides the correct unmixing, since the minimum of the mutual information is obtained only when sources are independent. This is no longer true for dependent abundance fractions. Nevertheless, some endmembers may be approximately unmixed. These aspects are addressed in Ref. [33]. Under the linear mixing model, the observations from a scene are in a simplex whose vertices correspond to the endmembers. Several approaches [34–36] have exploited this geometric feature of hyperspectral mixtures [35]. Minimum volume transform (MVT) algorithm [36] determines the simplex of minimum volume containing the data. The method presented in Ref. [37] is also of MVT type but, by introducing the notion of bundles, it takes into account the endmember variability usually present in hyperspectral mixtures. The MVT type approaches are complex from the computational point of view. Usually, these algorithms find in the first place the convex hull defined by the observed data and then fit a minimum volume simplex to it. For example, the gift wrapping algorithm [38] computes the convex hull of n data points in a d-dimensional space with a computational complexity of O(nbd=2cþ1), where bxc is the highest integer lower or equal than x and n is the number of samples. The complexity of the method presented in Ref. [37] is even higher, since the temperature of the simulated annealing algorithm used shall follow a log( ) law [39] to assure convergence (in probability) to the desired solution. Aiming at a lower computational complexity, some algorithms such as the pixel purity index (PPI) [35] and the N-FINDR [40] still find the minimum volume simplex containing the data cloud, but they assume the presence of at least one pure pixel of each endmember in the data. This is a strong requisite that may not hold in some data sets. In any case, these algorithms find the set of most pure pixels in the data. PPI algorithm uses the minimum noise fraction (MNF) [41] as a preprocessing step to reduce dimensionality and to improve the signal-to-noise ratio (SNR). The algorithm then projects every spectral vector onto skewers (large number of random vectors) [35, 42,43]. The points corresponding to extremes, for each skewer direction, are stored. A cumulative account records the number of times each pixel (i.e., a given spectral vector) is found to be an extreme. The pixels with the highest scores are the purest ones. N-FINDR algorithm [40] is based on the fact that in p spectral dimensions, the p-volume defined by a simplex formed by the purest pixels is larger than any other volume defined by any other combination of pixels. This algorithm finds the set of pixels defining the largest volume by inflating a simplex inside the data. ORA SIS [44, 45] is a hyperspectral framework developed by the U.S. Naval Research Laboratory consisting of several algorithms organized in six modules: exemplar selector, adaptative learner, demixer, knowledge base or spectral library, and spatial postrocessor. The first step consists in flat-fielding the spectra. Next, the exemplar selection module is used to select spectral vectors that best represent the smaller convex cone containing the data. The other pixels are rejected when the spectral angle distance (SAD) is less than a given thresh old. The procedure finds the basis for a subspace of a lower dimension using a modified Gram–Schmidt orthogonalizati on. The selected vectors are then projected onto this subspace and a simplex is found by an MV T pro cess. ORA SIS is oriented to real-time target detection from uncrewed air vehicles using hyperspectral data [46]. In this chapter we develop a new algorithm to unmix linear mixtures of endmember spectra. First, the algorithm determines the number of endmembers and the signal subspace using a newly developed concept [47, 48]. Second, the algorithm extracts the most pure pixels present in the data. Unlike other methods, this algorithm is completely automatic and unsupervised. To estimate the number of endmembers and the signal subspace in hyperspectral linear mixtures, the proposed scheme begins by estimating sign al and noise correlation matrices. The latter is based on multiple regression theory. The signal subspace is then identified by selectin g the set of signal eigenvalue s that best represents the data, in the least-square sense [48,49 ], we note, however, that VCA works with projected and with unprojected data. The extraction of the end members exploits two facts: (1) the endmembers are the vertices of a simplex and (2) the affine transformation of a simplex is also a simplex. As PPI and N-FIND R algorithms, VCA also assumes the presence of pure pixels in the data. The algorithm iteratively projects data on to a direction orthogonal to the subspace spanned by the endmembers already determined. The new end member signature corresponds to the extreme of the projection. The algorithm iterates until all end members are exhausted. VCA performs much better than PPI and better than or comparable to N-FI NDR; yet it has a computational complexity between on e and two orders of magnitude lower than N-FINDR. The chapter is structure d as follows. Section 19.2 describes the fundamentals of the proposed method. Section 19.3 and Section 19.4 evaluate the proposed algorithm using simulated and real data, respectively. Section 19.5 presents some concluding remarks.

China's space program : a new tool for PRC "soft power" in international relations?

When China launched an anti-satellite (ASAT) weapon in January 2007 to destroy one of its inactive weather satellites, most reactions from academics and U.S. space experts focused on a potential military “space race” between the United States and China. Overlooked, however, is China’s growing role as global competitor on the non-military side of space. China’s space program goes far beyond military counterspace applications and manifests manned space aspirations, including lunar exploration. Its pursuit of both commercial and scientific international space ventures constitutes a small, yet growing, percentage of the global space launch and related satellite service industry. It also highlights China’s willingness to cooperate with nations far away from Asia for political and strategic purposes. These partnerships may constitute a challenge to the United States and enhance China’s “soft power” among key American allies and even in some regions traditionally dominated by U.S. influence (e.g., Latin America and Africa). Thus, an appropriate U.S. response may not lie in a “hard power” counterspace effort but instead in a revival of U.S. space outreach of the past, as well as implementation of more business-friendly export control policies.

The role of Public Health Laboratory in the problem os salmonellosis in São Paulo, Brazil

From 1950 to 1990 a total of 45,862 strains (31,517 isolates from human sources, and 14,345 of non-human origin) were identified at Instituto Adolfo Lutz. No prevalence of any serovars was seen during the period 1950-66 among human sources isolates. Important changing pattern was seen in 1968, when S. Typhimurim surprisingly increased becoming the prevalent serovar in the following decades. During the period of 1970-76, S. Typhimurium represented 77.7% of all serovars of human origin. Significant rise in S. Agona isolation as well as in the number of different serovars among human sources strains were seen in the late 70' and the 80's. More than one hundred different serovars were identified among non-human origin strains. Among serovars isolated from human sources, 74.9%, 15.5%, and 3.7% were recovered from stool, blood, and cerebrospinal fluid cultures, respectively. The outbreak of meningitis by S. Grumpensis in the 60's, emphasizes the concept that any Salmonella serovars can be a cause of epidemics, mainly of the nosocomial origin. This evaluation covering a long period shows the important role of the Public Health Laboratory in the surveillance of salmonellosis, one of the most frequent zoonosis in the world.

An integer programming model for the minimum interval graph completion problem

The minimum interval graph completion problem consists of, given a graph G = ( V, E ), finding a supergraph H = ( V, E ∪ F ) that is an interval graph, while adding the least number of edges |F| . We present an integer programming formulation for solving the minimum interval graph completion problem recurring to a characteri- zation of interval graphs that produces a linear ordering of the maximal cliques of the solution graph.

Minimization of open orders using interval graphs

In this paper we address an order processing optimization problem known as the Minimization of Open Stacks Problem (MOSP). This problem consists in finding the best sequence for manufacturing the different products required by costumers, in a setting where only one product can be made at a time. The objective is to minimize the maximum number of incomplete orders from costumers that are being processed simultaneously. We present an integer programming model, based on the existence of a perfect elimination order in interval graphs, which finds an optimal sequence for the costumers orders. Among other economic advantages, manufacturing the products in this optimal sequence reduces the amount of space needed to store incomplete orders.

Using interval graphs in an order processing optimization problem

In this paper we address an order processing optimization problem known as minimization of open stacks (MOSP). We present an integer pro gramming model, based on the existence of a perfect elimination scheme in interval graphs, which finds an optimal sequence for the costumers orders.

Talk on water ecological economics and participatory watershed governance

Dissertação apresentada para obtenção do Grau de Doutor em Ambiente pela Universidade Nova de Lisboa, Faculdade de Ciências e Tecnologia

Engineering Temporal and Spatial Aspects in OWL using Patterns

WWW is a huge, open, heterogeneous system, however its contents data is mainly human oriented. The Semantic Web needs to assure that data is readable and “understandable” to intelligent software agents, though the use of explicit and formal semantics. Ontologies constitute a privileged artifact for capturing the semantic of the WWW data. Temporal and spatial dimensions are transversal to the generality of knowledge domains and therefore are fundamental for the reasoning process of software agents. Representing temporal/spatial evolution of concepts and their relations in OWL (W3C standard for ontologies) it is not straightforward. Although proposed several strategies to tackle this problem but there is still no formal and standard approach. This work main goal consists of development of methods/tools to support the engineering of temporal and spatial aspects in intelligent systems through the use of OWL ontologies. An existing method for ontology engineering, Fonte was used as framework for the development of this work. As main contributions of this work Fonte was re-engineered in order to: i) support the spatial dimension; ii) work with OWL Ontologies; iii) and support the application of Ontology Design Patterns. Finally, the capabilities of the proposed approach were demonstrated by engineering time and space in a demo ontology about football.

Bridging environmental conflicts with social metabolism : forestry expansion and socioeconomic change

Dissertação apresentada para obtenção do Grau de Doutor em Ciências do Ambiente, pela Universidade Nova de Lisboa, Faculdade de Ciências e Tecnologia

FROM NON-PLACE TO PLACE: A STUDY OF EUROPEAN PUBLIC SPACE AS A SPACE OF IDENTITY

Master Erasmus Mundus Crossways in European Humanities

Catástrofes naturais em saúde pública : impactos e planos de emergência : caso de estudo : São Miguel-Açores

RESUMO - Nos últimos anos, as catástrofes naturais têm sido a causa frequente de problemas de Saúde Pública; além disso representam um sério obstáculo ao desenvolvimento das comunidades atingidas, na medida em que consomem ponderáveis recursos para a mitigação dos danos sofridos. Pode-se dizer que não existe nenhum país que não esteja exposto ao risco de catástrofes naturais, tais como Sismos, Tsunamis, Erupções Vulcânicas, Movimentos de Vertentes, Ciclones Tropicais, Ondas de Frio e de Calor, Secas e Inundações, e como tal, este é um problema global emergente. Como, actualmente, é impossível prever e controlar a ocorrência destes fenómenos, as acções humanas têm de ser direccionadas para a implementação de soluções que possam mitigar e/ou prevenir o seu impacto na sociedade. A integração do lugar, do espaço e do tempo na Saúde Pública, como componentes de investigação relativas aos problemas da população, são uma ferramenta metodológica importante no auxílio do planeamento, monitorização e avaliação das acções em saúde. O que está em causa neste estudo é o pensar, o preparar e o adaptar os nossos territórios e populações a cenários de crise que podem aparecer sem aviso prévio. Este trabalho é, sobretudo, uma forma de pensar e planear o futuro numa lógica de adaptação e valorização do território, construindo referenciais de suporte à acção. Assim, a finalidade deste estudo é contribuir para melhorar/aperfeiçoar a resposta perante novas situações de catástrofe natural, através da percepção e caracterização de situações anteriores de catástrofes naturais a que a Ilha de São Miguel, nos Açores, esteve sujeita nos últimos vinte e seis anos, através da construção e análise de cartas de localização de risco, caracterização da população em risco e da avaliação dos respectivos Planos de Emergência. ---------------------- ABSTRACT - In the last years, the natural disasters have been the frequent cause of Public Health problems and additionally they represent a serious obstacle to the development of the communities affected, in so far as they consume ponderable resources to the mitigation of the damages. It is possible to be said that there is not any country that is not exposed to the risk of natural disasters such as earthquakes, tsunamis, volcanic eruptions, landslides, tropical cyclones, waves of heat and coldness, droughts and floods, and as such, this is an emerging global problem. As it is now impossible to predict and control the occurrence of these phenomena, human actions must be directed to implement solutions that can mitigate and / or prevent their impact on society. The integration of place, space and time on Public Health, as part of research on problems of the population, are an important methodological tool to aid planning, monitoring and evaluation of activities in health. The main issue in this study is to think, prepare and adapt our territories and populations to crisis scenarios that may occur without notice. This work is mainly a way of thinking and planning ahead in a logic of adapting and improving the area, building frameworks to support the action. Thus, the purpose of this study is to contribute to improve / optimize the answer for new natural disaster situations, through the perception and characterization of previous situations of natural catastrophes that the Island of São Miguel, in the Azores, has been subject in the last twenty six years, through the construction and analysis of risk maps, characterization of the population in risk and of the evaluation of the respective Plans of Emergence.

State Space Analysis of Forest Fires

This paper studies forest fires from the perspective of dynamical systems. Burnt area, precipitation and atmospheric temperatures are interpreted as state variables of a complex system and the correlations between them are investigated by means of different mathematical tools. First, we use mutual information to reveal potential relationships in the data. Second, we adopt the state space portrait to characterize the system’s behavior. Third, we compare the annual state space curves and we apply clustering and visualization tools to unveil long-range patterns. We use forest fire data for Portugal, covering the years 1980–2003. The territory is divided into two regions (North and South), characterized by different climates and vegetation. The adopted methodology represents a new viewpoint in the context of forest fires, shedding light on a complex phenomenon that needs to be better understood in order to mitigate its devastating consequences, at both economical and environmental levels.