Forest fires are a serious ecological concern, and smoke is an early warning indicator. Early smoke images barely capture a tiny portion of the total smoke. Because of the irregular nature of smoke’s dispersion and the dynamic nature of the surrounding environment, smoke identification is complicated by minor pixel-based traits. This study presents a new framework that decreases the sensitivity of various YOLO detection models. Additionally, we compare the detection performance and speed of different YOLO models such as YOLOv3, YOLOv5, and YOLOv7 with prior ones such as Fast R-CNN and Faster R-CNN. Moreover, we follow the use of a collected dataset that describes three distinct detection areas, namely close, medium, and far distance, to identify the detection model’s ability to recognize smoke targets correctly. Our model outperforms the gold-standard detection method on a multi-oriented dataset for detecting forest smoke by an mAP accuracy of 96.8% at an IoU of 0.5 using YOLOv5x. Additionally, the findings of the study show an extensive improvement in detection accuracy using several data-augmentation techniques. Moreover, YOLOv7 outperforms YOLOv3 with an mAP accuracy of 95%, compared to 94.8% using an SGD optimizer. Extensive research shows that the suggested method achieves significantly better results than the most advanced object-detection algorithms when used on smoke datasets from wildfires, while maintaining a satisfactory performance level in challenging environmental conditions.

Given n unit execution time (UET) tasks whose precedence constraints form a directed acyclic graph, the arcs are associated with unit communication time (UCT) delays. The problem is to schedule the tasks on two identical processors in order to minimize the makespan. Several polynomial algorithms in the literature are proposed for special classes of digraphs, but the complexity of solving this problem in general case is still a challenging open question. We present in this paper an O(n) time algorithm to compute an optimal schedule for the class of bipartite digraphs of depth one.

The Internet of Things (IoT) has enabled a wide range of sectors to interact effectively with their consumers in order to deliver seamless services and products. Despite the widespread availability of (IoT) devices and their Internet connectivity, they have a low level of information security integrity. A number of security methods were proposed and evaluated in our research, and comparisons were made in terms of energy and time in the encryption and decryption processes. A ratification procedure is also performed on the devices in the main manager, which is regarded as a full firewall for IoT devices. The suggested algorithm's success has been shown utilizing low-cost Adriano Uno and Raspberry Pi devices. Arduous Uno has been used to demonstrate the encryption process in low-energy devices using a variety of algorithms, including Enhanced Algorithm for Data Integrity and Authentication (EDAI) and raspberry, which serves as a safety manager in low-energy device molecules. A variety of enhanced algorithms used in conjunction with Blockchain software have also assured the security and integrity of the information. These findings and discussions are presented at the conclusion of the paper.

The bipartite Star123-free graphs were introduced by V. Lozin in [1] to generalize some already known classes of bipartite graphs. In this paper, we extend to bipartite Star123-free graphs a linear time algorithm of J. L. Fouquet, V. Giakoumakis and J. M. Vanherpe for finding a maximum matching in bipartite Star123, P7-free graphs presented in [2]. Our algorithm is a solution of Lozin's conjecture.

Given 𝒏 unit execution time (UET) tasks whose precedence constraints form a directed acyclic graph (DAG), the arcs are associated with unit communication time (UCT) delays. The problem is to schedule the tasks on two processors in order to minimize the makespan. Several polynomial algorithms in the literature are proposed for special classes of digraphs, but the complexity of solving this problem in general case stills a challenging open question. We propose in this paper a linear time algorithm to compute an optimal schedule for the class of DAGs of depth two.

A 2-coloring of a hypergraph is a mapping from its vertex set to a set of two colors such that no edge is monochromatic. The hypergraph 2- Coloring Problem is the question whether a given hypergraph is 2-colorable. It is known that deciding the 2-colorability of hypergraphs is NP-complete even for hypergraphs whose hyperedges have size at most 3. In this paper, we present a polynomial time algorithm for deciding if a hypergraph, whose incidence graph is P_8-free and has a dominating set isomorphic to C_8, is 2-colorable or not. This algorithm is semi generalization of the 2-colorability algorithm for hypergraph, whose incidence graph is P_7-free presented by Camby and Schaudt.