HIGHER ORDER MOMENTS OF SAMPLE AUTOCOVARIANCES AND SAMPLE AUTOCORRELATIONS FROM AN INDEPENDENT TIME SERIES

Abstract. Given length- n sampled time series, generated by an independent distributed process, in this paper we treat the problem of determining the greatest order, in n , that moments of the sample autocovariances and sample autocorrelations can attain. For the sample autocovariance moments, we achieve quite general results; but, for the autocorrelation moments, we restrict study to Gaussian white noise (normal, independent and identically distributed). Our main theorem relates to the cross-moments of the non-centred sample autocovariances, but we also establish a relation between these and the corresponding moments for the centred sample autocovariances.     

Modeling for soft sensor systems and parameters updating online

Soft sensor technology is an important means to estimate important process variables in real-time. Modeling for soft sensor system is the core of this technology. Most nonlinear dynamic modeling methods integrate the processes of building the dynamic and static relationships between secondary and primary variables, which limits the estimation accuracy for primary variables. To avoid the problem, a kind of soft sensor model consisting of a dynamic model in cascade with a static one is proposed. The model identification and update online are conducted in substep way. In order to improve the model update efficiency, two improved Gauss–Newton recursive algorithms, which avoid nonsingular covariance matrix, are proposed for time-invariant and time-variant soft sensor systems. The uniform convergence for dynamic model parameter and the existence of estimation deviations for static model parameters are proved for time-invariant soft sensor system. The parameters of time-variant soft sensor system would be boundedly convergent. Case study confirms that, on the basis of the proposed model and recursive algorithms, the dynamic and static characteristics of soft sensor system can be described efficiently, and the primary variables are ensured to be estimated accurately.     

Automatic learners with feedback queries

Automatic classes are classes of languages for which a finite automaton can decide whether a given element is in a set given by its index. The present work studies the learnability of automatic families by automatic learners which, in each round, output a hypothesis and update a long-term memory, depending on the input datum, via an automatic function. Many variants of automatic learners are investigated: where the long-term memory is restricted to be the current hypothesis whenever this exists, cannot be of length larger than the length of the longest datum seen, or has to consist of a constant number of examples seen so far. Learnability is also studied with respect to queries which reveal information about past data or past computation history; the number of queries per round is bounded by a constant.     

Consensus reaching for group decision making with multi-granular unbalanced linguistic information: A bounded confidence and minimum adjustment-based approach

In group decision making problems, there exist the situations that decision makers may use unbalanced linguistic term sets that are not uniformly and symmetrically distributed to provide their linguistic assessments over alternatives. Moreover, due to the difference in knowledge and culture backgrounds, it is also possible that multi-granular linguistic term sets may also be used by decision makers. How to manage multi-granular unbalanced linguistic information in consensus-based group decision making has becoming an important topic in linguistic decision making. In this paper, we first revise Herrera’s unbalanced linguistic term sets and propose a simplified linguistic computational model to fuse multi-granular unbalanced linguistic terms. Afterwards, for multi-criteria group decision making problems with multi-granular unbalanced linguistic information, we develop two optimization models to generate adjustment advice for decision makers who have to change his/her opinions in consensus reaching process, which consider both the bounded confidence levels and minimum adjustment of decision makers’ linguistic assessments. Moreover, an algorithm is further proposed to help decision makers reach consensus in group decision making. Eventually, an application example for ERP system supplier selection and some simulation results are presented to illustrate and justify the consensus reaching algorithm.     

基于限界传递相似度图的FCA概念相似度计算方法

使用相似度图计算FCA概念相似度需要构造相似关系的传递闭包,对于复杂问题会导致相似度图规模过大,从而影响相似度评价的效率.为了降低相似度图规模,提出一种基于限界传递相似度图的FCA概念相似度计算方法.该方法首先通过限定传递相似关系的长度来避免构造相似关系的传递闭包,得到的限界传递相似度图中忽略了长度超过界限且对区分FCA概念无用的传递相似关系,能够有效压缩相似度图的规模;然后给出了动态传递相似度计算方法和由限界传递相似度图构建二部图的方法.实验结果表明,使用限界传递相似度图能够在不损失计算结果准确度的情况下有效提高FCA概念相似度计算的效率.     

Efficient SAT-based bounded model checking for software verification

This paper discusses our methodology for formal analysis and automatic verification of software programs. It is applicable to a large subset of the C programming language that includes pointer arithmetic and bounded recursion. We consider reachability properties, in particular whether certain assertions or basic blocks are reachable in the source code, or whether certain standard property violations can occur. We perform this analysis via a translation to a Boolean circuit representation based on modeling basic blocks. The program is then analyzed by a back-end SAT-based bounded model checker, where each unrolling is mapped to one step in a block-wise execution of the program.     

The influence of user cognition on consumption decision-making from the perspective of bounded rationality

Consumer decision-making is related to the success or failure of enterprises, and products that cater to the cognitive preferences of users have become a focus of current research. Based on the theory of bounded rationality, this paper explores the cognitive process of consumer decision-making. Then, how product shape affects consumption decision-making is analyzed with eye-tracking technology. Finally, the design principle of the product form is further explored. The results demonstrate the following: (1) the perceptual cognition of users has a driving effect on consumption behavior; (2) as a key factor affecting the perceptual cognition of users, product form affects consumer decision-making by influencing the degree of approach motivation; (3) by establishing the mapping relationship between product form elements and user images, the principles of product form design can be more consistent with user image preferences. This study provides useful suggestions for how to increase the purchase behavior of users from the perspective of bounded rationality.     

A survey: When moving target defense meets game theory

Moving target defense (MTD) can break through asymmetry between attackers and defenders. To improve the effectiveness of cybersecurity defense techniques, defense requires not only advanced and practical defense technologies but effective, scientific decision-making methods. Due to complex attacker–defender interaction, autonomous, automatic, accurate, and effective selection of the optimal strategy is a challenging topic in the field of MTD. The essence of cybersecurity lies in the interaction between the attacker and defender. Game theory is a useful mathematical tool for strategy selection in a competitive environment. It provides strong theoretical support for the analysis of cyberattack and defense behaviors and subsequent decision-making, and can significantly improve the decision-making ability of MTD. This study presents the basic concepts of MTD and game theory, followed by a literature review, to study MTD decision-making methods based on game theory from the dimensions of space, time, space–time, and bounded rationality. Limitations of MTD game decision-making studies are discussed, as well as research directions, to provide references for future research.     

Stability analysis for linear time-varying systems using bicoprime factorization

This paper presents a bicoprime factorization (BCF) approach to deal with various stability problems for linear discrete time-varying (LTV) systems within the framework of nest algebra. Based on the bicoprime factorization, we give necessary and sufficient conditions for (strongly) simultaneous stabilization of three systems, which generalize similar results for systems by coprime factorization (CF). Finally, when the bicoprime factorization for the plant and controller has additive perturbations, we derive sufficient conditions using the norm inequality for robust stability of the system.