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

作者： Chen, Jingqiang Zhuge, Hai School of Computer Science Nanjing University of Posts and Telecommunications Nanjing China School of Computer Science and Network Engineering Guangzhou University Guangzhou China Department of Computer Science School of Engineering and Applied Science Aston University Birmingham United Kingdom Key Laboratory of Intelligent Information Processing Institute of Computing Technology University of Chinese Academy of Sciences Chinese Academy of Sciences Beijing China

News image captioning aims to generate captions or descriptions for news images automatically, serving as draft captions for creating news image captions manually. News image captions are different from generic captions as news image captions contain more detailed information such as entity names and events. Therefore, both images on news and the accompanying text are the source of generating caption of news image. Pointer-generator network is a neural method defined for text summarization. This article proposes the Multimodal pointer-generation network by incorporating visual information into the original network for news image captioning. The multimodal attention mechanism is proposed by splitting attention into visual attention paid to the image and textual attention paid to the text. The multimodal pointer mechanism is proposed by using both textual attention and visual attention to compute pointer distributions, where visual attention is first transformed into textual attention via the word-image relationships. The multimodal coverage mechanism is defined to reduce repetitions of attentions or repetitions of pointer distributions. Experiments on the DailyMail test dataset and the out-of-domain BBC test dataset show that the proposed model outperforms the original pointer-generator network, the generic image captioning method, the extractive news image captioning method, and the LDA-based method according BLEU, METEOR, and ROUGL-L evaluations. Experiments also show that the proposed multimodal coverage mechanisms can improve the model, and that transforming visual attention to pointer distributions can improve the model. © 2020 John Wiley & Sons, Ltd.

关键词： Statistical tests

来源：评论

学校读者我要写书评

暂无评论

A new ultra-wideband MIMO antenna based on metamaterials for 5G

A new ultra-wideband MIMO antenna based on metamaterials for...

引用

International Conference on Numerical Electromagnetic Modeling and Optimization for RF, Microwave, and Terahertz Applications (NEMO)

作者： Yaqin Li Shijie Huang Liang Zhang Xianliang Wu Key Laboratory of Intelligent Computing & Signal Processing Anhui University Hefei China AnHui Province Key Laboratory of simulation and design for Electronic informationKey Laboratory of Intelligent Computing & Signal Processing Hefei Normal university Hefei China

ISBN: (数字)9781728169668

ISBN: (纸本)9781728169675

An improved ultra-wideband low-coupling MIMO antenna based on a metamaterial periodic structure frequency-selective surface wide slot antenna is derived from the basic -shaped resonant ring. The antenna can be implemented without loading any parasitic branches low coupling and high gain, the relative bandwidth exceeds the international standard of ultra-wideband (20%), and at the same time uses metamaterials whose electromagnetic characteristics can be artificially changed as a medium, the element antennas are arranged in a 9 × 9 array and processed at 90° In order to achieve the goal of miniaturization, the structure is more compact. The 37 GHz MIMO antenna with a structure size of 108 mm × 104 mm × 1 mm working in the 5G millimeter wave band is simulated. The results show that the peak gain of the unit antenna bandwidth is 10 dB, the impedance bandwidth is 21%, and the isolation is less than 20 dB. It meets the expected performance requirements of ultra-wideband, low coupling, miniaturization and other performances, and will have important applications in the area of 5G mobile communications.

关键词： Slot antennas Bandwidth Ultra wideband antennas Metamaterials Loaded antennas Antenna arrays Periodic structures

来源：评论

学校读者我要写书评

暂无评论

Partial Relaxed Optimal Transport for Denoised Recommendation

Partial Relaxed Optimal Transport for Denoised Recommendatio...

引用

2022 Workshop on Deep Learning for Search and Recommendation, DL4SR 2022

作者： Tan, Yanchao Yang, Carl Wei, Xiangyu Wu, Ziyue Liu, Weiming Zheng, Xiaolin The College of Computer and Data Science Fuzhou University Fuzhou350116 China Fujian Key Laboratory of Network Computing and Intelligent Information Processing Fuzhou University Fuzhou350116 China The Department of Computer Science Emory University Atlanta30322 United States The College of Computer Science Zhejiang University Hangzhou310027 China The School of Management Zhejiang University Hangzhou310058 China

The interaction data used by recommender systems (RSs) inevitably include noises resulting from mistaken or exploratory clicks, especially under implicit feedbacks. Without proper denoising, RS models cannot effectively capture users’ intrinsic preferences and the true interactions between users and items. To address such noises, existing methods mostly rely on auxiliary data which are not always available. In this work, we ground on Optimal Transport (OT) to globally match a user embedding space and an item embedding space, allowing both non-deep and deep RS models to discriminate intrinsic and noisy interactions without supervision. Specifically, we firstly leverage the OT framework via Sinkhorn distance to compute the continuous many-to-many user-item matching scores. Then, we relax the regularization in Sinkhorn distance to achieve a closed-form solution with a reduced time complexity. Finally, to consider individual user behaviors for denoising, we develop a partial OT framework to adaptively relabel user-item interactions through a personalized thresholding mechanism. Extensive experiments show that our framework can significantly boost the performances of existing RS models. © 2022 Copyright for this paper by its authors.

关键词： Embeddings

来源：评论

学校读者我要写书评

暂无评论

A dynamic multi-objective evolutionary algorithm based on Niche prediction strategy

引用

Applied Soft computing 2023年 142卷

作者： Zheng, Jinhua Zhang, Bo Zou, Juan Yang, Shengxiang Hu, Yaru Hunan Engineering Research Center of Intelligent System Optimization and Security Xiangtan University Hunan Province Xiangtan411105 China Key Laboratory of Intelligent Computing and Information Processing Ministry of Education of China Xiangtan University Hunan Province Xiangtan411105 China Key Laboratory of Hunan Province for Internet of Things and Information Security Xiangtan University Hunan Province Xiangtan411105 China School of Computer Science and Informatics De Montfort University LeicesterLE1 9BH United Kingdom

In reality, many multi-objective optimization problems are dynamic. The Pareto optimal front (PF) or Pareto optimal solution (PS) of these dynamic multi-objective problems (DMOPs) changes as the environment change. Therefore, solving such problems requires an optimization algorithm that can quickly track the PF or PS after an environment change. Prediction-based response mechanism is a common method used to deal with environmental changes, which is commonly known as center point-based prediction. However, if the predicted direction of the center point is inaccurate, the predicted population will be biased towards one side. In this paper, we propose a niche prediction strategy based on center and boundary points (PCPB) to solve the dynamic multi-objective optimization problems, which consists of three steps. After environmental changes are detected, the first step is to divide the niche, dividing different individuals in the PS into different niche populations. The second step is to independently predict different niches, and select individuals with good convergence and distribution in the niche to predict the individuals that will produce the next generation. Finally, some different individuals are randomly generated in the next possible PS area to ensure the diversity of the population. To verify whether our proposed strategy is effective and competitive, PCPB was compared with five state-of-the-art strategies. The experimental results show that PCPB performed competitively in solving dynamic multi-objective optimization problems, which proves that our algorithm has good competitiveness. © 2023 Elsevier B.V.

关键词： Forecasting

来源：评论

学校读者我要写书评

暂无评论

Traffic Engineering in Dynamic Hybrid Segment Routing Networks

引用

Computers, Materials & Continua 2021年第7期68卷 655-670页

作者： Yingya Guo Kai Huang Cheng Hu Jiangyuan Yao Siyu Zhou College of Mathematics and Computer Science Fuzhou UniversityFuzhou350000China Fujian Key Laboratory of Network Computing and Intelligent Information Processing Fuzhou UniversityFuzhou350000China Key Laboratory of Spatial Data Mining&Information Sharing Ministry of EducationFuzhou350003China School of Information Science and Technology Guangdong University of Foreign StudiesGuangzhou510006China School of Computer Science and Cyberspace Security Hainan UniversityHaiKou570228China Tandon School of Engineering New York UniversityNew York10012USA Department of Computing Hong Kong Polytechnic UniversityHong Hom999077Hong Kong

The emergence of Segment Routing(SR)provides a novel routing paradigm that uses a routing technique called source packet *** SR architecture,the paths that the packets choose to route on are indicated at the ingress *** with shortest-path-based routing in traditional distributed routing protocols,SR can realize a flexible routing by implementing an arbitrary flow splitting at the ingress *** the advantages of SR,it may be difficult to update the existing IP network to a full SR deployed network,for economical and technical *** partial of the traditional IP network to the SR network,thus forming a hybrid SR network,is a preferable *** the traffic is dynamically changing in a daily time,in this paper,we propose a Weight Adjustment algorithm WASAR to optimize routing in a dynamic hybrid SR *** algorithm can be divided into three steps:firstly,representative Traffic Matrices(TMs)and the expected TM are obtained from the historical TMs through ultrascalable spectral clustering ***,given the network topology,the initial network weight setting and the expected TM,we can realize the link weight optimization and SR node deployment optimization through a Deep Reinforcement Learning(DRL)***,we optimize the flow splitting ratios of SR nodes in a centralized online manner under dynamic traffic demands,in order to improve the network *** the evaluation,we exploit historical TMs to test the performance of the obtained routing configuration in *** extensive experimental results validate that our proposed WASAR algorithm has superior performance in reducing Maximum Link Utilization(MLU)under the dynamic traffic.

关键词： Traffic engineering routing optimization segment routing deep reinforcement learning ultra-scalable spectral clustering

来源：评论

学校读者我要写书评

暂无评论

Research on Heart Rate Variability Base on Adaptive Multiscale Entropy and its Application

SSRN

引用

SSRN 2023年

作者： Niu, Xiao-Dong Lu, Li-Rong Wang, Jian Li, Xuan Bio-Medical Engineering Department Changzhi Medical College Changzhi046000 China Engineering Research Centre for Intelligent Data Assisted Diagnosis and Treatment in Shanxi Province Changzhi046000 China Shanxi Key Laboratory of Signal Capturing and Processing North University of China Taiyuan030051 China

Analysis of Heart Rate Variability(HRV) can evaluate diseases related to autonomic nervous function. Linear analysis method can't reflect the time-varying characteristics of HRV. Therefore, nonlinear analysis methods, especially multiscale entropy (MSE), have received extensive attention and research. However, the nonstationary of HRV makes MSE with fixed scale unsuitable for comprehensive and accurate analysis of HRV. Here, we combine integral mean mode decomposition (IMMD), an adaptive orthogonal decomposition method of data, with the sample entropy to quantify the complexity of HRV on adaptive multi-scales. We call it adaptive multiscale entropy (AMSE). AMSE analysis of HRV from three types of subjects, Atrial Fibrillation (AF), Congestive Heart Failure (CHF) and Healthy Sinus Rhythm (NSR), shows that the pathological states of AF and CHF reduce the complexity of the heart system on different adaptive scales, and change the adaptive scales of the heart system in different degrees. However, these findings cannot be obtained by MSE method. In addition, three types of HRV can be identified by the scales and complexity of HRV obtained by AMSE: in the 80 samples, the accuracy, sensitivity and specificity of CHF identification are 0.913, 0.900 and 0.925, respectively;The accuracy, sensitivity and specificity of AF recognition are 0.988, 0.975 and 1, respectively, which are superior to linear and MSE methods. In a word, AMSE can comprehensively and accurately assess the complexity of HRV. © 2023, The Authors. All rights reserved.

关键词： Mode decomposition

来源：评论

学校读者我要写书评

暂无评论

CSCL-DTI: predicting drug-target interaction through cross-view and self-supervised contrastive learning

CSCL-DTI: predicting drug-target interaction through cross-v...

引用

IEEE International Conference on Bioinformatics and Biomedicine (BIBM)

作者： Xuan Lin Xi Zhang Zu-Guo Yu Yahui Long Xiangxiang Zeng Philip S. Yu College of Computer Science Xiangtan University China Key Laboratory of Intelligent Computing and Information Processing of Ministry of Education Xiangtan University China Singapore Immunology Network (SIgN) Agency for Science Technology and Research (A*STAR) Singapore College of Information Science and Engineering Hunan University China Department of Computer Science University of Illinois Chicago USA

ISBN: (数字)9798350386226

ISBN: (纸本)9798350386233

Accurately predicting drug-target interactions (DTI) is a critical step in drug discovery. Existing methods of DTI prediction primarily employ Simplified Molecular-Input Line-Entry System (SMILES) sequences or molecular graphs to learn drug representations. However, the features learned by such single-view approach is prone to incomplete. While some multiview methods that consider the views of both SMILES sequences and molecular graphs have been developed, these methods often fall in short in capturing potential interactions between views. In this work, we propose a novel dual contrastive learning framework CSCL-DTI for DTI prediction. First, we design a contrastive-enhanced cross-view representation learning (CVRL) to learn representations for drugs. In this module, Transformer-based and graph convolutional network (GCN)-based encoders are separately adopted to learn view-specific representations, followed by contrastive learning to enrich the representations by accounting for the potential interplay between local chemical context and topological structure. Second, we combine Transformer with self-supervised contrastive learning (SSCL) to learn representations for targets by modelling protein amino acids sequences. The scheme allows to effectively preserve the intrinsic characteristics of the sequences. Finally, we introduce a bilinear attention network to obtain an integrated representation by adaptively incorporating drug and target representations. Benchmarking experiments on two datasets demonstrated that CSCL-DTI 1 outperforms six state-of-the-art methods.

关键词： Drugs Proteins Representation learning Protein engineering Adaptation models Contrastive learning Predictive models Transformers Amino acids Diffusion tensor imaging

来源：评论

学校读者我要写书评

暂无评论

Single-cell Long Non-coding RNA Landscape of T Cells in Human Cancer Immunity

引用

Genomics, Proteomics & Bioinformatics 2021年第3期19卷 377-393页

作者： Haitao Luo Dechao Bu Lijuan Shao Yang Li Liang Sun Ce Wang Jing Wang Wei Yang Xiaofei Yang Jun Dong Yi Zhao Furong Li Translational Medicine Collaborative Innovation Center The Second Clinical Medical College(Shenzhen People’s Hospital)Jinan UniversityShenzhen 518020China Shenzhen Key Laboratory of Stem Cell Research and Clinical Transformation Shenzhen 518020China Integrated Chinese and Western Medicine Postdoctoral Research Station Jinan UniversityGuangzhou 510632China Bioinformatics Research Group Key Laboratory of Intelligent Information ProcessingAdvanced Computing Research CenterInstitute of Computing TechnologyChinese Academy of SciencesBeijing 100190China Department of Gastrointestinal Surgery The Second Clinical Medical College(Shenzhen People’s Hospital)Jinan UniversityShenzhen 518020China

The development of new biomarkers or therapeutic targets for cancer immunotherapies requires deep understanding of *** date,the complete landscape and systematic characterization of long noncoding RNAs(lncRNAs)in T cells in cancer immunity are ***,by systematically analyzing full-length single-cell RNA sequencing(scRNA-seq)data of more than 20,000 libraries of T cells across three cancer types,we provided the first comprehensive catalog and the functional repertoires of lncRNAs in human T ***,we developed a custom pipeline for de novo transcriptome assembly and obtained a novel lncRNA catalog containing 9433 *** increased the number of current human lncRNA catalog by 16%and nearly doubled the number of lncRNAs expressed in T *** found that a portion of expressed genes in single T cells were lncRNAs which had been overlooked by the majority of previous *** on metacell maps constructed by the MetaCell algorithm that partitions scRNA-seq datasets into disjointed and homogenous groups of cells(metacells),154 signature lncRNA genes were *** were associated with effector,exhausted,and regulatory T cell ***,84 of them were functionally annotated based on the co-expression networks,indicating that lncRNAs might broadly participate in the regulation of T cell *** findings provide a new point of view and resource for investigating the mechanisms of T cell regulation in cancer immunity as well as for novel cancer-immune biomarker development and cancer immunotherapies.

关键词： Long non-coding RNA Transcriptome assembly Metacell Immune regulation Functional annotation

来源：评论

学校读者我要写书评

暂无评论

GM-DF: Generalized Multi-Scenario Deepfake Detection

arXiv

引用

arXiv 2024年

作者： Lai, Yingxin Yu, Zitong Yang, Jing Li, Bin Kang, Xiangui Shen, Linlin The School of Computing and Information Technology Great Bay University Dongguan523000 China National Engineering Laboratory for Big Data System Computing Technology Shenzhen University Shenzhen518060 China Shenzhen Institute of Artificial Intelligence and Robotics for Society Shenzhen University Shenzhen518060 China The Guangdong Key Laboratory of Information Security The School of Computer Science and Engineering Sun Yat-sen University Guangzhou510080 China Computer Vision Institute School of Computer Science & Software Engineering Shenzhen Institute of Artificial Intelligence and Robotics for Society Guangdong Key Laboratory of Intelligent Information Processing National Engineering Laboratory for Big Data System Computing Technology Shenzhen University Shenzhen518060 China

Existing face forgery detection usually follows the paradigm of training models in a single domain, which leads to limited generalization capacity when unseen scenarios and unknown attacks occur. In this paper, we elaborately investigate the generalization capacity of deepfake detection models when jointly trained on multiple face forgery detection datasets. We first find a rapid degradation of detection accuracy when models are directly trained on combined datasets due to the discrepancy across collection scenarios and generation methods. To address the above issue, a Generalized Multi-Scenario Deepfake Detection framework (GM-DF) is proposed to serve multiple real-world scenarios by a unified model. First, we propose a hybrid expert modeling approach for domain-specific real/forgery feature extraction. Besides, as for the commonality representation, we use CLIP to extract the common features for better aligning visual and textual features across domains. Meanwhile, we introduce a masked image reconstruction mechanism to force models to capture rich forged details. Finally, we supervise the models via a domain-aware meta-learning strategy to further enhance their generalization capacities. Specifically, we design a novel domain alignment loss to strongly align the distributions of the meta-test domains and meta-train domains. Thus, the updated models are able to represent both specific and common real/forgery features across multiple datasets. In consideration of the lack of study of multi-dataset training, we establish a new benchmark leveraging multi-source data to fairly evaluate the models' generalization capacity on unseen scenarios. Both qualitative and quantitative experiments on five datasets conducted on traditional protocols as well as the proposed benchmark demonstrate the effectiveness of our approach. The codes will be available on https://***/laiyingxin2/GM-DF. Copyright © 2024, The Authors. All rights reserved.

关键词： Image reconstruction

来源：评论

学校读者我要写书评

暂无评论

NOBGP: A Novel Optimized Balanced Graph Partitioning Algorithm 19th

NOBGP: A Novel Optimized Balanced Graph Partitioning Algorit...

引用

19th CCF Conference on Computer Supported Cooperative Work and Social computing, ChineseCSCW 2024

作者： Chen, Jiebin Hu, Ziqiang Ye, Renjie Zhang, Qishan Guo, Kun College of Computer and Data Science Fuzhou University Fuzhou350108 China Engineering Research Center of Big Data Intelligence Ministry of Education Fuzhou350108 China Fujian Key Laboratory of Network Computing and Intelligent Information Processing Fuzhou University Fuzhou350108 China Xianda College of Economics and Humanities Shanghai International Studies University Shanghai China

ISBN: (纸本)9789819623723

Large-scale graphs have become prevalent with the advent of the big data era. Distributed graph computing systems are commonly used for processing and analyzing large-scale graphs, with graph partitioning being a key prerequisite for their efficient computation. Graph partitioning aims to balance the load across partitions while minimizing the number of cut-edges. Moreover, it should achieve high efficiency and scalability. However, the existing popular graph partitioning algorithms do not fully take into account the internal topology of real-world graphs, which affects the final partition quality and convergence. Meanwhile, they easily fall into the local optimum due to partition load constraints. This paper introduces a Novel Optimized Balanced Graph Partitioning algorithm (NOBGP). First, we propose an initialization strategy based on label propagation of core vertices to achieve initial partitions with good locality and accelerate convergence. Second, we optimize the label propagation process to ensure balanced partitions and propose a probability-based disruption strategy to avoid the local optimum. We implement NOBGP on the distributed graph computing framework GraphX. Extensive experimental results on real-world graphs show that the proposed algorithm is scalable and performs better than the existing algorithms. We also run PageRank and Louvain applications using the graph partitioning results to demonstrate the efficiency of our algorithm. © The Author(s), under exclusive license to Springer Nature Singapore Pte Ltd. 2025.

关键词： Graph algorithms

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：