Journal of Al-Qadisiyah for Computer Science and Mathematics

Innovative idea using ring theory is raised to build a new algorithm for zero knowledge (ZK) cryptosystem. In this paper we introduce an algorithm for zero knowledge protocol based on a specific kind of rings named weak Armendariz. On the other hand, the aim of this paper focuses on the category of noncommutative algebraic structures to describe a new algebraic scheme of zero knowledge proof using weak Armendariz rings. As a result, we employ for the first time weak Armendariz rings in the science of cryptographic which regards as a new application of this class of rings. Finally, we present a novel idea combining between abstract algebra and cryptography.

In this paper, we study the fuzzy measure on fuzzy sets and prove some new properties.
Keywords: Fuzzy measure, semi continuous fuzzy measure, null additive fuzzy measure, fuzzy measure accountably weakly null-additive fuzzy measure.

There are several complex programs that using for convert 2D images to 3D models with difficult techniques. In this paper ,it will be introduce a useful technique and using simple Possibilities and language for converting 2D to 3D images. The technique would be used; a three-dimensional projection using three images for the same shape and display three dimensional image from different side and to implement the particular work, visual programming with 3Dtruevision engine would be used, where its given acceptable result with shorting time. And it could be used in the field of engineering drawing.

In this paper, we define a new class of harmonic univalent functions of the form f=h+¯g in the open unit disk U. We obtain basic properties, like, coefficient bounds, extreme points, convex combination, distortion and growth theorems and integral operator.

In this paper, we introduce and investigate a new general subclasses R_(Σ_m ) (τ,λ,η;α) and R_(Σ_m ) (τ,λ,η;β) of Σ_m consisting of analytic and m-fold symmetric bi-univalent functions in the open unit disk U. We obtain estimates on the Taylor-Maclaurin coefficients |a_(m+1) | and |a_(2m+1) |. Also, we obtain new special cases for our results.

Throughout this paper, all rings have identities and all modules are unitary right modules. Let R be a ring and M an R-module. A module M is called coretractable if for each proper submodule N of M, there exists a nonzero homomorphism f from M/N into M. Our concern in this paper is to develop basic properties of coretractable modules and to look for any relations between coretractable modules and other classes of modules.

An open conjecture that relates to the equivalents between the permutation polytopes associated to their groups is proved and also the proof for two permutation groups which are effectively equivalent implies the permutation polytopes associated to these groups is combinatorial equivalent is given.

We introduce and investigate SS-injectivity as a generalization of both soc-injectivity and small injectivity. A right module M over a ring R is said to be SS-N-injective (where N is a right R-module) if every R-homomorphism from a semisimple small submodule of N into M extends to N. A module M is said to be SS-injective (resp. strongly SS-injective), if M is SS-R-injective (resp. SS-N-injective for every right R-module N). Some characterizations and properties of (strongly) SS-injective modules and rings are given. Some results on soc-injectivity are extended to SS-injectivity.

In this paper we introduce and study the concept of injective (Quasi-injective) extending gamma modules as a generalization of injective (Quasi-injective) gamma modules. An R_Γ-module E is called injective (Quasi-injective) extending gamma modules if each proper R_Γ-submodule in E is essential in injective (Quasi-injective) R_Γ-submodule of E. The concept of injective extending gamma modules lie between injective gamma modules and quasi-injective gamma modules.

Recently, information transmission is done electronically, information can be stored and manipulated easily using computer, information transferring should be done in secure way. Watermark is a technique that can be used to secure data.
In this paper, a new watermark algorithm is proposed which depends on integer wavelet transform, arithmetic encoding and adaptive run length encoding. Adaptive run length encoding is used to compress watermark before embedding process. Arithmetic encoding can be used to compress data in original image that are needed to be retrieved from watermarked images to recover original image without any differences after watermark extraction process.
To avoid the problem of traditional Run Length Encoding Technique that may produce file that is larger than original one. Adaptive run length encoding is suggested which is used to compress watermark in cover image. The adaptive compression technique can be done several times on watermark using different number of bits to represent counts of runs and produce several vectors for number of runs, compare several results and select smallest vector from them. Surely, the smallest vector means that watermarked image will be high quality image; capacity will be better and adaptively ensure embedding process will be more secure.

Mobile Ad Hoc Network is an infrastructure less wireless network where the mobile nodes leaves and joins the mobile network very frequently. The routing of the packets from source node to destination node, the routing protocol is used. On Demand Distance Vector Routing protocol is very common and implemented with Mobile Ad Hoc Network nodes to handle the operations of packet routing from by any node as a source node to destination node. In this paper prevention of black hole attack by modifying the On Demand Distance Vector routing protocol. The sequence number of 32 bit is initiated with the Route Reply and route sequence packet broadcast to determine the request reply from black hole node under the Mobile Ad Hoc Network. The sequence number and On demand Distance Vector Routing protocol are integrated with a mechanism to find the Request Reply of message containing routing information from source to destination node in Mobile Ad Hoc Network.

Many of the women in worlds die because of breast cancer and early detection will save the lives of many women. A mammogram is a special medical image in the breast. The mammogram image contains artifacts and wedge.
In this paper the mammogram image enhances by applied the Wiener filter to remove noise and apply Contrast Limited Adaptive Histogram Equitation (CLAHE) to improve a quality of mammogram image. Before applying them made number step to remove artifacts and wedge, background and pectoral muscle these know. The result indicted obtain mammogram image only breast profile, with a nice smooth, safe edge, and high quality.
These results prove that effective and convenient assistance for medical diagnosis. Hence, the proposed method definitely can be considered for automated detection of abnormality like benign, malignant and micro calcifications.

In the present paper, we study some application properties of the approximation for the sequences M_(n,γ)^(α,β) (f;x) and B_(n,γ)^(α,β) ( f; x ). These sequences depend on the arbitrary (but fixed) parameters α,β and γ. Here, we study the effect of these parameters on tends speed of the two families of operators M_(n,γ)^(α,β) (f;x) and B_(n,γ)^(α,β) ( f; x ) and the CPU times which are occurring on the approximation by a choosing fixed n.

Picking the wild mushrooms from the wild and forests for food purpose or for fun has become a public issue within the last years because many types of mushrooms are poisonous. Proper determination of mushrooms is one of the key safety issues in picking activities of it, which is widely spread, in countries. This contribution proposes a novel approach to support determination of the mushrooms through using a proposed system with mobile devices. Part of the proposed system is a mobile application that easily used by a user - mushroom picker. Hence, the mushroom type determination process can be performed at any location based on specific attributes of it. The mushroom type determination application runs on Android devices that are widely spread and inexpensive enough to enable wide exploitation by users.

A well known cryptographic techniques is Playfair Cryptography, it is considered one of the classical method. After the invention of different techniques, it is easy to break Playfair. This paper proposed some way for removal of the traditional Playfair drawbacks. The Adaptive playfair algorithm proposed in this paper, add more security and complexity to the classical playfair algorithm. In addition to the use of two keys in form of matrices to encrypt the message, the proposed method works depending on using the odd even positions for the every pairs of the letters. The odd pairs encrypt through the first matrix key and the even pairs encrypt by using the second matrix, then applying XOR function with the third key to the result. The resulting cipher text will be in binary form, the plain text obtained by run proposed step backwards.

The self-organizing map (SOM) neural network is based on unsupervised learning, and has found variety of applications. It is necessary to adjust the SOM parameters before starting learning process to ensure the best results. In this research, three types of data represent high and low traffic of specific cell tower with subscriber positions distribution in central of Iraq are investigated by self-organizing map (SOM). SOM functions and parameters influence its final results. Hence, several iteration of experiments are performed to test and analyze Bubble, Gaussian and Catgass neighborhood functions with three learning rates (linear, inverse of time and power series) and they were evaluated based on the quantization error. The experiments results show that Bubble function with linear learning rate gives the best result for clustering cell tower traffic.

E-Government delivers services into inhabitant electronically, action, and another government existence. This is analogous to document centric approach in traditional service delivery by the government. One of the most crucial factor regarding the reliability of government services is the security factor, which eventually leads to the social acceptance and satisfaction. E-Government is now a day is the response to the rapid development in the information technology especially in the automation of the process of service delivery. The model introduced by this paper is built over the social behavior of entities that shares the knowledge and provides decision-making baselines. Each entity is capturing its own knowledge and crystalize it with other entities within the communities. In this paper JAVA Agents where built to represent the individuals, which are attached to certain interaction points, for example each intelligent agent is attached to a web site representing the source of knowledge and behavior capture. Results proven that the social behavior of the software intelligent agent is a huge potential toward establishing social acceptance due to the smart behavior in collecting information regarding the utilization of the service, Three sites have been built along the implementation of paper to pursue its hypothesis; this is to represent government web sites deliver certain services and over which an intelligent agent is attached to capture the behavior of users and later on broadcast captured knowledge to other agents (i.e., the community is composed of four agents). The knowledge and expertise have been mutually exchanged and the overall knowledge has been proven to be converged toward the maximum experienced Agent.