ASPG Menu
search

American Scientific Publishing Group

Research Feed

Found 3841 matches for "All Articles"

Neutrosophic BCK-algebra and Ω-BCK-algebra

In this paper, we study neutrosophic of one important types of algebra namely BCK-algebra.  Some new results of a generalization of BCK-algebra (Ω-BCK-algebra) have been introduced. Several facts about neutrosophic Ω-BCK-algebra are presented such as neutrosophic of homomorphic image and neutrosophic of kernel homomorphism.  Finally, some definitions, examples, and other properties of neutrosophic BCK-algebra and neutrosophic Ω-BCK-algebra are given.

groups
Saad H. Zail mail -
Majid Mohammed Abed mail -
Faisal AL-Sharqi mail
link https://doi.org/10.54216/IJNS.190301

Volume & Issue

Vol. Volume 19 / Iss. Issue 3

Details open_in_new

The Neutrosophic Traveling Salesman problem with Neutrosophic EdgeWeight: Formulation and A Genetic Algorithm

The traveling salesman problem (TSP) is an important and well known classical combinatorial network optimization problem in operation research, where the TSP finds a shortest possible route through a set of n nodes such that each and every node are visited exactly one time except for the starting node. In this problem, the arc lengths are generally considered to represent the traveling time or travelling cost rather than geographical distance. It is not possible to predict the exact arc length because the traveling time or traveling cost fluctuated with payload, weather, traffic conditions and so on. neutrosophic set theory provides a new tool to handle the uncertainties in TSP. In this paper, we concentrate on TSP on a network in which neutrosophic set, Instead of real number is assigned to edge as edge weight. We propose a mathematical model for a TSP with neutrosophic arc lengths. We present the utility of neutrosophic sets as arc length for TSP. An algorithmic method based on Genetic Algorithm (GA) is proposed for solving this problem. We have designed a new heuristic crossover and heuristic mutation our proposed GA. We have used a numerical example to illustrate the effectiveness of our proposed algorithm.

groups
Arindam Dey mail -
Ranjan Kumar mail -
Said Broumi mail
link https://doi.org/10.54216/IJNS.190304

Volume & Issue

Vol. Volume 19 / Iss. Issue 3

Details open_in_new

On neutrosophic αψ -supra open sets

Neutrosophic topological space is an extension of fuzzy topology. Neutrosophic topological space addresses each element’s membership, indeterminacy and non-membership grades. Dropping an axiom in the neutrosophic topological space produces a new topological space called neutrosophic supra topological space. Elements in this neutrosophic supra topology are neutrosophic sets. We established the neutrosophic αψ-supra open set in neutrosophic supra topological spaces in this paper. Also, we investigate the properties of the newly defined set. Neutrosophic αψ -supra continuity is introduced and studied subsequently.

groups
Mani Parimala mail -
Muthusamy Karthika mail -
Harish Garg mail -
Saeid Jafari mail -
Florentin Smarandache mail
link https://doi.org/10.54216/IJNS.190305

Volume & Issue

Vol. Volume 19 / Iss. Issue 3

Details open_in_new

An Analysis Framework to Study the Effects of Green Finance on Sustainable Smart Cities

Despite the fact that many countries around the world have adopted green growth as their strategy for economic development and those studies have investigated the factors that influence green growth from a variety of perspectives in sustainable smart cities, there is a paucity of literature that focuses on the impact that fintech and green finance have on green growth. This study attempts to design a complete index to assess the green growth of regional economies from the point of view of the development of fintech. The index will be based on an in-depth examination of the effect mechanism that green finance has on green growth. Additional study reveals that innovations in fintech mostly foster green economic development by means of green lending and green investment. As a result, advancements in fintech have the potential to foster green productivity expansion by elevating the development degree of green finance. This is a field that has a great deal of reference importance for most nations. The development of financial technology has the opposite effect on the building of sustainable smart cities. This is mostly because both the development and commoditization of fintech need more resources, and these resources also come at a greater price.

groups
Noura Metawa mail -
Nawazish Mirza mail
link https://doi.org/10.54216/AJBOR.070205

Volume & Issue

Vol. Volume 7 / Iss. Issue 2

Details open_in_new

Machine Learning-based Model for Talented Students Identification

Identifying the talented university students plays an important role in higher education. Special curriculum can be developed for these students as an outcome from the identification process. This curriculum can be compacted, clustered, and accelerated to match and exploit students’ abilities. Current methods for identifying talented students are based on simple identification test in the form of a questionnaire, which is developed for specific age. However, this method of identification cannot cover all aspects of student abilities and inaccurate as it not an iterative process. In this paper, a machine learning approach is proposed for identifying talented students based on their academic performance, which is evaluated repeatedly through their study. In this approach, we measure a set of features representing student abilities, then cluster them based on their features similarity. The proposed approach is applied on a set of 100 university students and shows promising results in identifying the talented group. To emphasize their talent, this group is guided to participate in national competitions that match their abilities, and they could achieve significant ranks.

groups
Abdelaziz A. Abdelhamid mail
link https://doi.org/10.54216/JAIM.010204

Volume & Issue

Vol. Volume 1 / Iss. Issue 2

Details open_in_new

Identification of Cardiovascular Disease Patients

For the prevention and treatment of illness, accurate and timely investigation of any health-related problem is critical. The prevalence of cardiovascular illnesses is rising among Indians. Aging has long been recognized as one of the most significant risk factors for heart attacks, affecting men and women aged 50 and up. Cardiovascular attacks are increasingly becoming more common in people in their 20s, 30s, and 40s.. To detect and predict cardiovascular disease patients, starting with a pre-processing step in which we used feature selection to pick the most important features, we tested the accuracy of different models on a dataset with features like gender, age, blood pressure, and glucose levels. The model predicts whether a patient is likely to suffer from cardiovascular disease based on their medical records. Finally, we performed hyperparameter tuning to find the best parameter for the models. In comparison to the other algorithms, the XGBoost model produced the best results with an accuracy of 75.72%

groups
Tavleen K. Nagi mail -
Abhishek Tomar mail -
Deepanshi Jain mail -
Surinder Kaur mail
link https://doi.org/10.54216/FPA.100101

Volume & Issue

Vol. Volume 10 / Iss. Issue 1

Details open_in_new

Secured Intrusion Detection in Adhoc Networks

Adhoc network computing is necessary in the present IT business since adhoc networks play such a huge role in it. Making computer talents connected to information technology available on demand using the pay-as-you-use payment model is the practice under question (PAYU). It is conceptualized as a collection of computational resources that has been developed rationally. Only virtualization, a crucial component, makes it feasible to provide ad hoc network computing services. By utilizing the underlying physical computing resources, such as processing power, memory, servers, programs, and other essential resources for calculation, this approach enables the creation of logical or virtual resources (instances). Due to the cost savings associated with virtualization, Adhoc Network service providers could be able to reduce their initial investments. It results in more efficient use of the available computational resources. When employing a virtualization approach to generate many resources or instances, it is vitally crucial for the users to determine whether these virtual resources satisfy, the criteria that have been set users have set outtake several forms, one of which is the creation of Routing Protocols (VMs). When multiple Routing Protocols are created by utilizing the underlying physical computing resources, it is essential for the user that these Routing Protocols perform processing without interrupting the other, as well as without any interruption from outsiders such as intrusions, malware, hackers, etc., It is essential for the user that these Routing Protocols perform processing without interrupting the other It is necessary for the user that these Routing Protocols perform processing without interrupting the other It is of the utmost importance to have a thorough understanding of how to prevent assaults, incursions, and system failures. In this article, we introduce several different approaches, each of which makes use of a variety of security components, such as a security watchdog, an IDS/IPS system, a security framework, an access control framework, a security supervisor, etc., to provide the required level of security for the Routing Protocols and their required resources. This is accomplished by enabling the Routing Protocols to function normally and without any problems from the outside or the inside of the working environment, all while making use of the accessible.

groups
Mahmoud Zaher mail -
Nabil M. Eldakhly mail
link https://doi.org/10.54216/IJWAC.050203

Volume & Issue

Vol. Volume 5 / Iss. Issue 2

Details open_in_new

A Proposed Optimization Framework for the Routing Protocols in Adhoc networks

Because of recent advancements in wireless communication and networking, it is now much simpler for people to continue cultivating meaningful connections with one another. After the evolution of the IEEE 802.15.4 standard and Mobile IPv6, which is described in IETF RFC 4068, there is a demand for the design of a routing protocol based on the new architecture of wireless networks that can facilitate efficient communication. This is because the design of a routing protocol that is based on the new architecture of wireless networks is required to meet this demand. This desire has surfaced as a direct result of the necessity to design a protocol that is suitable for usage with the recently developed architecture of wireless networks. Wireless sensor networks, abbreviated as WSN for convenience, are one kind of wireless network that might run into problems with its physical layout. Scalability, energy efficiency, and efficient routing throughout the network are the three problems that need to be addressed here. It changes the way sensing operations are performed from those that can only be done on a small scale, in a centralized location, and at a high cost into those that can be done on a large scale, in a dispersed location, and at a lower cost. This is accomplished by combining extremely small battery-powered sensors with wireless networks. There are literally hundreds of different applications for wireless sensor networks that may be utilized to make complex problems easier to handle. When it comes to the great majority of applications for wireless sensor nodes, the key concern of engineers is the conservation of energy in these nodes. This becomes very important because the amount of energy consumption in sensor nodes should be maintained to a minimum in order to maximize the amount of time that a network can continue to function normally. The creation of a routing algorithm that consumes the least amount of energy possible is the major challenge presented by WSN. Clustering techniques are necessary for the maintenance of the network's available energy, and the k means clustering strategy is used during the formation of clusters in wireless sensor networks (WSN). When there is growth in the network and the topology formation changes because of scalability in the network, a new routing technique has been proposed with a k-means clustering algorithm using IPv6. The goal of this technique is to minimize energy consumption among the nodes while also maintaining a balanced distribution of energy use across the network. This was carried out with the goal of using IPv6, which has already been accomplished. The method of routing that has been presented is suitable for implementation in settings that support not only unicast and multicast routing but also any cast and multicast routing as well as multipath routing. This is done so that load balancing may be implemented successfully inside the network. In addition, research has been done to investigate the problem of finding bottleneck nodes within a WSN in order to make the process of energy conservation easier.

groups
Pavan Kumar V. mail -
Naveen K. mail -
Deva Krupakaram S. mail -
Mohan Reddy D. mail
link https://doi.org/10.54216/IJWAC.050204

Volume & Issue

Vol. Volume 5 / Iss. Issue 2

Details open_in_new

Clustering Based Energy Coding for Wireless Adhoc Network

The rapid expansion of wireless networking in the present environment is due to its advantages in terms of portability and ease of use in contrast to the constraints imposed by wired networking on the communications system. Research that is cutting-edge and innovative in the field of wireless technology has made it possible for computers such as personal digital assistants (PDAs) and notebooks to function without an interface for wired networks. This has made it possible for these devices to participate in networked communication even when they are being used while traveling. A specific kind of wireless network known as an ad-hoc network is now seeing rapid expansion. The mobile ad-hoc network will not take into consideration the wired network or centralized control since, by its very nature; it will be capable of uniting, shaping, and rapidly deploying its network nodes. In a scenario with several facets, the nodes of an ad-hoc network have an insufficient amount of battery power, and these batteries are not going to be replaced or rejuvenated. These batteries need utilization in an efficient manner in order to get the most out of the lifespan of the network. The communication inside ad hoc networks will be entirely reliant on batteries. Since these batteries will deplete the energy of the nodes that contributed to the network, the result will be a failure of the nodes due to a lack of available battery power. Because of this, the objective of ad hoc networks is still to care about the virtually expected message. In addition, the strategies for prolonging the life of the battery primarily considered the impact of specific node letdown on the actual message being sent by the network in the communication. The description of the system's life cycle becomes connected with the communication message that is desired to succeed. The phrase "prevailing network system lifetime" refers to the timing of the first node's failure, the presence of non-zero energy for the nodes' functional components, and the amount of time it takes for the cumulative delivery level to fall below the threshold necessary to perform a network partition. Considering all of these justifications and the structure of this, with a special emphasis on the node and the importance it has in the network's node lifespan, the difficulty of presenting the limiting near-to-far distance in Energy Efficient Coding with Channel Information for Wireless Ad-hoc Network (CAEC), an effort for the Multiple Access Interference (MAI), which will reduce the throughput. In order to reduce the impact of the MAI, a power assignment mechanism that ensures users have enough control over their connections inside mobile ad-hoc networks has been developed. This protocol, which is called CAEC and will interpret as the multiple access interruption accordingly resolving near-far complicated difficulties, which will challenge throughput presentation popularly mobile ad hoc network, was proposed as the supreme controlled access protocol for wireless ad hoc networks.

groups
Mahaboob Basha mail -
Srinu Nidamanuri mail -
Anusha Pureti mail -
Vamsi krishna mail
link https://doi.org/10.54216/IJWAC.010203

Volume & Issue

Vol. Volume 1 / Iss. Issue 2

Details open_in_new

Innovative Techniques for Attack Detection in Wireless Ad-Hoc Networks

As a result of the inherent weaknesses of the wireless medium, ad hoc networks are susceptible to a broad variety of threats and assaults. As a direct consequence of this, intrusion detection, as well as security, privacy, and authentication in ad-hoc networks, have developed into a primary focus of the current study. This body of research aims to identify the dangers posed by a variety of assaults that are often seen in wireless ad-hoc networks and provide strategies to counteract those dangers. The Black hole assault, Wormhole attack, Selective Forwarding attack, Sybil attack, and Denial-of-Service attack are the specific topics covered in this proposed work. In this paper, we describe a trust-based safe routing protocol with the goal of mitigating the interference of black hole nodes while routing in mobile ad-hoc networks. The overall performance of the network is negatively impacted when there are black hole nodes in the route that routing takes. As a result, we have developed a routing protocol that reduces the likelihood that packets would be lost because of black hole nodes. This routing system has been subjected to experimental testing to guarantee that the most secure path will be selected for the delivery of packets between a source and a destination. The invasion of wormholes into wireless networks results in the segmentation of the network as well as a disorder in the routing. As a result, we provide an effective approach for locating wormholes by using ordinal multi-dimensional scaling and round-trip duration in wireless ad hoc networks with either sparse or dense topologies. Wormholes that are linked by both short-route and long-path wormhole linkages may be found using the approach that was given. To guarantee that this ad hoc network does not include any wormholes that go unnoticed, this method is subjected to experimental testing. To fight against selective forwarding attacks in wireless ad-hoc networks, we have developed three different techniques. The first method is an incentive-based algorithm that makes use of a reward-punishment system to drive cooperation among three nodes for forwarding messages in crowded ad-hoc networks. A unique adversarial model has been developed by our team, and inside it, three distinct types of nodes and the activities they participate in are specified. We have demonstrated that the proposed method that is based on incentives prevents nodes from adopting individualistic behaviour, which ensures cooperation in the process of packet forwarding. In the second algorithm, a game theoretic model is proposed that uses non-cooperative game theory to ensure that intermediate nodes in resource-constrained ad-hoc networks faithfully forward packets.

groups
Lamia F. Tulaib mail -
Akbal O. Salman mail -
Mazin A. Mohammed mail
link https://doi.org/10.54216/IJWAC.030105

Volume & Issue

Vol. Volume 3 / Iss. Issue 1

Details open_in_new