In this paper, the authors propose a computational procedure by using fuzzy approach to fred the optimal solution of quadratic programming problems. The authors divide the calculation of the optimal solution into two ...In this paper, the authors propose a computational procedure by using fuzzy approach to fred the optimal solution of quadratic programming problems. The authors divide the calculation of the optimal solution into two stages. In the first stage the authors determine the unconstrained minimization and check its feasibility. The second stage, the authors explore the feasible region from initial point to another point until the authors get the optimal point by using Lagrange multiplier. A numerical example is included to support as illustration of the paper.展开更多
This paper discusses a distributed design for clustering based on the K-means algorithm in a switching multi-agent network, for the case when data are decentralized stored and unavailable to all agents. The authors pr...This paper discusses a distributed design for clustering based on the K-means algorithm in a switching multi-agent network, for the case when data are decentralized stored and unavailable to all agents. The authors propose a consensus-based algorithm in distributed case, that is, the double- clock consensus-based K-means algorithm (DCKA). With mild connectivity conditions, the authors show convergence of DCKA to guarantee a distributed solution to the clustering problem, even though the network topology is time-varying. Moreover, the authors provide experimental results on vari- ous clustering datasets to illustrate the effectiveness of the fully distributed algorithm DCKA, whose performance may be better than that of the centralized K-means algorithm.展开更多
In this paper, the authors consider an on-line scheduling problem of rn (m≥ 3) identical machines with common maintenance time interval and nonresumable availability. For the case that the length of maintenance tim...In this paper, the authors consider an on-line scheduling problem of rn (m≥ 3) identical machines with common maintenance time interval and nonresumable availability. For the case that the length of maintenance time interval is larger than the largest processing time of jobs, the authors prove that any on-line algorithm has not a constant competitive ratio. For the case that the length of maintenance time interval is less than or equal to the largest processing time of jobs, the authors prove a lower bound of 3 on the competitive ratio. The authors give an on-line algorithm with competitive 1 ratio 4 - 1/m. In particular, for the case of m = 3, the authors prove the competitive ratio of the on-line algorithm is 10/3.展开更多
This paper provides a first indication that this is true for a system comprised of a static structure described by hyperbolic partial differential equations and is subjected to an external random input force. The syst...This paper provides a first indication that this is true for a system comprised of a static structure described by hyperbolic partial differential equations and is subjected to an external random input force. The system deforms the randomness of an input force sequence in proportion to its algorithmic complexity. The authors demonstrate this by numerical analysis of a one-dimensional vibrating elastic solid (the system) on which we apply a maximally-random force sequence (input). The level of complexity of the system is controlled via external parameters. The output response is the field of displacements observed at several positions on the body. The algorithmic complexity and stochasticity of the resulting output displacement sequence is measured and compared against the complexity of the system. The results show that the higher the system complexity, the more random-deficient the output sequence.展开更多
文摘In this paper, the authors propose a computational procedure by using fuzzy approach to fred the optimal solution of quadratic programming problems. The authors divide the calculation of the optimal solution into two stages. In the first stage the authors determine the unconstrained minimization and check its feasibility. The second stage, the authors explore the feasible region from initial point to another point until the authors get the optimal point by using Lagrange multiplier. A numerical example is included to support as illustration of the paper.
基金supported by the National Key Research and Development Program of China under Grant No.2016YFB0901902the National Natural Science Foundation of China under Grant Nos.61573344,61333001,61733018,and 61374168
文摘This paper discusses a distributed design for clustering based on the K-means algorithm in a switching multi-agent network, for the case when data are decentralized stored and unavailable to all agents. The authors propose a consensus-based algorithm in distributed case, that is, the double- clock consensus-based K-means algorithm (DCKA). With mild connectivity conditions, the authors show convergence of DCKA to guarantee a distributed solution to the clustering problem, even though the network topology is time-varying. Moreover, the authors provide experimental results on vari- ous clustering datasets to illustrate the effectiveness of the fully distributed algorithm DCKA, whose performance may be better than that of the centralized K-means algorithm.
基金supported by the National Natural Science Foundation of China under Grant Nos.11271338,11171313,61070229,10901144,11001117supported by the Ph.D.Programs Foundation of Ministry ofEducation of China under Grant No.20111401110005the Henan Province Natural Science Foundation under Grant No.112300410047
文摘In this paper, the authors consider an on-line scheduling problem of rn (m≥ 3) identical machines with common maintenance time interval and nonresumable availability. For the case that the length of maintenance time interval is larger than the largest processing time of jobs, the authors prove that any on-line algorithm has not a constant competitive ratio. For the case that the length of maintenance time interval is less than or equal to the largest processing time of jobs, the authors prove a lower bound of 3 on the competitive ratio. The authors give an on-line algorithm with competitive 1 ratio 4 - 1/m. In particular, for the case of m = 3, the authors prove the competitive ratio of the on-line algorithm is 10/3.
文摘This paper provides a first indication that this is true for a system comprised of a static structure described by hyperbolic partial differential equations and is subjected to an external random input force. The system deforms the randomness of an input force sequence in proportion to its algorithmic complexity. The authors demonstrate this by numerical analysis of a one-dimensional vibrating elastic solid (the system) on which we apply a maximally-random force sequence (input). The level of complexity of the system is controlled via external parameters. The output response is the field of displacements observed at several positions on the body. The algorithmic complexity and stochasticity of the resulting output displacement sequence is measured and compared against the complexity of the system. The results show that the higher the system complexity, the more random-deficient the output sequence.