中国科学院数学与系统科学研究院期刊网

2026年, 第39卷, 第4期 刊出日期:2026-05-11
  

  • 全选
    |
  • KONG Chuiliu, WANG Ying
    系统科学与复杂性(英文). 2026, 39(4): 1387-1413. https://doi.org/10.1007/s11424-026-4618-9
    摘要 ( ) PDF全文 ( )   可视化   收藏
    This paper investigates the adaptive tracking control problem for Auto-Regressive Moving Average (ARMA) systems with quantized observations, explicitly focusing on reference signals composed of non-periodic sequences. The authors propose an adaptive tracking control scheme integrating an adaptive controller with a stochastic approximation-type estimation algorithm. Different from the control scheme for Finite Impulse Response (FIR) systems, the estimation part not only estimates the unknown system parameters but also the unknown system outputs. Next, based on the certainty equivalent principle, the adaptive controller is designed using the above two estimates instead of the actual parameters and system outputs. To tackle the inherent coupling between the two estimates, the authors introduce a novel approach that combines the Lyapunov function method with a backward-shifted polynomial method featuring time-varying coefficients. This approach assists in establishing the mean square convergence of the estimates with a convergence rate of $O\left(\frac{1}{k}\right)$ under suitable conditions of the step size coefficient. Additionally, this paper shows that the designed adaptive control law can achieve asymptotically optimal tracking of non-periodic reference signals in the mean square sense. Finally, a numerical simulation is presented to validate the theoretical results obtained in this paper.
  • DONG Hailing, SUN Liying, XIAO Mingqing, LIU Zhaobo, SONG Yuanzhuo
    系统科学与复杂性(英文). 2026, 39(4): 1414-1435. https://doi.org/10.1007/s11424-025-4311-4
    摘要 ( ) PDF全文 ( )   可视化   收藏
    In this paper, the authors address the problem of almost sure polynomial stabilization for a class of highly nonlinear stochastic systems via sampled-data feedback. The considered systems fall within a general framework that includes two key features: (a) Continuous-time irreducible Markov chain- the authors introduce a continuous-time irreducible Markov chain to describe systems that can undergo sudden alterations in their parameters and structures. This flexibility allows us to model real-world scenarios more accurately; (b) Diffusion and drift coefficients with polynomial growth - unlike existing literature that primarily focuses on systems with bounded delays, the authors investigate the stabilization conditions for highly nonlinear stochastic systems with pantograph delay, an unbounded delay. Specifically, the authors analyze systems where the diffusion and drift coefficients satisfy a polynomial growth condition. To achieve the proposed goal, the authors employ $M$-matrix theory and Lyapunov functions as basic tools. The main results establish that the system can attain almost sure polynomial stabilization through a subtly and innovatively designed sampled-data feedback. The authors validate the theoretical findings with numerical simulations, demonstrating the effectiveness of the proposed approach. This work contributes to the understanding of stabilization in highly nonlinear stochastic systems, particularly those with unbounded delays, and broadens the practical applicability of stochastic modeling.
  • ZHONG Xiaojing, ZENG Jiaxin, XIANG Wendi, CARABALLO Tomás, DENG Feiqi, PENG Yuqing
    系统科学与复杂性(英文). 2026, 39(4): 1436-1462. https://doi.org/10.1007/s11424-025-4372-4
    摘要 ( ) PDF全文 ( )   可视化   收藏
    To explore the impact of various groups and methods on rumor propagation, the authors propose a 'Double-Refutation $(DR)$ and Double-Blocking $(DB)$' rumor control strategy. This strategy combines external refutation via media reports, internal refutation by counteracting individuals, and both continuous and impulse blocking methods. By leveraging multi-synergy and aiming to minimize control costs, the authors propose stochastic optimal hybrid control strategies for rumor containment. Additionally, to enhance the response speed of the control strategy, the authors introduce an ensemble learning algorithm as a substitute for theoretical solutions. Numerical simulations demonstrate that the trained ensemble learning control algorithm can quickly identify sub-optimal control strategies for rumor spreading, with costs only 4.1% higher than those of the optimal control theory.
  • XIE Liang-Liang
    系统科学与复杂性(英文). 2026, 39(4): 1463-1476. https://doi.org/10.1007/s11424-026-5033-y
    摘要 ( ) PDF全文 ( )   可视化   收藏
    To estimate physical parameters in a grey-box model with linear regressions, a two-step approach with much reduced computational complexity is developed. First, the parameters of the linear regression model are estimated via the simple linear least square method, before they are fed into a nonlinear optimization problem of a much reduced dimension. It is discovered that the right formulation of the optimization criterion depends on the input-output data, and can be expressed in terms of the singular value decomposition of the data matrix. It is also found that the estimated physical parameters can be fed back to improve the parameters of the linear regression model. This improvement is a consequence of exploiting the structural information of the system contained in the grey-box model, and thus overfitting to the limited training data can be avoided. Numerical examples are presented to demonstrate the effectiveness of the approach.
  • LI Jun, WU Xiaotai, LI Tao
    系统科学与复杂性(英文). 2026, 39(4): 1477-1496. https://doi.org/10.1007/s11424-025-4242-0
    摘要 ( ) PDF全文 ( )   可视化   收藏
    This article aims to establish a Bayesian Stackelberg game framework for analyzing the incomplete information demand response management with overlapping electricity sales areas, and further provide the corresponding equilibrium strategies. Considering that the satisfaction parameters of power users are private, a Bayesian game model is constructed among these power users, and a non-cooperative game model is established due to the price competition of microgrids. To ensure the sequential interactions of demand response, a Stackelberg game is developed by assuming that the microgrids are leaders and the power users are followers, and the Bayesian Nash equilibrium and Stackelberg equilibrium are proved to exist and are unique under some conditions. In addition, the Bayesian Nash equilibrium for power users is obtained using the fictitious play method in the symmetrical case, and an iterative algorithm is presented for determining the Stackelberg equilibrium. Finally, the numerical simulations are provided showing the effectiveness and convergence of the iterative algorithm, which indicates that the proposed approach can enhance profits for microgrids while ensuring power supply and demand balance.
  • LI Guanxu, WU Zhen
    系统科学与复杂性(英文). 2026, 39(4): 1497-1525. https://doi.org/10.1007/s11424-025-4321-2
    摘要 ( ) PDF全文 ( )   可视化   收藏
    This paper is concerned with the $N$-player stochastic differential game of optimal switching. Both Nash equilibrium and social optima are studied and proven to have the same mean field limit. The authors prove the convergence of the value functions in the sense of viscosity solution, and show the limit of Nash equilibrium coincides with social optima as $N\to\infty$. In virtue of the weak formulation, the limit problem is characterized by a weak mean field equilibrium, which corresponds to approximate solutions of $N$-player game. Moreover, the authors provide example and simulation to illustrate the connection between weak mean field equilibrium and $N$-player game.
  • KE Huanyu, ZHANG Fan, LI Jianning
    系统科学与复杂性(英文). 2026, 39(4): 1526-1551. https://doi.org/10.1007/s11424-025-4455-2
    摘要 ( ) PDF全文 ( )   可视化   收藏
    This paper investigates the problem of event-triggered disturbance attenuation and fault-tolerant constrained consensus in multi-agent systems with a variable number of agents. First, an event-triggered design combining a disturbance observer and a fault-tolerant controller is proposed, which reduces network bandwidth usage while accurately estimating and compensating for disturbances and partial actuator failures, thereby improving system reliability. Next, a time-varying impulsive Lyapunov function related to the number of agents is introduced, and the communication matrix changes-resulting from variations in the communication structure are transformed into additive uncertainties, thus addressing topology switching issues arising from changes in the number of agents. To overcome the limitation of traditional $H_\infty$ control, which assumes zero initial conditions, a performance index dependent on the initial state is proposed, along with a novel event-triggered disturbance-rejection fault-tolerant control protocol. Sufficient conditions ensuring the consistency of disturbance attenuation and fault-tolerance constraints are then provided. Numerical simulations demonstrate the effectiveness of the proposed method.
  • QIU Xinyu, WANG Zhenyou, LUO Ao, MA Hui, XU Shengbing
    系统科学与复杂性(英文). 2026, 39(4): 1552-1573. https://doi.org/10.1007/s11424-026-5151-6
    摘要 ( ) PDF全文 ( )   可视化   收藏
    This paper investigates a finite-time optimal bipartite containment control problem for multi-agent systems (MASs) with input saturation. Firstly, a command-filtered technique is applied to filter the virtual control signals to avoid the problem of ``explosion of complexity". Then, the filter and saturation losses are compensated simultaneously by skillfully constructing auxiliary systems, whose signals converge in finite time. Due to the strong nonlinearity of the Hamilton-Jacobi-Bellman equations and system dynamics, the modified identifier-actor-critic reinforcement learning (IAC-RL) algorithm is employed to approximate the unknown functions and train the optimal controller. Specifically, the cost function in the traditional IAC-RL algorithm is modified to ensure its convergence over a long time. With the help of a correction term, the updating laws of the IAC-RL neural networks are also improved to avoid premature termination during training optimal controllers. Finally, the MASs are proved to be semiglobally practically finite-time stable. The effectiveness of the proposed protocol is proved through numerical and practical examples.
  • ZHAO Jianrong, BA Zhaowen, SONG Yunbo, LI Zicheng
    系统科学与复杂性(英文). 2026, 39(4): 1574-1591. https://doi.org/10.1007/s11424-026-4364-z
    摘要 ( ) PDF全文 ( )   可视化   收藏
    In this paper, the asynchronously practical control is studied for discrete time switched systems with singular perturbations. Firstly, a novel Lyapunov function is constructed including the singular perturbation parameter and quasi-time parameter matrices. And then, quasi-time dependent criteria are achieved to study the practical stability and asynchronous stabilization; an allowable upper bound is expected to be obtained for the singular perturbation parameters; the asynchronous sampling controller is designed with quasi-time gains, and the application range of this controller is further widened via some constraints relaxed. At last, two simulation examples are utilized to illustrate that the proposed results are less conservative and effective.
  • WEN Hao, WU Wei, TONG Shaocheng
    系统科学与复杂性(英文). 2026, 39(4): 1592-1611. https://doi.org/10.1007/s11424-025-4654-x
    摘要 ( ) PDF全文 ( )   可视化   收藏
    This paper investigates the fuzzy adaptive resilient leader-following consensus control problem for a class of nonlinear heterogeneous multi-agent systems (HMASs) under denial-of-service (DoS) attacks. Since the considered leader's system contains unknown nonlinear dynamics and HMASs are subject to DoS attacks, the leader's states and output are inaccessible to followers, a stable distributed estimator is developed to estimate them. To solve the virtual controller non-differentiable problem in backstepping control design technique caused by DoS attacks, the command-filter is introduced into the backstepping control design process, and formulate a resilient leader-following consensus controller. It is proven that the proposed control scheme can guarantee that the controlled HMASs are stable, and the consensus errors converge to a small neighborhood of zero. Finally, a simulation example on unmanned aerial vehicle-unmanned ground vehicles (UAV-UGVs) is provided to verify the feasibility of the proposed control scheme.
  • QIAN Wei, LU Di, WU Yanmin
    系统科学与复杂性(英文). 2026, 39(4): 1612-1629. https://doi.org/10.1007/s11424-025-4492-x
    摘要 ( ) PDF全文 ( )   可视化   收藏
    This paper explores the dynamic event-triggered (DET) ${H_\infty }$ load frequency control (LFC) for networked power systems (NPSs) subject to deception attacks. Firstly, a novel DET mechanism is proposed, which aims to improve the system control performance under deception attacks and save more network resources effectively. Compared with the existing DET mechanisms, the proposed DET mechanism involves an adaptive rule, which can be utilized to dynamically adjust the event-triggered threshold based on the relative rate of change and absolute difference of system state and the frequency of deception attacks. Then, considering the complexity of the actual power systems, a new DET-based LFC stochastic model is formulated, which integrates actuator failure, network-induced delay and deception attacks. Subsequently, by using Lyapunov theory, the sufficient conditions guaranteeing the asymptotic mean-square stability of the NPSs are derived. Finally, some simulation results are presented to validate the superiority of the designed approach.
  • ZHANG Wenqing, ZOU Yunlei
    系统科学与复杂性(英文). 2026, 39(4): 1630-1641. https://doi.org/10.1007/s11424-025-4375-1
    摘要 ( ) PDF全文 ( )   可视化   收藏
    In this paper, the authors investigate asymptotic stability of Markovian jump Boolean networks with random time delays. Initially, by utilizing the algebraic formulation of time-delay switched Boolean networks, the system is transformed into a high-dimensional Markovian jump Boolean networks, and an equivalent Markov chain is constructed. Then the addressed asymptotic stability problem is reformulated as the set stability problem. Through the state space decomposition of the Markov chain, the corresponding criteria for the asymptotic stability are derived. Furthermore, the asymptotic stability problem is solvable by using the breadth-first search algorithm. Finally, the validity of the obtained results is demonstrated through a biological example.
  • LIU Yunhao, FENG Gengzhong, SUN Shaolong, CHIN Kwai-Sang, WANG Shouyang
    系统科学与复杂性(英文). 2026, 39(4): 1642-1659. https://doi.org/10.1007/s11424-026-4177-0
    摘要 ( ) PDF全文 ( )   可视化   收藏
    The map search data, which reflect the willingness to travel, have the potential in forecasting tourist arrivals. This study introduces the map search data as a new indicator in tourist arrivals forecasting. The authors use Mount Tai and Macao, China's daily tourist arrival data as experimental data and the map search volume index. By employing four widely-used methods, the authors use the map search data and search engine data as indicators in tourist arrivals forecasting. The experimental results show that the map search data can effectively improve forecasting performance, which is better than using search engine data. These findings are still valid during the COVID-19 pandemic by examining them in Macao, China's data.
  • TANG Zhipeng, HUA Guowei, LI Xiaowei, CHENG Edwin T. C.
    系统科学与复杂性(英文). 2026, 39(4): 1660-1687. https://doi.org/10.1007/s11424-025-4026-6
    摘要 ( ) PDF全文 ( )   可视化   收藏
    Contingent free shipping can improve purchase motivation and increase sales, and is an important promotional means for e-commerce platforms. Among them, it is particularly common for e-commerce platforms to provide free shipping coupons to paid members. How much cost does it take to provide free shipping coupons and how much revenue does it bring, causing confusion to e-commerce platforms. The authors build pricing decision models based on consumers' shopping frequency and their sensitivity to shipping costs when e-commerce platforms offering single, multiple and unlimited number of free shipping coupon services. Through the analysis, the authors find that high-sensitivity consumers dislike paying for shipping and prefer to purchase free shipping coupons. The authors also find that when adopting multiple free shipping coupons strategy, the optimal number of free shipping coupons to offer is associated with the frequency of consumers' small order purchases. However, if unlimited number of free shipping coupons is offered, online retailers need to increase membership fees to make more profit. This study brings practical insights for e-commerce platforms as well as online retailers to determine reasonable pricing under different free shipping coupon service strategies and provide consumers with a more convenient shopping experience.
  • LI Wenhui, ZHANG Xinyu
    系统科学与复杂性(英文). 2026, 39(4): 1688-1706. https://doi.org/10.1007/s11424-025-4067-x
    摘要 ( ) PDF全文 ( )   可视化   收藏
    The problem of endogeneity remains central to research in economics and econometrics. The authors propose a model averaging method for regression models with endogenous regressors. Given the high dimensionality of instruments, the authors utilize a low-dimensional representation of the instrument set via factor instrumental variables. With a set of candidate models differing in the choices of factor instrumental variables and exogenous regressors, the authors combine the generalized method of moments estimators from each candidate model, using weights that minimize a cross-validation criterion. The authors prove the asymptotic optimality of the proposed method in the sense that it minimizes the squared estimation loss. The efficacy of the method is demonstrated through extensive simulation studies.
  • YAN Zichun, ZHANG Xiaoxu, ZHANG Jinxing, LIANG Zeheng
    系统科学与复杂性(英文). 2026, 39(4): 1707-1733. https://doi.org/10.1007/s11424-025-4200-x
    摘要 ( ) PDF全文 ( )   可视化   收藏
    In the context of global value chain restructuring, developing countries involved in processing trade face severe challenges in industrial upgrading. The development of transportation can accelerate the flow of knowledge resources and promote regional technology upgrading. This study aims to investigate whether the development of air capacity can alleviate the regional demand for technologically sophisticated trade, incorporate the factor of international air capacity into the influencing factors of product technology sophistication, explore the relationship between regional transportation development and the technical level of trade products from the perspective of enterprises, so as to fill the gap in relevant research. By combining OAG databases with customs data, the study matches the import and export data of 1302 listed companies from 2010 to 2016, along with corresponding regional air transport data. The empirical results demonstrate that increasing air capacity reduces the regional demand for trade technology sophistication. Moreover, internal factors such as enterprise R&D expenditure and capital-intensive negatively moderate the influence of air capacity growth on the trade technology sophistication. Additionally, external institutional factors, such as government effectiveness and the business environment across various countries negatively regulate the impact of the air capacity expansion on trade technology sophistication.
  • MARIOLIS Theodore, NTEMIROGLOU Nikolaos, PALANTZIDIS Christos
    系统科学与复杂性(英文). 2026, 39(4): 1734-1762. https://doi.org/10.1007/s11424-026-4176-1
    摘要 ( ) PDF全文 ( )   可视化   收藏
    This paper explores the fundamental question of the degrees of controllability (in the sense of Kalman-Friedland) of Keynesian-type linear multiplier processes of income-import-primary input changes for a significant class of actual input-output table economies based on a dynamic and extended version of the Kurz multi-sector multiplier model and providing relevant spectral evidence from extensive input-output table data. The findings suggest that, irrespective of the direction of the control-policy instrument vector, (i) the degrees of controllability are not greater than the order of $10^{-19}$; (ii) for a tolerance of $10^{-4}$ (of $10^{-2}$), the normalised numerical rank of the controllability matrices is not greater than 17% (than 10%); (iii) the largest spreads between two consecutive singular values of the controllability matrices are not greater than $10^{-1}$ and, therefore, (iv) the dynamic multiplier systems are structurally almost uncontrollable. Since these controllability characteristics arise from the underlying-deep production-consumption structure of the considered class of actual input-output table economies, and since the effectiveness of demand management policies is at the centre of controversy in the post-2008 crisis world, the findings of this paper are of interest for both theoretical and applied policy studies.
  • YI Jieyi, TANG Niansheng, WU Ying, SU Tong
    系统科学与复杂性(英文). 2026, 39(4): 1763-1794. https://doi.org/10.1007/s11424-026-5387-1
    摘要 ( ) PDF全文 ( )   可视化   收藏
    High-dimensional linear mixed models are widely used for longitudinal data analysis, yet their reliance on normality assumptions often limits applicability in psychometric and biomedical settings. To address this, the authors propose a high-dimensional skew-normal linear mixed model and develop a novel variational Baysian method that integrates spike-and-slab Lasso priors for simultaneous parameter estimation and variable selection. To handle dependencies in the joint posterior, the authors propose a variational auto-encoders to extract latent features, and employ a coordinate ascent algorithm to optimize the evidence lower bound (ELBO), circumventing intractable integrals. Model comparison is conducted using the Bayes factor, approximated via the ELBO. The effectiveness of the proposed methodologies is demonstrated through simulation studies and a real-data application.
  • LIU Lifeng, SUN Fasheng
    系统科学与复杂性(英文). 2026, 39(4): 1795-1814. https://doi.org/10.1007/s11424-026-5409-z
    摘要 ( ) PDF全文 ( )   可视化   收藏
    Space-filling designs are widely used in computer experiments to build effective metamodels with limited prior information, as they enable thorough exploration of the design space by uniformly distributing points. However, many existing designs perform poorly in low-dimensional projections, particularly when only a few factors are active. Uniform projection designs address this limitation by optimizing point distribution across low-dimensional subspaces, ensuring uniformity in all dimensions while maintaining desirable distance and column-orthogonality properties. Existing methods for constructing such designs often rely on complex algorithms or can only generate designs with large factor-to-run ratios. In this work, the authors propose a simple approach for constructing uniform projection Latin hypercube designs by employing orthogonal arrays. The proposed method is particularly effective when the number of factors is much smaller than the number of runs. Both theoretical and numerical results demonstrate that the designs produced by the proposed method perform well with respect to the uniform projection, low-dimensional stratification, maximin distance, and column-orthogonality criteria.
  • XU Juan, WU Wenyuan, FENG Yong, DONG Rina
    系统科学与复杂性(英文). 2026, 39(4): 1815-1838. https://doi.org/10.1007/s11424-026-4537-9
    摘要 ( ) PDF全文 ( )   可视化   收藏
    Monotonic optimization is a special class of global optimization with applications cross fields. It addresses problems in which the objective and constraint functions are increasing w.r.t. each of the variables. In this work, the authors extend to the case where the objective and constraint functions are monotonic. The authors present a general framework to address such problems, and especially propose a complete algorithm that is guaranteed to terminate in finitely many steps for problems in a special form. Different from traditional optimization algorithms based on gradient descent, the proposed algorithm does not require closed-form expressions of the functions. As an important application, the functions involved in the parameter optimization problem of LWE-based encryption scheme exhibit monotonicity w.r.t. each of the variables (but may not be increasing), and certain functions involved have no closed-form expression. Inspired by the idea of mathematics mechanization, the authors formalize practical problems into mathematical models and provide a framework for developing automatic and systematic approaches to tackle the parameter optimization problems in lattice-based cryptography. As an illustrative example, the authors consider the parameter optimization of BGV scheme in the context of minimizing communication overhead, without considering homomorphic operations, and provide optimal parameters for it under specified security levels and correctness probabilities.
  • HUANG Bo, MASTEV Ivan, ROMANOVSKI Valery G.
    系统科学与复杂性(英文). 2026, 39(4): 1839-1855. https://doi.org/10.1007/s11424-026-4296-7
    摘要 ( ) PDF全文 ( )   可视化   收藏
    The authors investigate the local integrability and linearizability of a family of three-dimensional polynomial systems with the matrix of the linear approximation having the eigenvalues $1, \zeta, \zeta^2 $, where $\zeta$ is a primitive cubic root of unity. A criterion for the convergence of the Poincare-Dulac normal form of the systems is established and the relationship between the normal form and integrability is analyzed. Additionally, the authors introduce an efficient algorithm to determine the necessary conditions for the integrability of the systems. This algorithm is then applied to a quadratic subfamily of the systems to analyze its integrability and linearizability. The findings offer insights into the integrability properties of three-dimensional polynomial systems.
  • MA Shi-Mei, MANSOUR Toufik, YEH Jean, YEH Yeong-Nan
    系统科学与复杂性(英文). 2026, 39(4): 1856-1878. https://doi.org/10.1007/s11424-026-4600-6
    摘要 ( ) PDF全文 ( )   可视化   收藏
    In this paper, the authors stumble upon that the normal ordering expansion for $\left(x\frac{{d}}{{d}x}\right)^n$ is equivalent to the expansion of $(bD_G)^n$, where $G$ is the context-free grammar defined by $G=\{a\rightarrow a,~b\rightarrow 1\}$. Motivated by this fact, the authors introduce the definition of grammatical basis. The authors then study several grammatical bases generated by $G=\{a\rightarrow 1,~b\rightarrow 1\}$. Using grammatical bases, the authors give a classification of grammars. In particular, the authors provide new grammatical descriptions for Ward numbers, Hermite polynomials, Bessel polynomials, Chebyshev polynomials and logarithmic polynomials arising from an integral. The authors end this paper by giving some applications of grammatical bases. One can see that if two or more polynomials share a grammatical basis, then they share the same coefficients, and it might be helpful for the detection of intrinsic relationship among superficially different structures.