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

Differential Private Discrete Noise Adding Mechanism: Conditions, Properties and Optimization

学校读者我要写书评

暂无评论

arXiv 2022年

作者： Qin, Shuying He, Jianping Fang, Chongrong Lam, James The Dept. of Automation Shanghai Jiao Tong University The Key Laboratory of System Control and Information Processing Ministry of Education of China Shanghai Engineering Research Center of Intelligent Control and Management Shanghai China The Dept. of Mechanical Engineering The University of Hong Kong Pokfulam Road Hong Kong

Differential privacy is a standard framework to quantify the privacy loss in the data anonymization process. To preserve differential privacy, a random noise adding mechanism is widely adopted, where the trade-off between data privacy level and data utility is of great concern. The privacy and utility properties for the continuous noise adding mechanism have been well studied. However, the related works are insufficient for the discrete random mechanism on discretely distributed data, e.g., traffic data, health records. This paper focuses on the discrete random noise adding mechanisms. We study the basic differential privacy conditions and properties for the general discrete random mechanisms, as well as the trade-off between data privacy and data utility. Specifically, we derive a sufficient and necessary condition for discrete ∊-differential privacy and a sufficient condition for discrete (∊, δ)-differential privacy, with the numerical estimation of differential privacy parameters. These conditions can be applied to analyze the differential privacy properties for the discrete noise adding mechanisms with various kinds of noises. Then, with the differential privacy guarantees, we propose an optimal discrete ∊-differential private noise adding mechanism under the utility-maximization framework, where the utility is characterized by the similarity of the statistical properties between the mechanism's input and output. For this setup, we find that the class of the discrete noise probability distributions in the optimal mechanism is Staircase-shaped. Copyright © 2022, The Authors. All rights reserved.

关键词： Probability distributions

A Single-Cell Clustering Algorithm Based on Structure Perturbation Non-Negative Matrix Factorization

学校读者我要写书评

暂无评论

A Single-Cell Clustering Algorithm Based on Structure Pertur...

IEEE International Conference on Bioinformatics and Biomedicine (BIBM)

作者： Hanjing Jiang Meineng Wang Luping Zhang Yu-An Huang Yangyuan Li Yabing Huang Key Laboratory of Image Information Processing and Intelligent Control of Education Ministry of China Institute of Artificial Intelligence School of Artificial Intelligence and Automation Huazhong University of Science and Technology Wuhan China School of Computer Science and Technology China University of Mining and Technology Xuzhou China School of Mathematics and Computer Science Yichun University Yichun China School of Information Engineering East China University of Technology Nanchang China School of Computer Science Northwestern Polytechnical University Xi’an China Department of Pathology Renmin Hospital of Wuhan University Wuhan China

ISBN: (数字)9798350386226

ISBN: (纸本)9798350386233

The advent of single-cell RNA sequencing (scRNA-seq) has facilitated the acquisition of high-resolution data regarding cell heterogeneity across various tissues. A fundamental and critical step in the analysis of scRNA-seq data is cell type identification. An appropriate graph construction strategy can reflect the topological structure between cells and allows for detailed exploration of the relationships between cells and genes. Given the sparsity of scRNA-seq data and the pronounced noise generated by shallow sequencing, choosing an appropriate graph construction strategy has become a significant challenge. In this paper, we propose a single-cell clustering method, named Sc-PNNMF, based on structural perturbation of nonnegative matrix factorization. Sc-PNNMF employs a structural perturbation algorithm to optimize the gene expression matrix. The optimized matrix guides the matrix factorization process, effectively overcoming the impact of data sparsity and significant noise in gene expression data on the graph construction strategy. We compared the clustering abilities of Sc-PNNMF with five other methods on ten real datasets.

关键词： Sequential analysis Perturbation methods Clustering methods RNA Noise Clustering algorithms Sparse matrices Gene expression Unsupervised learning Periodic structures

Arbitrary State Transition of Open Qubit System Based on Switching control

学校读者我要写书评

暂无评论

arXiv 2024年

作者： Wu, Guangpu Xue, Shibei Ma, Shan Kuang, Sen Dong, Daoyi Petersen, Ian R. Department of Automation Shanghai Jiao Tong University Shanghai200240 China Key Laboratory of System Control and Information Processing Ministry of Education of China Shanghai200240 China Shanghai Engineering Research Center of Intelligent Control and Management Shanghai200240 China School of Automation Central South University Changsha410083 China Department of Automation University of Science and Technology of China Hefei230027 China School of Engineering Australian National University CanberraACT2601 Australia

We present a switching control strategy based on Lyapunov control for arbitrary state transitions in open qubit systems. With coherent vector representation, we propose a switching control strategy, which can prevent the state of the qubit from entering invariant sets and singular value sets, effectively driving the system ultimately to a sufficiently small neighborhood of target states. In comparison to existing works, this control strategy relaxes the strict constraints on system models imposed by special target states. Furthermore, we identify conditions under which the open qubit system achieves finite-time stability (FTS) and finite-time contractive stability (FTCS), respectively. This represents a critical improvement in quantum state transitions, especially considering the asymptotic stability of arbitrary target states is unattainable in open quantum systems. The effectiveness of our proposed method is convincingly demonstrated through its application in a qubit system affected by various types of decoherence, including amplitude, dephasing and polarization decoherence. Copyright © 2024, The Authors. All rights reserved.

关键词： Asymptotic stability

A Dual-Functional Single-Atom Fe Nanozyme-Based Sensitive Colorimetric Sensor for Tannins Quantification in Brandy

学校读者我要写书评

暂无评论

SSRN

SSRN 2023年

作者： Hou, Changjun Wang, Xinrou Liu, Huan Qiao, Cailin Ma, Yi Luo, Huibo Huo, Danqun Key Laboratory for Biorheological Science and Technology of Ministry of Education Bioengineering College of Chongqing University Chongqing400044 China Chongqing Institute for Food and Drug Control Chongqing401121 China Liquor Making Biology Technology Application of Key Laboratory of Sichuan Province College of Bioengineering Sichuan University of Science and Engineering 188 University Town Yi bin644000 China Chongqing Key Laboratory of Bio-perception & Intelligent Information Processing School of Microelectronics and Communication Engineering Chongqing University Chongqing400044 China

Detection of tannins can be utilized as an approach for regulating food quality. Herein, a single-atom Fe nanozyme (Fe@CN-20)-based sensitive colorimetric sensor for tannins was initially developed. Fe@CN-20 had both laccase-like and oxidase-like activities, and has a high affinity for TMB with a Km value of 6.191×10-7 M. Therefore, the Fe@CN-20/TMB system can be sensitive to tannic acid due to the fact that tannins are easily oxidized. The linear range was 5 - 100 mg/L, and the detection limit was 0.13 mg/L (S/N=3). The entire testing process takes approximately 30 minutes. The sensing platform was further successfully utilized for quantifying tannins in five different brands of brandy. The sensing platform is characterized by great environmental stability, recyclability, remarkable sensitivity, and stability, all of which demonstrate its immense potential for rapid on-site detection of tannins. © 2023, The Authors. All rights reserved.

关键词： Tannins

Utility-Oriented Underwater image Quality Assessment Based on Transfer Learning

学校读者我要写书评

暂无评论

arXiv 2022年

作者： Chen, Weiling Lin, Rongfu Liao, Honggang Zhao, Tiesong Gu, Ke Le Callet, Patrick Fujian Key Lab for Intelligent Processing and Wireless Transmission of Media Information Fuzhou University Fuzhou350108 China Peng Cheng Laboratory Shenzhen518000 China The Faculty of Information Technology Beijing University of Technology Engineering Research Center of Intelligent Perception and Autonomous Control Ministry of Education Beijing Key Laboratory of Computational Intelligence and Intelligent System Beijing Artificial Intelligence Institute Beijing100124 China Équipe Image Perception et Interaction Laboratoire des Sciences du Numérique de Nantes Université de Nantes France

The widespread image applications have greatly promoted the vision-based tasks, in which the image Quality Assessment (IQA) technique has become an increasingly significant issue. For user enjoyment in multimedia systems, the IQA exploits image fidelity and aesthetics to characterize user experience;while for other tasks such as popular object recognition, there exists a low correlation between utilities and perceptions. In such cases, the fidelity-based and aesthetics-based IQA methods cannot be directly applied. To address this issue, this paper proposes a utility-oriented IQA in object recognition. In particular, we initialize our research in the scenario of underwater fish detection, which is a critical task that has not yet been perfectly addressed. Based on this task, we build an Underwater image Utility Database (UIUD) and a learning-based Underwater image Utility Measure (UIUM). Inspired by the top-down design of fidelity-based IQA, we exploit the deep models of object recognition and transfer their features to our UIUM. Experiments validate that the proposed transfer-learning-based UIUM achieves promising performance in the recognition task. We envision our research provides insights to bridge the researches of IQA and computer vision. Copyright © 2022, The Authors. All rights reserved.

关键词： Multimedia systems

Privacy-Preserving Brain-Computer Interfaces: A Systematic Review

学校读者我要写书评

暂无评论

arXiv 2024年

作者： Xia, Kun Duch, Wlodzislaw Sun, Yu Xu, Kedi Fang, Weili Luo, Hanbin Zhang, Yi Sang, Dong Xu, Xiaodong Wang, Fei-Yue Wu, Dongrui The Ministry of Education Key Laboratory of Image Processing and Intelligent Control School of Artificial Intelligence and Automation Huazhong University of Science and Technology Wuhan430074 China Zhejiang Lab Hangzhou311121 China The Department of Informatics School of Physics Astronomy and Informatics Neurocognitive Laboratory Center for Modern Interdisciplinary Technologies Nicolaus Copernicus University Torun Poland The Ministry of Education Key Laboratory for Biomedical Engineering Zhejiang University Hangzhou China The Zhejiang University School of Medicine National Clinical Research Center for Child Health Hangzhou China Department of Biomedical Engineering Zhejiang University Hangzhou China The School of Civil and Hydraulic Engineering Huazhong University of Science and Technology Wuhan430074 China The College of Public Administration Huazhong University of Science and Technology Wuhan430074 China The NetsUnion Clearing Corporation Beijing100045 China The State Key Laboratory for Management and Control of Complex Systems Institute of Automation Chinese Academy of Sciences Beijing100049 China

A brain-computer interface (BCI) establishes a direct communication pathway between the human brain and a computer. It has been widely used in medical diagnosis, rehabilitation, education, entertainment, etc. Most research so far focuses on making BCIs more accurate and reliable, but much less attention has been paid to their privacy. Developing a commercial BCI system usually requires close collaborations among multiple organizations, e.g., hospitals, universities, and/or companies. Input data in BCIs, e.g., electroencephalogram (EEG), contain rich privacy information, and the developed machine learning model is usually proprietary. Data and model transmission among different parties may incur significant privacy threats, and hence privacy protection in BCIs must be considered. Unfortunately, there does not exist any contemporary and comprehensive review on privacy-preserving BCIs. This paper fills this gap, by describing potential privacy threats and protection strategies in BCIs. It also points out several challenges and future research directions in developing privacy-preserving BCIs. © 2024, CC BY.

关键词： Differential privacy

Entity Representation Learning with Multimodal Neighbors for Link Prediction in Knowledge Graph

学校读者我要写书评

暂无评论

Entity Representation Learning with Multimodal Neighbors for...

International Conference on Computer and Communications (ICCC)

作者： Wenxuan Liu Hao Duan Zeng Li Jingdong Liu Hong Huo Tao Fang Shanghai Jiao Tong University China Key Laboratory of System Control and Information Processing Ministry of Education of China China Shanghai Engineering Research Center of Intelligent Control and Management China

ISBN: (纸本)9781665409513

Entity representation learning is both fundamental and crucial for link prediction in knowledge graph. Existing entity representation learning approaches mainly focus on learning from knowledge triples with single modal text data which could only describe the things or concepts in words. However, multimodal data commonly exists in the real worlds and may describe things or concepts from different aspects. Therefore, multimodal entities have emerged in knowledge graph in recent years, which greatly enrich the knowledge graph by different information. This paper focuses on how to learn more robust and comprehensive representations of multimodal entities for better link prediction. A new representation learning method for multimodal entities is proposed, called Graph Attention with Bi-pooling Representation Learning (GBRL), where multimodal fusion and knowledge embedding are combined for learning representations of an entity with consideration of its multimodal neighbors. Firstly, feature vectors are obtained by pre-trained models for each modality. Then, the bilinear pooling is utilized for combining feature vectors of multimodal entities into multimodal feature vectors. A two-layer graph attention module is followed to generate multimodal representations of an entity from its multimodal neighbors. Finally, the inception decoder uses multimodal knowledge embedding to calculate scores for link prediction. The experimental results have shown that the proposed method performs well on link prediction by consideration of multimodal entities comparing with traditional methods that using only single modal text data.

关键词： Representation learning Knowledge representation Feature extraction Decoding

Online Attentive Kernel-Based Temporal Difference Learning

学校读者我要写书评

暂无评论

arXiv 2022年

作者： Yang, Guang Chen, Xingguo Yang, Shangdong Wang, Huihui Dong, Shaokang Gao, Yang The the Jiangsu Key Laboratory of Big Data Security & Intelligent Processing Nanjing University of Posts and Telecommunications National Engineering Laboratory for Agri-Product Quality Traceability Beijing Technology and Business University China The State Key Laboratory for Novel Software Technology Nanjing University China The PCA Lab Key Lab of Intelligent Perception and Systems for High-Dimensional Information Ministry of Education Jiangsu Key Lab of Image and Video Understanding for Social Security School of Computer Science and Engineering Nanjing University of Science and Technology China

With rising uncertainty in the real world, online Reinforcement Learning (RL) has been receiving increasing attention due to its fast learning capability and improving data efficiency. However, online RL often suffers from complex Value Function Approximation (VFA) and catastrophic interference, creating difficulty for the deep neural network to be applied to an online RL algorithm in a fully online setting. Therefore, a simpler and more adaptive approach is introduced to evaluate value function with the kernel-based model. Sparse representations are superior at handling interference, indicating that competitive sparse representations should be learnable, non-prior, non-truncated and explicit when compared with current sparse representation methods. Moreover, in learning sparse representations, attention mechanisms are utilized to represent the degree of sparsification, and a smooth attentive function is introduced into the kernel-based VFA. In this paper, we propose an Online Attentive Kernel-Based Temporal Difference (OAKTD) algorithm using two-timescale optimization and provide convergence analysis of our proposed algorithm. Experimental evaluations showed that OAKTD outperformed several Online Kernel-based Temporal Difference (OKTD) learning algorithms in addition to the Temporal Difference (TD) learning algorithm with Tile Coding on public Mountain Car, Acrobot, CartPole and Puddle World tasks. Copyright © 2022, The Authors. All rights reserved.

关键词： Learning algorithms

Fully Circuit Implementation of a two-layer Memristive Neural Network for Pattern Recognition

学校读者我要写书评

暂无评论

Fully Circuit Implementation of a two-layer Memristive Neura...

International Conference on Information Science and Technology (ICIST)

作者： Mian Li Xiaoping Wang Zhanfei Chen School of Artificial Intelligence and Automation Huazhong University of Science and Technology Wuhan China School of Artificial Intelligence and Automation Key Laboratory of Image Processing and Intelligent Control of Education Ministry of China Huazhong University of Science and Technology Wuhan China

ISBN: (纸本)9781665412667;9781665429412

In this paper, a fully circuit implementation of Memristive Neural Network (MNN) is proposed. The forward calculation of the network is based on winner-take-all (WTA) mechanism. The weight updating is achieved through the difference of pre-spike and post-spike, which is more close to the biological weight adjustment mechanism. The network is implemented in a full circuit without additional control units. The designed circuit consists of four modules. The memristive crossbar array module with one-memristor (1M) unit structure can effectively calculate the vector-matrix multiplication with only one step. The switch S is replaced by the transistor in the designed leaky-integrate-and-fire (LIF) module, which can control the integration and leakage of the membrane voltage and realize the lateral inhibition between output neurons. Connecting the integrated monostable trigger and the difference circuit, the post-spike generating module can output the required post-spike. The signal switch module realizes the switching of signals connected to memristors by using voltage-controlled switches. The combination of two modules validly realizes weight updating. The functions of four modules are verified separately. We performed a simulation experiment of 5×3 pixels image classification based on the designed circuit in PSPICE. The circuit output results and the high classification accuracy prove the circuit can be effectively applied in pattern recognition. The noise experiment shows the robustness of the designed circuit.

关键词： Training Neurons Switches Robustness Pattern recognition Integrated circuit modeling Task analysis