Number theorists believe that primes play a central role in Number theory and that solving problems related to primes could lead to the resolution of many other unsolved conjectures, including the prime k-tuples conjecture. This paper aims to demonstrate the existence of this conjecture for admissible k-tuples in a positive proportion. The authors achieved this by refining the methods of “Goldston, Pintz and Yildirim” and “James Maynard” for studying bounded gaps between primes and prime k-tuples. These refinements enabled to overcome the previous limitations and restrictions and to show that for a positive proportion of admissible k-tuples, there is the existence of the prime k-tuples conjecture holding for each “k”. The significance of this result is that it is unconditional which means it is proved without assuming any form of strong conjecture like the Elliott–Halberstam conjecture
The research aims to develop physical exercises with auxiliary training tools that work to develop the explosive power of the arms and legs, and then find out their effect on the accuracy of shooting from free throw and correction from jumping of advanced basketball players, as the researchers found a problem that these players have weakness in the skill of throwing Free throwing and shooting by jumping calculated with two points as a result of adopting unhealthy physical and technical positions, which led to a lack of focus and accuracy, and thus negatively affected the performance technique of free throw and jump shot, as most teams use traditional exercises without the use of auxiliary training tools, and this topic gave researchers the
... Show MoreBecause 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
There has been a great deal of research into the considerable challenge of managing of traffic at road junctions; its application to vehicular ad hoc network (VANET) has proved to be of great interest in the developed world. Dynamic topology is one of the vital challenges facing VANET; as a result, routing of packets to their destination successfully and efficiently is a non-simplistic undertaking. This paper presents a MDORA, an efficient and uncomplicated algorithm enabling intelligent wireless vehicular communications. MDORA is a robust routing algorithm that facilitates reliable routing through communication between vehicles. As a position-based routing technique, the MDORA algorithm, vehicles' precise locations are used to establish th
... Show MoreIn this work, an analytical approximation solution is presented, as well as a comparison of the Variational Iteration Adomian Decomposition Method (VIADM) and the Modified Sumudu Transform Adomian Decomposition Method (M STADM), both of which are capable of solving nonlinear partial differential equations (NPDEs) such as nonhomogeneous Kertewege-de Vries (kdv) problems and the nonlinear Klein-Gordon. The results demonstrate the solution’s dependability and excellent accuracy.
With the recent developments of technology and the advances in artificial intelligent and machine learning techniques, it becomes possible for the robot to acquire and show the emotions as a part of Human-Robot Interaction (HRI). An emotional robot can recognize the emotional states of humans so that it will be able to interact more naturally with its human counterpart in different environments. In this article, a survey on emotion recognition for HRI systems has been presented. The survey aims to achieve two objectives. Firstly, it aims to discuss the main challenges that face researchers when building emotional HRI systems. Secondly, it seeks to identify sensing channels that can be used to detect emotions and provides a literature review
... Show MoreThe evaluation of subsurface formations as applied to oil well drilling started around 50 years ago. Generally, the curent review articule includes all methods for coring, logging, testing, and sampling. Also the methods for deciphering logs and laboratory tests that are relevant to assessing formations beneath the surface, including a look at the fluids they contain are discussed. Casing is occasionally set in order to more precisely evaluate the formations; as a result, this procedure is also taken into account while evaluating the formations. The petrophysics of reservoir rocks is the branch of science interested in studying chemical and physical properties of permeable media and the components of reservoir rocks which are associated
... Show MoreImplementation of TSFS (Transposition, Substitution, Folding, and Shifting) algorithm as an encryption algorithm in database security had limitations in character set and the number of keys used. The proposed cryptosystem is based on making some enhancements on the phases of TSFS encryption algorithm by computing the determinant of the keys matrices which affects the implementation of the algorithm phases. These changes showed high security to the database against different types of security attacks by achieving both goals of confusion and diffusion.
Abstract
This research aims to define the roles of auditors by clarifying the concept and risks of cyber security in protecting information and financial data in economic units. Najaf, Babylon and Karbala, then the results were analyzed and the results were presented and analyzed to show that adopting cyber security improves the quality of reports Finance through what it achieves in displaying information with credibility and transparency, in a way that suits the needs of users, and cyber security has a role in managing economic resources more effectively to obtain benefits that would have been lost in the event of an
... Show MoreLet G be a graph with p vertices and q edges and be an injective function, where k is a positive integer. If the induced edge labeling defined by for each is a bijection, then the labeling f is called an odd Fibonacci edge irregular labeling of G. A graph which admits an odd Fibonacci edge irregular labeling is called an odd Fibonacci edge irregular graph. The odd Fibonacci edge irregularity strength ofes(G) is the minimum k for which G admits an odd Fibonacci edge irregular labeling. In this paper, the odd Fibonacci edge irregularity strength for some subdivision graphs and graphs obtained from vertex identification is determined.