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

arXiv 2024年

作者： Li, Qian Guo, Shu Chen, Yingjia Ji, Cheng Sheng, Jiawei Li, Jianxin Beijing Advanced Innovation Center for Big Data and Brain Computing Beihang University Beijing100083 China The State Key Laboratory of Software Development Environment Beihang University Beijing100083 China National Computer Network Emergency Response Technical Team Coordination Center of China Beijing100083 China School of Mathematics Edinburgh University Edinburgh United Kingdom Institute of Information Engineering Chinese Academy of Sciences Beijing100083 China School of Cyber Security University of Chinese Academy of Sciences Beijing100083 China

Few-shot knowledge graph completion (FKGC) aims to query the unseen facts of a relation given its few-shot reference entity pairs. The side effect of noises due to the uncertainty of entities and triples may limit the few-shot learning, but existing FKGC works neglect such uncertainty, which leads them more susceptible to limited reference samples with noises. In this paper, we propose a novel uncertainty-aware few-shot KG completion framework (UFKGC) to model uncertainty for a better understanding of the limited data by learning representations under Gaussian distribution. Uncertainty representation is first designed for estimating the uncertainty scope of the entity pairs after transferring feature representations into a Gaussian distribution. Further, to better integrate the neighbors with uncertainty characteristics for entity features, we design an uncertainty-aware relational graph neural network (UR-GNN) to conduct convolution operations between the Gaussian distributions. Then, multiple random samplings are conducted for reference triples within the Gaussian distribution to generate smooth reference representations during the optimization. The final completion score for each query instance is measured by the designed uncertainty optimization to make our approach more robust to the noises in few-shot scenarios. Experimental results show that our approach achieves excellent performance on two benchmark datasets compared to its competitors. Copyright © 2024, The Authors. All rights reserved.

关键词： Graph neural networks

来源：评论

学校读者我要写书评

暂无评论

ResfEANet: ResNet-fused External Attention network for Tuberculosis Diagnosis using Chest X-ray Images

引用

computer Methods and Programs in Biomedicine Update 2024年 5卷

作者： Ejiyi, Chukwuebuka Joseph Qin, Zhen Nnani, Ann O Deng, Fuhu Ejiyi, Thomas Ugochukwu Ejiyi, Makuachukwu Bennedith Agbesi, Victor Kwaku Bamisile, Olusola Network and Data Security Key Laboratory of Sichuan Province University of Electronic Science and Technology of China Chengdu China College of Environmental Science and Engineering Hohai University Nanjing China Department of Pure and Industrial Chemistry University of Nigeria Nsukka Enugu Nigeria Pharmacy Department University of Nigeria Nsukka Enugu Nigeria School of Computer Science and Engineering University of Electronic Science and Technology of China Chengdu China Sichuan Industrial Internet Intelligent Monitoring and Application Engineering Technology Research Centre Chengdu University of Technology Chengdu China

Pulmonary tuberculosis (TB), the most prevalent form of TB, remains a major global public health concern, contributing to more than a million deaths each year. The accurate and timely diagnosis of this disease is of paramount importance for effective control and treatment. Chest X-ray (CXR) images have emerged as a valuable tool for screening lung diseases, including TB, owing to their cost-effectiveness and non-invasiveness. Despite advancements in technology, the challenges associated with interpreting CXR images persist, primarily due to the scarcity of trained radiologists. This underscores the pressing need for an automated and cost-effective computer-aided system capable of diagnosing TB, assisting medical practitioners in distinguishing between TB-positive and negative CXR scans. In response to this need, we introduce an innovative approach called ResNet-fused External Attention network (ResfEANet). This network excels in accurately classifying TB from CXR images, achieving remarkable levels of accuracy and sensitivity. ResfEANet is built upon ResNet and incorporates an External Attention mechanism, albeit with fewer residual network blocks than ResNet-50 resulting in a relatively shallow network with fewer layers. This approach proves highly effective in feature extraction and yields competitive results in the classification of TB. Our method was employed to train a model that demonstrated an impressive accuracy rate of 97.59% and a remarkable sensitivity of 100% in binary classification tasks with optimal computational cost. These outcomes suggest that our proposed approach has the potential to serve as a valuable secondary tool in clinical decision-making, providing crucial assistance to radiologists and healthcare professionals. © 2023

关键词： Chest X-ray images External Attention ResfEANet ResNet Tuberculosis

来源：评论

学校读者我要写书评

暂无评论

A Secure Beamforming Design: When Fluid Antenna Meets NOMA

arXiv

引用

arXiv 2024年

作者： Mai, Lifeng Yao, Junteng Tang, Jie Wu, Tuo Wong, Kai-Kit Shin, Hyundong Adachi, Fumiyuki The Electric Power Research Institute China Southern Power Grid Guangzhou510663 China The Guangdong Provincial Key Laboratory of Power System Network Security Guangdong Guangzhou China The Faculty of Electrical Engineering and Computer Science Ningbo University Ningbo315211 China The School of Electronic and Information Engineering South China University of Technology Guangzhou510006 China The School of Electrical and Electronic Engineering Nanyang Technological University 639798 Singapore The Department of Electronic and Electrical Engineering University College London Torrington Place WC1E 7JE United Kingdom The Department of Electronic Engineering Kyung Hee University Gyeonggi-do Yongin-si17104 Korea Republic of Tohoku University Sendai Japan

This letter proposes a secure beamforming design for downlink non-orthogonal multiple access (NOMA) systems utilizing fluid antenna systems (FAS). We consider a setup where a base station (BS) with M fluid antennas (FAs) communicates to a cell-center user (CU) and a cell-edge user (CEU), each with a FA. The CU is the intended recipient while the CEU is regarded as a potential eavesdropper. Our aim is to maximize the achievable secrecy rate by jointly optimizing the secure beamforming vectors and the positions of FAs. To tackle this, we adopt an alternating optimization (AO) algorithm that optimizes secure beamforming and the positions of the FAs iteratively while keeping the other variables fixed. Numerical results illustrate that when FAs meet NOMA, the proposed scheme greatly enhances the secrecy rate compared to conventional multiple-input single-output (MISO) fixed antenna NOMA systems and other benchmark schemes. © 2024, CC BY.

关键词： Beamforming

来源：评论

学校读者我要写书评

暂无评论

Intelligent decoding method for Ground-penetrating radar based on improved YOLOv5

Intelligent decoding method for Ground-penetrating radar bas...

引用

computer, Big Data and Artificial Intelligence (ICCBD+AI), International Conference on

作者： ZeYu Chen YongKang Wang HongLiang Liu Chuan Wang XinBo Jiang Ning Zhang Zhen Huang Lei Jiang Key Laboratory of Computing Power Network and Information Security Ministry of Education Shandong Computer Science Center (National Supercomputer Center in Jinan) Qilu University of Technology (Shandong Academy of Sciences) JiNan China Technological Innovation Department Shandong Hi-Speed Group Co Ltd JiNan China School of Qilu Transportation Shandong University JiNan China No.1 Engineering Development Co. Ltd. of China Railway 14Th Bureau Group RiZhao China

ISBN: (数字)9798331533991

ISBN: (纸本)9798331534004

Ground-penetrating radar (GPR) is a non-invasive detection technique that effectively gathers information about subsurface materials. In tunneling projects, GPR can provide a fast and accurate forecast of the geological conditions in front of tunnel boring, which provides an important reference basis for tunnel construction. Currently, the interpretation of GPR images relies heavily on manual expertise, resulting in low efficiency and minimal automation. This creates an urgent need for effective and accurate identification of poor geological conditions depicted in radar images. In this study, we present the GPR-YOLOv5 model, which is designed to detect unfavorable geologic features ahead of the tunnel face from GPR images. We enhance this model with the CA attention mechanism, GSConv module, ghostC3 module, and the VariFocal loss function to improve decoding accuracy while minimizing computational load. Additionally, we integrate this algorithm with established modern object detection techniques, and our experimental results demonstrate its effectiveness.

关键词： YOLO Accuracy Ground penetrating radar Attention mechanisms Geology Computational modeling Radar imaging Tunneling Decoding Load modeling

来源：评论

学校读者我要写书评

暂无评论

A permission generation and configuration method based on Rules and FP-Growth algorithm

A permission generation and configuration method based on Ru...

引用

International Conference on networking and network Applications (NaNA)

作者： Lei Zhu Ziheng Zhang Xinhong Hei Yichuan Wang Ziliang Yang Feixiong Hu Ping He School of Computer Science and Engineering Xi’an University of technology1 Xi’an Shaanxi China Shaanxi Key Laboratory for Network Computing and Security Technology Xi’an Shaanxi China Shenzhen Tencent Computer System Co. Ltd Shenzhen China

With the development of computer technology, lots of enterprises had begun to build a data platform, and the data and its services already paly the import role in enterprises. However, the guarantee the data security is the primary task of platform, and data access control, especially the fine-grained access control model, had become an important means to enhance the security of platform. In this paper, we propose a data access permission configuration method based on rules and FP-growth. Specifically, FP-Growth algorithm is first used to obtain the frequent items and the association relations of data, which can be transformed into the enumerable permission configuration items. Then, the correspondence and frequency of data items are calculated to acquire the frequent items, the permission configuration acting on the data table columns is obtained according to the frequency of used data items. By filtering the strong association relation, the data items that are more closely related in the association relation and the corresponding data item values are finally obtained, and they are converted into the permission configuration that acts on the rows of the data table. The proposed method has been tested and verified to meet business needs, and the performance consumption is below the threshold. Moreover, it is feasible to utilize classical data mining algorithms to generate permission configuration, which has begun to apply the Blueking Data Platform.

关键词： Access control Law enforcement Filtering Data security Soft sensors Feature extraction Transformers

来源：评论

学校读者我要写书评

暂无评论

Enhanced competitive swarm optimizer for multi-task optimization 9

Enhanced competitive swarm optimizer for multi-task optimiza...

引用

9th International Conference on Computing and Pattern Recognition, ICCPR 2020

作者： Li, Wei Yuan, Junqing Luo, Haonan Lei, Zhou Xu, Qingzheng School of Computer Science and Engineering Xi'An University of Technology Xi'an710048 China Shaanxi Key Laboratory for Network Computing and Security Technology Xi'an710048 China College of Information and Communication National University of Defense Technology Xi'an710106 China

ISBN: (纸本)9781450387835

In the real world, many problems possess the high degree of similarity. Inspired by multifactorial inheritance model, evolutionary multi-task optimization paradigm is proposed to simultaneously solve multiple optimization problems. However, experimental results have revealed that the performance of multifactorial evolutionary algorithm deteriorates with negative knowledge transfer between uncorrelated tasks. To alleviate this issue, we proposed an enhanced competitive swarm optimizer to explore the generality of the multitasking paradigm. A new velocity update mechanism for losers is proposed to improve the search ability. Further, a mating approach is proposed to transfer implicit knowledge among tasks for generating offspring. Experimental and statistical analyses are performed on CEC2017 evolutionary multitask optimization competition. Results show that the proposed algorithm is competitive in comparison with other state-of-the-art multifactorial optimization algorithms. © 2020 ACM.

关键词： Evolutionary algorithms

来源：评论

学校读者我要写书评

暂无评论

Towards Efficient Co-audit of Privacy-Preserving Data on Consortium Blockchain via Group Key Agreement

Towards Efficient Co-audit of Privacy-Preserving Data on Con...

引用

International Conference on Mobile Ad-hoc and Sensor networks, MSN

作者： Xiaoyan Hu Xiaoyi Song Guang Cheng Jian Gong Lu Yang Honggang Chen Zhichao Liang School of Cyber Science & Engineering Southeast University Nanjing China Ministry of Education Key Laboratory of Computer Network and Information Integration (Southeast University) China Research Base of International Cyberspace Governance (Southeast University) Nanjing China Purple Mountain Laboratories for Network and Communication Security Nanjing China Jiangsu Province Engineering Research Center of Security for Ubiquitous Network Nanjing China JiangSu Peerfintech Technology Co. Ltd.

ISBN: (纸本)9781665406697

Blockchain is well known for its storage consistency, decentralization and tamper-proof, but the privacy disclosure and difficulty in auditing discourage the innovative application of blockchain technology. As compared to public blockchain and private blockchain, consortium blockchain is widely used across different industries and use cases due to its privacy-preserving ability, auditability and high transaction rate. However, the present co-audit of privacy-preserving data on consortium blockchain is inefficient. Private data is usually encrypted by a session key before being published on a consortium blockchain for privacy preservation. The session key is shared with transaction parties and auditors for their access. For decentralizing auditorial power, multiple auditors on the consortium blockchain jointly undertake the responsibility of auditing. The distribution of the session key to an auditor requires individually encrypting the session key with the public key of the auditor. The transaction initiator needs to be online when each auditor asks for the session key, and one encryption of the session key for each auditor consumes resources. This work proposes GAChain and applies group key agreement technology to efficiently co-audit privacy-preserving data on consortium blockchain. Multiple auditors on the consortium blockchain form a group and utilize the blockchain to generate a shared group encryption key and their respective group decryption keys. The session key is encrypted only once by the group encryption key and stored on the consortium blockchain together with the encrypted private data. Auditors then obtain the encrypted session key from the chain and decrypt it with their respective group decryption key for co-auditing. The group key generation is involved only when the group forms or group membership changes, which happens very infrequently on the consortium blockchain. We implement the prototype of GAChain based on Hyperledger Fabric framework. Our

关键词： Industries Privacy Data privacy Distributed ledger Public key Prototypes Fabrics

来源：评论

学校读者我要写书评

暂无评论

The Initial Screening of Laryngeal Tumors via Voice Acoustic Analysis Based on Siamese network Under Small Samples

引用

Journal of Voice 2025年

作者： You, Zhenzhen Sun, Delong Shi, Zhenghao Du, Shuangli Hei, Xinhong Kong, Demin Du, Xiaoying Yan, Jing Ren, Xiaoyong Hou, Jin Shaanxi Key Laboratory for Network Computing and Security Technology School of Computer Science and Engineering Xi'an University of Technology Xi'an China Department of Otolaryngology Second Affiliated Hospital of Medical College Xi'an Jiaotong University Xi'an China

Objective: The initial screening of laryngeal tumors via voice acoustic analysis is based on the clinician's experience that is subjective. This article introduces a Siamese network with an auxiliary gender classifier for automated, accurate, and objective initial screening of laryngeal tumors based on voice signals. Methods: The study involved 71 tumor patients and 293 non-tumor subjects of Chinese Mandarin. This dataset was divided into a training set and a test set in a ratio of 4:1. We applied nine data augmentation techniques to enlarge the voice training set and extracted the corresponding mel-frequency cepstral coefficients (MFCC) maps. The MFCC maps were randomly paired and fed into the proposed Siamese network to achieve multitask classification for tumor and non-tumor, woman and man. The performance of the proposed model was compared with one machine learning method and six classical deep learning models with and without the auxiliary gender classifier. Results: Experiments demonstrate the superiority of the proposed network compared with the reference models. The proposed model achieved an overall accuracy of 0.9437, an F score of 0.8462, a precision of 0.9167, a sensitivity of 0.7857, and a specificity of 0.9825. Conclusion: The proposed network can assist in the initial screening of laryngeal tumors through voice acoustic analysis. The initial screening solely through voice acoustic analysis can help individuals seek medical assistance outside the hospitals and reduce the burden on doctors as well. © 2025

关键词： Initial screening of laryngeal tumors—Voice acoustic analysis—Mel-frequency cepstral coefficients—Siamese network

来源：评论

学校读者我要写书评

暂无评论

Noise-Tolerant Learning for Audio-Visual Action Recognition

arXiv

引用

arXiv 2022年

作者： Han, Haochen Zheng, Qinghua Luo, Minnan Miao, Kaiyao Tian, Feng Chen, Yan The National Engineering Lab for Big Data Analytics Xi’an Jiaotong University Xi’an710049 China The School of Computer Science and Technology Xi’an Jiaotong University Xi’an710049 China The Key Laboratory of Intelligent Networks and Network Security Xi’an Jiaotong University Ministry of Education Xi’an710049 China The School of Cyber Science and Engineering Xi’an Jiaotong University Xi’an710049 China

Recently, video recognition is emerging with the help of multi-modal learning, which focuses on integrating distinct modalities to improve the performance or robustness of the model. Although various multi-modal learning methods have been proposed and offer remarkable recognition results, almost all of these methods rely on high-quality manual annotations and assume that modalities among multi-modal data provide semantically relevant information. Unfortunately, the widely used video datasets are usually coarse-annotated or collected from the Internet. Thus, it inevitably contains a portion of noisy labels and noisy correspondence. To address this challenge, we use the audio-visual action recognition task as a proxy and propose a noise-tolerant learning framework to find anti-interference model parameters against both noisy labels and noisy correspondence. Specifically, our method consists of two phases that aim to rectify noise by the inherent correlation between modalities. First, a noise-tolerant contrastive training phase is performed to make the model immune to the possible noisy-labeled data. Despite the benefits brought by contrastive training, it would overfit the noisy correspondence and thus provide false supervision. To alleviate the influence of noisy correspondence, we propose a cross-modal noise estimation component to adjust the consistency between different modalities. As the noisy correspondence existed at the instance level, we further propose a category-level contrastive loss to reduce its interference. Second, in the hybrid-supervised training phase, we calculate the distance metric among features to obtain corrected labels, which are used as complementary supervision to guide the training. Furthermore, due to the lack of suitable datasets, we establish a benchmark of real-world noisy correspondence in audio-visual data by relabeling the Kinetics dataset. Extensive experiments on a wide range of noisy levels demonstrate that our method significant

关键词： Modal analysis

来源：评论

学校读者我要写书评

暂无评论

Disentangled Representation Learning with Transmitted Information Bottleneck

arXiv

引用

arXiv 2023年

作者： Dang, Zhuohang Luo, Minnan Jia, Chengyou Dai, Guang Wang, Jihong Chang, Xiaojun Wang, Jingdong The School of Computer Science and Technology The Ministry of Education Key Laboratory of Intelligent Networks and Network Security The Shaanxi Province Key Laboratory of Big Data Knowledge Engineering Xi'an Jiaotong University Shaanxi Xi’an710049 China The SGIT AI Laboratory Xi’an710048 China The State Grid Shaanxi Electric Power Company Ltd. State Grid Corporation of China Xi’an710048 China The School of Information Science and Technology University of Science and Technology of China Hefei230026 China Abu Dhabi United Arab Emirates Baidu Inc Beijing100085 China

Encoding only the task-related information from the raw data, i.e., disentangled representation learning, can greatly contribute to the robustness and generalizability of models. Although significant advances have been made by regularizing the information in representations with information theory, two major challenges remain: 1) the representation compression inevitably leads to performance drop;2) the disentanglement constraints on representations are in complicated optimization. To these issues, we introduce Bayesian networks with transmitted information to formulate the interaction among input and representations during disentanglement. Building upon this framework, we propose DisTIB (Transmitted Information Bottleneck for Disentangled representation learning), a novel objective that navigates the balance between information compression and preservation. We employ variational inference to derive a tractable estimation for DisTIB. This estimation can be simply optimized via standard gradient descent with a reparameterization trick. Moreover, we theoretically prove that DisTIB can achieve optimal disentanglement, underscoring its superior efficacy. To solidify our claims, we conduct extensive experiments on various downstream tasks to demonstrate the appealing efficacy of DisTIB and validate our theoretical analyses. Copyright © 2023, The Authors. All rights reserved.

关键词： Information theory

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：