Ayman H. Abdel-Aziem
Current Organizations / Institutes
The organizations/institutes from the scholar's latest article
Previous Organizations / Institutes
The organizations / institutes from the scholar's other articles in the past ten years
Research Subjects
Ayman H. Abdel-Aziem has a total of 17 co-authors. Here are the top co-authors by number of shared publications:
- Ahmed Abdelhafeez
Faculty of Computer and Information Technology, Innovation University, Cairo, Egypt
6 shared publications - Tamer H. M. Soliman
AD Research and Development Center, Cairo, Egypt
4 shared publications - Ahmed Abdel-Rahim Ei Ei-Douh
Faculty of Information, Systems and Computer Science, October 6th University, Cairo, 12585, Egypt
2 shared publications - Hadeer Mahmoud
Department of Artificial Intelligence, Faculty of Computers and Artificial Intelligence, Modern University for Technology & Information, Cairo, Egypt
2 shared publications - Abdelrahman Hassan1 shared publication
Ahmed Amin
Military Technical College, Egypt
1 shared publication
Latest Publications
- Open Access
- 24 March 2026
- Published by Sciences Force in SciNexuses
- Vol. 3, 14-24
Investigating the Stability of a Perturbed Figure-8 Four-Body System Using Symplectic Integration
The figure-8 choreography of the equal-mass three-body problem is a rare example of a symmetric periodic solution in Newtonian gravity. In this study, we investigate the robustness of this orbit under a controlled perturbation: introducing a fourth body with variable mass and initial velocity while preserving the authorized figure-8 initial conditions for the original three bodies. We integrate the planar four-body equations of motion using a second-order symplectic leapfrog (velocity-Verlet) method to reduce long-term numerical drift in conserved quantities. Stability is quantified through a stability time defined by (i) a minimum pairwise-distance threshold to detect close encounters and (ii) a boundedness/escape threshold for the fourth body. In addition, we monitor total energy and total angular momentum as diagnostics of numerical integrity and physical consistency. A parameter scan over the fourth-body mass and speed produces a stability map that highlights rapid destabilization in most of the explored regions, with narrow islands of longer stability. Representative trajectory plots show that low-speed injections tend to produce close encounters, moderate speeds can yield bounded motion for longer times, and high speeds often result in escape (unbound trajectories). The results demonstrate how small perturbations can preserve the choreography over long integration windows, while stronger perturbations trigger chaotic scattering and a sharp reduction in stability time.
- 24 March 2026
- Published by Sciences Force in SciNexuses
- Vol. 3, 14-24
Open AccessInvestigating the Stability of a Perturbed Figure-8 Four-Body System Using Symplectic Integration
The figure-8 choreography of the equal-mass three-body problem is a rare example of a symmetric periodic solution in Newtonian gravity. In this study, we investigate the robustness of this orbit under a controlled perturbation: introducing a fourth body with variable mass and initial velocity while preserving the authorized figure-8 initial conditions for the original three bodies. We integrate the planar four-body equations of motion using a second-order symplectic leapfrog (velocity-Verlet) method to reduce long-term numerical drift in conserved quantities. Stability is quantified through a stability time defined by (i) a minimum pairwise-distance threshold to detect close encounters and (ii) a boundedness/escape threshold for the fourth body. In addition, we monitor total energy and total angular momentum as diagnostics of numerical integrity and physical consistency. A parameter scan over the fourth-body mass and speed produces a stability map that highlights rapid destabilization in most of the explored regions, with narrow islands of longer stability. Representative trajectory plots show that low-speed injections tend to produce close encounters, moderate speeds can yield bounded motion for longer times, and high speeds often result in escape (unbound trajectories). The results demonstrate how small perturbations can preserve the choreography over long integration windows, while stronger perturbations trigger chaotic scattering and a sharp reduction in stability time.
- Open Access
High-Security Image Encryption Using Baker Map Confusion and Extended PWAM Chaotic Diffusion
The heavy use of digital images across network systems has become a major concern regarding data confidentiality and unauthorized access. Conventional image encryption techniques hardly achieve high security levels efficiently, especially in real-time and resource-constrained environments. These challenges motivate the development of more robust and efficient encryption mechanisms. In this paper, a dual-chaotic image encryption framework is developed where two complementary chaotic systems are combined to effectively realize confusion and diffusion. The proposed method uses a chaotic permutation mechanism to find the pixel positions and enhanced chaotic diffusion to change the pixel values for eliminating the statistical correlations. An extended family of piecewise affine chaotic maps is designed to enhance the dynamic range and complexity of the diffusion process for strengthening the resistance capability against cryptographic attacks. Intensive experimental validations confirm that the proposed scheme well obscures the visual information and strongly reduces the pixel correlations in the encrypted images. High entropy values, uniform histogram distributions, high resistance to differential attacks, and improved robustness are further evidenced by statistical and security analyses compared to some conventional image encryption techniques. The results also show extremely low computational overheads, hence allowing for efficient implementation. The proposed encryption framework provides more security for digital image transmission and storage, and the performances are still practical. Given its robustness, efficiency, and scalability, it is equally adequate for real-time multi-media applications and secure communication systems, hence promising to offer a reliable solution for modern image protection requirements.
Open AccessHigh-Security Image Encryption Using Baker Map Confusion and Extended PWAM Chaotic Diffusion
The heavy use of digital images across network systems has become a major concern regarding data confidentiality and unauthorized access. Conventional image encryption techniques hardly achieve high security levels efficiently, especially in real-time and resource-constrained environments. These challenges motivate the development of more robust and efficient encryption mechanisms. In this paper, a dual-chaotic image encryption framework is developed where two complementary chaotic systems are combined to effectively realize confusion and diffusion. The proposed method uses a chaotic permutation mechanism to find the pixel positions and enhanced chaotic diffusion to change the pixel values for eliminating the statistical correlations. An extended family of piecewise affine chaotic maps is designed to enhance the dynamic range and complexity of the diffusion process for strengthening the resistance capability against cryptographic attacks. Intensive experimental validations confirm that the proposed scheme well obscures the visual information and strongly reduces the pixel correlations in the encrypted images. High entropy values, uniform histogram distributions, high resistance to differential attacks, and improved robustness are further evidenced by statistical and security analyses compared to some conventional image encryption techniques. The results also show extremely low computational overheads, hence allowing for efficient implementation. The proposed encryption framework provides more security for digital image transmission and storage, and the performances are still practical. Given its robustness, efficiency, and scalability, it is equally adequate for real-time multi-media applications and secure communication systems, hence promising to offer a reliable solution for modern image protection requirements.
- Open Access
- 11 December 2025
- Published by Sciences Force in SciNexuses
- Vol. 2, 224-233
Applying Supervised Machine Learning to Predict Diabetes from E-Health Records
Diabetes mellitus remains a major global health issue, particularly in the United States, where complications from persistent hyperglycemia contribute to severe health outcomes. Although prior research has improved diabetes prediction models, there is still a need for more accurate and efficient machine learning approaches to support early diagnosis and timely intervention. This study explores early diabetes detection using machine learning techniques applied to electronic health records. Four supervised algorithms—Random Forest, Gradient Boosting, Support Vector Classifier (SVC), and K-Nearest Neighbors (KNN) were compared to identifying the most relevant predictive features and determining which model performs best across training, testing, and validation phases. Among the evaluated models, Random Forest and Gradient Boosting demonstrated the strongest and most consistent results, achieving training accuracy of approximately 82.5% and test accuracy around 82.2%. Although the KNN model showed high sensitivity (98.54%) and specificity (93.63%) in a separate assessment, its test accuracy in this study was slightly lower at 77.9%. The SVC model reached a test accuracy of 76.7%. Validation outcomes further confirmed the stability and generalizability of the Random Forest and Gradient Boosting models when applied to unseen data. Overall, the results indicate that ensemble methods deliver more accurate and reliable predictions for diabetes diagnosis compared to KNN and SVC, making them more suitable for clinical settings. While KNN performed well under certain conditions, ensemble techniques provided better generalization. Future work should expand the feature set and apply thorough hyperparameter optimization to improve predictive performance and enable more effective early detection and management of diabetes.
- 11 December 2025
- Published by Sciences Force in SciNexuses
- Vol. 2, 224-233
Open AccessApplying Supervised Machine Learning to Predict Diabetes from E-Health Records
Diabetes mellitus remains a major global health issue, particularly in the United States, where complications from persistent hyperglycemia contribute to severe health outcomes. Although prior research has improved diabetes prediction models, there is still a need for more accurate and efficient machine learning approaches to support early diagnosis and timely intervention. This study explores early diabetes detection using machine learning techniques applied to electronic health records. Four supervised algorithms—Random Forest, Gradient Boosting, Support Vector Classifier (SVC), and K-Nearest Neighbors (KNN) were compared to identifying the most relevant predictive features and determining which model performs best across training, testing, and validation phases. Among the evaluated models, Random Forest and Gradient Boosting demonstrated the strongest and most consistent results, achieving training accuracy of approximately 82.5% and test accuracy around 82.2%. Although the KNN model showed high sensitivity (98.54%) and specificity (93.63%) in a separate assessment, its test accuracy in this study was slightly lower at 77.9%. The SVC model reached a test accuracy of 76.7%. Validation outcomes further confirmed the stability and generalizability of the Random Forest and Gradient Boosting models when applied to unseen data. Overall, the results indicate that ensemble methods deliver more accurate and reliable predictions for diabetes diagnosis compared to KNN and SVC, making them more suitable for clinical settings. While KNN performed well under certain conditions, ensemble techniques provided better generalization. Future work should expand the feature set and apply thorough hyperparameter optimization to improve predictive performance and enable more effective early detection and management of diabetes.
- Open Access
- 23 November 2025
- Published by Sciences Force in SciNexuses
- Vol. 2, 152-158
Beyond OLS: A Comparative Study of Regression Algorithms for Time Series Forecasting
Recent time series forecasting developments indicated that simple linear models can be strong competitors to handle a vast majority of real-world datasets. However, the generality of such models can vary significantly between domains, not to mention between tasks. This paper extends the benchmark of Toner and Darlow Ordinary Least Squares (OLS) was investigated as a competitive baseline model for time series forecasting, to include a few more regression-based models. More specifically, we compare the performances of Gaussian Naive Bayes (NB), K-Nearest Neighbors (KNN), Decision Tree Regression (DT), and Random Forest Regression (RF) under the same experimental setup and datasets. Our experiments are performed using the ETTh1 benchmark dataset with fixed context horizon and forecasting horizon at 96-time intervals. Compared to the baseline OLS benchmark MSE of 0.376, and the corresponding Mean Absolute Error (MAE) of 0.399, our modified models clearly fare much better. Random Forest Regression does the best, at an MSE of 0.144, an MAE of 0.245, followed closely by Decision Tree Regression (MSE: 0.155, MAE: 0.262) and the KNN (MSE: 0.271, MAE: 0.369). Surprisingly, the modified version of the usual Gaussian Naive Bayes, which has been conditioned to regression using target binning , does an MSE of 1.053, with the corresponding MAE of 0.670, due to the probabilistic nature of the algorithm where the sample domain is not discrete but rather continuous. Our work highlights that Random Forests, which are tree models, are overwhelmingly powerful baselines, surpassing traditional linear methods. This demands a rethinking of the simplicity of definition of forecasting baselines and the use of more varied ML-based regressors as baselines. Source code and experimental configurations are released to facilitate reproduction and further extendibility of the code.
- 23 November 2025
- Published by Sciences Force in SciNexuses
- Vol. 2, 152-158
Open AccessBeyond OLS: A Comparative Study of Regression Algorithms for Time Series Forecasting
Recent time series forecasting developments indicated that simple linear models can be strong competitors to handle a vast majority of real-world datasets. However, the generality of such models can vary significantly between domains, not to mention between tasks. This paper extends the benchmark of Toner and Darlow Ordinary Least Squares (OLS) was investigated as a competitive baseline model for time series forecasting, to include a few more regression-based models. More specifically, we compare the performances of Gaussian Naive Bayes (NB), K-Nearest Neighbors (KNN), Decision Tree Regression (DT), and Random Forest Regression (RF) under the same experimental setup and datasets. Our experiments are performed using the ETTh1 benchmark dataset with fixed context horizon and forecasting horizon at 96-time intervals. Compared to the baseline OLS benchmark MSE of 0.376, and the corresponding Mean Absolute Error (MAE) of 0.399, our modified models clearly fare much better. Random Forest Regression does the best, at an MSE of 0.144, an MAE of 0.245, followed closely by Decision Tree Regression (MSE: 0.155, MAE: 0.262) and the KNN (MSE: 0.271, MAE: 0.369). Surprisingly, the modified version of the usual Gaussian Naive Bayes, which has been conditioned to regression using target binning , does an MSE of 1.053, with the corresponding MAE of 0.670, due to the probabilistic nature of the algorithm where the sample domain is not discrete but rather continuous. Our work highlights that Random Forests, which are tree models, are overwhelmingly powerful baselines, surpassing traditional linear methods. This demands a rethinking of the simplicity of definition of forecasting baselines and the use of more varied ML-based regressors as baselines. Source code and experimental configurations are released to facilitate reproduction and further extendibility of the code.
- Open Access
- 19 September 2025
- Published by Sciences Force in Multicriteria Algorithms with Applications
- Vol. 8, 65-78
Ensemble Learning Approaches for SMS Spam Detection: A Comparative Study of Text Classification Models
For users who rely on single-use mobile phones, the global problem of receiving unwanted marketing messages through SMS remains a significant concern. In recent years, extensive use of machine learning and deep learning approaches has been explored to address this challenge. To improve predictive accuracy, the outputs of multiple models were combined using a majority-voting strategy. This work presents a comparative analysis of several text classification techniques, highlighting the importance of reliably identifying and labeling spam SMS messages. After data preprocessing, messages were transformed into numerical representations using TF-IDF, which emphasizes uncommon but informative terms over frequent ones. Among the tested methods, the Relevance Vector Machine achieved the strongest performance in the data, reaching an F1 is 0.975176. In addition, this examined alternative spam detection algorithms, including Logistic Regression, XGBoost, and LightGBM. The preprocessing pipeline included duplicate removal, text normalization with spaCy, label encoding, and TF-IDF vectorization. Two experimental conditions were evaluated: one without handling class imbalance and another with imbalance adjustment. Results showed that ensemble-based methods, particularly Gradient Boosting, XGBoost, and LightGBM, consistently delivered superior performance. Under imbalanced data conditions, both XGBoost and LightGBM achieved F1 scores of 0.99 across the majority and minority classes. When class imbalance was corrected, their performance remained strong, with F1 scores of 0.98 for all classes. Logistic Regression also demonstrated robust results, confirming its role as a reliable baseline. Overall, the findings indicate that the proposed RVM framework is effective for SMS spam classification and has practical applicability in real-world scenarios.
- 19 September 2025
- Published by Sciences Force in Multicriteria Algorithms with Applications
- Vol. 8, 65-78
Open AccessEnsemble Learning Approaches for SMS Spam Detection: A Comparative Study of Text Classification Models
For users who rely on single-use mobile phones, the global problem of receiving unwanted marketing messages through SMS remains a significant concern. In recent years, extensive use of machine learning and deep learning approaches has been explored to address this challenge. To improve predictive accuracy, the outputs of multiple models were combined using a majority-voting strategy. This work presents a comparative analysis of several text classification techniques, highlighting the importance of reliably identifying and labeling spam SMS messages. After data preprocessing, messages were transformed into numerical representations using TF-IDF, which emphasizes uncommon but informative terms over frequent ones. Among the tested methods, the Relevance Vector Machine achieved the strongest performance in the data, reaching an F1 is 0.975176. In addition, this examined alternative spam detection algorithms, including Logistic Regression, XGBoost, and LightGBM. The preprocessing pipeline included duplicate removal, text normalization with spaCy, label encoding, and TF-IDF vectorization. Two experimental conditions were evaluated: one without handling class imbalance and another with imbalance adjustment. Results showed that ensemble-based methods, particularly Gradient Boosting, XGBoost, and LightGBM, consistently delivered superior performance. Under imbalanced data conditions, both XGBoost and LightGBM achieved F1 scores of 0.99 across the majority and minority classes. When class imbalance was corrected, their performance remained strong, with F1 scores of 0.98 for all classes. Logistic Regression also demonstrated robust results, confirming its role as a reliable baseline. Overall, the findings indicate that the proposed RVM framework is effective for SMS spam classification and has practical applicability in real-world scenarios.
- Open Access
- 20 February 2024
- Published by Sciences Force in SciNexuses
- Vol. 1, 16-27
Revisiting Machine Learning for Predictive Modeling for Stroke from Electronic Health Records
Stroke is a big worldwide threat with serious health and economic implications. To solve this, researchers are developing automated stroke prediction algorithms, allowing for early intervention and perhaps saving lives. Machine learning (ML) techniques have emerged as powerful tools for predicting stroke risk based on patient data. This study explores the application of various ML algorithms, including logistic regression, decision trees, support vector machines, and k-nearest neighbors, for stroke prediction. The models are trained on historical data from patients with known stroke outcomes and evaluated on their ability to classify individuals into stroke-risk categories accurately. ML techniques are being increasingly adapted for use in the medical field because of their high accuracy. The main contribution of this study is a stacking method that achieves a high performance that is validated by various metrics, such as AUC, precision, recall, F-measure, and accuracy. This study also shows how different ML models can predict strokes by analyzing factors such as age, gender, accompanying habits, and personal lifestyle. It is quite essential to understand the risk factors that make a patient more susceptible to strokes, thus some factors make stroke prediction much easier. This research offers an analysis of the factors that enhance the stroke prediction process based on electronic health records.
- 20 February 2024
- Published by Sciences Force in SciNexuses
- Vol. 1, 16-27
Open AccessRevisiting Machine Learning for Predictive Modeling for Stroke from Electronic Health Records
Stroke is a big worldwide threat with serious health and economic implications. To solve this, researchers are developing automated stroke prediction algorithms, allowing for early intervention and perhaps saving lives. Machine learning (ML) techniques have emerged as powerful tools for predicting stroke risk based on patient data. This study explores the application of various ML algorithms, including logistic regression, decision trees, support vector machines, and k-nearest neighbors, for stroke prediction. The models are trained on historical data from patients with known stroke outcomes and evaluated on their ability to classify individuals into stroke-risk categories accurately. ML techniques are being increasingly adapted for use in the medical field because of their high accuracy. The main contribution of this study is a stacking method that achieves a high performance that is validated by various metrics, such as AUC, precision, recall, F-measure, and accuracy. This study also shows how different ML models can predict strokes by analyzing factors such as age, gender, accompanying habits, and personal lifestyle. It is quite essential to understand the risk factors that make a patient more susceptible to strokes, thus some factors make stroke prediction much easier. This research offers an analysis of the factors that enhance the stroke prediction process based on electronic health records.
- Open Access
- 29 January 2024
- Published by Springer Nature in Wireless Personal Communications
- Vol. 146 (9) , 1-20
A Proposed Cancelable Biometrical Recognition System (CBRS) Based on Developed Hénon Chaotic-Map
Nowadays, human biometrics are widely used in authentication systems. In reaction to violent attacks, cancelable biometric patterns are developed from the original templates to increase the security level of biometric characteristics. This study proposes a solution for a cancelable biometrical recognition system (CBRS) based on the created Hénon chaotic-map idea, which increases key space and hence privacy. The suggested CBRS system ensures that the original biometric traits are updated and encrypted before they are saved in the database, protecting them from unwanted cyber-attacks. It makes efficient encryption of face biometric templates possible. The extraction of biometric characteristics is the first step in this design. Following that, the obtained biometric characteristics are encrypted using the suggested model, which causes pixel confusion and diffusion by developing a Henon chaotic map with variable block sizes at different modes of operation. Various face biometrics datasets were used to test the proposed approach. Various metrics, including security and statistical analyses, demonstrate the effectiveness of the approach, including histogram analysis, correlation coefficient analysis, maximum deviation factor analysis, irregular deviation factor analysis, number of pixels change rate analysis, unified average changing intensity analysis, time analysis, and key space analysis. Furthermore, the performance of the proposed approach was assessed using the receiver operating characteristic curve, which was constructed to assess the system's performance. Results of the analysis show that the suggested technique is very effective, resilient, and dependable, as evidenced by its great performance across diverse recognition databases when compared to traditional and modern algorithms, hence improving the security and reliability of biometric-based access management. The proposed method yields an average AROC of around 1, a correlation coefficient of about 0.00013, and an entropy close to one.
- 29 January 2024
- Published by Springer Nature in Wireless Personal Communications
- Vol. 146 (9) , 1-20
Open AccessA Proposed Cancelable Biometrical Recognition System (CBRS) Based on Developed Hénon Chaotic-Map
Nowadays, human biometrics are widely used in authentication systems. In reaction to violent attacks, cancelable biometric patterns are developed from the original templates to increase the security level of biometric characteristics. This study proposes a solution for a cancelable biometrical recognition system (CBRS) based on the created Hénon chaotic-map idea, which increases key space and hence privacy. The suggested CBRS system ensures that the original biometric traits are updated and encrypted before they are saved in the database, protecting them from unwanted cyber-attacks. It makes efficient encryption of face biometric templates possible. The extraction of biometric characteristics is the first step in this design. Following that, the obtained biometric characteristics are encrypted using the suggested model, which causes pixel confusion and diffusion by developing a Henon chaotic map with variable block sizes at different modes of operation. Various face biometrics datasets were used to test the proposed approach. Various metrics, including security and statistical analyses, demonstrate the effectiveness of the approach, including histogram analysis, correlation coefficient analysis, maximum deviation factor analysis, irregular deviation factor analysis, number of pixels change rate analysis, unified average changing intensity analysis, time analysis, and key space analysis. Furthermore, the performance of the proposed approach was assessed using the receiver operating characteristic curve, which was constructed to assess the system's performance. Results of the analysis show that the suggested technique is very effective, resilient, and dependable, as evidenced by its great performance across diverse recognition databases when compared to traditional and modern algorithms, hence improving the security and reliability of biometric-based access management. The proposed method yields an average AROC of around 1, a correlation coefficient of about 0.00013, and an entropy close to one.
- Open Access
- 12 October 2023
- Published by Springer Nature in Research Square
A Proposed Cancelable Biometrical Recognition System (CBRS) Based on Developed Hénon Chaotic-Map
Currently, authentication systems rely heavily on human biometrics. Cancellable biometric patterns are generated from the original templates to enhance the security level of biometric features in response to violent attacks. In this paper, a proposed method for a cancelable biometrical recognition system (CBRS) is introduced, which is based on the developed Hénon chaotic-map concept. The proposed CBRS design guarantees that the original biometric features are modified and encrypted before being stored in the database, ensuring their protection against malicious cyber-attacks. The suggested technique was tested using different facial biometrics datasets The correlation scores and the Receiver Operating Characteristic curve were calculated to evaluate the system's performance. The analysis results show that the suggested technique is highly effective robust and reliable, as evidenced by its excellent performance across various face databases.
- 12 October 2023
- Published by Springer Nature in Research Square
Open AccessA Proposed Cancelable Biometrical Recognition System (CBRS) Based on Developed Hénon Chaotic-Map
Currently, authentication systems rely heavily on human biometrics. Cancellable biometric patterns are generated from the original templates to enhance the security level of biometric features in response to violent attacks. In this paper, a proposed method for a cancelable biometrical recognition system (CBRS) is introduced, which is based on the developed Hénon chaotic-map concept. The proposed CBRS design guarantees that the original biometric features are modified and encrypted before being stored in the database, ensuring their protection against malicious cyber-attacks. The suggested technique was tested using different facial biometrics datasets The correlation scores and the Receiver Operating Characteristic curve were calculated to evaluate the system's performance. The analysis results show that the suggested technique is highly effective robust and reliable, as evidenced by its excellent performance across various face databases.
- Open Access
- 26 September 2023
- Published by Egyptian Knowledge Bank in International Journal of Telecommunications
- Vol. 03 (02) , 1-13
Interior design applications based on IoT as detection and es-timation methods
The Internet of Things (IoT) is a paradigm in which objects equipped with sensors, actuators, and processors communicate with each other to serve a meaningful purpose. The current study is the quickly growing topic of interior design as detection for the IoT. To proceed with this development, we need to examine current gaps and trends in application. These papers include sensor monitoring, smart home and innovative city applications, network and infrastructure security, and many other expanding areas. The need to research the many IoT interior design as detection applications has grown because of recent developments in the industry. The classification of IoT detection algorithms is covered after a brief overview of the detection techniques and applications. This survey paper highlights the taxonomy for IoT technologies, highpoints some of the most significant technologies, and profiles some applications that have the potential to make a substantial impact on society. There needs to be more IoT detection approaches in recent papers, where there is a need for Ground Truth data. Finally, we discuss these current issues and propose fresh viewpoints in areas where more research is needed
- 26 September 2023
- Published by Egyptian Knowledge Bank in International Journal of Telecommunications
- Vol. 03 (02) , 1-13
Open AccessInterior design applications based on IoT as detection and es-timation methods
The Internet of Things (IoT) is a paradigm in which objects equipped with sensors, actuators, and processors communicate with each other to serve a meaningful purpose. The current study is the quickly growing topic of interior design as detection for the IoT. To proceed with this development, we need to examine current gaps and trends in application. These papers include sensor monitoring, smart home and innovative city applications, network and infrastructure security, and many other expanding areas. The need to research the many IoT interior design as detection applications has grown because of recent developments in the industry. The classification of IoT detection algorithms is covered after a brief overview of the detection techniques and applications. This survey paper highlights the taxonomy for IoT technologies, highpoints some of the most significant technologies, and profiles some applications that have the potential to make a substantial impact on society. There needs to be more IoT detection approaches in recent papers, where there is a need for Ground Truth data. Finally, we discuss these current issues and propose fresh viewpoints in areas where more research is needed
- Open Access
- 30 June 2023
- Published by Sciences Force - DIGITAL COMMONS JOURNALS in Neutrosophic Systems with Applications
- Vol. 6, 32-38
Neutrosophic Decision Making Model for Investment Portfolios Selection and Optimizing based on Wide Variety of Investment Opportunities and Many Criteria in Market
Investment portfolio selection is a difficult subject due to the presence of competing factors. Choosing a portfolio for one's investments is a major choice that may have far-reaching effects on one's financial well-being. Risk tolerance, time horizon, investing objectives, asset allocation, and investment selection are only a few of the factors that will be studied in this article. The Stable Preference Ordering Towards Ideal Solution (SPOTIS) technique is the basis for our proposed integrated multi-criteria decision-making (MCDM) model. This paper used the single-valued neutrosophic set as a framework to deal with uncertain data. The purpose of the suggested SPOTIS–Neutrosophic model is to choose the most promising investment possibilities by considering several financial variables. Because of the wide variety of investment opportunities and the many elements (political unpredictability, news, economic circumstances, etc.) that may affect the market, investors often worry about selecting and optimizing their investment portfolios.
- 30 June 2023
- Published by Sciences Force - DIGITAL COMMONS JOURNALS in Neutrosophic Systems with Applications
- Vol. 6, 32-38
Open AccessNeutrosophic Decision Making Model for Investment Portfolios Selection and Optimizing based on Wide Variety of Investment Opportunities and Many Criteria in Market
Investment portfolio selection is a difficult subject due to the presence of competing factors. Choosing a portfolio for one's investments is a major choice that may have far-reaching effects on one's financial well-being. Risk tolerance, time horizon, investing objectives, asset allocation, and investment selection are only a few of the factors that will be studied in this article. The Stable Preference Ordering Towards Ideal Solution (SPOTIS) technique is the basis for our proposed integrated multi-criteria decision-making (MCDM) model. This paper used the single-valued neutrosophic set as a framework to deal with uncertain data. The purpose of the suggested SPOTIS–Neutrosophic model is to choose the most promising investment possibilities by considering several financial variables. Because of the wide variety of investment opportunities and the many elements (political unpredictability, news, economic circumstances, etc.) that may affect the market, investors often worry about selecting and optimizing their investment portfolios.