The impact of Jurisprudence Rules in Addressing Contemporary security Challenges

Islamic jurisprudence is related to various fields of knowledge, as it is a science of great value, great in impact, and among the most prominent features of jurisprudence comes the jurisprudence rules. It regulates the principles of the doctrine for the jurist. Therefore, the main this research focuses on (the impact of jurisprudence rules in addressing contemporary security challenges). It is the relationship between jurisprudence rules and achieving security. Its fruit would be a statement of the distinguished impact of jurisprudence rules on the stability of the country, and its leading role in maintaining, strengthening, and pre

Nurse scheduling problem is one of combinatorial optimization problems and it is one of NP-Hard problems which is difficult to be solved as optimal solution. In this paper, we had created an proposed algorithm which it is hybrid simulated annealing algorithm to solve nurse scheduling problem, developed the simulated annealing algorithm and Genetic algorithm. We can note that the proposed algorithm (Hybrid simulated Annealing Algorithm(GS-h)) is the best method among other methods which it is used in this paper because it satisfied minimum average of the total cost and maximum number of Solved , Best and Optimal problems. So we can note that the ratios of the optimal solution are 77% for the proposed algorithm(GS-h), 28.75% for Si

     Fuzzy C-means (FCM) is a clustering method used for collecting similar data elements within the group according to specific measurements. Tabu is a heuristic algorithm. In this paper, Probabilistic Tabu Search for FCM implemented to find a global clustering based on the minimum value of the Fuzzy objective function. The experiments designed for different networks, and cluster’s number the results show the best performance based on the comparison that is done between the values of the objective function in the case of using standard FCM and Tabu-FCM, for the average of ten runs.

The OSPF cost is proportionally indicated the transmitting packet overhead through a certain interface and inversely proportional to the interface bandwidth. Thus, this cost may minimized by direct packet transmitting to the other side via various probable paths simultaneously. Logically, the minimum weight path is the optimum path. This paper propose a novel Fuzzy Artificial Neural Network to create Smart Routing Protocol Algorithm. Consequently, the Fuzzy Artificial Neural Network Overlap has been reduced from (0.883 ms) to (0.602 ms) at fuzzy membership 1.5 to 4.5 respectively. This indicated the transmission time is two-fold faster than the standard overlapping time (1.3 ms).

Data centric techniques, like data aggregation via modified algorithm based on fuzzy clustering algorithm with voronoi diagram which is called modified Voronoi Fuzzy Clustering Algorithm (VFCA) is presented in this paper. In the modified algorithm, the sensed area divided into number of voronoi cells by applying voronoi diagram, these cells are clustered by a fuzzy C-means method (FCM) to reduce the transmission distance. Then an appropriate cluster head (CH) for each cluster is elected. Three parameters are used for this election process, the energy, distance between CH and its neighbor sensors and packet loss values. Furthermore, data aggregation is employed in each CH to reduce the amount of data transmission which le

Blogging is about more than just putting thoughts on a web; it's about connecting with and hearing from anyone who read the work. Many web sites now days help to get a free account to quick post thoughts and photos interact with people, and more. The fastest way to understand blogging is to try it out, but in that case securing the blog is important, by including authentication schemes. In this paper we suggest implications of our research for improving the design and usefulness of blogging systems, and also we divided the blogs depending on the subject and need, which are either to be used in public or only used by small group, so we can suggest different steps for securing the blogs.

In recent years, due to the economic benefits and technical advances of cloud
computing, huge amounts of data have been outsourced in the cloud. To protect the
privacy of their sensitive data, data owners have to encrypt their data prior
outsourcing it to the untrusted cloud servers. To facilitate searching over encrypted
data, several approaches have been provided. However, the majority of these
approaches handle Boolean search but not ranked search; a widely accepted
technique in the current information retrieval (IR) systems to retrieve only the top–k
relevant files. In this paper, propose a distributed secure ranked search scheme over
the encrypted cloud servers. Such scheme allows for the authorized user to

The principal goal guiding any designed encryption algorithm must be security against unauthorized attackers. Within the last decade, there has been a vast increase in the communication of digital computer data in both the private and public sectors. Much of this information has a significant value; therefore it does require the protection by design strength algorithm to cipher it. This algorithm defines the mathematical steps required to transform data into a cryptographic cipher and also to transform the cipher back to the original form. The Performance and security level is the main characteristics that differentiate one encryption algorithm from another. In this paper suggested a new technique to enhance the performance of the Data E

     The traveling salesman problem is addressed in this paper by introducing a distributed multi-ant colony algorithm that is implemented on a Raspberry Pi cluster. The implementation of a master and eight workers, each running on Raspberry Pi nodes, is the central component of this novel technique. Each worker is responsible for managing their own colony of ants, while the master coordinates communications among workers’ nodes and assesses the most optimal approach. To put the newly built cluster through its paces, several datasets of traveling salesman problem are used to test the created cluster. The findings of the experiment indicate that a single board computer cluster, which makes use of multi-ant colony algorithm, is a via