Search

An effective numerical algorithm is presented to analyze the fractional viscoelastic plate in the time domain for the first time in this paper. The viscoelastic behavior of the plate is described with fractional Kelvin–Voigt (FKV) constitutive model in three-dimensional space. A governing equation with three independent variables is established. Ternary unknown function in the governing equation is solved by deriving integer and fractional order differential operational matrices of the shifted Legendre polynomials. Error analysis and mathematical example are presented to verify the effectiveness and accuracy of proposed algorithm. Finally, numerical analysis of the plate under different loading conditions is carried out. Effects of the damping coefficient on vibration amplitude of the viscoelastic plate are studied. The results obtained are consistent with the current reference and actual situation. It shows that shifted Legendre polynomials algorithm is suitable for numerical analysis of fractional viscoelastic plates. • The fractional order governing equation of a viscoelastic plate is established. • Shifted Legendre polynomials algorithm is used to solve the governing equation. • The feasibility and efficiency of the proposed algorithm are verified. • Transverse displacements of viscoelastic plate are calculated directly in the time domain. [ABSTRACT FROM AUTHOR]

The paper proposes a method of damage detection in elastic materials, which is based on analyzing the time-dependent (dynamic) response of the material excited by an acoustic signal. A case study is presented consisting of experimental measurements and their mathematical analysis. The decisive parameters (wave speed and damping coefficient) of a mathematical model of the acoustic wave are calibrated by comparing the measurement data with the numerically evaluated exact solution predicted by the mathematical model. The calibration is done both deterministically by minimizing the square error over time and stochastically by a Bayesian approach, implemented through the Metropolis-Hastings algorithm. The resulting posterior distribution of the parameters can be used to construct a Bayesian test for damage. [ABSTRACT FROM AUTHOR]

Abstract Neighborhood rough sets are widely used as an effective tool to deal with numerical data. However, most of the existing neighborhood granulation models cannot well describe the neighborhoods of category-mixed samples when they are used to characterize the classification ability of a subset of attributes. In this paper, we propose a new neighborhood rough set model called k -nearest neighborhood rough sets. This model combines the advantages of both δ -neighborhood and k -nearest neighbor, and has a better ability to deal with this type of heterogeneous data than the existing models. We employ an iterative strategy to define rough approximations of a decision and discuss their monotonicity. Furthermore, an attribute reduction algorithm based on this model is designed. Experimental analysis shows that the proposed algorithm has better performance than some existing algorithms, especially the δ -neighborhood rough set model and k -nearest neighbor rough set model. [ABSTRACT FROM AUTHOR]

Abstract This paper presents the problems of state space model identification of multirate processes with unknown time delay. The aim is to identify a multirate state space model to approximate the parameter-varying time-delay system. The identification problems are formulated under the framework of the expectation maximization algorithm. Through introducing two hidden variables, a new expectation maximization algorithm is derived to estimate the unknown model parameters and the time-delays simultaneously. The effectiveness of the proposed algorithm is validated by a simulation example. [ABSTRACT FROM AUTHOR]

Abstract In this paper, a novel augmented complex-valued normalized subband adaptive filter (ACNSAF) algorithm is proposed for processing the noncircular complex-valued signals. Based on the augmented statistics, the proposed algorithm is derived by computing a constraint cost function. Due to contain all second-order statistical properties, the ACNSAF algorithm can process the circular and noncircular complex-valued signals simultaneously. Moreover, the stability and mean square steady-state analysis of the proposed algorithm is derived by using the energy conservation principle. Computer simulation experiments on complex-valued system identification, prediction and noise cancelling show that the proposed algorithm achieves the improved mean square deviation and prediction gain compared to the ACNLMS algorithm. And the simulation results are consistent with the analysis results. [ABSTRACT FROM AUTHOR]

This paper is concerned with the numerical solution of fractional initial value problems (FIVP) in sense of Caputo’s definition for dynamical systems. Unlike for integer-order derivatives that have a single definition, there is more than one definition of non integer-order derivatives and the solution of an FIVP is definition-dependent. In this paper, the chief differences of the main definitions of fractional derivatives are revisited and a numerical algorithm to solve an FIVP for Caputo derivative is proposed. The main advantages of the algorithm are twofold: it can be initialized with integer-order derivatives, and it is faster than the corresponding standard algorithm. The performance of the proposed algorithm is illustrated with examples which suggest that it requires about half the computation time to achieve the same accuracy than the standard algorithm. [ABSTRACT FROM AUTHOR]

This paper presents a nonhomogeneous continuous super-twisting algorithm for systems of relative degree more than one. The conditions of finite-time convergence to the origin are obtained and the robustness of the designed algorithm is discussed. The paper concludes with numerical simulations illustrating performance of the designed algorithms. [ABSTRACT FROM AUTHOR]

In this paper, we discuss the problem of the optimal H 2 model order reduction (MOR) on a given frequency interval for bilinear systems. We first define the H 2, ω norm for bilinear systems. And it is shown that the H 2, ω norm for the bilinear system can be computed by its frequency-limited controllability Gramian or the frequency-limited observability Gramian. One of our contributions is that the necessary conditions for the order-reduced bilinear system to be H 2, ω optimal are derived. Thereby, an iterative algorithm is proposed to construct the order-reduced bilinear system with high accuracy in the selected frequency interval. Numerical examples demonstrate the effectiveness of our algorithm. [ABSTRACT FROM AUTHOR]

• We propose a new clustering method for clustering categorical data based on the fuzzy k-modes algorithm. • A new attribute weighting mechanism is used to improve the performance of the fuzzy k-modes algorithm. • In addition to weighting the attributes, we use cluster weighting to avoid poor local optima, which occurs after bad initialization. • We introduce a new distance criterion that significantly reduces sensitivity to noise. • Our method forms high quality clusters during clustering process, irrespective of the initialization. The fuzzy k-modes (FKM) is a popular method for clustering categorical data. However, the main problem of this algorithm is that it is very sensitive to the initialization of primary clusters, so inappropriate initial cluster centers lead to poor local optima. Another problem with the FKM is the equal importance of the attributes used during the clustering process, which in real applications, the importance of the attributes are different, and some attributes are more important than others. Some versions of FKM have been presented in the literature, each of which has somehow solved one of the above problems. In this paper, we propose a new clustering method (FKMAWCW) to solve mentioned problems at the same time. In the proposed clustering process, a local attribute weighting mechanism is used to weight the attributes of each cluster properly. Also, a cluster weighting mechanism is proposed to solve the initialization sensitivity. Attribute weight and cluster weight are learned simultaneously and automatically during the clustering process. In addition, to reduce the noise sensitivity, a new distance function is proposed. So, the proposed algorithm can tolerate noisy environment. Extensive experiments on 11 benchmark datasets and an artificially generated dataset show that the proposed algorithm performs better than the state-of-the-art algorithms. This paper presents mathematical analyses to obtain updating functions, providing the convergence proof of the algorithm. The implementation source code of FKMAWCW is made publicly available at https://github.com/Amin-Golzari-Oskouei/FKMAWCW. [ABSTRACT FROM AUTHOR]

The advantages and applications of rule-based systems have caused them to be widely recognized as one of the most popular systems in human decision-making, due to their accuracy and efficiency. To improve the performance of rule-based systems, there are several issues proposed to be focused. First, it is unnecessary to take the entire rule base into consideration during each decision-making process. Second, there is no need to visit the entire rule base to search for the key rules. Last, the key rules for each decision-making process should be different. This paper focuses on an advanced extended belief rule base (EBRB) system and proposes a multi-attribute search framework (MaSF) to reconstruct the relationship between rules in the EBRB to form the MaSF-based EBRB. MaSFs can be divided into k -dimensional tree (KDT)-based MaSFs and Burkhard–Keller (BKT)-based MaSFs. The former is targeted at decision-making problems with small-scale attribute datasets, while the latter is for those with large-scale attribute datasets. Based on the MaSF-based EBRB, the k -neighbor search and the best activated rule set algorithms are further proposed to find both the unique and the desired rules for each decision-making process without visiting the entire EBRB, especially when handling classification problems with large attribute datasets. Two sets of experiments based on benchmark datasets with different numbers of attributes are performed to analyze the difference between KDT-based MaSFs and BKT-based MaSFs, and to demonstrate how to use MaSFs to improve the accuracy and efficiency of EBRB systems. MaSFs and their corresponding algorithms are also regarded as a general optimization framework that can be used with other rule-based systems. [ABSTRACT FROM AUTHOR]

In this paper, we present some sufficient conditions for the existence of solutions of the constrained linear matrix equation, which play an important role in designing and analyzing a direct parametric control approach for the eigenstructure assignment problem. Based on these sufficient conditions, the solution of this constrained linear matrix equation is obtained. Finally, two numerical examples are given to illustrate the effectiveness of the proposed algorithm. [ABSTRACT FROM AUTHOR]

The Intelligent Water Drop (IWD) algorithm is a recent stochastic swarm-based method that is useful for solving combinatorial and function optimization problems. In this paper, we propose an IWD ensemble known as the Master-River, Multiple-Creek IWD (MRMC-IWD) model, which serves as an extension of the modified IWD algorithm. The MRMC-IWD model aims to improve the exploration capability of the modified IWD algorithm. It comprises a master river which cooperates with multiple independent creeks to undertake optimization problems based on the divide-and-conquer strategy. A technique to decompose the original problem into a number of sub-problems is first devised. Each sub-problem is then assigned to a creek, while the overall solution is handled by the master river. To empower the exploitation capability, a hybrid MRMC-IWD model is introduced. It integrates the iterative improvement local search method with the MRMC-IWD model to allow a local search to be conducted, therefore enhancing the quality of solutions provided by the master river. To evaluate the effectiveness of the proposed models, a series of experiments pertaining to two combinatorial problems, i.e., the travelling salesman problem (TSP) and rough set feature subset selection (RSFS), are conducted. The results indicate that the MRMC-IWD model can satisfactorily solve optimization problems using the divide-and-conquer strategy. By incorporating a local search method, the resulting hybrid MRMC-IWD model not only is able to balance exploration and exploitation, but also to enable convergence towards the optimal solutions, by employing a local search method. In all seven selected TSPLIB problems, the hybrid MRMC-IWD model achieves good results, with an average deviation of 0.021% from the best known optimal tour lengths. Compared with other state-of-the-art methods, the hybrid MRMC-IWD model produces the best results (i.e. the shortest and uniform reducts of 20 runs) for all13 selected RSFS problems. [ABSTRACT FROM AUTHOR]

Model reference adaptive controllers with Minimal Control Synthesis are effective control algorithms to guarantee asymptotic convergence of the tracking error to zero not only for disturbance-free uncertain linear systems, but also for highly nonlinear plants with unknown parameters, unmodeled dynamics and subject to perturbations. However, an apparent drift in adaptive gains may occasionally arise, which can eventually lead to closed-loop instability. In this paper, we address this key issue for discrete-time systems under L 2 disturbances using a parameter projection algorithm. A consistent proof of stability of all the closed-loop signals is provided, while tracking error is shown to asymptotically converge to zero. We also show the applicability of the adaptive algorithm for digitally controlled continuous-time plants. The proposed algorithm is numerically validated taking into account a discrete-time LTI system subject to parameter uncertainty, parameter variations and L 2 disturbances. Finally, as a possible engineering application of this novel adaptive strategy, the control of a highly nonlinear electromechanical actuator is considered. [ABSTRACT FROM AUTHOR]

In this paper, we consider the multi-dimensional Kesten algorithm studied in Xu and Dai (2012). The convergence in r th mean for the algorithm is established under the weaker assumptions than Xu and Dai (2012). Moreover, we obtain also the almost sure convergence of the algorithm under the conditions of Xu and Dai (2012). [ABSTRACT FROM AUTHOR]