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

作者： Bai, Ting Johansson, Alexander Li, Shaoyuan Johansson, Karl Henrik Mårtensson, Jonas School of Electrical Engineering and Computer Science KTH Royal Institute of Technology Stockholm Sweden KTH Royal Institute of Technology Stockholm Sweden Department of Automation Shanghai Jiao Tong University Shanghai China Key Laboratory of System Control and Information Processing Shanghai Jiao Tong University Shanghai China Digital Futures Stockholm Sweden

This paper models a platooning system consisting of trucks and a third-party service provider (TPSP), which performs platoon coordination, distributes the platooning profit in platoons, and charges trucks in exchange for the services. Government subsidies used to incentivize platooning are also considered. We propose a pricing rule for the TPSP, which keeps part of the platooning profit including the subsidy each time a platoon is formed. In addition, a platoon coordination solution based on the distributed model predictive control (MPC) is proposed, in which the pricing rule under government subsidies is integrated. We perform a realistic simulation over the Swedish road network to evaluate the impact of the pricing rule and subsidies on the achieved profits and fuel savings. Our results show that subsidies are an effective mean to boost fuel savings from platooning. Moreover, the simulation study indicates that high pricing corresponds to a low platooning rate of the system, as trucks' incentives for platooning decrease. © 2023 The Authors. Asian Journal of Control published by John Wiley & Sons Australia, Ltd on behalf of Chinese Automatic Control Society.

关键词： Trucks

来源：评论

学校读者我要写书评

暂无评论

Graph External Attention Enhanced Transformer

arXiv

引用

arXiv 2024年

作者： Liang, Jianqing Chen, Min Liang, Jiye Key Laboratory of Computational Intelligence and Chinese Information Processing of Ministry of Education School of Computer and Information Technology Shanxi University Shanxi Taiyuan030006 China

The Transformer architecture has recently gained considerable attention in the field of graph representation learning, as it naturally overcomes several limitations of Graph Neural Networks (GNNs) with customized attention mechanisms or positional and structural encodings. Despite making some progress, existing works tend to overlook external information of graphs, specifically the correlation between graphs. Intuitively, graphs with similar structures should have similar representations. Therefore, we propose Graph External Attention (GEA) - a novel attention mechanism that leverages multiple external node/edge key-value units to capture inter-graph correlations implicitly. On this basis, we design an effective architecture called Graph External Attention Enhanced Transformer (GEAET), which integrates local structure and global interaction information for more comprehensive graph representations. Extensive experiments on benchmark datasets demonstrate that GEAET achieves state-of-the-art empirical performance. The source code is available for reproducibility at: https://***/icm1018/GEAET. Copyright © 2024, The Authors. All rights reserved.

关键词： Graph neural networks

来源：评论

学校读者我要写书评

暂无评论

PSI-PPER: A Privacy-Preserving and Efficient Ridesharing Scheme

引用

IEEE Internet of Things Journal 2025年

作者： Lei, Zhang Wuwei, Yang Qiancheng, Ye Yongbo, Bai Xiao, Zhang Jie, Chen Bin, Wang and Jiamusi Key Laboratory of Satellite Navigation Technology and Equipment Engineering Technology School of Information Science and Electronic Technology Jiamusi University Heilongjiang Provincial Key Laboratory of Autonomous Intelligence and Information Processing Heilongjiang Province Jiamusi 154007 China

In recent years, ridesharing has been widely adopted as an instance of sharing economy. When using ridesharing service, users (i.e., drivers and riders) have to share their private trip information with the service provider, which causes great privacy risks to them. In order to protect user’s privacy, based on private set intersection cardinality (short for PSI-CA), we propose a privacy-preserving and efficient ridesharing scheme (short for PSI-PPER). It enables the service provider to efficiently match riders with appropriate drivers without learning their private trip information. In PSI-PPER, we adopt “screen and then match” method, which means the service provider first screens each rider’s possible matching drivers, and then performs matching operations on each rider and its possible matching drivers. For matching riders and drivers efficiently, the secure ride-matching computation is converted into private set intersection cardinality and is achieved by a one-party to multi-party PSI-CA protocol, which is designed based on vector oblivious linear evaluation and oblivious key-value stores. We prove the security of the proposed scheme theoretically and evaluate its performance through experiments. The results show that the proposed scheme can achieve practical ride-matching accuracy. In addition, PSI-PPER provides higher security and superior efficiency compared to other secure ride-matching schemes with large number of drivers and large trip length. © 2014 IEEE.

关键词： location privacy privacy-preserving PSI ride-matching

来源：评论

学校读者我要写书评

暂无评论

Robust Self-Localization of Wireless Acoustic Sensor Networks

引用

IEEE Internet of Things Journal 2025年第12期12卷 21646-21661页

作者： Wang, Xu Hu, De Liu, Rui Bao, Feilong Inner Mongolia University College of Computer Science Hohhot010021 China National and Local Joint Engineering Research Center of Intelligent Information Processing Technology for Mongolian Hohhot 010021 China Inner Mongolia Key Laboratory of Mongolian Information Processing Technology Hohhot 010021 China

Wireless acoustic sensor networks (WASNs), or the so-called internet of audio things (IoAuTs), have attracted increasing attention in the IoT community. As the geometry structure of WASNs is required in audio/speech processing tasks like source localization or acoustic beamforming, automatic self-localization of sensors is necessary. However, most of the existing approaches suffer from poor stability, as their constructed cost functions involve non-convex programming. To address this issue, we investigate the robust self-localization (or geometry calibration) of WASNs in this paper. Specifically, a rough self-localization (RSL) method is first presented based on measurements including time-difference-of-arrivals (TDoAs), direction-of-arrivals (DoA), and energy-rates (ERs), and its closed-form solution is further derived. As ER estimates are sensitive to acoustic environments, the performance of the RSL method is somewhat limited. Therefore, a precise self-localization (PSL) method is then developed by building a weighted (and non-convex) TDoA-DoA cost function, after regarding the RSL approach as an initialization step. As the RSL offers better initial values compared with existing initialization strategies, the combination of RSL and PSL methods (named as RSL-PSL method) shows stronger robustness and stability. In addition, computational complexity of both RSL and PSL methods are analyzed in details. Finally, the Cramér-Rao Bound (CRB) of the PSL method is derived to show its theoretical lower bound. The proposed RSL-PSL method outperforms the state-of-the-arts in terms of stability and accuracy, which is confirmed by numerical real-world and simulation experiments. © 2014 IEEE.

关键词： Cost functions

来源：评论

学校读者我要写书评

暂无评论

Metric Learning with Distillation for Overcoming Catastrophic Forgetting 16th

Metric Learning with Distillation for Overcoming Catastrop...

引用

16th International Conference on Bio-Inspired Computing: Theories and Applications, BIC-TA 2021

作者： Yu, Piaoyao He, Juanjuan Min, Qilang Zhu, Qi College of Computer Science and Technology Wuhan University of Science and Technology Wuhan China Hubei Province Key Laboratory of Intelligent Information Processing and Real-Time Industrial System Wuhan China

ISBN: (纸本)9789811912528

In incremental learning, reducing catastrophic forgetting always adds additional weights to the classification layer when a new task comes. Moreover, it focuses on prediction accuracy, ignores mislabeling differences, and causes the learned features to be scattered. This paper removes the softmax and integrates depth metric learning to compute image embeddings, which doesn’t need to add extra weights or additional space for new classes. The distances of the data mapped in the old and new task spaces are calculated separately. Then, the distillation of depth metric learning is used to make the two distances as similar as possible to improve the performance of the old knowledge. The experimental results on Cifar10 and Tiny-ImageNet show that the proposed method can effectively alleviate catastrophic forgetting and enhance the effectiveness of incremental learning. © 2022, Springer Nature Singapore Pte Ltd.

关键词： Distillation

来源：评论

学校读者我要写书评

暂无评论

Robust restoration of low-dose cerebral perfusion CT images using NCS-Unet

引用

Nuclear Science and Techniques 2022年第3期33卷 62-76页

作者： Kai Chen Li-Bo Zhang Jia-Shun Liu Yuan Gao Zhan Wu Hai-Chen Zhu Chang-Ping Du Xiao-Li Mai Chun-Feng Yang Yang Chen Southeast University Nanjing 210096China School of Cyber Science and Engineering Southeast UniversityNanjing 210096China Key Laboratory of Computer Network and Information Integration(Southeast University) Ministry of EducationNanjing 210096China Department of Radiology General Hospital of the Northern Theater of the Chinese People’s Liberation ArmyShenyang 110016China Laboratory of Image Science and Technology The School of Computer Science and EngineeringSoutheast UniversityNanjing 210096China Department of Radiology Nanjing Drum Tower HospitalThe Affiliated Hospital of Nanjing University Medical SchoolNanjing 210008China Jiangsu Key Laboratory of Molecular and Functional Imaging Department of RadiologyZhongda HospitalSoutheast UniversityNanjing 210009China Jiangsu Provincial Joint International Research Laboratory of Medical Information Processing School of Computer Science and EngineeringSoutheast UniversityNanjing 210096China

Cerebral perfusion computed tomography(PCT)is an important imaging modality for evaluating cerebrovascular diseases and stroke *** widespread public concern about the potential cancer risks and health hazards associated with cumulative radiation exposure in PCT imaging,considerable research has been conducted to reduce the radiation dose in X-ray-based brain perfusion *** the dose of X-rays causes severe noise and artifacts in PCT *** solve this problem,we propose a deep learning method called *** exceptional characteristics of non-subsampled contourlet transform(NSCT)and the Sobel filter are introduced into *** decomposes the convolved features into high-and low-frequency *** decomposed high-frequency component retains image edges,contrast imaging traces,and noise,whereas the low-frequency component retains the main image *** Sobel filter extracts the contours of the original image and the imaging traces caused by the contrast agent *** extracted information is added to NCS-Unet to improve its performance in noise reduction and artifact *** and quantitative analyses demonstrated that the proposed NCS-Unet can improve the quality of low-dose cone-beam CT perfusion reconstruction images and the accuracy of perfusion parameter calculations.

关键词： Cerebral perfusion CT Low-dose Image denoising Perfusion parameters

来源：评论

学校读者我要写书评

暂无评论

Milliwatt-threshold widely-tunable optical parametric oscillation in integrated chalcogenide microresonators

Milliwatt-threshold widely-tunable optical parametric oscill...

引用

2022 Conference on Lasers and Electro-Optics Pacific Rim, CLEO-PR 2022

作者： Wang, Zifu Zhao, Jiaxin Xia, Di Li, Yufei Luo, Liyang Liu, Dong Zhang, Bin Li, Zhaohui Guangdong Provincial Key Laboratory of Optoelectronic Information Processing Chips and Systems School of Electrical and Information Technology Sun Yat-sen University Guangzhou510275 China Key Laboratory of Optoelectronic Materials and Technologies Sun Yat-sen University Guangzhou510275 China Zhuhai519000 China

We demonstrate a widely-tunable optical parametric oscillation ranging from 1254 nm to 2088 nm in integrated chalcogenide microresonators with 1.2 milliwatt pump power threshold. © 2022 The Author(s) © IEEE ...

ISBN: (纸本)9798350350012

关键词：

来源：评论

学校读者我要写书评

暂无评论

RankDNN: Learning to Rank for Few-Shot Learning 37

RankDNN: Learning to Rank for Few-Shot Learning

引用

37th AAAI Conference on Artificial Intelligence, AAAI 2023

作者： Guo, Qianyu Haotong, Gong Wei, Xujun Fu, Yanwei Yu, Yizhou Zhang, Wenqiang Ge, Weifeng Nebula AI Group School of Computer Science Fudan University Shanghai China Shanghai Key Laboratory of Intelligent Information Processing Shanghai China Academy for Engineering & Technology Fudan University Shanghai China Department of Computer Science The University of Hong Kong Hong Kong

ISBN: (纸本)9781577358800

This paper introduces a new few-shot learning pipeline that casts relevance ranking for image retrieval as binary ranking relation classification. In comparison to image classification, ranking relation classification is sample efficient and domain agnostic. Besides, it provides a new perspective on few-shot learning and is complementary to state-of-the-art methods. The core component of our deep neural network is a simple MLP, which takes as input an image triplet encoded as the difference between two vector-Kronecker products, and outputs a binary relevance ranking order. The proposed RankMLP can be built on top of any state-of-the-art feature extractors, and our entire deep neural network is called the ranking deep neural network, or RankDNN. Meanwhile, RankDNN can be flexibly fused with other post-processing methods. During the meta test, RankDNN ranks support images according to their similarity with the query samples, and each query sample is assigned the class label of its nearest neighbor. Experiments demonstrate that RankDNN can effectively improve the performance of its baselines based on a variety of backbones and it outperforms previous state-of-the-art algorithms on multiple few-shot learning benchmarks, including miniImageNet, tieredImageNet, Caltech-UCSD Birds, and CIFAR-FS. Furthermore, experiments on the cross-domain challenge demonstrate the superior transferability of *** code is available at: https://***/guoqianyu-alberta/RankDNN. Copyright © 2023, Association for the Advancement of Artificial Intelligence (***). All rights reserved.

关键词： Deep neural networks

来源：评论

学校读者我要写书评

暂无评论

DI-MVS: Learning Efficient Multi-View Stereo With Depth-Aware Iterations

DI-MVS: Learning Efficient Multi-View Stereo With Depth-Awar...

引用

International Conference on Acoustics, Speech, and Signal processing (ICASSP)

作者： Jianfei Jiang Mingwei Cao Jun Yi Chenglong Li Anhui Provincial Key Laboratory of Multimodal Cognitive Computation Anhui University School of Computer Science and Information Engineering Hefei University of Technology

Learning-based Multi-View Stereo (MVS) methods aim to reconstruct 3D scenes from a set of 2D calibrated images. However, existing learning-based MVS methods often overlook depth maps that include the geometric shapes of the scene when constructing the cost volume. This can result in suboptimal reconstructions, particularly in low-texture or repetitive-texture regions where valuable geometric information is absent. To address this issue, we develop DI-MVS, a coarse-to-fine framework that effectively incorporates context-guided depth geometry into the cost volume using a depth-aware iterator. First, we employ the proposed depth-aware cost completion module to update the cost volume, followed by 2D ConvGRUs to iteratively optimize depth maps efficiently. Second, we propose a hybrid loss strategy that combines two loss functions’ strengths to improve depth estimation’s robustness. Extensive experiments demonstrate that DI-MVS outperforms state-of-the-art methods on the DTU dataset and the Tanks & Temples benchmark. The source code is available at: https://***/JianfeiJ/DI-MVS.

关键词：

来源：评论

学校读者我要写书评

暂无评论

OpenViewer: Openness-Aware Multi-View Learning

arXiv

引用

arXiv 2024年

作者： Du, Shide Fang, Zihan Tan, Yanchao Wang, Changwei Wang, Shiping Guo, Wenzhong College of Computer and Data Science Fuzhou University Fuzhou China Fujian Provincial Key Laboratory of Network Computing and Intelligent Information Processing Fuzhou University Fuzhou China Key Laboratory of Computing Power Network and Information Security Ministry of Education Shandong Computer Science Center Qilu University of Technology Jinan China

Multi-view learning methods leverage multiple data sources to enhance perception by mining correlations across views, typically relying on predefined categories. However, deploying these models in real-world scenarios presents two primary openness challenges. 1) Lack of Interpretability: The integration mechanisms of multi-view data in existing black-box models remain poorly explained;2) Insufficient Generalization: Most models are not adapted to multi-view scenarios involving unknown categories. To address these challenges, we propose OpenViewer, an openness-aware multi-view learning framework with theoretical support. This framework begins with a Pseudo-Unknown Sample Generation Mechanism to efficiently simulate open multi-view environments and previously adapt to potential unknown samples. Subsequently, we introduce an Expression-Enhanced Deep Unfolding Network to intuitively promote interpretability by systematically constructing functional prior-mapping modules and effectively providing a more transparent integration mechanism for multi-view data. Additionally, we establish a Perception-Augmented Open-Set Training Regime to significantly enhance generalization by precisely boosting confidences for known categories and carefully suppressing inappropriate confidences for unknown ones. Experimental results demonstrate that OpenViewer effectively addresses openness challenges while ensuring recognition performance for both known and unknown samples. Copyright © 2024, The Authors. All rights reserved.

关键词： Contrastive Learning

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：