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.
Quantum channels enable the achievement of communication tasks inaccessible to their
classical counterparts. The most famous example is the distribution of secret keys. Unfortunately, the rate
of generation of the secret key by direct transmission is fundamentally limited by the distance. This limit
can be overcome by the implementation of a quantum repeater. In order to boost the performance of the
repeater, a quantum repeater based on cut-off with two different types of quantum memories is suggestd,
which reduces the effect of decoherence during the storage of a quantum state.
This work aims to see the positive association rules and negative association rules in the Apriori algorithm by using cosine correlation analysis. The default and the modified Association Rule Mining algorithm are implemented against the mushroom database to find out the difference of the results. The experimental results showed that the modified Association Rule Mining algorithm could generate negative association rules. The addition of cosine correlation analysis returns a smaller amount of association rules than the amounts of the default Association Rule Mining algorithm. From the top ten association rules, it can be seen that there are different rules between the default and the modified Apriori algorithm. The difference of the obta
... Show More This paper describes the application of consensus optimization for Wireless Sensor Network (WSN) system. Consensus algorithm is usually conducted within a certain number of iterations for a given graph topology. Nevertheless, the best Number of Iterations (NOI) to reach consensus is varied in accordance with any change in number of nodes or other parameters of . graph topology. As a result, a time consuming trial and error procedure will necessary be applied
to obtain best NOI. The implementation of an intellig ent optimization can effectively help to get the optimal NOI. The performance of the consensus algorithm has considerably been improved by the inclusion of Particle Swarm Optimization (PSO). As a case s
|
مجلة العلوم الاقتصادية والإدارية المجلد 18 العدد 69 الصفحات 318- 332 |
This play is written in 1932 by Lynn Riggs who is half Cherokee. The play is set in Claremore Mound, Oklahoma almost a century after the Trail of Tears. Riggs presents mixed- blood, young Cherokees to portray a post-colonial state of spiritual loss and disruption of traditional community ties. The new generation lives in darkness, and the title of the play tells about the dramatist's view that night comes to his Cherokee Nation. The Indian ghost is one of the play’s characters. It is an Indian ghost of a warrior. It comes to remind Cherokees of their heritage and traditions. The ghost sees the new generation as nothing as ghosts because they are neither good for themselves nor for their nation. This paper is important as it discu
... Show MoreA demonstration of the inverse kinematics is a very complex problem for redundant robot manipulator. This paper presents the solution of inverse kinematics for one of redundant robots manipulator (three link robot) by combing of two intelligent algorithms GA (Genetic Algorithm) and NN (Neural Network). The inputs are position and orientation of three link robot. These inputs are entering to Back Propagation Neural Network (BPNN). The weights of BPNN are optimized using continuous GA. The (Mean Square Error) MSE is also computed between the estimated and desired outputs of joint angles. In this paper, the fitness function in GA is proposed. The sinwave and circular for three link robot end effecter and desired trajectories are simulated b
... Show MoreMany of researchers have written about social responsibility and business strategy and competitive advantage, and they have given particular attention to the relationship between economic and social responsibility , but what is missing in this aspect is how the economic units that use their core competencies to advance social responsibility initiatives so that they can achieve a significant competitive advantage and create value for it ?
The current research aims to verify the view that "the economic and social objectives in the long term is not contradictory in nature but complementary objectives essential", as well as make sure that the s
... Show MoreResearch summary
Today, the Islamic nation is going through a phase that is one of the most dangerous that it has never experienced before. This phase was characterized by the following:
The nation is divided into states and its weakness in most of its doctrinal, political, social, economic and moral aspects.
Enemies targeting the nation's faith and capabilities, and the emergence of loyalty to the enemies of the nation from some groups of society, spreading misconceptions in the Muslim community.
Spreading the spirit of rebellion in all segments of society and striving to stir up the people against the rulers and put pressure on the rulers.
All these manifestations and others require the nation's wise men
... Show MoreThe problem of Bi-level programming is to reduce or maximize the function of the target by having another target function within the constraints. This problem has received a great deal of attention in the programming community due to the proliferation of applications and the use of evolutionary algorithms in addressing this kind of problem. Two non-linear bi-level programming methods are used in this paper. The goal is to achieve the optimal solution through the simulation method using the Monte Carlo method using different small and large sample sizes. The research reached the Branch Bound algorithm was preferred in solving the problem of non-linear two-level programming this is because the results were better.
Praise be to Allah and peace and blessings be upon our Prophet Muhammad and on his family and companions
Yet,
The prophets (peace be upon them) urged all thevalues and one of these is the value of work which is of a great importance, that all nations have gathered against us as the eaters gather at a bowl. One of the reasons of our weakness and the strength of our enemy is that we have neglected the value of work. And rather a large number of ignorant and uneducatedpeople started to believe that the means of living, triumph, gaining power, and establishing a civilization are given by Allah with neithergainingnoreffort from us. While we find in the past that Allah the Almighty narrated to us the story of Mary (Peace be upon her) and