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
Viscosity (η) of solutions of 1-butanol, sec-butanol, isobutanol and tert-butanol were investigated in aqueous solution structures of ranged composition from 0.55 to 1 mol.dm-3 at 298.15 K. The data of (η/η˳) were evaluated based on reduced Jone - Dole equation; η/η˳ =BC+1. In the term of B value, the consequences based on solute-solvent interaction in aqueous solutions of alcohols were deliberated. The outcomes of this paper discloses that alcohols act as structure producers in the water. Additionally, it has shown that solute-solvent with interacting activity of identical magnitude is in water-alcohol system
We present the notion of bipolar fuzzy k-ideals with thresholds (
The widespread use of the Internet of things (IoT) in different aspects of an individual’s life like banking, wireless intelligent devices and smartphones has led to new security and performance challenges under restricted resources. The Elliptic Curve Digital Signature Algorithm (ECDSA) is the most suitable choice for the environments due to the smaller size of the encryption key and changeable security related parameters. However, major performance metrics such as area, power, latency and throughput are still customisable and based on the design requirements of the device.
The present paper puts forward an enhancement for the throughput performance metric by p
... Show MoreMillions of lives might be saved if stained tissues could be detected quickly. Image classification algorithms may be used to detect the shape of cancerous cells, which is crucial in determining the severity of the disease. With the rapid advancement of digital technology, digital images now play a critical role in the current day, with rapid applications in the medical and visualization fields. Tissue segmentation in whole-slide photographs is a crucial task in digital pathology, as it is necessary for fast and accurate computer-aided diagnoses. When a tissue picture is stained with eosin and hematoxylin, precise tissue segmentation is especially important for a successful diagnosis. This kind of staining aids pathologists in disti
... Show More<span>One of the main difficulties facing the certified documents documentary archiving system is checking the stamps system, but, that stamps may be contains complex background and surrounded by unwanted data. Therefore, the main objective of this paper is to isolate background and to remove noise that may be surrounded stamp. Our proposed method comprises of four phases, firstly, we apply k-means algorithm for clustering stamp image into a number of clusters and merged them using ISODATA algorithm. Secondly, we compute mean and standard deviation for each remaining cluster to isolate background cluster from stamp cluster. Thirdly, a region growing algorithm is applied to segment the image and then choosing the connected regi
... Show MoreLet R be a Г-ring, and σ, τ be two automorphisms of R. An additive mapping d from a Γ-ring R into itself is called a (σ,τ)-derivation on R if d(aαb) = d(a)α σ(b) + τ(a)αd(b), holds for all a,b ∈R and α∈Γ. d is called strong commutativity preserving (SCP) on R if [d(a), d(b)]α = [a,b]α(σ,τ) holds for all a,b∈R and α∈Γ. In this paper, we investigate the commutativity of R by the strong commutativity preserving (σ,τ)-derivation d satisfied some properties, when R is prime and semi prime Г-ring.
In this research two algorithms are applied, the first is Fuzzy C Means (FCM) algorithm and the second is hard K means (HKM) algorithm to know which of them is better than the others these two algorithms are applied on a set of data collected from the Ministry of Planning on the water turbidity of five areas in Baghdad to know which of these areas are less turbid in clear water to see which months during the year are less turbid in clear water in the specified area.
For many years, reading rate as word correct per minute (WCPM) has been investigated by many researchers as an indicator of learners’ level of oral reading speed, accuracy, and comprehension. The aim of the study is to predict the levels of WCPM using three machine learning algorithms which are Ensemble Classifier (EC), Decision Tree (DT), and K- Nearest Neighbor (KNN). The data of this study were collected from 100 Kurdish EFL students in the 2nd-year, English language department, at the University of Duhok in 2021. The outcomes showed that the ensemble classifier (EC) obtained the highest accuracy of testing results with a value of 94%. Also, EC recorded the highest precision, recall, and F1 scores with values of 0.92 for
... Show More