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

Distantly-Supervised Named Entity Recognition with Adaptive Teacher Learning and Fine-grained Student Ensemble

学校读者我要写书评

暂无评论

arXiv 2022年

作者： Qu, Xiaoye Zeng, Jun Liu, Daizong Wang, Zhefeng Huai, Baoxing Zhou, Pan Huawei Cloud China School of Software Engineering Huazhong University of Science and Technology China Peking University China Hubei Key Laboratory of Distributed System Security Hubei Engineering Research Center on Big Data Security School of Cyber Science and Engineering Huazhong University of Science and Technology China

Distantly-Supervised Named Entity Recognition (DS-NER) effectively alleviates the data scarcity problem in NER by automatically generating training samples. Unfortunately, the distant supervision may induce noisy labels, thus undermining the robustness of the learned models and restricting the practical application. To relieve this problem, recent works adopt self-training teacher-student frameworks to gradually refine the training labels and improve the generalization ability of NER models. However, we argue that the performance of the current self-training frameworks for DS-NER is severely underestimated by their plain designs, including both inadequate student learning and coarse-grained teacher updating. Therefore, in this paper, we make the first attempt to alleviate these issues by proposing: (1) adaptive teacher learning comprised of joint training of two teacher-student networks and considering both consistent and inconsistent predictions between two teachers, thus promoting comprehensive student learning. (2) fine-grained student ensemble that updates each fragment of the teacher model with a temporal moving average of the corresponding fragment of the student, which enhances consistent predictions on each model fragment against noise. To verify the effectiveness of our proposed method, we conduct experiments on four DS-NER datasets. The experimental results demonstrate that our method significantly surpasses previous SOTA methods. The code is available at https://***/zenhjunpro/ATSEN. © 2022, CC BY.

关键词： Students

Hard Sample Matters a Lot in Zero-Shot Quantization

学校读者我要写书评

暂无评论

arXiv 2023年

作者： Li, Huantong Wu, Xiangmiao Lv, Fanbing Liao, Daihai Li, Thomas H. Zhang, Yonggang Han, Bo Tan, Mingkui South China University of Technology China Changsha Hisense Intelligent System Research Institute Co. Ltd China Hong Kong Baptist University Hong Kong Key Laboratory of Big Data and Intelligent Robot Ministry of Education China PengCheng Laboratory China Information Technology R&D Innovation Center of Peking University China School of Electronic and Computer Engineering Peking University Shenzhen Graduate School Shenzhen China

Zero-shot quantization (ZSQ) is promising for compressing and accelerating deep neural networks when the data for training full-precision models are inaccessible. In ZSQ, network quantization is performed using synthetic samples, thus, the performance of quantized models depends heavily on the quality of synthetic samples. Nonetheless, we find that the synthetic samples constructed in existing ZSQ methods can be easily fitted by models. Accordingly, quantized models obtained by these methods suffer from significant performance degradation on hard samples. To address this issue, we propose HArd sample Synthesizing and Training (HAST). Specifically, HAST pays more attention to hard samples when synthesizing samples and makes synthetic samples hard to fit when training quantized models. HAST aligns features extracted by full-precision and quantized models to ensure the similarity between features extracted by these two models. Extensive experiments show that HAST significantly outperforms existing ZSQ methods, achieving performance comparable to models that are quantized with real data. Copyright © 2023, The Authors. All rights reserved.

关键词： Deep neural networks

Dockformer: A transformer-based molecular docking paradigm for large-scale virtual screening

学校读者我要写书评

暂无评论

arXiv 2024年

作者： Yang, Zhangfan Ji, Junkai He, Shan Li, Jianqiang He, Tiantian Bai, Ruibin Zhu, Zexuan Ong, Yew Soon School of Computer Science University of Nottingham Ningbo Ningbo315199 China National Engineering Laboratory for Big Data System Computing Technology Shenzhen University Shenzhen518060 China Singapore138632 Singapore School of Computer Science University of Birmingham BirminghamB15 2TT United Kingdom School of Computer Science and Engineering Nanyang Technological University Nanyang Avenue 639798 Singapore

Molecular docking is a crucial step in drug development, which enables the virtual screening of compound libraries to identify potential ligands that target proteins of interest. However, the computational complexity of traditional docking models increases as the size of the compound library increases. Recently, deep learning algorithms can provide data-driven research and development models to increase the speed of the docking process. Unfortunately, few models can achieve superior screening performance compared to that of traditional models. Therefore, a novel deep learning-based docking approach named Dockformer is introduced in this study. Dockformer leverages multimodal information to capture the geometric topology and structural knowledge of molecules and can directly generate binding conformations with the corresponding confidence measures in an end-to-end manner. The experimental results show that Dockformer achieves success rates of 90.53% and 82.71% on the PDBbind core set and PoseBusters benchmarks, respectively, and more than a 100-fold increase in the inference process speed, outperforming almost all state-of-the-art docking methods. In addition, the ability of Dockformer to identify the main protease inhibitors of coronaviruses is demonstrated in a real-world virtual screening scenario. Considering its high docking accuracy and screening efficiency, Dockformer can be regarded as a powerful and robust tool in the field of drug design. © 2024, CC BY-NC-ND.

关键词： Molecular docking

Dynamic Searchable Scheme with Forward Privacy for Encrypted Document Similarity

学校读者我要写书评

暂无评论

Dynamic Searchable Scheme with Forward Privacy for Encrypted...

IEEE International Conference on Trust, Security and Privacy in Computing and Communications (TrustCom)

作者： Mustafa A. Al Sibahee Chengwen Luo Jin Zhang Yijing Huang Zaid Ameen Abduljabbar National Engineering Laboratory for Big Data System Computing Technology Shenzhen University Shenzhen PR China College of Computer Science and Software Engineering Shenzhen University Shenzhen PR China Computer Technology Engineering Department Iraq University College Basrah Iraq Department of Computer Science College of Education for Pure Sciences University of Basrah Basrah Iraq Shenzhen Institute Huazhong University of Science and Technology Shenzhen PR China

ISBN: (数字)9798350381993

ISBN: (纸本)9798350382006

Document retrieval plays an essential role in many real-world applications especially when the data storage is outsourced. Due to the great advantages offered by cloud computing, clients tend to outsource their personal data to remote servers maintained by external service providers. This raises serious privacy concerns about outsourced data because such providers are usually considered untrusted entities. The majority of previous schemes of document similarity search share the same limitation: they focus mainly on static collections. Dynamic searchable schemes (DSE) allow adding or removing documents at the expense of more leakage than static schemes. To thwart certain attacks, DSE schemes should support forward privacy property, which ensures that newly added documents cannot be related to previously issued search queries. We design and implement dynamic secure similarity search schemes with forward privacy for textual documents utilizing simhash method for hamming similarity. Our scheme provides an efficient search time and a sufficient level of privacy. To show the practicality of our proposed scheme, we performed excremental results with large document collections.

关键词： Privacy data privacy Cloud computing Memory Search problems Cryptography Servers

Delay-Sensitive Goods Delivery and In-Situ Sensing Using A Multi-Task Drone

学校读者我要写书评

暂无评论

IEEE Transactions on Mobile Computing 2025年

作者： Liu, Bin Ni, Wei Liu, Ren Ping Guo, Y. Jay Zhu, Hongbo Nanjing University of Posts and Telecommunications Jiangsu Key Laboratory of Wireless Communications Nanjing210003 China Nanjing University of Posts and Telecommunications Engineering Research Center of Health Service System Based on Ubiquitous Wireless Networks Ministry of Education Nanjing210003 China University of Technology Sydney Global Big Data Technologies Centre UltimoNSW Australia Barkhausen Institut Technische Universität Dresden Dresden Germany DATA61 CSIRO MarsfieldNSW2122 Australia

Drones are evolving into highly capable and adaptable devices, prompting the development of advanced control frameworks. This paper introduces a novel online control framework tailored for a multi-task drone, explicitly addressing the simultaneous execution of in-situ sensing and goods delivery. To tackle this complex scenario, a finite-horizon Markov decision process (FH-MDP) is formulated to ensure not only the prompt delivery of goods but also the minimization of energy consumption and the maximization of the drone's reward for in-situ sensing. A significant contribution lies in establishing the monotonicity and subadditivity of the FH-MDP. This mathematical foundation provides evidence for the existence of an optimal, monotone, deterministic Markovian policy. The crux of the optimal policy revolves around flight distance- and time-related thresholds, determining the precise points at which the drone should switch its optimal action. This unique feature empowers the multi-task drone to make real-time decisions, such as adjusting flight speed or engaging in in-situ sensing, by comparing its current state with these predefined thresholds. This process can be accomplished with a linear complexity, ensuring efficiency in decision-making. The optimality of our approach is rigorously demonstrated through numerical validation, where it is compared against a computationally expensive, dynamic programming-based alternative. Under the considered simulation settings, our approach reduces drone energy consumption by a substantial 19.8% compared to existing benchmarks. This not only highlights the practical effectiveness of the proposed framework but also underscores its potential for significant advancements in the field of drone operations and energy efficiency. © 2002-2012 IEEE.

关键词： Markov processes

GenFace: A Large-Scale Fine-Grained Face Forgery Benchmark and Cross Appearance-Edge Learning

学校读者我要写书评

暂无评论

arXiv 2024年

作者： Zhang, Yaning Yu, Zitong Wang, Tianyi Huang, Xiaobin Shen, Linlin Gao, Zan Ren, Jianfeng Computer Vision Institute College of Computer Science and Software Engineering Shenzhen University Shenzhen518060 China School of Computing and Information Technology Great Bay University Dongguan523000 China National Engineering Laboratory for Big Data System Computing Technology Shenzhen University Shenzhen518060 China Nanyang Technological University 50 Nanyang Ave Block N 4 639798 Singapore Shenzhen Institute of Artificial Intelligence and Robotics for Society Shenzhen518129 China Guangdong Key Laboratory of Intelligent Information Processing Shenzhen University China Jinan250014 China Key Laboratory of Computer Vision and System Ministry of Education Tianjin University of Technology Tianjin300384 China School of Computer Science University of Nottingham Ningbo China

The rapid advancement of photorealistic generators has reached a critical juncture where the discrepancy between authentic and manipulated images is increasingly indistinguishable. Thus, benchmarking and advancing techniques detecting digital manipulation become an urgent issue. Although there have been a number of publicly available face forgery datasets, the forgery faces are mostly generated using GAN-based synthesis technology, which does not involve the most recent technologies like diffusion. The diversity and quality of images generated by diffusion models have been significantly improved and thus a much more challenging face forgery dataset shall be used to evaluate SOTA forgery detection literature. In this paper, we propose a large-scale, diverse, and fine-grained high-fidelity dataset, namely GenFace, to facilitate the advancement of deepfake detection, which contains a large number of forgery faces generated by advanced generators such as the diffusion-based model and more detailed labels about the manipulation approaches and adopted generators. In addition to evaluating SOTA approaches on our benchmark, we design an innovative Cross Appearance-Edge Learning (CAEL) detector to capture multi-grained appearance and edge global representations, and detect discriminative and general forgery traces. Moreover, we devise an Appearance-Edge Cross-Attention (AECA) module to explore the various integrations across two domains. Extensive experiment results and visualizations show that our detection model outperforms the state of the arts on different settings like cross-generator, cross-forgery, and cross-dataset evaluations. Code and datasets will be available at https://***/Jenine-321/GenFace. Copyright © 2024, The Authors. All rights reserved.

关键词： Image enhancement

Quantum reversible circuits for multiplicative inverse

学校读者我要写书评

暂无评论

EPJ Quantum technology 2022年第1期9卷 1-17页

作者： Luo, Qing-bin Yang, Guo-wu Li, Xiao-yu Li, Qiang Department of Computer Science and Technology School of Information Engineering Hubei Minzu University Enshi China School of Information and Software Engineering University of Electronic Science and Technology of China Chengdu China Big data research Center & School of Computer Science and Engineering University of Electronic Science and Technology of China Chengdu China Advanced Cryptography and System Security Key Laboratory of Sichuan Province Chengdu University of Information Technology Chengdu China

The synthesis of quantum circuits for multiplicative inverse over $\operatorname{GF}(2^{8})$ are discussed in this paper. We first convert the multiplicative inverse operation in $\operatorname{GF}(2^{8})$ to arithmetic operations in the composite field $\operatorname{GF}((2^{4})^{2})$ , and then discuss the expressions of the square calculation, the inversion calculation and the multiplication calculation separately in the finite field $\operatorname{GF}(2^{4})$ , where the expressions of multiplication calculation in $\operatorname{GF}(2^{4})$ are given directly in $\operatorname{GF}(2^{4})$ and given through being transformed into the composite field $\operatorname{GF}((2^{2})^{2})$ . Then the quantum circuits of these calculations are realized one by one. Finally, two quantum circuits for multiplicative inverse over $\operatorname{GF}(2^{8})$ are synthesized. They both use 21 qubits, the first quantum circuit uses 55 Toffoli gates and 107 CNOT gates and the second one uses 37 Toffoli gates and 209 CNOT gates. As an example of the application of multiplication inverse, we apply these quantum circuits to the implementations of the S-box quantum circuit of the AES cryptographic algorithm. Two quantum circuits for implementing the S-box of the AES cryptographic algorithm are presented. The first quantum circuit uses 21 qubits, 55 Toffoli gates, 131 CNOT gates and 4 NOT gates and the second one uses 21 qubits, 37 Toffoli gates, 233 CNOT gates and 4 NOT gates. Through the evaluation of quantum cost, the two quantum circuits of the S-box of AES cryptographic algorithm use less quantum resources than the existing schemes.

关键词：

A Two-Stage Missing Value Imputation Method Based on Autoencoder Neural Network

学校读者我要写书评

暂无评论

A Two-Stage Missing Value Imputation Method Based on Autoenc...

IEEE International Conference on big data

作者： Jiayin Yu Yulin He Joshua Zhexue Huang College of Computer Science & Software Engineering Shenzhen University Shenzhen China National Engineering Laboratory for Big Data System Computing Technology Shenzhen University Shenzhen China

ISBN: (纸本)9781665445993

Due to the ubiquitous presence of missing values in real-world datasets, an imputation algorithm can recover the missing values and provide users with a complete dataset that utilizes all the available observed information. However, most of the imputation methods still have several limitations, including cannot restore the original distribution, handling various data missing patterns, and high missing rate dataset. In this poster, a novel neural network-based two-stage missing value imputation (abbreviated as TS-MVI) method is proposed to fill an incomplete condition attribute with the optimized attribute values for the supervised learning task. By initializing the missing values with random numbers, the imputation values are iteratively adjusted based on the new updating rule by minimizing both the autoencoder-oriented objective function and neural network-based classification error. The persuasive experiments show that TS-MVl method significantly outperforms current state-of-the-art imputation methods and thus demonstrate TS-MVI is a viable approach to deal with the missing value imputation problem.

关键词： Conferences Supervised learning Neural networks big data Linear programming Task analysis

Random Sample Partition-Based Clustering Ensemble Algorithm for big data

学校读者我要写书评

暂无评论

Random Sample Partition-Based Clustering Ensemble Algorithm ...

IEEE International Conference on big data

作者： Xueqin Du Yulin He Joshua Zhexue Huang College of Computer Science & Software Engineering Shenzhen University Shenzhen China National Engineering Laboratory for Big Data System Computing Technology Shenzhen University Shenzhen China

ISBN: (纸本)9781665445993

A novel random sample partition-based clustering ensemble (RSP-CE) algorithm is proposed in this paper to handle the big data clustering problems. There are three key components in RSP-CE algorithm, i.e., generating the base clustering results on RSP data blocks, harmonizing the based clustering results with maximum mean discrepancy (MMD) criterion, and refining the RSP clustering results. RSP data blocks have the consistent sample distributions with the whole big data and thus provide the possibility for using base clustering results on different data subsets to approximate the clustering result on whole big data. The experimental results in comparison with other 5 well-known clustering ensemble algorithms on 4 big data sets show that RSP-CE algorithm obtains the better normalized mutual information (NMI) values and Fowlkes-Mallows Index (FMI) values with the less training time consumptions and thus demonstrate that RSP-CE algorithm is a viable approach to deal with the big data clustering problems.

关键词： Training Conferences Refining Clustering algorithms big data Approximation algorithms Partitioning algorithms