检索结果-南通市图书馆

Robust reliable guaranteed cost control for uncertain singular systems with time-delay

在线全文

学校读者我要写书评

暂无评论

Journal of Systems Engineering and Electronics 2010年第1期21卷 110-117页

作者： Qixun Lan Yuxiao Liu Huawei Niu jiarong liang Department of Mathematics and Physics Henan University of Urban Construction Pingdingshan 467001 P. R. China Pingdingshan Institute of Education Pingdingshan 467000 E R. China School of Computer and Electronic Information Guangxi University Nanning 530004 E R. China

The robust reliable guaranteed cost control for uncertain singular delay systems with actuator failures and a given quadratic cost function is studied. The system under consideration involves constant time-delay and norm-bounded parameter uncertainties. The purpose is to design state feedback controllers which can tolerate actuator failure, such that the closed-loop system is stable, and the specified cost function has an upper bound for all admissible uncertainties. The sufficient conditions for the solvability of this problem are obtained by a linear matrix inequality （LMI） method. Furthermore, a numerical example is given to demonstrate the applicability of the proposed approach.

关键词： singular system reliable control guaranteed cost control actuator failure linear matrix inequality time-delay.

Weighted average consensus problem in networks of agents with diverse time-delays

在线全文

学校读者我要写书评

暂无评论

Journal of Systems Engineering and Electronics 2014年第6期25卷 1056-1064页

作者： Wenhui Liu Feiqi Deng jiarong liang Xuekui Yan College of Automation Science and Engineering South China University of Technology School of Computer and Electronic Information Guangxi University

This paper studies the weighted average consensus problem for networks of agents with fixed directed asymmetric unbalance information exchange topology. We suppose that the classical distributed consensus protocol is destroyed by diverse time-delays which include communication time-delay and self time-delay. Based on the generalized Nyquist stability criterion and the Gerschgorin disk theorem, some sufficient conditions for the consensus of multi-agent systems are obtained. And we give the expression of the weighted average consensus value for our consensus protocol. Finally, numerical examples are presented to illustrate the theoretical results.

关键词： networks of agents,distributed control,weighted average consensus,time-delay,digraph theory

Almost periodic solution to singular systems

在线全文

学校读者我要写书评

暂无评论

Chinese Science Bulletin 1998年第8期43卷 698-700页

作者： jiarong liang Yongqing Liu Cunchen Gao S China Univ Technol Dept Automat Canton 510641 Peoples R China

The problems about the almost periodic solution to singular systems are studied. The criterion that the singular systems have almost periodic solutions is obtained. At the same time, the applied example is given.

关键词： singular systems almost periodic solutions boundary.

Distributed Average Consensus in Multi-agent Networks with Limited Bandwidth and Time-delays

在线全文

学校读者我要写书评

暂无评论

IEEE/CAA Journal of Automatica Sinica 2014年第2期1卷 193-203页

作者： Wenhui Liu Feiqi Deng jiarong liang Haijun Liu College of Automation Science and Engineering South China University of Technology School of Computer Electronics and InformationGuangxi University School of Mathematics and Statistics Zhengzhou University

This paper studies the distributed average consensus problem of multi-agent digital networks with time-delays. For the network, each agent can only exchange symbolic data with its neighbours. We provide a distributed average consensus protocol which uses the quantized and time-delay information. We consider two types of dynamic encoders/decoders in our protocol.One uses inverse proportion function as scaling function, while the other uses exponential function as scaling function. All agents can reach average consensus asymptotically with our protocol.Furthermore, we show that the average consensus protocol is robust to finite symmetric time-delays, but is sensitive to asymmetric time-delays that will destroy the average consensus of the networks. Finally, simulations are presented to illustrate validity of our theoretical results.

关键词： Protocols Quantization (signal) Decoding Bandwidth Algorithm design and analysis Communication channels

On Conditional h-Vertex Connectivity of Some Networks

在线全文

学校读者我要写书评

暂无评论

Chinese Journal of Electronics 2016年第3期25卷 556-560页

作者： YE liangcheng liang jiarong School of Computer Science and Electronic Information Guangxi University

The conditional h-vertex connectivity of G is defined as the minimum cardinality |S|(SV(G)) such that G–S is disconnected and has minimum degree at least h. It is an important measure of fault tolerance of networks.In this paper, we prove the lower bound of conditional hvertex connectivity of any n-dimensional hypercube-like network. We also determine the conditional h-vertex connectivity of Crossed cubes, Locally twisted cubes, Mbius cubes which are the members of hypercube-like networks.

关键词： Hypercube-like networks Fault tolerance Conditional connectivity Crossed cubes Mbius cubes Locally twisted cubes

t/k-fault diagnosis algorithm of n-dimensional hypercube network based on the MM*model

在线全文

同方期刊数据库

学校读者我要写书评

暂无评论

Journal of Systems Engineering and Electronics 2018年第1期29卷 216-222页

作者： liang jiarong ZHOU Ning YUN Long School of Computer and Electronics Information Guangxi UniversityNanning 530004China Guangxi Key Laboratory of Multimedia Communications and Network Technology Nanning 530004China

Compared with accurate diagnosis, the system’s selfdiagnosing capability can be greatly increased through the t/kdiagnosis strategy at most k vertexes to be mistakenly identified as faulty under the comparison model, where k is typically a small number. Based on the Preparata, Metze, and Chien(PMC)model, the n-dimensional hypercube network is proved to be t/kdiagnosable. In this paper, based on the Maeng and Malek(MM)*model, a novel t/k-fault diagnosis(1≤k≤4) algorithm of ndimensional hypercube, called t/k-MM*-DIAG, is proposed to isolate all faulty processors within the set of nodes, among which the number of fault-free nodes identified wrongly as faulty is at most k. The time complexity in our algorithm is only O(2~n n~2).

关键词： hypercube network t/k-diagnosis algorithm multiprocessor systems the Maeng and Malek(MM)* model Preparata Metze and Chien(PMC)

A novel conditional diagnosability algorithm under the PMC model

在线全文

学校读者我要写书评

暂无评论

High Technology Letters 2017年第4期23卷 384-389页

作者：郭晨 liang jiarong Leng Ming Peng Shuo School of Electronic and Information Engineering Jinggangshan University School of Computer and Electronic Information Guangxi University Department of Computer Science and Technology Tsinghua University

Conditionally t-diagnosable and t-diagnosable are important in system level diagnosis. Therefore,it is valuable to identify whether the system is conditionally t-diagnosable or t-diagnosable and derive the corresponding conditional diagnosability and diagnosability. In the paper,distinguishable measures of pairs of distinct faulty sets with a new perspective on establishing functions are focused.Applying distinguishable function and decision function,it is determined whether a system is conditionally t-diagnosable( or t-diagnosable) or not under the PMC( Preparata,Metze,and Chien)model directly. Based on the decision function,a novel conditional diagnosability algorithm under the PMC model is introduced which can calculate conditional diagnosability rapidly.

关键词： the PMC(Preparata,Metze,and Chien) model conditionally t-diagnosable conditional diagnosability conditional diagnosability algorithm

Fault diagnosis for t/(t+1)-diagnosable system based on the PMC model

在线全文

学校读者我要写书评

暂无评论

High Technology Letters 2019年第2期25卷 166-173页

作者：谢敏 liang jiarong Zhang Qian Chen Haiqiang School of Computer and Electronic Information Guangxi UniversityNanning 530004P.R.China Guangxi Key Laboratory of Multimedia Communications and Network Technology Nanning 530004P.R.China

In this paper, a t/(t+1)-diagnosable system is studied, which can locate a set S with |S|≤t+1 containing all faulty units only if the system has at most t faulty units. On the basis of the characterization of the t/(t+1)-diagnosable system, a necessary and sufficient condition is presented to judge whether a system is t/(t+1)-diagnosable. Meanwhile, this paper exposes some new and important properties of the t/(t+1)-diagnosable system to present the t/(t+1)-diagnosability of some networks. Furthermore, the following results for the t/(t+1)-diagnosability of some special networks are obtained: a hypercube network of n -dimensions is (3n-5)/(3n-4)-diagnosable, a star network of n -dimensions is (3n-5)/(3n-4)-diagnosable (n≥5) and a 2D-mesh (3D-mesh) with n 2(n 3) units is 8/9-diagnosable (11/12-diagnosable). This paper shows that in general, the t/(t+1)-diagnosability of a system is not only larger than its t/t -diagnosability , but also its classic diagnosability, specially the t/(t+1)-diagnosability of the hypercube network of n -dimensions is about 3 times as large as its classic t -diagnosability and about 1.5 times as large as its t/t -diagnosability.

关键词： t/t -diagnosable system characterization of t/(t+1)-diagnosable system fault diagnosis n -dimensional hypercube networks

Proteome Analysis of Heat Stable Proteins in Seeds of Vigna unguiculata

在线全文

学校读者我要写书评

暂无评论

Proteome Analysis of Heat Stable Proteins in Seeds of Vigna ...