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

2024 IEEE International Conference on Bioinformatics and Biomedicine, BIBM 2024

作者： Lu, Mianshuo Wang, Lei Sun, Jinzhu Li, Yang Wei, Mengmeng Wei, Yu Liu, Changchun Li, Zhengwei China University of Mining and Technology School of Computer Science and Technology Xuzhou221116 China Guangxi Academy of Sciences Big Data and Intelligent Computing Research Center Nanning530007 China Zaozhuang Mental Health Center Zaozhuang277100 China Hefei University of Technology School of Computer Science and Information Engineering Hefei230601 China Zaozhuang Univerity College of Information Science and Enginnering 277100 China

ISBN: (纸本)9798350386226

Circular RNA (circRNA) is an RNA molecule that plays an important role in both pathology and physiology. Accurate identification of associations between circRNAs and diseases is crucial for further physiology research. However, verifying the circRNA-disease associations (CDA) through biological experimental methods is time-consuming. Here, we propose a novel method combines Non-negative Matrix Factorization (NMF) and Adversarially Regularized Variational Graph Autoencoder (ARVGA) to accurately predict CDA. Our model first fuses multi-source information in order to build circRNA similarity, disease similarity and circRNA-disease association matrices. Thereby our model constructs graphs for circRNA and disease respectively and optimize them using a K-means clustering algorithm. We obtain linear features using NMF and non-linear features using ARVGA. Finally, an Extremely Randomized Trees classifier is employed to predict CDA. On the gold standard dataset CircR2Disease, our model achieved a prediction accuracy of 94.8% and an AUC of 0.984 under 5-fold cross-validation. In case study, 19 of top 20 predicted circRNAs associated with Hepatocellular Carcinoma were confirmed in relevant literature. Furthermore, ablation experiment, classifier experiment and independent datasets test fully demonstrate the effectiveness and robustness of our model. © 2024 IEEE.

关键词： Non-negative matrix factorization

来源：评论

学校读者我要写书评

暂无评论

Logical Relation Modeling and Mining in Hyperbolic Space for Recommendation 40

Logical Relation Modeling and Mining in Hyperbolic Space for...

引用

40th IEEE International Conference on data Engineering, ICDE 2024

作者： Tan, Yanchao Lv, Hang Zhou, Zihao Guo, Wenzhong Xiong, Bo Liu, Weiming Chen, Chaochao Wang, Shiping Yang, Carl College of Computer and Data Science Fuzhou University Fuzhou China Engineering Research Center of Big Data Intelligence Ministry of Education Fuzhou China Fujian Key Laboratory of Network Computing and Intelligent Information Processing Fuzhou University Fuzhou China Institute for Artificial Intelligence University of Stuttgart Stuttgart Germany College of Computer Science Zhejiang University Hangzhou China Emory University Department of Computer Science Atlanta United States

ISBN: (纸本)9798350317152

The sparse interactions between users and items have aggravated the difficulty of their representations in recommender systems. Existing methods leverage tags to alleviate the sparsity problem but ignore prevalent logical relations among items and tags (e.g., membership, hierarchy, and exclusion), which can be leveraged to enhance the accuracy of modeling user preferences and conducting recommendations. To this end, we propose to extract logical relations among item tags from existing tag taxonomies and exploit the individual strengths of the Poincaré and the Lorentz models in hyperbolic space for logical relation modeling towards enhanced recommendations. Moreover, we find that the logical relations directly extracted from existing tag taxonomies can be inaccurate and coarse. Therefore, we further devise innovative consistency-based and granularity-based weighting mechanisms based on user behavior patterns for data-driven logical relation mining that can be jointly optimized along with recommendations in an end-to-end fashion. Extensive experiments on four real-world benchmark datasets show drastic performance gains brought by our proposed framework, which constantly achieves an average of 8.25% improvement over state-of-the-art competitors regarding both Recall and NDCG metrics. Insightful case studies further demonstrate that our automatically refined logical relations are highly accurate and interpretable. © 2024 IEEE.

关键词： Recommender systems

来源：评论

学校读者我要写书评

暂无评论

Any-Angle Routing Algorithm for Microfluidic Biochips Driven by Flow Path

引用

Jisuanji Yanjiu yu Fazhan/Computer Research and Development 2025年第4期62卷 978-988页

作者： Youlin, Pan Shuai, Guo Xing, Huang Genggeng, Liu College of Computer and Data Science Fuzhou University Fuzhou350116 China Engineering Research Center of Big Data Intelligence Fuzhou University Ministry of Education Fuzhou350116 China Fujian Key Laboratory of Network Computing and Intelligent Information Processing Fuzhou University Fuzhou350116 China School of Computer Science Northwestern Polytechnical University Xi’an710072 China

Continuous-flow microfluidic biochips (CFMBs) have become a hot research topic in recent years due to their ability to perform biochemical assays automatically and efficiently. For the first time, PathDriver+ takes the requirements of the actual fluid transportation into account in the design process of CFMBs and implements the actual fluid transport and removal, and plans separate flow paths for each transport task, which have been neglected in previous work. However, PathDriver+ does not take full advantage of the flexibility of CFMBs routing because it only considers the optimization of flow channel length for the global routing in the mesh model, except for the detailed routing. In addition, PathDriver+ only considers the X architecture, while the existing work shows that the any-angle routing can utilize the routing resources more efficiently and shorten the flow channel length. To address the above issues, we propose a flow path-driven arbitrary angle routing algorithm, which can improve the utilization of routing resources and reduce the flow channel length while considering the actual fluid transportation requirements. The proposed algorithm constructs a search graph based on constrained Delaunay triangulation to improve the search efficiency of routing solutions while ensuring the routing quality. Then, a Dijkstra-based flow path routing method is used on the constructed search graph to generate a routing result with a short channel length quickly. In addition, in the routing process, channel reuse strategy and intersection optimization strategy are proposed for the flow path reuse and intersection number optimization problems, respectively, to further improve the quality of routing results. The experimental results show that compared with the latest work PathDriver+, the length of channels, the number of ports used, and the number of channel intersections are significantly reduced by 33.21%, 11.04%, and 44.79%, respectively, and the channel reuse rate is i

关键词： High level synthesis

来源：评论

学校读者我要写书评

暂无评论

Exploring Patent Transformation Event: Forecasting Patent Transfer Time 26

Exploring Patent Transformation Event: Forecasting Patent Tr...

引用

26th International Conference on Computer Supported Cooperative Work in Design, CSCWD 2023

作者： Huo, Jinchen Liu, Weidong Li, Yang Cao, Yan Institute of Scientific and Technical Information of China China College of Computer Science Inner Mongolia University China Natl. Loc. Jt. Eng. Research Center of Intelligent Information Processing Technology for Mongolian China Inner Mongolia Key Laboratory of Social Computing and Data Processing China Inner Mongolia Engineering Laboratory for Big Data Analysis Technology China

ISBN: (纸本)9798350331684

As the largest source of technical information around the world, patents are regarded as an essential crystallization and carrier of knowledge and technological innovation. Patent transformation is conducive not only to enhancing economic efficiency, but also to improving productivity and the rational utilization of resources. There is an imbalance between high patent ownership and low transformation rates. We try to predict the occurrence of transformation events from the patent assignment. However, there are some challenges in predicting patent transformation: (1) how to capture transformation features of patents, especially combined with the transfer time factor. (2) how to predict patent transfer time effectively. To address these challenges, a Patent Transfer Time Forecasting Model (PTTFM) is proposed. The model includes: (1) extraction of time-varying features of patents. (2) the patent transfer time is forecast using a Neural Temporal Point Process. By testing the model on patents under different classifications, the experimental results are obtained to show that the proposed model is applicable to predict the timing of patent assignment within a certain time frame, especially one month. Our work may facilitate patent transformation while interpretability is ensured for transformation events. © 2023 IEEE.

关键词： Forecasting

来源：评论

学校读者我要写书评

暂无评论

Blockchain-Based Multi-cloud data Storage System Disaster Recovery

Blockchain-Based Multi-Cloud Data Storage System Disaster Re...

引用

IEEE International Conference on Systems, Man and Cybernetics

作者： Feiyu Wang Jian-tao Zhou College of Computer Science Inner Mongolia University Hohhot Inner Mongolia China 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 Engineering Research Center of Ecological Big Data Ministry of Education National & Local Joint Engineering Research Center of Intelligent Information Processing Technology for Mongolian China

cloud storage services have been used by most businesses and individual users. However, data loss, service interruptions and cyber attacks often lead to cloud storage services not being provided properly, and these incidents have caused financial losses to users. Second, traditional and single-cloud model disaster recovery services are no longer suitable for the current complex cloud storage systems. Therefore, a scheme to provide disaster recovery for cloud storage services in a multi-cloud storage environment is needed in real production. In this paper, we propose a disaster recovery scheme based on blockchain technology. The proposed scheme outlined in this study aims to address the issue of data availability within the cloud storage landscape. The proposed scheme achieves this goal by dividing data into hot and cold categories, verifying the integrity of copy data via blockchain technology, and utilizing blockchain networks to manage multi-cloud storage systems. Experimental findings demonstrate that the proposed scheme yields superior results in terms of computation and time overheads.

关键词：

来源：评论

学校读者我要写书评

暂无评论

BMDP:Blockchain-Based Multi-cloud Storage data Provenance

BMDP:Blockchain-Based Multi-Cloud Storage Data Provenance

引用

International Conference on Computer Supported Cooperative Work in Design

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

In a multi-cloud storage system, provenance data records all operations and ownership during its lifecycle, which is critical for data security and audibility. However, recording provenance data also poses some challenging security and storage issues. In this paper, we present a secure and efficient multi-cloud storage data source scheme, BMDP. We use blockchain technology to ensure the secure storage of provenance data and design a smart contract to utilize the provenance data to ensure the proper operation of the multi-cloud storage system. Finally, we analyze the scheme’s safety and do simulation experiments to show that the scheme has practicality.

关键词：

来源：评论

学校读者我要写书评

暂无评论

Control Logic Routing for Continuous-Flow Microfluidic Biochips Based on Deep Reinforcement Learning

引用

Jisuanji Yanjiu yu Fazhan/Computer Research and Development 2025年第4期62卷 950-962页

作者： Cai, Huayang Huang, Xing Liu, Genggeng College of Computer and Data Science Fuzhou University Fuzhou350116 China Engineering Research Center of Big Data Intelligence Fuzhou University Ministry of Education Fuzhou350116 China Fujian Key Laboratory of Network Computing and Intelligent Information Processing Fuzhou University Fuzhou350116 China School of Computer Science Northwestern Polytechnical University Xi’an710072 China

With the advancement of electronic design automation, continuous-flow microfluidic biochips have become one of the most promising platforms for biochemical experiments. This chip manipulates fluid samples in milliliters or nanoliters by utilizing internal microvalves and microchannels, and thus automatically performs basic biochemical experiments, such as mixing and detection. To achieve the correct bioassay function, the microvalves deployed inside the chip are usually managed by a multiplexer-based control logic, and valves receive control signals from a core input through the control channel for accurate switching. Since biochemical reactions typically require high sensitivity, the length of control paths connecting each valve needs to be reduced to ensure immediate signal propagation, and thus to reduce the signal propagation delay. In addition, to reduce the fabrication cost of chips, a vital issue to be addressed in the logic architecture design is how to effectively reduce the total channel length within the control logic. To address the above issues, we propose a deep reinforcement learning-based control logic routing algorithm to minimize the signal propagation delay and total control channel length, thereby automatically constructing an efficient control channel network. The algorithm employs the dueling deep Q-network architecture as the agent of the deep reinforcement learning framework to evaluate the tradeoff between signal propagation delay and total channel length. Besides, the diagonal channel routing is implemented for the first time for control logic, thus fundamentally improving the efficiency of valve switching operations and reducing the fabrication cost of the chip. The experimental results demonstrate that the proposed algorithm can effectively construct a high-performance and low-cost control logic architecture. © 2025 Science Press. All rights reserved.

关键词： Deep reinforcement learning

来源：评论

学校读者我要写书评

暂无评论

Extracting High-order Connectivity of EEG-based Dynamic Functional Connectivity Networks for Diagnosis of Major Depressive Disorder 24

Extracting High-order Connectivity of EEG-based Dynamic Func...

引用

4th Asia-Pacific Artificial Intelligence and big data Forum, AIBDF 2024

作者： Zhao, Feng Fan, Wenxuan Han, Zhongwei Chen, Hongyu School of Computer Science and Technology Shandong Technology and Business University Shandong Yantai China Yantai Key Laboratory of Big Data Modeling and Intelligent Computing Shandong Yantai China Immersion Technology and Evaluation Shandong Engineering Research Center Shandong Yantai China Information Engineering College Yantai Institute of Technology Shandong Yantai China Shandong Technology and Business University Shandong Yantai China

ISBN: (纸本)9798400710865

Functional connectivity networks (FCNs), particularly those utilizing the phase lag index (PLI) method, have been instrumental in elucidating the pathological features of Major Depressive Disorder (MDD) by assessing the synchrony and lag of electroencephalogram (EEG) signal waveforms. Currently, the more prevalent methods are traditional FCNs that quantify phase synchronization as scalar values and dynamic FCNs (D-FCNs) that employ sliding window approaches to capture the instantaneous variations in functional connectivity. However, these two methods merely capture the low-level functional connections between paired regions of interest (ROIs) from both the static and dynamic perspectives, and fail to reflect the high-level functional connections involving multiple ROIs. Moreover, the feature dimension of the dynamic FCN is excessively high, and there exists a phase mismatch issue between different samples, which renders it impossible to be directly applied to the classification task, and no better solution is available at present. To mitigate these issues, we proposed a comprehensive framework that includes segmenting EEG sequences based on PLI to construct dynamic FCNs;employing seventh-order central moments for feature extraction to form low-order FCNs (Lo-FCNs);and establishing high-order FCNs (Ho-FCNs) based on Pearson correlation theory derived from Lo-FCNs. We conducted classification experiments across four distinct EEG frequency bands using our proposed framework while analyzing relevant features through graph theory and brain topological mapping techniques. The experiments showed that the proposed framework has a high classification accuracy rate in the classification experiments of MDD and NC, and proved the importance of high-order features in classification experiments, indicating that they may serve as physiological markers for MDD diagnosis. © 2024 Copyright held by the owner/author(s).

关键词： Electroencephalography

来源：评论

学校读者我要写书评

暂无评论

Task Separation and Knowledge Sharing for Class Incremental Learning

Task Separation and Knowledge Sharing for Class Incremental ...

引用

intelligent computing and Human-Computer Interaction (ICHCI), International Conference on

作者： Jiali Zhang Xiaoyan Qiao Yantai Key Laboratory of Big Data Modeling and Intelligent Computing Immersion Technology and Evaluation Shandong Engineering Research Center School of Computer Science and Technology Shandong Technology and Business University Yantai Shandong China Yantai Key Laboratory of Big Data Modeling and Intelligent Computing Immersion Technology and Evaluation Shandong Engineering Research Center School of Mathematics and Information Science Shandong Technology and Business University Yantai Shandong China

ISBN: (数字)9798350368284

ISBN: (纸本)9798350368291

Methods based on dynamically expanding architectures can effectively mitigate catastrophic forgetting in class incremental learning (CIL), but they often overlook information sharing and integration between subnetworks, leading to performance degradation and increased parameter count and memory consumption as the network expands. To address these complex issues, we introduce a new method called Task Separation and Knowledge Sharing (TSKS), which transfers knowledge at both the logical and feature levels through Hybrid Knowledge Distillation (HKD). In logical distillation, we combine Global Knowledge Distillation (GKD) and Task Knowledge Distillation (TKD) to establish connections between tasks. To prevent the model from favoring new classes, we design an Attention- Based Feature Fusion (ABFF) mechanism to capture important features. Additionally, we introduce a Soft-Margin Auxiliary Loss (SMAL) to help the model learn new concepts. Extensive experiments show that TSKS outperforms existing models on CIFAR100 and ImageNet100, regardless of whether memory samples are used. Notably, TSKS demonstrates superior performance in memory-free settings, indicating a reduced reliance on rehearsal memory.

关键词： Knowledge engineering Human computer interaction Degradation Incremental learning Computational modeling Memory management Information sharing Network architecture Feature extraction Knowledge transfer

来源：评论

学校读者我要写书评

暂无评论

Research on patent recommendation method based on graph neural network 26

Research on patent recommendation method based on graph neur...

引用

26th International Conference on Computer Supported Cooperative Work in Design, CSCWD 2023

作者： Zhang, Enchao Liu, Weidong Liu, Shi Cao, Yan Institute of Scientific and Technical Information of China China College of Computer Science Inner Mongolia University China Natl. Loc. Jt. Eng. Research Center of Intelligent Information Processing Technology for Mongolian China Inner Mongolia Key Laboratory of Social Computing and Data Processing China Inner Mongolia Engineering Laboratory for Big Data Analysis Technology China

ISBN: (纸本)9798350331684

Intellectual property transactions have shown a strong growth momentum in recent years, but the patent transaction market has been plagued by the matching degree of consumers and sellers, resulting in frequent problems such as low patent transformation efficiency and poor transaction quality. This paper proposes a method of recommending patents to consumers by experts to improve the environment of patent transactions. Through the analysis of the past transaction information of the patent, the effective path information of the target is extracted. The graph neural network is used to describe the characteristics and semantics among experts, patents and consumers, and then capture the potential weight among them through the common attention mechanism, and then dynamically integrate them to predict the occurrence of recommendation behavior. The paper makes reasonable use of social information and expert information in the transaction, which significantly improves the rationality and accuracy of expert recommendation. © 2023 IEEE.

关键词： Patents and inventions

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：