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

Conditional Privacy-Preserving Transaction for the Unspent Transaction Output-Based Multi-Chain Blockchain System

IEEE Transactions on Computers 2025年第07期74卷 2473-2486页

作者： Cui, Jie Zhuang, Wenting Zhong, Hong Zhang, Qingyang Wang, Fengqun He, Debiao Anhui University Key Laboratory of Intelligent Computing and Signal Processing of Ministry of Education School of Computer Science and Technology Hefei230039 China Anhui University Anhui Engineering Laboratory of IoT Security Technologies Hefei230039 China Wuhan University School of Cyber Science and Engineering Wuhan430072 China MatrixElements Technologies Shanghai Key Laboratory of Privacy Preserving Computation Shanghai201204 China

The anonymity of blockchain may be exploited by criminals for illegal fund transfers, thus a conditional privacy-preserving scheme is important for blockchain regulation. Currently, sharding technology under a multi-chain architecture is used to improve blockchain scalability. However, current conditional privacy-preserving schemes cannot work on this architecture. To protect the privacy of the transaction, we present a conditional privacy-preserving transaction scheme (MC-CPPT) for multi-chain blockchain system. In this system, we proposed a zero-knowledge proof based anonymous transaction, in terms of the identities of transaction participants and amounts, which also enables the unlinkability of transactions and indistinguishability between cross-chain and intra-chain transactions in multi-chain blockchain system. In addition, a multi-node regulatory agency is introduced to control the transaction amount and frequency in the system without a single point of failure. Moreover, an ECC-based encryption scheme is proposed to achieve the traceability of suspicious transactions. A security model is defined and the security of MC-CPPT is demonstrated to meet the expected security goals. Evaluating the prototype revealed acceptable performance and additional security features. © 1968-2012 IEEE.

关键词： Anonymity

来源：评论

学校读者我要写书评

暂无评论

Spatio-Temporal Context Modeling for Road Obstacle Detection 1

引用

4th International Conference on Machine Learning for Cyber Security, ML4CS 2022

作者： Wu, Xiuen Wang, Tao Liang, Lingyu Li, Zuoyong Ching, Fum Yew College of Computer and Data Science Fuzhou University Fuzhou350108 China Fujian Provincial Key Laboratory of Information Processing and Intelligent Control Minjiang University Fuzhou350108 China The Key Laboratory of Cognitive Computing and Intelligent Information Processing of Fujian Education Institutions Wuyi University Wuyishan354300 China School of Electronic and Information Engineering South China University of Technology Guangzhou510641 China Ministry of Education Key Laboratory of Computer Network and Information Integration Southeast University Nanjing211189 China Guangzhou510320 China Penang11800 Malaysia

ISBN: (数字)9783031200960

ISBN: (纸本)9783031200953

Road obstacle detection is an important problem for vehicle driving safety. In this paper, we aim to obtain robust road obstacle detection based on spatio-temporal context modeling. Firstly, a data-driven spatial context model of the driving scene is constructed with the layouts of the training data. Then, obstacles in the input image are detected via the state-of-the-art object detection algorithms, and the results are combined with the generated scene layout. In addition, to further improve the performance and robustness, temporal information in the image sequence is taken into consideration, and the optical flow is obtained in the vicinity of the detected objects to track the obstacles across neighboring frames. Qualitative and quantitative experiments were conducted on the Small Obstacle Detection (SOD) dataset and the Lost and Found dataset. The results indicate that our method with spatio-temporal context modeling is superior to existing methods for road obstacle detection. © 2023, The Author(s), under exclusive license to Springer Nature Switzerland AG.

关键词： Object detection

来源：评论

学校读者我要写书评

暂无评论

Y-Mol: A Multiscale Biomedical Knowledge-Guided Large Language Model for Drug Development

arXiv

引用

arXiv 2024年

作者： Ma, Tengfei Lin, Xuan Li, Tianle Li, Chaoyi Chen, Long Zhou, Peng Cai, Xibao Yang, Xinyu Zeng, Daojian Cao, Dongsheng Zeng, Xiangxiang College of Computer Science and Electronic Engineering Hunan University China Key Laboratory of Intelligent Computing and Information Processing Ministry of Education Xiangtan University China Hunan Provincial Key Laboratory of Intelligent Computing and Language Information Processing Hunan Normal University China Xiangya School of Pharmaceutical Sciences Central South University China

Large Language Models (LLMs) have recently demonstrated remarkable performance in general tasks across various fields. However, their effectiveness within specific domains such as drug development remains challenges. To solve these challenges, we introduce Y-Mol, forming a well-established LLM paradigm for the flow of drug development. Y-Mol is a multiscale biomedical knowledge-guided LLM designed to accomplish tasks across lead compound discovery, pre-clinic, and clinic prediction. By integrating millions of multiscale biomedical knowledge and using LLaMA2 as the base LLM, Y-Mol augments the reasoning capability in the biomedical domain by learning from a corpus of publications, knowledge graphs, and expert-designed synthetic data. The capability is further enriched with three types of drug-oriented instructions: description-based prompts from processed publications, semantic-based prompts for extracting associations from knowledge graphs, and template-based prompts for understanding expert knowledge from biomedical tools. Besides, Y-Mol offers a set of LLM paradigms that can autonomously execute the downstream tasks across the entire process of drug development, including virtual screening, drug design, pharmacological properties prediction, and drug-related interaction prediction. Our extensive evaluations of various biomedical sources demonstrate that Y-Mol significantly outperforms general-purpose LLMs in discovering lead compounds, predicting molecular properties, and identifying drug interaction events. The source code is available at https://***/r/Y-Mol. © 2024, CC BY.

关键词： Semantics

来源：评论

学校读者我要写书评

暂无评论

Structure-constrain Source Free Domain Adaptation with Regularized Knowledge Distillation of Source Model

Structure-constrain Source Free Domain Adaptation with Regul...

引用

Data Driven Control and Learning Systems (DDCLS)

作者： Dan Yang Xin Peng Cheng Su Dayu Tan Chaoyang Chen Weimin Zhong Key Laboratory of Smart Manufacturing in Energy Chemical Process Ministry of Education East China University of Science and Technology Shanghai China Key Laboratory of Intelligent Computing and Signal Processing Ministry of Education Anhui University Hefei Anhui China School of Information and Electrical Engineering Hunan University of Science and Technology Xiangtan China

ISBN: (数字)9798350361674

ISBN: (纸本)9798350361681

Transfer learning aims to leverage the knowledge of the source domain to help the learning of unlabeled target domain models. However, all conventional transfer learning methods assume that samples from source and target domains are always freely accessible. However, this assumption is rarely plausible in real-world due to data privacy. To combat this challenge, we introduce Structure-constrain Source Free Domain Adaptation with regularized Knowledge Distillation of source model (SSFDA-KD). Our method is based on the observations that a deterministic classification result can be obtained when the target data distribution aligns with the source data distribution, and a well-trained model not only yields a deterministic classification for a sample but also has clear category boundaries, which implies samples that are close together belong to the same category. From those, we first generate the source model with labeled source data, which is regarded as a well-trained model. Then, we identify target prototypes with lower self-entropy and assign the pseudo-labels to other samples according to the neighborhood structure. Finally, we refine the target model by minimizing prediction loss, constraining internal structure via triplet loss, and reducing knowledge distillation loss. Experiments of fault diagnosis based on WWTPs are conducted to validate its effectiveness.

关键词： Fault diagnosis Learning systems Adaptation models Data privacy Transfer learning Prototypes Predictive models

来源：评论

学校读者我要写书评

暂无评论

TWO-GRID ALGORITHM OF H^(1)-GALERKIN MIXED FINITE ELEMENT METHODS FOR SEMILINEAR PARABOLIC INTEGRO-DIFFERENTIAL EQUATIONS

引用

Journal of Computational Mathematics 2022年第5期40卷 667-685页

作者： Tianliang Hou Chunmei Liu Chunlei Dai Luoping Chen Yin Yang School of Mathematics and Statistics Beihua UniversityJilin 132013China College of Science Hunan University of Science and EngineeringYongzhou 425199China School of Mathematics Southwest Jiaotong UniversityChengdu 611756China Hunan Key Laboratory for Computation and Simulation in Science and Engineering Key Laboratory of Intelligent Computing&Information Processing of Ministry of EducationSchool of Mathematics and Computational ScienceXiangtan UniversityXiangtan 411105China

In this paper,we present a two-grid discretization scheme for semilinear parabolic integro-differential equations by H1-Galerkin mixed finite element *** use the lowest order Raviart-Thomas mixed finite elements and continuous linear finite element for spatial discretization,and backward Euler scheme for temporal ***,a priori error estimates and some superclose properties are ***,a two-grid scheme is presented and its convergence is *** the proposed two-grid scheme,the solution of the nonlinear system on a fine grid is reduced to the solution of the nonlinear system on a much coarser grid and the solution of two symmetric and positive definite linear algebraic equations on the fine grid and the resulting solution still maintains optimal ***,a numerical experiment is implemented to verify theoretical results of the proposed *** theoretical and numerical results show that the two-grid method achieves the same convergence property as the one-grid method with the choice h=H^(2).

关键词： Semilinear parabolic integro-differential equations H^(1)-Galerkin mixed finite element method A priori error estimates Two-grid Superclose.

来源：评论

学校读者我要写书评

暂无评论

High-accurate and efficient numerical algorithms for the self-consistent field theory of liquid-crystalline polymers

引用

Computers & Mathematics with Applications 2025年 194卷 31-52页

作者： Zhijuan He Kai Jiang Liwei Tan Xin Wang Hunan Key Laboratory for Computation and Simulation in Science and Engineering Key Laboratory of Intelligent Computing and Information Processing of Ministry of Education School of Mathematics and Computational Science Xiangtan University Xiangtan Hunan 411105 China School of Mathematical Sciences Shanghai Jiao Tong University Shanghai 200240 China

Self-consistent field theory (SCFT) is one of the most widely-used frameworks in studying the equilibrium phase behavior of inhomogeneous polymers. For liquid-crystalline polymeric systems, the primary numerical challenges in solving SCFT involve efficiently solving a large number of 6-dimensional (6D, 3D space + 2D orientation + 1D contour) partial differential equations (PDEs), accurately determining subtle energy differences between self-assembled structures, and developing effective iterative methods for nonlinear SCFT iterations. To address these challenges, this work introduces a suite of high-order and efficient numerical methods tailored to SCFT of liquid-crystalline polymers. These methods include various advanced PDE solvers, an improved Anderson iteration algorithm to accelerate SCFT calculations, and an optimization technique for adjusting the computational domain during SCFT iterations. Extensive numerical tests demonstrate the efficiency of the proposed methods. Based on these algorithms, we further explore the self-assembly behavior of liquid-crystalline polymers through 4D, 5D, and 6D simulations, uncovering intricate 3D spatial structures.

关键词：

来源：评论

学校读者我要写书评

暂无评论

Pseudo Multi-Source Domain Extension and Selective Pseudo-Labeling for Unsupervised Domain Adaptive Medical Image Segmentation

Pseudo Multi-Source Domain Extension and Selective Pseudo-La...

引用

International Conference on Acoustics, Speech, and signal processing (ICASSP)

作者： Xiaokang Liu Zhiqiang Wang Kai Hu Xieping Gao Key Laboratory of Intelligent Computing and Information Processing of Ministry of Education Xiangtan University Xiangtan China College of Medical Imaging Laboratory and Rehabilitation Xiangnan University Chenzhou China Hunan Provincial Key Laboratory of Intelligent Computing and Language Information Processing Hunan Normal University Changsha China

Unsupervised domain adaptation (UDA) attracts extra attention in medical image processing because no additional labels are required when adapting to different distributions. In this work, we propose a novel unsupervised domain adaptation framework named as Domain Expansion and PseudoLabeling (DEPL). We extend the domain of a labeled source domain data to four different distributed domains and use adversarial learning to align the image appearance level and feature level from the four different domains to the unlabeled target domain. In addition, we propose a selective pseudolabeling mechanism, namely using strong confidence pseudolabeling to boost model performance. We evaluate our model for the MR to CT adaptation segmentation task on the public dataset MMWHS. Compared to seven other state-of-the-art segmentation methods, our DEPL achieves the best Dice similarity coefficient by 82.4%, which is at least 3.9% higher than the other UDA segmentation methods.

关键词： Image segmentation Adaptation models Computed tomography Distributed databases signal processing Adversarial machine learning Biomedical image processing

来源：评论

学校读者我要写书评

暂无评论

BMDP:Blockchain-Based Multi-Cloud Storage Data Provenance 26

BMDP:Blockchain-Based Multi-Cloud Storage Data Provenance

引用

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

作者： Wang, Feiyu Zhou, Jian-Tao Guo, Xu Inner Mongolia University College of Computer Science Inner Mongolia Hohhot China 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 Natl. Loc. Jt. Eng. Research Center of Intelligent Information Processing Technology for Mongolian Inner Mongolia Engineering Laboratory for Cloud Computing and Service Software China

ISBN: (纸本)9798350331684

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. © 2023 IEEE.

关键词： Smart contract

来源：评论

学校读者我要写书评

暂无评论

A Relay Buffer Prediction Method Based on LSTM in Terminal Cooperative Communication

A Relay Buffer Prediction Method Based on LSTM in Terminal C...

引用

International Conference on Communication Technology (ICCT)

作者： Jie Fei Hui Zhi Kui Tie Key Laboratory of Intelligent Computing and Signal Processing of Ministry of Education School of Electronic and Information Engineering Anhui University Hefei China Ceyear Technologies (AnHui) CO. LTD Bengbu China

In terminal cooperative communication, relay assisted communication with buffer has significant advantages in improving system throughput, signal-to-noise ratio, and reducing system outage probability. The existing relay methods with buffer are all fixed buffer method with a fixed size of the buffer and only considering relay wholehearted cooperation and forwarding, that is, all buffer of the relay assists communication. However, when the forwarding task is small and there is a large idle in forwarding buffer, the buffer area cannot be fully utilized. When the forwarding task is large and forwarding buffer is busy, packet loss may occur in the forwarding task. In order to improve the usage efficiency of relay buffer and reduce packet loss, this paper proposes a relay buffer prediction method based on the long short-term memory network to predict the amount of data that the relay needs to forward. According to the prediction, the size of the relay buffer is divided, so that the buffer can be dynamically adjusted on demand. Simulation results show that, compared with the fixed buffer method, the relay buffer prediction method has a better buffer usage efficiency and a lower packet loss rate.

关键词：

来源：评论

学校读者我要写书评

暂无评论

Using Rough Sets to Improve the High-dimensional Data Anomaly Detection Method Based on Extended Isolation Forest 26

Using Rough Sets to Improve the High-dimensional Data Anomal...

引用

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

作者： Liu, Hanlin Zhou, Jiantao Li, Hua Inner Mongolia University College of Computer Science Hohhot China Natl. Loc. Jt. Eng. Research Center of Intelligent Information Processing Technology for Mongolian Engineering Research Center of Ecological Big Data Ministry of Education Inner Mongolia Engineering Laboratory for Cloud Computing and Service Software Inner Mongolia Key Laboratory of Social Computing and Data Processing Inner Mongolia Key Laboratory of Discipline Inspection and Supervision Big Data Inner Mongolia Engineering Laboratory for Big Data Analysis Technology Hohhot China

ISBN: (纸本)9798350331684

Anomaly detection refers to the identification of data objects that deviate from the general data distribution. One of the important challenges in anomaly detection is handling high-dimensional data, especially when it contains a large number of redundant attributes. Although traditional Isolation Forest (iForest) and Extended Isolation Forest (EIF) have performed well in anomaly detection, the detection accuracy is still extremely influenced by redundant attributes. In this paper, we propose a two-tier architecture named RS-EIF, to alleviate the negative impact of redundant attributes. Specifically, the RS-EIF combines the rough set theory and EIF algorithm and provides an effective basis for the EIF-based anomaly detection method by removing redundant attributes with rough set theory. Experimental results show that the RS-EIF algorithm performs better than the iForest and EIF algorithms in terms of anomaly detection rate, and the results of the combination of rough set theory and EIF are more prominent compared to the other combination methods. © 2023 IEEE.

关键词： Anomaly detection

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：