Most of today’s techniques encrypt all of the image data, which consumes a tremendous amount of time and computational payload. This work introduces a selective image encryption technique that encrypts predetermined bulks of the original image data in order to reduce the encryption/decryption time and the
computational complexity of processing the huge image data. This technique is applying a compression algorithm based on Discrete Cosine Transform (DCT). Two approaches are implemented based on color space conversion as a preprocessing for the compression phases YCbCr and RGB, where the resultant compressed sequence is selectively encrypted using randomly generated combined secret key.
The results showed a significant reduction in image quality degradation when applying the system based on YCbCr over RGB, where the compression ratio was raised in some of the tested images to 50% for the same Peak Signal to Noise Ratio (PSNR). The usage of 1-D DCT reduced the transform time by 47:1 times compared
to the same transform using 2-D DCT. The values of the adaptive scalar quantization parameters were reduced to the half for the luminance (Y band) to preserve the visual quality, while the chrominance (Cb and Cr bands) were quantized by the predetermined quantization parameters. In the hybrid encoder horizontal zigzag,
block scanning was applied to scan the image. The Detailed Coefficient (DC) coefficients are highly correlated in this arrangement- where DC are losslessly compressed by Differential Pulse Coding Modulation (DPCM) and the
Accumulative Coefficients (AC) are compressed using Run Length Encoding (RLE). As a consequence, for the compression algorithm, the compression gain obtained was up to 95%. Three arrays are resulted from each band (DC coefficients, AC values, and AC runs), where the cipher is applied to some or all of those bulks
selectively. This reduces the encryption decryption time significantly, where encrypting the DC coefficients provided the second best randomness and the least encryption/decryption time recorded (3 10-3 sec.) for the entire image. Although the compression algorithm consumes time but it is more efficient than the saved
encryption time.
To decrease the dependency of producing high octane number gasoline on the catalytic processes in petroleum refineries and to increase the gasoline pool, the effect of adding a suggested formula of composite blending octane number enhancer to motor gasoline composed of a mixture of oxygenated materials (ethanol and ether) and aromatic materials (toluene and xylene) was investigated by design of experiments made by Mini Tab 15 statistical software. The original gasoline before addition of the octane number blending enhancer has a value of (79) research octane number (RON). The design of experiments which study the optimum volumetric percentages of the four variables, ethanol, toluene, and ether and xylene materials leads
... Show MoreRecently, complementary perfect corona domination in graphs was introduced. A dominating set S of a graph G is said to be a complementary perfect corona dominating set (CPCD – set) if each vertex in is either a pendent vertex or a support vertex and has a perfect matching. The minimum cardinality of a complementary perfect corona dominating set is called the complementary perfect corona domination number and is denoted by . In this paper, our parameter hasbeen discussed for power graphs of path and cycle.
The metric dimension and dominating set are the concept of graph theory that can be developed in terms of the concept and its application in graph operations. One of some concepts in graph theory that combine these two concepts is resolving dominating number. In this paper, the definition of resolving dominating number is presented again as the term dominant metric dimension. The aims of this paper are to find the dominant metric dimension of some special graphs and corona product graphs of the connected graphs and , for some special graphs . The dominant metric dimension of is denoted by and the dominant metric dimension of corona product graph G and H is denoted by .
The aim of this article is to introduce a new definition of domination number in graphs called hn-domination number denoted by . This paper presents some properties which show the concepts of connected and independent hn-domination. Furthermore, some bounds of these parameters are determined, specifically, the impact on hn-domination parameter is studied thoroughly in this paper when a graph is modified by deleting or adding a vertex or deleting an edge.
This work addressed the assignment problem (AP) based on fuzzy costs, where the objective, in this study, is to minimize the cost. A triangular, or trapezoidal, fuzzy numbers were assigned for each fuzzy cost. In addition, the assignment models were applied on linguistic variables which were initially converted to quantitative fuzzy data by using the Yager’sorankingi method. The paper results have showed that the quantitative date have a considerable effect when considered in fuzzy-mathematic models.
Let A ⊆ V(H) of any graph H, every node w of H be labeled using a set of numbers; , where d(w,v) denotes the distance between node w and the node v in H, known as its open A-distance pattern. A graph H is known as the open distance-pattern uniform (odpu)-graph, if there is a nonempty subset A ⊆V(H) together with is the same for all . Here is known as the open distance pattern uniform (odpu-) labeling of the graph H and A is known as an odpu-set of H. The minimum cardinality of vertices in any odpu-set of H, if it exists, will be known as the odpu-number of the graph H. This article gives a characterization of maximal outerplanar-odpu graphs. Also, it establishes that the possible odpu-number of an odpu-maximal outerplanar graph i
... Show MoreThe research aims to identify the impact of using the electronic participatory learning strategy according to internet programs in learning some basic basketball skills for middle first graders according to the curricular course, and the sample of research was selected in the deliberate way of students The first stage of intermediate school.As for the problem of research, the researchers said that there is a weakness in the levels of school students in terms of teaching basketball skills, which prompted the researchers to create appropriate solutions by using a participatory learning strategy.The researchers imposed statistically significant differences between pre and post-test tests, in favor of the post tests individually and in favor of
... Show MoreThe study was conducted to show the effect of using dried rumen powder as a source of animal protein in the diets of common carp (Cyprinus carpio L.) on its performance, in the fish laboratory/College of Agricultural Engineering Sciences/University of Baghdad/ for a period of 70 d, 70 fingerlings were used with an average starting weight of 30±3 g, with a live mass rate of 202±2 g, randomly distributed among five treatments, two replicates for each treatment and seven fish for each replicate. Five diets of almost identical protein content and different percentages of addition of dried rumen powder were added. 25% was added to treatment T2 and 50% to treatment T3 and 75% of the treatment T4 and 100% of the treatment T5
... Show MoreLandsat-5 Thematic Mapper (TM) has been imaging the Earth since March 1984 and Landsat-7 Enhanced Thematic Mapper Plus (ETM+) was added to the series of Landsat instruments in April 1999. In this paper the two sensors are used to monitoring the agriculture condition and detection the changing in the area of plant covers, the stability and calibration of the ETM+ has been monitored extensively since launch although it is not monitored for many years, TM now has a similar system in place to monitor stability and calibration. By referring to statistical values for the classification process, the results indicated that the state of vegetation in 1990 was in the proportion of 42.8%, while this percentage rose to 52.5% for the same study area in
... Show MoreThe problem statement discussed in this paper is a new technique for the presentation of painterly rendering that uses a K-mean segmentation to divide the input image into a set of regions (depending on the grayscale of the regions). Segmenting the input image helps users use different brush strokes and easily change the strokes' shape, size, or orientation for different regions. Every region is painted using different brush kinds. The properties of the brush strokes are chosen depending on the region's details. The brush stroke properties, such as size, color, shape, location, and orientation, are extracted from the source image using statistical tools. The number of regions is set up manually and depends on the input image. This
... Show More