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

Optimized Autonomous Computing with Trusted Resilient Data Management for IoT Emerging Networks

IEEE Sensors Journal 2025年第11期25卷 20778-20785页

作者： Shafique, Ayesha Cheng, Benmao Zhao, Bo Alwakid, Ghadah Naif Haq, Muhammad Inaam Ul Laboratory of Intelligent IOT Technology and Applications in Universities China Jouf University College of Computer and Information Sciences Department of Computer Science Al Jowf Sakaka72341 Saudi Arabia Quanzhou University of Information Engineering School of Computer Science and Software Engineering Quanzhou362000 China

The innovative city network integrates numerous computational and physical components to develop real-time systems. These systems can capture sensor data and distribute it to end stations. Most solutions have been presented based on the centralized computing paradigm, which effectively and systematically increases data flow;however, distributed wireless technologies and heterogeneous network services continue to raise significant research problems. These challenges lower the optimization criteria and reflect communication structure around the network edges. In this research, we proposed a sustainable development for smart networks using efficient big data management with collaborative decisions for network devices. It differs from most existing work in the mentioned aspect. It applies computational lightweight intelligence for forwarding collected data using mobile collectors and reduces the congestion flow between devices on the limited bandwidth of wireless links. Moreover, the energy load is efficiently managed with edge-driven methods, and the incorporation of trusted devices ensures the integrity of the smart network. It also tackles potential communication threats smartly. Based on the experiments conducted in Network Simulator (NS-3), the proposed model enhances the efficacy of smart networks for performance metrics with reliability and effective management of resources in Internet of Things (IoT) network. © 2025 IEEE.

关键词： Mathematical models Computational modeling intelligent sensors Data aggregation Internet of Things Security Routing Load modeling Silicon Data models

来源：评论

学校读者我要写书评

暂无评论

Leveraging user's preference and social circle for personalized recommendation via matrix factorization with sub-linear convergence rate

引用

Journal of intelligent and Fuzzy Systems 2024年第1-2期47卷 1-13页

作者： Qiu, Laixiang Zhou, Wang Tian, Ying Ul Haq, Amin Ahmad, Sultan School of Computer and Software Engineering Xihua University Chengdu China Intelligent Policing Key Laboratory of Sichuan Province Sichuan Police College LuZhou China School of Computer Science and Engineering University of Electronic Science and Technology of China Chengdu China Department of Computer Science College of Computer Engineering and Sciences Prince Sattam Bin Abdulaziz University Alkharj Saudi Arabia

Recommender systems aim to filter information effectively and recommend useful sources to match users' requirements. However, the exponential growth of information in recent social networks may cause low prediction accuracy for recommendation systems. This article proposes a unified personalized recommendation architecture referred to as PSRec, which incorporates user preference and social relationship into matrix factorization framework. Specifically, PSRec generates two collections for textual reviews and contextual information respectively, and performs preference learning for each user via the Latent Dirichlet Allocation topic model. Moreover, PSRec exploits the inner relations within the social circle for recommendation, including direct trust relationship and indirect trust relationship. Additionally, it's certificated that PSRec can converge at a sub-linear rate via theoretical analysis. Experimental results over DoubanMovie, CiaoDVDs and Yelp demonstrate the superiority of the proposed PSRec, which can achieve significant improvements and provide much better user experience while compared with other benchmark models. © 2024 - IOS Press. All rights reserved.

关键词： Matrix factorization

来源：评论

学校读者我要写书评

暂无评论

DIG: Improved DINO for Graffiti Detection

引用

IEEE Transactions on Systems, Man, and Cybernetics: Systems 2025年第5期55卷 3557-3569页

作者： Wang, Bingshu Mao, Qianchen Liu, Aifei Chen, Long Chen, C. L. Philip Northwestern Polytechnical University School of Software Xi’an710129 China Shenzhen University Guangdong Key Laboratory of Intelligent Information Processing Shenzhen Key Laboratory of Media Security Shenzhen518060 China University of Macao Department of Computer and Information Science China South China University of Technology School of Computer Science and Engineering Guangzhou510641 China

Graffiti detection is essential in historic building protection and urban neighborhood management. Graffiti detection has made significant progress in recent years based on the development of deep learning. However, small-scale graffiti, interference from the background, and the false detection of word parts in graffiti make it a challenging problem. This article proposes a Transformer-based high-precision graffiti detection method, namely DIG. Precisely, it consists of three modules: 1) Spatial query selection (SQS), scale-aware IoU loss (SIL);2) Denoising Task with binary contrastive denoising (BCDN);and 3) IoU-guided box denoising (IBD) modules. To detect small-scale graffiti, this paper proposes SIL to help the loss function to perceive small-scale graffiti and large-scale graffiti fairly. To reduce the false detection of word parts, this article presents the SQS module, which integrates spatial information into the query selection process of the Encoder to filter out falsely detected bounding boxes within the graffiti. To reduce the interference from the background, this article introduces a denoising task with BCDN and IBD modules, improving the model’s ability to distinguish graffiti from the background and accurately select appropriate bounding boxes. A large number of experimental results on the STORM dataset show that our method achieves state-of-the-art results with an AP50 of 87.9%. Moreover, DIG achieved competitive results on the FineFM dataset for mask detection. This indicates that DIG can also be conveniently transferred to detect other scenarios. © 2013 IEEE.

关键词： Historic preservation

来源：评论

学校读者我要写书评

暂无评论

User story clustering in agile development:a framework and an empirical study

引用

Frontiers of computer science 2023年第6期17卷 43-59页

作者： Bo YANG Xiuyin MA Chunhui WANG Haoran GUO Huai LIU Zhi JIN School of Information Science and Technology Beijing Forestry UniversityBeijing 100083China Engineering Research Center for Forestry Oriented Intelligent Information Processing National Forestry and Grassland AdministrationBeijing 100083China School of Information Science and Technology North China University of TechnologyBeijing 100144China College of Computer Science and Technology Inner Mongolia Normal UniversityHohhot 010020China Department of Computer Science and Software Engineering Swinburne University of TechnologyHawthorn VIC 3122Australia Key Laboratory of High Confidence Software Technologies(Peking University) Ministry of EducationBeijing 100871China Institute of Software School of Computer SciencePeking UniversityBeijing 100871China

Agile development aims at rapidly developing software while embracing the continuous evolution of user requirements along the whole development *** stories are the primary means of requirements collection and elicitation in the agile development.A project can involve a large amount of user stories,which should be clustered into different groups based on their functionality’s similarity for systematic requirements analysis,effective mapping to developed features,and efficient ***,the current user story clustering is mainly conducted in a manual manner,which is time-consuming and subjective to human *** this paper,we propose a novel approach for clustering the user stories automatically on the basis of natural language ***,the sentence patterns of each component in a user story are first analysed and determined such that the critical structure in the representative tasks can be automatically extracted based on the user story *** similarity of user stories is calculated,which can be used to generate the connected graph as the basis of automatic user story *** evaluate the approach based on thirteen datasets,compared against ten baseline *** results show that our clustering approach has higher accuracy,recall rate and F1-score than these *** is demonstrated that the proposed approach can significantly improve the efficacy of user story clustering and thus enhance the overall performance of agile *** study also highlights promising research directions for more accurate requirements elicitation.

关键词： user story agile development user story mapping clustering

来源：评论

学校读者我要写书评

暂无评论

PESTA: An Elastic Motion Capture Data Retrieval Method

引用

Journal of computer science & Technology 2023年第4期38卷 867-884页

作者：蒋子飞李伟黄艳尹义龙郭宗杰彭京亮 School of Software Shandong UniversityJinan 250101China Ming Hsieh Department of Electrical and Computer Engineering University of Southern California Los Angeles 90089U.S.A Shandong Provincial Key Laboratory of Network Based Intelligent Computing Jinan 250022China School of Information Science and Engineering University of JinanJinan 250022China

Prevalent use of motion capture(MoCap)produces large volumes of data and MoCap data retrieval becomes crucial for efficient data *** clips may not be neatly segmented and labeled,increasing the difficulty of *** order to effectively retrieve such data,we propose an elastic content-based retrieval scheme via unsupervised posture encoding and strided temporal alignment(PESTA)in this *** retrieves similarities at the sub-sequence level,achieves robustness against singular frames and enables control of tradeoff between precision and *** firstly learns a dictionary of encoded postures utilizing unsupervised adversarial autoencoder techniques and,based on which,compactly symbolizes any MoCap ***,it conducts strided temporal alignment to align a query sequence to repository sequences to retrieve the best-matching sub-sequences from the ***,it extends to find matches for multiple sub-queries in a long query at sharply promoted efficiency and minutely sacrificed *** performance of the proposed scheme is well demonstrated by experiments on two public MoCap datasets and one MoCap dataset captured by ourselves.

关键词： motion capture(MoCap) content-based retrieval adversarial autoencoder temporal alignment

来源：评论

学校读者我要写书评

暂无评论

EdgeAuth: An intelligent token-based collaborative authentication scheme

EdgeAuth: An intelligent token-based collaborative authentic...

引用

作者： Jiang, Xutong Dou, Ruihan He, Qiang Zhang, Xuyun Dou, Wanchun State Key Laboratory for Novel Software Technology Nanjing University Nanjing China Faculty of Mathematics University of Waterloo Waterloo Canada Department of Computer Science and Software Engineering Swinburne University of Technology Melbourne Australia Department of Computing Macquarie University Sydney Australia College of Big Data and Intelligent Engineering Southwest Forestry University China

Edge computing is regarded as an extension of cloud computing that brings computing and storage resources to the network edge. For some Industrial Internet of Things (IIoT) applications such as supply-chain supervision and collaboration, Internet of Vehicles, real-time video analysis and so forth, users should be authenticated before visiting the geographically distributed edge servers. Limited by the considerable latency between the cloud and edge servers, and the limited capacity of edge servers, it is infeasible to copy the authentication method from cloud servers when users are authenticated in edge servers. In view of this challenge, this paper proposes a novel token-based authentication scheme, named EdgeAuth, that enables fast edge user authentication through collaboration among cloud servers and edge servers. Under the EdgeAuth scheme, edge servers can rapidly verify the credentials of users who have been authenticated by the cloud server. EdgeAuth can also protect users from a series of authentication attacks, for example, the replay attack, DoS attack and man-in-the-middle attack. The results of experiments conducted on a simulated edge computing environment validate the usefulness of EdgeAuth through a comparison in latency and throughput against two baseline schemes. © 2023 John Wiley & Sons Ltd.

关键词： Authentication

来源：评论

学校读者我要写书评

暂无评论

Redundant Data Detection and Deletion to Meet Privacy Protection Requirements in Blockchain-Based Edge Computing Environment

引用

China Communications 2024年第3期21卷 149-159页

作者： Zhang Lejun Peng Minghui Su Shen Wang Weizheng Jin Zilong Su Yansen Chen Huiling Guo Ran Sergey Gataullin Cyberspace Institute Advanced Technology Guangzhou UniversityGuangzhou 510006China College of Information Engineering Yangzhou UniversityYangzhou 225127China School Math&Computer Science Quanzhou Normal UniversityQuanzhou 362000China Computer Science Department City University of Hong KongHong Kong 999077China School of Computer and Software Nanjing University of Information Science and TechnologyNanjing 21004China Key Laboratory of Intelligent Computing and Signal Processing of Ministry of Education School of Computer Science and TechnologyAnhui UniversityHefei 230601China Department of Computer Science and Artificial Intelligence Wenzhou UniversityWenzhou 325035China Guangzhou University Library Guangzhou UniversityGuangzhou 510006China Central Economic and Mathematics Institute Russian Academy of Sciences MIREA-Russian Technological University Moscow RegionRussia

With the rapid development of information technology,IoT devices play a huge role in physiological health data *** exponential growth of medical data requires us to reasonably allocate storage space for cloud servers and edge *** storage capacity of edge nodes close to users is *** should store hotspot data in edge nodes as much as possible,so as to ensure response timeliness and access hit rate;However,the current scheme cannot guarantee that every sub-message in a complete data stored by the edge node meets the requirements of hot data;How to complete the detection and deletion of redundant data in edge nodes under the premise of protecting user privacy and data dynamic integrity has become a challenging *** paper proposes a redundant data detection method that meets the privacy protection *** scanning the cipher text,it is determined whether each sub-message of the data in the edge node meets the requirements of the hot *** has the same effect as zero-knowledge proof,and it will not reveal the privacy of *** addition,for redundant sub-data that does not meet the requirements of hot data,our paper proposes a redundant data deletion scheme that meets the dynamic integrity of the *** use Content Extraction Signature(CES)to generate the remaining hot data signature after the redundant data is *** feasibility of the scheme is proved through safety analysis and efficiency analysis.

关键词： blockchain data integrity edge computing privacy protection redundant data

来源：评论

学校读者我要写书评

暂无评论

Weighted Consistent Multi-view Discriminant Analysis in Unreliable Labeling Environment 1

引用

3rd International Conference on Artificial Intelligence Logic and Applications, AILA 2023

作者： Li, Meihua Zhao, Yang Pei, Jihong Yang, Xuan College of Electronics and Information Engineering Shenzhen University Guangdong Shenzhen China Guangdong Key Laboratory of Intelligent Information Processing Guangdong Shenzhen China Department of Computer Science City University of Hong Kong Hong Kong College of Computer Science and Software Engineering Shenzhen University Guangdong Shenzhen China

ISBN: (数字)9789819978694

ISBN: (纸本)9789819978687

Multi-view discriminant analysis method (MvDA) is an effective supervised multi-view learning method. However, in practical multi-view learning application scenarios, there may be the problem that the sample label information from some viewpoints is unreliable. In the MvDA method, the information of all views is considered to have equal reliability. The data information in views containing unreliable label information may make it difficult for MvDA to learn accurate common features among data from different views. Therefore, in this paper, a weighted consistent multi-view discriminant analysis (WMvDA-VC) is proposed for the multi-view learning task in unreliable labeling environment. By considering the data characteristics under different views, the information from different views is assigned different reliability weights. Using the weighted scatter matrices, multiple projection matrices are learned. Then the data from different views are projected into the same common projection space. In the common subspace, dissimilar samples in different views are dispersed as much as possible and similar samples are aggregated as much as possible. The impact of data from views containing unreliable labels on the multi-view learning performance is reduced by adjusting the weights of the views with unreliable labels. The method is experimented on four widely used datasets. The experimental results show that the proposed WMvDA-VC exhibits excellent performance in the classification recognition task with unreliably labeled environment. © The Author(s), under exclusive license to Springer Nature Singapore Pte Ltd 2023.

关键词： Learning systems

来源：评论

学校读者我要写书评

暂无评论

Low Resolution Face Image Recognition Based on Consistent Discriminant Correlation Analysis with Weight Correction 1

引用

3rd International Conference on Artificial Intelligence Logic and Applications, AILA 2023

作者： Lin, Xiaoan Li, Meihua Pei, Jihong Zhao, Yang College of Electronics and Information Engineering Shenzhen University Guangdong Shenzhen China Guangdong Key Laboratory of Intelligent Information Processing Guangdong Shenzhen China Department of Computer Science City University of Hong Kong Hong Kong College of Computer Science and Software Engineering Shenzhen University Guangdong Shenzhen China

ISBN: (数字)9789819978694

ISBN: (纸本)9789819978687

Consistent Discriminant Correlation Analysis (CDCA) is an effective algorithm for dual-view learning. However, the importance of information from different samples and features may vary. In CDCA, the sample features from both views are equally weighted during training, which may not fully utilize the information contained in certain sample features. This can negatively impact the decision-making and predictive capabilities of the model. Additionally, CDCA is only applicable to dual-view data and cannot effectively utilize multi-view data. To address these issues, this paper extends CDCA to multi-view scenarios and proposes Consistent Discriminant Correlation Analysis with Weight Correction (CDCA-WC). The feature weighting approach used in this paper involves calculating the average weight of each feature using the ReliefF algorithm. The sample weighting method employed is based on a weighted loss function, where a larger weight indicates a stronger classification ability for the corresponding feature or sample. During the training process, CDCA-WC is used to obtain the feature subspace mappings for the training samples from multiple views. The data’s feature and sample dimensions are then adjusted based on their respective weights, and the adjusted data is used for a second round of training. During testing, the similarity between samples is measured using a KNN classifier. Experimental results on three publicly available face recognition datasets demonstrate that CDCA-WC can effectively improve the accuracy of low-resolution face image recognition. © The Author(s), under exclusive license to Springer Nature Singapore Pte Ltd 2023.

关键词： Face recognition

来源：评论

学校读者我要写书评

暂无评论

Coupled Non-negative Matrix Factorization with Deep Part-Based Feature Learning for Low-Resolution Image Recognition 1

引用

3rd International Conference on Artificial Intelligence Logic and Applications, AILA 2023

作者： Wang, Jinxin Zhao, Yang Pei, Jihong Yang, Xuan College of Electronics and Information Engineering Shenzhen University Guangdong Shenzhen China Guangdong Key Laboratory of Intelligent Information Processing Guangdong Shenzhen China Department of Computer Science City University of Hong Kong Hong Kong College of Computer Science and Software Engineering Shenzhen University Guangdong Shenzhen China

ISBN: (数字)9789819978694

ISBN: (纸本)9789819978687

The existing low-resolution (LR) image recognition methods based on coupled relationship learning of high- and low-resolution images usually take similar feature extraction steps for both high- and low-resolution images. However, the high- and low-resolution features thus obtained may differ in terms of information content and information scale. This leads to a robust coupled relationship between the obtained high- and low-resolution images feature is difficult to be learned. Therefore, a coupled non-negative matrix factorization with a deep part-based feature learning method is proposed for the LR image recognition task. This method is divided into two main steps. Firstly, the depth non-negative matrix factorization method by graph convolution is used to obtain a robust depth underlying basis images of HR images for feature representation. Then the coupled relationship between the depth basis images feature of the HR images and the LR basis images feature is learned. Learning More Robust LR Basis images features using depth underlying features of HR images to assist LR images. Improve the expression of LR basis images of features. Experimental results show that the method can provide higher recognition performance. It outperforms existing image recognition methods in image recognition. © The Author(s), under exclusive license to Springer Nature Singapore Pte Ltd 2023.

关键词： Image recognition

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：