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

2023 IEEE International Conference on Web Services, ICWS 2023

作者： Shi, Xiaoyu Liu, Quanliang Xie, Hong Shang, Mingsheng Chongqing Institute of Green and Intelligent Technology Chinese Academy of Sciences Chongqing Key Laboratory of Big Data and Intelligent Computing Chongqing China University of Chinese Academy of Sciences Chongqing School Chongqing China

ISBN: (纸本)9798350304855

This paper considers the problem of maintaining the long-term fairness of item exposure in interactive recommendation systems under the dynamic setting that user preference and item popularity evolve over time. The challenge is that the evolving dynamics of user preference and item popularity in the feedback loop amplify the long-term 'unfairness' of item exposure. To address this challenge, we first formulate a constrained Markov Decision Process (MDP) to capture evolving dynamics of user preference. The proposed constrained MDP imposes long-term fairness requirements via maximum entropy techniques. Moreover, to illuminate the 'unfairness' amplifying effect caused by the evolving dynamic of item popularity in the feedback loop, we design a debiased reward function to eliminate popularity bias in the training data. To this end, the proposed framework can maintain acceptable recommendation accuracy while exposing items as randomly as possible, ensuring long-term benefits for users. Experiments on three datasets demonstrate the effectiveness and superiority of our proposed framework in terms of recommendation performance and fairness. © 2023 IEEE.

关键词： Reinforcement learning

来源：评论

学校读者我要写书评

暂无评论

Intention Recognition Method Based on Resting-state and P300 Task-state Dynamic Brain Functional Network Features 15

Intention Recognition Method Based on Resting-state and P300...

引用

15th International Conference on Measurement Technology and Mechanical Automation, ICMTMA 2023

作者： Yi, X. Wang, Z.M. Heng, X. School of Computer Science and Technology Xi'An University of Posts and Telecommunications Shaanxi Xi'an710121 China Shaanxi Key Laboratory of Network Data Analysis and Intelligent Processing Shaanxi Xi'an710121 China Xi 'An Key Laboratory of Big Data and Intelligent Computing Shaanxi Xi'an710121 China

In order to reconfigure its structure from the static state in the vision odd ball task, so as to realize the intention recognition based on the characteristics of the brain functional network. The thesis proposes the intention recognition method based on resting state and P300 task state dynamic brain functional network features. First, the brain connectivity in each time window is constructed into a brain functional network using phase lock value (PLV). Then, extract the global features (global efficiency, transitivity) of the brain functional network, and use Louvain algorithm to obtain the brain functional network community. The experimental results show that in the (100-200) ms of P300 task status, the core nodes are mainly concentrated in the forehead region and the central region, while in the (300-500) ms of P300, the core nodes are concentrated in the temporal lobe. The recognition accuracy based on this method reaches 93%. © Published under licence by IOP Publishing Ltd.

关键词： Brain Function Network Intention Recognition P300 PLV Sliding Windows

来源：评论

学校读者我要写书评

暂无评论

LCS-based Visual Recognition for AGV Guide Paths under Complex Illumination Conditions 15

LCS-based Visual Recognition for AGV Guide Paths under Compl...

引用

15th International Conference on Measurement Technology and Mechanical Automation, ICMTMA 2023

作者： Wang, Z.M. Li, M. Gao, C. Jin, X.M. School of Computer Science and Technology Xi'An University of Posts and Telecommunications Shaanxi Xi'an710121 China Shaanxi Key Laboratory of Network Data Analysis and Intelligent Processing Shaanxi Xi'an710121 China Xi'An Key Laboratory of Big Data and Intelligent Computing Shaanxi Xi'an710121 China

Complex lighting is one of the most challenging problems in automatic guided vehicle (AGV) vision recognition system. In order to overcome the influence of uneven illumination on the accuracy and robustness of path recognition, this paper proposes the LCS based visual recognition for AGV guide paths under complex illumination conditions method, which converts the collected image into an invariant image through logarithmic chromaticity space (LCS) to eliminate the influence of illumination, and the minimum average entropy angle is used as the projection angle to generate the invariant image to improve the speed of image conversion to the invariant image. Experimental results show that the proposed method can effectively improve the robustness of AGV vision recognition system under complex lighting conditions. © Published under licence by IOP Publishing Ltd.

关键词： Lighting

来源：评论

学校读者我要写书评

暂无评论

Drug-Protein Interaction Prediction by Fusion of Attention and Graph Neural Network 42

Drug-Protein Interaction Prediction by Fusion of Attention a...

引用

42nd Chinese Control Conference, CCC 2023

作者： Chen, Tianrui Tuo, Shouheng Feng, Zengyu School of Computer Science and Technology Xi'An University of Posts and Telecommunications Shaanxi Xi'an710121 China Shaanxi Key Laboratory of Network Data Analysis and Intelligent Processing Shaanxi Xi'an710121 China Xi'An Key Laboratory of Big Data and Intelligent Computing Shaanxi Xi'an710121 China

ISBN: (纸本)9789887581543

The identification of drug-protein interactions (DTIs) is a critical step in drug development and repositioning. However, detecting these interactions using scientific methods presents a formidable challenge. Existing models often struggle to extract relevant information from drug-protein sequences, and they fail to consider pre-existing interactions between pairs. Here, we introduce a deep learning model, DPAG, based on attention mechanisms and graph neural networks, which overcomes these limitations. DPAG leverages information from both the drug and protein sequences, as well as the association between drug-protein pairs, to predict DTIs. We conducted multiple experiments to evaluate the performance of the model in benchmark datasets, and the results showed that DPAG achieved excellent performance in terms of AUC, AUPR, precision, and recall. Our findings suggest that DPAG holds significant potential as a promising tool for predicting DTIs in drug development and repositioning. Code is available at https://***/veresse/DPAG. © 2023 Technical Committee on Control Theory, Chinese Association of Automation.

关键词： Graph neural networks

来源：评论

学校读者我要写书评

暂无评论

Multimodal Image-Text Representation Learning for Sketch-Less Facial Image Retrieval

Multimodal Image-Text Representation Learning for Sketch-Les...

引用

IEEE International Conference on Multimedia and Expo (ICME)

作者： Dawei Dai Yingge Liu Shiyu Fu Guoyin Wang Chongqing Key Laboratory of Computational Intelligence Key Laboratory of Big Data Intelligent Computing Key Laboratory of Cyberspace Big Data Intelligent Security Ministry of Education Chongqing University of Posts and Telecommunications Chongqing China

ISBN: (数字)9798350390155

ISBN: (纸本)9798350390162

Sketch-less facial image retrieval (SLFIR) framework aims to break the barriers that drawing a high-quality facial sketch requires excellent skills and substantial time, it performs the retrieval using a partial sketch with as few strokes as possible. However, such early-stage sketches often contain only local details, resulting in poor retrieval performance. In this study, we propose learning of the representation by fusing the sketches with prior human semantic knowledge to improve the early retrieval performance. Specifically, (1) based on the LAION-Face dataset, a facial language-image pretraining (FLIP) model is constructed to learn the aligned representations of facial image and text; (2) subsequently, using FLIP as the backbone, multiscale features of sketch and text are extracted and fused to learn the efficient representation for the final retrieval. The proposed method achieves state-of-the-art early retrieval performance on all two public datasets and exhibits a good generalization ability in practical testing.

关键词： Representation learning Semantics Image retrieval Feature extraction Faces Testing

来源：评论

学校读者我要写书评

暂无评论

GoPIM: GCN-Oriented Pipeline Optimization for PIM Accelerators 31

GoPIM: GCN-Oriented Pipeline Optimization for PIM Accelerato...

引用

31st IEEE International Symposium on High Performance Computer Architecture, HPCA 2025

作者： Yang, Siling He, Shuibing Wang, Wenjiong Yin, Yanlong Wu, Tong Chen, Weijian Zhang, Xuechen Sun, Xian-He Feng, Dan The State Key Laboratory of Blockchain and Data Security Zhejiang University China Zhejiang Lab China Institute of Blockchain and Data Security China Zhejiang Key Laboratory of Big Data Intelligent Computing China Washington State University Vancouver United States Illinois Institute of Technology United States Huazhong University of Science and Technology China Wuhan National Laboratory for Optoelectronics China

ISBN: (纸本)9798331506476

Graph convolutional networks (GCNs) are popular for a variety of graph learning tasks. ReRAM-based processing-in-memory (PIM) accelerators are promising to expedite GCN training owing to their in-situ computing capability. However, existing accelerators can be severely underutilized even with pipelines, due to the oversight of the skewed execution times of various GCN stages and the ignorance of skewed degrees of graph vertices. In this work, we propose GOPIM, a GCN-oriented pipeline optimization for PIM accelerators to expedite GCN training. First, GOPIM proposes an ML-based scheme that allocates crossbar resources to the most needed stages to streamline the overall pipeline. Second, GOPIM utilizes a selective vertex updating technique that evenly distributes vertices on crossbars by interleaved mapping. These techniques collectively reduce the overall execution time without losing much accuracy. We also provide a practical architecture design for GOPIM. Our experimental results show that, GoPIM achieves up to 191 × speedup and 16.1 × energy saving, compared to the state-of-the-art work. © 2025 IEEE.

关键词： Graph neural networks

来源：评论

学校读者我要写书评

暂无评论

Meta-transfer learning for predicting position-dependent milling stability across varying overhang lengths under limited experimental data

引用

Journal of Manufacturing Processes 2025年 149卷 43-56页

作者： Deng, Congying Wu, Qiang Miao, Jianguo Lu, Sheng Xie, Luofeng School of Integrated Circuits Chongqing University of Posts and Telecommunications Chongqing400065 China College of Automation Chongqing University of Posts and Telecommunications Chongqing400065 China Key Laboratory of Big Data Intelligent Computing Chongqing University of Posts and Telecommunications Chongqing400065 China School of Mechanical Engineering Sichuan University Chengdu610065 China

Stability lobe diagram (SLD) serves as a pivotal reference in determining appropriate chatter-free milling parameters. The tool tip frequency response functions (FRFs), as crucial prerequisites for deriving theoretical SLDs, vary with the position and overhang length. The acquisition of tool tip FRFs under different machining positions and overhang lengths necessitates repeated time-consuming experiments or simulations. To guarantee the efficiency and accuracy in predicting SLDs, this paper puts forward a meta-transfer learning method utilizing a deep neural network to refine the prediction of stability limits with limited experimental data. Initially, a source overhang length is defined to perform the impact testing under adequate machining positions for acquiring tool tip dynamics and constructing a theoretical stability dataset. Fewer impact tests for a target overhang length are conducted under insufficient machining positions arranged through a proposed similarity-based sampling strategy, and a target stability dataset is constructed using limited tool tip FRFs. Secondly, the source dataset is updated by domain adaptation on the modal parameters with a multi-fidelity modeling. Subsequently, meta-learning is carried out on multiple meta-tasks randomly determined from the updated source dataset. The ultimately trained deep neural network during the meta-learning phase undergoes fine-tuning with the target dataset for predicting the stability limits at various machining positions. Finally, a three-axis vertical machining center is taken to conduct a detailed experimental validation. Comparative analyses indicate that the proposed methodology outperforms others in accurately predicting stability limits, even with a constrained number of labeled samples. © 2025 The Society of Manufacturing Engineers

关键词： Milling (machining)

来源：评论

学校读者我要写书评

暂无评论

Privacy protection oriented on data stream computing

Privacy protection oriented on data stream computing

引用

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

作者： He, Renjie Zheng, Xianghan Wang, Gong School of Computer and Big Data Fuzhou University Fujian Fuzhou China The Fujian Key Laboratory of Network Computing and Intelligent Information Processing Fuzhou University Fujian Fuzhou China

ISBN: (纸本)9781510663459

data security has always been one of the public concerns, and homomorphic encryption technology, as one of the effective means to ensure data security, has always been a hot topic of academic research. Traditional machine learning is trained in a batch environment. In practice, data owners tend to outsource data and model training tasks to third-party clouds with huge computing resources, but data outsourcing carries the risk of privacy leakage. Therefore, in order to prevent this situation, an effective method is to encrypt the data before the outsourcing, and the third-party cloud trains the machine model of the ciphertext data. This method has special requirements for encryption algorithms which should support computation directly on the ciphertext data. This paper presents a novel data flow computing privacy protection framework based on the homomorphic encryption algorithm CKKS and the flow data processing engine Flink, called SDPPF (Streaming data Privacy Protection on Flink). The proposed framework supports the functions of data stream encryption, decryption and ciphertext computing, and expands the functions of vector point multiplication and array sum operation on the basic simultaneous operation supported by the original CKKS algorithm. This paper also selects a classical machine learning algorithm: KNN algorithm, combined with the homomorphic encryption algorithm CKKS to realize the privacy protection machine learning algorithm. © 2023 SPIE.

关键词： Cryptography

来源：评论

学校读者我要写书评

暂无评论

DFGET: Displacement-Field Assisted Graph Energy Transmitter for Gland Instance Segmentation 17

DFGET: Displacement-Field Assisted Graph Energy Transmitter ...

引用

17th IEEE International Conference on Signal Processing, ICSP 2024

作者： Jian, Caiqing Qin, Yongbin Wang, Lihui Ye, Chen Cheng, Xinyu Guizhou University Engineering Research Center of Text Computing & Cognitive Intelligence Ministry of Education Key Laboratory of Intelligent Medical Image Analysis and Precise Diagnosis of Guizhou Province State Key Laboratory of Public Big Data College of Computer Science and Technology Guiyang China

ISBN: (纸本)9798350387384

Gland instance segmentation is an essential but challenging task in the diagnosis of adenocarcinoma. The existing models usually achieve gland instance segmentation through multi-task learning and boundary loss constraint. However, how to deal with the problems of gland adhesion and inaccurate boundary in segmenting the complex samples remains a challenge. In this work, we propose a novel geometric feature named displacement field (DF), which can represent the geometric information such as shape, size, and orientation of the glands. Based on the explicit constraint of DF, a displacement-field assisted graph energy transmitter (DFGET) framework is proposed for solving the above problems. Using such graph framework, the gland semantic segmentation map and the displacement field of the graph nodes are estimated with two graph network branches. With the constraint of DF, a graph cluster module is presented to improve the intra-class feature consistency and inter-class feature discrepancy, as well as to separate the adherent glands. Extensive comparison and ablation experiments on the GlaS dataset demonstrate the effectiveness of the displacement field and the superiority of DFGET. Compared to the best comparative model, DFGET increases the object-Dice and object-F1 score by 2.27% and 3.11% respectively, while decreases the object-HD by 15.58, achieving state-of-the-art performance, which indicates that DFGET can serve as an auxiliary tool for the diagnosis of adenocarcinoma. © 2024 IEEE.

关键词： Semantic Segmentation

来源：评论

学校读者我要写书评

暂无评论

GBCT: An Efficient and Adaptive Granular-Ball Clustering Algorithm for Complex data

arXiv

引用

arXiv 2024年

作者： Xia, Shuyin Shi, Bolun Wang, Yifan Xie, Jiang Wang, Guoyin Gao, Xinbo Chongqing Key Laboratory of Computational Intelligence The Key Laboratory of Cyberspace Big Data Intelligent Security Ministry of Education The Key Laboratory of Big Data Intelligent Computing Chongqing University of Posts and Telecommunications Chongqing400065 China

Traditional clustering algorithms often focus on the most fine-grained information and achieve clustering by calculating the distance between each pair of data points or implementing other calculations based on points. This way is not inconsistent with the cognitive mechanism of "global precedence" in human brain, resulting in those methods’ bad performance in efficiency, generalization ability and robustness. To address this problem, we propose a new clustering algorithm called granular-ball clustering (GBCT) via granular-ball computing. Firstly, GBCT generates a smaller number of granular-balls to represent the original data, and forms clusters according to the relationship between granular-balls, instead of the traditional point relationship. At the same time, its coarse-grained characteristics are not susceptible to noise, and the algorithm is efficient and robust;besides, as granular-balls can fit various complex data, GBCT performs much better in non-spherical data sets than other traditional clustering methods. The completely new coarse granularity representation method of GBCT and cluster formation mode can also used to improve other traditional methods. All codes can be available from the following link. Copyright © 2024, The Authors. All rights reserved.

关键词： Granular computing

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：