In this paper we continue previous studies on the computational efficiency of spiking neural P systems, under the assumption that some pre-computed resources of exponential size are given in advance. Specifically, we ...
详细信息
In this paper we continue previous studies on the computational efficiency of spiking neural P systems, under the assumption that some pre-computed resources of exponential size are given in advance. Specifically, we give a deterministic solution for each of two well known PSPACE-complete problems: QSAT and Q3SAT. In the case of QSAT, the answer to any instance of the problem is computed in a time which is linear with respect to both the number n of Boolean variables and the number in of clauses that compose the instance. As for Q3SAT, the answer is computed in a time which is at most cubic in the number n of Boolean variables. (C) 2010 Elsevier B.V. All rights reserved.
Randí et al. proposed a significant graphical representation for DNA sequences, which is very compact and avoids loss of information. In this paper, we build a fast algorithm for this graphical representation wit...
详细信息
The maximum clique problem has diverse applications in the field of pattern recognition, computer vision, information processing etc. The connection between self-assembly and computation has implied that the tile asse...
详细信息
Membrane systems, also called P systems, are biologically inspired theoretical models of distributed and parallel computing. Tissue P system with cell separation is a computing model in the frame work of membrane comp...
详细信息
Randí;et al. proposed a famous spectral graphical representation of DNA sequences, and claimed that it avoids loss of information. In this paper we build two mathematical models for this graphical representation ...
详细信息
Mating a pair of electric connectors is one of the most important steps in a robotic wiring harness assembly system, which can be modeled by static piecewise affine (PWA) systems. To design a fault detection system fo...
详细信息
Mating a pair of electric connectors is one of the most important steps in a robotic wiring harness assembly system, which can be modeled by static piecewise affine (PWA) systems. To design a fault detection system for this application, a set-membership approach for static PWA systems is proposed, in which parallelotopic approximation of feasible parameter sets is adopted. An online algorithm is obtained to estimate bounds of uncertain transition points of the PWA model. Based on the estimation, a robust online fault detection algorithm is proposed. The robustness and sensitivity of the algorithm are analyzed. The effectiveness of these methods is finally confirmed through experiments.
There has been increasing interest in a type of underactuated mechanical systems, mobile-wheeled inverted-pendulum (MWIP) models, which are widely used in the field of autonomous robotics and intelligent vehicles. Rob...
详细信息
There has been increasing interest in a type of underactuated mechanical systems, mobile-wheeled inverted-pendulum (MWIP) models, which are widely used in the field of autonomous robotics and intelligent vehicles. Robust-velocity-tracking problem of the MWIP systems is investigated in this study. In the velocity-control problem, model uncertainties accompany uncertain equilibriums, which make the controller design become more difficult. Two sliding-mode-control (SMC) methods are proposed for the systems, both of which are capable of handling both parameter uncertainties and external disturbances. The asymptotical stabilities of the corresponding closed-loop systems are achieved through the selection of sliding-surface parameters, which are based on some rules. There is still a steady tracking error when the first SMC controller is used. By assuming a novel sliding surface, the second SMC controller is designed to solve this problem. The effectiveness of the proposed methods is finally confirmed by the numerical simulations.
For given graphs G1,G2, the 2-color Ramsey number R(G1,G2) is defined to be the least positive integer n such that every 2-coloring of the edges of complete graph Kn contains a copy of G1 colored with the first color ...
详细信息
For given graphs G1,G2, the 2-color Ramsey number R(G1,G2) is defined to be the least positive integer n such that every 2-coloring of the edges of complete graph Kn contains a copy of G1 colored with the first color or a copy of G2 colored with the second color. In this note, we obtained some new exact values of generalized Ramsey numbers such as cycle versus book, book versus book, complete bipartite graph versus complete bipartite graph.
The Ramsey multiplicity M(G) of a graph G is defined to be the smallest number of monochromatic copies of G in any two-coloring of edges of K R(G), where R(G) is the smallest integer n such that every graph on n verti...
详细信息
The Ramsey multiplicity M(G) of a graph G is defined to be the smallest number of monochromatic copies of G in any two-coloring of edges of K R(G), where R(G) is the smallest integer n such that every graph on n vertices either contains G or its complement contains G. With the help of computer algorithms, we obtain the exact values of Ramsey multiplicities for most of isolate-free graphs on five vertices, and establish upper bounds for a few others.
An adaptive generalized predictive control (GPC) system is presented for the management of output power of solid oxide fuel cells (SOFCs). The dynamics of SOFC output power are characterized by a fractional order mode...
详细信息
An adaptive generalized predictive control (GPC) system is presented for the management of output power of solid oxide fuel cells (SOFCs). The dynamics of SOFC output power are characterized by a fractional order model, which is more accurate than an integer order model to depict the dynamics;the fractional order dynamic model is taken as the controlled plant of the GPC system. The GPC algorithm adopts a linear approximation method that uses a linear predictive model to approximate locally and dynamically the nonlinear dynamics of SOFC output power at each sampling period. Moreover, the parameters of the predictive model are identified online to overcome the time-varying dynamics of SOFC output power via introducing a forgetting factor recursive least squares (FFRLS) algorithm. Finally, according to the future power outputs predicted by the predictive model, an optimal current control sequence is obtained by solving a multistage cost function. The results demonstrate that the dynamic responses of the GPC system are quick and smooth, and the change of the current control sequence is slow and smooth. The quick and smooth dynamics are important for satisfying the rapid load following of SOFC generating systems and for prolonging the lifetime of SOFC stack. (C) 2010 Elsevier B.V. All rights reserved.
暂无评论