The consensus algorithm is the core mechanism of blockchain and is used to ensure data consistency among blockchain nodes. The PBFT consensus algorithm is widely used in alliance chains because it is resistant to Byzantine errors. However, the present PBFT (Practical Byzantine Fault Tolerance) still has issues with master node selection that is random and complicated communication. The IBFT consensus technique, which is enhanced, is proposed in this study and is based on node trust value and BLS (Boneh-Lynn-Shacham) aggregate signature. In IBFT, multi-level indicators are used to calculate the trust value of each node, and some nodes are selected to take part in network consensus as a result of this calculation. The master node is chosen from among them based on which node has the highest trust value, it transforms the BLS signature process into the information interaction process between nodes. Consequently, communication complexity is reduced, and node-to-node information exchange remains secure. The simulation experiment findings demonstrate that the IBFT consensus method enhances transaction throughput rate by 61% and reduces latency by 13% when compared to the PBFT algorithm.
Because of vulnerable threats and attacks against database during transmission from sender to receiver, which is one of the most global security concerns of network users, a lightweight cryptosystem using Rivest Cipher 4 (RC4) algorithm is proposed. This cryptosystem maintains data privacy by performing encryption of data in cipher form and transfers it over the network and again performing decryption to original data. Hens, ciphers represent encapsulating system for database tables
Abstract: Data mining is become very important at the present time, especially with the increase in the area of information it's became huge, so it was necessary to use data mining to contain them and using them, one of the data mining techniques are association rules here using the Pattern Growth method kind enhancer for the apriori. The pattern growth method depends on fp-tree structure, this paper presents modify of fp-tree algorithm called HFMFFP-Growth by divided dataset and for each part take most frequent item in fp-tree so final nodes for conditional tree less than the original fp-tree. And less memory space and time.
The quality of drinking water is considered among the most urgent issues worldwide nowadays. Ensuring safe water for human consumption remains the highest priority, while challenges also persist in meeting the water quality needs for industrial and agricultural uses. Most of the relevant studies lack accuracy in assessing water quality. Therefore, this study aims to forecast the quality of drinking water along the Tigris River in Iraq following a new approach. A developed forecasting model that utilizes the gravitational search algorithm (GSA) was deployed. The heuristic optimization tool was utilized for the prediction of the water quality index (WQI) in the research area. Out of twelve water stations, 575 samples were gather
... Show MoreObjective: To determine the effectiveness of an Educational Program in Enhancing Nurse’s Knowledge about Occupational Health Hazards at Medical City Hospitals in Baghdad City.
Methodology: The present study employed a quasi-experimental design held at Medical City Hospitals in Baghdad City. A non-probability sample (convenience sample) consisted of (60) nurse. Data were collected by using a self-report questionnaire which consisted of six parts (a) socio-demographic characteristics (b) physical hazards knowledge (c) chemical hazards knowledge (d) biological hazards knowledge (e) psychological hazards knowledge and (f) mechanical hazards knowledge. Data were analyzed using the statistical packag
... Show More- Epstein, B., and sobel , M. (1954)."Some Thearems Relevant to life Testing from an Exponential population" Annals of Mathematical Statistics, 25, 373 – 381 .
- Epstein, B., and Tsao, C.K.(1953) "Some Tests Based on Order Observation From Two Exponential Populations" Annals of Mathematical Statistics , 24 , 458 – 466 .
- Hogg, R.V. and Tonis, E,A. (1963), "An Iterated procedure for Testing the Equality of several Exponential Distributions" Journal of the American Statistical Association, 58 , 435 – 443.
- Kumar, S. , and patel , H. I. (1971) "ATest for the Comparision of two Exponential Disributions" Technometrics , 13 , 183 – 189 .<
Most recognition system of human facial emotions are assessed solely on accuracy, even if other performance criteria are also thought to be important in the evaluation process such as sensitivity, precision, F-measure, and G-mean. Moreover, the most common problem that must be resolved in face emotion recognition systems is the feature extraction methods, which is comparable to traditional manual feature extraction methods. This traditional method is not able to extract features efficiently. In other words, there are redundant amount of features which are considered not significant, which affect the classification performance. In this work, a new system to recognize human facial emotions from images is proposed. The HOG (Histograms of Or
... Show MoreThis paper focuses on developing a self-starting numerical approach that can be used for direct integration of higher-order initial value problems of Ordinary Differential Equations. The method is derived from power series approximation with the resulting equations discretized at the selected grid and off-grid points. The method is applied in a block-by-block approach as a numerical integrator of higher-order initial value problems. The basic properties of the block method are investigated to authenticate its performance and then implemented with some tested experiments to validate the accuracy and convergence of the method.
Identification of complex communities in biological networks is a critical and ongoing challenge since lots of network-related problems correspond to the subgraph isomorphism problem known in the literature as NP-hard. Several optimization algorithms have been dedicated and applied to solve this problem. The main challenge regarding the application of optimization algorithms, specifically to handle large-scale complex networks, is their relatively long execution time. Thus, this paper proposes a parallel extension of the PSO algorithm to detect communities in complex biological networks. The main contribution of this study is summarized in three- fold; Firstly, a modified PSO algorithm with a local search operator is proposed
... Show MoreIn this paper, we present new algorithm for the solution of the nonlinear high order multi-point boundary value problem with suitable multi boundary conditions. The algorithm is based on the semi-analytic technique and the solutions are calculated in the form of a rapid convergent series. It is observed that the method gives more realistic series solution that converges very rapidly in physical problems. Illustrative examples are provided to demonstrate the efficiency and simplicity of the proposed method in solving this type of multi- point boundary value problems.