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

A Novel Parallel Computing Confidentiality Scheme Based on Hindmarsh-Rose Model

computers, Materials & Continua 2023年第8期76卷 1325-1341页

作者： Jawad Ahmad Mimonah Al Qathrady Mohammed SAlshehri Yazeed Yasin Ghadi Mujeeb Ur Rehman Syed Aziz Shah School of Computing Engineering and the Built EnvironmentEdinburgh Napier UniversityEdinburghEH105DTUK Department of Information Systems College of Computer Science and Information SystemsNajran UniversityNajran61441Saudi Arabia Department of Computer Science College of Computer Science and Information SystemsNajran UniversityNajran61441Saudi Arabia Department of Computer Science Al Ain UniversityAbu Dhabi112612United Arab Emirates School of Science Technology and HealthYork St John UniversityYorkYO317EXUK Research Centre for Intelligent Healthcare Coventry UniversityCoventryCV15FBUK

Due to the inherent insecure nature of the Internet,it is crucial to ensure the secure transmission of image data over this ***,given the limitations of computers,it becomes evenmore important to employ efficient and fast image encryption *** 1D chaotic maps offer a practical approach to real-time image encryption,their limited flexibility and increased vulnerability restrict their practical *** this research,we have utilized a 3DHindmarsh-Rosemodel to construct a secure *** randomness of the chaotic map is assessed through standard *** proposed system enhances security by incorporating an increased number of system parameters and a wide range of chaotic parameters,as well as ensuring a uniformdistribution of chaotic signals across the entire value ***,a fast image encryption technique utilizing the new chaotic system is *** novelty of the approach is confirmed through time complexity *** further strengthen the resistance against cryptanalysis attacks and differential attacks,the SHA-256 algorithm is employed for secure key *** results through a number of parameters demonstrate the strong cryptographic performance of the proposed image encryption approach,highlighting its exceptional suitability for secure ***,the security of the proposed scheme has been compared with stateof-the-art image encryption schemes,and all comparison metrics indicate the superior performance of the proposed scheme.

关键词： Hindmarsh-rose model image encryption SHA-256 parallel computing

来源：评论

学校读者我要写书评

暂无评论

A survey on hyperspectral image restoration: from the view of low-rank tensor approximation

引用

Science China(information Sciences) 2023年第4期66卷 33-63页

作者： Na LIU Wei LI Yinjian WANG Ran TAO Qian DU Jocelyn CHANUSSOT School of Information and Electronics and Beijing Key Laboratory of Fractional Signals and Systems Beijing Institute of Technology Department of Electrical and Computer Engineering Mississippi State University GIPSA-Lab University of Grenoble Alpes Aerospace Information Research Institute Chinese Academy of Sciences

The ability to capture fine spectral discriminative information enables hyperspectral images(HSIs) to observe, detect and identify objects with subtle spectral discrepancy. However, the captured HSIs may not represent the true distribution of ground objects and the received reflectance at imaging instruments may be degraded, owing to environmental disturbances, atmospheric effects, and sensors' hardware limitations. These degradations include but are not limited to complex noise, heavy stripes, deadlines,cloud/shadow occlusion, blurring and spatial-resolution degradation, etc. These degradations dramatically reduce the quality and usefulness of HSIs. Low-rank tensor approximation(LRTA) is such an emerging technique, having gained much attention in the HSI restoration community, with an ever-growing theoretical foundation and pivotal technological innovation. Compared to low-rank matrix approximation(LRMA),LRTA characterizes more complex intrinsic structures of high-order data and owns more efficient learning abilities, being established to address convex and non-convex inverse optimization problems induced by HSI restoration. This survey mainly attempts to present a sophisticated, cutting-edge, and comprehensive technical survey of LRTA toward HSI restoration, specifically focusing on the following six topics: denoising, fusion,destriping, inpainting, deblurring, and super-resolution. For each topic, state-of-the-art restoration methods are introduced, with quantitative and visual performance assessments. Open issues and challenges are also presented, including model formulation, algorithm design, prior exploration, and application concerning the interpretation requirements.

关键词： hyperspectral image image restoration low-rank tensor approximation multisource fusion remote sensing

来源：评论

学校读者我要写书评

暂无评论

AESHA3: Efficient and Secure Sub-Key Generation for AES Using SHA-3 14th

AESHA3: Efficient and Secure Sub-Key Generation for AES Us...

引用

14th EAI International Conference on Broadband Communications, Networks, and systems, BROADNETS 2024

作者： Soni, Ankush Sahay, Sanjay K. Mehta, Parit Department of Computer Science and Information Systems BITS Pilani K. K. Birla Goa Campus Zuarinagar India

ISBN: (纸本)9783031811678

Advanced Encryption Standard (AES) is one of the most widely used symmetric cipher for the confidentiality of data. Also it is used for other security services, viz. integrity, authentication and key establishment. However, recently, authors have shown some weakness in the generation of sub-keys in AES, e.g. bit leakage attack, etc. Also, AES sub-keys are generated sequentially, which is an overhead, especially for resource-constrained devices. Therefore, we propose and investigate a novel encryption AESHA3, which uses sub-keys generated by Secure Hash Algorithm-3 (SHA3). The output of SHA3 is one-way and highly non-linear, and random. The experimental analysis shows that the average time taken for generating the sub-keys to be used for encrypting the data using our approach i.e. AESHA3 is ∼1300 times faster than the sub-key generated by the standard AES. Accordingly, we find that AESHA3 will be very relevant not only in terms of security but also it will save the resources in IoT devices. We investigated AESHA3 in Intel Core i7, 6th Generation processor and Raspberry Pi 4B and found that up to two MB data encryption is very significant, and lesser the data size, more the resource saving compared to AES. © ICST Institute for computer Sciences, Social Informatics and Telecommunications Engineering 2025.

关键词： Encryption algorithms

来源：评论

学校读者我要写书评

暂无评论

Boxly: Design and Architecture of a Smart Physical Therapy Clinic for People Having Mobility Disability Using Metaverse, AI, and IoT Technologies in Saudi Arabia

Boxly: Design and Architecture of a Smart Physical Therapy C...

引用

2024 IEEE International Conference on information Technology, Electronics and Intelligent Communication systems, ICITEICS 2024

作者： Aldolaim, Rayhanah Jassim Gull, Hina Iqbal, Sardar Zafar College of Computer Science and Information Technology Imam Abdulrahman Bin Faisal University Department of Computer Information Systems P.O. Box 1982 Dammam31441 Saudi Arabia

ISBN: (纸本)9798350382693

People with mobility limitations and impairments frequently receive repetitive remedial physiotherapy sessions to reduce functional deficits in the afflicted area. Even though therapy processes can enhance functional results and reduce the likelihood of long-term disability, patients frequently fail to fully participate in physical therapies due to procedural pain. In recent years, emerging technologies such as artificial intelligence have played a pivotal role in health care, particularly in the treatment of patients with physical limitations. Furthermore, leveraging the metaverse and the Internet of Things (IoT) provides value to therapies such as physical therapy by improving the environment while saving effort and time. In this paper, we propose a new system for physical therapy clinics in Saudi Arabia. It applies modern technologies such as metaverse, AI, and IoT to overcome the barriers that therapists and patients face during treatment, like inaccurate measurements, long periods of rehabilitation, and ongoing pain and feelings of fear. © 2024 IEEE.

关键词： Patient treatment

来源：评论

学校读者我要写书评

暂无评论

A trustless architecture of blockchain-enabled metaverse

引用

High-Confidence Computing 2023年第1期3卷 1-7页

作者： Minghui Xu Yihao Guo Qin Hu Zehui Xiong Dongxiao Yu Xiuzhen Cheng School Computer Science and Technology Shandong UniversityQingdao 266237China Department of Computer and Information Science Indiana University-Purdue University IndianapolisUSA Information Systems Technology and Design Pillar Singapore University of Technology and DesignSingapore

Metaverse has rekindled human beings’desire to further break space-time barriers by fusing the virtual and real ***,security and privacy threats hinder us from building a utopia.A metaverse em-braces various techniques,while at the same time inheriting their pitfalls and thus exposing large attack ***,proposed in 2008,was regarded as a key building block of *** enables transparent and trusted computing environments using tamper-resistant decentralized ***,blockchain supports Decentralized Finance(DeFi)and Non-fungible Tokens(NFT)for ***-ever,the power of a blockchain has not been sufficiently *** this article,we propose a novel trustless architecture of blockchain-enabled metaverse,aiming to provide efficient resource integration and allocation by consolidating hardware and software *** realize our design objectives,we provide an On-Demand Trusted Computing Environment(OTCE)technique based on local trust ***,the architecture adopts a hypergraph to represent a metaverse,in which each hyper-edge links a group of users with certain *** the trust level of each user group can be evaluated based on graph analytics *** on the trust value,each group can determine its security plan on demand,free from interference by irrelevant ***,OTCEs enable large-scale and flexible application environments(sandboxes)while preserving a strong security guarantee.

关键词： Metaverse Blockchain Edge computing Trust

来源：评论

学校读者我要写书评

暂无评论

Adaptive Graph Embedding With Consistency and Specificity for Domain Adaptation

引用

IEEE/CAA Journal of Automatica Sinica 2023年第11期10卷 2094-2107页

作者： Shaohua Teng Zefeng Zheng Naiqi Wu Luyao Teng Wei Zhang School of Computer Science and Technology Guangdong University of TechnologyGuangzhou 510006China Institute of Systems Engineering and Collaborative Laboratory for Intelligent Science and Systems Macao University of Science and TechnologyMacao 999078China School of Information Engineering Guangzhou Panyu PolytechicGuangzhou 511483China Faculty of Information Technology Monash University20 Exhibition Walk ClaytonVIC 3800Australia IEEE

Domain adaptation(DA) aims to find a subspace,where the discrepancies between the source and target domains are reduced. Based on this subspace, the classifier trained by the labeled source samples can classify unlabeled target samples *** approaches leverage Graph Embedding Learning to explore such a subspace. Unfortunately, due to 1) the interaction of the consistency and specificity between samples, and 2) the joint impact of the degenerated features and incorrect labels in the samples, the existing approaches might assign unsuitable similarity, which restricts their performance. In this paper, we propose an approach called adaptive graph embedding with consistency and specificity(AGE-CS) to cope with these issues. AGE-CS consists of two methods, i.e., graph embedding with consistency and specificity(GECS), and adaptive graph embedding(AGE).GECS jointly learns the similarity of samples under the geometric distance and semantic similarity metrics, while AGE adaptively adjusts the relative importance between the geometric distance and semantic similarity during the iterations. By AGE-CS,the neighborhood samples with the same label are rewarded,while the neighborhood samples with different labels are punished. As a result, compact structures are preserved, and advanced performance is achieved. Extensive experiments on five benchmark datasets demonstrate that the proposed method performs better than other Graph Embedding methods.

关键词： Adaptive adjustment consistency and specificity domain adaptation graph embedding geometrical and semantic metrics

来源：评论

学校读者我要写书评

暂无评论

CNN-Based Multi-Output and Multi-Task Regression for Supershape Reconstruction from 3D Point Clouds

Informatica (Slovenia)

引用

Informatica (Slovenia) 2025年第5期49卷 37-48页

作者： Remmach, Hassnae Razak, Siti Fatimah Abdul Ullah, Arif Yogarayan, Sumendra Sayeed, Md Shohel Mrhari, Amine Computer Systems Engineering Laboratory Cadi Ayyad University Marrakesh40000 Morocco Faculty of Information Science and Technology Multimedia University Ayer Keroh75450 Malaysia Research in Computer Science Laboratory Faculty of Sciences Ibn Tofail University Kenitra Morocco

In a number of industries, including computer graphics, robotics, and medical imaging, three-dimensional reconstruction is essential. In this research, a CNN-based Multi-output and Multi-Task Regressor with deep learning capabilities is proposed for three-dimensional object reconstruction from 3D point cloud. Our approach is grounded in the original Point Net architecture, which addresses the difficulties associated with convolution when applied to point clouds. Firstly, this paper is modified using a Multi-Output Regressor to accurately recreate Super forms from 3D point clouds. Using this method, we first extract features from the 3D point cloud using Point Net. After that, a Multi-Output Regressor receives these data and uses them to anticipate the Super shape parameters needed to reconstruct the shape. Taking in the data, the Multi-Output Regressor retrieved characteristics from Point Net and simultaneously predicts several outcomes. Second, a Multi-Task Regressor is used to modify the Point Net. The network gains from the capacity to transfer knowledge from one task to another, improving the model's overall performance. The model would forecast the ten parameters needed to create the shape in the case of rebuilding Super shapes. The test findings were better than expected;they are intriguing in terms of prediction accuracy and cost, and they update the result by 80%, which is a good accomplishment for the study. © 2025 Slovene Society Informatika. All rights reserved.

关键词： 3D reconstruction

来源：评论

学校读者我要写书评

暂无评论

Binary Representation of Polar Bear Algorithm for Feature Selection

引用

computer systems Science & Engineering 2022年第11期43卷 767-783页

作者： Amer Mirkhan NumanÇelebi Sakarya University Computer Engineering DepartmentSakaryaTurkey Sakarya University Information Systems Engineering DepartmentSakaryaTurkey

In most of the scientific research feature selection is a challenge for *** all available features is not an option as it usually complicates the research and leads to performance drop when dealing with large *** the other hand,ignoring some features can compromise the data *** the rough set theory presents a good technique to identify the redundant features which can be dismissed without losing any valuable information,however,exploring all possible combinations of features will end with NP-hard *** this research we propose adopting a heuristic algorithm to solve this problem,Polar Bear Optimization PBO is a metaheuristic algorithm provides an effective technique for solving such kind of optimization *** other heuristic algorithms it proposes a dynamic mechanism for birth and death which allows keep investing in promising solutions and keep dismissing hopeless *** evaluate its efficiency,we applied our proposed model on several datasets and measured the quality of the obtained minimal feature set to prove that redundant data was removed without data loss.

关键词： Optimization rough set feature selection heuristic algorithms

来源：评论

学校读者我要写书评

暂无评论

Student academic success prediction in multimedia-supported virtual learning system using ensemble learning approach

引用

Multimedia Tools and Applications 2024年第40期83卷 87553-87578页

作者： Saidani, Oumaima Umer, Muhammad Alshardan, Amal Alturki, Nazik Nappi, Michele Ashraf, Imran Department of Information Systems College of Computer and Information Sciences and Princess Nourah bint Abdulrahman University P.O. Box 84428 Riyadh11671 Saudi Arabia Department of Computer Science The Islamia University of Bahawalpur Bahawalpur Pakistan Department of Computer Science University of Salerno Fisciano84084 Italy Information and Communication Engineering Yeungnam University Gyeongsan38541 Korea Republic of

Multimedia systems and metaverse has been gaining increasing interest for education in virtual environments. With wide adoption of these technologies, the data is expected to grow exponentially. The increasing rise of educational data indicates that standard processing methods may be limited. As a result, constructing data mining-based academic performance assessment methods is becoming increasingly important. Students’ academic performance prediction can raise an alert for students at risk of failure and can help academia plan accordingly. This research suggests utilizing features derived from a convolutional neural network (CNN) in conjunction with machine learning models to enhance the overall performance of the model. By doing so, the necessity for manual feature extraction is eliminated, leading to superior outcomes compared to using machine learning and deep learning models separately. At the outset, nine machine learning models are employed to assess both the original features and the convoluted features. The top two individual models are later used to build an ensemble model using soft voting criteria. The ensemble model is built using random forest (RF) and support vector machine (SVM) for predicting student academic performance. The performance of the proposed approach is compared to existing models for validation indicating the superior performance of the former. With an accuracy of 98.99%, as well as precision, recall, and F1 scores of 99%, the proposed method achieved outstanding results for predicting student academic performance. © The Author(s), under exclusive licence to Springer Science+Business Media, LLC, part of Springer Nature 2024.

关键词： Learning systems

来源：评论

学校读者我要写书评

暂无评论

Knowledge Transfer Learning via Dual Density Sampling for Resource-Limited Domain Adaptation

引用

IEEE/CAA Journal of Automatica Sinica 2023年第12期10卷 2269-2291页

作者： Zefeng Zheng Luyao Teng Wei Zhang Naiqi Wu Shaohua Teng the School of Computer Science and Technology Guangdong University of TechnologyGuangzhou 510006China the School of Information Engineering Guangzhou Panyu PolytechicGuangzhou 511483China the Faculty of Information Technology Monash University20 Exhibition Walk ClaytonVIC 3800Australia IEEE the Institute of Systems Engineering and Collaborative Laboratory for Intelligent Science and Systems Macao University of Science and TechnologyMacao 999078China

Most existing domain adaptation(DA) methods aim to explore favorable performance under complicated environments by ***,there are three unsolved problems that limit their efficiencies:ⅰ) they adopt global sampling but neglect to exploit global and local sampling simultaneously;ⅱ)they either transfer knowledge from a global perspective or a local perspective,while overlooking transmission of confident knowledge from both perspectives;and ⅲ) they apply repeated sampling during iteration,which takes a lot of *** address these problems,knowledge transfer learning via dual density sampling(KTL-DDS) is proposed in this study,which consists of three parts:ⅰ) Dual density sampling(DDS) that jointly leverages two sampling methods associated with different views,i.e.,global density sampling that extracts representative samples with the most common features and local density sampling that selects representative samples with critical boundary information;ⅱ)Consistent maximum mean discrepancy(CMMD) that reduces intra-and cross-domain risks and guarantees high consistency of knowledge by shortening the distances of every two subsets among the four subsets collected by DDS;and ⅲ) Knowledge dissemination(KD) that transmits confident and consistent knowledge from the representative target samples with global and local properties to the whole target domain by preserving the neighboring relationships of the target *** analyses show that DDS avoids repeated sampling during the *** the above three actions,confident knowledge with both global and local properties is transferred,and the memory and running time are greatly *** addition,a general framework named dual density sampling approximation(DDSA) is extended,which can be easily applied to other DA *** experiments on five datasets in clean,label corruption(LC),feature missing(FM),and LC&FM environments demonstrate the encouraging performance of KTL-DDS.

关键词： Cross-domain risk dual density sampling intra-domain risk maximum mean discrepancy knowledge transfer learning resource-limited domain adaptation

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：