Marluce C. Scarabello
Current Organizations / Institutes
The organizations/institutes from the scholar's latest article
Research Subjects
Marluce C. Scarabello has a total of 21 co-authors. Here are the top co-authors by number of shared publications:
- Fernando Manuel Ramos
Natl Inst Space Res, Sao Jose Dos Campos, Brazil
4 shared publications - Aline C. Soterroni
Laboratory of Computing and Applied Mathematics, National Institute for Space Research, São José dos Campos, Brazil
2 shared publications - Roberto Luiz Galski
Satellite Tracking and Control Center, National Institute for Space Research, São José dos Campos, Brazil
2 shared publications - Adriano Venturieri
Embrapa Amazônia Oriental
1 shared publication - Alexandre Camargo Coutinho
Marinha do Brasil
1 shared publication - Aline Cristina Soterroni
Laboratory of Computing and Applied Mathematics, National Institute for Space Research (INPE), São José dos Campos, SP, Brazil
1 shared publication
Latest Publications
- Open Access
- 21 March 2023
- Published by MDPI AG in Preprints.org
Forest restoration challenges in Brazilian Amazonia
In its Nationally Determined Contribution (NDC) to the United Nations Framework Convention on Climate Change, Brazil committed to reducing greenhouse gas emissions and restoring its forests. This study examines the challenges of fulfilling these commitments in Brazilian Amazonia. We carry out a detailed assessment of the current status of land tenure in the region and its relation to deforestation. After dealing with conflicts and overlaps between data from various sources, we produce a new map of public and private land tenure in Amazonia. Combining this map with Brazil's official data on deforestation, we find out how much natural vegetation has been preserved in each public or private area. The result is used to estimate how much deforestation is illegal. We also establish how much deforestation is associated with each land tenure type. Our results show that most deforestation inside rural properties is done by a few landowners, a finding that has important consequences for law enforcement. We then assess the challenges for reforestation in detail. To do so, we consider how much forest needs to be rehabilitated according to Brazil's Forest Code. Our analysis provides a comprehensive appraisal of the potential opportunity costs for forest restoration in the biome, considering farm size and land use. This analysis provides insights into targeted land use policies that can meet Brazil’s forest restoration goals.
- 21 March 2023
- Published by MDPI AG in Preprints.org
Open AccessForest restoration challenges in Brazilian Amazonia
In its Nationally Determined Contribution (NDC) to the United Nations Framework Convention on Climate Change, Brazil committed to reducing greenhouse gas emissions and restoring its forests. This study examines the challenges of fulfilling these commitments in Brazilian Amazonia. We carry out a detailed assessment of the current status of land tenure in the region and its relation to deforestation. After dealing with conflicts and overlaps between data from various sources, we produce a new map of public and private land tenure in Amazonia. Combining this map with Brazil's official data on deforestation, we find out how much natural vegetation has been preserved in each public or private area. The result is used to estimate how much deforestation is illegal. We also establish how much deforestation is associated with each land tenure type. Our results show that most deforestation inside rural properties is done by a few landowners, a finding that has important consequences for law enforcement. We then assess the challenges for reforestation in detail. To do so, we consider how much forest needs to be rehabilitated according to Brazil's Forest Code. Our analysis provides a comprehensive appraisal of the potential opportunity costs for forest restoration in the biome, considering farm size and land use. This analysis provides insights into targeted land use policies that can meet Brazil’s forest restoration goals.
- 1 June 2016
- Published by Elsevier in European Journal of Operational Research
- Vol. 251 (3) , 727-738
Global optimization using q-gradients
- 1 June 2016
- Published by Elsevier in European Journal of Operational Research
- Vol. 251 (3) , 727-738
Global optimization using q-gradients
- Open Access
- 28 October 2015
- Published by Springer Nature in SpringerPlus
- Vol. 4 (1) , 1-15
The q-G method
In this work, the q-Gradient (q-G) method, a q-version of the Steepest Descent method, is presented. The main idea behind the q-G method is the use of the negative of the q-gradient vector of the objective function as the search direction. The q-gradient vector, or simply the q-gradient, is a generalization of the classical gradient vector based on the concept of Jackson’s derivative from the q-calculus. Its use provides the algorithm an effective mechanism for escaping from local minima. The q-G method reduces to the Steepest Descent method when the parameter q tends to 1. The algorithm has three free parameters and it is implemented so that the search process gradually shifts from global exploration in the beginning to local exploitation in the end. We evaluated the q-G method on 34 test functions, and compared its performance with 34 optimization algorithms, including derivative-free algorithms and the Steepest Descent method. Our results show that the q-G method is competitive and has a great potential for solving multimodal optimization problems.
- 28 October 2015
- Published by Springer Nature in SpringerPlus
- Vol. 4 (1) , 1-15
Open AccessThe q-G method
In this work, the q-Gradient (q-G) method, a q-version of the Steepest Descent method, is presented. The main idea behind the q-G method is the use of the negative of the q-gradient vector of the objective function as the search direction. The q-gradient vector, or simply the q-gradient, is a generalization of the classical gradient vector based on the concept of Jackson’s derivative from the q-calculus. Its use provides the algorithm an effective mechanism for escaping from local minima. The q-G method reduces to the Steepest Descent method when the parameter q tends to 1. The algorithm has three free parameters and it is implemented so that the search process gradually shifts from global exploration in the beginning to local exploitation in the end. We evaluated the q-G method on 34 test functions, and compared its performance with 34 optimization algorithms, including derivative-free algorithms and the Steepest Descent method. Our results show that the q-G method is competitive and has a great potential for solving multimodal optimization problems.
- Open Access
- 25 August 2015
- Published by Brazilian Society for Computational and Applied Mathematics (SBMAC)
- Vol. 3 (1)
Método q-GC: uma generalização do método dos gradientes conjugados
Recentemente, baseado na derivada de Jackson, foi proposta uma generalização do método da máxima descida, denominada método do q-gradiente (q-G), para problemas de otimização global contínua. Dentro desse contexto, este trabalho apresenta uma generalização do método dos gradientes conjugados (q-GC) com base no conceito do vetor q-gradiente. Para avaliar o desempenho do método q-GC foram considerados os resultados obtidos pelo método q-G e por três Algoritmos Genéticos (AGs) para um conjunto de seis funções teste de 20 variáveis e mesmo critério de parada. No geral, os resultados mostram que o q-GC ´e um método promissor para solução de problemas de otimização multimodais.
- 25 August 2015
- Published by Brazilian Society for Computational and Applied Mathematics (SBMAC)
- Vol. 3 (1)
Open AccessMétodo q-GC: uma generalização do método dos gradientes conjugados
Recentemente, baseado na derivada de Jackson, foi proposta uma generalização do método da máxima descida, denominada método do q-gradiente (q-G), para problemas de otimização global contínua. Dentro desse contexto, este trabalho apresenta uma generalização do método dos gradientes conjugados (q-GC) com base no conceito do vetor q-gradiente. Para avaliar o desempenho do método q-GC foram considerados os resultados obtidos pelo método q-G e por três Algoritmos Genéticos (AGs) para um conjunto de seis funções teste de 20 variáveis e mesmo critério de parada. No geral, os resultados mostram que o q-GC ´e um método promissor para solução de problemas de otimização multimodais.