In this research, a new technique is suggested to reduce the long time required by the encoding process by using modified moment features on domain blocks. The modified moment features were used in accelerating the matching step of the Iterated Function System (IFS). The main disadvantage facing the fractal image compression (FIC) method is the over-long encoding time needed for checking all domain blocks and choosing the least error to get the best matched domain for each block of ranges. In this paper, we develop a method that can reduce the encoding time of FIC by reducing the size of the domain pool based on the moment features of domain blocks, followed by a comparison with threshold (the selected  threshold based on experience

 In a recent study, a special type of plane overpartitions known as k-rowed plane overpartitions has been studied. The function  denotes the number of plane overpartitions of n with a number of rows at most k. In this paper, we prove two identities modulo 8 and 16 for  the plane overpartitions with at most two rows. We completely specify the  modulo 8. Our technique is based on expanding each term of the infinite product of the generating function of the  modulus 8 and 16 and in which the proofs of the key results are dominated by an intriguing relationship between the overpartitions and the sum of divisors, which reveals a considerable link among these functions modulo powers of 2.

Abstract

Pneumatic processes sequence (PPS) is used widely in industrial applications. It is common to do a predetermined PPS to achieve a specific larger task within the industrial application like the PPS achieved by the pick and place industrial robot arm. This sequence may require change depending on changing the required task and usually this requires the programmer intervention to change the sequence’ sprogram, which is costly and may take long time. In this research a PLC-based PPS control system is designed and implemented, in which the PPS is programmed by demonstration. The PPS could be changed by demonstrating the new required sequence via the user by following simple series of manual steps without h

The palm vein recognition is one of the biometric systems that use for identification and verification processes since each person have unique characteristics for the veins. In this paper we can improvement palm vein recognition system have been made. The system based on centerline extraction of veins, and employs the concept of Difference-of Gaussian (DoG) Function to construct features vector. The tests results on our database showed that the identification rate is 100 % with the minimum error rate was 0.333.

In this paper we show that if ? Xi is monotonically T2-space then each Xi is monotonically T2-space, too. Moreover, we show that if ? Xi is monotonically normal space then each Xi is monotonically normal space, too. Among these results we give a new proof to show that the monotonically T2-space property and monotonically normal space property are hereditary property and topologically property and give an example of T2-space but not monotonically T2-space.

Most of the Weibull models studied in the literature were appropriate for modelling a continuous random variable which assumes the variable takes on real values over the interval [0,∞]. One of the new studies in statistics is when the variables take on discrete values. The idea was first introduced by Nakagawa and Osaki, as they introduced discrete Weibull distribution with two shape parameters q and β where      0 < q < 1 and b > 0. Weibull models for modelling discrete random variables assume only non-negative integer values. Such models are useful for modelling for example; the number of cycles to failure when components are subjected to cyclical loading. Discrete Weibull models can be obta

The main objective of" this paper is to study a subclass of holomrphic and univalent functions with negative coefficients in the open unit disk U= defined by Hadamard Product. We obtain coefficients estimates, distortion theorem , fractional derivatives, fractional integrals, and some results.

     Structure of network, which is known as community detection in networks, has received a great attention in diverse topics, including social sciences, biological studies, politics, etc. There are a large number of studies and practical approaches that were designed to solve the problem of finding the structure of the network. The definition of complex network model based on clustering is a non-deterministic polynomial-time hardness (NP-hard) problem. There are no ideal techniques to define the clustering. Here, we present a statistical approach based on using the likelihood function of a Stochastic Block Model (SBM). The objective is to define the general model and select the best model with high quality. Therefor

Fractal image compression depends on representing an image using affine transformations. The main concern for researches in the discipline of fractal image compression (FIC) algorithm is to decrease encoding time needed to compress image data. The basic technique is that each portion of the image is similar to other portions of the same image. In this process, there are many models that were developed. The presence of fractals was initially noticed and handled using Iterated Function System (IFS); that is used for encoding images. In this paper, a review of fractal image compression is discussed with its variants along with other techniques. A summarized review of contributions is achieved to determine the fulfillment of fractal image co

In this present paper, we obtain some differential subordination and superordination results, by using generalized operators for certain subclass of analytic functions in the open unit disk. Also, we derive some sandwich results.