Hiding technique for dynamic encryption text using encoding table and symmetric encryption method (AES algorithm) is presented in this paper. The encoding table is generated dynamically from MSB of the cover image points that used as the first phase of encryption. The Harris corner point algorithm is applied on cover image to generate the corner points which are used to generate dynamic AES key to second phase of text encryption. The embedded process in the LSB for the image pixels except the Harris corner points for more robust. Experimental results have demonstrated that the proposed scheme have embedding quality, error-free text recovery, and high value in PSNR.

Computer systems and networks are increasingly used for many types of applications; as a result the security threats to computers and networks have also increased significantly. Traditionally, password user authentication is widely used to authenticate legitimate user, but this method has many loopholes such as password sharing, brute force attack, dictionary attack and more. The aim of this paper is to improve the password authentication method using Probabilistic Neural Networks (PNNs) with three types of distance include Euclidean Distance, Manhattan Distance and Euclidean Squared Distance and four features of keystroke dynamics including Dwell Time (DT), Flight Time (FT), mixture of (DT) and (FT), and finally Up-Up Time (UUT). The resul

Chemotherapy is one of the most efficient methods for treating cancer patients. Chemotherapy aims to eliminate cancer cells as thoroughly as possible. Delivering medications to patients’ bodies through various methods, either oral or intravenous is part of the chemotherapy process. Different cell-kill hypotheses take into account the interactions of the expansion of the tumor volume, external drugs, and the rate of their eradication. For the control of drug usage and tumor volume, a model based smooth super-twisting control (MBSSTC) is proposed in this paper. Firstly, three nonlinear cell-kill mathematical models are considered in this work, including the log-kill, Norton-Simon, and hypotheses subject to parametric uncertainties and exo

Face recognition is required in various applications, and major progress has been witnessed in this area. Many face recognition algorithms have been proposed thus far; however, achieving high recognition accuracy and low execution time remains a challenge. In this work, a new scheme for face recognition is presented using hybrid orthogonal polynomials to extract features. The embedded image kernel technique is used to decrease the complexity of feature extraction, then a support vector machine is adopted to classify these features. Moreover, a fast-overlapping block processing algorithm for feature extraction is used to reduce the computation time. Extensive evaluation of the proposed method was carried out on two different face ima

Photonic Crystal Fiber Interferometers (PCFIs) are greatly used
for sensing applications. This work presents the fabrication and
characterization of a relative humidity sensor based on Mach-
Zehnder Interferometer (MZI), which operates in reflection mode.
The humidity sensor operation based on the adsorption and
desorption of water vapour at the silica-air interface within the PCF.
The fabrication of this sensor is simple, it only includes splicing and
cleaving the PCF with SMF.PCF (LMA-10) with a certain length
spliced to SMF (Corning-28).
The spectrum of PCFI exhibits good sensitivity to humidity
variations. The PCFI response is observed for a range of humidity
values from (27% RH to 85% RH), the positi

The art of preventing the detection of hidden information messages is the way that steganography work. Several algorithms have been proposed for steganographic techniques. A major portion of these algorithms is specified for image steganography because the image has a high level of redundancy. This paper proposed an image steganography technique using a dynamic threshold produced by the discrete cosine coefficient. After dividing the green and blue channel of the cover image into 1*3-pixel blocks, check if any bits of green channel block less or equal to threshold then start to store the secret bits in blue channel block, and to increase the security not all bits in the chosen block used to store the secret bits. Firstly, store in the cente

Pattern matching algorithms are usually used as detecting process in intrusion detection system. The efficiency of these algorithms is affected by the performance of the intrusion detection system which reflects the requirement of a new investigation in this field. Four matching algorithms and a combined of two algorithms, for intrusion detection system based on new DNA encoding, are applied for evaluation of their achievements. These algorithms are Brute-force algorithm, Boyer-Moore algorithm, Horspool algorithm, Knuth-Morris-Pratt algorithm, and the combined of Boyer-Moore algorithm and Knuth–Morris– Pratt algorithm. The performance of the proposed approach is calculated based on the executed time, where these algorithms are applied o

It has become necessary to change from a traditional system to an automated system in production processes, because it has high advantages. The most important of them is improving and increasing production. But there is still a need to improve and develop the work of these systems.

The objective of this work is to study time reduction by combining multiple sequences of operations into one process. To carry out this work, the pneumatic system is designed to decrease\ increase the time of the sequence that performs a pick and place process through optimizing the sequences based on the obstacle dimensions. Three axes are represented using pneumatic cylinders that move according to the sequence used. The system is implemented and con

Drug solubility and dissolution remain a significant challenge in pharmaceutical formulations. This study aimed to formulate and evaluate repanglinide (RPG) nanosuspension-based buccal fast-dissolving films (BDFs) for dissolution enhancement. RPG nanosuspension was prepared by the antisolvent-precipitation method using multiple hydrophilic polymers, including soluplus®, polyvinyl alcohol, polyvinyl pyrrolidine, poloxamers, and hydroxyl propyl methyl cellulose. The nanosuspension was then directly loaded into BDFs using the solvent casting technique. Twelve formulas were prepared with a particle size range of 81.6-1389 nm and PDI 0.002-1 for the different polymers. Nanosuspensions prepared with soluplus showed a favored mean particle size o

Orthogonal polynomials and their moments serve as pivotal elements across various fields. Discrete Krawtchouk polynomials (DKraPs) are considered a versatile family of orthogonal polynomials and are widely used in different fields such as probability theory, signal processing, digital communications, and image processing. Various recurrence algorithms have been proposed so far to address the challenge of numerical instability for large values of orders and signal sizes. The computation of DKraP coefficients was typically computed using sequential algorithms, which are computationally extensive for large order values and polynomial sizes. To this end, this paper introduces a computationally efficient solution that utilizes the parall