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

The Graph Structure of Chebyshev Permutation Polynomials over Ring pk

学校读者我要写书评

暂无评论

arXiv 2022年

作者： Li, Chengqing Lu, Xiaoxiong Tan, Kai Chen, Guanrong The School of Computer Science Xiangtan University Hunan Xiangtan411105 China The School of Mathematics and Computational Science Xiangtan University Xiangtan411105 China The Key Laboratory of Intelligent Computing & Information Processing Ministry of Education Xiangtan University Hunan Xiangtan411105 China The Department of Electrical Engineering City University of Hong Kong Hong Kong

Understanding the underlying graph structure of a nonlinear map over a particular domain is essential in evaluating its potential for real applications. In this paper, we investigate the structure of the associated functional graph of Chebyshev permutation polynomials over a ring pk, with p being a prime number greater than three, where every number in the ring is considered as a vertex and the existing mapping relation between two vertices is regarded as a directed edge. Based on some new properties of Chebyshev polynomials and their derivatives, we disclose how the basic structure of the functional graph evolves with respect to parameter k. First, we present a complete and explicit form of the length of a path starting from any given vertex. Then, we show that the strong patterns of the functional graph that the number of cycles of any given length always remains constant as k increases. Moreover, we rigorously prove the rules on the elegant structure of the functional graph and verify them experimentally. Our results could be useful for studying the emergence of the complexity of a nonlinear map in digital computers and security analysis of its cryptographic *** Codes 94A55 Copyright © 2022, The Authors. All rights reserved.

关键词： Chebyshev polynomials

Error Analysis of Virtual Element Methods for the Time-dependent Poisson-Nernst-Planck Equations

学校读者我要写书评

暂无评论

arXiv 2022年

作者： Yang, Ying Liu, Ya Shu, Shi School of Mathematics and Computational Science Guangxi Colleges Universities Key Laboratory of Data Analysis and Computation Key Laboratory of Intelligent Computing and Information Processing of Ministry of Education Guilin University of Electronic Technology Guangxi Guilin541004 China School of Mathematics and Computational Science Guilin University of Electronic Technology Guangxi Guilin541004 China School of Mathematics and Computational Science Xiangtan University Xiangtan411105 China

We discuss and analyze the virtual element method on general polygonal meshes for the time-dependent Poisson-Nernst-Planck equations, which are a nonlinear coupled system widely used in semiconductors and ion channels. The spatial discretization is based on the elliptic projection and the L2 projection operator, and for the temporal discretization, the backward Euler scheme is employed. After presenting the semi and fully discrete schemes, we derive the a priori error estimates in the L2 and H1 norms. Finally, a numerical experiment verifies the theoretical convergence results. Copyright © 2022, The Authors. All rights reserved.

关键词： Nonlinear equations

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

Improved Matrix-based Attribute Reduction Algorithm Based on Minimal Elements for Mobile Edge computing

学校读者我要写书评

暂无评论

Improved Matrix-based Attribute Reduction Algorithm Based on...

IEEE/ACM International Symposium on Cluster computing and the Grid (CCGRID)

作者： Yi Xu Zhiqiang Zheng Yan Cheng Key Laboratory of Intelligent Computing and Signal Processing Ministry of Education Anhui University Hefei China School of Computer Science and Technology Anhui University Hefei China

ISBN: (数字)9781728160955

ISBN: (纸本)9781728196497

With the development of Internet of Thlngs(IoT) technology, the Mobile Edge computing (MEC) environment plays an important role in different scenarios. This paper focus on the "last-mile" delivery scenario in logistics. In this scenario, due to the limited computation ability of the unmanned aerial vehicle (UAV), high real-time and computational resource-intensive tasks such as obstacle avoidance, route planning, and face recognition are require the assistance by MEC computing resources. However, due to the limited computing power of edge servers, the computing tasks of neural networks has very high delay. It cause the deadline of neural networks computation task may not be satisfied. Besides with the users and environment changed continuously, the neural nework take a long time to update which may affect the work of UAV. Therefore, It is an critical problem to accelerate the calculation and update of neural network on edge server. This paper proposes an attribute reduction algorithm based on rough set, which can reduce redundant attributes and compress the dimensionality of data. The experimental results show that can accelerate the calculation and update of neural network significantly and save the energy consumption.

关键词： Servers Edge computing Task analysis Neural networks Energy consumption Information systems Rough sets

PROM: A persistent routing optimization method based on supervised learning

学校读者我要写书评

暂无评论

Journal of Network and Computer Applications 2025年 242卷

作者： Yingya Guo Zebo Huang Mingjie Ding Bin Lin Huan Luo College of Computer and Data Science Fuzhou University China Fujian Provincial Key Laboratory of Network Computing and Intelligent Information Processing Fuzhou University China Engineering Research Center of Big Data Intelligence Ministry of Education China

Traditional Traffic Engineering (TE) typically improves network performance by formulating and solving routing optimization problems based on measured or predicted Traffic Matrices (TMs). However, since network traffic is dynamic, routing strategies optimized for the current measured TMs may not be suitable for future traffic patterns. To adapt to dynamic traffic, one possible solution is to perform more frequent routing updates, but this may lead to service disruptions. Another approach is the two-step method of prediction followed by optimization, which could lead to degraded performance of routing strategies due to inaccuracies in traffic prediction. Additionally, existing approaches focus solely on either distributed or centralized networks, lacking flexibility to adapt to different network architectures. To address these challenges, we propose PROM, a Machine Learning (ML)-based routing optimization model that directly predicts an effective routing strategy in an end-to-end manner based on historical traffic. This routing strategy is applicable across multiple future TMs, thereby reducing the need for frequent routing updates. Furthermore, PROM can be easily extended from a centralized implementation to a distributed one, adapting to different network architectures. To enhance model performance, we have also designed a custom loss function for routing optimization scenarios to avoid overfitting. Extensive simulation results demonstrate that PROM can predict high-quality routing strategies in future unknown traffic scenarios and is adaptable to both centralized and distributed network architectures.

关键词：

Semantic Based Heterogeneous Information Network Embedding for Patent Citation Recommendation

学校读者我要写书评

暂无评论

Semantic Based Heterogeneous Information Network Embedding f...

Artificial Intelligence and Computer Engineering (ICAICE), International Conference on

作者： Yanping Zhang Shuang Li Xi Chen Fulan Qian Shu Zhao Shuwei Zhu Yulu Wang Key Laboratory of Intelligent Computing and Signal Processing Ministry of Education Anhui University Hefei China School of Computer Science and Technology Anhui University Hefei China

ISBN: (数字)9781728191461

ISBN: (纸本)9781728191478

With the increasing number of patents, the task of patent citation recommendation becomes more and more important and meaningful. The core of a patent is textual content, which describes technical ideas and scope of the protection. Therefore, most of the existing patent citation recommendation methods focus on textual content. Recently, some scholars introduce bibliographic (structural) data to construct heterogeneous information network (HIN) on the basis of textual content to further improve the effect of recommendation. Most of these methods build HIN directly based on candidate patents selected in advance according to text similarity, which simplifies the complexity of the problem. However, the latent semantic relationships between patents formed by the textual content are often ignored, which can be used to mine more semantic and structural relationships in HIN. In this paper, in order to capture deep semantic and structural information, we introduce Semantic based Heterogeneous Information Network Embedding (SHINE) which obtains the latent semantic relationships between patents (referred to as semantic links in this paper) by textual content similarity and topic similarity, and links the semantic relationships with network structure to build a novel HIN. First, to obtain semantic links, we not only consider the textual content similarity between patents but also the topic similarity. We use the linear fusion method to combine these two similarities. Secondly, we build a HIN with semantic links and bibliographic information to integrate semantic and structural information, and we use network embedding to map the integration of two kinds of information into a common vector space. Finally, we recommend patent citations by linear combination of multi-modal similarities. The experimental results on two U.S. patent datasets show the effectiveness of SHINE. Compared to state-of-the art of patent citation recommendation, the proposed method SHINE achieves significantl

关键词： Patents Art Computational modeling Semantics Complexity theory Task analysis Artificial intelligence

Local Smoothing Optimization Penalized Least Squares: Application to Spectrum Baseline Correction

学校读者我要写书评

暂无评论

Local Smoothing Optimization Penalized Least Squares: Applic...

第31届中国过程控制会议（CPCC 2020）

作者： Yuqiang Li Tianhong Pan Haoran Li Shan Chen Key Laboratory of Intelligent Computing and Signal Processing of Ministry of Education School of Electrical Engineering and Automation Anhui University School of Electrical and Information Engineering Jiangsu University

Baseline shift, as an undesirable component of processing signal, seriously contaminates the essential information of the analysis object and deteriorates the performance of the developed model. The baseline correction methods based on penalized least squares have been widely applied in various industries and obtained better results in the single interval signal. However, the real analyzed signal is composed of multiple intervals with different smoothness, and the current baseline correction methods using constant smoothing parameters throughout the process cannot eliminate the baseline of the multi-interval signal. To address this issue, a local smoothing optimization penalized least squares(lsoPLS) method is presented in this work. The local smoothing optimization strategy using the derivative difference between the previously fitted baseline and the original signal is used to identify the interval location, while smoothing parameter is optimized by the interval characteristics. Two simulated cases and one real experiment were used to evaluate the effectiveness of the proposed lsoPLS method. Experimental results confirm that the proposed method has better performance in the multi-interval baseline correction and can be served as an effective pre-processing method for the complex spectral signal.

关键词： Baseline correction local smoothing optimization penalized least square signal pre-processing spectral analysis

A many-objective evolutionary algorithm based on rotation and decomposition

学校读者我要写书评

暂无评论

Swarm and Evolutionary Computation 2021年 60卷

作者： Zou, Juan Liu, Jing Yang, Shengxiang Zheng, Jinhua Key Laboratory of Hunan Province for Internet of Things and Information Security Xiangtan University XiangtanHunan411105 China Key Laboratory of Intelligent Computing and Information Processing Ministry of Education Information Engineering College of Xiangtan University XiangtanHunan411105 China Hunan Provincial Key Laboratory of Intelligent Information Processing and Application Hengyang421002 China School of Computer Science and Informatics De Montfort University LeicesterLE1 9BH United Kingdom

Evolutionary algorithms have shown their promise in addressing multiobjective problems (MOPs). However, the Pareto dominance used in multiobjective optimization loses its effectiveness when addressing many-objective problems (MaOPs), which are defined as having more than three objectives. This is because the Pareto dominance loses its ability to distinguish between individuals. In this paper, a many-objective evolutionary algorithm based on rotation and decomposition is proposed (MaOEA-RD) to overcome the shortcoming of insufficient selection pressure caused by the Pareto dominance. First, the coordinates system is rotated and a hyperplane is established to distinguish between the nondominated individuals. Then, a novel individual selection mechanism incorporating decomposition is adopted to maintain the diversity of the population. In order to compensate for the deficiency of the predefined reference vectors, a reference vector adjustment mechanism is proposed. Experimental studies on several well-known benchmark problems show that the proposed algorithm is competitive compared with nine state-of-the-art many-objective algorithms. © 2020 Elsevier B.V.

关键词： Evolutionary algorithms

Reconfigurable intelligent Surface-Aided Secure Integrated Radar and Communication Systems

学校读者我要写书评

暂无评论

arXiv 2024年

作者： Zheng, Tong-Xing Chen, Xin Lan, Lan Ju, Ying Hu, Xiaoyan Liu, Rongke Ng, Derrick Wing Kwan Cui, Tiejun School of Information and Communications Engineering Xi'an Jiaotong University Xi’an710049 China Ministry of Education Key Laboratory for Intelligent Networks and Network Security Xi'an Jiaotong University Xi’an710049 China Purple Mountain Laboratories Nanjing211111 China National Key Laboratory of Radar Signal Processing Xidian University Xi’an710071 China School of Telecommunications Engineering Xidian University Xi’an710071 China School of Electronic and Information Engineering Beihang University Beijing100191 China School of Electrical Engineering and Telecommunications University of New South Wales SydneyNSW2052 Australia School of Information Science and Engineering Southeast University Nanjing210096 China

Despite the enhanced spectral efficiency brought by the integrated radar and communication technique, it poses significant risks to communication security when confronted with malicious radar targets. To address this issue, a reconfigurable intelligent surface (RIS)-aided transmission scheme is proposed to improve secure communication in two systems, i.e., the radar and communication co-existing (RCCE) system, where a single transmitter is utilized for both radar sensing and communication, and the dual-functional radar and communication (DFRC) system. At the design stage, optimization problems are formulated to maximize the secrecy rate while satisfying the radar detection constraint via joint active beamforming at the base station and passive beamforming of RIS in both systems. Particularly, a zero-forcing-based block coordinate descent (BCD) algorithm is developed for the RCCE system. Besides, the Dinkelbach method combined with semidefinite relaxation is employed for the DFRC system, and to further reduce the computational complexity, a Riemannian conjugate gradient-based alternating optimization algorithm is proposed. Moreover, the RIS-aided robust secure communication in the DFRC system is investigated by considering the eavesdropper's imperfect channel state information (CSI), where a bounded uncertainty model is adopted to capture the angle error and fading channel error of the eavesdropper, and a tractable bound for their joint uncertainty is derived. Simulation results confirm the effectiveness of the developed RIS-aided transmission scheme to improve the secrecy rate even with the eavesdropper's imperfect CSI, and comparisons between both systems reveal that the RCCE system can provide a higher secrecy rate than the DFRC system. Copyright © 2024, The Authors. All rights reserved.

关键词： Conjugate gradient method