The Internet is the hallmark of the age of technology and this technology is complemented by the presence of software which is one of the basic components of the operation of the network and it is used in almost all daily life aspects such as industry, commerce and others. Because the digital documents and objects can be easily replicated and distributed at an economically low cost and as the software is a type of digital object, the problem of software watermarking risen as related to how to protect data from piracy. Therefore, various techniques have been developed to protect codes from misusing and unauthorized alteration. Each of them is known as watermarking technology that protects data by inserting secret information into software, as an indicator of copyright ownership for this software. In this paper, the watermarked software will be explained in detail by defining the classification of watermarks software, models of attack, and methods used in software watermarking carried out by several researchers. It seems clearly that the method of ROP algorithm has given the highest accuracy results up to 100%
The protection of public money and its surrounding with special provisions that guarantee that protection from every legal or material assault by the supervisory bodies competent to combat corruption are described as a criminal procedural protection aimed at prosecuting criminals in general crimes and government corruption crimes in particular, and working to recover funds and return them to the state treasury, These agencies operate in an integrated format, each other and in a coherent manner with each other, in order to achieve the purpose of their establishment and reach the basic goal, which is to eliminate corruption from the theoretical side Practical reality.
The main purpose of this work is to introduce some types of fuzzy convergence sequences of operators defined on a standard fuzzy normed space (SFN-spaces) and investigate some properties and relationships between these concepts. Firstly, the definition of weak fuzzy convergence sequence in terms of fuzzy bounded linear functional is given. Then the notions of weakly and strongly fuzzy convergence sequences of operators are introduced and essential theorems related to these concepts are proved. In particular, if ( ) is a strongly fuzzy convergent sequence with a limit where linear operator from complete standard fuzzy normed space into a standard fuzzy normed space then belongs to the set of all fuzzy bounded linear operators
Using the Neural network as a type of associative memory will be introduced in this paper through the problem of mobile position estimation where mobile estimate its location depending on the signal strength reach to it from several around base stations where the neural network can be implemented inside the mobile. Traditional methods of time of arrival (TOA) and received signal strength (RSS) are used and compared with two analytical methods, optimal positioning method and average positioning method. The data that are used for training are ideal since they can be obtained based on geometry of CDMA cell topology. The test of the two methods TOA and RSS take many cases through a nonlinear path that MS can move through tha
... Show MoreIn this paper, an algorithm for binary codebook design has been used in vector quantization technique, which is used to improve the acceptability of the absolute moment block truncation coding (AMBTC) method. Vector quantization (VQ) method is used to compress the bitmap (the output proposed from the first method (AMBTC)). In this paper, the binary codebook can be engender for many images depending on randomly chosen to the code vectors from a set of binary images vectors, and this codebook is then used to compress all bitmaps of these images. The chosen of the bitmap of image in order to compress it by using this codebook based on the criterion of the average bitmap replacement error (ABPRE). This paper is suitable to reduce bit rates
... Show MoreThere are many methods of searching large amount of data to find one particular piece of information. Such as find name of person in record of mobile. Certain methods of organizing data make the search process more efficient the objective of these methods is to find the element with least cost (least time). Binary search algorithm is faster than sequential and other commonly used search algorithms. This research develops binary search algorithm by using new structure called Triple, structure in this structure data are represented as triple. It consists of three locations (1-Top, 2-Left, and 3-Right) Binary search algorithm divide the search interval in half, this process makes the maximum number of comparisons (Average case com
... Show MoreSongs are considered as an educational and a substantial dependable references used in teaching and learning, particularly the so - called foreign language learning that allows learners to adapt to the target language culture and to develop their language learning skills including: listening comprehension, reading comprehension, speaking and writing. Consequently, it can be said that the Francophone songs with the musical richness and resonance specifically facilities French language learning skills for all levels of education and achieve short and long terms predetermined educational language learning goals.
In fact, language learning through songs method does not only include the
... Show MoreIn this study, we propose a suitable solution for a non-linear system of ordinary differential equations (ODE) of the first order with the initial value problems (IVP) that contains multi variables and multi-parameters with missing real data. To solve the mentioned system, a new modified numerical simulation method is created for the first time which is called Mean Latin Hypercube Runge-Kutta (MLHRK). This method can be obtained by combining the Runge-Kutta (RK) method with the statistical simulation procedure which is the Latin Hypercube Sampling (LHS) method. The present work is applied to the influenza epidemic model in Australia in 1919 for a previous study. The comparison between the numerical and numerical simulation res
... Show MoreWe introduce in this paper the concept of approximaitly semi-prime submodules of unitary left -module over a commutative ring with identity as a generalization of a prime submodules and semi-prime submodules, also generalization of quasi-prime submodules and approximaitly prime submodules. Various basic properties of an approximaitly semi-prime submodules are discussed, where a proper submodule of an -module is called an approximaitly semi-prime submodule of , if whenever , where , and , implies that . Furthermore the behaviors of approximaitly semi-prime submodule in some classes of modules are studied. On the other hand several characterizations of this concept are
... Show MoreLet be a commutative ring with identity. The aim of this paper is introduce the notion of a pseudo primary-2-absorbing submodule as generalization of 2-absorbing submodule and a pseudo-2-absorbing submodules. A proper submodule of an -module is called pseudo primary-2-absorbing if whenever , for , , implies that either or or . Many basic properties, examples and characterizations of these concepts are given. Furthermore, characterizations of pseudo primary-2-absorbing submodules in some classes of modules are introduced. Moreover, the behavior of a pseudo primary-2-absorbing submodul
... Show MoreLet R be a commutative ring with unity and an R-submodule N is called semimaximal if and only if
the sufficient conditions of F-submodules to be semimaximal .Also the concepts of (simple , semisimple) F- submodules and quotient F- modules are introduced and given some properties .