The Internet of Things (IoT) is an information network that connects gadgets and sensors to allow new autonomous tasks. The Industrial Internet of Things (IIoT) refers to the integration of IoT with industrial applications. Some vital infrastructures, such as water delivery networks, use IIoT. The scattered topology of IIoT and resource limits of edge computing provide new difficulties to traditional data storage, transport, and security protection with the rapid expansion of the IIoT. In this paper, a recovery mechanism to recover the edge network failure is proposed by considering repair cost and computational demands. The NP-hard problem was divided into interdependent major and minor problems that could be solved in polynomial t

Robots have become an essential part of modern industries in welding departments to increase the accuracy and rate of production. The intelligent detection of welding line edges to start the weld in a proper position is very important. This work introduces a new approach using image processing to detect welding lines by tracking the edges of plates according to the required speed by three degrees of a freedom robotic arm. The two different algorithms achieved in the developed approach are the edge detection and top-hat transformation. An adaptive neuro-fuzzy inference system ANFIS was used to choose the best forward and inverse kinematics of the robot. MIG welding at the end-effector was applied as a tool in this system, and the wel

The confirming of security and confidentiality of multimedia data is a serious challenge through the growing dependence on digital communication. This paper offers a new image cryptography based on the Chebyshev chaos polynomials map, via employing the randomness characteristic of chaos concept to improve security. The suggested method includes block shuffling, dynamic offset chaos key production, inter-layer XOR, and block 90 degree rotations to disorder the correlations intrinsic in image. The method is aimed for efficiency and scalability, accomplishing  complexity order for n-pixels over specific cipher rounds. The experiment outcomes depict great resistant to cryptanalysis attacks, containing statistical, differential and brut

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

<p>Generally, The sending process of secret information via the transmission channel or any carrier medium is not secured. For this reason, the techniques of information hiding are needed. Therefore, steganography must take place before transmission. To embed a secret message at optimal positions of the cover image under spatial domain, using the developed particle swarm optimization algorithm (Dev.-PSO) to do that purpose in this paper based on Least Significant Bits (LSB) using LSB substitution. The main aim of (Dev. -PSO) algorithm is determining an optimal paths to reach a required goals in the specified search space based on disposal of them, using (Dev.-PSO) algorithm produces the paths of a required goals with most effi

Today, data security is a major problem concerning organizations and indi- viduals. The confidentiality of information is associated with using reliable and robust encryption algorithms in systems. Cyber-attacks on data and systems have become prevalent and sophisticated, and are increasing rapidly; hence, the need for developing robust encryption algorithms is crucial nowadays. This paper proposes a new encryption algorithm using dynamic symmetric key cryptography to encrypt text files. It utilizes a secret key for encryption and decryption processes, where the key’s length is varied depending on the text size. This presented approach gives a trade-off between speed and security, making it suitable for various applications, such as secur

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

Biometrics is widely used with security systems nowadays; each biometric modality can be useful and has distinctive properties that provide uniqueness and ambiguity for security systems especially in communication and network technologies. This paper is about using biometric features of fingerprint, which is called (minutiae) to cipher a text message and ensure safe arrival of data at receiver end. The classical cryptosystems (Caesar, Vigenère, etc.) became obsolete methods for encryption because of the high-performance machines which focusing on repetition of the key in their attacks to break the cipher. Several Researchers of cryptography give efforts to modify and develop Vigenère cipher by enhancing its weaknesses.

Extended utilization of adaptive algorithms, Evaluative Algorithms (EAs), to address these issues offers a way to handle massive multi-objective optimization, even if the algorithmic method for handling combinations of objectives (CO) has been accessible for quite some time. Combining the idea of superiority with the Hypervolume (HV) tag approach, the GSA algorithm utilizes various target effects to explain several algorithms depending on the Hypervolume (HV) spacing. The Multi-objective Gravitational Search Algorithm with Hypervolume (MOGSA/HV). Since rapid convergence could result from GSA foundation work, Hypervolume rewrites the multi-objective problem (MOP) as a sequence of Tchebycheff solutions, improving it. Since the one in charge h

In this work, the effect of the addition of bright nickel plating and silver carried out by the electroplating method has been studied, on the coating of copper nanoparticles on the copper base metal via the process of thermal evaporation. The improvement of the solar absorber using CuNP in combination with the bright nickel and silver was obtained to be better than copper nanoparticles individually. A bright nickel enhanced the absorbed thermal stability. Also, other optical properties, absorptions, and emissivity slightly decreased from (93% to 87%), while the existence of silver had a slight impact on absorption of about (86.50%). On the other hand, thermal conductivity was evaluated using hot disk analyzer. The results showed a good