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

IEEE Conference on Global Communications (GLOBECOM)

作者： Jin Cheng Ningning Ding John C. S. Lui Jianwei Huang School of Science and Engineering Shenzhen Institute of Artificial Intelligence and Robotics for Society The Chinese University of Hong Kong Shenzhen Data Science and Analytics Thrust Information Hub Hong Kong University of Science and Technology Guangzhou Department of Computer Science and Engineering The Chinese University of Hong Kong School of Science and Engineering Shenzhen Institute of Artificial Intelligence and Robotics for Society Shenzhen Key Laboratory of Crowd Intelligence Empowered Low-Carbon Energy Network and CSIJRI Joint Research Centre on Smart Energy Storage The Chinese University of Hong Kong Shenzhen

ISBN: (数字)9798350351255

ISBN: (纸本)9798350351262

In the era of big data, data trading significantly enhances data-driven technologies by facilitating data sharing. Despite the clear advantages often experienced by data users when incorporating multiple sources, the topic of multi-source data trading remains largely unexplored. This paper designs a novel data trading framework, which enables multi-source data trading through multi-source cooperation. The proposed framework aims to improve data usage efficiency and increase seller revenue. In particular, we model data sellers’ cooperative decisions through the Nash bargaining framework and systematically outline the interactions between sellers and buyers as a two-stage Stackelberg game. A key contribution of this work is the consideration of coupling among diverse data products, which is essential but often overlooked in prior studies. We properly classify data’s utility into endogenous and relational categories to disentangle the coupling. Despite the inherent non-convex nature of the optimization problem, we methodically derive the closed-form optimal solutions by decomposing the problem into several subproblems. Interestingly, we reveal that, under our proposed framework, sellers’ revenue initially remains steady with the increase of product coupling level, but begins to rise once the level exceeds a certain threshold due to the substitute effect. Finally, experimental results show that our proposed framework can improve the seller’s profit by up to 46.32% compared to traditional data trading methods in the current data market.

关键词： Couplings Games Big data data models Global communication Optimization

来源：评论

学校读者我要写书评

暂无评论

Disentangling Interest and Conformity Representation to Mitigate Popularity Bias for Sequential Recommendation

Disentangling Interest and Conformity Representation to Miti...

引用

International Joint Conference on Neural Networks (IJCNN)

作者： Wenyue Hu Zhenyu Yang Yan Huang Zhibo Zhang Baojie Xu Key Laboratory of Computing Power Network and Information Security Ministry of EducationShandong Computer Science Center (National Supercomputer Center in Jinan) Qilu University of Technology (Shandong Academy of Sciences) Jinan China Shandong Engineering Research Center of Big Data Applied Technology Faculty of Computer Science and Technology Qilu University of Technology (Shandong Academy of Sciences) Jinan China Shandong Provincial Key Laboratory of Computer Networks Shandong Fundamental Research Center for Computer Science Jinan China

ISBN: (数字)9798350359312

ISBN: (纸本)9798350359329

The objective of sequential recommendation is to predict user preferences for items based on historical interaction sequences. This process often leads to a phenomenon known as popularity bias, where popular items are excessively recommended. Conformity, the tendency of users to follow popular items, is a significant factor contributing to this issue. Previous methods have not adequately disentangled conformity and interest, failing to accurately model users’ true intent. To address this, we propose a novel Disentangled Interest and Conformity Sequential Recommendation method (DICSRec) to mitigate the popularity bias. Specifically, we first design an Intent Encoding Module (IEM), which includes two independent encoders for conformity and interest to model their representations. To better disentangle these two factors, we design a disentangling task with proxy-based self-supervised learning and orthogonal regularization. Furthermore, to provide the Intent Encoding Module with more global information, we design a Global Conformity-aware Module (GCM), which supplies item popularity information and aids in enhancing user conformity representation. Lastly, recognizing the varying significance of user conformity and interest, we propose an adaptive Fusion Prediction Module (FPM) that adaptively aggregates user conformity and interest representations for final prediction. Experiments on four real-world datasets consistently demonstrate the superiority of our method over advanced sequential recommendation models. Code implementation is available at: https://***/lyra0611/DICSRec.

关键词： Adaptation models Codes Fuses Aggregates Neural networks Self-supervised learning Multitasking

来源：评论

学校读者我要写书评

暂无评论

Co-design of Dual-side Event-Triggered Dynamic Output Feedback for Cyber-Physical Systems

Co-design of Dual-side Event-Triggered Dynamic Output Feedba...

引用

Chinese Automation Congress (CAC)

作者： Yiyue Zhang Yingying Ren Cuijuan An Da-Wei Ding School of Automation and Electrical Engineering University of Science and Technology Beijing Beijing China Key Laboratory of Knowledge Automation for Industrial Processes Ministry of Education Beijing China Shunde Graduate School University of Science and Technology Beijing China

We investigate the issue of a co-design event-based scheme and dynamic output controller for the H ∞ -stabilization of cyber-physical systems with network delays and packet loss. In particular, we are interested in the way to transmit information in dual-side transmissions, i.e., measurement and control channels, which have their own dynamic event-triggered sampling rules to construct dual-side mechanisms. The co-design conditions are boiled down to a class of bilinear matrix inequality problems, using a successive convex optimization method to overcome the non-convex problem and obtain the design parameters simulta-neously, which can get the desired control performance while reducing the data transmission stress. Finally, the validity of the proposed methodology is illustrated by a numerical case.

关键词： Heuristic algorithms Packet loss Cyber-physical systems Particle measurements Convex functions Delays Linear matrix inequalities

来源：评论

学校读者我要写书评

暂无评论

Predicting Response to Patients with Gastric Cancer Via a Dynamic-Aware Model with Longitudinal Liquid Biopsy data

SSRN

引用

SSRN 2024年

作者： Chen, Zifan Zhao, Jie Li, Yanyan Li, Yilin Liu, Huimin Feng, Xujiao Nan, Xinyu Dong, Bin Shen, Lin Chen, Yang Zhang, Li Center for Data Science Peking University Beijing China Department of Gastrointestinal Oncology Key Laboratory of Carcinogenesis and Translational Research Ministry of Education Peking University Cancer Hospital and Institute Beijing China National Engineering Laboratory for Big Data Analysis and Applications Peking University Beijing China Guangzhou Medical University Guangzhou China Peking University Beijing China Center for Machine Learning Research Peking University Beijing China Peking University Changsha Institute for Computing and Digital Economy Changsha China

Gastric cancer (GC) presents challenges in predicting treatment responses due to its patient-specific heterogeneity. Recently, liquid biopsies have become recognized as a valuable data modality, offering essential cellular and molecular insights and enabling the capture of time-sensitive information. This study aimed to harness artificial intelligence (AI) technology to analyze longitudinal liquid biopsy data. We collected a dataset from longitudinal liquid biopsies of 91 patients at Peking Cancer Hospital, spanning from July 2019 to April 2022, which included 1,895 tumor-related cellular images and 1,698 tumor marker indices. Subsequently, we introduced the Dynamic-Aware Model (DAM) to predict GC treatment responses. DAM incorporates the dynamic data through AI-engineered components, enabling an in-depth longitudinal analysis. Utilizing three-fold cross-validation, DAM exhibited superior performance over traditional cell-counting-based methods, achieving an AUC of 0.807 in predicting GC treatment responses. In the test set, DAM maintained stable efficacy with an AUC of 0.802. Besides, DAM showed the capability to accurately predict treatment responses from early treatment data. Moreover, DAM's visual analysis of attention mechanisms identified six dynamic focus-area-related visual features and their strong association with treatment response. These findings represent a pioneering effort in applying AI technology for interpreting longitudinal liquid biopsy data and employ visual analytics in GC, offering a promising avenue toward precise response prediction and tailored treatment strategies for patients with ***: This work was supported by the National Natural Science Foundation of China (81801778 to Li Zhang., 82203881 to Yang Chen, U22A20327 to Lin Shen, 12090022 to Bin Dong), Beijing Natural Science Foundation (7222021 to Yang Chen), Beijing Hospitals Authority Youth Programme (QML20231115 to Yang Chen), Clinical Medicine Plus X-Young Scholars Project of P

关键词： Diseases

来源：评论

学校读者我要写书评

暂无评论

pFedLVM: A Large Vision Model (LVM)-Driven and Latent Feature-Based Personalized Federated Learning Framework in Autonomous Driving

arXiv

引用

arXiv 2024年

作者： Kou, Wei-Bin Lin, Qingfeng Tang, Ming Xu, Sheng Ye, Rongguang Leng, Yang Wang, Shuai Li, Guofa Chen, Zhenyu Zhu, Guangxu Wu, Yik-Chung Department of Electrical and Electronic Engineering The University of Hong Kong Hong Kong Shenzhen Research Institute of Big Data Shenzhen China Department of Computer Science and Engineering Southern University of Science and Technology Shenzhen China Research Institute of Electronic Science and Technology University of Electronic Science and technology Chengdu China Shenzhen Institute of Advanced Technology Chinese Academy of Sciences Shenzhen China State Key Laboratory for Novel Software Technology Nanjing University Nanjing China College of Mechanical and Vehicle Engineering Chongqing University Chongqing China

Deep learning-based Autonomous Driving (AD) semantic segmentation (SSeg) models often exhibit poor generalization due to data heterogeneity in an ever domain-shifting environment. While Federated Learning (FL) could improve the generalization of an AD SSeg model (known as FedAD system), conventional models often struggle with under-fitting as the amount of accumulated training data progressively increases. To address this issue, instead of conventional small models, employing Large Vision Models (LVMs) in FedAD is a viable option for better learning of representations from a vast volume of data. However, implementing LVMs in FedAD introduces three challenges: (I) the extremely high communication overheads associated with transmitting LVMs between participating vehicles and a central server;(II) lack of computing resource to deploy LVMs on each vehicle;(III) the performance drop due to LVM focusing on shared features but overlooking local vehicle characteristics. To overcome these challenges, we propose pFedLVM, a LVM-Driven, Latent Feature-Based Personalized Federated Learning framework. In this approach, the LVM is deployed only on central server, which effectively alleviates the computational burden on individual vehicles. Furthermore, the exchange between central server and vehicles are the learned features rather than the LVM parameters, which significantly reduces communication overhead. In addition, we utilize both shared features from all participating vehicles and individual characteristics from each vehicle to establish a personalized learning mechanism. This enables each vehicle’s model to learn features from others while preserving its personalized characteristics, thereby outperforming globally shared models trained in general FL. Extensive experiments demonstrate that pFedLVM outperforms the existing state-of-the-art approach by 18.47%, 25.60%, 51.03% and 14.19% in terms of mIoU, mF1, mPrecision and mRecall, respectively. © 2024, CC BY-NC-ND.

关键词： Semantic Segmentation

来源：评论

学校读者我要写书评

暂无评论

MA3D: A Multi-Attention-based Complex 3D Object Detection from Point Cloud data

Journal of Network Intelligence

引用

Journal of Network Intelligence 2022年第3期7卷 719-733页

作者： Liao, Lyuchao Feng, Zhicheng Huang, Dejuan Zhu, Yintian Lin, Jinmei Luo, Linsen Fujian Provincial Universities Key Laboratory of Industrial Control and Data Analysis Fujian Provincial Universities Engineering Research Center for Intelligent Driving Technology Fujian University of Technology Fuzhou350118 China Fujian Provincial Universities Engineering Research Center for Intelligent Driving Technology Fujian University of Technology Fuzhou350118 China

3D object detection is a core component of autonomous driving technology. As a basic format of 3D data, the point cloud can provide detailed geometric information of objects in original 3D space. PointNet algorithm pioneered end-to-end processing of point cloud data. This network adopts the same network extraction features for all input points, resulting in poor differentiation of foreground points (object points) and background points (non-object points), and a large number of background points inter-fere with detection results. To address these issues, we propose a Multi-Attention-based 3D object detection method (MA3D) to fuse features from point cloud, which firstly cap-tures deeper point cloud features through multi-scale feature fusion and then adaptively combines local features with their global dependencies. Based on the original point cloud feature extraction, we adopted spatial attention and channel attention to extract and combine the point cloud features in the spatial dimension and the channel dimension, respectively. Extensive experiments have been conducted on KITTI dataset and results show that the proposed MA3D outperforms the state-of-the-art methods. © 2022, Taiwan Ubiquitous Information CO LTD. All rights reserved.

关键词： Object detection

来源：评论

学校读者我要写书评

暂无评论

Robust and Fast Measure of Information via Low-rank Representation

arXiv

引用

arXiv 2022年

作者： Dong, Yuxin Gong, Tieliang Yu, Shujian Chen, Hong Li, Chen School of Computer Science and Technology Xi’an Jiaotong University Xi’an710049 China Shaanxi Provincial Key Laboratory of Big Data Knowledge Engineering Ministry of Education Xi’an710049 China Machine Learning Group UiT - The Arctic University of Norway Norway College of Science Huazhong Agriculture University Wuhan430070 China Engineering Research Center of Intelligent Technology for Agriculture Ministry of Education Wuhan430070 China

The matrix-based Rényi’s entropy allows us to directly quantify information measures from given data, without explicit estimation of the underlying probability distribution. This intriguing property makes it widely applied in statistical inference and machine learning tasks. However, this information theoretical quantity is not robust against noise in the data, and is computationally prohibitive in large-scale applications. To address these issues, we propose a novel measure of information, termed low-rank matrix-based Rényi’s entropy, based on low-rank representations of infinitely divisible kernel matrices. The proposed entropy functional inherits the specialty of of the original definition to directly quantify information from data, but enjoys additional advantages including robustness and effective calculation. Specifically, our low-rank variant is more sensitive to informative perturbations induced by changes in underlying distributions, while being insensitive to uninformative ones caused by noises. Moreover, low-rank Rényi’s entropy can be efficiently approximated by random projection and Lanczos iteration techniques, reducing the overall complexity from O(n3) to O(n2s) or even O(ns2), where n is the number of data samples and s n. We conduct large-scale experiments to evaluate the effectiveness of this new information measure, demonstrating superior results compared to matrix-based Rényi’s entropy in terms of both performance and computational efficiency. Copyright © 2022, The Authors. All rights reserved.

关键词： Entropy

来源：评论

学校读者我要写书评

暂无评论

Research on Optimization of Production Planning Scheme of China's New Energy Vehicles

SSRN

引用

SSRN 2022年

作者： Luo, Lina Li, Chengjiang Wang, Honglei Hu, Yujie Wang, Xiaolin School of Management Guizhou University Guiyang China Key Laboratory of "Internet +" Collaborative Intelligent Manufacturing in Guizhou Province China State Key Laboratory of Public Big Data Guizhou University Guizhou Guiyang550025 China School of Engineering University of Tasmania HobartTAS7005 Australia

To help enterprises control the carbon emissions of vehicles in the production process and obtain better profits, we proposes a fuzzy multi-objective optimization model, which considers the maximization of enterprise profits and the minimization of carbon emissions in the production process to plan the optimal production of new energy vehicles. The research results show that the market share of electric vehicles below 100,000 yuan is the highest, accounting for 39% of the market;The proportion of PHEVs and BEVs with more than 300,000 yuan is increasing year by year, indicating that the middle and high-end series of vehicles are becoming the main sales force in the new energy vehicle market;In addition, the output of FCVs and MVs will increase significantly in 2024 and 2025 under the guidance of policies and the active research and promotion of enterprises. © 2022, The Authors. All rights reserved.

关键词： Multiobjective optimization

来源：评论

学校读者我要写书评

暂无评论

LoRA-C: Parameter-Efficient Fine-Tuning of Robust CNN for IoT Devices

arXiv

引用

arXiv 2024年

作者： Ding, Chuntao Cao, Xu Xie, Jianhang Fan, Linlin Wang, Shangguang Lu, Zhichao School of Artificial Intelligence Beijing Normal University Beijing China Key Laboratory of Big Data & Artificial Intelligence in Transportation Ministry of Education with School of Computer Science and Technology Beijing Jiaotong University Beijing100044 China School of Computer and Information Engineering Henan Normal University Henan453007 China State Key Laboratory of Networking and Switching Technology Beijing University of Posts and Telecommunications Beijing China Department of Computer Science City University of Hong Kong HKSAR Hong Kong

Efficient fine-tuning of pre-trained convolutional neural network (CNN) models using local data is essential for providing high-quality services to users using ubiquitous and resource-limited Internet of Things (IoT) devices. Low-Rank Adaptation (LoRA) fine-tuning has attracted widespread attention from industry and academia because it is simple, efficient, and does not incur any additional reasoning burden. However, most of the existing advanced methods use LoRA to fine-tune Transformer, and there are few studies on using LoRA to fine-tune CNN. The CNN model is widely deployed on IoT devices for application due to its advantages in comprehensive resource occupancy and performance. Moreover, IoT devices are widely deployed outdoors and usually process data affected by the environment (such as fog, snow, rain, etc.). The goal of this paper is to use LoRA technology to efficiently improve the robustness of the CNN model. To this end, this paper first proposes a strong, robust CNN fine-tuning method for IoT devices, LoRA-C, which performs low-rank decomposition in convolutional layers rather than kernel units to reduce the number of fine-tuning parameters. Then, this paper analyzes two different rank settings in detail and observes that the best performance is usually achieved when α/r is a constant in either standard data or corrupted data. This discovery provides experience for the widespread application of LoRA-C. Finally, this paper conducts many experiments based on pre-trained models. Experimental results on CIFAR-10, CIFAR-100, CIFAR-10-C, and Icons50 datasets show that the proposed LoRA-Cs outperforms standard ResNets. Specifically, on the CIFAR-10-C dataset, the accuracy of LoRA-C-ResNet-101 achieves 83.44% accuracy, surpassing the standard ResNet-101 result by +9.5%. On the Icons-50 dataset, the accuracy of LoRA-C-ResNet-34 achieves 96.9% accuracy, surpassing the standard ResNet-34 result by +8.48%. In addition, compared with full parameter fine-tuning, LoRA-

关键词： Quality of service

来源：评论

学校读者我要写书评

暂无评论

Nanohertz gravitational waves from a quasar-based supermassive black hole binary population model as dark sirens

arXiv

引用

arXiv 2024年

作者： Xiao, Si-Ren Shao, Yue Wang, Ling-Feng Song, Ji-Yu Feng, Lu Zhang, Jing-Fei Zhang, Xin Liaoning Key Laboratory of Cosmology and Astrophysics College of Sciences Northeastern University Shenyang110819 China School of Physics and Optoelectronic Engineering Hainan University Haikou570228 China College of Physical Science and Technology Shenyang Normal University Shenyang110034 China MOE Key Laboratory of Data Analytics and Optimization for Smart Industry Northeastern University Shenyang110819 China National Frontiers Science Center for Industrial Intelligence and Systems Optimization Northeastern University Shenyang110819 China

Recently, several pulsar timing array (PTA) projects have detected evidence of the existence of a stochastic gravitational wave background (SGWB) in the nanohertz frequency band, providing confidence in detecting individual supermassive black hole binaries (SMBHBs) in the future. Nanohertz GWs emitted by inspiraling SMBHBs encode the luminosity distances of SMBHBs. They can serve as dark sirens to explore the cosmic expansion history via a statistical method to obtain the redshift information of GW sources’ host galaxies using galaxy catalogs. The theoretical analysis of the dark siren method relies on the modeling of the population of SMBHBs. Using a population model consistent with the latest SGWB observations is essential, as the SGWB provides significant information about the distribution of SMBHBs. In this work, we employ a quasar-based model, which can self-consistently account for the SGWB amplitude, to estimate the population of SMBHBs. We constrain the Hubble constant using the mock GW data from different detection cases of PTAs in the future. Our results show that a PTA consisting of 100 pulsars with a white noise level of 20 ns could measure the Hubble constant with a precision close to 1% over a 10-year observation period, and a PTA with 200 pulsars may achieve this goal over a 5-year observation period. The results indicate that modeling the SMBHB population significantly influences the analysis of dark sirens, and SMBHB dark sirens have the potential to be developed as a valuable cosmological probe. Copyright © 2024, The Authors. All rights reserved.

关键词： White noise

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：