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

arXiv 2024年

作者： Wang, Ping Chen, Chong Liao, Hao Vorobyov, Vadim V. Wrachtrup, Jörg Liu, Ren-Bao College of Education for the Future Beijing Normal University Zhuhai519087 China Department of Physics The Chinese University of Hong Kong New Territories Shatin Hong Kong Centre for Quantum Coherence The Chinese University of Hong Kong New Territories Shatin Hong Kong The Hong Kong Institute of Quantum Information Science and Technology The Chinese University of Hong Kong New Territories Shatin Hong Kong National Engineering Laboratory on Big Data System Computing Technology Guangdong Province Engineering Center of China-made High Performance Data Computing System College of Computer Science and Software Engineering Shenzhen University Shenzhen518060 China 3rd Institute of Physics Research Center SCoPE and IQST University of Stuttgart Stuttgart70569 Germany New Cornerstone Science Laboratory The Chinese University of Hong Kong New Territories Shatin Hong Kong

Test of macroscopic realism (MR) is key to understanding the foundation of quantum mechanics. Due to the existence of the non-invasive measurability loophole and other interpretation loopholes, however, such test remains an open question. Here we propose a general inequality based on high-order correlations of measurements for a loophole-free test of MR at the weak signal limit. Importantly, the inequality is established using the statistics of raw data recorded by classical devices, without requiring a specific model for the measurement process, so its violation would falsify MR without the interpretation loophole. The non-invasive measurability loophole is also closed, since the weak signal limit can be verified solely by measurement data (using the relative scaling behaviors of different orders of correlations). We demonstrate that the inequality can be broken by a quantum spin model. The inequality proposed here provides an unambiguous test of the MR principle and is also useful to characterizing quantum coherence. Copyright © 2024, The Authors. All rights reserved.

关键词： Quantum theory

来源：评论

学校读者我要写书评

暂无评论

A soft-masking continual pre-training method based on domain knowledge relevance

引用

information Processing & Management 2025年第6期62卷

作者： Lazhi Zhao Jianzhou Feng Huaxiao Qiu Chenghan Gu Haonan Qin School of Information Science and Engineering Yanshan University Qinhuangdao 066000 HeBei China The Key Laboratory for Software Engineering of Hebei Province Yanshan University Qinhuangdao 066000 HeBei China The Key Laboratory of Computer Virtualization Technology and System Integration of Hebei Province Yanshan University Qinhuangdao 066000 HeBei China

Most existing continual learning (CL) methods primarily focus on reducing catastrophic forgetting. Although some approaches have achieved CF-free learning, they often treat parameter optimization across tasks as a conflicting process. This assumption not only inhibits the learning of new tasks but also limits knowledge transfer between tasks. To address this, we propose a soft-masking continual pre-training method based on domain knowledge relevance (DKR) within the framework of continual domain-adaptive pre-training. Unlike traditional methods, DKR does not fully regard parameter optimization as adversarial. Instead, it dynamically applied soft masks to model parameters based on the degree of relevance between domain knowledge. Moreover, we introduce an efficient importance calculation method based on dual interactions between input and weights, which accurately assesses the importance of parameters. Our experimental results on six public datasets demonstrate that our method significantly outperforms existing methods in terms of mitigating forgetting. Specifically, DKR achieves negative forgetting with improvements of 1.95% in macro-F1 and 1.52% in accuracy over Naive CL(NCL).

关键词： Domain Knowledge

来源：评论

学校读者我要写书评

暂无评论

Universal deep network for steganalysis of color image based on channel representation

arXiv

引用

arXiv 2021年

作者： Wei, Kangkang Luo, Weiqi Tan, Shunquan Huang, Jiwu The Guangdong Key Lab of Information Security Technology School of Computer Science and Engineering Sun Yat-Sen University Guangzhou510006 China The College of Computer Science and Software Engineering Shenzhen University Shenzhen518060 China The Guangdong Key Laboratory of Intelligent Information Processing Shenzhen Key Laboratory of Media Security National Engineering Laboratory for Big Data System Computing Technology Shenzhen University Shenzhen518060 China

Up to now, most existing steganalytic methods are designed for grayscale images, and they are not suitable for color images that are widely used in current social networks. In this paper, we design a universal color image steganalysis network (called UCNet) in spatial and JPEG domains. The proposed method includes preprocessing, convolutional, and classification modules. To preserve the steganographic artifacts in each color channel, in preprocessing module, we firstly separate the input image into three channels according to the corresponding embedding spaces (i.e. RGB for spatial steganography and YCbCr for JPEG steganography), and then extract the image residuals with 62 fixed high-pass filters, finally concatenate all truncated residuals for subsequent analysis rather than adding them together with normal convolution like existing CNN-based steganalyzers. To accelerate the network convergence and effectively reduce the number of parameters, in convolutional module, we carefully design three types of layers with different shortcut connections and group convolution structures to further learn high-level steganalytic features. In classification module, we employ a global average pooling and fully connected layer for classification. We conduct extensive experiments on ALASKA II to demonstrate that the proposed method can achieve state-of-the-art results compared with the modern CNN-based steganalyzers (e.g., SRNet and J-YeNet) in both spatial and JPEG domains, while keeping relatively few memory requirements and training time. Furthermore, we also provide necessary descriptions and many ablation experiments to verify the rationality of the network design. Copyright © 2021, The Authors. All rights reserved.

关键词： Steganography

来源：评论

学校读者我要写书评

暂无评论

A Many-Objective Evolutionary Algorithm Assisted by Ideal Hyperplane

SSRN

引用

SSRN 2022年

作者： Zhang, Zhixia Wen, Jie Wang, Hui Cai, Xingjuan Cui, Zhihua Zhang, Wensheng School of Computer Science and Technology Taiyuan University of Science and Technology China School of Information Engineering Nanchang Institute of Technology Nanchang330099 China State Key Laboratory of Intelligent Control and Management of Complex System Institute of Automation Chinese Academy of Sciences China State Key Lab. for Novel Software Technology Nanjing University China

In many-objective optimization problems (MaOPs), it is a difficult task for evolutionary algorithms to balance convergence and diversity while rapidly converging to the Pareto front. As the number of objectives increases, the difficulty of evolutionary algorithms increases with individual selection pressure. To address above problems, we propose a many-objective evolution algorithm assisted by an ideal hyperplane (MaOEA-IH). Firstly, the ideal hyperplane as a reference surface to guide the individual to search the Pareto front, which is established from the extremum of each dimension of the objective space. Secondly, a parallel p -norm mating selection strategy is proposed to improve convergence. In addition, two factors are considered in this strategy: 1) different p -norm are used to measure different spatial scales;2) individual selection uncertainty is defined by incorporating a probabilistic perturbation mechanism. Thirdly, the improved shift-based density estimation strategy is used as the evaluation criterion for environmental selection to improve the convergence and diversity of solution sets and enhance selection pressure. To verify the effectiveness of the proposed algorithm, MAOEA-IH is compared with seven excellent algorithms in three benchmark sets (DTLZ, WFG and MaF). The results show that the proposed MAOEA-IH is highly competitive in solving MaOPs. © 2022, The Authors. All rights reserved.

关键词： Geometry

来源：评论

学校读者我要写书评

暂无评论

Double JPEG Compression Detection Based on Markov Model 18th

Double JPEG Compression Detection Based on Markov Model

引用

18th International Workshop on Digital Forensics and Watermarking, IWDW 2019

作者： Wang, Jinwei Huang, Wei Luo, Xiangyang Shi, Yung-Qing Nanjing University of Information Science and Technology Nanjing210044 China Department of Computer and Software Nanjing University of Information Science and Technology NanjingJiangsu210044 China Shanxi Key Laboratory of Network and System Security Xidian University Xi’an710071 China State Key Laboratory of Mathematical Engineering and Advanced Computing Zhengzhou450001 China State Key Laboratory of Information Security Institute Information Engineering Chinese Academy of Sciences Beijing100093 China Department of Electrical Computer Engineering New Jersey Institute of Technology NewarkNJ07102 United States

ISBN: (纸本)9783030435745

In this paper, a feature based on the Markov model in quaternion discrete cosine transform (QDCT) domain is proposed for double JPEG compression detection. Firstly, a given JPEG image is extracted from blocked images to obtain amplitude and three angles (ψ, φ, and θ). Secondly, when extracting the Markov features, we process the transition probability matrix with the corresponding refinement. Our proposed refinement method not only reduces redundant features, but also makes the acquired features more efficient for detection. Finally, a support vector machine (SVM) is employed for NA-DJPEG compression detection. It is well known that detecting NA-DJPEG compressed images with (Formula Presented) is a challenging task, and when the images with small size (i.e., 64 × 64), the detection will be more difficult. The experimental result indicates that our method can still achieve a high classification accuracy in this case. © 2020, Springer Nature Switzerland AG.

关键词： Support vector machines

来源：评论

学校读者我要写书评

暂无评论

Learning from pseudo lesion: A self-supervised framework for covid-19 diagnosis

arXiv

引用

arXiv 2021年

作者： Li, Zhongliang Jin, Zhihao Li, Xuechen Shen, Linlin Computer Vision Institute College of Computer Science and Software Engineering Shenzhen University Shenzhen518060 China National Engineering Laboratory for Big Data System Computing Technology Shenzhen University Shenzhen518060 China Guangdong Key Laboratory of Intelligent Information Processing Shenzhen University Shenzhen518060 China

The Coronavirus disease 2019 (COVID-19) has rapidly spread all over the world since its first report in December 2019 and thoracic computed tomography (CT) has become one of the main tools for its diagnosis. In recent years, deep learning-based approaches have shown impressive performance in myriad image recognition tasks. However, they usually require a large number of annotated data for training. Inspired by Ground Glass Opacity (GGO), a common finding in COIVD-19 patient's CT scans, we proposed in this paper a novel self-supervised pretraining method based on pseudo lesions generation and restoration for COVID-19 diagnosis. We used Perlin noise, a gradient noise based mathematical model, to generate lesion-like patterns, which were then randomly pasted to the lung regions of normal CT images to generate pseudo COVID-19 images. The pairs of normal and pseudo COVID-19 images were then used to train an encoder-decoder architecture based U-Net for image restoration, which does not require any labelled data. The pretrained encoder was then fine-tuned using labelled data for COVID-19 diagnosis task. Two public COVID- 19 diagnosis datasets made up of CT images were employed for evaluation. Comprehensive experimental results demonstrated that the proposed self-supervised learning approach could extract better feature representation for COVID-19 diagnosis and the accuracy of the proposed method outperformed the supervised model pretrained on large scale images by 6.57% and 3.03% on SARS-CoV-2 dataset and Jinan COVID-19 dataset, respectively. © 2021, CC BY-NC-SA.

关键词： Coronavirus

来源：评论

学校读者我要写书评

暂无评论

MedSteGAN: Medical Embedding-Optimized Steganography with Improved GAN

SSRN

引用

SSRN 2023年

作者： Peng, Yuxiang Fu, Chong Zheng, Yu Tian, Yunjia Cao, Guixing Chen, Junxin School of Computer Science and Engineering Northeastern University Liaoning Shenyang110819 China Engineering Research Center of Security Technology of Complex Network System Ministry of Education China Key Laboratory of Intelligent Computing in Medical Image Ministry of Education Northeastern University Liaoning Shenyang110819 China Department of Information Engineering The Chinese University of Hong Kong Ma Liu Shui Shatin New Territories Hong Kong Institute of Telecommunication Satellite China Academy of Space Technology Beijing100094 China School of Software Dalian University of Technology Liaoning Dalian116621 China

Medical diagnosing systems contain sensitive information, especially the resulting certificate of diagnosis that involves the patient’s privacy, required to be protected carefully. An effective way is to secretly embed privacy-sensitive information into medical-generated images, eventually being viewed as arbitrary images of nobody/nothing in public. The current research line of medical steganography targets simple data-hiding methods, yet remains barren in optimal embedding and stronger robustness. To fill this gap, we propose an end-to-end steganographic framework for medical images. Our idea is to integrate medical-image adaptive steganography with a generative adversarial network (GAN), named MedSteGAN. To improve both robustness, we design an optimized U-shape gen- erator that extracts features more efficiently utilizing larger kernel convolutions and the ReLU6 function. Also, deconvolutions are replaced by upsampling and convolution layers to avoid the checkerboard effect. To enhance security and image quality, we employ visual quality loss and mean squared error (MSE) loss based on the multi-scale structural similarity index metric (MS- SSIM) and the high-pass filters, respectively. Extensive experiments demonstrate that MedSteGAN outperforms state-of-the-art steganographic schemes in terms of robustness and image quality. © 2023, The Authors. All rights reserved.

关键词： Image quality

来源：评论

学校读者我要写书评

暂无评论

Research on a Novel Influence Maximization Algorithm Based on Community Structure

Research on a Novel Influence Maximization Algorithm Based o...

引用

作者： Jing Chen Jiangchuan Liu College of Information Science and Engineering Yanshan University Key Laboratory for Computer Virtual Technology and System Integration of Hebei Province Software Engineering Laboratory in Hebei Province

With the research of influence maximization algorithm, many researchers have found that the existing algorithm has the problem of overlapping influence of seed nodes. In order to solve the problem of overlapping influence of seed nodes, this paper proposes an IMCS algorithm based on community structure. Firstly, we divide the community through the central node, and the quality of community division is ensured by defining community fitness and node contribution. Then through the analysis of the community division results, the seed node selects the one with the largest degree. Since most of the nodes activated by seed nodes of different communities also belong to different communities, this method solves the problem of overlapping influence to a certain extent. The experimental results show that the effectiveness of the IMCS algorithm is verified under the real network, cooperative network and artificial network, and the IMCS algorithm has a better effect than IEIR and Degree algorithms in most networks under the IC model.

关键词： Seed node influence maximization community division overlapping influence community structure independent cascade model

来源：评论

学校读者我要写书评

暂无评论

Linking photosynthetic light use efficiency and optical vegetation active indicators: Implications for gross primary production estimation by remote sensing 24

Linking photosynthetic light use efficiency and optical vege...

引用

2020 24th ISPRS Congress on Technical Commission III

作者： Wang, S. Li, Z. Zhang, Y. Yang, D. Ni, C. Institute of Spacecraft System Engineering China Academy of Space Technology Beijing China International Institute for Earth System Sciences Nanjing University Nanjing China Jiangsu Provincial Key Laboratory of Geographic Information Science and Technology School of Geographic and Oceanographic Science China Collaborative Innovation Center of Novel Software Technology and Industrialization China

Over the last 40 years, the light use efficiency (LUE) model has become a popular approach for gross primary productivity (GPP) estimation in the carbon and remote sensing communities. Despite the fact that the LUE model provides a simple but effective way to approximate GPP at ecosystem to global scales from remote sensing data, when implemented in real GPP modelling, however, the practical form of the model can vary. By reviewing different forms of LUE model and their performances at ecosystem to global scales, we conclude that the relationships between LUE and optical vegetation active indicators (OVAIs, including vegetation indices and sun-induced chlorophyll fluorescence-based products) across time and space are key for understanding and applying the LUE model. In this work, the relationships between LUE and OVAIs are investigated at flux-Tower scale, using both remotely sensed and simulated datasets. We find that i) LUE-OVAI relationships during the season are highly site-dependent, which is complexed by seasonal changes of leaf pigment concentration, canopy structure, radiation and Vcmax;ii) LUE tends to converge during peak growing season, which enables applying pure OVAI-based LUE models without specifically parameterizing LUE and iii) Chlorophyll-sensitive OVAIs, especially machine-learning-based SIF-like signal, exhibits a potential to represent spatial variability of LUE during the peak growing *** also show the power of time-series model simulations to improve the understanding of LUE-OVAI relationships at seasonal scale. © Authors 2020. All rights reserved.

关键词： Vegetation

来源：评论

学校读者我要写书评

暂无评论

Research on the Influence of Improved K-shell Algorithm on Commodity Profit

Research on the Influence of Improved K-shell Algorithm on C...

引用

作者： Jing Chen Jincheng Huang College of Information Science and Engineering Yanshan University Key Laboratory for Computer Virtual Technology and system Integration of Hebei Province Software Engineering Laboratory in Hebei Province

In order to maximize the influence of commodity profits in e-commerce platforms, designing and improving the K-shell algorithm to select the more influential seed node sets in this paper. The new algorithm improves the number of active nodes by setting node threshold and edge weight attributes. To obtain more commodity profits, a strategy IRDSN(Strategy for Improving Repeat Degree of Seed Nodes) is proposed to select initial seed nodes and improve the repeat degree of seed nodes. The profit maximization based on linear threshold model is realized by setting different propagation modes. The improved algorithm and strategy IRDSN are analysed and verified in real data set and e-commerce platform. The results show that the algorithm effectively improves the profit of commodities.

关键词： Influence threshold K-shell influence maximization profit

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：