ASPG Menu
search

American Scientific Publishing Group

Research Feed

Found 3841 matches for "All Articles"

Interval-Valued Neutrosophic Deductive Systems of Hilbert Algebras

Interval-valued neutrosophic sets (IVNSs) are a notion that was initially developed by Wang et al.19 The idea of IVNSs to deductive systems (DSs) in Hilbert algebras is presented in this study. It is shown how intervalvalued neutrosophic deductive systems (IVNDSs) relate to their level cuts. In addition, certain related features are examined as well as the homomorphic inverse image of IVNDSs in Hilbert algebras.

groups
Aiyared Iampan mail -
P. Jayaraman mail -
S. D. Sudha mail -
Said Broumi mail -
N. Rajesh mail
link https://doi.org/10.54216/IJNS.190133

Volume & Issue

Vol. Volume 19 / Iss. Issue 1

Details open_in_new

Social sports Competition Scoring System Design Using Single Value Neutrosophic Environment

The goal of this work the critical criteria that affect social sports competition organization's arrangement. Then determine the relations between criteria with others and alternatives. So, the evaluation of the process of social sports competition contains many conflict criteria. The multi-criteria decision-making (MCDM) process is an effective tool for dealing with conflict and complex criteria. This work employs a new integrated model for dealing with the problem in an analytical hierarchal process (AHP) and Višekriterijumsko Kompromisno Rangiranje (VIKOR) methods under single-valued neutrosophic sets (SVNSs). SVNSs are the best tool for overcoming uncertainty and incomplete information. The AHP method is used for computing the weights of criteria then VIKOR is used for rank alternatives. The twelve criteria and five alternatives are used in this problem. An illustrative example is provided to present a robust hybrid model. This paper can help organizations and countries for arrangement and organize social sports completion with a scoring system design.

groups
D. M. Ramírez Guerra mail -
Y. M. Gordo Gómez mail -
L. J. Cevallos Torres mail -
F. G. Palacios Ortiz mail
link https://doi.org/10.54216/IJNS.190135

Volume & Issue

Vol. Volume 19 / Iss. Issue 1

Details open_in_new

Re-Evaluating the Necessity of Third-Party Antivirus Software on Windows Operating System

There is a general assumption that one must purchase costly antivirus software products to defend one’s computer system. However, if one is using the Windows Operating System, the question that arises is whether one needs to purchase antivirus software or not. The Windows operating system has a market share of 31.15% behind Android with a market share of 41.56% worldwide amongst all the operating systems. This makes Windows a prime target for hacking due to its large user base. Windows 11 a recent upgrade to the Windows operating system has claimed to have taken its security to the next level. There is a need to evaluate the capability of the Windows 11 default security against antivirus evasion tools. This research investigated the capability of Windows 11 default security by evaluating it against 6 free and open-source antivirus evasion tools: TheFatRat, Venom, Paygen, Defeat Defender, Inflate and Defender Disabler. The criteria for the selection of the antivirus evasion tools were free and open source and recently updated. A research lab was set up using Oracle VirtualBox where two guest machines were installed: a Windows 11 victim machine and the Kali Linux attacking machine. The antivirus evasion tools were installed on the Kali Linux machine one at a time to generate a malware and pass it to the victim machine. Apache web server was used in holding the malicious sample for the Windows 11 victim machine to download. A score of 2 was awarded to an antivirus evasion tool that successfully evaded the Windows 11 security and created a reverse connection with the attacking machine. From the research results: TheFatRat had a 25% evasion score, Venom had 20% while the rest had a 0% evasion score. None of the payloads generated with the antivirus evasion tools was able to create a connection with the Kali Linux attacking machine. The research results imply that the default Windows 11 security is good enough to stand on its own. A third-party antivirus solution will only supplement the already good protection capability of Windows 11.

groups
Faisal A. Garba mail -
Rosemary M. Dima mail -
A. Balarabe Isa mail -
A. Abdulrazaq Bello mail -
A. Sarki Aliyu mail -
F. Umar Yarima mail -
S. Abbas Ibrahim mail
link https://doi.org/10.54216/JCIM.090105

Volume & Issue

Vol. Volume 10 / Iss. Issue 1

Details open_in_new

Machine Learning-based Information Security Model for Botnet Detection

Botnet detection develops a challenging problem in numerous fields such as order, cybersecurity, law, finance, healthcare, and so on. The botnet signifies the group of co-operated Internet connected devices controlled by cyber criminals for starting co-ordinated attacks and applying various malicious events. While the botnet is seamlessly dynamic with developing counter-measures projected by both network and host-based detection techniques, the convention techniques are failed to attain sufficient safety to botnet threats. Thus, machine learning approaches are established for detecting and classifying botnets for cybersecurity. This article presents a novel dragonfly algorithm with multi-class support vector machines enabled botnet detection for information security. For effectual recognition of botnets, the proposed model involves data pre-processing at the initial stage. Besides, the model is utilized for the identification and classification of botnets that exist in the network. In order to optimally adjust the SVM parameters, the DFA is utilized and consequently resulting in enhanced outcomes. The presented model has the ability in accomplishing improved botnet detection performance. A wide-ranging experimental analysis is performed and the results are inspected under several aspects. The experimental results indicated the efficiency of our model over existing methods.

groups
Heba M. Fadhil mail -
Noor Q. Makhool mail -
Muna M. Hummady mail -
Zinah O. Dawood mail
link https://doi.org/10.54216/JCIM.090106

Volume & Issue

Vol. Volume 9 / Iss. Issue 1

Details open_in_new

Energy Aware Scheme for Underwater Wireless Sensor Networks

The development of wireless sensor networks (WSNs) in the underwater environment leads to underwater WSN (UWSN). It has severe impact over the research field due to its extensive and real-time applications. However effective execution of underwater WSNs undergoes several problems. The main concern in the UWSN is sensor nodes’ energy depletion issue. Energy saving and maintaining quality of service (QoS) becomes highly essential for UWASN because of necessity of QoS application and confined sensor nodes (SNs). To overcome this problem, numerous prevailing methods like adaptive data forwarding techniques, QoS-based congestion control approaches, and various methods have been devised with maximum throughput and minimum network lifespan. This study introduces a novel Seeker Optimization based Energy Aware Clustering Scheme for Underwater Wireless Sensor Networks (SOEACS-UWN). The presented SOEACS-UWN model follows the operation on a collection of solutions named search population (i.e., human team) and considered optimization procedure as a searching process of optimum solutions via human teams. The SOEACS-UWN model constructs a fitness function for effectual CH choices using diverse variables namely distance, residual energy, node degree, centrality, and link quality. The simulation analysis of the SOEACS-UWN model is tested and the outcomes were investigated under diverse aspects. The experimental outcomes demonstrated the supremacy of the SOEACS-UWN model over other approaches.

groups
Heba M. Fadhil mail -
Muna M. Hummady mail -
Noor Q. Makhool mail -
Zinah O. Dawood mail
link https://doi.org/10.54216/IJWAC.050101

Volume & Issue

Vol. Volume 5 / Iss. Issue 1

Details open_in_new

On A Novel Group Derived From a Generalization of Integer Exponents and Open Problems

 This paper is devoted to defining a new generalization of m-power closed groups by using some special mappings defined on a group (power maps). Also, a new group will be presented according to these mappings which will be related to other algebraic structures.

groups
Oliver V. Shtawzen mail
link https://doi.org/10.54216/GJMSA.010102

Volume & Issue

Vol. Volume 1 / Iss. Issue 1

Details open_in_new

Examples on Some Novel Diophantine Equations Derived from the Group of Units Problem in n-Cyclic Refined Neutrosophic Rings of Integers

The objective of this paper is to present a new class of Diophantine equations derived from the group of units problem of n-cyclic refined neutrosophic rings of integers by using homomorphisms between these rings and a finite Cartesian product ring of Z with itself. Also, this work provides many examples about this class and its solvability as a new application of neutrosophic algebraic structures in number theory.

groups
A. Alrida Basheer mail -
Katy D. Ahmad mail -
Rozina Ali mail
link https://doi.org/10.54216/GJMSA.010103

Volume & Issue

Vol. Volume 1 / Iss. Issue 1

Details open_in_new

A Study of Novel Algebraic Game Over Some Finite Groups and Open Problems

This paper uses the algebraic structure of the group to introduce a novel algebraic game with three players that occurs over finite groups.  Also, it analyzes this game over some finite groups with orders up to ten.

groups
Mohammad Abobala mail
link https://doi.org/10.54216/GJMSA.010104

Volume & Issue

Vol. Volume 1 / Iss. Issue 1

Details open_in_new

Analyzing on My Turf Game Over Some Finite Non-Abelian Groups

The aim of this paper is to solve the “ON MY TURF" game over some finite nonabelian groups. Also, it presents the following results: 1-) If G has odd order, and the set F contains the identity element, then the first player A has a winning strategy. If F does not contain the identity, then B has a winning strategy. 2-) If G has an even order with only one element of order two, there is a winning strategy related to set F. 3-) If G has an even order with only three elements of order two which generate a subgroup isomorphic to Z2 × Z2, there is a winning strategy related to the set F.

groups
Mohammad Abobala mail
link https://doi.org/10.54216/GJMSA.010101

Volume & Issue

Vol. Volume 1 / Iss. Issue 1

Details open_in_new

On Some Applications and Open Problems about (m-Groups)

The generalizations of abelian groups have been studied widely because of their importance in classification theorem and representation. A group G is called an m-power closed group or (m-group) if and only if it has the following property xm ym=zm  ∀x,y ∈ G and for z ∈ G. This paper studies a special case of m-groups, when G is a finite m-group and n-group at the same time with relatively prime integers m and n, which is called a Monic group. It presents the necessary and sufficient conditions for a monic group G to be cyclic, abelian, nilpotent, and solvable by the corresponding property of its power subgroups Gm , Gn. Also, this work introduces three open problems in the theory of finite groups.

groups
Oliver V. Shtawzen mail
link https://doi.org/10.54216/GJMSA.010105

Volume & Issue

Vol. Volume 1 / Iss. Issue 1

Details open_in_new