In order to quantify the influence of external forcings on the predictability limit using observational data,the author introduced an algorithm of the conditional nonlinear local Lyapunov exponent(CNLLE)method.The effectiveness of this algorithm is validated and compared with the nonlinear local Lyapunov exponent(NLLE)and signal-to-noise ratio methods using a coupled Lorenz model.The results show that the CNLLE method is able to capture the slow error growth constrained by external forcings,therefore,it can quantify the predictability limit induced by the external forcings.On this basis,a preliminary attempt was made to apply this method to measure the influence of ENSO on the predictability limit for both atmospheric and oceanic variable fields.The spatial distribution of the predictability limit induced by ENSO is similar to that arising from the initial conditions calculated by the NLLE method.This similarity supports ENSO as the major predictable signal for weather and climate prediction.In addition,a ratio of predictability limit(RPL)calculated by the CNLLE method to that calculated by the NLLE method was proposed.The RPL larger than 1 indicates that the external forcings can significantly benefit the long-term predictability limit.For instance,ENSO can effectively extend the predictability limit arising from the initial conditions of sea surface temperature over the tropical Indian Ocean by approximately four months,as well as the predictability limit of sea level pressure over the eastern and western Pacific Ocean.Moreover,the impact of ENSO on the geopotential height predictability limit is primarily confined to the troposphere.
Ming ZHANGRuiqiang DINGQuanjia ZHONGJianping LIDeyu LU
Structural damage in heterogeneousmaterials typically originates frommicrostructures where stress concentration occurs.Therefore,evaluating the magnitude and location of localized stress distributions within microstructures under external loading is crucial.Repeating unit cells(RUCs)are commonly used to represent microstructural details and homogenize the effective response of composites.This work develops a machine learning-based micromechanics tool to accurately predict the stress distributions of extracted RUCs.The locally exact homogenization theory efficiently generates the microstructural stresses of RUCs with a wide range of parameters,including volume fraction,fiber/matrix property ratio,fiber shapes,and loading direction.Subsequently,the conditional generative adversarial network(cGAN)is employed and constructed as a surrogate model to establish the statistical correlation between these parameters and the corresponding localized stresses.The stresses predicted by cGAN are validated against the remaining true data not used for training,showing good agreement.This work demonstrates that the cGAN-based micromechanics tool effectively captures the local responses of composite RUCs.It can be used for predicting potential crack initiations starting from microstructures and evaluating the effective behavior of periodic composites.
The integration of set-valued ordered rough set models and incremental learning signify a progressive advancement of conventional rough set theory, with the objective of tackling the heterogeneity and ongoing transformations in information systems. In set-valued ordered decision systems, when changes occur in the attribute value domain, such as adding conditional values, it may result in changes in the preference relation between objects, indirectly leading to changes in approximations. In this paper, we effectively addressed the issue of updating approximations that arose from adding conditional values in set-valued ordered decision systems. Firstly, we classified the research objects into two categories: objects with changes in conditional values and objects without changes, and then conducted theoretical studies on updating approximations for these two categories, presenting approximation update theories for adding conditional values. Subsequently, we presented incremental algorithms corresponding to approximation update theories. We demonstrated the feasibility of the proposed incremental update method with numerical examples and showed that our incremental algorithm outperformed the static algorithm. Ultimately, by comparing experimental results on different datasets, it is evident that the incremental algorithm efficiently reduced processing time. In conclusion, this study offered a promising strategy to address the challenges of set-valued ordered decision systems in dynamic environments.
The subset sum problem is a combinatorial optimization problem,and its complexity belongs to the nondeterministic polynomial time complete(NP-Complete)class.This problem is widely used in encryption,planning or scheduling,and integer partitions.An accurate search algorithm with polynomial time complexity has not been found,which makes it challenging to be solved on classical computers.To effectively solve this problem,we translate it into the quantum Ising model and solve it with a variational quantum optimization method based on conditional values at risk.The proposed model needs only n qubits to encode 2ndimensional search space,which can effectively save the encoding quantum resources.The model inherits the advantages of variational quantum algorithms and can obtain good performance at shallow circuit depths while being robust to noise,and it is convenient to be deployed in the Noisy Intermediate Scale Quantum era.We investigate the effects of the scalability,the variational ansatz type,the variational depth,and noise on the model.Moreover,we also discuss the performance of the model under different conditional values at risk.Through computer simulation,the scale can reach more than nine qubits.By selecting the noise type,we construct simulators with different QVs and study the performance of the model with them.In addition,we deploy the model on a superconducting quantum computer of the Origin Quantum Technology Company and successfully solve the subset sum problem.This model provides a new perspective for solving the subset sum problem.
