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

Cost-Efficient Edge Caching for NOMA-Enabled IoT Services

China Communications 2024年第8期21卷 182-191页

作者： Chen Ying Xing Hua Ma Zhuo Chen Xin Huang Jiwei School of Computer Science Beijing Information Science and Technology UniversityBeijing 100101China Beijing Key Laboratory of Petroleum Data Mining China University of PetroleumBeijing 102249China

Mobile edge computing(MEC)is a promising paradigm by deploying edge servers(nodes)with computation and storage capacity close to IoT *** Providers can cache data in edge servers and provide services for IoT devices,which effectively reduces the delay for acquiring *** the increasing number of IoT devices requesting for services,the spectrum resources are generally *** order to effectively meet the challenge of limited spectrum resources,the Non-Orthogonal Multiple Access(NOMA)is proposed to improve the transmission *** this paper,we consider the caching scenario in a NOMA-enabled MEC *** the devices compete for the limited resources and tend to minimize their own *** formulate the caching problem,and the goal is to minimize the delay cost for each individual device subject to resource *** reformulate the optimization as a non-cooperative game *** prove the existence of Nash equilibrium(NE)solution in the game ***,we design the Game-based Cost-Efficient Edge Caching Algorithm(GCECA)to solve the *** effectiveness of our GCECA algorithm is validated by both parameter analysis and comparison experiments.

关键词： caching cost Internet of Things mobile edge computing non-orthogonal multiple access

来源：评论

学校读者我要写书评

暂无评论

JobViz:Skill-driven visual exploration of job advertisements

引用

Visual Informatics 2024年第3期8卷 18-28页

作者： Ran Wang Qianhe Chen Yong Wang Lewei Xiong Boyang Shen School of Journalism and Information Communication Huazhong University of Science and TechnologyWuhanChina School of Computer Science and Technology Huazhong University of Science and TechnologyWuhanChina College of Computing and Data Science Nanyang Technological UniversitySingaporeSingapore Wuhan National Laboratory for Optoelectronics WuhanChina Philosophy and Social Science Laboratory of Big Data and National Communication Strategy Ministry of EducationWuhanChina

Online job advertisements on various job portals or websites have become the most popular way for people to find potential career opportunities ***,the majority of these job sites are limited to offering fundamental filters such as job titles,keywords,and compensation *** often poses a challenge for job seekers in efficiently identifying relevant job advertisements that align with their unique skill sets amidst a vast sea of ***,we propose well-coordinated visualizations to provide job seekers with three levels of details of job information:a skill-job overview visualizes skill sets,employment posts as well as relationships between them with a hierarchical visualization design;a post exploration view leverages an augmented radar-chart glyph to represent job posts and further facilitates users’swift comprehension of the pertinent skills necessitated by respective positions;a post detail view lists the specifics of selected job posts for profound analysis and *** using a real-world recruitment advertisement dataset collected from 51Job,one of the largest job websites in China,we conducted two case studies and user interviews to evaluate *** results demonstrated the usefulness and effectiveness of our approach.

关键词： Visual exploration Job advertisements Skill-driven

来源：评论

学校读者我要写书评

暂无评论

SMART AGRICULTURE: INTEGRATING AIR QUALITY MONITORING WITH DEEP LEARNING FOR PROCESS OPTIMIZATION*

引用

Scalable Computing 2025年第3期26卷 1005-1016页

作者： Shobana, J. Subramanian, A Venkata Balamurugan, P. Perumal, Sivakumar Sankari, V. Eldho, K.J. Nareshkumar, R. Department of Data Science and Business Systems School of Computing College of Engineering and Technology SRM Institute of Science and Technology Tamilnadu Kattankulathur India Department of Computer Science and Engineering GITAM University Bengaluru India Department of Computer Science and Engineering J N N Institute of Enginering India Saveetha university Chennai India Department of Computer Science and Engineering Sasi Institute of Technology and Engineering Andhra Pradesh Tadepalligudem India Department of Artificial Intelligence and Data Science K.Ramakrishnan College of Engineering Kariyamanickam Rd Tamil Nadu Samayapuram India PG and Research Department of Computer Science Mary Matha Arts and Science College Kerala Mananthavady India Department of Networking and Communications School of Computing College of Engineering and Technology SRM Institute of Science and Technology Tamilnadu Kattankulathur India

Modernization and intense industrialization have led to a substantial improvement in people’s quality of life. However, the aspiration for achieving an improved quality of life results in environmental contamination. A primary consequence of environmental degradation is air pollution, resulting from rising levels of poisonous chemicals in the atmosphere, which may induce detrimental health conditions in humans. It is harmful to both humans and agriculture. Given that the effects of air pollution on plants may not be readily apparent, it is important to analyse the necessary data and compute the outcomes. Farmers prioritise on pests and plant diseases, frequently neglecting the detrimental impacts of air pollution. Some plant species can withstand high amounts of pollution from suspended particulate matter and accumulated gases, while others are more susceptible to harm. Therefore, plants’ reaction to air pollution is influenced by the kind of harmful compounds, their levels, and the plant’s susceptibility to them. The LSTM +CNN Proposed Ensemble method may be used to analyse the impact of air pollution on agriculture by examining trends in crop production over time and predicting which crop is more resistant based on the pollution data. The initiative created for this aim may assist farmers in determining the most suitable crop to cultivate in their fields to minimize the impact of air pollution on agricultural yield. The findings show deep learning algorithms correctly predict hourly pollutant concentrations such as carbon monoxide, sulphur dioxide, nitrogen dioxide, ground-level ozone, and particulate matter 2.5, along with the hourly Air Quality Index (AQI) for California. A proposed model used test RMSE values as a measure to evaluate prediction performance, achieving the best possible results. © 2025 SCPE.

关键词： Nitrogen oxides

来源：评论

学校读者我要写书评

暂无评论

OSFS-Vague: Online streaming feature selection algorithm based on vague set

引用

CAAI Transactions on Intelligence Technology 2024年第6期9卷 1451-1466页

作者： Jie Yang Zhijun Wang Guoyin Wang Yanmin Liu Yi He Di Wu School of Physics and Electronic Science Zunyi Normal UniversityZunyiChina Key Laboratory of Big Data Intelligent Computing Chongqing University of Posts and TelecommunicationsChongqingChina Department of Computer Science Old Dominion UniversityNorfolkVirginiaUSA College of Computer and Information Science Southwest UniversityChongqingChina

Online streaming feature selection(OSFS),as an online learning manner to handle streaming features,is critical in addressing high-dimensional *** real big data-related applications,the patterns and distributions of streaming features constantly change over time due to dynamic data generation ***,existing OSFS methods rely on presented and fixed hyperparameters,which undoubtedly lead to poor selection performance when encountering dynamic *** make up for the existing shortcomings,the authors propose a novel OSFS algorithm based on vague set,named *** main idea is to combine uncertainty and three-way decision theories to improve feature selection from the traditional dichotomous method to the trichotomous ***-Vague also improves the calculation method of correlation between features and ***,OSFS-Vague uses the distance correlation coefficient to classify streaming features into relevant features,weakly redundant features,and redundant ***,the relevant features and weakly redundant features are filtered for an optimal feature *** evaluate the proposed OSFS-Vague,extensive empirical experiments have been conducted on 11 *** results demonstrate that OSFS-Vague outperforms six state-of-the-art OSFS algorithms in terms of selection accuracy and computational efficiency.

关键词： feature selection online feature selection three-way decision vague set

来源：评论

学校读者我要写书评

暂无评论

Blockchain-Enabled Private and Secure Task Allocation Framework 16

Blockchain-Enabled Private and Secure Task Allocation Framew...

引用

16th International Conference on COMmunication Systems and NETworkS, COMSNETS 2024

作者： Orang, Ayda Valinezhad Dorri, Ali Gaspers, Serge Ruj, Sushmita School of Computer Science and Engineering Unsw Sydney Australia Data61 Csiro Australia School of Computer Science Queensland University of Technology Australia

ISBN: (纸本)9798350383119

In the realm of wireless communications and task allocations, where agents need to travel to perform tasks, a new challenge has emerged. This challenge involves efficiently distributing tasks among agents while considering their preferences and priorities. Unfortunately, many existing solutions rely on centralized systems, making them susceptible to various vulnerabilities, including privacy concerns and security threats. To address these issues, this paper introduces a novel solution named SEPP-TAP-a secure and privacy-preserving decentralized framework for multi-agent task allocation problems, harnessing the power of blockchain technology. SEPP-TAP not only protects agents' privacy and location information but also strengthens network security by mitigating threats like the Sybil attack and network flooding. Our approach employs innovative anonymization techniques to ensure that agents' identities remain concealed throughout successive task requests, breaking any associations between tasks performed by a particular agent. © 2024 IEEE.

关键词： blockchain privacy security smart contract task allocation

来源：评论

学校读者我要写书评

暂无评论

Blockchain-based trust management for data exchange in internet of vehicle network

引用

Multimedia Tools and Applications 2025年第8期84卷 4837-4855页

作者： Srivastava, Sandeep Agarwal, Deepshikha Chaurasia, Brijesh Kumar Adhikari, Mainak Computer Science Indian Institute of Information Technology UP Lucknow226002 India Information Technology Indian Institute of Information Technology UP Lucknow226002 India Computer Science Pranveer Singh Institute of Technology UP Kanpur208029 India School of Data Science Indian Institute of Science Education & Research Thiruvananthapuram India

Internet of Vehicles (IoV) integrates with various heterogeneous nodes, such as connected vehicles, roadside units, etc., which establishes a distributed network. Vehicles are managed nodes providing all the services required during inter-vehicular communication which makes it essential to use a trust management mechanism. Existing trust management systems are insufficient to address the emerging IoV needs of transparency, mobility, immutability, and scalability. Motivated by the need to address the outlined issues, Proposed additive increase and multiplicative decrease (AIMD) trust management model, to improve the quality of communication, as well as vehicle trustworthiness based on multiple inter-vehicular interactions. The proposed layered architecture helps to reduce overhead in terms of latency and average execution time compared to other trust management mechanism and avoid risk of single point of failure. The Proposed AIMD trust management is implemented on permissioned blockchain, where transactions in the IoV network are only managed by minor nodes which accumulate interactions and uses PBFT and AIMD mechanism to derive immutable reputation score securely and transparently. Simulation results show the AIMD trust mechanism using permissioned blockchain can manage the trust of vehicles efficiently by reducing the latency by 0.29 sec, increasing packet delivery ratio from 0.8 to 0.95, and significantly reduce transaction finality time. © The Author(s), under exclusive licence to Springer science+Business Media, LLC, part of Springer Nature 2024.

关键词： Blockchain

来源：评论

学校读者我要写书评

暂无评论

Graph Augmentation Empowered Contrastive Learning for Recommendation

引用

ACM Transactions on Information Systems 2025年第2期43卷 1-27页

作者： Xu, Lixiang Liu, Yusheng Xu, Tong Chen, Enhong Tang, Yuanyan School of Artificial Intelligence and Big Data Hefei University Hefei China State Key Laboratory of Cognitive Intelligence School of Computer Science and Technology University of Science and Technology of China Hefei China Zhuhai UM Science and Technology Research Institute FST University of Macau China

The application of contrastive learning (CL) to collaborative filtering (CF) in recommender systems has achieved remarkable success. CL-based recommendation models mainly focus on creating multiple augmented views by employing different graph augmentation methods and utilizing these views for self-supervised learning. However, current CL methods for recommender systems usually struggle to fully address the problem of noisy data. To address this problem, we propose the Graph Augmentation Empowered Contrastive Learning (GAECL) for recommendation framework, which uses graph augmentation based on topological and semantic dual adaptation and global co-modeling via structural optimization to co-create contrasting views for better augmentation of the CF paradigm. Specifically, we strictly filter out unimportant topologies by reconstructing the adjacency matrix and mask unimportant attributes in nodes according to the PageRank centrality principle to generate an augmented view that filters out noisy data. Additionally, GAECL achieves global collaborative modeling through structural optimization and generates another augmented view based on the PageRank centrality principle. This helps to filter the noisy data while preserving the original semantics of the data for more effective data augmentation. Extensive experiments are conducted on five datasets to demonstrate the superior performance of our model over various recommendation models. © 2025 Copyright held by the owner/author(s).

关键词： Self-supervised learning

来源：评论

学校读者我要写书评

暂无评论

Importance-Based Pruning for Genetic Programming Based Symbolic Regression 37th

Importance-Based Pruning for Genetic Programming Based Symb...

引用

37th Australasian Joint Conference on Artificial Intelligence, AJCAI 2024

作者： Rimas, Mohamad Chen, Qi Zhang, Mengjie Centre for Data Science and Artificial Intelligence and School of Engineering and Computer Science Victoria University of Wellington Wellington New Zealand

ISBN: (纸本)9789819603503

Pruning is a major research field in neural networks, enhancing their efficiency and generalization. The field of pruning approaches in genetic programming (GP) is continually evolving, with researchers actively exploring new techniques and approaches to optimise the performance of GP models. This research introduces a novel pruning algorithm for Genetic Programming-based Symbolic Regression (GPSR). The proposed method employs a weighting mechanism to identify and filter out unimportant subtrees in each generation. To achieve this, the method arranges all subtrees linearly and assigns weights to each subtree and terminal. It then uses Ordinary Least Squares (OLS) to optimize these weights, enabling the identification of unimportant subtrees and terminals for effective pruning. The algorithm’s effectiveness was evaluated using ten regression datasets, including high-dimensional and complex feature sets. Furthermore, comparisons were made with two other algorithms to evaluate its performance. The results indicate that the proposed approach not only achieves better learning and generalisation performance but also generates smaller trees compared to standard GP, thereby improving interpretability. © The Author(s), under exclusive license to Springer Nature Singapore Pte Ltd. 2025.

关键词： Genetic Programming Ordinary Least Squares Pruning Regression Subtrees

来源：评论

学校读者我要写书评

暂无评论

Multi-scale feature fusion for facial expression recognition

引用

Neural Computing and Applications 2025年第17期37卷 11399-11420页

作者： Guo, Jiatao Peng, Junjie Huang, Yansong Chen, Gan Cai, Zesu Tan, Shuhua School of Computer Engineering and Science Shanghai University Shanghai China Shanghai Institute for Advanced Communication and Data Science Shanghai University Shanghai China School of Computer Science and Technology Harbin Institute of Technology Harbin China National Engineering Laboratory for Logistics Information Technology YTO Express Co. Ltd. Shanghai China

As an important computer vision task that can be used in many areas, facial expression recognition (FER) has been widely studied which much progress has been obtained especially when deep learning (DL) approaches have been introduced in FER. However, existing methods are restricted to extracting localized information or utilizing attention mechanism to focus on the region most relevant to the emotion, possibly resulting in errors in facial expression interpretation. Moreover, the inconsistency of image sizes in the wild FER datasets further increases the difficulty of the FER task. To address these issues, we propose a multi-scale feature fusion (MSFF) for FER. Specifically, our method first extracts features from facial images using multi-scale feature extraction to obtain rich multi-dimensional information. Meanwhile, extensive feature extraction at different scales is achieved by expanding the receptive field of the model, which provides the basis for more detailed analysis of facial expressions. Eventually, features at different scales are fused to enhance their synergistic effect. Subsequently, the adaptive extraction of comprehensive and valuable information from the fused features is performed, optimizing the performance of expression recognition. Extensive experimental results demonstrate that the proposed method outperforms the state-of-the-art methods on in-the-wild datasets. It is promising for FER in realistic and complex scenarios. © The Author(s), under exclusive licence to Springer-Verlag London Ltd., part of Springer Nature 2025.

关键词： Feature extraction

来源：评论

学校读者我要写书评

暂无评论

A Variational Inference-Based LSTM-enhanced Deep Neural Model for Sequential Recommendations

引用

IEEE Access 2025年 13卷 95945-95962页

作者： Ngaffo, Armielle Noulapeu Kamgang, Ines Raissa Djouela Maka, Ebenezer Maka Malong, Yannick University of Douala Laboratory of Computer Science Data Science and Artificial Intelligence National Higher Polytechnic School of Douala Douala8580 Cameroon Department of computer engineering University of Buea Faculty of Engineering and Technology Cameroon

Long Short-Term Memory (LSTM) networks are particularly useful in recommender systems since user preferences change over time. Unlike traditional recommender models which assume static user-item interactions, LSTM models capture sequential dependencies and temporal dynamics, making them ideal for personalized, session-based, and sequential recommendation tasks. However, traditional LSTM-based recommender systems do not model uncertainty since they perform deterministic predictions. Moreover, those recommender models exhibit poor generalization on small datasets, and poor-handle cold-start and data sparsity problems. To overcome those limitations, this paper presents an LSTM-based recommender model that leverages an improved deep matrix factorization to accurately address the data sparsity problem. In addition, an enhanced variational inference coupled to the Evidence Lower Bound Optimization is applied on LSTM unit layers to perform uncertainty-aware predictions. Thereafter, latent vectors obtained from LSTM networks are effectively involved in the sequential recommendation process. Experiments have been conducted on several real-world datasets to evaluate our proposal and the results show the proposed model presents significant performances compared to state-of-the-art models. © 2013 IEEE.

关键词： Deep neural networks

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：