scholarly journals Matrix expression of finite Boolean-type algebras

2021 ◽  
Vol 395 ◽  
pp. 125880
Author(s):  
Shihua Fu ◽  
Daizhan Cheng ◽  
Jun-e Feng ◽  
Jianli Zhao
Keyword(s):  
2010 ◽  
Vol 20 (03) ◽  
pp. 561-582 ◽  
Author(s):  
ZHIQIANG LI ◽  
DAIZHAN CHENG

Using semi-tensor product of matrices, a matrix expression for multivalued logic is proposed, where a logical variable is expressed as a vector, and a logical function is expressed as a multilinear mapping. Under this framework, the dynamics of a multivalued logical network is converted into a standard discrete-time linear system. Analyzing the network transition matrix, easily computable formulas are obtained to show (a) the number of equilibriums; (b) the numbers of cycles of different lengths; (c) transient period, the minimum time for all points to enter the set of attractors, respectively. A method to reconstruct the logical network from its network transition matrix is also presented. This approach can also be used to convert the dynamics of a multivalued control network into a discrete-time bilinear system. Then, the structure and the controllability of multivalued logical control networks are revealed.


2017 ◽  
Vol 88 ◽  
pp. 1064-1068 ◽  
Author(s):  
Yi Zhang ◽  
Li Zhang ◽  
Xiao-hua Lin ◽  
Zhi-ming Li ◽  
Qi-yu Zhang

2009 ◽  
Vol 29 (4) ◽  
pp. 582-586 ◽  
Author(s):  
Elizabeth Mosier ◽  
Victor K. Lin ◽  
Philippe Zimmern

2018 ◽  
Vol 6 (5) ◽  
pp. 459-472
Author(s):  
Xujiao Fan ◽  
Yong Xu ◽  
Xue Su ◽  
Jinhuan Wang

Abstract Using the semi-tensor product of matrices, this paper investigates cycles of graphs with application to cut-edges and the minimum spanning tree, and presents a number of new results and algorithms. Firstly, by defining a characteristic logical vector and using the matrix expression of logical functions, an algebraic description is obtained for cycles of graph, based on which a new necessary and sufficient condition is established to find all cycles for any graph. Secondly, using the necessary and sufficient condition of cycles, two algorithms are established to find all cut-edges and the minimum spanning tree, respectively. Finally, the study of an illustrative example shows that the results/algorithms presented in this paper are effective.


2019 ◽  
Vol 139 (5) ◽  
pp. 1073-1081 ◽  
Author(s):  
Corrie L. Gallant-Behm ◽  
Joseph Piper ◽  
Joshua M. Lynch ◽  
Anita G. Seto ◽  
Seok Jong Hong ◽  
...  

2011 ◽  
Vol 2011 ◽  
pp. 1-7 ◽  
Author(s):  
Guo Guang Wang ◽  
Xiao Hua Lu ◽  
Wei Li ◽  
Xue Zhao ◽  
Cui Zhang

Diabetic nephropathy is a long-term complication of diabetic mellitus. Many experimental evidences suggest that persistent hyperglycaemia generates intracellular reactive oxygen species (ROS) and upregulates transforming growth factor-b1 and extracellular matrix expression in mesangial and tubular epithelial cells, which is involved of free radicals in the pathogenesis of diabetes and more importantly in the development of diabetic complications. Antioxidants effectively inhibit high-glucose- and H2O2-induced transforming growth factor-b1 and fibronectin upregulation, thus providing evidence that ROS play an important role in high glucose-induced renal injury. The flavonoid luteolin has been shown to possess direct antioxidant activity, therefore we hypothesize that it may be useful in treatment of many chronic disease associated with oxidative stress, such as diabetic nephropathy via its antioxidant properties. Our results suggested that protection against development of diabetic nephropathy by luteolin treatment involved changes in superoxide dismutase (SOD) activity, the malondialdehyde (MDA) content and expression of Heme Oxygenase-1 (HO-1) protein.


Sign in / Sign up

Export Citation Format

Share Document