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

DQPS: An intelligent Multi-Hop Computation Offloading Scheme for Workflow Applications in Vehicular Edge computing Networks

引用

IEEE Transactions on Consumer Electronics 2024年

作者： Lin, Bing Chen, Qiaoxin Chen, Xing Jia, Wen-Kang Lu, Yu Xiong, Neal N. Fujian Normal University College of Physics and Energy Fujian Provincial Key Laboratory of Quantum Manipulation and New Energy Materials Fuzhou350117 China Fujian Provincial Collaborative Innovation Center for Advanced High-Field Superconducting Materials and Engineering Fuzhou350117 China Peking University School of Computer Science 100871 China Xiamen University Department of Informatics and Communication Engineering Xiamen361005 China Fuzhou University College of Computer and Data Science Fuzhou350118 China Fujian Provincial Key Laboratory of Network Computing and Intelligent Information Processing Fuzhou350118 China Fujian Normal University College of Photonic and Electronic Engineering Fuzhou350117 China Fujian Normal University Concord University College Fuzhou350117 China Sul Ross State University Department of Computer Mathematical and Physical Sciences AlpineTX79830 United States

Vehicular Edge computing (VEC) is a feasible solution for autonomous driving as it can offload latency-sensitive and computation-intensive tasks from vehicle terminals to roadside units (RSUs) for real-time processing. Due to the high computational resource the workflow applications (i.e., autonomous driving) required, the small vehicle-to-RSUs communication range, and the scarce available resources for each vehicle, it might be difficult to accomplish complex workflow applications through the single-hop offloading paradigm in the Internet of Vehicles (IoV). In this paper, we propose a reinforcement learning (RL) based multi-hop computation offloading scheme for workflow applications to reduce their execution latency in the VEC networks, which considers the data dependency in workflow applications as well as the trust relationship and communication interference among RSUs. Firstly, a preprocessing method is employed to merge the cut-edges in a workflow to reduce the offloading scale of tasks and compress the encoding dimension of offloading solutions. Then, a Deep Q-network algorithm using Phase-optimal State update (DQPS) is proposed to update the offloading policy distribution, in which the deviation of the phase-optimal state from the current state is estimated as the reward of RL to promote the algorithm's convergence to adapt the dynamic VEC networks. Simulation results show that DQPS has the best performance compared to other benchmark schemes. Moreover, the latency of the identical applications can be reduced by 2.5%-25.3% through our offloading scheme with a multi-hop model compared to that with the single-hop paradigm in IoV. © 1975-2011 IEEE.

关键词： Computation offloading

来源：评论

学校读者我要写书评

暂无评论

V3Det Challenge 2024 on Vast Vocabulary and Open Vocabulary Object Detection: Methods and Results

arXiv

引用

arXiv 2024年

作者： Wang, Jiaqi Zang, Yuhang Zhang, Pan Chu, Tao Cao, Yuhang Sun, Zeyi Liu, Ziyu Dong, Xiaoyi Wu, Tong Lin, Dahua Chen, Zeming Wang, Zhi Meng, Lingchen Yao, Wenhao Yang, Jianwei Wu, Sihong Chen, Zhineng Wu, Zuxuan Jiang, Yu-Gang Wu, Peixi Chai, Bosong Nie, Xuan Yan, Longquan Wang, Zeyu Zhou, Qifan Wang, Boning Huang, Jiaqi Xu, Zunnan Li, Xiu Yuan, Kehong Zu, Yanyan Hao, Jiayao Gao, Qiong Jiao, Licheng Shanghai AI Laboratory China Chinese University of Hong Kong Hong Kong Shanghai Jiao Tong University China Wuhan University China Shenzhen International Graduate School Tsinghua University China Shanghai Key Lab of Intell. Info. Processing School of CS Fudan University China Shanghai Collaborative Innovation Center of Intelligent Visual Computing China Microsoft Research Redmond United States University of Science and Technology of China China Zhejiang University China Northwestern Polytechnical University China Northwest University China Tsinghua Shenzhen International Graduate School Tsinghua University China Intelligent Perception and Image Understanding Lab Xidian University China

Detecting objects in real-world scenes is a complex task due to various challenges, including the vast range of object categories, and potential encounters with previously unknown or unseen objects. The challenges necessitate the development of public benchmarks and challenges to advance the field of object detection. Inspired by the success of previous COCO [15] and LVIS [11] Challenges, we organize the V3Det Challenge 2024 in conjunction with the 4th Open World Vision Workshop: Visual Perception via Learning in an Open World (VPLOW) at CVPR 2024, Seattle, US. This challenge aims to push the boundaries of object detection research and encourage innovation in this field. The V3Det Challenge 2024 consists of two tracks: 1) Vast Vocabulary Object Detection: This track focuses on detecting objects from a large set of 13204 categories, testing the detection algorithm's ability to recognize and locate diverse objects. 2) Open Vocabulary Object Detection: This track goes a step further, requiring algorithms to detect objects from an open set of categories, including unknown objects. In the following sections, we will provide a comprehensive summary and analysis of the solutions submitted by participants. By analyzing the methods and solutions presented, we aim to inspire future research directions in vast vocabulary and open-vocabulary object detection, driving progress in this field. Challenge homepage: https://***/challenge. © 2024, CC BY-NC-SA.

关键词： Object detection

来源：评论

学校读者我要写书评

暂无评论

Consensus algorithms for biased labeling in crowdsourcing

引用

Information Sciences 2017年 382-383卷 254-273页

作者： Jing Zhang Victor S. Sheng Qianmu Li Jian Wu Xindong Wu School of Computer Science and Engineering Nanjing University of Science and Technology Nanjing 210094 P. R. China Key Laboratory of Image and Video Understanding for Social Safety Nanjing University of Science and Technology Nanjing 210094 P. R. China Department of Computer Science University of Central Arkansas Conway AR 72035 USA Jiangsu Engineering Center of Network Monitoring Nanjing University of Information Science and Technology Nanjing 210044 P. R. China Institute of Intelligent Information Processing and Application Soochow University Suzhou 215006 P. R. China School of Computing and Informatics University of Louisiana at Lafayette LA 70504 USA

Although it has become an accepted lay view that when labeling objects through crowdsourcing systems, non-expert annotators often exhibit biases, this argument lacks sufficient evidential observation and systematic empirical study. This paper initially analyzes eight real-world datasets from different domains whose class labels were collected from crowdsourcing systems. Our analyses show that biased labeling is a systematic tendency for binary categorization; in other words, for a large number of annotators, their labeling qualities on the negative class (supposed to be the majority) are significantly greater than are those on the positive class (minority). Therefore, the paper empirically studies the performance of four existing EM-based consensus algorithms , DS, GLAD, RY, and ZenCrowd, on these datasets. Our investigation shows that all of these state-of-the-art algorithms ignore the potential bias characteristics of datasets and perform badly although they model the complexity of the systems. To address the issue of handling biased labeling, the paper further proposes a novel consensus algorithm, namely adaptive weighted majority voting (AWMV), based on the statistical difference between the labeling qualities of the two classes. AWMV utilizes the frequency of positive labels in the multiple noisy label set of each example to obtain a bias rate and then assigns weights derived from the bias rate to negative and positive labels. Comparison results among the five consensus algorithms (AWMV and the four existing) show that the proposed AWMV algorithm has the best overall performance. Finally, this paper notes some potential related topics for future study.

关键词：

来源：评论

学校读者我要写书评

暂无评论

Improved Diversity-Promoting Collaborative Metric Learning for Recommendation

arXiv

引用

arXiv 2024年

作者： Bao, Shilong Xu, Qianqian Yang, Zhiyong He, Yuan Cao, Xiaochun Huang, Qingming Institute of Information Engineering Chinese Academy of Sciences Beijing100093 China School of Cyber Security University of Chinese Academy of Sciences Beijing100049 China The Key Laboratory of Intelligent Information Processing Institute of Computing Technology Chinese Academy of Sciences Beijing100190 China The School of Computer Science and Technology University of Chinese Academy of Sciences Beijing101408 China The Security Department of Alibaba Group Hangzhou311121 China School of Cyber Science and Technology Shenzhen Campus of Sun Yat-sen University Shenzhen518107 China University of Chinese Academy of Sciences Beijing101408 China Peng Cheng Laboratory Shenzhen518055 China

Collaborative Metric Learning (CML) has recently emerged as a popular method in recommendation systems (RS), closing the gap between metric learning and collaborative filtering. Following the convention of RS, existing practices exploit unique user representation in their model design. This paper focuses on a challenging scenario where a user has multiple categories of interests. Under this setting, the unique user representation might induce preference bias, especially when the item category distribution is imbalanced. To address this issue, we propose a novel method called Diversity-Promoting Collaborative Metric Learning (DPCML), with the hope of considering the commonly ignored minority interest of the user. The key idea behind DPCML is to introduce a set of multiple representations for each user in the system where users' preference toward an item is aggregated by taking the minimum item-user distance among their embedding set. Specifically, we instantiate two effective assignment strategies to explore a proper quantity of vectors for each user. Meanwhile, a Diversity Control Regularization Scheme (DCRS) is developed to accommodate the multi-vector representation strategy better. Theoretically, we show that DPCML could induce a smaller generalization error than traditional CML. Furthermore, we notice that CML-based approaches usually require negative sampling to reduce the heavy computational burden caused by the pairwise objective therein. In this paper, we reveal the fundamental limitation of the widely adopted hard-aware sampling from the One-Way Partial AUC (OPAUC) perspective and then develop an effective sampling alternative for the CML-based paradigm. Finally, comprehensive experiments over a range of benchmark datasets speak to the efficacy of DPCML. Code are available at https://***/statusrank/LibCML. © 2024, CC BY-NC-SA.

关键词： Adversarial machine learning

来源：评论

学校读者我要写书评

暂无评论

Data-deficiency-tolerated method for viewpoint independent sign language recognition

引用

Jisuanji Xuebao/Chinese Journal of Computers 2009年第5期32卷 953-961页

作者： Wang, Qi Chen, Xi-Lin Wang, Chun-Li Gao, Wen School of Computer Science and Technology Harbin Institute of Technology Harbin 150001 China Key Laboratory of Intelligent Information Processing Institute of Computing Technology Chinese Academy of Sciences Beijing 100190 China School of Information Science and Technology Dalian Maritime University Dalian 116026 China School of Electronics Engineering and Computer Science Peking University Beijing 100871 China

This paper proposes a Sample-Consensus method for viewpoint independent sign language recognition under data deficiency (matched features are possibly deficient with regard to some frame pairs). The proposed method is based on the epipolar geometry and inspired by RANSAC. The basic idea is that all corresponded frames between two sequences of the same sign can be roughly considered as captured synchronously by a virtual stereo vision system and thus they will satisfy the same fundamental matrix. In addition, the fundamental matrix can be estimated from point correspondences contained by some part of corresponding frames. Experimental results demonstrate the efficiency of the proposed method. Moreover, this Sample-Consensus method can be easily extended to some similar problems, such as viewpoint independent activity analysis and rigid-motion analysis.

关键词： Stereo image processing

来源：评论

学校读者我要写书评

暂无评论

Robust appearance-based method for head pose estimation

引用

Ruan Jian Xue Bao/Journal of Software 2009年第6期20卷 1651-1663页

作者： Ma, Bing-Peng Shan, Shi-Guang Chen, Xi-Lin Gao, Wen Key Laboratory of Intelligent Information Processing Chinese Acad. of Sci. Beijing 100190 China Institute of Computing Technology Chinese Acad. of Sci. Beijing 100190 China Graduate University Chinese Acad. of Sci. Beijing 100049 China School of Electronic Engineering and Computer Science Peking University Beijing 100871 China

This paper proposes a new pose estimation method based on the appearance of 2D head image. First, the 1D Gabor filters are used to extract the features on the raw images. Compared with the traditional 2D Gabor represents, the 1D Gabor represents are more closely related to the head pose, while the advantages of computation and storage are obvious. Second, for the extracted features, a new method, named kernel local fisher discriminant analysis, is applied to eliminate the multimodal problem, while at the same time enhance the discrimination ability. Experimental results show that the proposed method is effective for pose estimation. It must be pointed out that the generalizability of the proposed method is illustrated by the impressive performance when the training dataset and the testing dataset are heterogeneous. © by Institute of Software, the Chinese Academy of Sciences. All rights reserved.

关键词： Gabor filters

来源：评论

学校读者我要写书评

暂无评论

Human-multimodal deep learning collaboration in ‘precise’ diagnosis of lupus erythematosus subtypes and similar skin diseases

引用

Journal of the European Academy of Dermatology and Venereology 2024年第12期38卷 2268-2279页

作者： Li, Qianwen Yang, Zhi Chen, Kaili Zhao, Ming Long, Hai Deng, Yueming Hu, Haoran Jia, Chen Wu, Meiyu Zhao, Zhidan Zhu, Huan Zhou, Suqing Zhao, Mingming Cao, Pengpeng Zhou, Shengnan Song, Yang Tang, Guishao Liu, Juan Jiang, Jiao Liao, Wei Zhou, Wenhui Yang, Bingyi Xiong, Feng Zhang, Suhan Gao, Xiaofei Jiang, Yiqun Zhang, Wei Zhang, Bo He, Yan-ling Ran, Liwei Zhang, Chunlei Wu, Wenting Suolang, Quzong Luo, Hanhuan Kang, Xiaojing Wu, Caoying Jin, Hongzhong Chen, Lei Guo, Qing Gui, Guangji Li, Shanshan Si, Henan Guo, Shuping Liu, Hong-Ye Liu, Xiguang Ma, Guo-Zhang Deng, Danqi Yuan, Limei Lu, Jianyun Zeng, Jinrong Jiang, Xian Lyu, Xiaoyan Chen, Liuqing Hu, Bin Tao, Juan Liu, Yuhao Wang, Gang Zhu, Guannan Yao, Zhirong Xu, Qianyue Yang, Bin Wang, Yu Ding, Yan Yang, Xianxu Kai, Hu Wu, Haijing Lu, Qianjin Department of Dermatology Hunan Key Laboratory of Medical Epigenomics The Second Xiangya Hospital of Central South University Changsha China Key Laboratory of Intelligent Computing and Information Processing of Ministry of Education Xiangtan University Xiangtan China Department of Dermatology Hunan Children's Hospital Changsha China Institute of Dermatology Chinese Academy of Medical Sciences and Peking Union Medical College Nanjing China Department of Dermatology Beijing Chao-Yang Hospital Capital Medical University Beijing China Department of Dermatology Peking University Third Hospital Beijing China Department of Dermatology People's Hospital of Tibet Autonomous Region Lhasa China Department of Dermatology People's Hospital of Xinjiang Uygur Autonomous Region Urumqi China Department of Dermatology State Key Laboratory of Complex Severe and Rare Diseases Peking Union Medical College Hospital Chinese Academy of Medical Science and Peking Union Medical College Beijing China Department of Dermatology Sun Yat-Sen Memorial Hospital Sun Yat-Sen University Guangzhou China Department of Dermatology The First Bethune Hospital of Jilin University Changchun China Department of Dermatology The First Hospital of Shanxi Medical University Taiyuan China Department of Dermatology The Hei Long Jiang Provincial Hospital Harbin China Department of Dermatology The Second Affiliated Hospital of Kunming Medical University Kunming China Department of Dermatology The Third Xiangya Hospital Central South University Changsha China Department of Dermatology West China Hospital Sichuan University Chengdu China Department of Dermatology Wuhan No. 1 Hospital Wuhan China Department of Dermatology Wuhan Union Hospital of China Wuhan China Department of Dermatology Xijing Hospital Xi'an China Department of Dermatology Xinhua Hospital Affiliated to Shanghai Jiao Tong University School of Medicine Shanghai China Dermatology Hospital of Southern Medical University Guangzhou Chin

Background: Lupus erythematosus (LE) is a spectrum of autoimmune diseases. Due to the complexity of cutaneous LE (CLE), clinical skin image-based artificial intelligence is still experiencing difficulties in distinguishing subtypes of LE. Objectives: We aim to develop a multimodal deep learning system (MMDLS) for human-AI collaboration in diagnosis of LE subtypes. Methods: This is a multi-centre study based on 25 institutions across China to assist in diagnosis of LE subtypes, other eight similar skin diseases and healthy subjects. In total, 446 cases with 800 clinical skin images, 3786 multicolor-immunohistochemistry (multi-IHC) images and clinical data were collected, and EfficientNet-B3 and ResNet-18 were utilized in this study. Results: In the multi-classification task, the overall performance of MMDLS on 13 skin conditions is much higher than single or dual modals (Sen = 0.8288, Spe = 0.9852, Pre = 0.8518, AUC = 0.9844). Further, the MMDLS-based diagnostic-support help improves the accuracy of dermatologists from 66.88% ± 6.94% to 81.25% ± 4.23% (p = 0.0004). Conclusions: These results highlight the benefit of human-MMDLS collaborated framework in telemedicine by assisting dermatologists and rheumatologists in the differential diagnosis of LE subtypes and similar skin diseases. © 2024 European Academy of Dermatology and Venereology.

关键词：

来源：评论

学校读者我要写书评

暂无评论

Optimizing Partial Area Under the Top-k Curve: Theory and Practice

arXiv

引用

arXiv 2022年

作者： Wang, Zitai Xu, Qianqian Yang, Zhiyong He, Yuan Cao, Xiaochun Huang, Qingming Institute of Information Engineering Chinese Academy of Sciences Beijing100093 China School of Cyber Security University of Chinese Academy of Sciences Beijing100049 China The Key Laboratory of Intelligent Information Processing Institute of Computing Technology Chinese Academy of Sciences Beijing100190 China School of Computer Science and Technology University of Chinese Academy of Sciences Beijing100049 China The Security Department Alibaba Group Hangzhou311121 China School of Cyber Science and Technology Sun Yat-Sen University Shenzhen Campus Shenzhen518107 China University of Chinese Academy of Sciences Beijing101408 China Peng Cheng Laboratory Shenzhen518055 China

Top-k error has become a popular metric for large-scale classification benchmarks due to the inevitable semantic ambiguity among classes. Existing literature on top-k optimization generally focuses on the optimization method of the top-k objective, while ignoring the limitations of the metric itself. In this paper, we point out that the top-k objective lacks enough discrimination such that the induced predictions may give a totally irrelevant label a top rank. To fix this issue, we develop a novel metric named partial Area Under the top-k Curve (AUTKC). Theoretical analysis shows that AUTKC has a better discrimination ability, and its Bayes optimal score function could give a correct top-K ranking with respect to the conditional probability. This shows that AUTKC does not allow irrelevant labels to appear in the top list. Furthermore, we present an empirical surrogate risk minimization framework to optimize the proposed metric. Theoretically, we present (1) a sufficient condition for Fisher consistency of the Bayes optimal score function;(2) a generalization upper bound which is insensitive to the number of classes under a simple hyperparameter setting. Finally, the experimental results on four benchmark datasets validate the effectiveness of our proposed framework. © 2022, CC BY.

关键词： Machine learning

来源：评论

学校读者我要写书评

暂无评论

Pattern Synthesis of MIMO Radar Based on Immune Differential Evolution Algorithm

引用

Journal of Physics: Conference Series 2021年第1期1813卷

作者： Ling Jiang Yi Jiang Guangfu Chen Guimin Shi Qi Cheng School of Mathematics and Computer Wuyi University Wuyishan 354300 China The Key Laboratory of Cognitive Computing and Intelligent Information Processing of Fujian Education Institutions Wuyishan 354300 China Big Data Development Administration of Anji County Huzhou 313000 China

In order to optimize the pattern synthesis of multiple input and multiple output (MIMO) radar, immune mechanism is adopted to overcome the premature risk of differential evolution (DE) algorithm, namely immune differential evolution (IDE). Firstly, the modeling of MIMO radar is introduced by encoding the position of array in the binary. Secondly, the immune mechanism is employed to improve the DE. In IDE, two parameters are self-adapted for the mutation operator by immune mechanism to enhance the convergence ability of DE, including scaling factor and crossover rate. Several experiments are conducted to analysis the performance of IDE. The simulation results show that the IDE with variable parameters can get optimal results in MIMO radar with lower the peak side-lobe level (PSLL) and maintain the diversity with stronger convergence ability and shorter calculation speed.

关键词：

来源：评论

学校读者我要写书评

暂无评论

A new logistic map based chaotic biogeography-based optimization approach for cluster analysis

A new logistic map based chaotic biogeography-based optimiza...

引用

IEEE International Conference on Progress in Informatics and computing (PIC)

作者： Shui-Hua Wang Hui-Min Lu Yu-Jie Li Yang Wang Zhi-Min Chen Yu-Min Wei Wen-Juan Jia Fang-Yuan Liu Yu-Dong Zhang Hunan Provincial Key Laboratory of Network Investigational Technology Hunan Policy Academy Changsha Hunan China School of Computer Science and Technology Nanjing Normal University Nanjing Jiangsu China Department of Electrical Engineering CUNY New York NY USA Department of Mechanical and Control Engineering Kyushu Institute of Technology Fukuoka Prefecture Japan School of Information Engineering Yangzhou University Yangzhou Jiangsu China School of Physics and Electronic Engineering Taizhou University Taizhou Zhejiang China School of Electronic Information Shanghai Dianji University Shanghai China School of Energy and Mechanical Engineering Nanjing Normal University Nanjing Jiangsu China Key Laboratory of Intelligent Computing and Information Processing in Fujian Provincial University Quanzhou Normal University Quanzhou Fujian China

ISBN: (纸本)9781509034857

Cluster analysis is important in scientific and industrial fields. In this study, we proposed a novel chaotic biogeography-based optimization (CBBO) method, and applied it in centroid-based clustering methods. The results over three types of simulation data showed that this proposed CBBO method gave better performance than chaotic particle swarm optimization, genetic algorithm, firefly algorithm, and quantum-behaved particle swarm optimization. In all, our CBBO method is effective in centroid-based clustering.

关键词： Genetic algorithms Optimization Clustering algorithms Particle swarm optimization Algorithm design and analysis Logistics Mathematical model

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：