Preferred Language
Articles
/
bsj-781
Covering Theorem for Finite Nonabelian Simple Groups

In this paper, we show that for the alternating group An, the class C of n- cycle, CC covers An for n when n = 4k + 1 > 5 and odd. This class splits into two classes of An denoted by C and C/, CC= C/C/ was found.

View Publication Preview PDF
Quick Preview PDF
Publication Date
Sun Oct 01 2023
Journal Name
Baghdad Science Journal
Best Proximity Point Theorem for α ̃–ψ ̃-Contractive Type Mapping in Fuzzy Normed Space

The best proximity point is a generalization of a fixed point that is beneficial when the contraction map is not a self-map. On other hand, best approximation theorems offer an approximate solution to the fixed point equation . It is used to solve the problem in order to come up with a good approximation. This paper's main purpose is to introduce new types of proximal contraction for nonself mappings in fuzzy normed space and then proved the best proximity point theorem for these mappings. At first, the definition of fuzzy normed space is given. Then the notions of the best proximity point and - proximal admissible in the context of fuzzy normed space are presented. The notion of α ̃–ψ ̃- proximal contractive mapping is introduced.

... Show More
View Publication Preview PDF
Scopus (2)
Scopus Crossref
Publication Date
Sat Feb 15 2025
Journal Name
Experimental And Theoretical Nanotechnology
Analysis of applications of Banach fixed point theorem

In the context of normed space, Banach's fixed point theorem for mapping is studied in this paper. This idea is generalized in Banach's classical fixed-point theory. Fixed point theory explains many situations where maps provide great answers through an amazing combination of mathematical analysis. Picard- Lendell's theorem, Picard's theorem, implicit function theorem, and other results are created by other mathematicians later using this fixed-point theorem. We have come up with ideas that Banach's theorem can be used to easily deduce many well-known fixed-point theorems. Extending the Banach contraction principle to include metric space with modular spaces has been included in some recent research, the aim of study proves some pro

... Show More
View Publication
Scopus Crossref
Publication Date
Mon Nov 19 2018
Journal Name
Ibn Al-haitham Journal For Pure And Applied Sciences
Cryptography by Using"Hosoya"Polynomials for"Graphs Groups of Integer Modulen and"Dihedral Groups with'Immersion"Property

      In this paper we used Hosoya polynomial ofgroupgraphs Z1,...,Z26 after representing each group as  graph and using Dihedral group to"encrypt the plain texts with the immersion property which provided Hosoya polynomial to immerse the cipher text in another"cipher text to become very"difficult to solve.

View Publication Preview PDF
Crossref
Publication Date
Mon May 11 2020
Journal Name
Baghdad Science Journal
DEO: A Dynamic Event Order Strategy for t-way Sequence Covering Array Test Data Generation

Sequence covering array (SCA) generation is an active research area in recent years. Unlike the sequence-less covering arrays (CA), the order of sequence varies in the test case generation process. This paper reviews the state-of-the-art of the SCA strategies, earlier works reported that finding a minimal size of a test suite is considered as an NP-Hard problem. In addition, most of the existing strategies for SCA generation have a high order of complexity due to the generation of all combinatorial interactions by adopting one-test-at-a-time fashion. Reducing the complexity by adopting one-parameter- at-a-time for SCA generation is a challenging process. In addition, this reduction facilitates the supporting for a higher strength of

... Show More
View Publication
Publication Date
Mon May 11 2020
Journal Name
Baghdad Science Journal
DEO: A Dynamic Event Order Strategy for t-way Sequence Covering Array Test Data Generation

Sequence covering array (SCA) generation is an active research area in recent years. Unlike the sequence-less covering arrays (CA), the order of sequence varies in the test case generation process. This paper reviews the state-of-the-art of the SCA strategies, earlier works reported that finding a minimal size of a test suite is considered as an NP-Hard problem. In addition, most of the existing strategies for SCA generation have a high order of complexity due to the generation of all combinatorial interactions by adopting one-test-at-a-time fashion. Reducing the complexity by adopting one-parameter- at-a-time for SCA generation is a challenging process. In addition, this reduction facilitates the supporting for a higher strength of cove

... Show More
View Publication Preview PDF
Scopus (8)
Crossref (5)
Scopus Clarivate Crossref
Publication Date
Wed Apr 25 2018
Journal Name
Ibn Al-haitham Journal For Pure And Applied Sciences
Fuzzy Fixed Point Theorem for Some Types of Fuzzy Jungck Contractive Mappings In Hilbert Space

         In this paper, developed Jungck contractive mappings into fuzzy Jungck contractive and proved  fuzzy fixed point for some types of generalize fuzzy Jungck contractive mappings.

 

View Publication Preview PDF
Crossref
Publication Date
Sun Aug 15 2021
Journal Name
Al-qadisiyah Journal Of Pure Science Vol.(26) Issue (special Issue Num.4) (2021) Pp. 30–33
Accounts for the groups (2, ), = 41 and 43

Publication Date
Fri Apr 03 2020
Journal Name
Technology Reports Of Kansai University
Results for Some Groups of PSL (2, F)

Publication Date
Thu Oct 01 2020
Journal Name
Journal Of Engineering Science And Technology
Gamipog: A deterministic genetic multi-parameter-order strategy for the generation of variabLE STRENGTH COVERING ARRAYS

Preview PDF
Scopus (4)
Scopus
Publication Date
Thu Nov 21 2019
Journal Name
Journal Of Engineering
Simple 2D chaotic remapping scheme for securing optical communication networks

In this work, a simple and new method is proposed to simultaneously improve the physical layer security and the transmission performance of the optical orthogonal frequency division multiplexing system, by combining orthogonal frequency division multiplexing technique with chaotic theory principles. In the system, a 2-D chaotic map is employed. The introduced system replaces complex operations such as matrix multiplication with simple operations such as multiplexing and inverting. The system performance in terms of bit error rate (BER) and peak to average ratio (PAPR) is enhanced. The system is simulated using Optisystem15 with a MATLAB2016 and for different constellations. The simulation results showed that the  BE

... Show More
View Publication Preview PDF
Crossref (2)
Crossref