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

arXiv 2023年

作者： Zhao, Kun Yang, Bohao Lin, Chenghua Rong, Wenge Villavicencio, Aline Cui, Xiaohui Key Laboratory of Aerospace Information Security and Trusted Computing Ministry of Education School of Cyber Science and Engineering Wuhan University China Department of Computer Science The University of Sheffield United Kingdom State Key Laboratory of Software Development Environment Beihang University China School of Computer Science and Engineering Beihang University China

The long-standing one-to-many issue of the open-domain dialogues poses significant challenges for automatic evaluation methods, i.e., there may be multiple suitable responses which differ in semantics for a given conversational context. To tackle this challenge, we propose a novel learning-based automatic evaluation metric (CMN), which can robustly evaluate open-domain dialogues by augmenting Conditional Variational Autoencoders (CVAEs) with a Next Sentence Prediction (NSP) objective and employing Mutual information (MI) to model the semantic similarity of text in the latent space. Experimental results on two open-domain dialogue datasets demonstrate the superiority of our method compared with a wide range of baselines, especially in handling responses which are distant to the golden reference responses in semantics. Copyright © 2023, The Authors. All rights reserved.

关键词： Semantics

来源：评论

学校读者我要写书评

暂无评论

PACE: Reputation-Driven Hierarchical Incentive Mechanism for Trusted Healthcare Transactions in Model Marketplace

引用

IEEE Transactions on Consumer Electronics 2024年

作者： Lu, Jianfeng Dou, Xiaochi Rathore, Bharati Jhaveri, Rutvij H. Seid, Abegaz Mohammed Erbad, Aiman Wuhan University of Science and Technology School of Computer Science and Technology Wuhan430065 China Wuhan University of Science and Technology Hubei Province Key Laboratory of Intelligent Information Processing and Real-time Industrial System China Ministry of Education Key Laboratory of Social Computing and Cognitive Intelligence Dalian University of Technology China United Kingdom Pandit Deendayal Energy University Department of Computer Science and Engineering School of Technology India Hamad Bin Khalifa University College of Science and Engineering Doha Qatar Qatar University College of Engineering Doha Qatar

Federated learning-based model marketplaces have the potential to securely leverage healthcare data for efficient healthcare transactions. However, the willingness to participate in this marketplace is severely hindered by self-interested model sellers, who maximize their personal gains via distorting the quality of their models. To this end, we propose a rePutation-driven hierArchical inCentive mEchanism, called PACE, which combines contract cooperation and game pricing to motivate model sellers to be honest, thereby improving the sustainability of the model marketplace via two-layer cooperation. Specifically, at the training layer, we design a reward payment rule based on multidimensional contracts, while at the trading layer, we use a competitive market pricing game to develop the accuracy pricing rule. In particular, the above rules cleverly combine the fine-grained model sellers' reputations with the willingness of healthcare devices to indirectly affect the model sellers' utilities. Theoretically, we prove that PACE can effectively incentivize model sellers to truthfully report model quality while satisfying both individual rationality and incentive compatibility with a fairness guarantee. Experimental results conducted on four real-world datasets show that our PACE improves the global performance by up to 12.85% and reduces the global loss by at least 19.23% compared with the state-of-the-art baselines. © 1975-2011 IEEE.

关键词： Marketplaces

来源：评论

学校读者我要写书评

暂无评论

MR2CPPIS: Accurate prediction of protein–protein interaction sites based on multi-scale Res2Net with coordinate attention mechanism

引用

computers in Biology and Medicine 2024年 176卷 108543-108543页

作者： Gong, Yinyin Li, Rui Liu, Yan Wang, Jilong Cao, Buwen Fu, Xiangzheng Li, Renfa Chen, Danny Z. College of Computer Science and Electronic Engineering Hunan University Changsha410082 China Hunan Engineering Research Center of Advanced Embedded Computing and Intelligent Medical Systems Hunan University Changsha410082 China Peng Cheng Laboratory Shenzhen518066 China College of Information and Electronic Engineering Hunan City University Yiyang413002 China Department of Computer Science and Engineering University of Notre Dame Notre DameIN46556 United States

Proteins play a vital role in various biological processes and achieve their functions through protein–protein interactions (PPIs). Thus, accurate identification of PPI sites is essential. Traditional biological methods for identifying PPIs are costly, labor-intensive, and time-consuming. The development of computational prediction methods for PPI sites offers promising alternatives. Most known deep learning (DL) methods employ layer-wise multi-scale CNNs to extract features from protein sequences. But, these methods usually neglect the spatial positions and hierarchical information embedded within protein sequences, which are actually crucial for PPI site prediction. In this paper, we propose MR2CPPIS, a novel sequence-based DL model that utilizes the multi-scale Res2Net with coordinate attention mechanism to exploit multi-scale features and enhance PPI site prediction capability. We leverage the multi-scale Res2Net to expand the receptive field for each network layer, thus capturing multi-scale information of protein sequences at a granular level. To further explore the local contextual features of each target residue, we employ a coordinate attention block to characterize the precise spatial position information, enabling the network to effectively extract long-range dependencies. We evaluate our MR2CPPIS on three public benchmark datasets (Dset 72, Dset 186, and PDBset 164), achieving state-of-the-art performance. The source codes are available at https://***/YyinGong/MR2CPPIS. © 2024 Elsevier Ltd

关键词： Forecasting

来源：评论

学校读者我要写书评

暂无评论

A Novel Dual-Stage Algorithm for Capacitated Arc Routing Problems with Time-Dependent Service Costs

SSRN

引用

SSRN 2024年

作者： Li, Qingya Liu, Shengcai Zou, Juan Tang, Ke Guangdong Key Laboratory of Brain-Inspired Intelligent Computation Department of Computer Science and Engineering Southern University of Science and Technology Shenzhen518055 China The Key Laboratory of Hunan Province for Internet of Things and Information Security Xiangtan University Xiangtan411105 China The Key Laboratory of Intelligent Computing and Information Processing Ministry of Education Xiangtan University Xiangtan411105 China

This paper focuses on solving the capacitated arc routing problem with time-dependent service costs (CARPTDSC), which is motivated by winter gritting applications. In the current literature, exact algorithms designed for CARPTDSC can only handle small-scale instances, while heuristic algorithms fail to obtain high-quality solutions. To overcome these limitations, we propose a novel dual-stage algorithm, called MAENS-GN, that consists of a routing stage and a vehicle departure time optimization stage. The former obtains the routing plan, while the the latter determines the vehicle departure time. Importantly, existing literature often ignores the characteristic information contained in the relationship between the route cost and the vehicle departure time. The most signiﬁcant innovation in this paper lies in the exploitation of this characteristic information during the vehicle departure time optimization stage. Speciﬁcally, we conduct a detailed analysis of this relationship under various scenarios and employ tailored methods to obtain the (approximately) optimal vehicle departure time. Furthermore, we propose an improved initialization strategy that considers time-dependent characteristics to achieve better solution quality. In addition to the modiﬁed benchmark test sets, we also experiment on a real-world test set. Experimental results demonstrate that MAENS-GN can obtain high-quality solutions on both small-scale and larger-scale instances of CARPTDSC. © 2024, The Authors. All rights reserved.

关键词： Combinatorial optimization

来源：评论

学校读者我要写书评

暂无评论

Clustering Interval and Triangular Granular Data: Modeling, Execution, and Assessment

引用

IEEE Transactions on Neural Networks and Learning Systems 2024年第6期36卷 10000-10014页

作者： Yiming Tang Wenbin Wu Witold Pedrycz Jianwei Gao Xianghui Hu Zhaohong Deng Rui Chen Anhui Province Key Laboratory of Affective Computing and Advanced Intelligent Machine School of Computer and Information Hefei University of Technology Hefei China Department of Electrical and Computer Engineering University of Alberta Edmonton AB Canada School of Computer and Information Hefei University of Technology Hefei China Faculty of Automatic Control Electronics and Computer Science Silesian University of Tecghnology Gliwice Poland Research Center of Performance and Productivity Analysis Istinye University Istanbul TÃrkiye School of Computer Science and Engineering Southeast University Nanjing China School of Artificial Intelligence and Computer Jiangnan University Wuxi Jiangsu China

In current granular clustering algorithms, numeric representatives were selected by users or an ordinary strategy, which seemed simple; meanwhile, weight settings for granular data could not adequately express their structural characteristics. Aiming at these problems, in this study, a new scheme called a granular weighted kernel fuzzy clustering (GWKFC) algorithm is put forward. We propose the representative selection and granularity generation (RSGG) algorithm enlightened by the density peak clustering (DPC) algorithm. We build interval and triangular granular data on the strength of numeric representatives obtained by RSGG under the principle of justifiable granularity (PJG), in which we establish some combinations of functions and boundary constraints and prove their properties. Furthermore, we present a novel distance formula via the kernel function for granular data and design new weights to affect the coverage and specificity of granular data. In addition, based upon these factors, we come up with the GWKFC algorithm of granular clustering, and its performance with different granularity is assessed. To sum up, a macro framework involving granular modeling, granular clustering, and assessment has been set up. Lastly, the GWKFC algorithm and ten other granular clustering algorithms are compared by experiments on some artificial and UCI datasets together with datasets with large data or those of high dimensionality. It is found that the GWKFC algorithm can provide better granular clustering results by contrast with other algorithms. The originality is embodied as follows. First, we improve the previous density radius and present the RSGG algorithm to acquire numeric representatives. Second, we propose a new strategy to determine granular data boundaries and further obtain novel weights enlightened by the idea of volume. Lastly, we employ the kernel function to calculate the distance between granular data, which has a stronger spatial division ability than the pr

关键词： Clustering algorithms Data models Computational modeling Numerical models Kernel Phase change materials Granular computing Uncertainty Fuzzy sets Noise

来源：评论

学校读者我要写书评

暂无评论

A novel dual-stage algorithm for capacitated arc routing problems with time-dependent service costs

arXiv

引用

arXiv 2024年

This paper focuses on solving the capacitated arc routing problem with time-dependent service costs (CARPTDSC), which is motivated by winter gritting applications. In the current literature, exact algorithms designed for CARPTDSC can only handle small-scale instances, while heuristic algorithms fail to obtain high-quality solutions. To overcome these limitations, we propose a novel dual-stage algorithm, called MAENS-GN, that consists of a routing stage and a vehicle departure time optimization stage. The former obtains the routing plan, while the the latter determines the vehicle departure time. Importantly, existing literature often ignores the characteristic information contained in the relationship between the route cost and the vehicle departure time. The most significant innovation in this paper lies in the exploitation of this characteristic information during the vehicle departure time optimization stage. Specifically, we conduct a detailed analysis of this relationship under various scenarios and employ tailored methods to obtain the (approximately) optimal vehicle departure time. Furthermore, we propose an improved initialization strategy that considers time-dependent characteristics to achieve better solution quality. In addition to the modified benchmark test sets, we also experiment on a real-world test set. Experimental results demonstrate that MAENS-GN can obtain high-quality solutions on both small-scale and larger-scale instances of CARPTDSC. Copyright © 2024, The Authors. All rights reserved.

关键词： Combinatorial optimization

来源：评论

学校读者我要写书评

暂无评论

Intracardiac Electrogram Signals Key Feature Points Recognition Using Dense Convolutional Network

Intracardiac Electrogram Signals Key Feature Points Recognit...

引用

Pattern Recognition and Machine Learning (PRML), IEEE International Conference on

作者： Jiang Yihang Gu Kaihao Wu Xiaomei Department of Biomedical Engineering School of information Science and Technology Fudan University Shanghai China Department of Biomedical Engineering Key Laboratory of Medical Imaging Computing and Computer Assisted Intervention (MICCAI) of Shanghai School of information Science and Technology Fudan University Academy for Engineering and Technology Shanghai Engineering Research Center of Assistive Devices Shanghai China Yiwu Research Institute of Fudan University Zhejiang China

ISBN: (数字)9798350355925

ISBN: (纸本)9798350355932

During radiofrequency ablation procedures for atrial fibrillation patients, physicians can assist in locating ablation targets by analyzing the conduction pathways and low-voltage areas of the intracardiac electrogram signals. The feature points of intracardiac electrogram signals serve as criteria for assessing excitation patterns and low-voltage areas. Therefore, extracting feature points from intracardiac signals is of significant value. To identify key points in intracardiac electrogram signals through deep learning, this experiment collected intracardiac electrogram signals from 21 clinical patients, which were then filtered using wavelet transformation. Subsequently, each excitation was treated as a signal group, indicating the key feature points within. Finally, a total of 36,183 groups of intracardiac electrogram signals annotated with key points were obtained. The dataset consisted of data from 17 patients allocated for training, data from 2 patients reserved for testing, and data from the remaining 2 patients designated for validation purposes. Training was conducted using a DenseNet network incorporating both convolutional attention and feature pyramid modules. The final network successfully identifies the feature points of intracardiac electrogram signals. It outputs six feature points, including the starting point, first rising point, first falling point, peak point, valley point, and termination point, with average absolute errors of only 0.34, 0.27, 0.31, 0.01, 0.27, and 0.42 ms, respectively. The final detection results are highly satisfactory, indicating the potential utility of the findings in assisting the analysis of intracardiac electrogram signals. The research outcomes presented in this paper lay a foundation for the analysis of intracardiac electrogram signals.

关键词： Training Wavelet transforms Radio frequency Low voltage Training data Medical services Myocardium Feature extraction Pattern recognition Testing

来源：评论

学校读者我要写书评

暂无评论

Mobility-aware Seamless Service Migration and Resource Allocation in Multi-edge IoV Systems

引用

IEEE Transactions on Mobile computing 2025年第7期24卷 6315-6332页

作者： Chen, Zheyi Huang, Sijin Min, Geyong Ning, Zhaolong Li, Jie Zhang, Yan Fuzhou University College of Computer and Data Science Fuzhou350116 China Ministry of Education Engineering Research Center of Big Data Intelligence Fuzhou350002 China Fuzhou University Fujian Key Laboratory of Network Computing and Intelligent Information Processing Fuzhou350116 China University of Exeter Department of Computer Science Faculty of Environment Science and Economy ExeterEX4 4QF United Kingdom Chongqing University of Posts and Telecommunications School of Communications and Information Engineering Chongqing400065 China Shanghai Jiao Tong University Department of Computer Science and Engineering Shanghai200240 China University of Oslo Department of Informatics Oslo0316 Norway

Mobile Edge computing (MEC) offers low-latency and high-bandwidth support for Internet-of-Vehicles (IoV) applications. However, due to high vehicle mobility and finite communication coverage of base stations, it is hard to maintain uninterrupted and high-quality services without proper service migration among MEC servers. Existing solutions commonly rely on prior knowledge and rarely consider efficient resource allocation during the service migration process, making it hard to reach optimal performance in dynamic IoV environments. To address these important challenges, we propose SR-CL, a novel mobility-aware seamless Service migration and Resource allocation framework via Convex-optimization-enabled deep reinforcement Learning in multi-edge IoV systems. First, we decouple the Mixed Integer Nonlinear Programming (MINLP) problem of service migration and resource allocation into two sub-problems. Next, we design a new actor-critic-based asynchronous-update deep reinforcement learning method to handle service migration, where the delayed-update actor makes migration decisions and the one-step-update critic evaluates the decisions to guide the policy update. Notably, we theoretically derive the optimal resource allocation with convex optimization for each MEC server, thereby further improving system performance. Using the real-world datasets of vehicle trajectories and testbed, extensive experiments are conducted to verify the effectiveness of the proposed SR-CL. Compared to benchmark methods, the SR-CL achieves superior convergence and delay performance under various scenarios. © 2025 IEEE.

关键词： Convex optimization

来源：评论

学校读者我要写书评

暂无评论

DESIGN AND DEVELOPMENT OF MORPHOLOGICAL ANALYZER FOR TIGRIGNA VERBS USING HYBRID APPROACH

Research Square

引用

Research Square 2023年

作者： Gebremeskel, Hagos Gebremedhin Chong, Feng Heyan, Huang Beijing Engineering Research Center of High Volume Language Information Processing Cloud Computing Applications Laboratory School of Computer Science and Technology Beijing Institute of Technology China Department of Computer Science Mekelle University Tigray Mekelle231 Ethiopia

Morphological analyzer is the base for various high-level NLP applications such as information retrieval, spell checking, grammar checking, machine translation, speech recognition, POS tagging and automatic sentence construction. This paper is carefully designed for design and analysis of morphological analyzer Tigrigna verbs using hybrid of memory learning and rules based approaches. The experiment have conducted using Python 3 where TiMBL algorithms IB2 and TRIBL2, and Finite State Transducer rules are used. The performance of the system has been evaluated using 10 fold cross validation technique. Testing was conducted using optimized parameter settings for regular verbs and linguistic rules of the Tigrigna language allomorph and phonology for the irregular verbs. The accuracy of the memory based approach with optimized parameters of TiMBL algorithm IB2 and TRIBL2 was 93.24% and 92.31%, respectively. Finally, the hybrid approach had an actual performance of 95.6% using linguistic rules for handling irregular and copula verbs. © 2023, CC BY.

关键词： Machine learning

来源：评论

学校读者我要写书评

暂无评论

Optimizing resource allocation in flex-grid entanglement distribution networks

Optimizing resource allocation in flex-grid entanglement dis...

引用

2022 IEEE Photonics Conference, IPC 2022

作者： Alnas, Jude Alshowkan, Muneer Nageswara Rao, S.V. Peters, Nicholas A. Lukens, Joseph M. University of Alabama Department of Electrical and Computer Engineering TuscaloosaAL35401 United States Quantum Information Science Section Oak Ridge National Laboratory Oak RidgeTN37831 United States Advanced Computing Methods Section Oak Ridge National Laboratory Oak RidgeTN37831 United States

We introduce a model for the distribution of frequency-polarization hyper-entangled photon pairs in a flexible-grid optical network. In order to optimize entanglement fidelity and entangled bit rate, we apply a geneti... 详细信息

ISBN: (数字)9781665434874

ISBN: (纸本)9781665434874

关键词： Genetic algorithms

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：