Utilizing natural resources wisely, reducing pollution, and taking other environmental factors into account are now critical to the prospects for long-term economic growth and, by extension, sustainable development. We investigate impact of total resource rents (NRR) on India’s GDP in this study. The data sample consists NRR from World Bank’s official website collected between 1993 2020. In stu...

This study examines the relationship between renewable energy consumption, poverty alleviation and economic growth in South Africa. The paper applies Autoregressive distributed lag (ARDL) model to examine long run Vector Error Correction Model (VECM) determine direction of causality variables. Quarterly data is used for period 1990 – 2018. findings established a presence poverty, growth, financ...

Semantic part localization can facilitate fine-grained categorization by explicitly isolating subtle appearance differences associated with specific object parts. Methods for pose-normalized representations have been proposed, but generally presume bounding box annotations at test time due to the difficulty of object detection. We propose a model for fine-grained categorization that overcomes t...

We present improvements to branch and bound techniques for globally optimizing functions with Lipschitz continuity properties by developing novel bounding procedures and parallelisation strategies. The bounding procedures involve nonconvex quadratic or cubic lower bounds on the objective and use estimates of the spectrum of the Hessian or derivative tensor, respectively. As the nonconvex lower ...

In this paper we consider the non-preemptive variant of a multi-mode resource constrained project scheduling problem (MRCPSP) with mode identity, in which a set of project activities is partitioned into disjoint subsets while all activities forming one subset have to be processed in the same mode. We present a depth-first branch and bound algorithm for the resource constrained project schedulin...

in this paper, the security of a distance bounding protocol is analyzed which has been recently proposed by jannati and falahati (so-called jf). we prove that an adversary can recover key bits of jf protocol with probability of “1” while the complexity of attack is “2n” runs of protocol. in addition, we propose an improved protocol and prove that the improved protocol is resistant to mafia frau...