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

Medical Artificial Intelligence (MedAI), IEEE International Conference on

作者： Xiulin Zheng Zan Zhang Rui Li Xindong Wu Key Laboratory of Knowledge Engineering with Big Data (the Ministry of Education of China) and also with the School of Computer Science and Information Engineering Hefei University of Technology Hefei Anhui China Inspur Academy of Science and Technology Shandong China

ISBN: (数字)9798350377613

ISBN: (纸本)9798350377620

knowledge graphs (KGs) play an increasingly im-portant role in many knowledge-aware tasks. However, existing KGs are struggle with incompleteness, which motivates knowledge graph completion (KGC), that is, predicting the lost links between entities based on observed triples. Reasoning over relation paths in incomplete KGs is popular. Nonetheless, some significant issues are still remained to be addressed, such as path noise and ambiguity of inferred relation. To address these problems, we propose a novel path augmented _Reasoning model with avoidance of Path noise and Disambiguation of inferred relation in this paper, referred to as RPD. In this model, we calculate the sum of resource allocation for each relation path to measure its reliability to avoid the inference of path noise. To address the ambiguity of an inferred relation, we introduce position embedding to denote the relation position along the path when learning path representation. Extensive experiments conducted on benchmark datasets demonstrate the effectiveness of our proposal RPD model in the handling of KGC tasks compared to SOTAs.

关键词： Heavily-tailed distribution Noise knowledge graphs Benchmark testing Transformers Cognition Reliability Resource management Proposals Noise measurement

来源：评论

学校读者我要写书评

暂无评论

NcoVis: A Visual Analysis Framework for Exploring Academic Collaboration Networks under New Collaborative Relationships 25

NcoVis: A Visual Analysis Framework for Exploring Academic C...

引用

25th IEEE International Conference on Computer Supported Cooperative Work in Design, CSCWD 2022

作者： Yu, Ye Wu, Yao Liang, Xi Ma, Cheng Lu, Qiang Key Laboratory of Knowledge Engineering with Big Data Hefei University of Technology Ministry of Education Hefei China School of Computer Science and Information Hefei University of Technology Hefei China Intelligent Interconnected Systems Laboratory of Anhui Province Hefei University of Technology Hefei China

ISBN: (纸本)9781665405270

Academic collaboration has become one of the topics of large-scale social network analysis. The information extracted from academic collaboration also shows the contextual value in combination with other data. For academic collaborative social networks with intricate collaborative relationships, previous research methods mainly focused on network structure and community discovery, lacking in mining the characteristics of relationships in collaborative networks. There were some limitations in the research perspective. In this work, we propose a collaborative relationship representation method that is more suitable for academic collaborative social networks. It marks the attribute characteristics of nodes in collaborative relationships and highlights collaborative relationships in visualization. By adopting this new representation of collaborative relationships, we designed a visual analysis framework NcoVis, to visualize academic collaborative social networks. We further visually analyze the link relationship groups guided by nodes, and explore the potential representation of the structure and attribute characteristics of link relationships, so that analysts can explore the theme and structural change characteristics of link relationships, communities and the whole network in collaborative social networks. To prove the proposed framework, we conducted a case study on the academic collaboration literature data set, and analyzed the questionnaire with Likert scale through the user evaluation experiment, which verified the effectiveness of our method and the practicability of NcoVis. © 2022 IEEE.

关键词： Visualization

来源：评论

学校读者我要写书评

暂无评论

Deformable registration framework for glioma images with absent correspondence based on auxiliary-image-aided intensity-consistency constraint

Deformable registration framework for glioma images with abs...

引用

2024 IEEE International Conference on Bioinformatics and Biomedicine, BIBM 2024

作者： Tang, Kun Wang, Lihui Yang, Menglong Xu, Jingwen Cheng, Xinyu Zhang, Jian Zhu, Yuemin Wei, Hongjiang Ministry of Education State Key Laboratory of Public Big Data College of Computer Science and Technology Key Laboratory of Intelligent Medical Image Analysis and Precise Diagnosis of Guizhou Province Engineering Research Center of Text Computing & Cognitive Intelligence Guiyang China Univ Lyon Insa Lyon Cnrs Inserm Creatis Umr 5220 U1206 Lyon France Shanghai Jiao Tong University School of Biomedical Engineering Shanghai200240 China

ISBN: (纸本)9798350386226

Considering the tumor aggressive nature and the significant changes in anatomical structure, aligning the preoperative and follow up scans of glioma patients remains a challenge due to the presence of regions with absent correspondence. To address this challenge, this work proposed a novel bidirectional unsupervised deformable image registration framework for image pairs with missing correspondence based on an auxiliary-image-aided intensity-consistency constraint (ICC) strategy. Specifically, for any fixed and moving image pairs, we introduced an auxiliary image and warped it directly to fixed/moving image or warped it twice through a transition of moving/fixed image. By comparing the difference between these warped images, the weighting maps to identify and exclude regions with absent correspondence between fixed and moving image pairs can be generated. To verify the effectiveness of the proposed framework, we combined it with several deep learning-based registration models and tested it on BraTS-Reg challenge dataset, the results demonstrated that the proposed ICC strategy can improve the registration performance for all the models, with the improvement of average target registration error (TRE) and success rate (SR) being up to 44.9% and 66.7%, respectively. Comparing against the best existing forward-backward consistency strategy for dealing with missing correspondence registration, our auxiliary-image-aided ICC strategy can also decrease average TRE by 2.9%, demonstrating the superiority of the proposed framework. The present work is not limited to the glioma images, it can be used to address the registration problems for any image pairs with absent correspondence or inconsistent intensity. © 2024 IEEE.

关键词： Image registration

来源：评论

学校读者我要写书评

暂无评论

A Differential Privacy Protection Protocol Based on Location Entropy

引用

Tsinghua Science and Technology 2023年第3期28卷 452-463页

作者： Ping Guo Baopeng Ye Yuling Chen Tao Li Yixian Yang Xiaobin Qian Xiaomei Yu State Key Laboratory of Public Big Data School of Computer Science and TechnologyGuizhou UniversityGuiyang 550025China Information Technology Innovation Service Center of Guizhou Province Guiyang 550025China School of Cyberspace Security Beijing University of Posts and TelecommnuicationsBeijing 100000China Guizhou CoVision Science&Technology Co. Ltd.Guiyang 550025China School of Information Science and Engineering Shandong Normal UniversityJinan 250000China

A Location-Based Service(LBS)refers to geolocation-based services that bring both convenience and *** an increase in the scale and value of data,most existing location privacy protection protocols cannot balance privacy and *** solve the revealing problems in LBS,we propose a differential privacy protection protocol based on location ***,we design an algorithm of the best-assisted user selection for constructing anonymity ***,we employ smart contracts to evaluate the credibility of participants,which ensures the honesty of ***,we provide a comprehensive experiment;the theoretical analysis and experiments show that the proposed protocol effectively resists background knowledge ***,our protocol improves data ***,it realizes user-controllable privacy protection,which improves privacy protection and strengthens security.

关键词： Location-Based Services(LBS) smart contract location entropy differential privacy privacy protection

来源：评论

学校读者我要写书评

暂无评论

Fuzzy Deduplication Scheme Supporting Pre-verification of Label Consistency 17th

Fuzzy Deduplication Scheme Supporting Pre-verification of L...

引用

17th International Conference on Provable and Practical Security, ProvSec 2023

作者： Tang, Zehui Zeng, Shengke Li, Tao Cheng, Shuai Zheng, Haoyu School of Computer and Software Engineering Xihua University Chengdu610039 China State Key Laboratory of Public Big Data College of Computer Science and Technology Guizhou University Guiyang550025 China School of Computer Science Qufu Normal University Rizhao276825 China

ISBN: (纸本)9783031455124

Efficiently and securely removing encrypted redundant data with cross-user in the cloud is challenging. Convergent Encryption (CE) is difficult to resist dictionary attacks for its deterministic tag. Server-aided mechanism is against such attacks while it may exist collusion. Focus on multimedia data, this paper proposes an efficient and secure fuzzy deduplication system without any additional servers. We also propose a notion of pre-verification of label consistency to compensate for the irreparable post-verification loss. Compared with other fuzzy deduplication schemes, our work has apparent advantages in deduplication efficiency and security based on a natural data set. © The Author(s), under exclusive license to Springer Nature Switzerland AG 2023.

关键词： Cryptography

来源：评论

学校读者我要写书评

暂无评论

An Encoder-Based Framework for Privacy-Preserving Machine Learning 24th

An Encoder-Based Framework for Privacy-Preserving Machine L...

引用

24th International Conference on Algorithms and Architectures for Parallel Processing, ICA3PP 2024

作者： Wu, Jiayun Ren, Wei Zhang, Xianchao Zheng, Xianghan School of Computer Science China University of Geosciences Wuhan430074 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 Ministry of Education Chengdu China Key Laboratory of Medical Electronics and Digital Health of Zhejiang Province Jiaxing University Jiaxing China Engineering Research Center of Intelligent Human Health Situation Awareness of Zhejiang Province Jiaxing University Jiaxing China College of Computer and Big Data Fuzhou University Fujian Fuzhou China School of Information and Intelligent Engineering Sanya College Hainan China

ISBN: (纸本)9789819615506

As a data-driven science, machine learning requires vast amounts of training data and computational resources. However, for highly privacy-sensitive data, it is crucial to protect the privacy of the data during both the training and utilization of machine learning models. In this paper, we propose a privacy-preserving machine learning approach using autoencoders and differential privacy mechanisms to safeguard data privacy while minimizing the impact on data availability. Specifically, we augment logistic regression and ResNet18 models with different architectures of autoencoders to perform data encryption? without compromising the machine learning tasks. Additionally, we employ differential privacy mechanisms to introduce gradient perturbations in the encoding part of the autoencoder, enhancing the algorithm’s security and further protecting data privacy. We also design the cosine similarity between the encoded and original data as a metric for evaluating data privacy, considering model performance, privacy budget, and data privacy collectively to balance data availability and privacy. Extensive experiments conducted on MNIST, CIFAR-10, PathMNIST, and BloodMNIST datasets demonstrate that for simple logistic regression models handling easily classifiable datasets, employing simple autoencoder structures can enhance classification accuracy, with significant performance impact after adding differential privacy. For ResNet18, utilizing convolutional autoencoders for data encryption generally has minimal impact on model classification performance and can even improve accuracy in most cases. Adding differential privacy has minor effects on model classification performance. Selecting appropriate model structures and privacy budgets for different usage scenarios can ensure both data availability and privacy. © The Author(s), under exclusive license to Springer Nature Singapore Pte Ltd. 2025.

关键词： Adversarial machine learning

来源：评论

学校读者我要写书评

暂无评论

ATPRINPM: A single-source domain generalization method for the remaining useful life prediction of unknown bearings

ATPRINPM: A single-source domain generalization method for t...

引用

Sensing, Measurement & data Analytics in the era of Artificial Intelligence (ICSMD), International Conference on

作者： Juan Xu Bin Ma Yuqi Fan Xu Ding Key Laboratory of Knowledge Engineering with Big Data School of Computer and Information Hefei University of Technology Hefei China

The remaining useful life (RUL) of bearings is critical to the proper operation of mechanical equipment, maintenance of equipment costs and availability. The existing domain adaptation methods have had great success in RUL prediction. However, when the target bearing data are unavailable or unknown to be involved in model training, the domain adaptation approaches also incapable. To solve the problem, we propose a parallel reversible instance normalization method based on adaptive threshold stage division for remaining useful life prediction of unknown bearings. First, we design an adaptive threshold method to find degradation points to divide the healthy and degradation stages. Then according to time series, we merge the original vibration data and its instance normalized data to increase the data distribution diversity. Finally, we combine instance normalization and parallel reversible normalization of the source bearing data into unified RUL learning framework to solve the uncertainty of counterfactual data and improve RUL prediction performance. The results show that the method is superior to the state-of-the-art methods for RUL prediction of unknown bearings.

关键词： Degradation Vibrations Training Adaptation models Uncertainty data analysis Time series analysis

来源：评论

学校读者我要写书评

暂无评论

Boosting Performance and QoS for Concurrent GPU B+trees by Combining-Based Synchronization 23

Boosting Performance and QoS for Concurrent GPU B+trees by C...

引用

28th ACM SIGPLAN Annual Symposium on Principles and Practice of Parallel Programming, PPoPP 2023

作者： Zhang, Weihua Zhao, Chuanlei Peng, Lu Lin, Yuzhe Zhang, Fengzhe Lu, Yunping School of Computer Science Fudan University China Institute of Big Data Fudan University China State Key Laboratory of Mathematical Engineering and Advanced Computing China Parallel Processing Institute Fudan University China Department of Computer Science Tulane University United States

ISBN: (纸本)9798400700156

Concurrent B+trees have been widely used in many systems. With the scale of data requests increasing exponentially, the systems are facing tremendous performance pressure. GPU has shown its potential to accelerate concurrent B+trees performance. When many concurrent requests are processed, the conflicts should be detected and resolved. Prior methods guarantee the correctness of concurrent GPU B+trees through lock-based or software transactional memory (STM)-based approaches. However, these methods complicate the request processing logic, increase the number of memory accesses and bring execution path divergence. They lead to performance degradation and variance in response time increasing. Moreover, previous methods do not guarantee linearizability among concurrent requests. In this paper, we design a combined-based concurrency control framework, called Eirene, for GPU B+tree to reduce the overhead of conflict detection and resolution. First, a combining-based synchronization method is designed to combine and issue requests. It combines the requests with the same key, constructs their dependence, decides the issued request, and determines their return values. Since only one request for each key is issued, key conflicts are eliminated. Then, an optimistic STM method is used to reduce structure conflicts. The query and the update requests are partitioned into different kernels. For the update kernels, STM is involved only when the number of the retry reaches a threshold. Finally, a locality-aware warp reorganization optimization is proposed to improve memory behavior and reduce conflicts by exploiting the locality among requests. Evaluations on an NVIDIA A100 GPU show that Eirene is efficient (a throughput of 2.4 billion per second) and can guarantee linearizability. Compared to the state-of-the-art GPU B+tree, it can achieve a speedup of 7.43X and reduce the response time variance from 36% to 5%. © 2023 ACM.

关键词： Graphics processing unit

来源：评论

学校读者我要写书评

暂无评论

Vehicle attribute recognition methods incorporating attention mechanisms

Vehicle attribute recognition methods incorporating attentio...

引用

2024 International Conference on Computer Application and Information Security, ICCAIS 2024

作者： Hu, Junzhu Lu, Ying Xu, Quanyuan Li, Caiyi Wang, Mingyang Zhou, Hao Yang, Peidong Jiang, Feng College of Big Data and Intelligent Engineering Southwest Forestry University Kunming650024 China Key Laboratory of Forestry and Ecological Big Data State Forestry Administration on Southwest Forestry University Kunming650024 China Qujing Tobacco Company Qujing655000 China

ISBN: (纸本)9781510689312

To address the challenges of vehicle attribute recognition in traffic management, intelligent parking systems, and road surveillance, this paper proposes an algorithm that integrates the Squeeze-and-Excitation (SE) attention mechanism into ResNet34. The SE mechanism is added after each BasicBlock, with a total of 16 SE modules incorporated to train the network. The optimal model is achieved after 100 iterations. The SE mechanism enhances the network’s ability to focus on key features by adaptively adjusting the importance of features across channels, thereby improving the effectiveness of feature representation. This dynamic adjustment allows the model to better adapt to complex and varying image structures, demonstrating strong adaptability in vehicle attribute recognition tasks. Experimental results show a significant improvement in recognition accuracy, with the enhanced ResNet34 model achieving a 5.1% increase in vehicle attribute recognition accuracy compared to the original ResNet34. The proposed algorithm effectively improves recognition performance, offering valuable technical support for the application of intelligent transportation systems. © The Authors.

关键词： Highway administration

来源：评论

学校读者我要写书评

暂无评论

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

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：