Search

Estimating power spectrum density (PSD) is essential in signal processing. This short paper gives a theorem to represent a smoothed PSD estimate with the Cauchy integral. It may be used for the approximation of the smoothed PSD estimate.

This paper deals with the nonmonotone projection algorithm for constrained nonlinear equations. For some starting points, the previous projection algorithms for the problem may encounter slow convergence which is related to the monotone behavior of the iterative sequence as well as the iterative direction. To circumvent this situation, we adopt the nonmonotone technique introduced by Dang to develop a nonmonotone projection algorithm. After constructing the nonmonotone projection algorithm, we show its convergence under some suitable condition. Preliminary numerical experiment is reported at the end of this paper, from which we can see that the algorithm we propose converges more quickly than that of the usual projection algorithm for some starting points.

Recently, LSI (Latent Semantic Indexing) based on SVD (Singular Value Decomposition) is proposed to overcome the problems of polysemy and homonym in traditional lexical matching. However, it is usually criticized as with low discriminative power for representing documents although it has been validated as with good representative quality. In this paper, SVD on clusters is proposed to improve the discriminative power of LSI. The contribution of this paper is three manifolds. Firstly, we make a survey of existing linear algebra methods for LSI, including both SVD based methods and non-SVD based methods. Secondly, we propose SVD on clusters for LSI and theoretically explain that dimension expansion of document vectors and dimension projection using SVD are the two manipulations involved in SVD on clusters. Moreover, we develop updating processes to fold in new documents and terms in a decomposed matrix by SVD on clusters. Thirdly, two corpora, a Chinese corpus and an English corpus, are used to evaluate the performances of the proposed methods. Experiments demonstrate that, to some extent, SVD on clusters can improve the precision of interdocument similarity measure in comparison with other SVD based LSI methods.

The main contribution of this paper is presenting a flexible solution to the box-constrained least squares problems. This solution is applicable to many existing problems, such as nonnegative matrix factorization, support vector machine, signal deconvolution, and computed tomography reconstruction. The key concept of the proposed algorithm is to replace the minimization of the cost function at each iteration by the minimization of a surrogate, leading to a guaranteed decrease in the cost function. In addition to the monotonicity, the proposed algorithm also owns a few good features including the self-constraint in the feasible region and the absence of a predetermined step size. This paper theoretically proves the global convergence for a special case of below-bounded constraints. Using the proposed mechanism, some valuable algorithms can be derived. The simulation results demonstrate that the proposed algorithm provides performance that is comparable to that of other commonly used methods in numerical experiment and computed tomography reconstruction.

Thresholding segmentation based on fuzzy entropy and intelligent optimization is one of the most commonly used and direct methods. This paper takes fuzzy Kapur’s entropy as the best optimal objective function, with modified quick artificial bee colony algorithm (MQABC) as the tool, performs fuzzy membership initialization operations through Pseudo Trapezoid-Shaped (PTS) membership function, and finally, according to the image’s spacial location information, conducts local information aggregation by way of median, average, and iterative average so as to achieve the final segmentation. The experimental results show that the proposed FMQABC (fuzzy based modified quick artificial bee colony algorithm) and FMQABCA (fuzzy based modified quick artificial bee colony and aggregation algorithm) can search out the best optimal threshold very effectively, precisely, and speedily and in particular show exciting efficiency in running time. This paper experimentally compares the proposed method with Kapur’s entropy-based Electromagnetism Optimization (EMO) method, standard ABC, and FDE (fuzzy entropy based differential evolution algorithm), respectively, and concludes that MQABCA is far more superior to the rest in terms of segmentation quality, iterations to convergence, and running time.

This paper presents an analytical solution of the simply supported horizontally composite curved I-beam by trigonometric series considering the effect of partial interaction in the tangential direction. Governing equations and boundary conditions are obtained by using the Vlasov curved beam theory and the principle of minimum potential energy. The deflection functions and the Lagrange multiplier functions are expressed as trigonometric series to satisfy the governing equations and the simply supported constraints at both ends. The numerical results of deflections and forces which are obtained by this method are compared with both FEM results and experimental results, and the inaccuracy between the analytical solutions in this paper and the FEM results is small and reasonable.

A method to evaluate the stability of tunnel face is proposed in the framework of upper bound theorem. The safety factor which is widely applied in slope stability analysis is introduced to estimate the stability of tunnel face using the upper bound theorem of limit analysis in conjunction with a strength reduction technique. Considering almost all geomaterials following a nonlinear failure criterion, a generalized tangential technique is used to calculate the external work and internal energy dissipation in the kinematically admissible velocity field. The upper bound solution of safety factor is obtained by optimization calculation. To evaluate the validity of the method proposed in this paper, the safety factor is compared with those calculated by limit equilibrium method. The comparison shows the solutions derived from these two methods match each other well, which shows the method proposed in this paper can be considered as effective.

This paper deals with the characteristic roots of different types of lattice matrices and proves that a matrix and its transpose have the same characteristic roots. Also this paper introduces the concept of similar lattice matrices and proves that similar lattice matrices have the same characteristic roots.

We investigate a class of memristor-based shunting inhibitory cellular neural networks with leakage delays. By applying a new Lyapunov function method, we prove that the neural network which has a unique almost periodic solution is globally exponentially stable. Moreover, the theoretical findings of this paper on the almost periodic solution are applied to prove the existence and stability of periodic solution for memristor-based shunting inhibitory cellular neural networks with leakage delays and periodic coefficients. An example is given to illustrate the effectiveness of the theoretical results. The results obtained in this paper are completely new and complement the previously known studies of Wu (2011) and Chen and Cao (2002).

For the shortcoming of fuzzyc-means algorithm (FCM) needing to know the number of clusters in advance, this paper proposed a new self-adaptive method to determine the optimal number of clusters. Firstly, a density-based algorithm was put forward. The algorithm, according to the characteristics of the dataset, automatically determined the possible maximum number of clusters instead of using the empirical rulenand obtained the optimal initial cluster centroids, improving the limitation of FCM that randomly selected cluster centroids lead the convergence result to the local minimum. Secondly, this paper, by introducing a penalty function, proposed a new fuzzy clustering validity index based on fuzzy compactness and separation, which ensured that when the number of clusters verged on that of objects in the dataset, the value of clustering validity index did not monotonically decrease and was close to zero, so that the optimal number of clusters lost robustness and decision function. Then, based on these studies, a self-adaptive FCM algorithm was put forward to estimate the optimal number of clusters by the iterative trial-and-error process. At last, experiments were done on the UCI, KDD Cup 1999, and synthetic datasets, which showed that the method not only effectively determined the optimal number of clusters, but also reduced the iteration of FCM with the stable clustering result.

This paper proposes an adaptive shape kernel-based mean shift tracker using a single static camera for the robot vision system. The question that we address in this paper is how to construct such a kernel shape that is adaptive to the object shape. We perform nonlinear manifold learning technique to obtain the low-dimensional shape space which is trained by training data with the same view as the tracking video. The proposed kernel searches the shape in the low-dimensional shape space obtained by nonlinear manifold learning technique and constructs the adaptive kernel shape in the high-dimensional shape space. It can improve mean shift tracker performance to track object position and object contour and avoid the background clutter. In the experimental part, we take the walking human as example to validate that our method is accurate and robust to track human position and describe human contour.

To study incremental machine learning in tensor space, this paper proposes incremental tensor discriminant analysis. The algorithm employs tensor representation to carry on discriminant analysis and combine incremental learning to alleviate the computational cost. This paper proves that the algorithm can be unified into the graph framework theoretically and analyzes the time and space complexity in detail. The experiments on facial image detection have shown that the algorithm not only achieves sound performance compared with other algorithms, but also reduces the computational issues apparently.

The objective of superresolution is to reconstruct a high-resolution image by using the information of a set of low-resolution images. Recently, the variational Bayesian superresolution approach has been widely used. However, these methods cannot preserve edges well while removing noises. For this reason, we propose a new image prior model and establish a Bayesian superresolution reconstruction algorithm. In the proposed prior model, the degree of interaction between pixels is adjusted adaptively by an adaptive norm, which is derived based on the local image features. Moreover, in this paper, a monotonically decreasing function is used to calculate and update the single parameter, which is used to control the severity of penalizing image gradients in the proposed prior model. Thus, the proposed prior model is adaptive to the local image features thoroughly. With the proposed prior model, the edge details are preserved and noises are reduced simultaneously. A variational Bayesian inference is employed in this paper, and the formulas for calculating all the variables including the HR image, motion parameters, and hyperparameters are derived. These variables are refined progressively in an iterative manner. Experimental results show that the proposed SR approach is very efficient when compared to existing approaches.

In this paper, we propose a sparseness constraint NMF method, named graph regularized matrix factorization with sparse coding (GRNMF_SC). By combining manifold learning and sparse coding techniques together, GRNMF_SC can efficiently extract the basic vectors from the data space, which preserves the intrinsic manifold structure and also the local features of original data. The target function of our method is easy to propose, while the solving procedures are really nontrivial; in the paper we gave the detailed derivation of solving the target function and also a strict proof of its convergence, which is a key contribution of the paper. Compared with sparseness constrained NMF and GNMF algorithms, GRNMF_SC can learn much sparser representation of the data and can also preserve the geometrical structure of the data, which endow it with powerful discriminating ability. Furthermore, the GRNMF_SC is generalized as supervised and unsupervised models to meet different demands. Experimental results demonstrate encouraging results of GRNMF_SC on image recognition and clustering when comparing with the other state-of-the-art NMF methods.

Combining maintenance tasks into work packages is not only necessary for arranging maintenance activities, but also critical for the reduction of maintenance cost. In order to optimize the combination of maintenance tasks by fuzzy C-means clustering algorithm, an improved fuzzy C-means clustering model is introduced in this paper. In order to reduce the dimension, variables representing clustering centers are eliminated in the improved cluster model. So the improved clustering model can be directly solved by the optimization method. To optimize the clustering model, a novel nonlinear simplex optimization method is also proposed in this paper. The novel method searches along all rays emitting from the center to each vertex, and those search directions are rightlyn+1positive basis. The algorithm has both theoretical convergence and good experimental effect. Taking the optimal combination of some maintenance tasks of a certain aircraft as an instance, the novel simplex optimization method and the clustering model both exhibit excellent performance.

The presence of outliers can result in seriously biased parameter estimates. In order to detect outliers in panel data models, this paper presents a modeling method to assess the intervention effects based on the variance of remainder disturbance using an arbitrary strictly positive twice continuously differentiable function. This paper also provides a Lagrange Multiplier (LM) approach to detect and identify a general type of outlier. Furthermore, fixed effects models and random effects models are discussed to identify outliers and the corresponding LM test statistics are given. The LM test statistics for an individual-based model to detect outliers are given as a particular case. Finally, this paper performs an application using panel data and explains the advantages of the proposed method.

This paper is concerned with the existence of stationary distribution and extinction for multispecies stochastic Lotka-Volterra predator-prey system. The contributions of this paper are as follows. (a) By using Lyapunov methods, the sufficient conditions on existence of stationary distribution and extinction are established. (b) By using the space decomposition technique and the continuity of probability, weaker conditions on extinction of the system are obtained. Finally, a numerical experiment is conducted to validate the theoretical findings.

In order to characterize the controllability of the aggregate demand response, that is, the aggregated consumer behaviors, the paper introduces the concept of controllability index which expresses the lowest occurrence probability in total electric consumption which can be changed by electric price. As the number of consumers is larger, it becomes difficult to directly analyze the controllability index. To resolve the difficulty of the large number of consumers, by using the central limit theorem, the paper approximates the controllability index and gives the solution maximizing the approximated controllability index.

This paper presents an application of the canonical duality theory for box constrained nonconvex and nonsmooth optimization problems. By use of the canonical dual transformation method, which is developed recently, these very difficult constrained optimization problems inRncan be converted into the canonical dual problems, which can be solved by deterministic methods. The global and local extrema can be identified by the triality theory. Some examples are listed to illustrate the applications of the theory presented in the paper.

This paper is devoted to solve the regulation problem on the basis of local regulators, which are combined using “new” membership functions. As a result, the exact tracking of references is achieved. The design of linear local regulators is suggested in this paper, but now adequate membership functions are computed in order to ensure the proper combination of the local regulators in the interpolation regions. These membership functions, which are given as mathematical expressions, solve the fuzzy regulation problem in a relative simple way. The form of the new membership functions is systematically derived for a class of Takagi-Sugeno (T-S) fuzzy systems. Some numerical examples are used to illustrate the viability of the proposed approach.

This paper presents an explicit fuzzy predictive control method for a class of nonlinear systems with constrained inputs. The main idea is to construct a terminal invariant set and explicit predictive controller with affine input on the basis of T-S fuzzy model. This method need not compute the complex nonconvex nonlinear programming problem of earlier nonlinear predictive control methods and decreases the number of optimization variables and guarantees stability of the closed-loop system. The simulation results on a numerical example show the validity of the method presented in this paper.

The aim of this paper is to describe and prove a new method to compute and control the basins of attraction in multistability scenarios and guarantee monostability condition. In particular, the basins of attraction are computed only using a submap, and the coexistence of periodic solutions is controlled through fixed-point inducting control technique, which has been successfully used until now to stabilize unstable periodic orbits. In this paper, however, fixed-point inducting control is used to modify the domains of attraction when there is coexistence of attractors. In order to apply the technique, the periodic orbit whose basin of attraction will be controlled must be computed. Therefore, the fixed-point inducting control is used to stabilize one of the periodic orbits and enhance its basin of attraction. Then, using information provided by the unstable periodic orbits and basins of attractions, the minimum control effort to stabilize the target periodic orbit in all desired ranges is computed. The applicability of the proposed tools is illustrated through two different coupled logistic maps.

Various classes of nonnegative waveforms containing dc component, fundamental andkthharmonick≥2, which proved to be of interest in waveform modelling for power amplifier (PA) design, are considered in this paper. In optimization of PA efficiency, nonnegative waveforms with maximal amplitude of fundamental harmonic and those with maximal coefficient of cosine term of fundamental harmonic (optimal waveforms) play an important role. Optimal waveforms have multiple global minima and this fact closely relates the problem of optimization of PA efficiency to the concept of conflict set. There is also keen interest in finding descriptions for various classes of suboptimal waveforms, such as nonnegative waveforms with at least one zero, nonnegative waveforms with maximal amplitude of fundamental harmonic for prescribed amplitude ofkthharmonic, nonnegative waveforms with maximal coefficient of cosine part of fundamental harmonic for prescribed coefficients ofkthharmonic, and nonnegative cosine waveforms with at least one zero. Closed form descriptions for all these suboptimal types of waveforms are provided in this paper. Suboptimal waveforms may also have multiple global minima and therefore be related to the concept of conflict set. Four case studies of usage of closed form descriptions of nonnegative waveforms in PA modelling are also provided.

In real application scenarios, the inherent impreciseness of sensor readings, the intentional perturbation of privacy-preserving transformations, and error-prone mining algorithms cause much uncertainty of time series data. The uncertainty brings serious challenges for the similarity measurement of time series. In this paper, we first propose a model of uncertain time series inspired by Chebyshev inequality. It estimates possible sample value range and central tendency range in terms of sample estimation interval and central tendency estimation interval, respectively, at each time slot. In comparison with traditional models adopting repeated measurements and random variable, Chebyshev model reduces overall computational cost and requires no prior knowledge. We convert Chebyshev uncertain time series into certain time series matrix; therefore noise reduction and dimensionality reduction are available for uncertain time series. Secondly, we propose a new similarity matching method based on Chebyshev model. It depends on overlaps between two sample estimation intervals and overlaps between central tendency estimation intervals from different uncertain time series. At the end of this paper, we conduct an extensive experiment and analyze the results by comparing with prior works.

This paper is focused on stochastic stability and strictly dissipative control design for a class of Takagi-Sugeno (TS) fuzzy neutral time delayed control systems with Markovian jumps. The main aim of this paper is to design a strictly dissipative controller such that the closed-loop TS fuzzy control system is stochastically stable, and also the disturbance rejection attenuation is obtained to a given level by means of theH∞performance index. Intensive analysis is carried out to obtain sufficient conditions for the existence of desired dissipative controller which ensures both the stochastic stability and the strictly dissipative performance. The main advantage of the proposed technique is that it is possible to obtain the dissipative controller with less control effort and also, as special cases, robustH∞control with the prescribedH∞performance under given constraints and passivity control can be obtained for the considered systems. Also, the existence condition of the fuzzy dissipative controller can be obtained in terms of linear matrix inequalities. Finally, a practical example based on truck-trailer model is provided to demonstrate the effectiveness and feasibility of the proposed design technique.

To support system-wide synchronization accuracy and precision in the sub-microsecond range without using GPS technique, the precise time protocol (PTP) standard IEEE-1588 v2 is chosen. Recently, a new clock skew estimation technique was proposed for the slave based on a dual slave clock method that assumes that the packet delay variation (PDV) in the Ethernet network is a constant delay. However, papers dealing with the Ethernet network have shown that this PDV is a long range dependency (LRD) process which may be modeled as a fractional Gaussian noise (fGn) with Hurst exponent (H) in the range of0.5

This paper addresses the exponential synchronization problem of a class of master-slave distributed parameter systems (DPSs) with spatially variable coefficients and spatiotemporally variable nonlinear perturbation, modeled by a couple of semilinear parabolic partial differential equations (PDEs). With a locally Lipschitz constraint, the perturbation is a continuous function of time, space, and system state. Firstly, a sufficient condition for the robust exponential synchronization of the unforced semilinear master-slave PDE systems is investigated for all admissible nonlinear perturbations. Secondly, a robust distributed proportional-spatial derivative (P-sD) state feedback controller is desired such that the closed-loop master-slave PDE systems achieve exponential synchronization. Using Lyapunov’s direct method and the technique of integration by parts, the main results of this paper are presented in terms of spatial differential linear matrix inequalities (SDLMIs). Finally, two numerical examples are provided to show the effectiveness of the proposed methods applied to the robust exponential synchronization problem of master-slave PDE systems with nonlinear perturbation.

This paper presents a new method to give an analytical solution in Laplace domain directly that is used to describe pressure transient behavior of partially penetrating hydraulic fractures in a box-shaped reservoir with closed boundaries. The basic building block of the method is to solve diffusivity equation with the integration of Dirac function over the distance that is presented for the first time. Different from the traditional method of using the source solution and Green’s function presented by Gringarten and Ramey, this paper uses Laplace transform and Fourier transform to solve the diffusivity equation and the analytical solution obtained is accurate and simple. The effects of parameters including fracture height, fracture length, the position of the fracture, and reservoir width on the pressure and pressure derivative are fully investigated. The advantage of the analytical solution is easy to incorporate storage coefficient and skin factor. It can also reduce the amount of computation and compute efficiently and quickly.

The problems of improving computational efficiency and extending representational capability are the two hottest topics in approaches of global manifold learning. In this paper, a new method called extensive landmark Isomap (EL-Isomap) is presented, addressing both topics simultaneously. On one hand, originated from landmark Isomap (L-Isomap), which is known for its high computational efficiency property, EL-Isomap also possesses high computational efficiency through utilizing a small set of landmarks to embed all data points. On the other hand, EL-Isomap significantly extends the representational capability of L-Isomap and other global manifold learning approaches by utilizing only an available subset from the whole landmark set instead of all to embed each point. Particularly, compared with other manifold learning approaches, the data manifolds with intrinsic low-dimensional concave topologies and essential loops can be unwrapped by the new method more successfully, which are shown by simulation results on a series of synthetic and real-world data sets. Moreover, the accuracy, robustness, and computational complexity of EL-Isomap are analyzed in this paper, and the relation between EL-Isomap and L-Isomap is also discussed theoretically.

Single image superresolution (SISR) requires only one low-resolution (LR) image as its input which thus strongly motivates researchers to improve the technology. The property that small image patches tend to recur themselves across different scales is very important and widely used in image processing and computer vision community. In this paper, we develop a new approach for solving the problem of SISR by generalizing this property. The main idea of our approach takes advantage of a generic prior that assumes that a randomly selected patch in the underlying high-resolution (HR) image should visually resemble as much as possible with some patch extracted from the input low-resolution (LR) image. Observing the proposed prior, our approach deploys a cost function and applies an iterative scheme to estimate the optimal HR image. For solving the cost function, we introduce Gaussian mixture model (GMM) to train on a sampled data set for approximating the joint probability density function (PDF) of input image with different scales. Through extensive comparative experiments, this paper demonstrates that the visual fidelity of our proposed method is often superior to those generated by other state-of-the-art algorithms as determined through both perceptual judgment and quantitative measures.

Moving targets detection and tracking is an important and basic issue in the field of intelligent video surveillance. The classical Codebook algorithm is simplified in this paper by introducing the average intensity into the Codebook model instead of the original minimal and maximal intensities. And a hierarchical matching method between the current pixel and codeword is also proposed according to the average intensity in the high and low intensity areas, respectively. Based on the simplified Codebook algorithm, this paper then proposes a robust object tracking algorithm called Simplified Codebook Masked Camshift algorithm (SCMC algorithm), which combines the simplified Codebook algorithm and Camshift algorithm together. It is designed to overcome the sensitiveness of traditional Camshift algorithm to background color interference. It uses simplified Codebook to detect moving objects, whose result is employed to mask color probability distribution image, based on which we then use Camshift to predict the centroid and size of these objects. Experiment results show that the proposed simplified Codebook algorithm simultaneously improves the detection accuracy and computational efficiency. And they also show that the SCMC algorithm can significantly reduce the possibility of false convergence and result in a higher correct tracking rate, as compared with the traditional Camshift algorithm.

This paper investigated delay-dependent robust stability criteria for systems with interval time-varying delays and nonlinear perturbations. A delay-partitioning approach is used in this paper, the delay-interval is partitioned into multiple equidistant subintervals, a new Lyapunov-Krasovskii (L-K) functional contains some triple-integral terms, and augment terms are introduced on these intervals. Then, by using integral inequalities method together with free-weighting matrix approach, a new less conservative delay-dependent stability criterion is formulated in terms of linear matrix inequalities (LMIs), which can be easily solved by optimization algorithms. Numerical examples are given to show the effectiveness and the benefits of the proposed method.

The purpose of this paper is to establish some strong convergence theorems for a common fixed point of two total quasi-ϕ-asymptotically nonexpansive mappings in Banach space by means of the hybrid method in mathematical programming. The results presented in this paper extend and improve on the corresponding ones announced by Martinez-Yanes and Xu (2006), Plubtieng and Ungchittrakool (2007), Qin et al. (2009), and many others.

This paper is concerned with a new filtering problem in networked control systems (NCSs) subject to limited communication capacity, which includes measurement quantization, random transmission delay, and packets loss. The measurements are first quantized via a logarithmic quantizer and then transmitted through a digital communication network with random delay and packet loss. The three communication constraints phenomena which can be seen as a class of uncertainties are formulated by a stochastic parameter uncertainty system. The purpose of the paper is to design a linear filter such that, for all the communication constraints, the error state of the filtering process is mean square bounded and the steady-state variance of the estimation error for each state is not more than the individual prescribed upper bound. It is shown that the desired filtering can effectively be solved if there are positive definite solutions to a couple of algebraic Riccati-like inequalities or linear matrix inequalities. Finally, an illustrative numerical example is presented to demonstrate the effectiveness and flexibility of the proposed design approach.

Hesitant fuzzy set has been an important tool in dealing with multiple attribute decision making (MADM) problems, especially for the decision making situation when only some values of membership are possible for an alternative on attributes. However, determining attributes weights in hesitant fuzzy MADM is still an open problem. In this paper, we propose an objective weighting approach based on Shannon information entropy, which expresses the relative intensities of attribute importance to signify the average intrinsic information transmitted to the decision maker. Furthermore, we construct a hesitant fuzzy MADM approach based on the TOPSIS method and a weighted correlation coefficient proposed in this paper. Finally, we utilize a supplier selection example to validate the objective attributes weights determining method and the proposed hesitant fuzzy MADM approach.

This paper addresses a novel and efficient algorithm for solving optimization problem in image processing applications. Image enhancement (IE) is one of the complex optimization problems in image processing. The main goal of this paper is to enhance color images such that the eminence of the image is more suitable than the original image from the perceptual viewpoint of human. Traditional methods require prior knowledge of the image to be enhanced, whereas the aim of the proposed biogeography based optimization (BBO) enhanced with blended migration operator (BMO) algorithm is to maximize the objective function in order to enhance the image contrast by maximizing the parameters like edge intensity, edge information, and entropy. Experimental results are compared with the current state-of-the-art approaches and indicate the superiority of the proposed technique in terms of subjective and objective evaluation.

Game theory is considered as an efficient framework in dealing with decision making problems for two players in the competitive environment. In general, the evaluation values of payoffs matrix are expressed by crisp values in a game model. However, many uncertainties and vagueness should be considered due to the qualitative criteria and the subjective judgment of decision makers in the decision making process. The aim of this study is to develop an effective methodology for solving the payoffs matrix with linguistic variables by multiple decision makers in a game model. Based on the linguistic variables, the decision makers can easily express their opinions with respect to criteria for each alternative. By using the linear programming method, we can find the optimal solution of a game matrix in accordance with the combination of strategies of each player effectively. In addition, the expected performance value (EPV) index is defined in this paper to compare the competition ability of each player based on the optimal probability of each strategy combination. And then, numerical example will be implemented to illustrate the computation process of the proposed model. The conclusion and future research are discussed at the end of this paper.

We consider the data fitting problem, that is, the problem of approximating a function of several variables, given by tabulated data, and the corresponding problem for inconsistent (overdetermined) systems of linear algebraic equations. Such problems, connected with measurement of physical quantities, arise, for example, in physics, engineering, and so forth. A traditional approach for solving these two problems is the discrete least squares data fitting method, which is based on discretel2-norm. In this paper, an alternative approach is proposed: with each of these problems, we associate a nondifferentiable (nonsmooth) unconstrained minimization problem with an objective function, based on discretel1- and/orl∞-norm, respectively; that is, these two norms are used as proximity criteria. In other words, the problems under consideration are solved by minimizing the residual using these two norms. Respective subgradients are calculated, and a subgradient method is used for solving these two problems. The emphasis is on implementation of the proposed approach. Some computational results, obtained by an appropriate iterative method, are given at the end of the paper. These results are compared with the results, obtained by the iterative gradient method for the corresponding “differentiable” discrete least squares problems, that is, approximation problems based on discretel2-norm.

To overcome the shortcomings of traditional dimensionality reduction algorithms, incremental tensor principal component analysis (ITPCA) based on updated-SVD technique algorithm is proposed in this paper. This paper proves the relationship between PCA, 2DPCA, MPCA, and the graph embedding framework theoretically and derives the incremental learning procedure to add single sample and multiple samples in detail. The experiments on handwritten digit recognition have demonstrated that ITPCA has achieved better recognition performance than that of vector-based principal component analysis (PCA), incremental principal component analysis (IPCA), and multilinear principal component analysis (MPCA) algorithms. At the same time, ITPCA also has lower time and space complexity.

The paper by Liu (2010) introduces a method termed the canonical least-squares Monte Carlo (CLM) which combines a martingale-constrained entropy model and a least-squares Monte Carlo algorithm to price American options. In this paper, we first provide the convergence results of CLM and numerically examine the convergence properties. Then, the comparative analysis is empirically conducted using a large sample of the S&P 100 Index (OEX) puts and IBM puts. The results on the convergence show that choosing the shifted Legendre polynomials with four regressors is more appropriate considering the pricing accuracy and the computational cost. With this choice, CLM method is empirically demonstrated to be superior to the benchmark methods of binominal tree and finite difference with historical volatilities.

Biogeography-based optimization (BBO) is an evolutionary algorithm inspired by biogeography, which is the study of the migration of species between habitats. A finite Markov chain model of BBO for binary problems was derived in earlier work, and some significant theoretical results were obtained. This paper analyzes the convergence properties of BBO on binary problems based on the previously derived BBO Markov chain model. Analysis reveals that BBO with only migration and mutation never converges to the global optimum. However, BBO with elitism, which maintains the best candidate in the population from one generation to the next, converges to the global optimum. In spite of previously published differences between genetic algorithms (GAs) and BBO, this paper shows that the convergence properties of BBO are similar to those of the canonical GA. In addition, the convergence rate estimate of BBO with elitism is obtained in this paper and is confirmed by simulations for some simple representative problems.

Logistic-based sample assumption is proposed in this paper, with a research on different random distributions through this system. It provides an assumption system of logistic-based sample, including its sample space structure. Moreover, the influence of different random distributions for inputs has been studied through this logistic-based sample assumption system. In this paper, three different random distributions (normal distribution, uniform distribution, and beta distribution) are used for test. The experimental simulations illustrate the relationship between inputs and outputs under different random distributions. Thereafter, numerical analysis infers that the distribution of outputs depends on that of inputs to some extent, and this assumption system is not independent increment process, but it is quasistationary.

Infrared images are fuzzy and noisy by nature; thus the segmentation of human targets in infrared images is a challenging task. In this paper, a fast thresholding method of infrared human images based on two-dimensional fuzzy Tsallis entropy is introduced. First, to address the fuzziness of infrared image, the fuzzy Tsallis entropy of objects and that of background are defined, respectively, according to probability partition principle. Next, this newly defined entropy is extended to two dimensions to make good use of spatial information to deal with the noise in infrared images, and correspondingly a fast computation method of two-dimensional fuzzy Tsallis entropy is put forward to reduce its computation complexity fromO(L2)toO(L). Finally, the optimal parameters of fuzzy membership function are searched by shuffled frog-leaping algorithm following maximum entropy principle, and then the best threshold of an infrared human image is computed from the optimal parameters. Compared with typical entropy-based thresholding methods by experiments, the method presented in this paper is proved to be more efficient and robust.

This paper presents the nonlinear free vibration analysis of axisymmetric polar orthotropic circular membrane, based on the large deflection theory of membrane and the principle of virtual displacement. We have derived the governing equations of nonlinear free vibration of circular membrane and solved them by the Galerkin method and the Bessel function to obtain the generally exact formula of nonlinear vibration frequency of circular membrane with outer edges fixed. The formula could be degraded into the solution from small deflection vibration; thus, its correctness has been verified. Finally, the paper gives the computational examples and comparative analysis with the other solution. The frequency is enlarged with the increase of the initial displacement, and the larger the initial displacement is, the larger the effect on the frequency is, and vice versa. When the initial displacement approaches zero, the result is consistent with that obtained on the basis of the small deflection theory. Results obtained from this paper provide the accurate theory for the measurement of the pretension of polar orthotropic composite materials by frequency method and some theoretical basis for the research of the dynamic response of membrane structure.

In this paper, we analyze the dissipativity for descriptor systems with impulsive behavior based on image space analysis. First, a new image space is used to characterize state responses for descriptor systems. Based on such characterization and an integral property of delta function, a new necessary and sufficient condition for the dissipativity of descriptor systems is derived using the linear matrix inequality (LMI) approach. Also, some of the earlier related results on dissipativity for linear systems are investigated in the framework proposed in this paper. Finally, two examples are given to show the validity of the derived results.

This paper deals with moment matching of matrix exponential (ME) distributions used to approximate general probability density functions (pdf). A simple and elegant approach to this problem is applying Padé approximation to the moment generating function of the ME distribution. This approach may, however, fail if the resulting ME function is not a proper probability density function; that is, it assumes negative values. As there is no known, numerically stable method to check the nonnegativity of general ME functions, the applicability of Padé approximation is limited to low-order ME distributions or special cases. In this paper, we show that the Padé approximation can be extended to capture the behavior of the original pdf around zero and this can help to avoid representations with negative values and to have a better approximation of the shape of the original pdf. We show that there exist cases when this extension leads to ME function whose nonnegativity can be verified, while the classical approach results in improper pdf. We apply the ME distributions resulting from the proposed approach in stochastic models and show that they can yield more accurate results.

This paper presents another new modified Lorenz system which is chaotic in a certain range of parameters. Besides that, this paper also presents explanations to solve the new modified Lorenz system. Furthermore, some of the dynamical properties of the system are shown and stated. Basically, this paper shows the finding that led to the discovery of fixed points for the system, dynamical analysis using complementary-cluster energy-barrier criterion (CCEBC), finding the Jacobian matrix, finding eigenvalues for stability, finding the Lyapunov functions, and finding the Lyapunov exponents to investigate some of the dynamical behaviours of the system. Pictures and diagrams will be shown for the chaotic systems using the aide of MAPLE in 2D and 3D views. Nevertheless, this paper is to introduce the new modified Lorenz system.

This paper discusses mathematical results for a variational formulation dedicated to heat transfer with phase changes. Practical finite element experiences show that the studied formulation can lead to difficulties for the numerical resolution at each time step. The aim of the paper is to show that such numerical pathologies do not come from the basic variational formulation by showing existence and uniqueness of the solution.

This paper considers a multiuser transmit beamforming problem under uncertain channel state information (CSI) subject to SINR constraints in a downlink multiuser MISO system. A robust transmit beamforming formulation is proposed. This robust formulation is to minimize the transmission power subject to worst-case signal-to-interference-plus-noise ratio (SINR) constraints on the receivers. The challenging problem is that the worst-case SINR constraints correspond to an infinite number of nonconvex quadratic constraints. In this paper, a natural semidifinite programming (SDP) relaxation problem is proposed to solve the robust beamforming problem. The main contribution of this paper is to establish the tightness of the SDP relaxation problem under proper assumption, which means that the SDP relaxation problem definitely yields rank-one solutions under the assumption. Then the SDP relaxation problem provides globally optimum solutions of the primal robust transmit beamforming problem under proper assumption and norm-constrained CSI errors. Simulation results show the correctness of the proposed theoretical results and also provide a counterexample whose solutions are not rank one. The existence of counterexample shows that the guess that the solutions of the SDP relaxation problem must be rank one is wrong, except that some assumptions (such as the one proposed in this paper) hold.

This paper investigates behaviors of flows driven by tangential velocity and shear stress on their boundaries such as solid walls and water surfaces. In a steady flow between two parallel plates with one of them in motion, analytic solutions are the same when a velocity and a shear stress boundary condition are applied on the moving plate. For an unsteady, impulsively started flow, however, analysis shows that solutions for velocity profiles as well as energy transferring and dissipation are different under the two boundary conditions. In an air-water flow, if either a velocity or a stress condition is imposed at the air-water interface, the problem becomes ill-posed because it has multiple solutions. Only when both of the conditions are specified, it will have a unique solution. Numerical simulations for cavity flows are made to confirm the theoretical results; a tangential velocity and a shear stress boundary condition introduce distinct flows if one considers an unsteady flow, whereas the two conditions lead to a same solution if one simulates a steady flow. The results in this paper imply that discretion is needed on selection of boundary conditions to approximate forcing on fluid boundaries such as wind effects on surfaces of coastal ocean waters.