RESUMO
This study proposes a continuous adaptive finite-time fractional-order sliding mode control method for fractional-order Buck converters. In order to establish a more accurate model, a fractional-order model based on the Riemann-Liouville (R-L) definition of the Buck converter is developed, which takes into account the non-integer order characteristics of electronic components. The R-L definition is found to be more effective in describing the Buck converter than the Caputo definition. To deal with parameter uncertainties and external disturbances, the proposed approach combines these factors as lumped matched disturbances and mismatched disturbances. Unlike previous literature that assumes a known upper bound of disturbances, adaptive algorithms are developed to estimate and compensate for unknown bounded disturbances in this paper. A continuous finite-time sliding mode controller is then developed using a backstepping method to achieve a chattering-free response and ensure a finite-time convergence. The convergence time for the sliding mode reaching phase and sliding mode phase is estimated, and the fractional-order Lyapunov theory is utilized to prove the finite-time stability of the system. Finally, simulation results demonstrate the robustness and effectiveness of the proposed controller.
RESUMO
This paper deals with the problem of dissipativity-based filtering for switched genetic regulatory networks (GRNs) with stochastic perturbation and time-varying delays. By choosing an appropriate piecewise Lyapunov function and using the average dwell time method, we propose a new set of sufficient conditions in terms of Linear matrix inequalities (LMIs) for the existence of dissipative filter, which ensures that the resulting filtering error system is mean-square exponentially stable with dissipativity performance. The filter gains are provided by solving feasible solutions to a certain set of LMIs. A simulation example is given to demonstrate the effectiveness of the desired dissipativity-based filter design approach.
Assuntos
Simulação por Computador , Redes Reguladoras de Genes/genética , Modelos Genéticos , Biologia Computacional/métodos , Processos Estocásticos , Fatores de TempoRESUMO
BACKGROUND: The learning-based algorithms provide an ability to automatically estimate and refine GM, WM and CSF. The ground truth manually achieved from the 3T MR image may not be accurate and reliable with poor image intensity contrast. It will seriously influence the classification performance because the supervised learning-based algorithms extremely rely on the ground truth. Recently, the 7T MR images brings about the excellent image intensity contrast, while Structured Random Forest (SRF) performs the pixel-level classification and achieves structural and contextual information in images. MATERIALS AND METHODS: In this paper, a automatic segmentation algorithm is proposed based on ground truth achieved by the corresponding 7T subjects for segmenting the 3T&1.5T brain tissues using SRF classifiers. Through taking advantage of the 7T brain MR images, we can achieve the highly accuracy and reliable ground truth and then implement the training of SRF classifiers. Our proposed algorithm effectively integrates the T1-weighed images along with the probability maps to train the SRF classifiers for brain tissue segmentation. RESULTS: Specifically, for the mean Dice ratio of all 10 subjects, the proposed method achieved 95.14%±0.9%, 90.17%±1.83%, and 81.96%±4.32% for WM, GM, and CSF. With the experiment results, the proposed algorithm can achieve better performances than other automatic segmentation methods. Further experiments are performed on the 200 3T&1.5T brain MR images of ADNI dataset and our proposed method shows promised performances. CONCLUSION: The authors have developed and validated a novel fully automated method for 3T brain MR image segmentation.
Assuntos
Encéfalo , Imageamento por Ressonância Magnética , Algoritmos , Encéfalo/diagnóstico por imagem , HumanosRESUMO
This paper is concerned with the exponential stability analysis of genetic regulatory networks (GRNs) with switching parameters and time delays. In this paper, a new integral inequality and an improved reciprocally convex combination inequality are considered. By using the average dwell time approach together with a novel Lyapunov-Krasovskii functional, we derived some conditions to ensure the switched GRNs with switching parameters and time delays are exponentially stable. Finally, we give two numerical examples to clarify that our derived results are effective.
Assuntos
Algoritmos , Simulação por Computador , Redes Reguladoras de Genes , Redes Neurais de Computação , Humanos , Fatores de TempoRESUMO
This paper investigates the consensus problem of multiple Euler-Lagrange systems under directed topology. Unlike the common assumptions on continuous-time information exchanges, a more realistic sampled-data communication strategy is proposed with probabilistic occurrence of time-varying delays. Both of the sampling period and the delays are assumed to be time-varying, which is more general in some practical situations. In addition, the relative coordinate derivative information is not required in the distributed controllers such that the communication network burden can be further reduced. In particular, a distinct feature of the proposed scheme lies in the fact that it can effectively reduce the energy consumption. By employing the stochastic analysis techniques, sufficient conditions are established to guarantee that the consensus can be achieved. Finally, a numerical example is provided to illustrate the applicability and benefits of the theoretical results.