Wireless Sensor Network is based on the hierarchical cluster and hence the Cluster Heads (CHs) will consume some more energy owing to the additional overload for the receiving and the aggregating of data from that of their member sensor nodes and this transmits all the aggregated data to its Base Station (BS). So the proper selection of the CH has a vital role to play in conserving the energy of the sensor nodes for the purpose of prolonging the WSNs and their lifetime. Here in this work, a proposed Low Energy Adaptive Clustering Hierarchy (LEACH), the Genetic Algorithm (GA) and finally the Chemical Reaction Optimization (CRO) algorithm is considered. The LEACH is a popular clustering algorithm wherein the sensor nodes will elect themselves to be the CH having a certain probability. But the main disadvantage of this algorithm will be that it may choose a CH having low energy that will be able to die quickly and thereby degrades the network performance. So there is a large number of algorithms that are developed for improving the LEACH. These results have been compared with certain currently existing algorithms for being able to demonstrate the proposed algorithm and its superiority.
{"title":"An Comparison of Different Cluster Head Selection Techniques for Wireless Sensor Network","authors":"E. Akila, Baby Deepa","doi":"10.52783/cana.v31.1073","DOIUrl":"https://doi.org/10.52783/cana.v31.1073","url":null,"abstract":"Wireless Sensor Network is based on the hierarchical cluster and hence the Cluster Heads (CHs) will consume some more energy owing to the additional overload for the receiving and the aggregating of data from that of their member sensor nodes and this transmits all the aggregated data to its Base Station (BS). So the proper selection of the CH has a vital role to play in conserving the energy of the sensor nodes for the purpose of prolonging the WSNs and their lifetime. Here in this work, a proposed Low Energy Adaptive Clustering Hierarchy (LEACH), the Genetic Algorithm (GA) and finally the Chemical Reaction Optimization (CRO) algorithm is considered. The LEACH is a popular clustering algorithm wherein the sensor nodes will elect themselves to be the CH having a certain probability. But the main disadvantage of this algorithm will be that it may choose a CH having low energy that will be able to die quickly and thereby degrades the network performance. So there is a large number of algorithms that are developed for improving the LEACH. These results have been compared with certain currently existing algorithms for being able to demonstrate the proposed algorithm and its superiority. ","PeriodicalId":40036,"journal":{"name":"Communications on Applied Nonlinear Analysis","volume":"119 44","pages":""},"PeriodicalIF":0.0,"publicationDate":"2024-07-19","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"141822256","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Following the notion of partial metric space (briefly PMS) established by Matthaws [1], in this present research article, we proved common fixed point theorem for two pair of self maps using the weakly compatible mappings through -contraction. In addition, we give an illustrative example.
{"title":"Matthews Partial Metric Space Using F-Contraction","authors":"Bonuga Vijayabaskerreddy","doi":"10.52783/cana.v31.1064","DOIUrl":"https://doi.org/10.52783/cana.v31.1064","url":null,"abstract":"Following the notion of partial metric space (briefly PMS) established by Matthaws [1], in this present research article, we proved common fixed point theorem for two pair of self maps using the weakly compatible mappings through -contraction. In addition, we give an illustrative example.","PeriodicalId":40036,"journal":{"name":"Communications on Applied Nonlinear Analysis","volume":" 24","pages":""},"PeriodicalIF":0.0,"publicationDate":"2024-07-18","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"141824161","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
In this study, we explore the concepts of NαIg-closed sets (nano αIg-closed sets) and NαIg-open sets (nano αIg-open sets) in nano ideal topological spaces. We discuss their relationships with other forms of nano ideal sets and illustrate the abstract concepts using appropriate examples. This research delves into the application of NαIg-closed and NαIg-open sets across diverse domains, ranging from network security to healthcare and environmental monitoring. By leveraging these mathematical concepts, we aim to enhance anomaly detection, optimize network operations, and improve decision-making processes across various sectors. This article outlines the methodologies and potential benefits of integrating NαIg-closed and NαIg-open sets in different application domains.
{"title":"Exploration of NαIg-Closed and NαIg-Open Sets in Nano Ideal Topological Spaces with Practical Applications of Nano Ideal Topological spaces","authors":"Email D. Vinodhini","doi":"10.52783/cana.v31.1058","DOIUrl":"https://doi.org/10.52783/cana.v31.1058","url":null,"abstract":"In this study, we explore the concepts of NαIg-closed sets (nano αIg-closed sets) and NαIg-open sets (nano αIg-open sets) in nano ideal topological spaces. We discuss their relationships with other forms of nano ideal sets and illustrate the abstract concepts using appropriate examples. This research delves into the application of NαIg-closed and NαIg-open sets across diverse domains, ranging from network security to healthcare and environmental monitoring. By leveraging these mathematical concepts, we aim to enhance anomaly detection, optimize network operations, and improve decision-making processes across various sectors. This article outlines the methodologies and potential benefits of integrating NαIg-closed and NαIg-open sets in different application domains.","PeriodicalId":40036,"journal":{"name":"Communications on Applied Nonlinear Analysis","volume":" 3","pages":""},"PeriodicalIF":0.0,"publicationDate":"2024-07-18","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"141825933","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
This paper proposes a novel recommendation system model, the Attentive Recurrent Recommender Network (ARRN), that addresses the challenge of incorporating demographic information into recommendations. ARRN leverages user-item interaction data along with age information from the data set to deliver personalized recommendations specifically tailored to different age groups. The approach utilizes embedding techniques and semantic analysis to capture user preferences and behaviors associated with their age. An attention mechanism prioritizes relevant features based on user age groups, enabling ARRN to dynamically adapt recommendations for users with limited interaction history. The paper presents a comprehensive evaluation of ARRN’s performance compared to existing state-of-the-art recommendation algorithms. The results demonstrate that ARRN outperforms existing approaches, particularly for users with limited interaction history, by effectively mitigating the cold-start problem in age-sensitive product domains.
{"title":"ARRN: Leveraging Demographic Context for Improved Semantic Personalization in Hybrid Recommendation Systems","authors":"Harshali Bhuwad, Dr.Jagdish.W.Bakal","doi":"10.52783/cana.v31.1059","DOIUrl":"https://doi.org/10.52783/cana.v31.1059","url":null,"abstract":"This paper proposes a novel recommendation system model, the Attentive Recurrent Recommender Network (ARRN), that addresses the challenge of incorporating demographic information into recommendations. ARRN leverages user-item interaction data along with age information from the data set to deliver personalized recommendations specifically tailored to different age groups. The approach utilizes embedding techniques and semantic analysis to capture user preferences and behaviors associated with their age. An attention mechanism prioritizes relevant features based on user age groups, enabling ARRN to dynamically adapt recommendations for users with limited interaction history. The paper presents a comprehensive evaluation of ARRN’s performance compared to existing state-of-the-art recommendation algorithms. The results demonstrate that ARRN outperforms existing approaches, particularly for users with limited interaction history, by effectively mitigating the cold-start problem in age-sensitive product domains.","PeriodicalId":40036,"journal":{"name":"Communications on Applied Nonlinear Analysis","volume":" 20","pages":""},"PeriodicalIF":0.0,"publicationDate":"2024-07-18","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"141824430","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Introduction: In this paper, we aim to establish a closed form for the Pathway fractional integral operator and Marichev-Saigo-Maeda fractional integral and differential operators involving the product of Special G function and Generalized Mittag – Leffler function. The obtained results are evaluated in terms of generalized Wright hyper geometric function.
{"title":"The Fractional Calculus of Product of Special Functions","authors":"Karuna Laddha, Deepak Kumar Kabra, Seema Kabra","doi":"10.52783/cana.v31.1054","DOIUrl":"https://doi.org/10.52783/cana.v31.1054","url":null,"abstract":"Introduction: In this paper, we aim to establish a closed form for the Pathway fractional integral operator and Marichev-Saigo-Maeda fractional integral and differential operators involving the product of Special G function and Generalized Mittag – Leffler function. The obtained results are evaluated in terms of generalized Wright hyper geometric function. ","PeriodicalId":40036,"journal":{"name":"Communications on Applied Nonlinear Analysis","volume":" 94","pages":""},"PeriodicalIF":0.0,"publicationDate":"2024-07-18","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"141827468","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
This work establishes unique common coupled fixed point theorems for given mapping in complete partial b-metric spaces with the concept of (α, ϕ)-H-contraction in the context of partial b-metric spaces. (α, ϕ)-H-contraction Furthermore, we show how the results may be used and present applications to integral equations and Homotopy theory. Introduction In previous work, authors have discussed various fixed point theorems on partial b-metric spaces with (ψ, ϕ)-weakly contractive mappings, α−ψ-contractive type, Suzuki type contractions, rational contraction and H-weak contractions. In our work, with the help of (α, ϕ)-H-contraction, we investigated coupled fixed point theorems in partial b-metric spaces. Objectives: Finding the unique common fixed points for a given mapping in partial b-metric spaces via (α, ϕ)-H-contraction Methods with the help of α-admissible mapping, H-rational type, (α, ϕ)−H-contraction we have shown coupled fixed point findings in complete partial b-metric spaces Results: We obtained unique common coupled fixed point results via (α, ϕ)−H-contraction type for the given mapping in complete partial b-metric spaces. Conclusions: This present study uses contractive mappings of the H type in the reference of partial b-metric space to give some fixed point results, appropriate examples that illustrate the main findings, In addition, boundary value problems and homotopy applications are given.
{"title":"Some Applications via Coupled Fixed Point Theorems for (????, ????)-H-Contraction Mappings in Partial b- Metric Spaces","authors":"Kavvampalli Jyothirmayi, V. .. Raju","doi":"10.52783/cana.v31.1055","DOIUrl":"https://doi.org/10.52783/cana.v31.1055","url":null,"abstract":"This work establishes unique common coupled fixed point theorems for given mapping in complete partial b-metric spaces with the concept of (α, ϕ)-H-contraction in the context of partial b-metric spaces. (α, ϕ)-H-contraction \u0000Furthermore, we show how the results may be used and present applications to integral equations and Homotopy theory. \u0000Introduction In previous work, authors have discussed various fixed point theorems on partial b-metric spaces with (ψ, ϕ)-weakly contractive mappings, α−ψ-contractive type, Suzuki type contractions, rational contraction and H-weak contractions. In our work, with the help of (α, ϕ)-H-contraction, we investigated coupled fixed point theorems in partial b-metric spaces. \u0000Objectives: Finding the unique common fixed points for a given mapping in partial b-metric spaces via (α, ϕ)-H-contraction \u0000Methods with the help of α-admissible mapping, H-rational type, (α, ϕ)−H-contraction we have shown coupled fixed point findings in complete partial b-metric spaces \u0000Results: We obtained unique common coupled fixed point results via (α, ϕ)−H-contraction type for the given mapping in complete partial b-metric spaces. \u0000Conclusions: This present study uses contractive mappings of the H type in the reference of partial b-metric space to give some fixed point results, appropriate examples that illustrate the main findings, In addition, boundary value problems and homotopy applications are given.","PeriodicalId":40036,"journal":{"name":"Communications on Applied Nonlinear Analysis","volume":" 10","pages":""},"PeriodicalIF":0.0,"publicationDate":"2024-07-18","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"141824378","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
We consider finite-capacity Markovian queues with a single hiatus scheme and waiting server. Customers are arriving at a Poisson arrival λ and exponential service distribution, with a mean service rate µ. In which customers join the queue according to the number of customers in the system while the hiatus is in the service-providing process. For the assumed queuing model, steady-state probabilities were derived, and some important performance measures, such as the mean number of customers in the system and mean response time in the system and queue are analysed. The expected expense function is developed and formulated as an optimization problem in order to find the minimum expense. Numerical illustrations are given to show the effect of parameters on the performance measures.
{"title":"Optimality of Finite Capacity Markovian Queues with Discouraged Arrivals and Singlhiatus with Waiting Server","authors":"J. Vimal Andrew","doi":"10.52783/cana.v31.1052","DOIUrl":"https://doi.org/10.52783/cana.v31.1052","url":null,"abstract":"We consider finite-capacity Markovian queues with a single hiatus scheme and waiting server. Customers are arriving at a Poisson arrival λ and exponential service distribution, with a mean service rate µ. In which customers join the queue according to the number of customers in the system while the hiatus is in the service-providing process. For the assumed queuing model, steady-state probabilities were derived, and some important performance measures, such as the mean number of customers in the system and mean response time in the system and queue are analysed. The expected expense function is developed and formulated as an optimization problem in order to find the minimum expense. Numerical illustrations are given to show the effect of parameters on the performance measures.","PeriodicalId":40036,"journal":{"name":"Communications on Applied Nonlinear Analysis","volume":" 15","pages":""},"PeriodicalIF":0.0,"publicationDate":"2024-07-18","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"141824707","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
The philosophy of inequalities has profundity been established for explaining numerous optimizational problems encountered in mathematical sciences. The contemporary develpments in computational mathematics have made it conceivable to compute enormous entities articulated in expressions of inequalities. Inequalities in information theory have been determined by the aspiration to elucidate communication theoretic problems. To disentangle such problems, the algebra of information was established and chain rules for entropy and mutual information were framed. The field of information theory participates with a critical protagonist in accepting and enumerating the communication of information in innumerable systems. Inequalities in information theory have appeared as influential implements to investigate and illustrate the restrictions and opportunities in information dispensation. The contemporary communiqué is an accurate step in the construction of information inequalities for the discrete probability distribution. We have prepared abundant inequalities concerning finite sequences of positive real numbers. The exceptional cases of these inequalities are definitely advantageous especially, in connection with innumerable measures of entropies and inaccuracy surviving in the literature of information theory.
{"title":"A Widespread Study of Inequalities Instigating Through Discrete Information Models","authors":"Jatinder Kumar, Om Parkash, Amit Paul, Deep Singh","doi":"10.52783/cana.v31.1053","DOIUrl":"https://doi.org/10.52783/cana.v31.1053","url":null,"abstract":"The philosophy of inequalities has profundity been established for explaining numerous optimizational problems encountered in mathematical sciences. The contemporary develpments in computational mathematics have made it conceivable to compute enormous entities articulated in expressions of inequalities. Inequalities in information theory have been determined by the aspiration to elucidate communication theoretic problems. To disentangle such problems, the algebra of information was established and chain rules for entropy and mutual information were framed. The field of information theory participates with a critical protagonist in accepting and enumerating the communication of information in innumerable systems. Inequalities in information theory have appeared as influential implements to investigate and illustrate the restrictions and opportunities in information dispensation. The contemporary communiqué is an accurate step in the construction of information inequalities for the discrete probability distribution. We have prepared abundant inequalities concerning finite sequences of positive real numbers. The exceptional cases of these inequalities are definitely advantageous especially, in connection with innumerable measures of entropies and inaccuracy surviving in the literature of information theory.","PeriodicalId":40036,"journal":{"name":"Communications on Applied Nonlinear Analysis","volume":" 7","pages":""},"PeriodicalIF":0.0,"publicationDate":"2024-07-18","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"141824791","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
The integration of Information and Communication Technology (ICT) in healthcare has been transformative, offering unprecedented opportunities for enhancing patient care and operational efficiencies. This research paper explores the fundamental role of ICT in healthcare systems, examining its evolution from basic digital communication to advanced healthcare informatics. Through a comprehensive literature survey and a detailed survey-based study, this research investigates the current state of ICT utilization among healthcare practitioners in the fields of medicine and dentistry. A cross-sectional descriptive research design was employed to assess the prevalence and applicability of ICT across various socio-demographic segments in India, highlighting significant associations between ICT usage and factors such as gender and years of professional experience. The findings stating that this paper as well recommends using a Trusted Fog Framework for healthcare based on higher prevalence of ICT in healthcare domain to address critical security concerns enhancing data security and system responsiveness.
{"title":"Emerging power of ICT in healthcare: Insights from survey-based investigation","authors":"Rushikesh Rajendra Nikam, Dr. Dilip Motwani","doi":"10.52783/cana.v31.1062","DOIUrl":"https://doi.org/10.52783/cana.v31.1062","url":null,"abstract":"The integration of Information and Communication Technology (ICT) in healthcare has been transformative, offering unprecedented opportunities for enhancing patient care and operational efficiencies. This research paper explores the fundamental role of ICT in healthcare systems, examining its evolution from basic digital communication to advanced healthcare informatics. Through a comprehensive literature survey and a detailed survey-based study, this research investigates the current state of ICT utilization among healthcare practitioners in the fields of medicine and dentistry. A cross-sectional descriptive research design was employed to assess the prevalence and applicability of ICT across various socio-demographic segments in India, highlighting significant associations between ICT usage and factors such as gender and years of professional experience. The findings stating that this paper as well recommends using a Trusted Fog Framework for healthcare based on higher prevalence of ICT in healthcare domain to address critical security concerns enhancing data security and system responsiveness.","PeriodicalId":40036,"journal":{"name":"Communications on Applied Nonlinear Analysis","volume":" 33","pages":""},"PeriodicalIF":0.0,"publicationDate":"2024-07-18","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"141824941","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Forecasting of exchange rates plays a pivotal role in global trade, stocks and making the policies of exports and imports. USD exchange rates used widely for many business areas. In this paper an attempt is made to predict INR/USD exchange rates using Feed forward Neural Networks and Box-Jenkins methodology. The forecasting performance of the developed models were tested using error measures like MAE, MAPE and RMSE. The results shows FFNN model has better model than ARIMA model. The predicted exchange rates would vary between 83.06 and 83.28 for the out sample and this variation is exchange rates would help the business people and also for framing the government policies in the future.
{"title":"Prediction of Exchange Rates using Neural Networks and Performance by Friedman’s Test","authors":"Dr. N. Konda Reddy, Dr. K Murali Krishna","doi":"10.52783/cana.v31.1051","DOIUrl":"https://doi.org/10.52783/cana.v31.1051","url":null,"abstract":"Forecasting of exchange rates plays a pivotal role in global trade, stocks and making the policies of exports and imports. USD exchange rates used widely for many business areas. In this paper an attempt is made to predict INR/USD exchange rates using Feed forward Neural Networks and Box-Jenkins methodology. The forecasting performance of the developed models were tested using error measures like MAE, MAPE and RMSE. The results shows FFNN model has better model than ARIMA model. The predicted exchange rates would vary between 83.06 and 83.28 for the out sample and this variation is exchange rates would help the business people and also for framing the government policies in the future. ","PeriodicalId":40036,"journal":{"name":"Communications on Applied Nonlinear Analysis","volume":" 46","pages":""},"PeriodicalIF":0.0,"publicationDate":"2024-07-18","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"141827435","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
京公网安备 11010802042870号
京ICP备2023020795号-1
扫码关注我们
求助内容：
应助结果提醒方式：