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

arXiv 2024年

作者： Li, Feiran Xu, Qianqian Bao, Shilong Yang, Zhiyong Cong, Runmin Cao, Xiaochun Huang, Qingming Institute of Information Engineering Chinese Academy of Sciences Beijing China School of Cyber Security University of Chinese Academy of Sciences Beijing China Key Laboratory of Intelligent Information Processing Institute of Computing Technology Chinese Academy of Sciences Beijing China School of Computer Science and Technology University of Chinese Academy of Sciences Beijing China Institute of Information Science Beijing Jiaotong University Beijing China School of Control Science and Engineering Shandong University Jinan China Key Laboratory of Machine Intelligence and System Control Ministry of Education Jinan China School of Cyber Science and Tech. Sun Yat-Sen University Shenzhen Campus China Key Laboratory of Big Data Mining and Knowledge Management Chinese Academy of Sciences Beijing China

This paper explores the size-invariance of evaluation metrics in Salient Object Detection (SOD), especially when multiple targets of diverse sizes co-exist in the same image. We observe that current metrics are size-sensitive, where larger objects are focused, and smaller ones tend to be ignored. We argue that the evaluation should be size-invariant because bias based on size is unjustified without additional semantic information. In pursuit of this, we propose a generic approach that evaluates each salient object separately and then combines the results, effectively alleviating the imbalance. We further develop an optimization framework tailored to this goal, achieving considerable improvements in detecting objects of different sizes. Theoretically, we provide evidence supporting the validity of our new metrics and present the generalization analysis of SOD. Extensive experiments demonstrate the effectiveness of our method. The code is available at https://***/Ferry-Li/SI-SOD. Copyright © 2024, The Authors. All rights reserved.

关键词： Object detection

来源：评论

学校读者我要写书评

暂无评论

TJCCT: A Two-timescale Approach for UAV-assisted Mobile Edge computing

arXiv

引用

arXiv 2024年

作者： Sun, Zemin Sun, Geng Wu, Qingqing He, Long Liang, Shuang Pan, Hongyang Niyato, Dusit Yuen, Chau Leung, Victor C.M. The College of Computer Science and Technology Jilin University Changchun130012 China Key Laboratory of Symbolic Computation and Knowledge Engineering Ministry of Education Jilin University Changchun130012 China Department of Electronic Engineering Shanghai Jiao Tong University Shanghai China The School of Information Science and Technology Northeast Normal University Changchun130024 China The School of Computer Science and Engineering Nanyang Technological University Singapore639798 Singapore The School of Electrical and Electronics Engineering Nanyang Technological University Singapore639798 Singapore The College of Computer Science and Software Engineering Shenzhen University Shenzhen518060 China Department of Electrical and Computer Engineering University of British Columbia VancouverBCV6T 1Z4 Canada

Unmanned aerial vehicle (UAV)-assisted mobile edge computing (MEC) is emerging as a promising paradigm to provide aerial-terrestrial computing services in close proximity to mobile devices (MDs). However, meeting the demands of computation-intensive and delay-sensitive tasks for MDs poses several challenges, including the demand-supply contradiction between MDs and MEC servers, the demand-supply heterogeneity between MDs and MEC servers, the trajectory control requirements on energy efficiency and timeliness, and the different time-scale dynamics of the network. To address these issues, we first present a hierarchical architecture by incorporating terrestrial-aerial computing capabilities and leveraging UAV flexibility. Furthermore, we formulate a joint computing resource allocation, computation offloading, and trajectory control problem to maximize the system utility. Since the problem is a non-convex and NP-hard mixed integer nonlinear programming (MINLP), we propose a two-timescale joint computing resource allocation, computation offloading, and trajectory control (TJCCT) approach for solving the problem. In the short timescale, we propose a price-incentive model for on-demand computing resource allocation and a matching mechanism-based method for computation offloading. In the long timescale, we propose a convex optimization-based method for UAV trajectory control. Besides, we theoretically prove the stability, optimality, and polynomial complexity of TJCCT. Extended simulation results demonstrate that the proposed TJCCT outperforms the comparative algorithms in terms of the system utility, average processing rate, average completion delay, and average completion ratio. Copyright © 2024, The Authors. All rights reserved.

关键词： Computation offloading

来源：评论

学校读者我要写书评

暂无评论

Optimal partition algorithm of RBF neural network and its applications to stock price prediction

引用

Moshi Shibie yu Rengong Zhineng/Pattern Recognition and Artificial Intelligence 2005年第3期18卷 374-379页

作者： Sun, Yan-Feng Liang, Yan-Chun Zhang, Wen-Li Lu, Ying-Hua Key Laboratory for Symbol Computation and Knowledge Engineering College of Computer Science and Technology Jilin University Changchun 130012 China Institute of Computing Technology Chinese Academy of Sciences Beijing 100080 China Department of Computer Science Northeast Normal University Changchun 130024 China

The optimal partition algorithm (OPA) is applied to the training of parameters in the radial basis function (RBF) neural network. The appropriate modification for the OPA is performed according to the characteristics of the RBF neural network. The approach for determining the centers and widths of the clustering is added in the modified OPA and applied to choose the centers and widths of the neural network. A method for adjusting the structure of the neural network dynamically is presented by using the difference of the objective functions of the clustering. Thus it is realized to select the number of the hidden nodes adaptively. Simulation results of the stock price prediction demonstrate the effectiveness of the proposed approach. Comparisons with traditional algorithms show that the proposed OPA method possesses obvious advantages in the precision of forecasting, generalization, and forecasting trends. Simulations also show that the algorithm combining the OPA with the orthogonal least squares (OLS) possesses more superior performance in the rightness of forecasting trends.

关键词： Optimal partition algorithm (OPA) Ordered sample Radial basis function (RBF) neural network Stock price prediction

来源：评论

学校读者我要写书评

暂无评论

Joint Task Offloading and Resource Allocation in Aerial-Terrestrial UAV Networks with Edge and Fog computing for Post-Disaster Rescue

arXiv

引用

arXiv 2023年

作者： Sun, Geng He, Long Sun, Zemin Wu, Qingqing Liang, Shuang Li, Jiahui Niyato, Dusit Leung, Victor C.M. The College of Computer Science and Technology Jilin University Changchun130012 China The Key Laboratory of Symbolic Computation and Knowledge Engineering of Ministry of Education Jilin University Changchun130012 China The Department of Electronic Engineering Shanghai Jiao Tong University Shanghai China The School of Information Science and Technology Northeast Normal University Changchun130024 China Pillar of Engineering Systems and Design Singapore University of Technology and Design 487372 Singapore The School of Computer Science and Engineering Nanyang Technological University Singapore639798 Singapore The College of Computer Science and Software Engineering Shenzhen University Shenzhen518060 China The Department of Electrical and Computer Engineering University of British Columbia VancouverBCV6T 1Z4 Canada

Unmanned aerial vehicles (UAVs) play an increasingly important role in assisting fast-response post-disaster rescue due to their fast deployment, flexible mobility, and low cost. However, UAVs face the challenges of limited battery capacity and computing resources, which could shorten the expected flight endurance of UAVs and increase the rescue response delay during performing mission-critical tasks. To address this challenge, we first present a three-layer post-disaster rescue computing architecture by leveraging the aerial-terrestrial edge capabilities of mobile edge computing (MEC) and vehicle fog computing (VFC), which consists of a vehicle fog layer, a UAV client layer, and a UAV edge layer. Moreover, we formulate a joint task offloading and resource allocation optimization problem (JTRAOP) with the aim of maximizing the time-average system utility. Since the formulated JTRAOP is proved to be NP-hard, we propose an MEC-VFC-aided task offloading and resource allocation (MVTORA) approach, which consists of a game theoretic algorithm for task offloading decision, a convex optimization-based algorithm for MEC resource allocation, and an evolutionary computation-based hybrid algorithm for VFC resource allocation. Simulation results validate that the proposed approach can achieve superior system performance compared to the other benchmark schemes, especially under heavy system workloads. Copyright © 2023, The Authors. All rights reserved.

关键词： Fog computing

来源：评论

学校读者我要写书评

暂无评论

Mandari: Multi-Modal Temporal knowledge Graph-aware Sub-graph Embedding for Next-POI Recommendation

Mandari: Multi-Modal Temporal Knowledge Graph-aware Sub-grap...

引用

IEEE International Conference on Multimedia and Expo (ICME)

作者： Xiaoqian Liu Xiuyun Li Yuan Cao Fan Zhang Xiongnan Jin Jinpeng Chen School of Computer Science (National Pilot Software Engineering School) Beijing University of Posts and Telecommunications Beijing China Key Laboratory of Trustworthy Distributed Computing and Service (BUPT) Ministry of Education Beijing China The Technology Innovation Center of Cultural Tourism Big Data of Hebei Province Chengde China Hebei Normal University for Nationalities Chengde China Knowledge Discovery and Data Mining Research Center Zhejiang Lab Hangzhou China

Next-POI recommendation aims to explore from user check-in sequence to predict the next possible location to be visited. Existing methods are often difficult to model the implicit association of multi-modal data with user choices. Moreover, traditional methods struggle to fully explore the variation of user preferences at variable time intervals. To tackle these limitations, we propose a Multi-Modal Temporal knowledge Graph-aware Sub-graph Embedding approach (Mandari). We first construct a novel Multi-Modal Temporal knowledge Graph. Based on the proposed knowledge graph, we integrate multi-modal information and leverage the graph attention network to calculate sub-graph prediction probability. Next, we implement a temporal knowledge mining method to model the segmentation and periodicity of user check-in and obtain temporal prediction probability. Finally, we fuse temporal prediction probability with the previous sub-graph prediction probability to obtain the final result. Extensive experiments demonstrate that our approach outperforms existing state-of-the-art methods.

关键词：

来源：评论

学校读者我要写书评

暂无评论

Structure-aware random fourier kernel for graphs 21

Structure-aware random fourier kernel for graphs

引用

Proceedings of the 35th International Conference on Neural Information Processing Systems

作者： Jinyuan Fang Qiang Zhang Zaiqiao Meng Shangsong Liang School of Computer Science and Engineering Sun Yat-sen University China and Guangdong Key Laboratory of Big Data Analysis and Processing Guangzhou China Hangzhou Innovation Center Zhejiang University China and College of Computer Science and Technology Zhejiang University China and AZFT Knowledge Engine Lab China School of Computing Science University of Glasgow United Kingdom and Mohamed bin Zayed University of Artificial Intelligence United Arab Emirates School of Computer Science and Engineering Sun Yat-sen University China and Guangdong Key Laboratory of Big Data Analysis and Processing Guangzhou China and Mohamed bin Zayed University of Artificial Intelligence United Arab Emirates

ISBN: (纸本)9781713845393

Gaussian Processes (GPs) define distributions over functions and their generalization capabilities depend heavily on the choice of kernels. In this paper, we propose a novel structure-aware random Fourier (SRF) kernel for GPs that brings several benefits when modeling graph-structured data. First, SRF kernel is defined with a spectral distribution based on the Fourier duality given by the Bochner's theorem, transforming the kernel learning problem to a distribution inference problem. Second, SRF kernel admits a random Fourier feature formulation that makes the kernel scalable for optimization. Third, SRF kernel enables to leverage geometric structures by taking subgraphs as inputs. To effectively optimize GPs with SRF kernel, we develop a variational EM algorithm, which alternates between an inference procedure (E-step) and a learning procedure (M-step). Experimental results on five real-world datasets show that our model can achieve state-of-the-art performance in two typical graph learning tasks, i.e., object classification and link prediction.

关键词：

来源：评论

学校读者我要写书评

暂无评论

CellMirror: Deciphering Cell Populations from Spatial Transcriptomics Data by Interpretable Contrastive Learning

CellMirror: Deciphering Cell Populations from Spatial Transc...

引用

Medical Artificial Intelligence (MedAI), IEEE International Conference on

作者： Junjie Xia Jiangnan Cui Zhenyu Huang Shuangquan Zhang Fang Yao Yijian Zhang Chunman Zuo Department of Applied Mathematics Institute of Artificial Intelligence Donghua University Shanghai China Institute of Artificial Institute Donghua University Shanghai China College of Computer Science and Technology Jilin University Changchun China School of Cyber Science and Engineering Nanjing University of Science and Technology Nanjing China Affiliated Shenzhen Maternity and Child Healthcare Hospital Institute of Maternal and Child Medicine Southern Medical University Shenzhen China Department of General Surgery Xinhua Hospital Affiliated to Shanghai Jiao Tong University of Medicine Shanghai China Key Laboratory of Symbolic Computation and Knowledge Engineering of Ministry of Education Jilin University Changchun China

Spatial transcriptomics (ST) has enabled us elucidating tumor microenvironments, however, the technological limitations without single-cell resolution severely hinder its application. Here, we propose CellMirror, an interpretable contrastive learning model to decipher heterogeneous cell populations in ST data by single-cell RNA-sequencing (scRNA-seq) data. Specifically, CellMirror learns the disentangled shared (representing biological variations in both data) and salient features (specific to ST data) by two contrastive variational encoders, while constructing the relations between genes and features by a shared linear decoder. In various cancer samples, CellMirror outperforms other tools in learning common features for label transfer, and interpretation of features. Particularly, in breast cancer studies, CellMirror detects finer domains in ST data missed by other methods, and is robust to dissect cell populations in ST data using independent scRNA-seq data. These results demonstrate applications of CellMirror in interpreting the complex tumor structure in ST data by integrating scRNA-seq data.

关键词：

来源：评论

学校读者我要写书评

暂无评论

Link prediction in social network based on local information and attributes of nodes

引用

Journal of Physics: Conference Series 2017年第1期887卷

作者： Yingying Liang Lan Huang Zhe Wang College of Computer Science and Technology Jilin University 130012 Changchun China Key Laboratory of Symbolic Computation and Knowledge Engineering (Jilin University) Ministry of Education 130012 Changchun China Zhuhai College of Jilin University 519041 Zhuhai China

Link prediction is essential to both research areas and practical applications. In order to make full use of information of the network, we proposed a new method to predict links in the social network. Firstly, we extracted topological information and attributes of nodes in the social network. Secondly, we integrated them into feature vectors. Finally, we used XGB classifier to predict links using feature vectors. Through expanding information source, experiments on a co-authorship network suggest that our method can improve the accuracy of link prediction significantly.

关键词：

来源：评论

学校读者我要写书评

暂无评论

Incorporating Surprisingly Popular Algorithm and Euclidean Distance-based Adaptive Topology into PSO

arXiv

引用

arXiv 2021年

作者： Wu, Xuan Han, Jizong Wang, Di Gao, Pengyue Cui, Quanlong Chen, Liang Liang, Yanchun Huang, Han Lee, Heow Pueh Miao, Chunyan Zhou, You Wu, Chunguo Key Laboratory of Symbolic Computation and Knowledge Engineering of Ministry of Education College of Computer Science and Technology Jilin University Changchun130012 China Joint NTU-UBC Research Centre of Excellence in Active Living for the Elderly Nanyang Technological University 639798 Singapore State Key Laboratory of Superhard Materials International Center for Computational Method and Software College of Physics Jilin University Changchun130012 China Commercial Quality and Efficiency Department Baidu Inc Beijing100085 China Department of Computer Science Shantou University Shantou515063 China School of Computer Science Zhuhai College of Science and Technology Zhuhai519041 China School of Software Engineering The South China University of Technology Guangzhou510641 China Department of Mechanical Engineering National University of Singapore 117575 Singapore School of Computer Science and Engineering Nanyang Technological University 639798 Singapore College of Software Jilin University Changchun130012 China

While many Particle Swarm Optimization (PSO) algorithms only use fitness to assess the performance of particles, in this work, we adopt Surprisingly Popular Algorithm (SPA) as a complementary metric in addition to fitness. Consequently, particles that are not widely known also have the opportunity to be selected as the learning exemplars. In addition, we propose a Euclidean distance-based adaptive topology to cooperate with SPA, where each particle only connects to k number of particles with the shortest Euclidean distance during each iteration. We also introduce the adaptive topology into heterogeneous populations to better solve large-scale problems. Specifically, the exploration sub-population better preserves the diversity of the population while the exploitation sub-population achieves fast convergence. Therefore, large-scale problems can be solved in a collaborative manner to elevate the overall performance. To evaluate the performance of our method, we conduct extensive experiments on various optimization problems, including three benchmark suites and two real-world optimization problems. The results demonstrate that our Euclidean distance-based adaptive topology outperforms the other widely adopted topologies and further suggest that our method performs significantly better than state-of-the-art PSO variants on small, medium, and large-scale problems. Copyright © 2021, The Authors. All rights reserved.

关键词： Small-world networks

来源：评论

学校读者我要写书评

暂无评论

Correction to: MRI enhancement based on visual-attention by adaptive contrast adjustment and image fusion

引用

Multimedia Tools and Applications 2021年第9期80卷 13019-13019页

作者： Rui Zhu Xiongfei Li Xiaoli Zhang Xiaowei Xu Key Laboratory of Symbolic Computation and Knowledge Engineering of Ministry of Education Jilin University Changchun China College of Computer Science and Technology Jilin University Changchun China Department of Information Sciences University of Arkansas at Little Rock Little Rock USA

A Correction to this paper has been published: https://***/10.1007/s11042-021-10782-7

关键词：

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：