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

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

来源：评论

学校读者我要写书评

暂无评论

Whale: Efficient One-to-Many data Partitioning in RDMA-Assisted Distributed Stream Processing Systems

Whale: Efficient One-to-Many Data Partitioning in RDMA-Assis...

引用

Supercomputing Conference

作者： Jie Tan Hanhua Chen Yonghui Wang Hai Jin National Engineering Research Center for Big Data Technology and System Services Computing Technology and System Lab Cluster and Grid Computing Lab School of Computing Science and Technology Huazhong University of Science and Technology Wuhan China

ISBN: (数字)9781450384421

ISBN: (纸本)9781665483902

To process large-scale real-time data streams, existing distributed stream processing systems (DSPSs) leverage different stream partitioning strategies. The one-to-many data partitioning strategy plays an important role in various applications. With one-to-many data partitioning, an upstream processing instance sends a generated tuple to a potentially large number of downstream processing instances. Existing DSPSs leverage an instance-oriented communication mechanism, where an upstream instance transmits a tuple to different downstream instances separately. However, in one-to-many data partitioning, multiple downstream instances typically run on the same machine to exploit multi-core resources. Therefore, a DSPS actually sends a data item to a machine multiple times, raising significant unnecessary costs for serialization and communication. We show that such a mechanism can lead to serious performance bottleneck due to CPU overload. To address the problem, we design and implement Whale, an efficient RDMA (Remote Direct Memory Access) assisted distributed stream processing system. Two factors contribute to the efficiency of this design. First, we propose a novel RDMA-assisted stream multicast scheme with a self-adjusting non-blocking tree structure to alleviate the CPU workloads of an upstream instance during one-to-many data partitioning. Second, we re-design the communication mechanism in existing DSPSs by replacing the instance-oriented communication with a new worker-oriented communication scheme, which saves significant costs for redundant serialization and communication. We implement Whale on top of Apache Storm and conduct comprehensive experiments to evaluate its performance with large-scale real world datasets. The results show that Whale achieves 56.6x improvement of system throughput and 97% reduction of processing latency compared to existing designs.

关键词： Costs Storms High performance computing Memory management Whales Distributed databases Throughput

来源：评论

学校读者我要写书评

暂无评论

Benchmarking ULS-TLS Point Cloud Registration Algorithms in Forest Environments

引用

IEEE Transactions on Geoscience and Remote Sensing 2025年 63卷

作者： Liu, Wangjun Nie, Sheng Xia, Shaobo Wang, Cheng Wang, Jinliang Xi, Xiaohuan Cheng, Feng Chinese Academy of Sciences Key Laboratory of Digital Earth Science Aerospace Information Research Institute Beijing100094 China International Research Center of Big Data for Sustainable Development Goals Beijing100094 China University of Chinese Academy of Sciences College of Resources and Environment Beijing100049 China Changsha University of Science & Technology School of Traffic & Transportation Engineering Changsha410114 China Yunnan Normal University Faculty of Geography Yunnan Kunming650500 China

Integrating Unmanned aerial vehicle Laser Scanning (ULS) and Terrestrial Laser Scanning (TLS) data in complex forest environments remains a significant challenge. Despite the availability of numerous registration algorithms, robust comparative studies are limited by the lack of reliable multi-platform benchmark datasets. In this study, we introduce the first multiplatform benchmark dataset for ULS-TLS point cloud registration in forests, encompassing 17 plots from seven diverse regions with about 1.56 billion points. The dataset is categorized into three difficulty levels based on overlap ratio and rigid *** evaluated the performance of five registration algorithms against this benchmark. Chen2022 achieved the highest accuracy with a 100% success rate across all difficulty levels. While Wu2024 demonstrated robust performance in lower difficulties but faced challenges in more complex scenarios. We also found that terrain variations and rigid overlap significantly impacted registration accuracy, particularly for algorithms reliant on individual tree positions such as Hyypp¨a2021 and Feng2024. These findings underscore the need for improved data collection strategy, ground filtering techniques, and feature matching algorithms to enhance performance in challenging environments. We present the first openly accessible multi-platform benchmark dataset for forested regions and anticipate that future research will expand this work to additional areas. The dataset can be downloaded from: datasetDownloadLink. © 1980-2012 IEEE.

关键词： Laser materials processing

来源：评论

学校读者我要写书评

暂无评论

Connecting latent relationships over heterogeneous attributed network for recommendation

arXiv

引用

arXiv 2021年

作者： Duan, Ziheng Wang, Yueyang Ye, Weihao Feng, Zixuan Fan, Qilin Li, Xiuhua School of Big Data and Software Engineering Chongqing University Chongqing401331 China Department of Control Science and Technology Zhejiang University Hangzhou310027 China

Recently, deep neural network models for graph-structured data have been demonstrating to be influential in recommendation systems. Graph Neural Network (GNN), which can generate high-quality embeddings by capturing graph-structured information, is convenient for the recommendation. However, most existing GNN models mainly focus on the homogeneous graph. They cannot characterize heterogeneous and complex data in the recommendation system. Meanwhile, it is challenging to develop effective methods to mine the heterogeneity and latent correlations in the graph. In this paper, we adopt Heterogeneous Attributed Network (HAN), which involves different node types as well as rich node attributes, to model data in the recommendation system. Furthermore, we propose a novel graph neural network-based model to deal with HAN for Recommendation, called HANRec. In particular, we design a component connecting potential neighbors to explore the influence between neighbors and provide two different strategies with the attention mechanism to aggregate neighbors’ information. The experimental results on two real-world datasets prove that HANRec outperforms other state-of-the-arts methods1 Copyright © 2021, The Authors. All rights reserved.

关键词： Graph neural networks

来源：评论

学校读者我要写书评

暂无评论

Text-augmented long-term relation dependency learning for knowledge graph representation

High-Confidence Computing

引用

High-Confidence Computing 2025年

作者： Quntao Zhu Mengfan Li Yuanjun Gao Yao Wan Xuanhua Shi Hai Jin National Engineering Research Center for Big Data Technology and System Services Computing Technology and System Lab Cluster and Grid Computing Lab School of Computer Science and Technology Huazhong University of Science and Technology Wuhan 430074 China

Knowledge graph (KG) representation learning aims to map entities and relations into a low-dimensional representation space, showing significant potential in many tasks. Existing approaches follow two categories: (1) Graph-based approaches encode KG elements into vectors using structural score functions. (2) Text-based approaches embed text descriptions of entities and relations via pre-trained language models (PLMs), further fine-tuned with triples. We argue that graph-based approaches struggle with sparse data, while text-based approaches face challenges with complex relations. To address these limitations, we propose a unified Text-Augmented Attention-based Recurrent Network, bridging the gap between graph and natural language. Specifically, we employ a graph attention network based on local influence weights to model local structural information and utilize a PLM based prompt learning to learn textual information, enhanced by a mask-reconstruction strategy based on global influence weights and textual contrastive learning for improved robustness and generalizability. Besides, to effectively model multi-hop relations, we propose a novel semantic-depth guided path extraction algorithm and integrate cross-attention layers into recurrent neural networks to facilitate learning the long-term relation dependency and offer an adaptive attention mechanism for varied-length information. Extensive experiments demonstrate that our model exhibits superiority over existing models across KG completion and question-answering tasks.

关键词： Knowledge graph representation Graph attention network Pre-trained language model Attention-based recurrent network Masked autoencoder Contrastive learning

来源：评论

学校读者我要写书评

暂无评论

CRU: A Novel Neural Architecture for Improving the Predictive Performance of Time-Series data

arXiv

引用

arXiv 2022年

作者： Sim, Sunghyun Kim, Dohee Bae, Hyerim TheIndustrial Management & Big Data Engineeri ng Major Division of Industrial Convergence System Engineering Dong eui University 176 Eomgwang No Gaya Dong 24 Busanjin Gu Busan47340 Korea Republic of Majoring in Industrial Data Science & E ngineering Department of Industrial Engineering Pusan National Univ ersity Pusan National University 30-Jan-jeon Dong Geum-Jeong Gu Busan6 09-753 Korea Republic of

The time-series forecasting (TSF) problem is a traditional problem in the field of artificial intelligence. Models such as Recurrent Neural Network (RNN), Long Short Term Memory (LSTM), and GRU (Gate Recurrent Units) have contributed to improving the predictive accuracy of TSF. Furthermore, model structures have been proposed to combine time-series decomposition methods, such as seasonal-trend decomposition using Loess (STL) to ensure improved predictive accuracy. However, because this approach is learned in an independent model for each component, it cannot learn the relationships between time-series components. In this study, we propose a new neural architecture called a correlation recurrent unit (CRU) that can perform time series decomposition within a neural cell and learn correlations (autocorrelation and correlation) between each decomposition component. The proposed neural architecture was evaluated through comparative experiments with previous studies using five univariate time-series datasets and four multivariate time-series data. The results showed that long- and short-term predictive performance was improved by more than 10%. The experimental results show that the proposed CRU is an excellent method for TSF problems compared to other neural architectures. © 2022, CC BY.

关键词： Model structures

来源：评论

学校读者我要写书评

暂无评论

Automatic generation and assessment of student assignments for parallel programming learning 10th

Automatic generation and assessment of student assignments f...

引用

10th International Symposium on Parallel Architectures, Algorithms and Programming, PAAP 2019

作者： Luo, Zhenxiao Wang, Zelong Wu, Di Hei, Xiaojun Du, Yunfei School of Data and Computer Science Sun Yat-sen University Guangzhou China Guangdong Key Laboratory of Big Data Analysis and Processing Guangzhou510006 China School of Electronic Information and Communications Huazhong University of Science and Technology Wuhan China National Supercomputer Center in Guangzhou Guangzhou China

The course of parallel programming is becoming more and more important for the education of students majoring in computer science. However, it is not easy to learn parallel programming well due to its high theory and practice requirements. In this paper, we design and implement an automatic assignment generation and assessment system to help students learn parallel programming. The assignments can be generated according to user behaviors and thus able to guide students to learn parallel programming step by step. Besides, it can automatically generate an overall assessment of student assignments by using fuzzy string matching, which provides an approximate reference score of objective questions. Subjective questions can be assessed directly by comparing the answer to the reference answer. This system also provides a friendly user interface for students to complete online assignments and let teachers manage their question database. In our teaching practice, students can learn parallel programming more effectively with the help of such an assignment generation and assessment system. © Springer Nature Singapore Pte Ltd. 2020.

关键词： Parallel programming

来源：评论

学校读者我要写书评

暂无评论

Decentralized and Lightweight Cross-Chain Transaction Scheme Based on Proxy Re-signature

Decentralized and Lightweight Cross-Chain Transaction Scheme...

引用

IEEE International Conference on Trust, Security and Privacy in Computing and Communications (TrustCom)

作者： Huiying Zou Jia Duan Xi Liu Wei Ren Tao Li Xianghan Zheng Kim-Kwang Raymond Choo School of Computer Science China University of Geosciences Wuhan China The Third Surveying and Mapping Institute of Hunan Province Hunan Engineering Research Center of Geographic Information Security and Application Hunan China Key Laboratory of Data Protection and Intelligent Management Sichuan University Ministry of Education China State Key Laboratory of Geo-Information Engineering and Key Laboratory of Surveying and Mapping Science and Geospatial Information Technology of MNR CASM Beijing China College of Computer and Big Data Fuzhou University School of Information and Intelligent Engineering Sanya College China Department of Information Systems and Cyber Security University of Texas at San Antonio San Antonio USA

ISBN: (数字)9798331506209

ISBN: (纸本)9798331506216

With the widespread application of digital assets and the rapid development of blockchain technology, achieving secure and efficient transactions between different blockchain networks has become an urgent challenge. Existing cross-chain methods impose limitations, e.g., hash lock technology exhibits low scalability, side-chain technology is overly complex, and notary schemes pose centralization risks. In order to address these issues, we propose a cross-chain transaction solution based on proxy re-signature technology. To tackle the centralization concerns, we employ proxy re-signature technology to decentralize the authority of notaries among transaction participants, minimizing the potential for centralization at a low cost. We further present an extended scheme that can guarantee more requirements such as higher transaction amount and shorter transaction time. Furthermore, we analyze and compare the signature technologies used in the proposed solution and provide a systematic proof of our approach’s security.

关键词： Privacy Systematics Costs Scalability Blockchains Security

来源：评论

学校读者我要写书评

暂无评论

A Service Composition Evolution Method that Combines Deep Clustering and a Service Requirement Context Model

SSRN

引用

SSRN 2022年

作者： Xiao, Gang Lu, Jiawei Zheng, Jiahong Chen, Zhenbo Wang, Qibing Li, Duanni School of Computer Science and Technology Zhejiang University of Technology Hangzhou China College of Mechanical and Electrical Engineering China Jiliang University Hangzhou China Key Laboratory of Intelligent Manufacturing Quality Big Data Tracing and Analysis of Zhejiang Province China Jiliang University Hangzhou China

Service composition can quickly build new value-added composite services by combining existing Web services. However, with the complex and changeable Internet environment, composite services need to effectively understand and manage requirements in a flexible and adaptive manner, and also be able to quickly and proactively provide high-quality services through a series of dynamic evolution models. In response to these challenges, in this study, we propose a service composition evolution method that can adaptively select the appropriate service to improve user satisfaction and service quality. First, we introduce a deep clustering method based on the topic model and auto-encoder, which considers the function description documents and parameter information of the services to reduce the search space of the candidate services. Furthermore, we describe a requirement-oriented context-sensitive task model to integrate functional and non-functional user requirements by connecting the context of Web subtasks. Then, we present a dynamic service matching method with QoS threshold judgement to filter and rank the services. We applied the proposed evolution method to the datasets of real-world Web services and measured the performance using standard measurement metrics. The prototype implementation and results of simulation experiments verified the effectiveness of each part of our method. © 2022, The Authors. All rights reserved.

关键词： Web services

来源：评论

学校读者我要写书评

暂无评论

When to update your model: constrained model-based reinforcement learning 22

When to update your model: constrained model-based reinforce...

引用

Proceedings of the 36th International Conference on Neural Information Processing Systems

作者： Tianying Ji Yu Luo Fuchun Sun Mingxuan Jing Fengxiang He Wenbing Huang Department of Computer Science and Technology Tsinghua University Science & Technology on Integrated Information System Laboratory Institute of Software Chinese Academy of Sciences JD Explore Academy *** Inc Gaoling School of Artificial Intelligence Renmin University of China and Beijing Key Laboratory of Big Data Management and Analysis Methods Beijing China

ISBN: (纸本)9781713871088

Designing and analyzing model-based RL (MBRL) algorithms with guaranteed monotonic improvement has been challenging, mainly due to the interdependence between policy optimization and model learning. Existing discrepancy bounds generally ignore the impacts of model shifts, and their corresponding algorithms are prone to degrade performance by drastic model updating. In this work, we first propose a novel and general theoretical scheme for a non-decreasing performance guarantee of MBRL. Our follow-up derived bounds reveal the relationship between model shifts and performance improvement. These discoveries encourage us to formulate a constrained lower-bound optimization problem to permit the monotonicity of MBRL. A further example demonstrates that learning models from a dynamically-varying number of explorations benefit the eventual returns. Motivated by these analyses, we design a simple but effective algorithm CMLO (Constrained Model-shift Lower-bound Optimization), by introducing an event-triggered mechanism that flexibly determines when to update the model. Experiments show that CMLO surpasses other state-of-the-art methods and produces a boost when various policy optimization methods are employed.

关键词：

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：