Today’s academics have a major hurdle in solving combinatorial problems in the actual world. It is nevertheless possible to use optimization techniques to find, design, and solve a genuine optimal solution to a particular problem, despite the limitations of the applied approach. A surge in interest in population-based optimization methodologies has spawned a plethora of new and improved approaches to a wide range of engineering problems. Optimizing test suites is a combinatorial testing challenge that has been demonstrated to be an extremely difficult combinatorial optimization limitation of the research. The authors have proposed an almost infallible method for selecting combinatorial test cases. It uses a hybrid whale–gray wolf optimization algorithm in conjunction with harmony search techniques. Test suite size was significantly reduced using the proposed approach, as shown by the analysis of the results. In order to assess the quality, speed, and scalability of TWGH, experiments were carried out on a set of well-known benchmarks. It was shown in tests that the proposed strategy has a good overall strong reputation test reduction size and could be used to improve performance. Compared with well-known optimization-based strategies, TWGH gives competitive results and supports high combinations (2 ≤ t ≤ 12).
This study aims to find the effect of water-cement ratio on the compressive strength of concrete by using ultrasonic pulse velocity test (UPVT). Over 230 standard cube specimens were used in this study, with dimensions of 150mm, and concrete cubes were cured in water at 20 °C. Also, the specimens used in the study were made of concrete with varied water-cement ratio contents from 0.48 to 0.59. The specimens were taken from Diyarbakir-Turkey concrete centers and tested at the structure and material science lab, civil engineering, faculty of engineering from Dicle University. The UPV measurement and compressive strength tests were carried out at the concrete age of 28 days. Their UPV and compressive strength ranged
... Show MoreKE Sharquie, AA Noaimi, HA Al-Mudaris, Journal of Cosmetics, Dermatological Sciences and Applications, 2013 - Cited by 4
In this article, a new deterministic primality test for Mersenne primes is presented. It also includes a comparative study between well-known primality tests in order to identify the best test. Moreover, new modifications are suggested in order to eliminate pseudoprimes. The study covers random primes such as Mersenne primes and Proth primes. Finally, these tests are arranged from the best to the worst according to strength, speed, and effectiveness based on the results obtained through programs prepared and operated by Mathematica, and the results are presented through tables and graphs.
The tests that measure special strength defined by speed contributes a great deal in evaluating the players' weaknesses and strengths so as to aid coaches judge their players according to scientific and objective measurements. The problem of the study lies in answering the following question : is there a test that measures legs' vertical strength defined by speed especially for youth basketball players? The aim of the research was to construct and standardize a test for measuring legs' vertical strength defined by speed in youth basketball. The subjects of the study were 74 youth basketball players from Baghdad. The researchers concluded that the test measures leg's vertical strength defined by speed for youth basketball players as well as
... Show MoreThe Rivest–Shamir–Adleman (RSA) and the Diffie-Hellman (DH) key exchange are famous methods for encryption. These methods depended on selecting the primes p and q in order to be secure enough . This paper shows that the named methods used the primes which are found by some arithmetical function .In the other sense, no need to think about getting primes p and q and how they are secure enough, since the arithmetical function enable to build the primes in such complicated way to be secure. Moreover, this article gives new construction of the RSA algorithm and DH key exchange using the
primes p,qfrom areal number x.
The search is an application for one of the problems of mathematics in the computer; as providing construction and design of a major program to calculate the inverse permutations of the symmetric group Sn , where 1 ≤ n ≤ 13; using some of the methods used in the Number Theory by computer . Also the research includes design flow chart for the main program and design flow chart for the program inverse permutations and we give some illustrative examples for different symmetric groups and their inverse permutations.