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

Binary Image Steganalysis Based on Symmetrical Local Residual Patterns

Chinese Journal of Electronics 2022年第4期31卷 752-763页

作者： LUO Junwei YU Mujian YIN Xiaolin LU Wei School of Computer Science and Engineering Guangdong Province Key Laboratory of Information Security TechnologyMinistry of Education Key Laboratory of Machine Intelligence and Advanced Computing Sun Yat-sen University

Residual computation is an effective method for gray-scale image steganalysis. For binary images, the residual computation calculated by the XOR operation is also employed in the local residual patterns(LRP) model for steganalysis. A binary image steganalytic scheme based on symmetrical local residual patterns(SLRP) is proposed. The symmetrical relationships among residual patterns are introduced that make the features more compact while reducing the dimensionality of the features set. Multi-scale windows are utilized to construct three SLRP submodels which are further merged to construct the final features set instead of a single *** with higher probability to be modified after embedding are emphasized and selected to construct the feature sets for training the support vector machine classifier. The experimental results show that the proposed steganalytic scheme is effective for detecting binary image steganography.

关键词： Information hiding Steganalysis Symmetrical local residual patterns Multi-scale model

来源：评论

学校读者我要写书评

暂无评论

OFDM-structure based waveform designs for integrated sensing and communication

引用

science China(Information sciences) 2025年第5期68卷 267-284页

作者： Jiaqi LIU Ping YANG Ke JIANG Jiarong ZHAO Wei XIANG Jianping WEI Ruixiang DUAN Saviour ZAMMIT Tony Q.S.QUEK National Key Laboratory of Wireless Communications University of Electronic Science and Technology of China School of Computing Engineering and Mathematical Sciences La Trobe University Meituan Academy of Robotics Department of Communications and Computer Engineering University of Malta Information Systems Technology and Design Pillar Singapore University of Technology and Design

The future sixth-generation(6G) paradigm aims to seamlessly integrate communication and environmental sensing capabilities into a single radio signal, promising improved efficiency and cost-effectiveness through simultaneous data communications and environmental perception. At the core of this evolution, orthogonal frequency division multiplexing(OFDM) and its advanced waveforms emerge as pivotal for integrated sensing and communications(ISAC). This study introduces a concise and unified ISAC waveform design framework based on orthogonal multicarriers. This framework supports versatile applications of OFDM and its derivative waveforms within a generalized ISAC system, marking a significant leap in integrating communication and sensing capabilities. A distinguishing feature of this framework is its adaptability,allowing users to intelligently select modulation strategies based on their specific environmental needs. This adaptability optimizes performance across diverse scenarios. Central to our innovations is the proposal of discrete Fourier transformspread OFDM with index modulation(DFT-S-OFDM-IM). This framework is paired with newly proposed signal processing methods for single-input single-output and multiple-input multiple-output(MIMO) systems. Extensive evaluations highlight DFT-S-OFDM-IM's superiority, including dramatically reduced peak-to-average power ratios(PAPRs), competitive communication performance, and exceptional sensing capabilities, striking an elegant balance between communication capacity and environmental sensing precision.

关键词： DFT-S-OFDM-IM index modulation integrated sensing and communication OFDM

来源：评论

学校读者我要写书评

暂无评论

An Evolutionary Multitasking Algorithm for Efficient Multiobjective Recommendations

IEEE Transactions on Artificial Intelligence

引用

IEEE Transactions on Artificial Intelligence 2025年第3期6卷 518-532页

作者： Tian, Ye Ji, Luke Hu, Yiwei Ma, Haiping Wu, Le Zhang, Xingyi Anhui University Key Laboratory of Intelligent Computing and Signal Processing of Ministry of Education School of Computer Science and Technology Hefei230601 China Anhui University Institutes of Physical Science and Information Technology Hefei230601 China Hefei University of Technology Key Laboratory of Knowledge Engineering with Big Data Hefei230029 China

Represented by evolutionary algorithms and swarm intelligence algorithms, nature-inspired metaheuristics have been successfully applied to recommender systems and amply demonstrated effectiveness, in particular, for multiobjective recommendation. Owing to the population-based search paradigm, these algorithms can produce a number of recommendation lists, making diverse tradeoffs between multiple metrics and meeting the requirements of accuracy, novelty, diversity, and other user preferences. However, these algorithms are criticized for the low efficiency of the optimization process, especially when the number of users is large. To address this issue, this article proposes an evolutionary multitasking-based recommendation method, where each task corresponds to a user and all the tasks are optimized simultaneously, thus highly improving the efficiency of recommendation. To enhance the convergence speed, all the users are divided into multiple populations according to the similarity between their preferences, where each population evolves with internal knowledge transfer between users, and all the populations evolve with external knowledge transfer between populations. Experimental results on various datasets verify that the proposed method can better balance between multiple metrics than classical and deep neural network-based recommendation methods and exhibits significantly higher efficiency than evolutionary multiobjective optimization-based recommendation methods. © 2024 IEEE. All rights reserved.

关键词： Multiobjective optimization

来源：评论

学校读者我要写书评

暂无评论

A reposition algorithm for e-hailing based on quantum annealing and intuitive reasoning

引用

Intelligent and Converged Networks 2024年第4期5卷 317-335页

作者： Chao Wang Yiyun Shi Sumin Wang Key Laboratory of Specialty Fiber Optics and Optical Access Networks Shanghai UniversityShanghai 200444China School of Information Engineering Ganzhou Key Laboratory of Cloud Computing and Big Data ResearchGannan University of Science and TechnologyGanzhou 341000China

Currently,the challenge lies in the traditional intelligent algorithm’s ability to effectively address the e-hailing repositioning *** identifying the underlying characteristics in extensive traffic data within a limited timeframe is difficult,ultimately preventing the achievement of the most optimal *** paper suggests a hybrid computing architecture involving reinforcement learning and quantum annealing based on intuitive *** reasoning aims to enhance performance in scenarios with poor system robustness,complex tasks,and diverse goals.A deep learning model is constructed,trained to extract scene features,and combined with expert knowledge,then transformed into a quantum annealable *** final strategy is obtained using a D-wave quantum computer with quantum tunneling effect,which helps in finding optimal solutions by jumping out of local suboptimal *** on 400000 real data,four algorithms are compared:minimum-cost flow,sequential markov decision process,hot-dot strategy,and driver-prefer *** average total revenue increases by about 10%and vehicle utilization by about 15%in various *** summary,the proposed architecture effectively solves the e-hailing reposition problem,offering new directions for robust artificial intelligence in big data decision problems.

关键词： intuitive reasoning reinforcement learning quantum annealing

来源：评论

学校读者我要写书评

暂无评论

On greedy randomized coordinate updating iteration methods for solving symmetric eigenvalue problems

引用

Applied Numerical Mathematics 2025年 216卷 76-97页

作者： Bai, Zhong-Zhi State Key Laboratory of Mathematical Sciences Academy of Mathematics and Systems Science Chinese Academy of Sciences Beijing100190 China State Key Laboratory of Scientific/Engineering Computing Institute of Computational Mathematics and Scientific/Engineering Computing Academy of Mathematics and Systems Science Chinese Academy of Sciences P.O. Box 2719 Beijing100190 China School of Mathematical Sciences University of Chinese Academy of Sciences Beijing100049 China

In order to compute the smallest eigenvalue and its corresponding eigenvector of a large-scale, real, and symmetric matrix, we propose a class of greedy randomized coordinate updating iteration methods based on the principle that the indices of larger entries in absolute value of the current residual are selected with a higher probability and, with respect to this index set, the next iterate is updated from the current iterate along with the selected coordinate such that the corresponding entry of the residual is annihilated, resulting in fast convergence rates of the proposed iteration methods. Under appropriate conditions, we prove the convergence of both sequences of the Rayleigh-quotients and the acute angles between the iterates and the eigenvector in terms of the expectation. By numerical experiments, we show that this class of greedy randomized coordinate updating iteration methods are advantageous over the parameterized power method and the coordinate descent method in both iteration counts and computing times. Moreover, with theoretical analysis and computational performance, we confirm that the convergence property of this class of iteration methods can be improved significantly by suitably choosing the arbitrary nonnegative parameter involved in the greedy probability criterion. © 2025 IMACS

关键词： Eigenvalues and eigenfunctions

来源：评论

学校读者我要写书评

暂无评论

Asymptotically Optimal Sequence Sets With Low/Zero Ambiguity Zone Properties

引用

IEEE Transactions on Information Theory 2025年第6期71卷 4785-4796页

作者： Tian, Liying Song, Xiaoshi Liu, Zilong Li, Yubo Northeastern University School of Computer Science and Engineering Shenyang110819 China Northeastern University Key Laboratory of Intelligent Computing in Medical Image Ministry of Education Shenyang110189 China University of Essex School of Computer Science and Electronics Engineering ColchesterCO4 3SQ United Kingdom Yanshan University School of Information Science and Engineering Qinhuangdao066004 China Hebei Key Laboratory of Information Transmission and Signal Processing Qinhuangdao066004 China

Sequences with low/zero ambiguity zone (LAZ/ZAZ) properties are useful in modern communication and radar systems operating over mobile environments. This paper first presents a new family of ZAZ sequence sets motivated by the "modulating" zero correlation zone (ZCZ) sequences which were first proposed by Popovic and Mauritz. We then introduce a second family of ZAZ sequence sets with comb-like spectrum, whereby the local Doppler resilience is guaranteed by their inherent spectral nulls in the frequency domain. Finally, LAZ sequence sets are obtained by exploiting their connection with a novel class of mapping functions. These proposed unimodular ZAZ and LAZ sequence sets are cyclically distinct and asymptotically optimal with respect to the existing theoretical bounds on ambiguity functions. © 1963-2012 IEEE.

关键词： Frequency domain analysis

来源：评论

学校读者我要写书评

暂无评论

Generating empathetic responses through emotion tracking and constraint guidance

引用

Frontiers of Computer science 2024年第2期18卷 243-245页

作者： Jing LI Donghong HAN Zhishuai GUO Baiyou QIAO Gang WU School of Computer Science and Engineering Northeastern UniversityShenyang 110000China Key Laboratory of Intelligent Computing in Medical Image(Ministry of Education) Northeastern UniversityShenyang 110000China Neusoft Corporation Shenyang 110000China

1 Introduction Empathy is an essential human trait,which reflects the ability of understanding and reflecting on the thoughts and feelings of *** empathetic dialogue system can improve user's experience and establishlong-termhuman-machine *** speaker's emotions and predict response's emotions are necessary steps in empathetic dialogue generation.

关键词： interaction. constraint steps

来源：评论

学校读者我要写书评

暂无评论

Gauze:enabling communication-friendly block synchronization with cuckoo filter

引用

Frontiers of Computer science 2023年第3期17卷 113-123页

作者： Xiaoqiang DING Liushun ZHAO Lailong LUO Junjie XIE Deke GUO Jinxi LI College of Intelligence and Computing Tianjin UniversityTianjin 300350China School of Computer Science and Technology Xidian UniversityXi’an 710071China Science and Technology on Information Systems Engineering Laboratory National University of Defense TechnologyChangsha 410073China Institute of Systems Engineering AMSPLABeijing 100141China

Block synchronization is an essential component of blockchain ***,blockchain systems tend to send all the transactions from one node to another for ***,such a method may lead to an extremely high network bandwidth overhead and significant transmission *** is crucial to speed up such a block synchronization process and save bandwidth consumption.A feasible solution is to reduce the amount of data transmission in the block synchronization process between any pair of ***,existing methods based on the Bloom filter or its variants still suffer from multiple roundtrips of communications and significant synchronization *** this paper,we propose a novel protocol named Gauze for fast block *** utilizes the Cuckoo filter(CF)to discern the transactions in the receiver’s mempool and the block to verify,providing an efficient solution to the problem of set reconciliation in the P2P(Peer-to-Peer Network)*** up to two rounds of exchanging and querying the CFs,the sending node can acknowledge whether the transactions in a block are contained by the receiver’s mempool or *** on this message,the sender only needs to transfer the missed transactions to the receiver,which speeds up the block synchronization and saves precious bandwidth *** evaluation results show that Gauze outperforms existing methods in terms of the average processing latency(about lower than Graphene)and the total synchronization space cost(about lower than Compact Blocks)in different scenarios.

关键词： block synchronization cuckoo filter probabilistic data structure

来源：评论

学校读者我要写书评

暂无评论

CONVERGENCE ANALYSIS OF SOME FINITE ELEMENT PARALLEL ALGORITHMS FOR THE STATIONARY INCOMPRESSIBLE MHD EQUATIONS

引用

Journal of Computational Mathematics 2024年第1期42卷 49-70页

作者： Xiaojing Dong Yinnian He 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 Institute of Applied Physics and Computational Mathematics Beijing 100088China School of Mathematics and Statistics Xi'an Jiaotong UniversityXi'an 710049China

By combination of iteration methods with the partition of unity method(PUM),some finite element parallel algorithms for the stationary incompressible magnetohydrodynamics(MHD)with different physical parameters are presented and *** algorithms are highly *** first,a global solution is obtained on a coarse grid for all approaches by one of the iteration *** parallelized residual schemes,local corrected solutions are calculated on finer meshes with overlapping *** subdomains can be achieved flexibly by a class of *** proposed algorithm is proved to be uniformly stable and ***,one numerical example is presented to confirm the theoretical findings.

关键词： Partition of unity method Local and parallel algorithm Finite element method Iteration methods Magnetohydrodynamics

来源：评论

学校读者我要写书评

暂无评论

Textual Data De-Privatization Scheme Based on Generative Adversarial Networks 24th

Textual Data De-Privatization Scheme Based on Generative Adv...

引用

24th International Conference on Algorithms and Architectures for Parallel Processing, ICA3PP 2024

作者： Du, Yanning Xu, Jinnan Zhang, Yaling Wang, Yichuan Wang, Zhoukai School of Computer Science and Engineering Xi’an University of Technology Xi’an China Shaanxi Key Laboratory for Network Computing and Security Technology Xi’an China

ISBN: (纸本)9789819615506

In many fields, such as healthcare, finance, and scientific research, data sharing and collaboration are critical to achieving better outcomes. However, the sharing of personal data often involves privacy risks, so privacy-preserving techniques are needed to ensure data security and privacy. The superior performance and flexibility of generative models in data representation have led to significant progress in the development of data privacy. This paper proposes a textual data de-privatization scheme based on generative adversarial networks that well combines generative adversarial networks with privacy protection. The generated de-privacy data retains the statistical properties of the original data and effectively removes sensitive information. Moreover, feature sorting and reshaping modules are introduced to enable the generator to better capture the relationships between features, thus improving the quality of synthetic data. In this paper, the utility of synthetic data is evaluated from three aspects, including similarity assessment, privacy assessment, and model utility assessment. Experimental results show that this method achieves a good trade-off in terms of textual data privacy protection and data quality maintenance. © The Author(s), under exclusive license to Springer Nature Singapore Pte Ltd. 2025.

关键词： Generative adversarial networks

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：