In this paper we discuss the Zariski topology of intuitionistic fuzzy d-filter in d-algebra, with some topological properties on the spectrum of intuitionistic fuzzy d-filter in d-algebra X which have algebraic features such as connectedness. We find that this topology is a strongly connected, and T0 space. We also define the invariant map on intuitionistic fuzzy prime d-filter with a homomorphism map.
In this paper, new concepts of maximal and minimal regular s are introduced and discussed. Some basic properties are obtained. The relation between maximal and minimal regular s and some other types of open sets such as regular open sets and -open sets are investigated.
New class A^* (a,c,k,β,α,γ,μ) is introduced of meromorphic univalent functions with positive coefficient f(z)=□(1/z)+∑_(n=1)^∞▒〖a_n z^n 〗,(a_n≥0,z∈U^*,∀ n∈ N={1,2,3,…}) defined by the integral operator in the punctured unit disc U^*={z∈C∶0<|z|<1}, satisfying |(z^2 (I^k (L^* (a,c)f(z)))^''+2z(I^k (L^* (a,c)f(z)))^')/(βz(I^k (L^* (a,c)f(z)))^''-α(1+γ)z(I^k (L^* (a,c)f(z)))^' )|<μ,(0<μ≤1,0≤α,γ<1,0<β≤1/2 ,k=1,2,3,… ) . Several properties were studied like coefficient estimates, convex set and weighted mean.
Wireless sensor network (WSN) security is an important component for protecting data from an attacker. For improving security, cryptography technologies are divided into two kinds: symmetric and asymmetric. Therefore, the implementation of protocols for generating a secret key takes a long time in comparison to the sensor’s limitations, which decrease network throughput because they are based on an asymmetric method. The asymmetric algorithms are complex and decrease network throughput. In this paper, an encryption symmetric secret key in wireless sensor networks (WSN) is proposed. In this work, 24 experiments are proposed, which are encryption using the AES algorithm in the cases of 1 key, 10 keys, 25 keys, and 50 keys. I
... Show MoreData hiding strategies have recently gained popularity in different fields; Digital watermark technology was developed for hiding copyright information in the image visually or invisibly. Today, 3D model technology has the potential to alter the field because it allows for the production of sophisticated structures and forms that were previously impossible to achieve. In this paper, a new watermarking method for the 3D model is presented. The proposed method is based on the geometrical and topology properties of the 3D model surface to increase the security. The geometrical properties are based on computing the mean curvature for a surface and topology based on the number of edges around each vertex, the vertices
... Show MoreIn this paper, we introduce the notation of the soft bornological group to solve the problem of boundedness for the soft group. We combine soft set theory with bornology space to produce a new structure which is called soft bornological group. So that both the product and inverse maps are soft bounded. As well as, we study the actions of the soft bornological group on the soft bornological sets. The aim soft bornological set is to partition into orbital classes by acting soft bornological group on the soft bornological set. In addition, we explain the centralizer, normalizer, and stabilizer in details. The main important results are to prove that the product of soft bornological groups is soft bornol
... Show MoreA (b,t)-blocking set B in PG(2,q) is set of b points such that every line of PG(2,q) intersects B in at least t points and there is a line intersecting B in exactly t points. In this paper we construct a minimal (b,t)-blocking sets, t = 1,2,3,4,5 in PG(2,5) by using conics to obtain complete arcs and projective codes related with them.
The research demonstrates new species of the games by applying separation axioms via sets, where the relationships between the various species that were specified and the strategy of winning and losing to any one of the players, and their relationship with the concepts of separation axioms via sets have been studied.
In this paper,we construct complete (kn,n)-arcs in the projective plane PG(2,11), n = 2,3,…,10,11 by geometric method, with the related blocking sets and projective codes.
A (k,n)-arc is a set of k points of PG(2,q) for some n, but not n + 1 of them, are collinear. A (k,n)-arc is complete if it is not contained in a (k + 1,n)-arc. In this paper we construct complete (kn,n)-arcs in PG(2,5), n = 2,3,4,5, by geometric method, with the related blocking sets and projective codes.
One of the biomedical image problems is the appearance of the bubbles in the slide that could occur when air passes through the slide during the preparation process. These bubbles may complicate the process of analysing the histopathological images. The objective of this study is to remove the bubble noise from the histopathology images, and then predict the tissues that underlie it using the fuzzy controller in cases of remote pathological diagnosis. Fuzzy logic uses the linguistic definition to recognize the relationship between the input and the activity, rather than using difficult numerical equation. Mainly there are five parts, starting with accepting the image, passing through removing the bubbles, and ending with predict the tissues
... Show More