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

arXiv 2023年

作者： Xu, Fangzhi Lin, Qika Han, Jiawei Zhao, Tianzhe Liu, Jun Cambria, Erik The School of Computer Science and Technology Xi’an Jiao-tong University Shaanxi Xi’an710049 China The Shaanxi Provincial Key Laboratory of Big Data Knowledge Engineering National Engineering Lab for Big Data Analytics Shaanxi Xi’an710049 China The School of Computer Science and Engineering Nanyang Technological University Singapore

Logical reasoning consistently plays a fundamental and significant role in the domains of knowledge engineering and artificial intelligence. Recently, Large Language Models (LLMs) have emerged as a noteworthy innovation in natural language processing (NLP). However, the question of whether LLMs can effectively address the task of logical reasoning, which requires gradual cognitive inference similar to human intelligence, remains unanswered. To this end, we aim to bridge this gap and provide comprehensive evaluations in this paper. Firstly, to offer systematic evaluations, we select fifteen typical logical reasoning datasets and organize them into deductive, inductive, abductive and mixed-form reasoning settings. Considering the comprehensiveness of evaluations, we include 3 early-era representative LLMs and 4 trending LLMs. Secondly, different from previous evaluations relying only on simple metrics (e.g., accuracy), we propose fine-level evaluations in objective and subjective manners, covering both answers and explanations, including answer correctness, explain correctness, explain completeness and explain redundancy. Additionally, to uncover the logical flaws of LLMs, problematic cases will be attributed to five error types from two dimensions, i.e., evidence selection process and reasoning process. Thirdly, to avoid the influences of knowledge bias and concentrate purely on benchmarking the logical reasoning capability of LLMs, we propose a new dataset with neutral content. Based on the in-depth evaluations, this paper finally forms a general evaluation scheme of logical reasoning capability from six dimensions (i.e., Correct, Rigorous, Self-aware, Active, Oriented and No hallucination). It reflects the pros and cons of LLMs and gives guiding directions for future works. © 2023, CC BY.

关键词： Natural language processing systems

来源：评论

学校读者我要写书评

暂无评论

Ppt4j: Patch Presence Test for Java Binaries 24

Ppt4j: Patch Presence Test for Java Binaries

引用

44th ACM/IEEE International Conference on Software engineering, ICSE 2024

作者： Pan, Zhiyuan Hu, Xing Xia, Xin Zhan, Xian Lo, David Yang, Xiaohu Zhejiang University The State Key Laboratory of Blockchain and Data Security Hangzhou China Huawei Software Engineering Application Technology Lab Hangzhou China The Hong Kong Polytechnic University Hong Kong School of Computing and Information Systems Singapore Management University Singapore

ISBN: (纸本)9798400702174

The number of vulnerabilities reported in open source software has increased substantially in recent years. Security patches provide the necessary measures to protect software from attacks and vulnerabilities. In practice, it is difficult to identify whether patches have been integrated into software, especially if we only have binary files. Therefore, the ability to test whether a patch is applied to the target binary, a.k.a. patch presence test, is crucial for practitioners. However, it is challenging to obtain accurate semantic information from patches, which could lead to incorrect results. In this paper, we propose a new patch presence test framework named Ppt4j (Patch Presence Test forJava Binaries). Ppt4j is designed for open-source Java libraries. It takes Java binaries (i.e. bytecode files) as input, extracts semantic information from patches, and uses feature-based techniques to identify patch lines in the binaries. To evaluate the effectiveness of our proposed approach Ppt4j, we construct a dataset with binaries that include 110 vulnerabilities. The results show that Ppt4j achieves an F1 score of 98.5% with reasonable efficiency, improving the baseline by 14.2%. Furthermore, we conduct an in-the-wild evaluation of Ppt4j on JetBrains IntelliJ IDEA. The results suggest that a third-party library included in the software is not patched for two CVEs, and we have reported this potential security problem to the vendor. © 2024 ACM.

关键词： Open source software

来源：评论

学校读者我要写书评

暂无评论

A Semi-supervised Bilingual Lexicon Induction Method for Distant Language Pairs Based on Bidirectional Adversarial Model 12

A Semi-supervised Bilingual Lexicon Induction Method for Dis...

引用

12th IEEE International Conference on Big knowledge, ICBK 2021

作者： Zhi, Wenwu Zhang, Yuhong Key Laboratory of Knowledge Engineering With Big Data Hefei University of Technology Ministry of Education !!!School of Computer Science and Information Engineering @@@Hefei University of Technology Hefei China

ISBN: (纸本)9781665438582

Bilingual lexicon induction (BLI) can transfer knowledgefrom well- to under- resourced language, and has been widelyapplied to various NLP tasks. Recent work on BLI is projection-based that learns a mapping to connect source and target embedding spaces, with the isomorphism assumption. Unfortunately, the isomorphism assumption doesn't hold gener-ally, especially in typologically distant language pairs. Moreover, without supervised signals guiding, the training will further com-plicates BLI, making the performance of unsupervised methods unsatisfactory. To broke the restrict of isomorphism, we propose a semi-supervised method for distant BLI tasks, named A Semi-supervised Bilingual Lexicon Induction method in Latent Space based on Bidirectional Adversarial Model. First, two latent spaces are learned by two autoencoders for source and target domain independently to weaken the constraint of isomorphism in the embedding spaces. Then we add a few pairs of dictionary to learn the initial mapping to connect the Latent Space. Last, based on initial mapping, Cycle-Consistency is combined with Distance constraint constraint to maintain the geometry structure of both embedding spaces stable in the learning of bi-direction mapping based on adversarial model. By conducting extensive experiments, our method gets state-of-the-art results on most language pairs, especially with significant improvements on distant language pairs. © 2021 IEEE.

关键词： Mapping

来源：评论

学校读者我要写书评

暂无评论

arXiv

引用

arXiv 2025年

作者： Li, Yangning Kang, Hui Li, Jiahui Sun, Geng Sun, Zemin Wang, Jiacheng Zhao, Changyuan Niyato, Dusit College of Computer Science and Technology Key Laboratory of Symbolic Computation and Knowledge Engineering of Ministry of Education Jilin University Changchun130012 China College of Computer Science and Technology Jilin University Key Laboratory of Symbolic Computation and Knowledge Engineering of Ministry of Education Jilin University Changchun130012 China College of Computing and Data Science Nanyang Technological University 639798 Singapore College of Computing and Data Science Nanyang Technological University Singapore

An expansion of Internet of Things (IoTs) has led to significant challenges in wireless data harvesting, dissemination, and energy management due to the massive volumes of data generated by IoT devices. These challenges are exacerbated by data redundancy arising from spatial and temporal correlations. To address these issues, this paper proposes a novel data-driven collaborative beamforming (CB)-based communication framework for IoT networks. Specifically, the framework integrates CB with an overlap-based multi-hop routing protocol (OMRP) to enhance data transmission efficiency while mitigating energy consumption and addressing hot spot issues in remotely deployed IoT networks. Based on the data aggregation to a specific node by OMRP, we formulate a node selection problem for the CB stage, with the objective of optimizing uplink transmission energy consumption. Given the complexity of the problem, we introduce a softmax-based proximal policy optimization with long-short-term memory (SoftPPO-LSTM) algorithm to intelligently select CB nodes for improving transmission efficiency. Simulation results show that the proposed OMRP improves network lifetime by 17% compared to benchmark routing protocols, while the SoftPPO-LSTM method for CB node selection achieves an 8.3% increase in throughput over benchmark algorithms. The results also reveal that the combined OMRP with the SoftPPO- Copyright © 2025, The Authors. All rights reserved.

关键词： Deep reinforcement learning

来源：评论

学校读者我要写书评

暂无评论

Counterfactual Faithful data Generation Based on Disentangled Representation for Compound Fault Diagnosis of Rolling Bearings 3

Counterfactual Faithful Data Generation Based on Disentangle...

引用

3rd International Conference on Sensing, Measurement and data Analytics in the Era of Artificial Intelligence, ICSMD 2022

作者： Ding, Xu Zhu, Qiang Wang, Song Zhang, Yiqi Wang, Hui Xu, Juan Institute of Industry and Equipment Technology Hefei University of Technology Hefei China School of Mechanical Engineering Hefei University of Technology Hefei China Bengbu Triumph Engineering Technology Co. Ltd Bengbu China Hefei University of Technology Key Laboratory of Knowledge Engineering with Big Data School of Computer and Information Hefei China

ISBN: (纸本)9781665492812

Recently, deep learning and human-out-of-the-loop methods enjoy their prosperous applications in mechanical fault diagnosis. Nonetheless, the None-IID(independent and identically distributed) issue radicated in acquired data severely limits the stability and accuracy of compound fault diagnosis of rolling bearings. This paper proposes a sample augmentation method for generating simulated signals based on the concept of counterfactuals. Firstly, disentangled representations and counterfactual faithful theory are applied to classify the original signal into two categories of properties. One is the fault semantics encoded from the original vibration signal. And the other is the sample attribute encoded by the encoder of Variational Autoencoders (VAEs). Secondly, the counterfactual faithful pseudo-samples are conjured through the Generative Adversarial Network(GAN) using the seeds of the 'factual' sample attributes and 'counterfactual' fault semantics to compensate for the drawback of distribution shift. Finally, the original samples and pseudo-samples are used as the CNN classifier dataset to realize bearing fault diagnosis. Experiments show that this method can generate counterfactual signals that are highly consistent with the original data distribution and can achieve better classification accuracy after balancing the dataset. © 2022 IEEE.

关键词： counterfactual faithfulness fault diagnosis rolling bearing structural causal model VAEGAN

来源：评论

学校读者我要写书评

暂无评论

Unsupervised Statistical Text Simplification

引用

IEEE Transactions on knowledge and data engineering 2021年第4期33卷 1802-1806页

作者： Qiang, Jipeng Wu, Xindong Department of Computer Science Yangzhou University Yangzhou Jiangsu225127 China Key Laboratory of Knowledge Engineering with Big Data Hefei University of Technology Ministry of Education Hefei Anhui10084 China

Most recent approaches for Text Simplification (TS) have drawn on insights from machine translation to learn simplification rewrites from the monolingual parallel corpus of complex and simple sentences, yet their effectiveness strongly relies on large amounts of parallel sentences. However, there has been a serious problem haunting TS for decades, that is, the availability of parallel TS corpora is scarce or not fit for the learning task. In this paper, we will focus on one especially useful and challenging problem of unsupervised TS without a single parallel sentence. To the best of our knowledge, we present the first unsupervised text simplification system based on phrase-based machine translation system, which leverages a careful initialization of phrase tables and language models. On the widely used WikiLarge and WikiSmall benchmarks, our system respectively obtains 39.08 and 25.12 SARI points, even outperforms some supervised baselines. © 1989-2012 IEEE.

关键词： Machine translation

来源：评论

学校读者我要写书评

暂无评论

Fine-grained Cross-modal Fusion based Refinement for Text-to-Image Synthesis

arXiv

引用

arXiv 2023年

作者： Haoran, Sun Yang, Wang Haipeng, Liu Biao, Qian Meng, Wang Key Laboratory of Knowledge Engineering With Big Data Ministry of Education Hefei University of Technology Hefei China Department of Computer Science and Information Engineering Hefei University of Technology Hefei China

Text-to-image synthesis refers to generating visual-realistic and semantically consistent images from given textual descriptions. Previous approaches generate an initial low-resolution image and then refine it to be high-resolution. Despite the remarkable progress, these methods are limited in fully utilizing the given texts and could generate text-mismatched images, especially when the text description is complex. We propose a novel Fine-grained text-image Fusion based Generative Adversarial Networks, dubbed FF-GAN, which consists of two modules: Fine-grained text-image Fusion Block (FF-Block) and Global Semantic Refinement (GSR). The proposed FF-Block integrates an attention block and several convolution layers to effectively fuse the fine-grained word-context features into the corresponding visual features, in which the text information is fully used to refine the initial image with more details. And the GSR is proposed to improve the global semantic consistency between linguistic and visual features during the refinement process. Extensive experiments on CUB-200 and COCO datasets demonstrate the superiority of FF-GAN over other state-of-the-art approaches in generating images with semantic consistency to the given *** is available at htt s:// ithub com/haoranhfut/FF-GAN Copyright © 2023, The Authors. All rights reserved.

关键词： Generative adversarial networks

来源：评论

学校读者我要写书评

暂无评论

Graph-Based Exercise- and knowledge-Aware Learning Network for Student Performance Prediction 1st

Graph-Based Exercise- and Knowledge-Aware Learning Network ...

引用

1st CAAI International Conference on Artificial Intelligence, CICAI 2021

作者： Liu, Mengfan Shao, Pengyang Zhang, Kun Key Laboratory of Knowledge Engineering with Big Data Hefei University of Technology Hefei China School of Computer Science and Information Engineering Hefei University of Technology Hefei China

ISBN: (纸本)9783030930455

Predicting student performance is a fundamental task in Intelligent Tutoring Systems (ITSs), by which we can learn about students’ knowledge level and provide personalized teaching strategies for them. Researchers have made plenty of efforts on this task. They either leverage educational psychology methods to predict students’ scores according to the learned knowledge proficiency, or make full use of Collaborative Filtering (CF) models to represent latent factors of students and exercises. However, most of these methods either neglect the exercise-specific characteristics (e.g., exercise materials), or cannot fully explore the high-order interactions between students, exercises, as well as knowledge concepts. To this end, we propose a Graph-based Exercise- and knowledge-Aware Learning Network for accurate student score prediction. Specifically, we learn students’ mastery of exercises and knowledge concepts respectively to model the two-fold effects of exercises and knowledge concepts. Then, to model the high-order interactions, we apply graph convolution techniques in the prediction process. Extensive experiments on two real-world datasets prove the effectiveness of our proposed Graph-EKLN. © 2021, Springer Nature Switzerland AG.

关键词： data mining

来源：评论

学校读者我要写书评

暂无评论

TransD-based Multi-hop Meta Learning for Few-shot knowledge Graph Completion

TransD-based Multi-hop Meta Learning for Few-shot Knowledge ...

引用

International Joint Conference on Neural Networks (IJCNN)

作者： Jindi Li Kui Yu Yuling Li Yuhong Zhang Key Laboratory of Knowledge Engineering with Big Data of Ministry of Education Hefei University of Technology Hefei China School of Computer Science and Information Engineering Hefei University of Technology Hefei China

Few-shot knowledge graph completion (FKGC), which aims to infer missing facts about a relation from only a few reference triples, has recently attracted great attention. The core of solving the FKGC task is to learn a vector representation for each few-shot relation using the corresponding entity represen-tations. To this end, existing models generally enhance entity representations with their direct neighbors. However, a large number of entities have few direct neighbors. Hence, encoding only direct neighborhood is insufficient to obtain satisfactory en-tity representations. In addition, current models typically utilize static embeddings to represent entities, ignoring their diverse semantics, i.e., an entity may show distinct semantics within different few-shot relations. To address these issues, we propose a new FKGC framework, namely TransD-based Multi-hop Meta Learning (TDML). TDML consists of three main components: a multi-hop neighbor encoder to enhance entity representations by aggregating heterogeneous multi-hop neighbors, a transformer encoder to generate the relation meta representations, and a TransD-based relation representation updater that allows each entity to exhibit relation-specific semantics and tune the relation meta representations. Extensive experiments on two public datasets demonstrate that our model outperforms state-of-the-art FKGC methods.

关键词：

来源：评论

学校读者我要写书评

暂无评论

Multi-label Truth Inference for Crowdsourcing Using Mixture Models

引用

IEEE Transactions on knowledge and data engineering 2021年第5期33卷 2083-2095页

作者： Zhang, Jing Wu, Xindong School of Computer Science and Engineering Nanjing University of Science and Technology Nanjing 210094 China Key Laboratory of Knowledge Engineering with Big Data Hefei University of Technology Ministry of Education Hefei 230009 China

When acquiring labels from crowdsourcing platforms, a task may be designed to include multiple labels and the values of each label may belong to a set of various distinct options, which is the so-called multi-class multi-label annotation. To improve the quality of labels, requesters usually let one task be independently completed by a group of heterogeneous crowdsourced workers. Then, the true values of the multiple labels of each task are inferred from these repeated noisy labels. In this paper, we propose two novel probabilistic models MCMLI and MCMLD to address the multi-class multi-label inference problem in crowdsourcing. MCMLI assumes that the labels of each task are mutually independent and MCMLD utilizes a mixture of multiple independently multinoulli distributions to capture the correlation among the labels. Both models can jointly infer multiple true labels of each instance as well as estimate the reliability of crowdsourced workers modeled by a set of confusion matrices with an expectation-maximization algorithm. Experiments with three typical crowdsourcing scenarios and a real-world dataset show that our proposed models significantly outperform existing competitive alternatives. When the labels are strongly correlated, MCMLD substantially outperforms MCMLI. Furthermore, our models can be easily simplified to the one-coin models, which show more advantageous when errors are uniformly distributed, or labels are sparse. © 1989-2012 IEEE.

关键词： Crowdsourcing maximum likelihood estimation mixture models probabilistic graphical models statistical inference

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：