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 center of the block and then store another bit in the write or left bit depended on differences between them. The proposed method was applied to many color images and many measurement terms used to show the efficiency of it. The experiment result showed good result that the PSNR = 53.76, MSE = 0.273, SSIM= 0.999, with embedding rates 0.55.
Let R be a ring with identity and M is a unitary left R–module. M is called J–lifting module if for every submodule N of M, there exists a submodule K of N such that
Many codiskcyclic operators on infinite-dimensional separable Hilbert space do not satisfy the criterion of codiskcyclic operators. In this paper, a kind of codiskcyclic operators satisfying the criterion has been characterized, the equivalence between them has been discussed and the class of codiskcyclic operators satisfying their direct summand is codiskcyclic. Finally, this kind of operators is used to prove that every codiskcyclic operator satisfies the criterion if the general kernel is dense in the space.
The aim of this paper is to generate topological structure on the power set of vertices of digraphs using new definition which is Gm-closure operator on out-linked of digraphs. Properties of this topological structure are studied and several examples are given. Also we give some new generalizations of some definitions in digraphs to the some known definitions in topology which are Ropen subgraph, α-open subgraph, pre-open subgraph, and β-open subgraph. Furthermore, we define and study the accuracy of these new generalizations on subgraps and paths.
In the present paper, a simply* compact spaces was introduced it defined over simply*- open set previous knowledge and we study the relation between the simply* separation axioms and the compactness, in addition to introduce a new types of functions known as 𝛼𝑆 𝑀∗ _irresolte , 𝛼𝑆 𝑀∗ __𝑐𝑜𝑛𝑡𝑖𝑛𝑢𝑜𝑢𝑠 and 𝑅 𝑆 𝑀∗ _ continuous, which are defined between two topological spaces.
Abstract
Research title: The legal ruling of advice.
This research deals with the topic of advice, as the research included the following:
Preamble: I explained in it the meaning of advice in the Qur’an and Sunnah, and that what is meant by it is a good performance of the duty, then explaining its importance, importing it, and the difference between advice and what is similar to it, from enjoining good, denial, reproach and reprimand, backbiting and the will.
The first topic: It dealt with the ruling on advice, whether it is recommended or disliked, or forbidden, because what is meant by it is to give advice to others may be an obligation in kind, or it may be desirable or dislike
... Show MoreThe main goal of this paper is to introduce and study a new concept named d*-supplemented which can be considered as a generalization of W- supplemented modules and d-hollow module. Also, we introduce a d*-supplement submodule. Many relationships of d*-supplemented modules are studied. Especially, we give characterizations of d*-supplemented modules and relationship between this kind of modules and other kind modules for example every d-hollow (d-local) module is d*-supplemented and by an example we show that the converse is not true.
This paper describes the problem of online autonomous mobile robot path planning, which is consisted of finding optimal paths or trajectories for an autonomous mobile robot from a starting point to a destination across a flat map of a terrain, represented by a 2-D workspace. An enhanced algorithm for solving the problem of path planning using Bacterial Foraging Optimization algorithm is presented. This nature-inspired metaheuristic algorithm, which imitates the foraging behavior of E-coli bacteria, was used to find the optimal path from a starting point to a target point. The proposed algorithm was demonstrated by simulations in both static and dynamic different environments. A comparative study was evaluated between the developed algori
... Show MoreKinematics is the mechanics branch which dealswith the movement of the bodies without taking the force into account. In robots, the forward kinematics and inverse kinematics are important in determining the position and orientation of the end-effector to perform multi-tasks. This paper presented the inverse kinematics analysis for a 5 DOF robotic arm using the robotics toolbox of MATLAB and the Denavit-Hartenberg (D-H) parameters were used to represent the links and joints of the robotic arm. A geometric approach was used in the inverse kinematics solution to determine the joints angles of the robotic arm and the path of the robotic arm was divided into successive lines to accomplish the required tasks of the robotic arm.Therefore, this
... Show More