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

37th International Conference on Machine Learning, ICML 2020

作者： Guo, Yong Chen, Yaofo Zheng, Yin Zhao, Peilin Chen, Jian Huang, Junzhou Tan, Mingkui School of Software Engineering South China University of Technology China Pazhou Laboratory China Weixin Group Tencent China Tencent AI Lab Tencent China Guangdong Key Laboratory of Big Data Analysis and Processing China

ISBN: (纸本)9781713821120

Neural architecture search (NAS) has become an important approach to automatically fnd effective architectures. To cover all possible good architectures, we need to search in an extremely large search space with billions of candidate architectures. More critically, given a large search space, we may face a very challenging issue of space explosion. However, due to the limitation of computational resources, we can only sample a very small proportion of the architectures, which provides insuffcient information for the training. As a result, existing methods may often produce suboptimal architectures. To alleviate this issue, we propose a curriculum search method that starts from a small search space and gradually incorporates the learned knowledge to guide the search in a large space. With the proposed search strategy, our Curriculum Neural Architecture Search (CNAS) method signifcantly improves the search effciency and fnds better architectures than existing NAS methods. Extensive experiments on CIFAR-10 and ImageNet demonstrate the effectiveness of the proposed method. Copyright 2020 by the author(s).

关键词： Curricula

来源：评论

学校读者我要写书评

暂无评论

CA-MLIF: Cross-Attention and Multimodal Low-Rank Interaction Fusion Framework for Tumor Prognostic Prediction 39

CA-MLIF: Cross-Attention and Multimodal Low-Rank Interaction...

引用

39th Annual AAAI Conference on Artificial Intelligence, AAAI 2025

作者： An, Yajun Chen, Jiale Lin, Huan Liu, Zhenbing Feng, Siyang Zhang, Hualong Lan, Rushi Liu, Zaiyi Pan, Xipeng School of Computer Science and Information Security Guilin University of Electronic Technology Guilin 541004 China School of Artificial Intelligence and Big Data Chongqing College of Finance and Economics Chongqing 402160 China Department of Radiology Guangdong Provincial People's Hospital (Guangdong Academy of Medical Sciences) Southern Medical University Guangzhou 510080 China Guangxi Key Laboratory of Image and Graphic Intelligent Processing Guilin University of Electronic Technology Guilin 541004 China Guangdong Provincial Key Laboratory of Artificial Intelligence in Medical Image Analysis and Application Guangzhou 510080 China

ISBN: (纸本)157735897X

Cancer is a leading cause of death worldwide due to its aggressive nature and complex variability. Accurate prognosis is therefore challenging but essential for guiding personalized treatment and follow-up. Previous research often relied on single data sources, missing the opportunity to combine various types of patient information for more comprehensive survival predictions. To address these challenges, we propose a two-stage fusion method named Cross-Attention and Multimodal Low-Rank Interaction Fusion Framework (CA-MLIF). In the first stage, we propose a CA mechanism for real-time feature updates and cross-modal mutual learning to capture rich semantic information. In the second stage, we design a novel multimodal low-rank interaction fusion method for survival prediction. Specifically, we present modal attention mechanism (MAM) for feature filtration, low-rank multimodal fusion (LMF) for model complexity reduction, and optimal weight concatenation (OWC) for maximizing feature integration. Extensive experiments on two public datasets TCGA-GBMLGG and TCGA-KIRC, as well as a multi-center in-house lung adenocarcinoma (LUAD) dataset validate the effectiveness of CA-MLIF, which demonstrate that our method outperforms existing approaches in survival prediction under both pathology-gene fusion and CT-pathology fusion scenarios. Copyright © 2025, Association for the Advancement of Artificial Intelligence (***). All rights reserved.

关键词： Learning to rank

来源：评论

学校读者我要写书评

暂无评论

Gaming at the Edge: A Weighted Congestion Game Approach for Latency-Sensitive Scheduling

Gaming at the Edge: A Weighted Congestion Game Approach for ...

引用

International Conference on Mobile Ad-hoc and Sensor Networks, MSN

作者： Xuezheng Liu Ke Liu Guoqiao Ye Miao Hu Yipeng Zhou Di Wu Sun Yat-sen University Guangzhou China Guangdong Key Laboratory of Big Data Analysis and Processing Guangzhou China Peng Cheng Laboratory Shenzhen China Macquarie University Sydney NSW Australia

ISBN: (纸本)9781665406697

The rapidly evolving technology of edge computing shows great potential in revolutionizing the market of cloud gaming. Edge computing can significantly lower the latency for better gaming experiences by performing computation at the proximity of game players. However, the acceleration of latency-sensitive cloud gaming services at the edge is challenging due to the heterogeneity of edge servers, different requirements among game players, and so on. In this paper, we propose an efficient latency-sensitive scheduling algorithm called EGSA to satisfy latency constraints for cloud gaming services at the edge. We first formulate the problem as a weighted congestion game, which takes a number of key factors (e.g., game genres, user strategies, latency constraint and device heterogeneity) into account. Based on the weighted congestion game model, we further design an efficient latency-sensitive scheduling algorithm, which can approximate the pure Nash equilibrium under Shapley cost-sharing method. We also perform theoretic analysis to prove that our proposed algorithm converges in polynomial steps. Finally, we conduct a set of experiments and the results show that our algorithm outperforms alternative strategies with up to 46% performance improvement.

关键词： Performance evaluation Graphics Scheduling algorithms Cloud gaming Approximation algorithms Nash equilibrium Rendering (computer graphics)

来源：评论

学校读者我要写书评

暂无评论

Discrimination-Aware Domain Adversarial Neural Network

引用

Journal of Computer Science & Technology 2020年第2期35卷 259-267页

作者： Yun-Yun Wang Jian-Min Gu Chao Wang Song-Can Chen Hui Xue College of Computer Science and Engineering Nanjing University of Posts and Telecommunications Nanjing 210046China Jiangsu Key Laboratory of Big Data Security and Intelligent Processing Nanjing 210046China College of Computer Science and Technology/College of Artificial Intelligence Nanjing University of Aeronautics and AstronauticsNanjing 210023China Key Laboratory of Pattern Analysis and Machine Intelligence Ministry of Industry and Information Technology Nanjing 210023China School of Computer Science and Engineering Southeast UniversityNanjing 210096China

The domain adversarial neural network(DANN)methods have been successfully proposed and attracted much attention *** DANNs,a discriminator is trained to discriminate the domain labels of features generated by a generator,whereas the generator attempts to confuse it such that the distributions between domains are *** a result,it actually encourages the whole alignment or transfer between domains,while the inter-class discriminative information across domains is not *** this paper,we present a Discrimination-Aware Domain Adversarial Neural Network(DA2NN)method to introduce the discriminative information or the discrepancy of inter-class instances across domains into deep domain ***2NN considers both the alignment within the same class and the separation among different classes across domains in knowledge transfer via multiple *** results show that DA2NN can achieve better classification performance compared with the DANN methods.

关键词： adversarial learning inter-class separation deep neural network discrimination-aware domain adaptation

来源：评论

学校读者我要写书评

暂无评论

CLSDRL:A routing optimization method for traffic feature extraction

CLSDRL:A routing optimization method for traffic feature ext...

引用

International Conference on Networking and Network Applications (NaNA)

作者： Hong Xia Jianguo Li Yanping Chen Ning Lv ZhongMin Wang Qingyi Dong School of Computer Science and Technology Xi’an University of Posts and Telecommunications Xi’an Shaanxi China Shaanxi Key Laboratory of Network Data Analysis and Intelligent Processing Xi’an Shaanxi China Xi’an Key Laboratory of Big Data and Intelligent Computing Xi’an Shaanxi China

In order to solve the impact of the temporal and spatial characteristics of traffic on network routing optimization, this paper proposes convolution long-short memory neural network deep reinforcement learning (CLSDRL) model for routing optimization. The CLSDRL model consists of deep deterministic policy gradients (DDPG) deep couple with convolution neural network (CNN) and long-short memory neural network (LSTM). After extracting the spatial and temporal characteristics of network traffic with CNN and LSTM, routing decisions are made with DDPG algorithm. Experiments are conducted under different load intensities, and the network performance is evaluated by the average network delay and packet loss rate, experimental results show that this method can improve significantly network performance.

关键词： Training Convolution Neural networks Optimization methods Packet loss Reinforcement learning Telecommunication traffic

来源：评论

学校读者我要写书评

暂无评论

Neural Multi-Objective Combinatorial Optimization with Diversity Enhancement

arXiv

引用

arXiv 2023年

作者： Chen, Jinbiao Zhang, Zizhen Cao, Zhiguang Wu, Yaoxin Ma, Yining Ye, Te Wang, Jiahai School of Computer Science and Engineering Sun Yat-sen University China School of Computing and Information Systems Singapore Management University Singapore Department of Industrial Engineering & Innovation Sciences Eindhoven University of Technology Netherlands Department of Industrial Systems Engineering & Management National University of Singapore Singapore Key Laboratory of Machine Intelligence and Advanced Computing Ministry of Education Sun Yat-sen University China Guangdong Key Laboratory of Big Data Analysis and Processing Guangzhou China

Most of existing neural methods for multi-objective combinatorial optimization (MOCO) problems solely rely on decomposition, which often leads to repetitive solutions for the respective subproblems, thus a limited Pareto set. Beyond decomposition, we propose a novel neural heuristic with diversity enhancement (NHDE) to produce more Pareto solutions from two perspectives. On the one hand, to hinder duplicated solutions for different subproblems, we propose an indicator-enhanced deep reinforcement learning method to guide the model, and design a heterogeneous graph attention mechanism to capture the relations between the instance graph and the Pareto front graph. On the other hand, to excavate more solutions in the neighborhood of each subproblem, we present a multiple Pareto optima strategy to sample and preserve desirable solutions. Experimental results on classic MOCO problems show that our NHDE is able to generate a Pareto front with higher diversity, thereby achieving superior overall performance. Moreover, our NHDE is generic and can be applied to different neural methods for MOCO. Copyright © 2023, The Authors. All rights reserved.

关键词： Deep learning

来源：评论

学校读者我要写书评

暂无评论

Secrecy Performance analysis in Internet of Satellites: Physical Layer Security Perspective

Secrecy Performance Analysis in Internet of Satellites: Phys...

引用

IEEE International Conference on Communications in China (ICCC)

作者： Yongpeng Shi Ya Gao Yujie Xia Henan Key Laboratory of E-commerce Big Data Processing and Analysis School of Physics and Electronic Information Luoyang Normal College China

ISBN: (数字)9781728173276

ISBN: (纸本)9781728173283

As the latest evolving architecture of space networks, Internet of Satellites (IoSat) is regarded as a promising paradigm in the future beyond 5G and 6G wireless systems. However, due to the extremely large number of satellites and open links, it is challenging to ensure communication security in IoSat, especially for wiretap resisting. To the best of our knowledge, it is an entirely new problem to study the security issue in IoSat, since existing works concerning physical layer security (PLS) in satellite networks mainly focused on the space-to-terrestrial links. It is also noted that, we are the first to investigate PLS problem in IoSat. In light of this, we present in this paper an analytical model of PLS in IoSat where a terrestrial transmitter delivers its information to multi-satellite in the presence of eavesdroppers. By adopting the key parameters such as satellites' deployment density, minimum elevation angle, and orbit height, two major secrecy metric including average secrecy capacity and probability are derived and analyzed. As demonstrated by extensive numerical results, the presented theoretical framework can be utilized to efficiently evaluate the secrecy performance of IoSat, and guide the design and optimization for communication security in such systems.

关键词： Wireless communication Analytical models Satellites Physical layer security Orbits Internet Security

来源：评论

学校读者我要写书评

暂无评论

A BCS-GDE Multi-objective Optimization Algorithm for Combined Cooling, Heating and Power Model with Decision Strategies

arXiv

引用

arXiv 2022年

作者： Sun, Jiaze Deng, Jiahui Li, Yang Han, Nan School of Computer Science and Technology Xi’an University of Posts and Telecommunications Xi’an710121 China Shaanxi Key Laboratory of Network Data Analysis and Intelligent Processing Xi’an710121 China Xi 'an Key Laboratory of Big Data and Intelligent Computing Xi’an710127 China School of Information Science and Technology Northwest University Xi’an710127 China School of Electrical Engineering Northeast Electric Power University Jilin132012 China

District energy systems can not only reduce energy consumption but also set energy supply dispatching schemes according to demand. In addition to economic cost, energy consumption and pollutant are more worthy of attention when evaluating combined cooling, heating and power (CCHP) models. In this paper, the CCHP model is established with the objective of economic cost, primary energy consumption, and pollutant emissions. The mathematical expression of the CCHP system is proposed, and a multi-objective optimization model with constraints is established. According to different usage requirements, two decision-making strategies are designed, which can adapt to different scenarios. Besides, a generalized differential evolution with the best compromise solution processing mechanism (BCS-GDE) algorithm is proposed to optimize the CCHP model for the first time. The algorithm provides the optimal energy scheduling scheme by optimizing the production capacity of different capacity equipment. The simulation is conducted in three application scenarios: hotels, offices, and residential buildings. The simulation results show that the model established in this paper can reduce economic cost by 72%, primary energy consumption by 73%, and pollutant emission by 88%. Concurrently, the Wilcoxon signed-rank test shows that BCS-GDE is significantly better than OMOPSO, NSGA-II, and SPEA2 with greater than 95% confidence. Copyright © 2022, The Authors. All rights reserved.

关键词： Evolutionary algorithms

来源：评论

学校读者我要写书评

暂无评论

A Stepwise Path Selection Scheme Based on Multiple QoS Parameters Evaluation in SDN 17th

A Stepwise Path Selection Scheme Based on Multiple QoS Param...

引用

17th EAI International Conference on Collaborative Computing: Networking, Applications, and Worksharing, CollaborateCom 2021

作者： Liu, Lin Zhou, Jian-Tao Xing, Hai-Feng Guo, Xiao-Yong College of Computer Science Ecological Big Data Engineering Research Center of the Ministry of Education Cloud Computing and Service Software Engineering Laboratory of Inner Mongolia Autonomous Region National and Local Joint Engineering Research Center of Intelligent Information Processing Technology for Mongolian Social Computing and Data Processing Key Laboratory of Inner Mongolia Autonomous Region Big Data Analysis Technology Engineering Research Center of Inner Mongolia Autonomous Region Inner Mongolia University Inner Mongolia Hohhot China College of Computer Science and Technology Inner Mongolia Normal University Inner Mongolia Hohhot China College of Computer Information and Management Inner Mongolia University of Finance and Economics Inner Mongolia Hohhot China

ISBN: (纸本)9783030926342

Nowadays, the best-effort service can not guarantee the quality of service (QoS) for all kinds of services. QoS routing is an important method to guarantee QoS requirements. It involves path selection for flows based on the current network status and the performance criteria of the service requirements. However, it is difficult for proposed solutions to obtain all the available paths owing to not fully considering all the QoS parameters of paths. In this paper, we propose SWQoS, a novel, universal, and stepwise QoS guarantee scheme based on multiple QoS parameter evaluation for selecting the available paths including preferred paths, satisfied paths and reluctant paths in SDN. The experiments show that SWQoS can select all the available paths that meet the performance criteria of the service requirements and have better QoS parameter performance compared with other path selection methods. © 2021, ICST Institute for Computer Sciences, Social Informatics and Telecommunications Engineering.

关键词： Quality of service

来源：评论

学校读者我要写书评

暂无评论

Dynamic Pricing for Client Recruitment in Federated Learning

arXiv

引用

arXiv 2022年

作者： Wang, Xuehe Zheng, Shensheng Duan, Lingjie School of Artificial Intelligence Sun Yat-sen University Zhuhai The Guangdong Key Laboratory of Big Data Analysis and Processing Guangzhou China School of Artificial Intelligence Sun Yat-sen University Zhuhai China Pillar of Engineering Systems and Design Singapore University of Technology and Design Singapore Singapore

A federated learning (FL) system first needs to use heterogeneous clients to recruit data, and then perform data training locally on the client to finish model training for preserving users’ data privacy. Yet clients still face the cost of computational energy consumption on model training and parameter transmission and are reluctant to join federated learning platform. Thus, incentive mechanisms are needed when inviting numerous clients to help train the global model. However, static pricing cannot adjust data size adaptively to minimize cost due to client random arrival for participation and incomplete information about computing cost. Moreover, how to balance data sampling time and model training for finite time horizons is under-explored. Therefore, in this paper, a two-phase FL model consisting of the data recruitment phase and model training phase is formulated to study the clients’ incentive mechanism design under incomplete information about clients’ arrivals and their private costs. First, we propose a dynamic pricing scheme for homogeneous clients that offer time-dependent monetary returns to clients by considering the tradeoff between the total payment to clients and the model accuracy loss. We show that the pricing should increase over time in the data-sampling phase due to data aging. Then we obtain the best time partition between data sampling and training phases under a closed-form dynamic pricing solution. It is shown that a small data recruitment threshold should be allocated if the client’ training time per global iteration is long. Further, the extension to heterogeneous clients with different data size and working time is discussed regarding to the optimal dynamic pricing and recruitment threshold. We prove monotonicity in multiple client-type choice and a linear algorithm is proposed to find the optimal recruitment threshold and client-type choice for total cost minimization. Finally, we present the robustness of our algorithm to data size and e

关键词： Costs

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：