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

arXiv 2023年

作者： Fu, Yingkai Li, Meng Liu, Wenxi Wang, Yuanchen Zhang, Jiqing Yin, Baocai Wei, Xiaopeng Yang, Xin The Key Laboratory of Social Computing and Cognitive Intelligence Ministry of Education Dalian University of Technology Dalian116024 China Technologies Company Ltd. Shanghai201799 China The College of Computer and Data Science Fuzhou University Fuzhou350108 China The Faculty of Information Technology Beijing University of Technology Beijing100124 China

Event cameras, or dynamic vision sensors, have recently achieved success from fundamental vision tasks to high-level vision researches. Due to its ability to asynchronously capture light intensity changes, event camera has an inherent advantage to capture moving objects in challenging scenarios including objects under low light, high dynamic range, or fast moving objects. Thus event camera are natural for visual object tracking. However, the current event-based trackers derived from RGB trackers simply modify the input images to event frames and still follow conventional tracking pipeline that mainly focus on object texture for target distinction. As a result, the trackers may not be robust dealing with challenging scenarios such as moving cameras and cluttered foreground. In this paper, we propose a distractor-aware event-based tracker that introduces transformer modules into Siamese network architecture (named DANet). Specifically, our model is mainly composed of a motion-aware network and a target-aware network, which simultaneously exploits both motion cues and object contours from event data, so as to discover motion objects and identify the target object by removing dynamic distractors. Our DANet can be trained in an end-to-end manner without any post-processing and can run at over 80 FPS on a single V100. We conduct comprehensive experiments on two large event tracking datasets to validate the proposed model. We demonstrate that our tracker has superior performance against the state-of-the-art trackers in terms of both accuracy and efficiency. Copyright © 2023, The Authors. All rights reserved.

关键词： Cameras

来源：评论

学校读者我要写书评

暂无评论

An On-Call Shift for Anaesthetist Rostering Problem (ARP): A Mathematical Model

An On-Call Shift for Anaesthetist Rostering Problem (ARP): A...

引用

IEEE International Conference on Artificial Intelligence in Engineering and Technology (IICAIET)

作者： Norizal Abdullah Masri Ayob Nasser R. Sabar Meng Chun Lam Liu Chian Yong Data Mining and Optimisation Lab Faculty of Information Science and Technology Center for Artificial Intelligence Technology (CAIT) UKM Bangi Selangor Malaysia Department of Computer Science and Information Technology La Trobe University Melbourne Australia Faculty of Information Science and 43600 Mixed Reality and Pervasive Computing Lab Center for Artificial Intelligence Technology (CAIT) UKM Bangi Selangor Malaysia Department of Anaesthesiology & Intensive Care UKM Medical Centre Jalan Yaacob Latiff Bandar Tun Razak Kuala Lumpur Malaysia

This work dealt with a real-world Anaesthetist Rostering Problem (ARP) for an on-call shift. An on-call shift for an anaesthetist had already been resolved under the physician's rostering problem. However, in their work, each individual can be assigned to only one place throughout the daily on-call shift. In addition, no consecutive days are rostered for the on-call shift, and each level of preference for the on-call shift is excluded from the study. This scenario is irrelevant to the real-world ARP of an on-call shift at Hospital Canselor Tuanku Muhriz (HCTM) in Malaysia, as an anaesthetist is rostered for multiple places of the on-call shifts daily. Also, they can be rostered on consecutive days for on-call shifts, and each anaesthetist will be rostered depending on their preference level for the on-call shift. Therefore, this work proposes a new mathematical formulation with constraints, parameters, and an evaluation function. We utilise Mixed-integer programming to formulate and solve the model with IBM ILOG CPLEX Optimization Studio. The quality of the solution generated by our model is measured using our proposed evaluation function to minimise the violation of constraints. A case study of real-world data from the HCTM was run and tested to validate the model. The result shows that a new model can produce a better optimal solution, whilst the current solution methodology at HCTM is unable to do.

关键词：

来源：评论

学校读者我要写书评

暂无评论

Cross Modal Sentiment Classification of Social Media Based on Meta Heuristic Algorithm

Cross Modal Sentiment Classification of Social Media Based o...

引用

International Conference on Computer Supported Cooperative Work in Design

作者： Wantong Du Wanli Min Yushui Geng Hu Liang Hehu Zhou Ministry of Education Shandong Computer Science Center Key Laboratory of Computing Power Network and Information Security 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 Synthesis Electronic Technology Co. Ltd

ISBN: (数字)9798350349184

ISBN: (纸本)9798350349191

The evolution of online social media has reshaped public behaviors, and social data infused with emotions provides crucial decision support for sentiment analysis tasks. Conventional multimodal approaches, influenced by redundant information in feature extraction during sentiment analysis, often focus solely on modality interactions without considering the unique content of each modality. This paper introduces the HGB-HFN model, addressing feature redundancy by optimizing extracted features using metaheuristic algorithm techniques, achieving a higher accuracy optimal feature dataset at lower computational costs. To counteract the neglect of modal-independent information, a hybrid fusion approach is adopted. It prioritizes visual features to extract precise semantic and emotional information from textual content, training multiple base classifiers to learn independent and diverse discriminative information. Comparative experiments on streaming datasets MOSI and MOSEI demonstrate the computational approach’s superiority in both accuracy and efficiency over existing methods.

关键词： Training Sentiment analysis Visualization Accuracy Social networking (online) Metaheuristics Semantics

来源：评论

学校读者我要写书评

暂无评论

Visible Light Positioning Method for Indoor Line-of-Sight Scene Based on Time Series Coding

Visible Light Positioning Method for Indoor Line-of-Sight Sc...

引用

IEEE International Conference on data science in Cyberspace (DSC)

作者： Yonghao Yu Yongde Guo Dawei Zhao Kexue Fu Yongwei Tang Qinyuan Wang Faculty of Data Science City University of Macau China Key Laboratory of Computing Power Network and Information Security Ministry of Education Shandong Computer Science Center(National Supercomputer Center in Jinan) Qilu University of Technology (Shandong Academy of Sciences) Jinan China Shandong Fundamental Research Center for Computer Science Shandong Provincial Key Laboratory of Computer Networks Jinan China School of Mechanical Engineering Key Laboratory of High Efficiency and Clean Mechanical Manufacture Ministry of Education Shandong University Jinan China

ISBN: (数字)9798350391367

ISBN: (纸本)9798350391374

Existing indoor visible light positioning methods, such as those based on fingerprint database algorithms, are complex to construct and consume significant resources. In response to this issue, the text proposes an end-to-end indoor visible light positioning method that samples continuous signals at a small number of random coordinate positions in indoor environments. Through a deep learning method based on attention mechanism, a nonlinear mapping between the received signal and spatial position coordinates is constructed, and the time series properties in the received signal are encoded as a feature in the data. The method is further improved by combining residual networks to improve accuracy. Through simulation experiments, it has been verified that the deep learning based localization method described in this article can achieve sub meter level accuracy on small sample datasets, and it has been proven that time series features have a significant impact on localization accuracy in indoor visible light positioning algorithms based on deep learning.

关键词： Location awareness Deep learning Meters Training Accuracy Attention mechanisms Time series analysis Training data Encoding data models

来源：评论

学校读者我要写书评

暂无评论

FOUNDATIONAL MODELS IN MEDICAL IMAGING: A COMPREHENSIVE SURVEY AND FUTURE VISION

arXiv

引用

arXiv 2023年

作者： Azad, Bobby Azad, Reza Eskandari, Sania Bozorgpour, Afshin Kazerouni, Amirhossein Rekik, Islem Merhof, Dorit Electrical Engineering and Computer Science Department South Dakota State University Brookings United States Faculty of Electrical Engineering and Information Technology RWTH Aachen University Aachen Germany Department of Electrical Engineering University of Kentucky Lexington United States Faculty of Informatics and Data Science University of Regensburg Regensburg Germany BASIRA Lab Imperial-X and Computing Department Imperial College London London United Kingdom School of Electrical Engineering Iran University of Science and Technology Tehran Iran dorit.merhofur.de

Foundation models, large-scale, pre-trained deep-learning models adapted to a wide range of downstream tasks have gained significant interest lately in various deep-learning problems undergoing a paradigm shift with the rise of these models. Trained on large-scale dataset to bridge the gap between different modalities, foundation models facilitate contextual reasoning, generalization, and prompt capabilities at test time. The predictions of these models can be adjusted for new tasks by augmenting the model input with task-specific hints called prompts without requiring extensive labeled data and retraining. Capitalizing on the advances in computer vision, medical imaging has also marked a growing interest in these models. With the aim of assisting researchers in navigating this direction, this survey intends to provide a comprehensive overview of foundation models in the domain of medical imaging. Specifically, we initiate our exploration by providing an exposition of the fundamental concepts forming the basis of foundation models. Subsequently, we offer a methodical taxonomy of foundation models within the medical domain, proposing a classification system primarily structured around training strategies, while also incorporating additional facets such as application domains, imaging modalities, specific organs of interest, and the algorithms integral to these models. Furthermore, we emphasize the practical use case of some selected approaches and then discuss the opportunities, applications, and future directions of these large-scale pre-trained models, for analyzing medical images. In the same vein, we address the prevailing challenges and research pathways associated with foundational models in medical imaging. These encompass the areas of interpretability, data management, computational requirements, and the nuanced issue of contextual comprehension. Finally, we gather the over-viewed studies with their available open-source implementations at our GitHub. We aim

关键词： Medical applications

来源：评论

学校读者我要写书评

暂无评论

RSMA-assisted SHAPTINs: secrecy performance under imperfect hardware and channel estimation errors

引用

Neural computing and Applications 2024年 1-18页

作者： Feng, Zhou Kefeng, Guo Jian, Cheng Sunder Ali, Khowaja Kapal, Dev Reddy, Gadekallu Thippa Hussam Al, Hamadi School of Information Technology Yancheng Institute of Technology Yancheng224051 China School of Space Information Space Engineering University Beijing101407 China College of Electronic and Information Engineering Nanjing University of Aeronautics and Astronautics Nanjing210016 China Faculty of Computing Digital and Data Technological University Dublin DublinD07EWV4 Ireland ADAPT Centre and Department of Computer Science Munster Technological University Cork BishopstownT12 P928 Ireland Department of institute of intelligent systems University of Johannesburg Auckland Park Johannesburg2006 South Africa Centre for Research Impact & Outcome Chitkara University Institute of Engineering and Technology Chitkara University Punjab Rajpura140401 India Division of Research and Development Lovely Professional University Phagwara144001 India College of Engineering and IT College of Engineering and IT University of Dubai PO Box 14143 Dubai United Arab Emirates

Satellite high aerial platform terrestrial integrated networks have become the hot topic these years, which have been regarded as the major part of the intelligence of things for future networks. During this work, we investigate the secrecy performance for rate-splitting multiple access-assisted satellite high aerial platform terrestrial integrated networks. Besides, imperfect hardware and channel estimation errors are considered in the secrecy networks. Moreover, to enhance the energy utilization efficiency, rate-splitting multiple access scheme is utilized into the considered network, which is prior to that of the non-orthogonal multiple access scheme. What's more, to enhance the satellite transmission, multiple high aerial platforms are used to forward the transmission along with multiple eavesdroppers. In addition, the direct transmission link is not considered in the secrecy networks due to the heavy fading and obstacles. Relied on the former considerations, the exact and asymptotic analysis for the secrecy performance is further obtained to confirm the rightness of the analysis. Finally, some representative Monte Carlo simulations are carried out to validate the obtained results. © The Author(s), under exclusive licence to Springer-Verlag London Ltd., part of Springer Nature 2024.

关键词： Asymptotic analysis

来源：评论

学校读者我要写书评

暂无评论

引用

Proceedings of the Fortieth Conference on Uncertainty in Artificial Intelligence

作者： Zhiqiang Zhang Yongqiang Jiang Qian Gao Zhipeng Wang Key Laboratory of Computing Power Network and information Security Ministry of Eaucation Shandong Computer Science Center Qilu University of Technology (Shandong Academy of Sciences) Jinan China and 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 and Shandong Provincial Key Laboratory of Computer Networks Shandong Fundamental Research Center for Computer Science Jinan China China Telecom Digital Intelligence Techonology Co Jinan China

Existing multimodal recommendation research still faces some challenges, such as not being able to fully mine the implicit relevance information of neighbor nodes, and the unreasonable weight allocation to imbalanced nodes. To address the aforementioned challenges, this paper introduces a new multimodal recommendation model called NS-MAR+. Specifically, the model firstly constructs a neighbor similarity graph convolutional network to capture the implicit relevance information and reasonably assigns the attention weights through the graph attention mechanism. Secondly, the model introduces a modal alignment and fusion mechanism by using a multilayer perceptron (MLP) to map image and text features into a shared space for comparison and fusion. In addition, the model constructs a user co-interaction graph and an item semantic graph based on the original information and performs graph convolution operations to enhance the preference information of users and items, and to better capture the interactions and internal features between users and items. Finally, MLP is employed to aggregate user and item representations and predict personalized recommendation rankings. To validate the experiment's efficacy, this paper compares with several leading multimodal recommendation models on public datasets with a performance improvement of 1% to 3%. The experimental outcomes indicate that the model in this paper has good superiority and accuracy in multimodal recommendation tasks.

关键词：

来源：评论

学校读者我要写书评

暂无评论

Federated Learning for 6G Communications:Challenges,Methods,and Future Directions

引用

China Communications 2020年第9期17卷 105-118页

作者： Yi Liu Xingliang Yuan Zehui Xiong Jiawen Kang Xiaofei Wang Dusit Niyato School of Data Science of Technology Heilongjiang UniversityHarbinChina Faculty of Information Technology Monash UniversityAustralia Alibaba-NTU Joint Research Institute and also School of Computer Science and Engineering NTUSingapore Energy Research Institute Nanyang Technological UniversitySingapore College of Intelligence and Computing Tianjin UniversityTianjinChina School of Computer Science and Engineering NTUSingapore

As the 5G communication networks are being widely deployed worldwide,both industry and academia have started to move beyond 5G and explore 6G *** is generally believed that 6G will be established on ubiquitous Artificial Intelligence(AI)to achieve data-driven Machine Learning(ML)solutions in heterogeneous and massive-scale ***,traditional ML techniques require centralized data collection and processing by a central server,which is becoming a bottleneck of large-scale implementation in daily life due to significantly increasing privacy *** learning,as an emerging distributed AI approach with privacy preservation nature,is particularly attractive for various wireless applications,especially being treated as one of the vital solutions to achieve ubiquitous AI in *** this article,we first introduce the integration of 6G and federated learning and provide potential federated learning applications for *** then describe key technical challenges,the corresponding federated learning methods,and open problems for future research on federated learning in the context of 6G communications.

关键词： 6G communication federated learning security and privacy protection

来源：评论

学校读者我要写书评

暂无评论

Solving Multitrip Pickup and Delivery Problem With Time Windows and Manpower Planning Using Multiobjective Algorithms

引用

IEEE/CAA Journal of Automatica Sinica 2020年第4期7卷 1134-1153页

作者： Jiahai Wang Yuyan Sun Zizhen Zhang Shangce Gao the Department of Computer Science and also with the Key Laboratory of Machine Intelligence and Advanced ComputingMinistry of Educationand also with the Guangdong Key Laboratory of Big Data Analysis and ProcessingSun Yat-sen UniversityGuangzhou 510275China the Department of Computer Science Sun Yat-sen UniversityGuangzhou 510275China the Faculty of Engineering University of ToyamaToyama-shi 930-8555Japan

The multitrip pickup and delivery problem with time windows and manpower planning(MTPDPTW-MP)determines a set of ambulance routes and finds staff assignment for a hospital. It involves different stakeholders with diverse interests and objectives. This study firstly introduces a multiobjective MTPDPTW-MP(MO-MTPDPTWMP) with three objectives to better describe the real-world scenario. A multiobjective iterated local search algorithm with adaptive neighborhood selection(MOILS-ANS) is proposed to solve the problem. MOILS-ANS can generate a diverse set of alternative solutions for decision makers to meet their requirements. To better explore the search space, problem-specific neighborhood structures and an adaptive neighborhood selection strategy are carefully designed in MOILS-ANS. Experimental results show that the proposed MOILS-ANS significantly outperforms the other two multiobjective algorithms. Besides, the nature of objective functions and the properties of the problem are analyzed. Finally, the proposed MOILS-ANS is compared with the previous single-objective algorithm and the benefits of multiobjective optimization are discussed.

关键词： Adaptive neighborhood selection manpower planning multiobjective optimization multitrip pickup and delivery problem with time windows

来源：评论

学校读者我要写书评

暂无评论

Hierarchical Reverse Games for the Resource Ecosystem in Cloud-Edge computing

引用

IEEE Transactions on Consumer Electronics 2024年

作者： Pei, Manlin Wang, Chenyu Wang, Xia Zheng, Zhigao Huang, Jianhui Wang, Shengling Guo, Yufei School of Computer and Information Technology Beijing Jiaotong University Beijing China Department of Computer Science Georgia State University United States Beijing University of Technology School of Statistics and Data Science Faculty of Science Beijing China Institute of Artificial Intelligence School of Computer Science National Engineering Research Center for Multimedia Software Hubei Key Laboratory of Multimedia and Network Communication Engineering Hubei Luojia Laboratory Wuhan University Wuhan China Chinese Academy of Sciences Institute of Computing Technology Beijing China Beijing Normal University School of Artificial Intelligence Beijing China George Washington University Department of Statistics United States

Edge computing has emerged as a killer technology for a hyper-connected world due to its distributed architecture and customer-proximity property. Combined edge nodes with the cloud data center, a cloud-edge computing paradigm is formed, whose resource ecosystem calls for competitive pricing and optimal resource allocation. However, it is not feasible to realize global information-based optimization since some information is kept private to their owners. To solve this challenge, this paper develops the user-independent hierarchical reverse game and the user-assisted hierarchical reverse game to depict the relationship among the resource provider, the resource tenant, and the resource user. The aim is to seek the optimal strategies for players without revealing any private information. The common trait of both games is to force the players to report the optimal strategies based on their actual private information. This salient trait can produce privacy-preservation optimization since there is no requirement for the players to release their individual information directly, and the optimal strategies of other players can be deduced naturally. The difference between the user-independent hierarchical reverse game and the user-assisted one is that the game rules are stipulated entirely by the provider and the tenants (edge nodes) in the former, while some game rules can be customized according to the advice of users in the latter. This leads the user-independent hierarchical reverse game is more concise and easy to guarantee the incentive compatibility constraint, while the user-assisted hierarchical reverse game can attract more users since the game rules can adapt to their economic status, requirements, and preferences. © 1975-2011 IEEE.

关键词： Cloud platforms

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：