Recently, Image enhancement techniques can be represented as one of the most significant topics in the field of digital image processing. The basic problem in the enhancement method is how to remove noise or improve digital image details. In the current research a method for digital image de-noising and its detail sharpening/highlighted was proposed. The proposed approach uses fuzzy logic technique to process each pixel inside entire image, and then take the decision if it is noisy or need more processing for highlighting. This issue is performed by examining the degree of association with neighboring elements based on fuzzy algorithm. The proposed de-noising approach was evaluated by some standard images after corrupting them with impulse

Let be a ring. Given two positive integers and , an module is said to be -presented, if there is an exact sequence of -modules with is -generated. A submodule of a right -module is said to be -pure in , if for every -Presented left -module the canonical map is a monomorphism. An -module has the -pure intersection property if the intersection of any two -pure submodules is again -pure. In this paper we give some characterizations, theorems and properties of modules with the -pure intersection property.

This work aims to develop a secure lightweight cipher algorithm for constrained devices. A secure communication among constrained devices is a critical issue during the data transmission from the client to the server devices. Lightweight cipher algorithms are defined as a secure solution for constrained devices that require low computational functions and small memory. In contrast, most lightweight algorithms suffer from the trade-off between complexity and speed in order to produce robust cipher algorithm. The PRESENT cipher has been successfully experimented on as a lightweight cryptography algorithm, which transcends other ciphers in terms of its computational processing that required low complexity operations. The mathematical model of

Academia Open Vol 8 No 2 (2023): December DOI: 10.21070/acopen.8.2023.8087 . Article type: (Medicine)Impact of COVID-19 on Dental Students' Psychological Health Maryam Hameed Alwan, [email protected], (1) Department of Oral Diagnosis, College of Dentistry, Baghdad University, Iraq, Iraq (1) Corresponding author Abstract This study investigates the psychological impact of the COVID-19 pandemic on dental students at Baghdad University College of Dentistry. Conducted between December 2021 and January 2022, this cross-sectional survey aligns with ethical guidelines and the Helsinki Declaration. The study utilized Cochran's equation to determine a sample size of at least 400, ensuring a 95% confidence level with a 5% margin of e

Let be a ring. Given two positive integers and , an module is said to be -presented, if there is an exact sequence of -modules with is -generated. A submodule of a right -module is said to be -pure in , if for every -Presented left -module the canonical map is a monomorphism. An -module has the -pure intersection property if the intersection of any two -pure submodules is again -pure. In this paper we give some characterizations, theorems and properties of modules with the -pure intersection property.

Milling Machining is a widely accepted nontraditional machining technique used to produce parts with complex shapes and configurations. The material is removed in two stages roughing and finishing, the flat end cutter removed the unwanted part of material, then finished by end mill cutter. In milling technique, the role of machining factors such as cutting depth, spindle speed and feed has been studied using Taguchi technique to find its effectiveness on surface roughness.  Practical procedure is done by Taguchi Standard matrix. CNC milling is the most conventional process which is used for removing of material from workpiece to perform the needed shapes. The results and relations indicate that the rate of feed is v

In this paper, an algorithm through which we can embed more data than the
regular methods under spatial domain is introduced. We compressed the secret data
using Huffman coding and then this compressed data is embedded using laplacian
sharpening method.
We used Laplace filters to determine the effective hiding places, then based on
threshold value we found the places with the highest values acquired from these filters
for embedding the watermark. In this work our aim is increasing the capacity of
information which is to be embedded by using Huffman code and at the same time
increasing the security of the algorithm by hiding data in the places that have highest
values of edges and less noticeable.
The perform