检索结果-内蒙古大学图书馆

Real-time Volume Preserving Constraints for Volumetric Model on GPU

computers, Materials & Continua 2022年第10期73卷 831-848页

作者： Hongly Va Min-Hyung Choi Min Hong Department of Software Convergence Soonchunhyang UniversityAsan31538Korea Department of Computer Science and Engineering University of Colorado DenverDenver80217COUSA Department of Computer Software Engineering Soonchunhyang UniversityAsan31538Korea

This paper presents a parallel method for simulating real-time 3D deformable objects using the volume preservation mass-spring system method on tetrahedron *** general,the conventional mass-spring system is manipulated as a force-driven method because it is fast,simple to implement,and the parameters can be ***,the springs in traditional mass-spring system can be excessively elongated which cause severe stability and robustness issues that lead to shape restoring,simulation blow-up,and huge volume loss of the deformable *** addition,traditional method that uses a serial process of the central processing unit(CPU)to solve the system in every frame cannot handle the complex structure of deformable object in ***,the first order implicit constraint enforcement for a mass-spring model is utilized to achieve accurate visual realism of deformable objects with tough constraint *** this paper,we applied the distance constraint and volume conservation constraints for each tetrahedron element to improve the stability of deformable object simulation using the mass-spring system and behave the same as its real-world *** reduce the computational complexity while ensuring stable simulation,we applied a method that utilizes OpenGL compute shader,a part of OpenGL Shading Language(GLSL)that executes on the graphic processing unit(GPU)to solve the numerical problems *** applied the proposed methods to experimental volumetric models,and volume percentages of all objects are *** average volume percentages of all models during the simulation using the mass-spring system,distance constraint,and the volume constraint method were 68.21%,89.64%,and 98.70%,*** proposed approaches are successfully applied to improve the stability of mass-spring system and the performance comparison from our experimental tests also shows that the GPU-based method is faster than CPU-based implementation for all cases.

关键词： Deformable object simulation mass-spring system implicit constraint enforcement volume conservation constraint GPU parallel computing

来源：评论

学校读者我要写书评

暂无评论

Assessing Secure OpenID-Based EAAA Protocol to Prevent MITM and Phishing Attacks in Web Apps

引用

computers, Materials & Continua 2023年第6期75卷 4713-4733页

作者： Muhammad Bilal Sandile C.Showngwe Abid Bashir Yazeed Y.Ghadi College of Computer Science and Technology Zhejiang UniversityHangzhou310027China Department of Mathematical Statistics and Actuarial Science Faculty of Natural and Agricultural SciencesUniversity of the Free StateBloemfontein9301South Africa Department of Computer Science National Textile UniversityFaisalabad38000Pakistan Department of Computer Science/Software Engineering Al Ain UniversityAbu DhabiUAE

To secure web applications from Man-In-The-Middle(MITM)and phishing attacks is a challenging task *** this purpose,authen-tication protocol plays a vital role in web communication which securely transfers data from one party to *** authentication works via OpenID,Kerberos,password authentication protocols,***,there are still some limitations present in the reported security *** this paper,the presented anticipated strategy secures both Web-based attacks by leveraging encoded emails and a novel password form pattern *** proposed OpenID-based encrypted Email’s Authentication,Authorization,and Accounting(EAAA)protocol ensure security by relying on the email authenticity and a Special Secret Encrypted Alphanumeric String(SSEAS).This string is deployed on both the relying party and the email server,which is unique and *** first authentication,OpenID Uniform Resource Locator(URL)identity,is performed on the identity provider side.A second authentication is carried out by the hidden Email’s server side and receives a third authentication *** Email’s third SSEAS authentication link manages on the relying party(RP).Compared to existing cryptographic single sign-on protocols,the EAAA protocol ensures that an OpenID URL’s identity is secured from MITM and phishing *** study manages two attacks such as MITM and phishing attacks and gives 339 ms response time which is higher than the already reported methods,such as Single Sign-On(SSO)and *** experimental sites were examined by 72 information technology(IT)specialists,who found that 88.89%of respondents successfully validated the user authorization provided to them via *** proposed EAAA protocol minimizes the higher-level risk of MITM and phishing attacks in an OpenID-based atmosphere.

关键词： Secure user authentication SSO OpenID phishing attack MITM attack

来源：评论

学校读者我要写书评

暂无评论

Collaborative graph contrastive learning for recommendation

引用

Journal of Intelligent and Fuzzy Systems 2025年第1-2期48卷 33-46页

作者： Wei, Tao Yang, Changchun Zheng, Yanqi Zhang, Jingxue School of Computer Science and Artificial Intelligence Aliyun School of Big Data School of Software Changzhou University Jiangsu Changzhou China School of Microelectronics and Control Engineering Changzhou University Jiangsu Changzhou China

Recently, Graph Neural Networks (GNNs) using aggregating neighborhood collaborative information have shown effectiveness in recommendation. However, GNNs-based models suffer from over-smoothing and data sparsity problems. Due to its self-supervised nature, contrastive learning has gained considerable attention in the field of recommendation, aiming at alleviating highly sparse data. Graph contrastive learning models are widely used to learn the consistency of representations by constructing different graph augmentation views. Most current graph augmentation with random perturbation destroy the original graph structure information, which mislead embeddings learning. In this paper, an effective graph contrastive learning paradigm CollaGCL is proposed, which constructs graph augmentation by using singular value decomposition to preserve crucial structure information. CollaGCL enables perturbed views to effectively capture global collaborative information, mitigating the negative impact of graph structural perturbations. To optimize the contrastive learning task, the extracted meta-knowledge was propagate throughout the original graph to learn reliable embedding representations. The self-information learning between views enhances the semantic information of nodes, thus alleviating the problem of over-smoothing. Experimental results on three real-world datasets demonstrate the significant improvement of CollaGCL over state-of-the-art methods. © 2025 – IOS Press. All rights reserved.

关键词： Self-supervised learning

来源：评论

学校读者我要写书评

暂无评论

Smart Glove with Mobile Application to Detect Static Arabic Hijaiyah Hand Code for Quran Recitation 21

Smart Glove with Mobile Application to Detect Static Arabic ...

引用

21st International Learning and Technology Conference, L and T 2024

作者： Elshareif, Mohamed Elgilani Eltahir Ahmad Alias, Nurul Aswani Jomhari, Nazean Sofian, Hazrina University of Malaya Faculty of Computer Science and Information Technology Department of Software Engineering Kuala Lumpur Malaysia

ISBN: (纸本)9798350393569

The use of assistive technology in the field of education is now a common practice in today's tech-driven era. The implementation is quite rampant in all levels and sections of education, including by special needs students with hearing impairments. With the help of technology or Internet of Things (IoT), they are offered with better opportunities to improve their communication and the teaching and learning process especially when it comes to sign language. However, the situation is quite different for Muslim deaf individuals. Sign language is not only used for communication but also as a form for reciting the Quran. Yet, the utilization of technology in the area of sign language for Quranic recitation is still limited. Hence, the goal of this study was to design and develop a sensor-based sign language recognition device consisting of a sensory smart glove and mobile application to detect Arabic sign language alphabets used in Quran recitation. The experimental result shows that the gesture recognition rate of 28 different Arabic alphabet signs, performed by 7 different signers, is 79.08%. The significance of the system lies in its mobility and capability to recognize the hand gestures regardless of the background noise. © 2024 IEEE.

关键词： Assistive technology

来源：评论

学校读者我要写书评

暂无评论

Improved Belief Propagation Decoder for LDPC-CRC-Polar Codes with Bit-Freezing

引用

China Communications 2024年第7期21卷 135-148页

作者： Qasim Jan Yin Chao Pan Zhiwen Muhammad Furqan Zakir Ali You Xiaohu National Mobile Communications Research Laboratory Southeast UniversityNanjing 210096China Purple Mountain Laboratories Nanjing 211100China Department of Computer Science National University of Computer and Emerging Sciences Peshawar Campus 25100Pakistan Department of Software Engineering Capital University of Science and Technology(CUST)Islamabad 44000Pakistan Department of Computer Sciences Bahria University Lahore CampusPakistan

Though belief propagation bit-flip(BPBF)decoding improves the error correction performance of polar codes,it uses the exhaustive flips method to achieve the error correction performance of CA-SCL decoding,thus resulting in high decoding complexity and *** alleviate this issue,we incorporate the LDPC-CRC-Polar coding scheme with BPBF and propose an improved belief propagation decoder for LDPC-CRC-Polar codes with bit-freezing(LDPCCRC-Polar codes BPBFz).The proposed LDPCCRC-Polar codes BPBFz employs the LDPC code to ensure the reliability of the flipping set,i.e.,critical set(CS),and dynamically update *** modified CS is further utilized for the identification of error-prone *** proposed LDPC-CRC-Polar codes BPBFz obtains remarkable error correction performance and is comparable to that of the CA-SCL(L=16)decoder under medium-to-high signal-to-noise ratio(SNR)*** gains up to 1.2dB and 0.9dB at a fixed BLER=10-4compared with BP and BPBF(CS-1),*** addition,the proposed LDPC-CRC-Polar codes BPBFz has lower decoding latency compared with CA-SCL and BPBF,i.e.,it is 15 times faster than CA-SCL(L=16)at high SNR regions.

关键词： belief propagation bit-flipping concatenated codes LDPC-CRC-Polar codes polar codes

来源：评论

学校读者我要写书评

暂无评论

Density estimation-based method to determine sample size for random sample partition of big data

引用

Frontiers of computer science 2024年第5期18卷 57-70页

作者： Yulin HE Jiaqi CHEN Jiaxing SHEN Philippe FOURNIER-VIGER Joshua Zhexue HUANG Guangdong Laboratory of Artificial Intelligence and Digital Economy(SZ) Shenzhen 518107China College of Computer Science and Software Engineering Shenzhen UniversityShenzhen 518060China Department of Computing and Decision Sciences Lingnan UniversityHong Kong 999077China

Random sample partition(RSP)is a newly developed big data representation and management model to deal with big data approximate computation *** research and practical applications have confirmed that RSP is an efficient solution for big data processing and ***,a challenge for implementing RSP is determining an appropriate sample size for RSP data *** a large sample size increases the burden of big data computation,a small size will lead to insufficient distribution information for RSP data *** address this problem,this paper presents a novel density estimation-based method(DEM)to determine the optimal sample size for RSP data ***,a theoretical sample size is calculated based on the multivariate Dvoretzky-Kiefer-Wolfowitz(DKW)inequality by using the fixed-point iteration(FPI)***,a practical sample size is determined by minimizing the validation error of a kernel density estimator(KDE)constructed on RSP data blocks for an increasing sample ***,a series of persuasive experiments are conducted to validate the feasibility,rationality,and effectiveness of *** results show that(1)the iteration function of the FPI method is convergent for calculating the theoretical sample size from the multivariate DKW inequality;(2)the KDE constructed on RSP data blocks with sample size determined by DEM can yield a good approximation of the probability density function(p.d.f);and(3)DEM provides more accurate sample sizes than the existing sample size determination methods from the perspective of *** demonstrates that DEM is a viable approach to deal with the sample size determination problem for big data RSP implementation.

关键词： random sample partition big data sample size Dvoretzky-Kiefer-Wolfowitz inequality kerneldensity estimator probability density function

来源：评论

学校读者我要写书评

暂无评论

MOALF-UAV-MEC: Adaptive Multi-Objective Optimization for UAV-Assisted Mobile Edge Computing in Dynamic IoT Environments

引用

IEEE Internet of Things Journal 2025年第12期12卷 20736-20756页

作者： Al-Bakhrani, Ali A. Li, Mingchu Obaidat, Mohammad S. Amran, Gehad Abdullah Dalian University of Technology School of Software Dalian116024 China Albaydha University Al Bayda Yemen Jiangxi Normal University School of Computer and Information Engineering Jiangxi China School of Software Technology Dalian University of Technology Nanchang Dalian China University of Science and Technology School of Computer and Communication Engineering Beijing100083 China SRM University School of Computing Department of Computational Intelligence TN Kattankulathur603203 India The Amity University School of Engineering UP Noida201301 India Dalian University of Technology Department of Management Science and Engineering Dalian116024 China

The proliferation of Internet of Things (IoT) devices and computation-intensive applications has led to unprecedented demands on network resources and computing capabilities. This paper presents MOALF-UAV-MEC, a novel Multi-Objective Adaptive Learning Framework for UAV-Assisted Mobile Edge Computing (MEC) tailored for dynamic IoT environments. The framework integrates Multi-Objective Reinforcement Learning (MORL), Model Predictive Control (MPC), Adaptive Particle Swarm Optimization (APSO), and Lyapunov Optimization to optimize UAV trajectories, dynamic resource allocation, and system stability. MOALF-UAV-MEC addresses critical challenges in UAV-assisted MEC, including multi-objective optimization, adaptive resource allocation, energy efficiency, scalability, and quality of service guarantees. Our approach employs a unique burst mode feature for UAVs, enabling temporary performance boosts in high-demand situations. Extensive simulations demonstrate the framework's efficiency in enhancing task completion rates, energy efficiency, and long-term system sustainability. Results show a task completion rate of 94.50%, significantly outperforming existing approaches, with an average of 1,890 completed tasks per UAV and a load balancing efficiency of 96%. The framework exhibits robust adaptive behavior, achieving a 38% reduction in UAV route optimization and a 55% increase in task completion during high-load periods. This research contributes to the advancement of edge computing in IoT environments, offering a scalable and adaptive solution for deploying computational resources in areas with limited infrastructure, during temporary events, or in emergency situations. © 2014 IEEE.

关键词： Model predictive control

来源：评论

学校读者我要写书评

暂无评论

Enhancing Topic Interpretability for Neural Topic Modeling Through Topic-Wise Contrastive Learning 40

Enhancing Topic Interpretability for Neural Topic Modeling T...

引用

40th IEEE International Conference on Data engineering, ICDE 2024

作者： Gao, Xin Lin, Yang Li, Ruiqing Wang, Yasha Chu, Xu Ma, Xinyu Yu, Hailong Software Engineering Institution School of Computer Science Peking University Beijing China Key Lab of High Confidence Software Technologies Ministry of Education Beijing China Peking University National Engineering Research Center of Software Engineering Beijing China School of Computer Science Center on Frontiers of Computing Studies Peking University China

ISBN: (纸本)9798350317152

Data mining and knowledge discovery are essential aspects of extracting valuable insights from vast datasets. Neural topic models (NTMs) have emerged as a valuable unsupervised tool in this field. However, the predominant objective in NTMs, which aims to discover topics maximizing data likelihood, often lacks alignment with the central goals of data mining and knowledge discovery which is to reveal interpretable insights from large data repositories. Overemphasizing likelihood maximization without incorporating topic regularization can lead to an overly expansive latent space for topic modeling. In this paper, we present an innovative approach to NTMs that addresses this misalignment by introducing contrastive learning measures to assess topic interpretability. We propose a novel NTM framework, named ContraTopic, that integrates a differentiable regularizer capable of evaluating multiple facets of topic interpretability throughout the training process. Our regularizer adopts a unique topic-wise contrastive methodology, fostering both internal coherence within topics and clear external distinctions among them. Comprehensive experiments conducted on three diverse datasets demonstrate that our approach consistently produces topics with superior interpretability compared to state-of-the-art NTMs. © 2024 IEEE.

关键词： Data mining

来源：评论

学校读者我要写书评

暂无评论

ViF-SD2E: a robust weakly-supervised framework for neural decoding

引用

Neural Computing and Applications 2025年第9期37卷 6645-6661页

作者： Feng, Jingyi Luo, Yong Song, Shuang Hu, Han National Engineering Research Center for Multimedia Software School of Computer Science Wuhan University Wuhan430072 China School of Information and Electronics Beijing Institute of Technology Beijing100081 China

Neural decoding plays a vital role in the interaction between the brain and the outside world. Our task in this paper is to decode the movement track of a finger directly based on the neural data. Existing neural decoding solutions primarily perform some preprocessing operations on neural data before feeding them into existing models (such as LSTM) for decoding. However, these solutions either are prone to overfitting or cannot well exploit the spatial and temporal information. In our previous observations, there is a symmetrical phenomenon between the unsupervised decoded trajectory and the ground truth trajectory within the activity space. This precisely motivates us to propose (or derive) a robust weakly-supervised framework (or model structure), called ViF-SD2E, for neural decoding. In particular, it consists of a space-division (SD) module and an exploration–exploitation (2E) strategy, to effectively exploit both the spatial information of the outside world and the temporal information of neural activity, where the SD2E output is analogized with the weak 0/1 vision feedback (ViF) label for training. Extensive experiments demonstrate the effectiveness of our method, which can sometimes be comparable to supervised counterparts. Therefore, we redirect our attention to the information (hidden in data) ViF-SD2E conveys to us. In other words, we believe that the advantage of ViF-SD2E lies in the fact that its processing steps are objectively determined by the inherent attributes (i.e., symmetry) of the neural data, or rather, the model structure is fixed. © The Author(s), under exclusive licence to Springer-Verlag London Ltd., part of Springer Nature 2025.

关键词： Space division multiple access

来源：评论

学校读者我要写书评

暂无评论

Support vector machine with discriminative low-rank embedding

引用

CAAI Transactions on Intelligence Technology 2024年第5期9卷 1249-1262页

作者： Guangfei Liang Zhihui Lai Heng Kong Computer Vision Institute College of Computer Science and Software EngineeringShenzhen UniversityShenzhenChina Shenzhen Institute of Artificial Intelligence and Robotics for Society ShenzhenChina Department of Breast and Thyroid Surgery BaoAn Central Hospital of ShenzhenShenzhenChina

Support vector machine(SVM)is a binary classifier widely used in machine ***,neglecting the latent data structure in previous SVM can limit the performance of SVM and its *** address this issue,the authors propose a novel SVM with discriminative low-rank embedding(LRSVM)that finds a discriminative latent low-rank subspace more suitable for SVM *** extension models of LRSVM are introduced by imposing different orthogonality constraints to prevent computational inaccuracies.A detailed derivation of the authors’iterative algorithms are given that is essentially for solving the SVM on the low-rank ***,some theorems and properties of the proposed models are presented by the *** is worth mentioning that the subproblems of the proposed algorithms are equivalent to the standard or the weighted linear discriminant analysis(LDA)*** indicates that the projection subspaces obtained by the authors’algorithms are more suitable for SVM classification compared to those from the LDA *** convergence analysis for the authors proposed algorithms are also ***,the authors conduct experiments on various machine learning data sets to evaluate the *** experiment results show that the authors’algorithms perform significantly better than other algorithms,which indicates their superior abilities on classification tasks.

关键词： iterative methods machine leaning support vector machunes

来源：评论

学校读者我要写书评

暂无评论

建议与咨询留下您的常用邮箱和电话号码，以便我们向您反馈解决方案和替代方法

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

建议与咨询 留下您的常用邮箱和电话号码，以便我们向您反馈解决方案和替代方法

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案： 新增检索档案 确定 取消

请选择收藏分类： 新增自定义分类 确定 取消

通借通还

建议与咨询留下您的常用邮箱和电话号码，以便我们向您反馈解决方案和替代方法

请选择保存的检索档案：

请选择收藏分类：