{"title":"Deep kernelized dimensionality reducer for multi-modality heterogeneous data","authors":"Arifa Shikalgar, Shefali Sonavane","doi":"10.1007/s12652-024-04804-z","DOIUrl":"https://doi.org/10.1007/s12652-024-04804-z","url":null,"abstract":"<p>Data mining applications use high-dimensional datasets, but still, a large number of extents causes the well-known ‘Curse of Dimensionality,' which leads to worse accuracy of machine learning classifiers due to the fact that most unimportant and unnecessary dimensions are included in the dataset. Many approaches are employed to handle critical dimension datasets, but their accuracy suffers as a result. As a consequence, to deal with high-dimensional datasets, a hybrid Deep Kernelized Stacked De-Noising Auto encoder based on feature learning was proposed (DKSDA). Because of the layered property, the DKSDA can manage vast amounts of heterogeneous data and performs knowledge-based reduction by taking into account many qualities. It will examine all the multimodalities and all hidden potential modalities using two fine-tuning stages, the input has random noise along with feature vectors, and a stack of de-noising auto-encoders is generated. This SDA processing decreases the prediction error caused by the lack of analysis of concealed objects among the multimodalities. In addition, to handle a huge set of data, a new layer of Spatial Pyramid Pooling (SPP) is introduced along with the structure of Convolutional Neural Network (CNN) by decreasing or removing the remaining sections other than the key characteristic with structural knowledge using kernel function. The recent studies revealed that the DKSDA proposed has an average accuracy of about 97.57% with a dimensionality reduction of 12%. By enhancing the classification accuracy and processing complexity, pre-training reduces dimensionality.</p>","PeriodicalId":14959,"journal":{"name":"Journal of Ambient Intelligence and Humanized Computing","volume":"23 1","pages":""},"PeriodicalIF":0.0,"publicationDate":"2024-05-09","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"140931424","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":3,"RegionCategory":"计算机科学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Issameldeen Elfadul, Lijun Wu, Rashad Elhabob, Ahmed Elkhalil
{"title":"A privacy and compliance in regulated anonymous payment system based on blockchain","authors":"Issameldeen Elfadul, Lijun Wu, Rashad Elhabob, Ahmed Elkhalil","doi":"10.1007/s12652-024-04801-2","DOIUrl":"https://doi.org/10.1007/s12652-024-04801-2","url":null,"abstract":"<p>Decentralized Anonymous Payment Systems (DAP), often known as cryptocurrencies, stand out as some of the most innovative and successful applications on the blockchain. These systems have garnered significant attention in the financial industry due to their highly secure and reliable features. Regrettably, the DAP system can be exploited to fund illegal activities such as drug dealing and terrorism. Therefore, governments are increasingly worried about the illicit use of DAP systems, which poses a critical threat to their security. This paper proposes Privacy and Compliance in Regulated Anonymous Payment System Based on Blockchain (PCRAP), which provides government supervision and enforces regulations over transactions without sacrificing the essential idea of the blockchain, that is, without surrendering transaction privacy or anonymity of the participants. The key characteristic of the proposed scheme is using a ring signature and stealth address to ensure the anonymity of both the sender and receiver of the transaction. Moreover, a Merkle Tree is used to guarantee government supervision and enforce regulations. Our proposed scheme satisfies most of the stringent security requirements and complies with the standards of secure payment systems. Additionally, while our work supports government regulations and supervision, it guarantees unconditional anonymity for users. Furthermore, the performance analysis demonstrates that our suggested scheme still remains applicable and effective even when achieving complete anonymity.</p>","PeriodicalId":14959,"journal":{"name":"Journal of Ambient Intelligence and Humanized Computing","volume":"35 1","pages":""},"PeriodicalIF":0.0,"publicationDate":"2024-05-09","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"140931633","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":3,"RegionCategory":"计算机科学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
{"title":"A top-down character segmentation approach for Assamese and Telugu handwritten documents","authors":"Prarthana Dutta, Naresh Babu Muppalaneni","doi":"10.1007/s12652-024-04805-y","DOIUrl":"https://doi.org/10.1007/s12652-024-04805-y","url":null,"abstract":"<p>Digitization offers a solution to the challenges associated with managing and retrieving paper-based documents. However, these paper-based documents must be converted into a format that digital machines can comprehend, as they primarily understand alphanumeric text. This transformation is achieved through Optical Character Recognition (OCR), a technology that converts scanned image documents into a format that machines can process. A novel top-down character segmentation approach has been proposed in this work, involving multiple stages. Our approach began by isolating lines from handwritten documents and using these lines to segment words and characters. To further enhance the character segmentation, a <i>Raster Scanning</i> object detection technique is employed to isolate individual characters within words. Thus, the character segmentation results are integrated from the results of the vertical projection and raster scanning. Recognizing the significance of advancing digitization of handwritten documents, we have chosen to focus on the regional languages of Assam and Andhra Pradesh due to their historical and cultural importance in India’s linguistic diversity. So, we have collected datasets of handwritten texts in Assamese and Telugu languages due to their unavailability in the desired form. Our approach achieved an average segmentation accuracy of 93.61%, 85.96%, and 88.74% for lines, words, and characters for both languages. The key motivation behind opting for a top-down approach is two-fold: firstly, it enhances the accuracy of character recognition, and secondly, it holds the potential for future use in language/script identification through the utilization of segmented lines and words.</p>","PeriodicalId":14959,"journal":{"name":"Journal of Ambient Intelligence and Humanized Computing","volume":"4 1","pages":""},"PeriodicalIF":0.0,"publicationDate":"2024-05-07","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"140889126","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":3,"RegionCategory":"计算机科学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Xiangping Wu, Zheng Zhang, Wangjun Wan, Shuaiwei Yao
{"title":"Personalized behavior modeling network for human mobility prediction","authors":"Xiangping Wu, Zheng Zhang, Wangjun Wan, Shuaiwei Yao","doi":"10.1007/s12652-024-04806-x","DOIUrl":"https://doi.org/10.1007/s12652-024-04806-x","url":null,"abstract":"<p>Predicting human mobility is essential for urban planning and personalized services. The problem addressed in this study is analyzing user behavior patterns and predicting their next destination. Due to the complexity and diversity of human mobility, it’s necessary to study user behavior patterns from various angles and leverage diverse context information to construct prediction models. Unfortunately, most previous research often neglects personalized preferences and falls short in offering a comprehensive understanding of user behavior patterns. Furthermore, some studies have not effectively mined and utilized contextual information. To address these shortcomings, this paper introduces a novel Personalized Behavior Modeling Network (PBMN). Compared to existing methods, PBMN provides a more comprehensive modeling of user behavior and utilizes context information more extensively, enabling more accurate prediction. It models user behavior through two parallel channels, taking into account both sequential patterns and personalized preferences, while fully utilizing different contextual information. Ultimately, it generates prediction results by personalized integration of different behavior features. Specifically, PBMN employs a pair of attention-based encoders and decoders to model the overall behavior features. Additionally, it utilizes three parallel recurrent neural networks to model recent behavior features at different levels of context information. The performance of PBMN was evaluated using two real-world datasets. Experimental results demonstrate that PBMN outperforms five mainstream prediction methods concerning three commonly used evaluation metrics, emphasizing the effectiveness of PBMN</p>","PeriodicalId":14959,"journal":{"name":"Journal of Ambient Intelligence and Humanized Computing","volume":"28 1","pages":""},"PeriodicalIF":0.0,"publicationDate":"2024-05-06","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"140889124","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":3,"RegionCategory":"计算机科学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
{"title":"Sliced Wasserstein adversarial training for improving adversarial robustness","authors":"Woojin Lee, Sungyoon Lee, Hoki Kim, Jaewook Lee","doi":"10.1007/s12652-024-04791-1","DOIUrl":"https://doi.org/10.1007/s12652-024-04791-1","url":null,"abstract":"<p>Recently, deep-learning-based models have achieved impressive performance on tasks that were previously considered to be extremely challenging. However, recent works have shown that various deep learning models are susceptible to adversarial data samples. In this paper, we propose the sliced Wasserstein adversarial training method to encourage the logit distributions of clean and adversarial data to be similar to each other. We capture the dissimilarity between two distributions using the Wasserstein metric and then align distributions using an end-to-end training process. We present the theoretical background of the motivation for our study by providing generalization error bounds for adversarial data samples. We performed experiments on three standard datasets and the results demonstrate that our method is more robust against white box attacks compared to previous methods.</p>","PeriodicalId":14959,"journal":{"name":"Journal of Ambient Intelligence and Humanized Computing","volume":"16 1","pages":""},"PeriodicalIF":0.0,"publicationDate":"2024-05-05","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"140889847","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":3,"RegionCategory":"计算机科学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
{"title":"Exploring the landscape of network security: a comparative analysis of attack detection strategies","authors":"P. Rajesh Kanna, P. Santhi","doi":"10.1007/s12652-024-04794-y","DOIUrl":"https://doi.org/10.1007/s12652-024-04794-y","url":null,"abstract":"<p>The field of computer networking is experiencing rapid growth, accompanied by the swift advancement of internet tools. As a result, people are becoming more aware of the importance of network security. One of the primary concerns in ensuring security is the authority over domains, and network owners are striving to establish a common language to exchange security information and respond quickly to emerging threats. Given the increasing prevalence of various types of attacks, network security has become a significant challenge in the realm of computing. To address this, a multi-level distributed approach incorporating vulnerability identification, dimensioning, and countermeasures based on attack graphs has been developed. Implementing reconfigurable virtual systems as countermeasures significantly improves attack detection and mitigates the impact of attacks. Password-based authentication, for instance, can be susceptible to password cracking techniques, social engineering attacks, or data breaches that expose user credentials. Similarly, ensuring privacy during data transmission through encryption helps protect data from unauthorized access, but it does not guarantee the prevention of other types of attacks such as malware infiltration or insider threats. This research explores various techniques to achieve effective attack detection. Multiple research methods have been utilized and evaluated to identify the most suitable approach for network security and attack detection in the context of cloud computing. The analysis and implementation of diverse research studies demonstrate that the based signature intrusion detection method outperforms others in terms of precision, recall, F-measure, accuracy, reliability, and time complexity.</p>","PeriodicalId":14959,"journal":{"name":"Journal of Ambient Intelligence and Humanized Computing","volume":"16 1","pages":""},"PeriodicalIF":0.0,"publicationDate":"2024-05-05","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"140889052","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":3,"RegionCategory":"计算机科学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
{"title":"Outage performance of NOMA over shadowed faded channels in interference limited scenario","authors":"Shaik Thaherbasha, Ravindra Dhuli","doi":"10.1007/s12652-024-04802-1","DOIUrl":"https://doi.org/10.1007/s12652-024-04802-1","url":null,"abstract":"<p>In wireless communications networks, the non-orthogonal multiple access (NOMA) technique is different from the existing orthogonal multiple access (OMA) techniques. In NOMA, the available number of resources are more and it leads to multiple access interference. In this paper, initially we developed an analytical framework of interference for NOMA in terms of signal to interference ratio (SIR). Later, we asses the outage probability of NOMA based downlink communication system by considering the effect of interference. The outage probability of NOMA with fixed number of interferers is calculated for different channel propagation effects as Nakagami-<i>m</i>, Rayleigh faded channels with and without log-normal shadowing. The obtained outage probabilities with fixed number of interferers are used to calculate the outage probabilities with random number of interferers (total system outage probability) in different channel propagation effects. In this paper, we proposed a novel algorithm to calculate the total system outage probability for NOMA in different channel propagation effects by choosing different offered load in terms of Erlangs per cell. We calculate the analytical results of outage probability for two users which are at near and edge positions of the cell. The obtained analytical results are supported with simulated NOMA.</p>","PeriodicalId":14959,"journal":{"name":"Journal of Ambient Intelligence and Humanized Computing","volume":"68 1","pages":""},"PeriodicalIF":0.0,"publicationDate":"2024-04-29","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"140840853","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":3,"RegionCategory":"计算机科学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Asieh Kaffashbashi, Vahid Sobhani, Fariba Goodarzian, F. Jolai, A. Aghsami
{"title":"Augmented data strategies for enhanced computer vision performance in breast cancer diagnosis","authors":"Asieh Kaffashbashi, Vahid Sobhani, Fariba Goodarzian, F. Jolai, A. Aghsami","doi":"10.1007/s12652-024-04803-0","DOIUrl":"https://doi.org/10.1007/s12652-024-04803-0","url":null,"abstract":"","PeriodicalId":14959,"journal":{"name":"Journal of Ambient Intelligence and Humanized Computing","volume":"61 12","pages":""},"PeriodicalIF":0.0,"publicationDate":"2024-04-23","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"140670976","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":3,"RegionCategory":"计算机科学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
{"title":"A hybrid model using JAYA-GA metaheuristics for placement of fog nodes in fog-integrated cloud","authors":"Satveer Singh, Deo Prakash Vidyarthi","doi":"10.1007/s12652-024-04796-w","DOIUrl":"https://doi.org/10.1007/s12652-024-04796-w","url":null,"abstract":"<p>It has been observed that Cloud services exhibit suboptimal performance for real-time requests due to increased network delay. Fog computing has emerged to address this issue by deploying Fog nodes at the network's edge. However, determining the optimal placement of Fog nodes for efficient service processing poses a significant challenge. The multiple ways to deploy a Fog node makes the Fog node placement an NP-class problem. It leverages the potential benefit of metaheuristic to solve this problem. In this work, we formulate a linear mathematical model for fog node placement (FNP), considering two important objectives for minimization, i.e., deployment cost (DC) and network latency (NL). A hybrid metaheuristic approach using genetic algorithm (GA) and JAYA, called JAYA-GA, is proposed to address this multi-objective optimization. The proposed model is simulated and the experimental results are compared against three popularly used metaheuristics: particle swarm optimization (PSO), GA, and JAYA. The proposed model consistently outperforms JAYA, PSO, and GA by the averages of 18.40%, 33.58%, and 30.75%, respectively, in terms of fitness (a weighted sum of DC and NL). Additionally, it exhibits superior performance on average convergence rate (16.60%, 53.42%, and 86.59%) and computation time (15.76%, 34.74%, and 59.22%) compared to JAYA, PSO, and GA respectively. Thus, the simulation results establish that the hybrid JAYA-GA technique surpasses the state-of-the-art alternatives on DC, NL, besides computation time and convergence rate.</p>","PeriodicalId":14959,"journal":{"name":"Journal of Ambient Intelligence and Humanized Computing","volume":"18 1","pages":""},"PeriodicalIF":0.0,"publicationDate":"2024-04-21","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"140635826","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":3,"RegionCategory":"计算机科学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}