Jesus Mayor;Laura Raya;Sofia Bayona;Alberto Sanchez
{"title":"A Virtual Reality Perceptual Study of Multi-Technique Redirected Walking Method","authors":"Jesus Mayor;Laura Raya;Sofia Bayona;Alberto Sanchez","doi":"10.1109/TETC.2024.3471249","DOIUrl":"https://doi.org/10.1109/TETC.2024.3471249","url":null,"abstract":"Within virtual reality experiences, locomotion methods manage the user’s movement within the virtual environment. The use of natural locomotion, common in virtual reality, can be limited in video games with large scenarios. Thus, video games with gamepad or teleport-based locomotion methods are gaining importance. Redirected walking methods focus on maximizing the exploitation of the real workspace. As the user moves in the real environment, subtle modifications are applied to that movement within the virtual environment. Although the results of the Multi-Technique Redirected Walking (MTRW) method that combines the application of four gain algorithms are promising, a perceptual evaluation with users is needed to determine its suitability. This article presents the perceptual evaluation of the presence and cybersickness factors for the MTRW method, comparing it with a Fully Natural Walking (FNW) method. The presence factor was measured with the Igroup Presence Questionnaire (IPQ), and no significant differences in the overall presence score were detected between the FNW and the MTRW methods. The cybersickness factor was measured using the Simulator Sickness Questionnaire (SSQ) and, this time, significant differences in cybersickness between the two locomotion methods were obtained. The potential increase in cybersickness should be weighed against the benefit of maximizing workspace utilization.","PeriodicalId":13156,"journal":{"name":"IEEE Transactions on Emerging Topics in Computing","volume":"13 3","pages":"604-613"},"PeriodicalIF":5.4,"publicationDate":"2024-10-09","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"https://ieeexplore.ieee.org/stamp/stamp.jsp?tp=&arnumber=10713064","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"145051022","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":2,"RegionCategory":"计算机科学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"OA","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
{"title":"NGQR: A Novel Generalized Quantum Image Representation","authors":"Zheng Xing;Xiaochen Yuan;Chan-Tong Lam;Penousal Machado","doi":"10.1109/TETC.2024.3471086","DOIUrl":"https://doi.org/10.1109/TETC.2024.3471086","url":null,"abstract":"To address the size limitations of existing quantum image models in terms of accurate image representation, as well as inaccurate image operation and retrieval, we propose a Novel Generalized Quantum Image Representation (NGQR) for images of arbitrary size and type. For generalizing the size model, we first propose the Perception-Aided Encoding (PE) method to perceive the target qubits in the quantum information. Based on PE, we propose the quantum image representation PE-NGQR, which accurately ignores redundant information thereby targeting valid pixels for operations and retrieval. Then, to accurately represent the needed pixel information without redundancy, we propose the Coherent-Size Encoding (CE) method. The CE can encode an arbitrary number of quantum states. Based on CE, we propose CE-NGQR, a quantum image model capable of accurate image representation, processing and retrieval. Specifically, we describe in detail the concept, representation and quantum circuits of NGQR. We provide detailed quantum circuits and simulations of NGQR-based operations and geometric transformations. Moreover, NGQR enables flexible quantum image scaling. We illustrate the complementarity of the proposed PE-NGQR and CE-NGQR through complexity simulations and clarify the respective applicability scenarios. Finally, comparisons and analyses with existing quantum image models demonstrate the versatility and flexibility advantages of NGQR.","PeriodicalId":13156,"journal":{"name":"IEEE Transactions on Emerging Topics in Computing","volume":"13 3","pages":"591-603"},"PeriodicalIF":5.4,"publicationDate":"2024-10-07","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"145050994","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":2,"RegionCategory":"计算机科学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
{"title":"A Comparative Analysis of Software Aging in Relational Database System Environments","authors":"Herderson Couto;Fumio Machida;Gustavo Callou;Ermeson Andrade","doi":"10.1109/TETC.2024.3471684","DOIUrl":"https://doi.org/10.1109/TETC.2024.3471684","url":null,"abstract":"Computer systems that operate continuously over extended periods of time can be susceptible to a phenomenon known as software aging. This phenomenon can result in the gradual depletion of computational resources and has the potential to cause performance degradation in these systems. Among the systems affected, Database Management Systems (DBMSs) are particularly crucial. The consequences of software aging in DBMSs can result in data loss, compromised database integrity, transaction failures, and negative effects on system availability. This work analyzes and compares the effects of software aging in systems using SQL Server and MySQL DBMSs. The presence of this phenomenon is confirmed through statistical analysis of memory consumption and response time degradation. Process-level analysis identified database and server processes contributing most to memory consumption. Additionally, we developed machine learning models to predict memory exhaustion in both SQL Server and MySQL environments across diverse workloads.","PeriodicalId":13156,"journal":{"name":"IEEE Transactions on Emerging Topics in Computing","volume":"13 2","pages":"370-381"},"PeriodicalIF":5.1,"publicationDate":"2024-10-07","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"144323227","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":2,"RegionCategory":"计算机科学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
{"title":"IEEE Transactions on Emerging Topics in Computing Information for Authors","authors":"","doi":"10.1109/TETC.2024.3449211","DOIUrl":"https://doi.org/10.1109/TETC.2024.3449211","url":null,"abstract":"","PeriodicalId":13156,"journal":{"name":"IEEE Transactions on Emerging Topics in Computing","volume":"12 3","pages":"C2-C2"},"PeriodicalIF":5.1,"publicationDate":"2024-09-05","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"https://ieeexplore.ieee.org/stamp/stamp.jsp?tp=&arnumber=10666934","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"142143744","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":2,"RegionCategory":"计算机科学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"OA","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
{"title":"Special Section on Emerging Social Computing","authors":"Yuan-Hao Chang;Paloma Díaz;Yunpeng Xiao","doi":"10.1109/TETC.2024.3447428","DOIUrl":"https://doi.org/10.1109/TETC.2024.3447428","url":null,"abstract":"","PeriodicalId":13156,"journal":{"name":"IEEE Transactions on Emerging Topics in Computing","volume":"12 3","pages":"686-687"},"PeriodicalIF":5.1,"publicationDate":"2024-09-05","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"https://ieeexplore.ieee.org/stamp/stamp.jsp?tp=&arnumber=10666936","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"142143745","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":2,"RegionCategory":"计算机科学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"OA","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
{"title":"DALTON - Deep Local Learning in SNNs via Local Weights and Surrogate-Derivative Transfer","authors":"Ramashish Gaurav;Duy Anh Do;Thinh T. Doan;Yang Yi","doi":"10.1109/TETC.2024.3440932","DOIUrl":"10.1109/TETC.2024.3440932","url":null,"abstract":"Direct training of Spiking Neural Networks (SNNs) is a challenging task because of their inherent temporality. Added to it, the vanilla Back-propagation based methods are not applicable either, due to the non-differentiability of the spikes in SNNs. Surrogate-Derivative based methods with Back-propagation Through Time (BPTT) address these direct training challenges quite well; however, such methods are not neuromorphic-hardware friendly for the On-chip training of SNNs. Recently formalized Three-Factor based Rules (TFR) for direct local-training of SNNs are neuromorphic-hardware friendly; however, they do not effectively leverage the depth of the SNN architectures (we show it empirically here), thus, are limited. In this work, we present an <italic>improved version</i> of a conventional three-factor rule, for local learning in SNNs which effectively leverages depth – in the context of learning features hierarchically. Taking inspiration from the Back-propagation algorithm, we theoretically derive our improved, local, three-factor based learning method, named DALTON (<underline>D</u>eep Loc<underline>A</u>l <underline>L</u>earning via local Weigh<underline>T</u>s and Surr<underline>O</u>gate-Derivative Tra<underline>N</u>sfer), which employs <italic>weights</i> and <italic>surrogate-derivative</i> transfer from the local layers. Along the lines of TFR, our proposed method DALTON is also amenable to the neuromorphic-hardware implementation. Through extensive experiments on static (MNIST, FMNIST, & CIFAR10) and event-based (N-MNIST, DVS128-Gesture, & DVS-CIFAR10) datasets, we show that our proposed local-learning method DALTON makes <italic>effective use of the depth</i> in Convolutional SNNs, compared to the vanilla TFR implementation.","PeriodicalId":13156,"journal":{"name":"IEEE Transactions on Emerging Topics in Computing","volume":"13 3","pages":"578-590"},"PeriodicalIF":5.4,"publicationDate":"2024-08-27","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"142216773","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":2,"RegionCategory":"计算机科学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
{"title":"DP-PartFIM: Frequent Itemset Mining Using Differential Privacy and Partition","authors":"Xinyu Liu;Wensheng Gan;Lele Yu;Yining Liu","doi":"10.1109/TETC.2024.3443060","DOIUrl":"10.1109/TETC.2024.3443060","url":null,"abstract":"Itemset mining is a popular data mining technique for extracting interesting and valuable information from large datasets. However, since datasets contain sensitive private data, it is not permitted to directly mine the data or share the mining results. Previous privacy-preserving frequent itemset mining research was not efficient because of the use of privacy budgets or long transaction truncation strategies, which are impractical for large datasets. In this article, we propose a more efficient partition mining technology, DP-PartFIM, based on differential privacy, which protects privacy while mining data. DP-PartFIM uses partition mining to mine frequent itemsets and constructs vertical data storage formats for each partition, which makes the algorithm equally efficient for large datasets. To protect data privacy, DP-PartFIM adds Laplace noise to support candidate itemsets. The experimental results show that, compared with the classical privacy-preserving itemset mining methods, DP-PartFIM better guarantees data utility and privacy.","PeriodicalId":13156,"journal":{"name":"IEEE Transactions on Emerging Topics in Computing","volume":"13 3","pages":"567-577"},"PeriodicalIF":5.4,"publicationDate":"2024-08-26","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"142216774","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":2,"RegionCategory":"计算机科学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
{"title":"TampML: Tampering Attack Detection and Malicious Nodes Localization in NoC-Based MPSoC","authors":"Haoyu Wang;Basel Halak","doi":"10.1109/TETC.2024.3434663","DOIUrl":"10.1109/TETC.2024.3434663","url":null,"abstract":"The relentless growth in demand for computing resources has spurred the development of large-scale, high-performance chips with diverse, innovative architectures. The Network-on-Chip (NoC) paradigm has become a predominant system for on-chip communication within Multi-Processor System-on-Chip (MPSoC) designs. However, the increasing complexity and the reliance on outsourced Third-Party Intellectual Properties (3PIPs) introduce non-negligible risks of Hardware Trojan (HT) insertions by untrusted IP vendors. One of the most critical threats posed by HTs is the tampering with communication data packets. In this article, we introduce a comprehensive framework for the detection of tampering attacks and localization of HTs within NoCs. This framework is incorporated into a novel distributed monitoring architecture that leverages the NoC structure. Utilizing a machine learning model for malicious flit detection and a high-precision algorithm for HT node localization, the framework's efficacy has been substantiated through tests with real PARSEC benchmark workloads. Achieving an impressive detection accuracy and precision of 99.8% and 99.5% respectively, the framework can localize HT nodes with up to 100% precision and recall in most cases. Furthermore, the data cost of localization is on average only 3.7% of tampered flits, which is significantly more efficient—up to 11 times faster—than our initial methods. As a comprehensive and cutting-edge security solution for combating communication data tampering attacks, it accomplishes the expected performance while maintaining minimal power and hardware overhead.","PeriodicalId":13156,"journal":{"name":"IEEE Transactions on Emerging Topics in Computing","volume":"13 2","pages":"551-562"},"PeriodicalIF":5.1,"publicationDate":"2024-08-26","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"142216835","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":2,"RegionCategory":"计算机科学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
{"title":"A Novel Adaptive $360^{circ }$360∘ Livestreaming With Graph Representation Learning Based FoV Prediction","authors":"Xingyan Chen;Huaming Du;Mu Wang;Yu Zhao;Xiaoyang Shu;Changqiao Xu;Gabriel-Miro Muntean","doi":"10.1109/TETC.2024.3435002","DOIUrl":"10.1109/TETC.2024.3435002","url":null,"abstract":"The exceptionally high bandwidth requirements associated with the delivery of live <inline-formula><tex-math>$360^{circ }$</tex-math></inline-formula> video content pose significant challenges in the current network context. An avenue for addressing this bandwidth challenge is to use the limited network resources for sending the user's Field-of-View (FoV) tiles at a high resolution, instead of transmitting all frame components at high quality. However, precisely forecasting the FoV for <inline-formula><tex-math>$360^{circ }$</tex-math></inline-formula> live video content distribution remains a complex endeavor due to the lack of pre-knowledge on user viewing behaviors. In this paper, we present GL360, a novel <inline-formula><tex-math>$360^{circ }$</tex-math></inline-formula> transmission framework, which employs Graph Representation Learning for FoV prediction. First, we analyze the interaction between users and tiles in panoramic videos utilizing a dynamic heterogeneous <u>R</u>elational <u>G</u>raph <u>C</u>onvolutional <u>N</u>etwork (RGCN), which facilitates efficient user and tile embedding representation learning. Second, we propose an online dynamic heterogeneous graph learning (DHGL)-based algorithm to dynamically capture the time-varying features of the user's viewing behaviors with limited prior knowledge. Further, we design a FoV-aware content delivery algorithm that allows the edge servers to determine the video tiles’ resolution for each accessed user. Experimental results based on real traces demonstrate how our solution outperforms four other solutions in terms of FoV prediction and network performance.","PeriodicalId":13156,"journal":{"name":"IEEE Transactions on Emerging Topics in Computing","volume":"13 2","pages":"537-550"},"PeriodicalIF":5.1,"publicationDate":"2024-08-09","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"141934470","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":2,"RegionCategory":"计算机科学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}