In this thesis, some sets of subspaces of projective plane PG(2,q) over Galois field GF(q) and the relations between them by some theorems and examples can be shown.
Let A, and N are a semiring ,and a left A- semimodule, respectively. In this work we will discuss two cases:
- The direct summand of π-projective semi module is π-projective, while the direct sum of two π-projective semimodules in general is not π-projective . The details of the proof will be given.
- We will give a condition under which the direct sum of two π-projective semi modules is π-projective, as well as we also set conditions under which π-projective semi modules are projective.
In this paper, we introduce the concept of e-small Projective modules as a generlization of Projective modules.
In recent years, due to the economic benefits and technical advances of cloud
computing, huge amounts of data have been outsourced in the cloud. To protect the
privacy of their sensitive data, data owners have to encrypt their data prior
outsourcing it to the untrusted cloud servers. To facilitate searching over encrypted
data, several approaches have been provided. However, the majority of these
approaches handle Boolean search but not ranked search; a widely accepted
technique in the current information retrieval (IR) systems to retrieve only the top–k
relevant files. In this paper, propose a distributed secure ranked search scheme over
the encrypted cloud servers. Such scheme allows for the authorized user to
-convex sets and -convex functions, which are considered as an important class of generalized convex sets and convex functions, have been introduced and studied by Youness [5] and other researchers. This class has recently extended, by Youness, to strongly -convex sets and strongly -convex functions. In these generalized classes, the definitions of the classical convex sets and convex functions are relaxed and introduced with respect to a mapping . In this paper, new properties of strongly -convex sets are presented. We define strongly -convex hull, strongly -convex cone, and strongly -convex cone hull and we proof some of their properties. Some examples to illustrate the aforementioned concepts and to cl
... Show MoreThe concept of strong soft pre-open set was initiated by Biswas and Parsanann.We utilize this notion to study several characterizations and properties of this set. We investigate the relationships between this set and other types of soft open sets. Moreover, the properties of the strong soft pre-interior and closure are discussed. Furthermore, we define a new concept by using strong soft pre-closed that we denote as locally strong soft pre-closed, in which several results are obtained. We establish a new type of soft pre-open set, namely soft pre-open. Also, we continue to study pre- soft open set and discuss the relationships among all these sets. Some counter examples are given to show some relations
... Show MoreThe effect of linear thermal stratification in stable stationary ambient fluid on free convective flow of a viscous incompressible fluid along a plane wall is numerically investigated in the present work. The governing equations of continuity, momentum and energy are solved numerically using finite difference method with Alternating Direct implicit Scheme. The velocity, temperature distributions
and the Nusselt number are discussed numerically for various values of physical parameters and presented through graphs. ANSYS program also used to solve the problem. The results show that the effect of stratification parameter is marginalized with the increase in Prandtl number, and the increase in Grashof number does not practically vary the
Multiplicative inverse in GF (2 m ) is a complex step in some important application such as Elliptic Curve Cryptography (ECC) and other applications. It operates by multiplying and squaring operation depending on the number of bits (m) in the field GF (2 m ). In this paper, a fast method is suggested to find inversion in GF (2 m ) using FPGA by reducing the number of multiplication operations in the Fermat's Theorem and transferring the squaring into a fast method to find exponentiation to (2 k ). In the proposed algorithm, the multiplicative inverse in GF(2 m ) is achieved by number of multiplications depending on log 2 (m) and each exponentiation is operates in a single clock cycle by generating a reduction matrix for high power of two ex
... Show MoreLet R be a ring and let M be a left R-module. In this paper introduce a small pointwise M-projective module as generalization of small M- projective module, also introduce the notation of small pointwise projective cover and study their basic properties.
.