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

Equalizer Zero-Determinant Strategy in Discounted Repeated Stackelberg Asymmetric Game

Journal of systems science & complexity 2024年第1期37卷 184-203页

作者： CHENG Zhaoyang CHEN Guanpu HONG Yiguang Key Laboratory of Systems and Control Academy of Mathematics and Systems ScienceChinese Academy of SciencesBeijing 100190China School of Mathematical Sciences University of Chinese Academy of SciencesBeijing 100049China School of Electrical Engineering and Computer Science KTH Royal Institute of Technology10044 StockholmSweden. Department of Control Science and Engineering Tongji UniversityShanghai 201804China Shanghai Research Institute for Intelligent Autonomous Systems Tongji UniversityShanghai 210201China

This paper focuses on the performance of equalizer zero-determinant(ZD)strategies in discounted repeated Stackelberg asymmetric *** the leader-follower adversarial scenario,the strong Stackelberg equilibrium(SSE)deriving from the opponents’best response(BR),is technically the optimal strategy for the ***,computing an SSE strategy may be difficult since it needs to solve a mixed-integer program and has exponential complexity in the number of *** this end,the authors propose an equalizer ZD strategy,which can unilaterally restrict the opponent’s expected *** authors first study the existence of an equalizer ZD strategy with one-to-one situations,and analyze an upper bound of its performance with the baseline SSE *** the authors turn to multi-player models,where there exists one player adopting an equalizer ZD *** authors give bounds of the weighted sum of opponents’s utilities,and compare it with the SSE ***,the authors give simulations on unmanned aerial vehicles(UAVs)and the moving target defense(MTD)to verify the effectiveness of the proposed approach.

关键词： Discounted repeated Stackelberg asymmetric game equalizer zero-determinant strategy strong Stackelberg equilibrium strategy

来源：评论

学校读者我要写书评

暂无评论

Complex dynamics of a magnetic microrobot driven by single deformation soft tail in random environment

引用

Theoretical & Applied Mechanics Letters 2024年第5期14卷 402-408页

作者： Xinpeng Shi Yongge Li Yong Xu Qi Liu School of Mathematics and Statistics Northwestern Polytechnical UniversityXi’an 710072China Research&Development Institute of Northwestern Polytechnical University in Shenzhen Shenzhen 518063China MOE Key Laboratory for Complexity Science in Aerospace Northwestern Polytechnical UniversityXi’an 710072China Department of Systems and Control Engineering Tokyo Institute of TechnologyTokyo 152-8552Japan

This study focuses on exploring the complex dynamical behaviors of a magnetic microrobot in a random *** purpose is to reveal the mechanism of influence of random disturbance on microrobot *** paper establishes stochastic dynamic models for the microrobot before and after deformation,considering the influence of Gaussian white *** system responses are analyzed via steady-state probability density functions and first deformation *** effects of different magnetic field strengths and fluid viscosities on the movement speed and angular velocity of the microrobot are *** results indicate that random disturbances can cause deformation of microrobots in advance compared to the deterministic *** work contributes to the design and motion control of microrobots and enhances the theoretical foundation of microrobots.

关键词： Magnetic microrobot Stochastic dynamic models Random disturbances

来源：评论

学校读者我要写书评

暂无评论

On fractional discrete financial system:Bifurcation,chaos,and control

引用

Chinese Physics B 2024年第10期33卷 129-140页

作者： Louiza Diabi Adel Ouannas Amel Hioual Shaher Momani Abderrahmane Abbes Laboratory of Dynamical Systems and Control University of Larbi Ben M’hidiOum El Bouaghi 04000Algeria Department of Mathematics and Computer Science University of Larbi Ben M’hidiOum El Bouaghi 04000Algeria Nonlinear Dynamics Research Center Ajman UniversityAjman 346United Arab Emirates Department of Mathematics The University of JordanAmman 11942Jordan Laboratory of Mathematics Dynamics and ModelizationUniversity Badji MokhtarAnnaba 23000Algeria

The dynamic analysis of financial systems is a developing field that combines mathematics and economics to understand and explain fluctuations in financial *** paper introduces a new three-dimensional(3D)fractional financial map and we dissect its nonlinear dynamics system under commensurate and incommensurate *** such,we evaluate when the equilibrium points are stable or unstable at various fractional *** use many numerical methods,phase plots in 2D and 3D projections,bifurcation diagrams and the maximum Lyapunov *** techniques reveal that financial maps exhibit chaotic attractor *** study is grounded on the Caputo-like discrete operator,which is specifically influenced by the variance of the commensurate and incommensurate ***,we confirm the presence and measure the complexity of chaos in financial maps by the 0-1 test and the approximate entropy ***,we offer nonlinear-type controllers to stabilize the fractional financial *** numerical results of this study are obtained using MATLAB.

关键词： financial model stability chaos commensurate and incommensurate orders complexity

来源：评论

学校读者我要写书评

暂无评论

nPGSAO: A Hybrid Particle Swarm Optimization and Genetic Algorithm With Niching Technology for Edge Server Placement

引用

IEEE Internet of Things Journal 2025年第12期12卷 19370-19383页

作者： Wang, Bo Zhang, Zhifeng Song, Ying Chen, Ming Liu, Dongqing Zhengzhou University of Light Industry Software Engineering College Zhengzhou450002 China Beijing Information Science and Technology University Computer School Beijing100101 China Tongling University School of Mathematics and Computer Science Tongling China The First Affiliated Hospital of Zhengzhou University National Engineering Laboratory for Internet Medical Systems and Applications Zhengzhou450052 China

In this article, we focus on the edge server placement problem (ESPP). ESPP is to decide positions (edge stations) where purchased edge servers (ESs) are placed when a service provider builds or upgrades its edge computing solution. The decision of ESPP largely determines the overall service quality and resource efficiency. We aim at providing ESPP solutions for optimizing the service quality in terms of the system response time, given a set of purchased ESs. To achieve this aim, we first deduce the optimal request dispatch for each edge station based on queue theory and Binomial theorem. Then, based on the deduced result, we formulate ESPP into a discrete nonlinear constrained optimization model. Because ESPP is NP-hard and generally multimodality, we designed a hybrid meta-heuristic algorithm to combine advantages of particle swarm optimization (PSO) and genetic algorithm (GA) as well as the niching technology, which is named nPGSAO. The basic idea of nPGSAO is grouping similar individuals into a niche and finding the niche best. Then, nPGSAO evolves each individual by integrating the swarm intelligence of PSO into the evolutionary process of GA based on its personal and niching best. To evaluate the performance of nPGSAO, we conducted extensive simulated experiments. The results show that nPGSAO achieves 5.78%–40.4% better response time with varied ESPP scale, compared to 11 up-to-date algorithms, and has a linear time complexity with the ESPP scale. These confirm the superior performance and scalability of nPGSAO. © 2014 IEEE.

关键词： Genetic algorithms

来源：评论

学校读者我要写书评

暂无评论

On tuning of ADRC with competing design indices:a quantitative study

引用

Control Theory and Technology 2023年第1期21卷 16-33页

作者： Yutao Zhao Yi Huang Zhiqiang Gao Key Laboratory of Systems and Control Academy of Mathematics and Systems ScienceChinese Academy of SciencesBeijing 100190China School of Mathematical Sciences University of Chinese Academy of SciencesBeijing 100049China Department of Electrical Engineering and Computer Science Center for Advanced Control TechnologiesCleveland State UniversityClevelandOH 44115USA

Controller optimization has mostly been done by minimizing a certain single cost *** practice,however,engineers must contend with multiple and conflicting considerations,denoted as design indices(DIs)in this *** to account for such complexity and nuances is detrimental to the applications of any advanced control *** paper addresses this challenge heads on,in the context of active disturbance rejection controller(ADRC)and with four competing DIs:stability margins,tracking,disturbance rejection,and noise *** this end,the lower bound for the bandwidth of the extended state observer is first established for guaranteed closed-loop ***,one by one,the mathematical formula is meticulously derived,connecting each DI to the set of controller *** our best knowledge,this has not been done in the context of *** formulas allow engineers to see quantitatively how the change of each tuning parameter would impact all of the DIs,thus making the guesswork *** example is given to show how such analytical methods can help engineers quickly determine controller parameters in a practical scenario.

关键词： Uncertain systems Active disturbance rejection control(ADRC) Design indices(DIs) Extended state observer(ESO)

来源：评论

学校读者我要写书评

暂无评论

Straightforward Guess and Determine Analysis Based on Genetic Algorithm

引用

Journal of systems science & complexity 2022年第5期35卷 1988-2003页

作者： CAO Chunping CEN Zhe FENG Xiutao WANG Zhangyi ZHU Yamin Department of Computer Science and Technology University of Shanghai for Science and TechnologyShang-hai 200093China Key Laboratory of Mathematics Mechanization Academy of Mathematics and Systems ScienceChinese Academy of SciencesBeijing 100190China School of Cyber Science and Engineering Wuhan UniversityWuhan 430072China School of Science Xi'an Technological UniversityXi'an 710021China

With the development of artificial intelligence,the genetic algorithm has been widely used in many *** cryptography,the authors find it is natural to code an individual and design its fitness in a genetic algorithm for a straightforward guess and determine analysis(SGDA,in short).Based on this observation,the authors propose an SGDA based on genetic *** it with the other three SGDAs based on exhaustive search,MILP method and CPP method respectively,the authors illustrate its effectiveness by three stream ciphers:Small scale SNOW 2.0,medium scale Enocoro-128v2 and large scale *** results show our method is significantly superior to them,especially for Trivium,the method can find a solution of 165 variables in less than one hour,while the other three methods are not applicable due to its enormous search space of size 2^(619.37).As far as we know,it is a best solution in an SGDA for Trivium so far.

关键词： Enocoro-128v2 genetic algorithm guess and determine analysis SNOW 2.0 trivium

来源：评论

学校读者我要写书评

暂无评论

A Normalizing Field Flow Induced Two-Stage Stochastic Homogenization Method for Random Composite Materials

引用

Communications in Computational Physics 2023年第8期34卷 787-812页

作者： Zihao Yang Xintong Wang Xiaofei Guan Jizu Huang Xixin Wu School of Mathematics and Statistics Northwestern Polytechnical UniversityXi’an 710072China Institute of Mathematics Henan Academy of SciencesZhengzhou 450046China MOE Key Laboratory for Complexity Science in Aerospace Northwestern Polytechnical UniversityXi’an 710072China School of Mathematical Sciences Tongji UniversityShanghai 200092China LSEC Academy of Mathematics and Systems ScienceChinese Academy of SciencesBeijing 100190China School of Mathematical Sciences University of Chinese Academy of SciencesBeijing 100049China

The traditional stochastic homogenization method can obtain homogenized solutions of elliptic problems with stationary random ***,many random composite materials in scientific and engineering computing do not satisfy the stationary *** overcome the difficulty,we propose a normalizing field flow induced two-stage stochastic homogenization method to efficiently solve the random elliptic problem with non-stationary *** applying the two-stage stochastic homogenization method,the original elliptic equation with random and fast oscillatory coefficients is approximated as an equivalent elliptic equation,where the equivalent coefficients are obtained by solving a set of cell *** the stationary assumption,the number of cell problems is large and the corresponding computational cost is *** improve the efficiency,we apply the normalizing field flow model to learn a reference Gaussian field for the random equivalent coefficients based on a small amount of data,which is obtained by solving the cell problems with the finite element *** results demonstrate that the newly proposed method is efficient and accurate in tackling high dimensional partial differential equations in composite materials with complex random microstructures.

关键词： Two-stage stochastic homogenization normalizing field flows multi-modes Monte Carlo method random composite materials non-stationary random

来源：评论

学校读者我要写书评

暂无评论

Stability switch of tumor-immune system driven by delayed response in cell-to-cell contact

引用

The European Physical Journal Special Topics 2024年第1期234卷 165-178页

作者： Xu, Qian Fan, Aili Qu, Lijin Miao, Yuchen Du, Lin School of Mathematics and Statistics Northwestern Polytechnical University Xi’an China MIIT Key Laboratory of Dynamics and Control of Complex Systems Xi’an China MOE Key Laboratory for Complexity Science in Aerospace Xi’an China

Considering the delayed response in cell-to-cell contact is essential for accurately predicting the progression of cancer. In this paper, the stability switch phenomenon of a tumor-immune interaction system induced by the delayed response is presented. Firstly, the qualitative properties of the system including non-negativity and boundedness of the solutions are discussed. Subsequently, a complete discriminant system for polynomials method is employed to scrutinize the local stability switch conditions, which circumvents the complicated calculation procedures and enhances the analytical accuracy for high-dimensional nonlinear time-delay systems. The delayed response in cell-to-cell contact is observed to exert a suppressive influence on system stability. Specifically, the system with stable initial state will switch to instability when the delayed responding time of cell-to-cell contact exceeds a critical threshold, indicating a weakened resistance of the immune system against tumor cells. While the system with unstable initial state will maintain and even exhibit chaotic behavior, implying uncontrolled tumor proliferation. Finally, the major findings related to cancer therapy are summarized in the conclusion. These results help to understand the complex mechanism of the tumor-immune system and provide ideas for the clinical treatment of tumor.

关键词：

来源：评论

学校读者我要写书评

暂无评论

A novel perspective using Chaotic-Grey Wolf Optimization Algorithm for Arabic Feature Selection Problem 6

A novel perspective using Chaotic-Grey Wolf Optimization Alg...

引用

6th International Conference on AI in Computational Linguistics, ACLing 2024

作者： Hadni, Meryeme Hjiaj, Hassane Gouiouez, Mounir Amane, Meryeme Department of Computer Science LAMIGEP EMSI Marrakech Morocco Department of Mathematics Faculty of Science Morocco PSCS Laboratory Sidi Mohammed Ben Abdellah University Fez Morocco Artificial Intelligence Data Science and Emergent Systems Laboratory Sidi Mohammed Ben Abdellah University Fez Morocco

In the field of neural language processing, current research projects that apply meta-heuristic approaches to Arabic text are extremely limited given the complexity of this language in terms of structure, grammatical rules, morphology, syntactic analysis and derivation rules. In this paper, we propose a new approach for processing Arabic documents using the chaotic grey wolf optimization technique, which is employed as a supervised learning method by simulating the behavior of grey wolves in searching, circling and pursuing their prey. The proposed method is divided into four phases. The term weighting phase uses TF- IDFC-RF, which is based on TF-IDF and the relevance frequency of terms in documents and classes. The feature selection phase combines the chaotic method of the grey wolf optimization algorithm to both reduce and identify relevant features for model building. In the third phase, we use three classifiers: firefly algorithm, SVM and NB to classify documents into several classes. In the experimental process, we used two collections of reference documents to present a comparative study of the different term weighting systems. The experimental results show that the new architecture, based on the chaotic optimization of the grey wolf algorithm with the Firefly algorithm, obtained the best results in terms of accuracy. © 2024 The Authors. Published by Elsevier B.V.

关键词： Feature Selection

来源：评论

学校读者我要写书评

暂无评论

Generalizability of Memorization Neural Networks 38

Generalizability of Memorization Neural Networks

引用

38th Conference on Neural Information Processing systems, NeurIPS 2024

作者： Yu, Lijia Gao, Xiao-Shan Zhang, Lijun Miao, Yibo State Key Laboratory of Computer Science Institute of Software Chinese Academy of Sciences China Academy of Mathematics and Systems Science Chinese Academy of Sciences Beijing100190 China University of Chinese Academy of Sciences Beijing100049 China

The neural network memorization problem is to study the expressive power of neural networks to interpolate a finite dataset. Although memorization is widely believed to have a close relationship with the strong generalizability of deep learning when using over-parameterized models, to the best of our knowledge, there exists no theoretical study on the generalizability of memorization neural networks. In this paper, we give the first theoretical analysis of this topic. Since using i.i.d. training data is a necessary condition for a learning algorithm to be generalizable, memorization and its generalization theory for i.i.d. datasets are developed under mild conditions on the data distribution. First, algorithms are given to construct memorization networks for an i.i.d. dataset, which have the smallest number of parameters and even a constant number of parameters. Second, we show that, in order for the memorization networks to be generalizable, the width of the network must be at least equal to the dimension of the data, which implies that the existing memorization networks with an optimal number of parameters are not generalizable. Third, a lower bound for the sample complexity of general memorization algorithms and the exact sample complexity for memorization algorithms with constant number of parameters are given. It is also shown that there exist data distributions such that, to be generalizable for them, the memorization network must have an exponential number of parameters in the data dimension. Finally, an efficient and generalizable memorization algorithm is given when the number of training samples is greater than the efficient memorization sample complexity of the data distribution. © 2024 Neural information processing systems foundation. All rights reserved.

关键词：

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：