The aim of the article is to study a sufficient condition for the classes of starlike and convex harmonic univalent functions with respect to k- symmetric points. The necessary condition for f to be in the classes will be studied. In addition, growth bounds for functions will also be given.

In this paper, we study and introduce the majorization properties of a new class of analytic p-valent functions of complex order defined by the generalized hypergeometric function. Some known consequences of our main result will be given. Moreover, we investigate the coefficient

estimates for this class.

In the present investigation, new subclasses of analytic functions in the open unit disk which are defined using generalized derivative operator are introduced. Several interesting properties of these classes are obtained.

New composite polyvinyl alcohol (PVA)/polypropylene (PP) membranes were prepared by combining both solution electrospinning and melt electrospinning methods. Self‐designed and made needleless melt electrospinning device was used to fabricate PP membranes which acted as the support layer. PVA membrane on the surface was fabricated via solution electrospinning. The electrospun PVA/PP composite membranes were characterized by the pore size distribution, pure water flux, and rejection ratio, then compared with general composite membranes. Characterizations revealed that the fiber diameter of solution electrospun PVA membrane and melt electrospun PP membrane were 0.171 ± 0.027 and 2.24 ± 0.33 μm, respectively, and the average pore size was 0.832 μm and 27.29 μm, which was much smaller than the nonwoven membrane. The rejection ratio to the 500 nm particles of the PVA/PP …

We provide a validation of a formal approximate solution to the problem of the evolution of a slowly varying harvested logistic population. Using a contraction mapping proof, we show that the initial value problem for the population has an exact solution lying in an appropriately small neighbourhood of this approximate solution, under quite general conditions.

With the rapid development of the Internet and communication networks, the confidentiality of digital

images transmitted over public networks must be preserved by using encryption techniques. Advanced

Encryption Standard (AES) is one of the most commonly used encryption algorithms at present. Although

AES has several advantages, such as security in data encryption, it also has a number of drawbacks, such as

high computations, pattern problems when used for encrypting images, and fixed S-box weak points. This

paper proposes a method that overcomes the fixed S-box weak points and improves the performance of

AES when used for encrypting images, particularly when the image data are large. In addition, the

MixColumn stage is replaced by chaotic mapping and XOR operation to reduce the high computations in

MixColumn transform. The proposed method is tested on several images, and the results show that the

proposed method efficiently generated cipher images with very low correlation coefficients of adjacent

pixels and provided better encryption speed and high security as a result of the dependence of the S-box on

the key characteristics of the chaotic system

000000000