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

2003年, 第16卷, 第4期 刊出日期:2003-10-15
  

  • 全选
    |
    论文
  • Wei HUANG;Yoshiteru Nakamori;Shou Yang WANG;Le An YU
    Journal of Systems Science and Complexity. 2003, 16(4): 415-423.
    摘要 ( ) PDF全文 ( )   可视化   收藏
    Support Vector Machine (SVM) is a very specific type of learning algorithms characterized by the capacity control of the decision function, the use of the kernel func-tions and the sparsity of the solution. In this paper, we investigate the predictability of financial movement direction with SVM by forecasting the weekly movement direction of NIKKEI 225 index. To evaluate the forecasting ability of SVM, we compare the perfor-mance with those of Linear1 Discriminant Analysis, Quadratic Discriminant Analysis and Elman Backpropagation Neural Networks. The experiment results show that SVM out-performs other classification methods. Furthermore, we propose a combining model by integrating SVM with other classification methods. The combining model performs the best among the forecasting methods.
  • Kun Hui LIU;Ming Da QIN;Chuan Lai LU
    Journal of Systems Science and Complexity. 2003, 16(4): 424-437.
    摘要 ( ) PDF全文 ( )   可视化   收藏
    We study a class of discounted models of singular stochastic control. In this kind of models, not only the structure of cost function has been extended to some general type, but also the state can be represented as the solution of a class of stochastic differential equations with nonlinear drift and diffusion term. By the various methods of stochastic analysis, we derive the sufficient and necessary conditions of the existence of optimal control.
  • San Guo ZHANG;Xi Ru CHEN
    Journal of Systems Science and Complexity. 2003, 16(4): 438-445.
    摘要 ( ) PDF全文 ( )   可视化   收藏
    This paper studies the parameter estimation of multiple dimensional linear errors-in-variables (EV) models in the case where replicated observations are available in some experimental points. Asymptotic normality is established under mild conditions, and the parameters entering the asymptotic variance are consistently estimated to render the result useable in the construction of large-sample confidence regions.
  • Xiang Dong WANG;Hai Wu RONG;Xi Ting LIANG
    Journal of Systems Science and Complexity. 2003, 16(4): 446-452.
    摘要 ( ) PDF全文 ( )   可视化   收藏
    In this paper we first give an a priori estimate of maximum modulus of solutionsfor a class of systems of diagonally degenerate elliptic equations in the case of p>2.
  • Tong ZHANG;Xi Bin ZHANG;Shi Ying ZHANG
    Journal of Systems Science and Complexity. 2003, 16(4): 453-465.
    摘要 ( ) PDF全文 ( )   可视化   收藏
    One remarkable feature of wavelet decomposition is that the wavelet coefficients are localized, and any singularity in the input signals can only affect the wavelet coefficients at the point near the singularity. The localized property of the wavelet coefficients allows us to identify the singularities in the input signals by studying the wavelet coefficients at different resolution levels. This paper considers wavelet-based approaches for the detection of outliers in time series. Outliers are high-frequency phenomena which are associated with the wavelet coefficients with large absolute values at different resolution levels. On the basis of the first-level wavelet coefficients, this paper presents a diagnostic to identify outliers in a time series. Under the null hypothesis that there is no outlier, the proposed diagnostic is distributed as a χ_1~2 Empirical examples are presented to demonstrate the application of the proposed diagnostic.
  • Li Chun ZHAO;Qing Ling ZHANG;Qi Chang YANG
    Journal of Systems Science and Complexity. 2003, 16(4): 466-474.
    摘要 ( ) PDF全文 ( )   可视化   收藏
    In this paper the management model a two-species fishery involving impulses is investigated by using optimal impulsive control theorem. Optimal impulsive harvesting times and the corresponding optimal harvesting population levels in different cases are obtained.
  • Guo Fei ZHOU;Ke Min ZHANG
    Journal of Systems Science and Complexity. 2003, 16(4): 475-482.
    摘要 ( ) PDF全文 ( )   可视化   收藏
    In this paper, we generate all nonisomorphic tournaments of order at most nine, all nonisomorphic almost regular tournaments of order 10 and all nonisomorphic regular tournaments of order 11. For each of these tournaments, we have given its score-list, connectivity, diameter, the minimal number of feedbacks, automorphisms and spectra. Moreover, we have verified the well-known Kelly's Conjecture for n = 2k + 1 < 11. And we also determine the n-universal tournaments for n < 6. However, several related results are given and some related open problems are raised.
  • Geni Gupur
    Journal of Systems Science and Complexity. 2003, 16(4): 483-493.
    摘要 ( ) PDF全文 ( )   可视化   收藏
    By using the strong continuous semigroup theory of linear operators we provethe existence of a unique positive time-dependent solution of the model describing a re-pairable, standby, human & machine system.
  • Ju Liang ZHANG;Xiang Sun ZHANG;Xin Jian ZHUO
    Journal of Systems Science and Complexity. 2003, 16(4): 494-505.
    摘要 ( ) PDF全文 ( )   可视化   收藏
    In this paper, a trust region method for equality constrained optimization . based on nondifferentiable exact penalty is proposed. In this algorithm, the trail step is characterized by computation of its normal component being separated from compu-tation of its tangential component, i.e., only the tangential component of the trail step is constrained by trust radius while the normal component and trail step itself have no constraints. The other main characteristic of the algorithm is the decision of trust region radius. Here, the decision of trust region radius uses the information of the gradient of objective function and reduced Hessian. However, Maratos effect will occur when we use the nondifferentiable exact penalty function as the merit function. In order to obtain the superlinear convergence of the algorithm, we use the twice order correction technique. Be-cause of the speciality of the adaptive trust region method, we use twice order correction when p = 0 (the definition is as in Section 2) and this is different from the traditional trust region methods for equality constrained optimization. So the computation of the algorithm in this paper is reduced. What is more, we can prove that the algorithm is globally and superlinearly convergent.
  • De Quan YUW;Hua Chen ZHANG;Feng Sheng TU
    Journal of Systems Science and Complexity. 2003, 16(4): 506-512.
    摘要 ( ) PDF全文 ( )   可视化   收藏
    In this paper we consider a Markov chain model in an ATM network, which lias been studied by Dag and Stavrakakis. On the basis of the iterative formulas obtained by Dag and Stavrakakis, we obtain the explicit analytical expression of the transition probability matrix. It is very simple to calculate the transition probabilities of the Markov chain by these expressions. In addition, we obtain some results about the structure of the transition probability matrix, which are helpful in numerical calculation and theoretical analysis.
  • Qi Ya HU;Guo Ping LIANG;Jin Zhao LIU
    Journal of Systems Science and Complexity. 2003, 16(4): 513-526.
    摘要 ( ) PDF全文 ( )   可视化   收藏
    In this paper we consider domain decomposition, methods for three-dimensional elliptic: problems with Lagrange multipliers, and construct a kind of simple preconditioner for the corresponding interface equation. It will be shown that condition number of the resulting preconditioned interface matrix is almost optimal.
  • Zhi Quan HU
    Journal of Systems Science and Complexity. 2003, 16(4): 527-532.
    摘要 ( ) PDF全文 ( )   可视化   收藏
    Let G be a hamiltonian, bipartite graph on 2n vertices, where n>3. It isshown that if e(G)>n(n-1)/2 + 2 then G contains cycles of every possible even length.This improves a result of Entringer and Schmeichel.
  • Yi Jun ZHU
    Journal of Systems Science and Complexity. 2003, 16(4): 533-540.
    摘要 ( ) PDF全文 ( )   可视化   收藏
    On the basic of a type of practical examples we set up a new queueing model with negative customers. By the use of "Supplemental Variables method" and "State transfer analysis", we get the generating function with negative powers of queue length and the waiting time expressions.
  • Jiu Ping XU;Ji Cheng LIU
    Journal of Systems Science and Complexity. 2003, 16(4): 541-549.
    摘要 ( ) PDF全文 ( )   可视化   收藏
    In order to describe the interrelation forces among different regions during the economic growth, this paper introduces and analyzes the dynamical system model with the theory of differential systems dynamics. A practical example based on a simplified model is given to analyze the dynamical process of Sichuan economy growth.
  • Xiao Yi ZHANG
    Journal of Systems Science and Complexity. 2003, 16(4): 550-556.
    摘要 ( ) PDF全文 ( )   可视化   收藏
    In this paper, we prove the global existence and uniqueness of non-negativeclassical solutions of the Smoluchowski equation with viscosity ε>0. The existence ofweak solutions when ε=0 is also obtained.
  • Zhao Jun YANG;Li Hong HUANG
    Journal of Systems Science and Complexity. 2003, 16(4): 557-561.
    摘要 ( ) PDF全文 ( )   可视化   收藏
    On the basis of a result in Yor (1992), this paper gives explicit expressions forthe valuation and hedging of the arithmetic Asian option.
  • Ohn Mar San;Van-Nam Huynh;Yoshiteru Nakamori
    Journal of Systems Science and Complexity. 2003, 16(4): 562-571.
    摘要 ( ) PDF全文 ( )   可视化   收藏
    Most of the earlier work on clustering mainly focused on numeric data whose inherent geometric properties can be exploited to naturally define distance functions be-tween data points. However, data mining applications frequently involve many datasets that also consists of mixed numeric and categorical attributes. In this paper we present a clustering algorithm which is based on the fc-means algorithm. The algorithm clusters objects with numeric and categorical attributes in a way similar to Avmeans. The object similarity measure is derived from both numeric and categorical attributes. When applied to numeric data, the algorithm is identical to the &-means. The main result of this paper is to provide a method to update the "cluster centers" of clustering objects described by mixed numeric and categorical attributes in the clustering process to minimize the cluster-ing cost function. The clustering performance of the algorithm is demonstrated with the two well known daLa sets, namely credit approval and abalone databases.