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

Proceedings of the 4th International Conference on Natural Language processing and information Retrieval

作者： Xinyuan Ren Xiangling Fu Xuesi Zhou Chunsheng Liu Songfeng Gao Lei Peng School of Software Engineering Beijing University of Posts and Telecommunications Beijing China and Key Laboratory of Trustworthy Distributed Computing and Service Ministry of Education Beijing University of Posts and Telecommunications Beijing China Department of Electronic Engineering Tsinghua University Hai Dian Beijing China and Multimedia Signal and Intelligent Information Processing Lab Tsinghua University Hai Dian Beijing China BUPT and Huarong Joint lab of Smart Finance Beijing P. R. China and HuaRong RongTong (Beijing) Technology Co. Ltd Beijing P. R. China

ISBN: (纸本)9781450377607

Sentence alignment, as one of the most active and fundamental tasks in the field of natural language processing (NLP), is usually realized in two categories of methods. One is traditional methods which are firstly proposed, the other, which are adopted later, is based on the Neural Network method. Presently, under the limitation that the existing mainstream data corpora are mostly in the form of 1-to-1, the alignment models with relatively good performance mainly apply to the cases of 1-to-1 sentence alignment. However, under the circumstance that a sentence contains too much information, 1-to-N sentence alignment can actually have a better effect on sentence translation tasks, compared with the 1-to-1 form, since it is more flexible and can reduce the complexity of the original sentence. As a result, we attempt to exploit neural networks with relatively good performance in the cases of 1-to-1 to fit in the cases of 1-to-N. In this paper, a novel 1-N Bilingual word Embedding with Sentence Combination CNN Improved Framework (1-NBESCC) is proposed in order to align 1-to-N sentences more precisely. Experiments show that our proposed model performs as good as the traditional methods such as BLEUALIGN in 1-to-1 situation, but much better in 1-to-N situation.

关键词： Convolutional Neural Network

来源：评论

学校读者我要写书评

暂无评论

An improved Gaussian Mixture Model algorithm for background representation

引用

Journal of Physics: Conference Series 2019年第1期1325卷

作者： Ping Wang Shaoxiong Dong School of Electrical Engineering and Electronic Information Xihua University Chengdu Sichuan 610039 China Artificial Intelligence Key Laboratory of Sichuan Province Sichuan University of Science and Engineering Zigong Sichuan 643000 China Science Computing Intelligent Information Processing of GuangXi higher education key laboratory Guangxi Teachers Education University Nanning 530023 China

Initializing a background frame for Gaussian Mixture Model requires no moving objects in the background scene. In this paper, in order to obtain an initial frame when there is a moving object in the background scene, filtering algorithm is used for background frame initialization. This paper proposes an improved method for updating Gaussian mixture models. In the initial stage of the GMM, the update rate of the mean and variance is taken as a larger value, so that the model mean and variance update speed becomes faster, and the model learning speed is accelerated; after training for a period of time with a large update rate, let The mean update rate is unchanged, and the variance update rate becomes smaller, so that the background model can be more stable.

关键词：

来源：评论

学校读者我要写书评

暂无评论

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

来源：评论

学校读者我要写书评

暂无评论

Overview of the Tenth Dialog System Technology Challenge: DSTC10

引用

IEEE/ACM Transactions on Audio Speech and Language processing 2024年 32卷 765-778页

作者： Yoshino, Koichiro Chen, Yun-Nung Crook, Paul Kottur, Satwik Li, Jinchao Hedayatnia, Behnam Moon, Seungwhan Fei, Zhengcong Li, Zekang Zhang, Jinchao Feng, Yang Zhou, Jie Kim, Seokhwan Liu, Yang Jin, Di Papangelis, Alexandros Gopalakrishnan, Karthik Hakkani-Tur, Dilek Damavandi, Babak Geramifard, Alborz Hori, Chiori Shah, Ankit Zhang, Chen Li, Haizhou Sedoc, Joao D'haro, Luis F. Banchs, Rafael Rudnicky, Alexander Guardian Robot Project R-IH RIKEN 2-2-2 Hikaridai Seika Shoraku619-0288 Japan Information Science Nara Institute of Science and Technology Ikoma630-0101 Japan Computer Science and Information Engineering National Taiwan University Taipei10617 Taiwan Inc. Palo AltoCA95054 United States Alexa AI *** Inc. SunnyvaleCA94089 United States Meta Seattle RedmondWA98052 United States Institute of Computing Technology Chinese Academy of Sciences Beijing100190 China Key Laboratory of Intelligent Information Processing Institute of Computing Technology Chinese Academy of Sciences Beijing100190 China Tencent AI Lab Beijing Beijing China Kexueyuan South Road Zhongguancun Beijing100190 China Beijing 100190 China Alexa AI *** Inc. SunnyvaleCA United States 1120 Enterprise way Sunnyvale94089 United States *** Inc. SeattleWA United States Menlo Park CA United States Audio and Speech Group Mitsubishi Electric Research Laboratories CambridgeMA02139-1955 United States Carnegie Mellon University Department of Language and Information Technologies or just Carnegie Mellon University Pittsburgh United States National University of Singapore Singapore Singapore Department of Electrical and Computer Engineering National University of Singapore Singapore Singapore Shenzhen Research Institute of Big Data School of Data Science Chinese University of Hong Kong Shenzhen518172 China New York University New YorkNY United States ETSI de Telecomunicacion - Speech Technology and Machine Learning Group Universidad Politecnica de Madrid Ciudad Universitaria Madrid28040 Spain Nanyang Technological University Singapore Singapore Carnegie Mellon University PittsburghPA United States

This article introduces the Tenth Dialog System Technology Challenge (DSTC-10). This edition of the DSTC focuses on applying end-to-end dialog technologies for five distinct tasks in dialog systems, namely 1. Incorporation of Meme images into open domain dialogs, 2. Knowledge-grounded Task-oriented Dialogue Modeling on Spoken Conversations, 3. Situated Interactive Multimodal dialogs, 4. Reasoning for Audio Visual Scene-Aware Dialog, and 5. Automatic Evaluation and Moderation of Open-domainDialogue Systems. This article describes the task definition, provided datasets, baselines, and evaluation setup for each track. We also summarize the results of the submitted systems to highlight the general trends of the state-of-the-art technologies for the tasks. © 2023 The Authors.

关键词： Job analysis

来源：评论

学校读者我要写书评

暂无评论

Optimizing Two-way Partial AUC with an End-to-end Framework

arXiv

引用

arXiv 2022年

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

The Area Under the ROC Curve (AUC) is a crucial metric for machine learning, which evaluates the average performance over all possible True Positive Rates (TPRs) and False Positive Rates (FPRs). Based on the knowledge that a skillful classifier should simultaneously embrace a high TPR and a low FPR, we turn to study a more general variant called Two-way Partial AUC (TPAUC), where only the region with TPR ≥ α, FPR ≤ β is included in the area. Moreover, a recent work shows that the TPAUC is essentially inconsistent with the existing Partial AUC metrics where only the FPR range is restricted, opening a new problem to seek solutions to leverage high TPAUC. Motivated by this, we present the first trial in this paper to optimize this new metric. The critical challenge along this course lies in the difficulty of performing gradient-based optimization with end-to-end stochastic training, even with a proper choice of surrogate loss. To address this issue, we propose a generic framework to construct surrogate optimization problems, which supports efficient end-to-end training with deep learning. Moreover, our theoretical analyses show that: 1) the objective function of the surrogate problems will achieve an upper bound of the original problem under mild conditions, and 2) optimizing the surrogate problems leads to good generalization performance in terms of TPAUC with a high probability. Finally, empirical studies over several benchmark datasets speak to the efficacy of our framework. © 2022, CC BY.

关键词： Stochastic systems

来源：评论

学校读者我要写书评

暂无评论

Nitrogen vertical distribution by canopy reflectance spectrum in winter wheat

引用

IOP Conference Series: Earth and Environmental Science 2014年第1期17卷

作者： W J Huang Q Y Yang D L Peng L S Huang D Y Zhang G J Yang Key Laboratory of Digital Earth Science Institute of Remote Sensing and Digital Earth Chinese Academy of Sciences Beijing 100094 China Key Laboratory of Intelligent Computing & Signal Processing Ministry of Education Anhui University Hefei 230039 Anhui China Beijing Agriculture Information Technology Research Center Beijing 100097 China

Nitrogen is a key factor for plant photosynthesis, ecosystem productivity and leaf respiration. Under the condition of nitrogen deficiency, the crop shows the nitrogen deficiency symptoms in the bottom leaves, while excessive nitrogen will affect the upper layer leaves first. Thus, timely measurement of vertical distribution of foliage nitrogen content is critical for growth diagnosis, crop management and reducing environmental impact. This study presents a method using bi-directional reflectance difference function (BRDF) data to invert foliage nitrogen vertical distribution. We developed upper-layer nitrogen inversion index (ULNI), middle-layer nitrogen inversion index (MLNI) and bottom-layer nitrogen inversion index (BLNI) to reflect foliage nitrogen inversion at upper layer, middle layer and bottom layer, respectively. Both ULNI and MLNI were made by the value of the ratio of Modified Chlorophyll Absorption Ration Index to the second Modified Triangular Vegetation Index (MCARI/MTVI2) referred to as canopy nitrogen inversion index (CNII) in this study at ±40° and ±50°, and at ±30° and ±40° view angles, respectively. The BLNI was composed by the value of nitrogen reflectance index (NRI) at ±20° and ±30° view angles. These results suggest that it is feasible to measure foliage nitrogen vertical-layer distribution in a large scale by remote sensing.

关键词：

来源：评论

学校读者我要写书评

暂无评论

TSW-FD: A Novel Temporal and Spatial Domain Weight Analysis of Feature Difference for Micro-Expression Spotting

引用

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

作者： Zhihao Zhang Fan Mo Ke Zhao Tong Chen Xiaolan Fu State Key Laboratory of Brain and Cognitive Science Institute of Psychology Chinese Academy of Sciences Beijing 100101 China Department of Psychology University of Chinese Academy of Sciences Beijing 100049 China Chongqing Key Laboratory of Non-linear Circuit and Intelligent Information Processing Southwest University Chongqing 400715 China Chongqing Key Laboratory of Artificial Intelligence and Service Robot Control Technology Chongqing 400715 China

The micro-expression spotting has recently attracted increasing attention from psychology and computer vision community, since embraced in the second facial Micro-Expression Grand Challenge (MEGC 2019). Different from the original feature difference (FD) analysis, in this paper, we proposed a novel temporal and spatial domain weight analysis of feature difference (TSW-FD) to achieve micro-expression spotting. The experimental results showed that TSW-FD improved 17.86% and 24.21% in F1-Score comparing to the FD in CASME II and SMIC-E-HS.

关键词：

来源：评论

学校读者我要写书评

暂无评论

Drug3D-DTI: Improved Drug-target Interaction Prediction by Incorporating Spatial information of Small Molecules

Drug3D-DTI: Improved Drug-target Interaction Prediction by I...

引用

IEEE International Conference on Bioinformatics and Biomedicine (BIBM)

作者： Zhirui Liao Xiaodi Huang Hiroshi Mamitsuka Shanfeng Zhu School of Computer Science Fudan University Shanghai China Institute of Artificial Intelligence Biomedicine Nanjing University Nanjing China School of Computing Mathematics and Engineering Charles Sturt University Albury NSW Australia Bioinformatics Center Institute for Chemical Research Kyoto University Uji Kyoto Japan Institute of Science and Technology for Brain-Inspired Intelligence Fudan University Shanghai China Key Laboratory of Computational Neuroscience and Brain-Inspired Intelligence (Fudan University) Ministry of Education China MOE Frontiers Center for Brain Science Fudan University Shanghai China Zhangjiang Fudan International Innovation Center Shanghai China Shanghai Key Lab of Intelligent Information Processing Fudan University Shanghai China

ISBN: (纸本)9781665429825

A number of machine learning (ML) approaches for drug discovery have been available that rely only on sequential (1D) and planar (2D) information without effectively using the 3D information for generating features of drugs. However, 3D information of small molecules can reflect relative position of atoms more directly, which affects molecular properties. In this work, we present a new deep learning model called Drug3D-DTI for drug-target interaction prediction. Drug3D-DTI takes advantage of molecular spatial information, i.e., atom proximity in three-dimensional (3D) structures. We comprehensively evaluated the performance of Drug3D-DTI on two datasets with two tasks of regression and classification. In particular, we compared Drug3D-DTI with several existing methods including the two cutting-edge methods for compound-protein interaction prediction. From the experimental results, Drug3D-DTI clearly outperformed other methods under all settings. Further, this performance improvement was validated by ablation experiments and a case study. The implementation of Drug3D-DTI is available at (https://***/zhiruiliao/Drug3D-DTI).

关键词： Drugs Proteins Deep learning Solid modeling Three-dimensional displays Conferences Predictive models

来源：评论

学校读者我要写书评

暂无评论

Kinetic-molecular theory optimization algorithm based on Kent chaotic mapping

引用

AIP Conference Proceedings 2017年第1期1864卷

作者： Huguang Gong Chaodong Fan Bo Ouyang 1Key Laboratory for Intelligent Computing & Information Processing of the Ministry of Education (Xiangtan University) Xiangtan Hunan 411105 China 2Hunan 2011 Collaborative Innovation Center of the Change of Wind Power and Electrical Energy Xiangtan Hunan 411105 China

Aiming at the shortage that Kinetic-molecular theory optimization algorithm (KMTOA) is more likely to show premature convergence and the accuracy of searching for the optimum needs to be improved, a Kinetic-molecular theory optimization algorithm (KCKMTOA) based on Kent chaotic mapping was proposed. The algorithm utilizes the characteristics of chaotic algorithm, such as ergodicity, non-periodicity, randomness etc. When algorithm falls into the local optimum, Kent chaotic mapping is used to perform chaotic search around the local optimum to replace partial particles of original particle swarm in order to jump out from the local optimum to find the global optimum. As the algorithm is carried out, the radius of chaotic search decreases linearly, so as to ensure the precision of searching and speed of the algorithm. 20 classical test functions are taken into consideration in simulation experiments. After making a comprehensive comparison for the performance of searching for the optimum of DE, GA, QPSO, KMTOA and KCKMTOA in 20 classical test functions, the results of experiments show that this algorithm has obvious advantages in precision, speed and robustness optimization etc.

关键词：

来源：评论

学校读者我要写书评

暂无评论

Laplacian normalization and random walk on heterogeneous networks for disease-gene prioritization

引用

Computational biology and chemistry 2015年 57卷 21-8页

作者： Zhi-Qin Zhao Guo-Sheng Han Zu-Guo Yu Jinyan Li Hunan Key Laboratory for Computation and Simulation in Science and Engineering and Key Laboratory of Intelligent Computing and Information Processing of Ministry of Education Xiangtan University Xiangtan Hunan 411105 China. Hunan Key Laboratory for Computation and Simulation in Science and Engineering and Key Laboratory of Intelligent Computing and Information Processing of Ministry of Education Xiangtan University Xiangtan Hunan 411105 China School of Mathematical Sciences Queensland University of Technology GPO Box 2434 Brisbane Q4001 Australia. Electronic address: yuzg1970@***. Advanced Analytics Institute & Centre for Health Technologies University of Technology Sydney Broadway NSW 2007 Australia. Electronic address: jinyan.li@uts.edu.au.

Random walk on heterogeneous networks is a recently emerging approach to effective disease gene prioritization. Laplacian normalization is a technique capable of normalizing the weight of edges in a network. We use this technique to normalize the gene matrix and the phenotype matrix before the construction of the heterogeneous network, and also use this idea to define the transition matrices of the heterogeneous network. Our method has remarkably better performance than the existing methods for recovering known gene-phenotype relationships. The Shannon information entropy of the distribution of the transition probabilities in our networks is found to be smaller than the networks constructed by the existing methods, implying that a higher number of top-ranked genes can be verified as disease genes. In fact, the most probable gene-phenotype relationships ranked within top 3 or top 5 in our gene lists can be confirmed by the OMIM database for many cases. Our algorithms have shown remarkably superior performance over the state-of-the-art algorithms for recovering gene-phenotype relationships. All Matlab codes can be available upon email request.

关键词： Disease genes and phenotypes Heterogeneous network Laplacian normalization Leave-one-out cross-validation Random walk with restart Shannon information entropy

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：