Due to the limited availability of natural resources, it is essential that agricultural productivity keep pace with population growth. Despite unfavorable weather circumstances, this project's major objective is to boost production. As a consequence of technological advancements in agriculture, precision farming as a way for enhancing crop yields is gaining appeal and becoming more prevalent. When it comes to predicting future data, machine learning employs a number of methods, including the creation of models and the acquisition of prediction rules based on past data. In this manuscript, we examine various techniques to machine learning, as well as an automated agricultural yield projection model based on selecting the most relevant features. For the purpose of selecting features, the Grey Level Co-occurrence Matrix method is utilised. For classification, we make use of the AdaBoost Decision Tree, Artificial Neural Network (ANN), and K-Nearest Neighbour (KNN) algorithms. The data set that was used in this study is simply a compilation of information about a variety of topics, including yield, pesticide use, rainfall, and average temperature. This data collection consists of 33 characteristics or qualities in total. The crops soya beans, maze, potato, rice, paddy, wheat, and sorghum are included in this data collection. This data collection was made possible through the collaboration of the Food and Agriculture Organisation (FAO) and the World Data Bank, both of which make their data available to the public. The AdaBoost decision tree has achieved the highest level of accuracy possible when used to anticipate agricultural yield. Both the accuracy rate and the recall rate are quite high at 99 percent.

The IoT networks for implementing mission-critical applications need a layer to effect remote communication between the cluster heads and the microcontrollers. Remote communication is affected through base stations using cellular technologies. Using a single base station in this layer is risky as the fault tolerance level of the network will be zero when the base stations break down. Generally, the cluster heads are within the base station spectrum, making seamless integration possible. Implementing a dual base station to cater for a breakdown of the first base station creates huge remoteness as the cluster heads are not within the spectrum of the second base station. Furthermore, using the remote base station involves huge latency affecting the performance of the IoT network. In this paper, a relay-based network is presented with intelligence to fetch the shortest path for communicating to reduce latency and sustain the fault tolerance capability of the IoT network. The results demonstrate that the technique improved the fault tolerance of the IoT network by 14.23%.

Most IoT systems designed for the implementation of mission-critical systems are multi-layered. Much of the computing is done in the service and gateway layers. The gateway layer connects the internal section of the IoT to the cloud through the Internet. The failure of any node between the servers and the gateways will isolate the entire network, leading to zero tolerance. The service and gateway layers must be connected using networking topologies to yield 100% fault tolerance. The empirical formulation of the model chosen to connect the service’s servers to the gateways through routers is required to compute the fault tolerance of the network. A rectangular and interstitial mesh have been proposed in this paper to connect the service servers to the gateways through the servers, which yields 0.999 fault tolerance of the IoT network. Also provided is an empirical approach to computing the IoT network’s fault tolerance. A rectangular and interstitial mesh have been implemented in the network’s gateway layer, increasing the IoT network’s ability to tolerate faults by 11%.

With the advent of several new means of communication, safeguarding the confidentiality of messages has become more crucial. Financial institutions, virtual currencies, and government organizations are all examples of high-risk contexts where information exchanges need particular care. The importance of data security in preventing unauthorized access to data is emphasized. Several cryptographic methods for protecting the secrecy and integrity of data were compared. In this research, the proposed work includes a new Turbo Code-based encryption algorithm. The Turbo encoder’s puncturing process is controlled by a secret key, and a typical random sequence is generated to encrypt the data and fix any mistakes. Key generation utilizing pre-existing data eliminates the requirement for sending keys over a secure channel. Using recurrence relations and the Lower–Upper (LU) decomposition method, the presented study suggests a novel approach to message encryption and decryption. The resulting encrypted grayscale image has a very high level of security, with an entropy of 7.999, a variation from perfection of 0.0245, and a correlation of 0.0092 along the diagonal, 0.0009 along the horizontal, and −0.0015 along the vertical. Directly decrypted pictures have a Peak Signal-to-Noise Ratio (PSNR) of 56.22 dB, but the suggested approach only manages an embedding capacity of 0.5 bpp (bits per pixel). This may be achieved by decreasing the size of the location map by only 0.02 bpp.

Many data mining studies have focused on mining positive associations among frequent and regular item sets. However, none have considered time and regularity bearing in mind such associations. The frequent and regular item sets will be huge, even when regularity and frequency are considered without any time consideration. Negative associations are equally important in medical databases, reflecting considerable discrepancies in medications used to treat various disorders. It is important to find the most effective negative associations. The mined associations should be as small as possible so that the most important disconnections can be found. This paper proposes a mining method that mines medical databases to find regular, frequent, closed, and maximal item sets that reflect minimal negative associations. The proposed algorithm reduces the negative associations by 70% when the maximal and closed properties have been used, considering any sample size, regularity, or frequency threshold.

The main channel for disseminating information is now the Internet. Users have different expectations for the calibre of websites regarding the posted and presented content. The WEB site's quality is influenced by up to 120 factors, each represented by two to fifteen attributes. A major challenge is quantifying the features and evaluating the quality of a website based on the feature counts. One of the aspects that determines a website's quality is its completeness, which focuses on the existence of all the objects and their connections with one another. It isn’t easy to build an expert model based on feature counts to evaluate website quality, so this paper has focused on that challenge. Both a methodology for calculating a website's quality and a parser-based approach for measuring feature counts are offered. We provide a multi-layer perceptron model that is an expert model for forecasting website quality from the "Completeness" perspective. The accuracy of the predictions is 98%, whilst the accuracy of the nearest model is 87%.