Predicting and Modeling Wildfire Propagation Areas with BAT and Maximum-State PageRank

The nature and characteristics of free-burning wildland fires have significant economic, safety, and environmental impacts. Additionally, the increase in global warming has led to an increase in the number and severity of wildfires. Hence, there is an increasing need for accurately calculating the probability of wildfire propagation in certain areas. In this study, we firstly demonstrate that the landscapes of wildfire propagation can be represented as a scale-free network, where the wildfire is modeled as the scale-free network whose degree follows the power law. By establishing the state-related concepts and modifying the Binary-Addition-Tree (BAT) together with the PageRank, we propose a new methodology to serve as a reliable tool in predicting the probability of wildfire propagation in certain areas. Furthermore, we demonstrate that the proposed maximum-state PageRank used in the methodology can be implemented separately as a fast, simple, and effective tool in identifying the areas that require immediate protection. The proposed methodology and maximum-state PageRank are validated in the example generated from the Barabási-Albert model in the study.

Binary-Addition Tree Algorithm-Based Resilience Assessment for Binary-State Network Problems

Applications in real life are composed of different kinds of network systems; these networks may be interfered by uncontrollable or unpredictable disruptive events involving natural disasters, human errors, evil-intentioned attacks, or other disturbances. Any of these disruptive events will cause networks to malfunction and possibly result in large economic losses. As a result, it is important to assess network resilience which is a measure to describe how a network system recovers its performance and functionality to a satisfactory level from a disruptive event. Inspired by the measures of reliability evaluation used in binary-state networks, this paper proposes a binary-addition tree algorithm-based resilience assessment for binary-state networks and applies it on a wildfire network with wireless sensors. Considering the stochastic nature of disruptive events, the proposed binary-addition tree algorithm-based resilience assessment comprehensively enumerates all the possible disruptive events and all the corresponding recovery strategies, and then calculate the network resilience. Furthermore, recovery cost limit is concerned in this paper for decision makers who choose the recovery strategies with their recovery cost limit and resilience requirement.

Áreas de Potencial Arqueológico na Região do Médio Tejo: Modelo Espacial Preditivo

This article presents the results of the construction of an Archaeological Predictive Spatial Model based on the analysis of a set of variables. The main objective of this study is to identify areas of archaeological potential for archaeological exploration, for the Médio Tejo Region. This areas are more likely to occur in new sites, through the application of predictive spatial models, starting from a base of geographic data from archaeological sites compiled and updated in their various chronologies, and modeled through Geographic Information Systems, within the framework of the MTAS research project, supported by FCT. Thus, through an essentially statistical, descriptive and univariate methodology and using two methods - the method of binary addition and the method of weights - the areas with potential for prospecting new archaeological sites were obtained for the Médio Tejo Region.

Symmetric Transparent Online Bist and Repair of Memories

During regular testing Symmetric transparent BIST and Repair programme of RAM modules satisfy the memory contents conservation during similar time bouncing and signature prediction part is needed in transparent BIST programme which achieves considerable limiting in test time. In this study adders incorporated with binary addition is suggested for the utilization of accumulator modules. A symmetric Transparency march c primarily based algorithmic rule for constitutional self-repair (BISR) programme is recommended for multiple embedded reminiscences to realize best purpose of the performance of BISR for multiple embedded memories.

Bit wise and delay of vedic multiplier

The Vedic multiplier is derived from the ancient mathematics called Vedic mathematics .The ancient mathematics has different sutras in that we use Urdhva Tiryagbhyam sutra which means clock wise and vertically . As we know that binary multiplication is not possible so that instead we use binary addition or subtraction instead of it. The key process for the multiplication is the speed of the processor. The fastest mode of multiplication is the Vedic multiplier. In this paper we want to show the delay and utilization of components available for the multiplier by executing the code. The comparison of delay from some papers was also proposed in this paper. The research is going on the Vedic mathematics to overcome the problems on the conventional mathematics. In future Vedic multiplier plays an important role in the DSP (Digital Signal Processing).As it is the fastest and efficient mode of operation. In this paper I am calculating the bit wise delay up to 32-bit. The whole analysis was done in Xilinx. The ISM wave forms for every bit up to 32-bit was to be obtained. The utilization, used, available, utilized analysis was also taken. The whole process was done in XILINX software.