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

38th Conference on Neural Information Processing Systems, NeurIPS 2024

作者： Wang, Xianlong Li, Minghui Liu, Wei Zhang, Hangtao Hu, Shengshan Zhang, Yechao Zhou, Ziqi Jin, Hai National Engineering Research Center for Big Data Technology and System China Services Computing Technology and System Lab China Cluster and Grid Computing Lab China Hubei Engineering Research Center on Big Data Security China Hubei Key Laboratory of Distributed System Security China School of Cyber Science and Engineering Huazhong University of Science and Technology China School of Software Engineering Huazhong University of Science and Technology China School of Computer Science and Technology Huazhong University of Science and Technology China

Traditional unlearnable strategies have been proposed to prevent unauthorized users from training on the 2D image data. With more 3D point cloud data containing sensitivity information, unauthorized usage of this new type data has also become a serious concern. To address this, we propose the first integral unlearnable framework for 3D point clouds including two processes: (i) we propose an unlearnable data protection scheme, involving a class-wise setting established by a category-adaptive allocation strategy and multi-transformations assigned to samples;(ii) we propose a data restoration scheme that utilizes class-wise inverse matrix transformation, thus enabling authorized-only training for unlearnable data. This restoration process is a practical issue overlooked in most existing unlearnable literature, i.e., even authorized users struggle to gain knowledge from 3D unlearnable data. Both theoretical and empirical results (including 6 datasets, 16 models, and 2 tasks) demonstrate the effectiveness of our proposed unlearnable framework. Our code is available at https://***/CGCL-codes/UnlearnablePC. © 2024 Neural information processing systems foundation. All rights reserved.

关键词：

来源：评论

学校读者我要写书评

暂无评论

TrustUQA: A Trustful Framework for Unified Structured data Question Answering 39

TrustUQA: A Trustful Framework for Unified Structured Data Q...

引用

39th Annual AAAI Conference on Artificial Intelligence, AAAI 2025

作者： Zhang, Wen Jin, Long Zhu, Yushan Chen, Jiaoyan Huang, Zhiwei Wang, Junjie Hua, Yin Liang, Lei Chen, Huajun Zhejiang University China University of Manchester United Kingdom Ant Group China ZJU-Ant Group Joint Lab of Knowledge Graph China Zhejiang Key Laboratory of Big Data Intelligent Computing China

ISBN: (纸本)157735897X

Natural language question answering (QA) over structured data sources such as tables and knowledge graphs have been widely investigated, especially with Large Language Models (LLMs) in recent years. The main solutions include question to formal query parsing and retrieval-based answer generation. However, current methods of the former often suffer from weak generalization, failing to dealing with multi-types of sources, while the later is limited in trustfulness. In this paper, we propose TrustUQA, a trustful QA framework that can simultaneously support multiple types of structured data in a unified way. To this end, it adopts an LLM-friendly and unified knowledge representation method called Condition Graph (CG), and uses an LLM and demonstration-based two-level method for CG querying. For enhancement, it is also equipped with dynamic demonstration retrieval. We have evaluated TrustUQA with 5 benchmarks covering 3 types of structured data. It outperforms 2 existing unified structured data QA methods. In comparison with the baselines that are specific to one data type, it achieves state-of-the-art on 2 of the datasets. Further more, we have demonstrated the potential of our method for more general QA tasks, QA over mixed structured data and QA across structured data. © 2025, Association for the Advancement of Artificial Intelligence (***). All rights reserved.

关键词： Structured Query Language

来源：评论

学校读者我要写书评

暂无评论

Refining Idioms Semantics Comprehension via Contrastive Learning and Cross-Attention 30

Refining Idioms Semantics Comprehension via Contrastive Lear...

引用

Joint 30th International Conference on Computational Linguistics and 14th International Conference on Language Resources and Evaluation, LREC-COLING 2024

作者： Wu, Mingmin Su, Guixin Zhang, Yongcheng Huang, Zhongqiang Sha, Ying College of Informatics Huazhong Agricultural University Wuhan China Key Laboratory of Smart Farming for Agricultural Animals Wuhan China Hubei Engineering Technology Research Center of Agricultural Big Data Wuhan China Engineering Research Center of Intelligent Technology for Agriculture Ministry of Education China

ISBN: (纸本)9782493814104

Chinese idioms on social media demand a nuanced understanding for correct usage. The Chinese idiom cloze test poses a unique challenge for machine reading comprehension due to the figurative meanings of idioms deviating from their literal interpretations, resulting in a semantic bias in models' comprehension of idioms. Furthermore, given that the figurative meanings of many idioms are similar, their use as suboptimal options can interfere with optimal selection. Despite achieving some success in the Chinese idiom cloze test, existing methods based on deep learning still struggle to comprehensively grasp idiom semantics due to the aforementioned issues. To tackle these challenges, we introduce a Refining Idioms Semantics Comprehension Framework (RISCF) to capture the comprehensive idioms semantics. Specifically, we propose a semantic sense contrastive learning module to enhance the representation of idiom semantics, diminishing the semantic bias between figurative and literal meanings of idioms. Meanwhile, we propose an interference-resistant cross-attention module to attenuate the interference of suboptimal options, which considers the interaction between the candidate idioms and the blank space in the context. Experimental results on the benchmark datasets demonstrate the effectiveness of our RISCF model, significantly outperforming state-of-the-art methods. © 2024 ELRA Language Resource Association: CC BY-NC 4.0.

关键词： Semantics

来源：评论

学校读者我要写书评

暂无评论

A Time-Efficient Distributed Constant Conditional Functional Dependency Discovery Algorithm for data Consistency

A Time-Efficient Distributed Constant Conditional Functional...

引用

IEEE Annual International Computer Software and Applications Conference (COMPSAC)

作者： Junchao Chen Jian-tao Zhou Xinyu Hao Inner Mongolia Engineering Laboratory for Cloud Computing and Service Software Inner Mongolia Key Laboratory of Social Computing and Data Processing Inner Mongolia Engineering Laboratory for Big Data Analysis Technology College of Computer Science Inner Mongolia University Engineering Research Center of Ecological Big Data Ministry of Education National & Local Joint Engineering Research Center of Intelligent Information Processing Technology for Mongolian Hohhot China

ISBN: (数字)9798350376968

ISBN: (纸本)9798350376975

The accuracy of data analysis depends on data quality, and addressing data consistency issues is a key challenge to improve it. Constant Conditional Functional Dependency (CCFD) is an effective approach that ensures data consistency by enforcing bindings of semantically related values, thus providing quality assurance for data analysis and decision-making processes. However, with the growth of data scale, especially the increasing number of data tuples and attributes, existing single-machine CCFD discovery algorithms face issues of low computational efficiency and lengthy computation time. This paper proposes a time-efficient distributed CCFD discovery algorithm (DCCFD). Through the optimization of data preprocessing and index mapping, the data organization structure is enhanced, laying the foundation for the discovery of CCFDs under distributed conditions. The Spark parallel computing framework is used to partition the dataset, which accelerates the parallel loading and processing of data. Additionally, this algorithm ensures accuracy and processing speed when discovering dependencies by efficiently generating frequent itemsets and verifying CCFDs in parallel. Experiments on multiple real datasets show that, especially with the complex Airline dataset, the DCCFD algorithm not only accurately discovers CCFDs, but also reduces the average running time by 75.64% compared with the preCFDMiner algorithm.

关键词： Accuracy data preprocessing Software algorithms Distributed databases Parallel processing Software Partitioning algorithms

来源：评论

学校读者我要写书评

暂无评论

Propelling Pedagogical Paradigms: A Study of Advanced Human-Computer Interaction Learning in data Structure and Algorithms Based on Virtual Reality Technology 18th

Propelling Pedagogical Paradigms: A Study of Advanced Human-...

引用

18th International Conference on Computer Science and Education, ICCSE 2023

作者： Yahui, Yang Yanxia, Gao Ling, Peng Yingxi, Xiang Huan, He Yiwen, Liu School of Computer and Artificial Intelligence Huaihua University Hunan Huaihua418000 China Key Laboratory of Wuling-Mountain Health Big Data Intelligent Processing and Application in Hunan Province Universities Hunan Huaihua418000 China Key Laboratory of Intelligent Control Technology for Wuling-Mountain Ecological Agriculture in Hunan Province Hunan Huaihua418000 China School of Fine Arts and Design Huaihua University Hunan Huaihua418000 China

ISBN: (纸本)9789819707362

data Structure and Algorithms (DSA) is a course with strong practice and abstract theoretical knowledge. In view of the complexity of the knowledge points of the course and the difficulty of understanding, we design and implement a virtual simulation experiment teaching system of the course--Virtual simulation experiment platform. In this platform, DSA through simulation practice into animation effects, and combined with the unity engine and C# code to achieve user interaction, to provide users with a way to intuitively understand the principles of DSA, while increasing the user’s subjective initiative to learn, and to achieve the high level, Innovative and challenging teaching classroom, so that students in colleges and universities can feel relaxed and happy in the process of learning this course. What is more, they can better accept and understand DSA. © The Author(s), under exclusive license to Springer Nature Singapore Pte Ltd. 2024.

关键词： data structures

来源：评论

学校读者我要写书评

暂无评论

MedX-Net: Hierarchical Transformer with Large Kernel Convolutions for 3D Medical Image Segmentation

MedX-Net: Hierarchical Transformer with Large Kernel Convolu...

引用

2024 IEEE International Conference on Systems, Man, and Cybernetics, SMC 2024

作者： Lu, Lin Zou, Qingzhi Key Laboratory of Computing Power Network and Information Se-curity Ministry of Education Shandong Computer Science Center Jinan China Shandong Engineering Research Center of Big Data Applied Technology Faculty of Computer Science and Technology Jinan China Shandong Provincial Key Laboratory of Computer Networks Shandong Fundamental Research Center for Computer Science Jinan China

ISBN: (纸本)9781665410205

Due to the exceptional performance of Transform-ers in 2D medical image segmentation, recent work has also introduced them into 3D medical segmentation tasks. For instance, Swin UNETR and other hierarchical Transformers have reintroduced prior knowledge from several convolutional networks, further enhancing the volume segmentation capabilities of models. The efficacy of these hybrid methodologies is primarily attributed to the substantial quantity of parameters and the nonlocal self-attention mechanism with a large receptive field. We argue that the behavior of these methods' large receptive fields can be simulated by employing fewer parameters through the utilization of depth-wise convolutions with large kernel. Within this manuscript, we introduce a lightweight volume segmentation model called MedX-Net, which uses convolutional network modules to simulate hierarchical Transformers for robust volume segmentation. Firstly, inspired by the hierarchical Transformer module of Swin UNETR, we investigate large-kernel depth-wise convolutions with different sizes to achieve a reduced model parameter count while maintaining a large global receptive field. Secondly, we replace the multilayer perceptron (MLP) in the hierarchical Transformer module with Inverted Bottleneck with Depthwise Convolution Enhancement(DWCE) to improve model performance with fewer activation and normalization layers, further reducing the parameter count. We validate the effectiveness and efficiency of our model for volume segmentation on three public datasets: Synapse, BTCV and ACDC. On the Synapse dataset, compared to Swin UNETR, our model achieves an improvement from 83.48% to 87.21% in Dice score. Compared to the result of 86.57% achieved by nnFormer, our model achieves superior performance while reducing the model parameter count by 64%. © 2024 IEEE.

关键词： Image segmentation

来源：评论

学校读者我要写书评

暂无评论

MANN-TYPE INERTIAL SUBGRADIENT EXTRAGRADIENT METHODS FOR BILEVEL EQUILIBRIUM PROBLEMS

引用

UPB Scientific Bulletin, Series A: Applied Mathematics and Physics 2022年第4期84卷 19-32页

作者： Ceng, Lu-Chuan Zhu, Li-Jun Yao, Zhangsong Department of Mathematics Shanghai Normal University Shanghai200234 China The Key Laboratory of Intelligent Information and Big Data Processing of NingXia North Minzu University Yinchuan750021 China School of Information Engineering Nanjing Xiaozhuang University Nanjing211171 China

In this paper, we introduce and analyze two Mann-type implicit inertial sub-gradient extragradient algorithms for solving the monotone bilevel equilibrium problem with a general system of variational inclusions and a common fixed-point problem of a finite family of strict pseudocontraction mappings and an asymptotically nonexpansive mapping constraints. Some strong convergence theorems for the proposed algorithms are established under the suitable assumptions. © 2022, Politechnica University of Bucharest. All rights reserved.

关键词： Variational techniques

来源：评论

学校读者我要写书评

暂无评论

A topic detection method based on KM-LSH Fusion algorithm and improved BTM model

引用

Soft computing 2024年第19期28卷 11421-11438页

作者： Liu, Wenjun Guo, Huan Gan, Jiaxin Wang, Hai Wang, Hailan Zhang, Chao Peng, Qingcheng Sun, Yuyan Yu, Bao Hou, Mengshu Li, Bo Li, Xiaolei School of Computer and Software Engineering XiHua University Chengdu610039 China Chengdu611731 China Intelligent Policing Key Laboratory of Sichuan Province Sichuan Police College Luzhou646000 China School of Big Data and Artificial Intelligence Chengdu Technological University Chengdu611730 China Sichuan Provincial Engineering Research Center of Hydroelectric Energy Power Equipment Technology Chengdu610039 China

Topic detection is an information processing technology designed to help people deal with the growing problem of data information on the Internet. In the research literature, topic detection methods are used for topic classification through word embedding, supervised-based and unsupervised-based approaches. However, most methods for topic detection only address the problem of clustering and do not focus on the problem of topic detection accuracy reduction due to the cohesiveness of topics. Also, the sequence of biterm during topic detection can cause substantial deviations in the detected topic content. To solve the above problems, this paper proposes a topic detection method based on KM-LSH fusion algorithm and improved BTM model. KM-LSH fusion algorithm is a fusion algorithm that combines K-means clustering and LSH refinement clustering. The proposed method can solve the problem of cohesiveness of topic detection, and the improved BTM model can solve the influence of the sequence of biterm on topic detection. First, the text vector is constructed by processing the collected set of microblog texts using text preprocessing methods. Secondly, the KM-LSH fusion algorithm is used to calculate text similarity and perform topic clustering and refinement. Finally, the improved BTM model is used to model the texts, which is combined with the word position and the improved TF-IDF weight calculation algorithm to adjust the microblogging texts in clustering. The experiment results indicate that the proposed KM-LSH-IBTM method improves the evaluation indexes compared with the other three topic detection methods. In conclusion, the proposed KM-LSH-IBTM method promotes the processing capability of topic detection in terms of cohesiveness and the sequence of biterm. © The Author(s), under exclusive licence to Springer-Verlag GmbH Germany, part of Springer Nature 2024.

关键词： K-means clustering

来源：评论

学校读者我要写书评

暂无评论

A New Approach to the Position of Acupoints on the Back of Humans

引用

Recent Patents on Mechanical Engineering 2023年第2期16卷 150-162页

作者： Xie, Shenglong Liu, Zijing Zhang, Liangan Song, Fengfeng Key Laboratory of Intelligent Manufacturing Quality Big Data Tracking and Analysis of Zhejiang Province China Jiliang University Zhejiang Hangzhou310018 China Anhui Engineering Laboratory for Intelligent Applications and Security of Industrial Internet Anhui University of Technology Anhui Ma’anshan243032 China Hangzhou Qiandaohu Ruichun Robot Research Institute Co. Ltd Zhejiang Hangzhou310018 China Zhejiang Shusi Robot Co. Ltd Zhejiang Huzhou313000 China

Aim: In order to realize the position of acupoints on the back of humans, a new acupoints positioning approach combined with machine vision technology is proposed in this paper. Background: The acupuncture point (acupoint) is an important reference in the treatment of Traditional Chinese Medicine (TCM). However, the traditional acupoints positioning method mainly depends on manpower, which has the disadvantages of low efficiency and relying on practical experience heavily. Objective: In order to realize the position of acupoints on the back of humans, a new acupoints positioning approach combined with machine vision technology is proposed in this paper. Methods: Firstly, the distribution of acupoints on the back of humans are determined according to the meridian theory, and the coordinate of each acupoint are established based on the approach of fingercun measurement, after review of previous literature and patents. Secondly, the principle of the proposed acupoints positioning method is introduced based on the skeleton model of humans. Finally, the effec-tiveness of the proposed approach is validated by experimental testing. Results: The value of emax is around 3.5mm and those of emae and erms are smaller than 0.25mm and 0.45mm, respectively. Conclusion: The experimental results prove that the proposed approach possesses the capability of good adaptive capability and high. © 2023 Bentham Science Publishers.

关键词： Computer vision

来源：评论

学校读者我要写书评

暂无评论

Graph Coarsening via Supervised Granular-Ball for Scalable Graph Neural Network Training

arXiv

引用

arXiv 2024年

作者： Xia, Shuyin Ma, Xinjun Liu, Zhiyuan Liu, Cheng Zhao, Sen Wang, Guoyin Key Laboratory of Big Data Intelligent Computing China Chongqing Key Laboratory of Computational Intelligence China Chongqing University of Posts and Telecommunications Chongqing China National Center for Applied Mathematics in Chongqing Chongqing Normal University Chongqing401331 China

Graph Neural Networks (GNNs) have demonstrated significant achievements in processing graph data, yet scalability remains a substantial challenge. To address this, numerous graph coarsening methods have been developed. However, most existing coarsening methods are training-dependent, leading to lower efficiency, and they all require a predefined coarsening rate, lacking an adaptive approach. In this paper, we employ granular-ball computing to effectively compress graph data. We construct a coarsened graph network by iteratively splitting the graph into granular-balls based on a purity threshold and using these granular-balls as super vertices. This granulation process significantly reduces the size of the original graph, thereby greatly enhancing the training efficiency and scalability of GNNs. Additionally, our algorithm can adaptively perform splitting without requiring a predefined coarsening rate. Experimental results demonstrate that our method achieves accuracy comparable to training on the original graph. Noise injection experiments further indicate that our method exhibits robust performance. Moreover, our approach can reduce the graph size by up to 20 times without compromising test accuracy, substantially enhancing the scalability of GNNs. Copyright © 2024, The Authors. All rights reserved.

关键词： Graph neural networks

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：