supported in part by Natural Science Foundation of Zhejiang Province of China(Grant Nos.LR20F030001,LY22F030005,LD19A010001);National Natural Science Foundation of China(Grant Nos.62173308,61903339)。
In this study,the minimum observability of Boolean networks(BNs)is investigated by using the semi-tensor product(STP)of matrices.First,a new system based on the considered BN is obtained to analyze states pair dynamic...
supported by National Natural Science Foundation of China (Grant Nos. 11671361, 61833005, 61573096);Natural Science Foundation of Zhejiang Province (Grant No. LD19A010001);Natural Science Foundation of Jiangsu Province (Grant No. BK20170019);Jiangsu Provincial Key Laboratory of Networked Collective Intelligence (Grant No. BM2017002)
This paper investigates the global stabilization problem of k-valued logical control networks(KVLCNs) via event-triggered control(ETC), where the control inputs only work at several certain individual states. Compared...
supported by National Natural Science Foundation of China (Grant Nos. 61672261, 61502199, 61402196, 61272208)
Model-based diagnosis(MBD) has been widely acknowledged as an effective diagnosis paradigm.However, for large scale circuits, it is difficult to find all cardinality-minimal diagnoses within a reasonable time. This pa...
supported by National Basic Research Program of China(973 Program)(Grant No.2013CB834203);National Natural Science Foundation of China(Grant Nos.61170289;61003291)
In this paper, a generalization of the linear feedback shift register synthesis problem is presented for synthesizing minimum-length matrix feedback shift registers (MFSRs for short) to generate prescribed matrix se...
supported by National Natural Science Foundation of China(Grant No.61231008);National Natural Science Foundation of China(Grant No.61101143);National Basic Research Program of China(Grant No.2009CB320404);Program for Changjiang Scholars and Innovative Research Team in University(PCSIRT)(Grant No.IRT0852);111 Project(Grant No.B08038)
Exploiting transmission opportunities in dimensions of user equipments (UEs), radio access networks (RANs), and radio resource units (RRUs), in heterogeneous wireless networks (HWNs), we focus on a new perspec...
supported by National Natural Science Foundations of China (Grant Nos. 61170208,60832001);Research Fund for the Doctoral Program of Higher Education of China (Grant No. 20090071110073);Shanghai Shuguang Project (Grant No. 10SG01);Fox Ying Yung Education Foundation (Grant No. 114401);National High-Tech Research & Development Program of China (Grant No. 2009AA01A348)
In this paper,we present a construction of complex orthogonal design for space-time block codes in any number of antennas.Our construction achieves both the maximal rate and minimal delay.So far as we know,our constru...
supported by National Natural Science Foundation of China (Grant Nos. 60873101,61170321);Research Fund for the Doctoral (Grant No. 20110092110024);Research Foundation of Graduate School of Southeast University (Grant No. YBJJ0820)
The size of vertex set of quantum trellises affects the efficiency of decoding algorithms, which can be improved by reducing the number of vertices. Based on the standard check matrix of stabilizer codes, an algorithm...
supported by National Natural Science Foundation of China (Grant Nos. 11171200,61005046,61103133);Fundamental Research Funds for the Central Universities (Grant No. GK201004006)
In the present paper, the concepts of deductive element and maximal contraction are introduced in Boolean algebras, and corresponding theories of consistency and maximal contractions are studied. An algorithm principl...
Binary neural networks (BNNs) have important value in many application areas. They adopt linearly separable structures, which are simple and easy to implement by hardware. For a BNN with single hidden layer, the pro...
supported by the National Basic Research Program of China (Grant No. 2005CB321901);the National High-Tech Research and Development Program of China (Grant No. 2007AA01Z146);the State Key Laboratory of Software Develop Environment Supported Project (Grant No. SKLSDE-2008ZX-01)
In the theory of belief revision, the computation of all maximal subsets (maximal contractions) of a formula set with respect to a set of facts is one of the key problems. In this paper, we try to solve this problem...