Shiying Wang

Dong Xiang

Parallel Process. Lett., 2020

The g-Extra Conditional Diagnosability of Graphs in Terms of g-Extra Connectivity.

[BibT_eX]

[DOI]

Parallel Process. Lett., 2020

Diagnosability of expanded k-ary n-cubes with missing edges under the comparison model.

[BibT_eX]

[DOI]

Int. J. Parallel Emergent Distributed Syst., 2020

Diagnosability of arrangement graphs with missing edges under the MM* model.

[BibT_eX]

[DOI]

Xiaolei Ma

Int. J. Parallel Emergent Distributed Syst., 2020

A short note on strong local diagnosability property of exchanged hypercubes under the comparison model.

[BibT_eX]

[DOI]

Int. J. Parallel Emergent Distributed Syst., 2020

Connectivity and Nature Diagnosability of Leaf-Sort Graphs.

[BibT_eX]

[DOI]

Jutao Zhao

J. Interconnect. Networks, 2020

Multi-modal image fusion based on saliency guided in NSCT domain.

[BibT_eX]

[DOI]

Yan Shen

IET Image Process., 2020

The Two-Good-Neighbor Connectivity and Diagnosability of the Augmented Three-Ary n-Cubes.

[BibT_eX]

[DOI]

Nan Zhao

Comput. J., 2020

Diagnosability of the Cayley Graph Generated by Complete Graph with Missing Edges under the MM$^{\ast }$ Model.

[BibT_eX]

[DOI]

Comput. J., 2020

MAMAP: Congestion Relieved Memetic Algorithm based Mapping Method for Mapping Large-Scale SNNs onto NoC-based Neuromorphic Hardware.

[BibT_eX]

[DOI]

Proceedings of the 22nd IEEE International Conference on High Performance Computing and Communications; 18th IEEE International Conference on Smart City; 6th IEEE International Conference on Data Science and Systems, 2020

SNEAP: A Fast and Efficient Toolchain for Mapping Large-Scale Spiking Neural Network onto NoC-based Neuromorphic Platform.

[BibT_eX]

[DOI]

Proceedings of the GLSVLSI '20: Great Lakes Symposium on VLSI 2020, 2020

Application-specific network-on-chip design space exploration framework for neuromorphic processor.

[BibT_eX]

[DOI]

Proceedings of the 17th ACM International Conference on Computing Frontiers, 2020

A Software-Hardware Co-exploration Framework for Optimizing Communication in Neuromorphic Processor.

[BibT_eX]

[DOI]

Proceedings of the Advanced Computer Architecture - 13th Conference, 2020

Liquid State Machine Applications Mapping for NoC-Based Neuromorphic Platforms.

[BibT_eX]

[DOI]

Proceedings of the Advanced Computer Architecture - 13th Conference, 2020

2019

Embedding fault-free hamiltonian paths with prescribed linear forests into faulty ternary n-cubes.

[BibT_eX]

[DOI]

Theor. Comput. Sci., 2019

The g-good-neighbor and g-extra diagnosability of networks.

[BibT_eX]

[DOI]

Theor. Comput. Sci., 2019

The h-extra connectivity of k-ary n-cubes.

[BibT_eX]

[DOI]

Theor. Comput. Sci., 2019

A Note on the Connectivity of m-Ary n-Dimensional Hypercubes.

[BibT_eX]

[DOI]

Parallel Process. Lett., 2019

Connectivity and Matching Preclusion for Leaf-Sort Graphs.

[BibT_eX]

[DOI]

Yanling Wang

J. Interconnect. Networks, 2019

Diagnosability of Bubble-Sort Star Graphs with Missing Edges.

[BibT_eX]

[DOI]

Yingying Wang

J. Interconnect. Networks, 2019

Edge-bipancyclicity in conditional edge-faulty k-ary n-cubes.

[BibT_eX]

[DOI]

RAIRO Theor. Informatics Appl., 2019

The g-Good-Neighbor Diagnosability of Bubble-Sort Graphs under Preparata, Metze, and Chien's (PMC) Model and Maeng and Malek's (MM)* Model.

[BibT_eX]

[DOI]

Zhenhua Wang

Inf., 2019

Arc fault tolerance of Cartesian product of regular digraphs on super-restricted arc-connectivity.

[BibT_eX]

[DOI]

Discuss. Math. Graph Theory, 2019

Sufficient conditions for graphs with girth g to be maximally k-restricted edge connected.

[BibT_eX]

[DOI]

Discret. Appl. Math., 2019

The strong connectivity of bubble-sort star graphs.

[BibT_eX]

[DOI]

Comput. J., 2019

The $h$ -Extra Connectivity and Diagnosability of Locally Twisted Cubes.

[BibT_eX]

[DOI]

IEEE Access, 2019

The $r$ -Restricted Connectivity of Hyper Petersen Graphs.

[BibT_eX]

[DOI]

IEEE Access, 2019

Research on Speech Quality Evaluation Method Based on Deep Neural Network.

[BibT_eX]

[DOI]

Haikun Teng

Lunbin Li

Proceedings of the EBIMCS 2019: 2nd International Conference on E-Business, 2019

2018

A Note on the Nature Diagnosability of Alternating Group Graphs Under the PMC Model and MM* Model.

[BibT_eX]

[DOI]

Lingqi Zhao

J. Interconnect. Networks, 2018

g-Good-Neighbor Diagnosability of Arrangement Graphs under the PMC Model and MM* Model.

[BibT_eX]

[DOI]

Inf., 2018

The 1-good-neighbor connectivity and diagnosability of Cayley graphs generated by complete graphs.

[BibT_eX]

[DOI]

Yuqing Lin

Discret. Appl. Math., 2018

Edge Fault Tolerance of Cartesian Product Graphs on Super Restricted Edge Connectivity.

[BibT_eX]

[DOI]

Comput. J., 2018

The g-extra connectivity and diagnosability of crossed cubes.

[BibT_eX]

[DOI]

Xiaolei Ma

Appl. Math. Comput., 2018

Sufficient conditions for graphs to be maximally 4-restricted edge connected.

[BibT_eX]

[DOI]

Australas. J Comb., 2018

Classification of Tibetan Medical Syndrome Based on Class Association Rules.

[BibT_eX]

[DOI]

Proceedings of the 14th International Conference on Signal-Image Technology & Internet-Based Systems, 2018

Research on Java Compiling System for Embedded Systems.

[BibT_eX]

[DOI]

Proceedings of the International Symposium on Big Data and Artificial Intelligence, 2018

Research on Cluster Analysis of Tibetan Medicine Syndromes type of the plateau common disease.

[BibT_eX]

[DOI]

Proceedings of the 14th International Conference on Natural Computation, 2018

2017

The g-good-neighbor diagnosability of locally twisted cubes.

[BibT_eX]

[DOI]

Theor. Comput. Sci., 2017

On g-extra conditional diagnosability of hypercubes and folded hypercubes.

[BibT_eX]

[DOI]

Theor. Comput. Sci., 2017

The Tightly Super 2-extra Connectivity and 2-extra Diagnosability of Locally Twisted Cubes.

[BibT_eX]

[DOI]

J. Interconnect. Networks, 2017

The connectivity and nature diagnosability of expanded k-ary n-cubes.

[BibT_eX]

[DOI]

Yuqing Lin

RAIRO Theor. Informatics Appl., 2017

The 1-good-neighbour diagnosability of Cayley graphs generated by transposition trees under the PMC model and MM* model.

[BibT_eX]

[DOI]

Yubao Guo

Int. J. Comput. Math., 2017

A sufficient condition for graphs to be super k-restricted edge connected.

[BibT_eX]

[DOI]

Meiyu Wang

Discuss. Math. Graph Theory, 2017

Embedding various cycles with prescribed paths into k-ary n-cubes.

[BibT_eX]

[DOI]

Discret. Appl. Math., 2017

The 2-good-neighbor connectivity and 2-good-neighbor diagnosability of bubble-sort star graph networks.

[BibT_eX]

[DOI]

Zhenhua Wang

Discret. Appl. Math., 2017

The tightly super 3-extra connectivity and 3-extra diagnosability of crossed cubes.

[BibT_eX]

[DOI]

Xiaolei Ma

CoRR, 2017

The 2-good-neighbor (2-extra) diagnosability of alternating group graph networks under the PMC model and MM* model.

[BibT_eX]

[DOI]

Appl. Math. Comput., 2017

2016

The 2-good-neighbor diagnosability of Cayley graphs generated by transposition trees under the PMC model and MM⁎ model.

[BibT_eX]

[DOI]

Yuqing Lin

Theor. Comput. Sci., 2016

The g-good-neighbor conditional diagnosability of n-dimensional hypercubes under the MM⁎ model.

[BibT_eX]

[DOI]

Weiping Han

Inf. Process. Lett., 2016

Conditional fault tolerance in a class of Cayley graphs.

[BibT_eX]

[DOI]

Int. J. Comput. Math., 2016

The 2-Extra Connectivity and 2-Extra Diagnosability of Bubble-Sort Star Graph Networks.

[BibT_eX]

[DOI]

Zhenhua Wang

Comput. J., 2016

Kings in strong tournaments.

[BibT_eX]

Ars Comb., 2016

Research on Syndrome Classification Prediction Model of Tibetan Medicine Diagnosis and Treatment Based on Data Mining.

[BibT_eX]

[DOI]

Proceedings of the 12th International Conference on Signal-Image Technology & Internet-Based Systems, 2016

Self-powered lightning current sensor.

[BibT_eX]

[DOI]

Proceedings of the 2016 IEEE SENSORS, Orlando, FL, USA, October 30 - November 3, 2016, 2016

2015

A note on Hamiltonian paths and cycles with prescribed edges in the 3-ary n-cube.

[BibT_eX]

[DOI]

Inf. Sci., 2015

Subnetwork preclusion for bubble-sort networks.

[BibT_eX]

[DOI]

Inf. Process. Lett., 2015

Sufficient Conditions for Maximally k-Isoperimetric Edge Connectivity of Graphs.

[BibT_eX]

[DOI]

Yubao Guo

Int. J. Found. Comput. Sci., 2015

Link Failure Tolerance in the Arrangement Graphs.

[BibT_eX]

[DOI]

Int. J. Found. Comput. Sci., 2015

Unchanging the diameter of k-ary n-cube networks with faulty vertices.

[BibT_eX]

[DOI]

Int. J. Comput. Math., 2015

Strong matching preclusion for two-dimensional torus networks.

[BibT_eX]

[DOI]

Int. J. Comput. Math., 2015

A novel case adaptation method based on an improved integrated genetic algorithm for power grid wind disaster emergencies.

[BibT_eX]

[DOI]

Baishang Zhang

Xiangyang Li

Expert Syst. Appl., 2015

k-restricted edge connectivity in (p+1)-clique-free graphs.

[BibT_eX]

[DOI]

Discret. Appl. Math., 2015

Degree conditions for graphs to be maximally k-restricted edge connected and super k-restricted edge connected.

[BibT_eX]

[DOI]

Nana Zhao

Discret. Appl. Math., 2015

Conditional Matching Preclusion Sets for an Mixed-Graph of the Star Graph and the Bubble-Sort Graph.

[BibT_eX]

[DOI]

Proceedings of the Intelligent Computing Theories and Methodologies, 2015

CBR Method for Risk Assessment on Power Grid Protection Under Natural Disasters: Case Representation and Retrieval.

[BibT_eX]

[DOI]

Feng Yu

Xiangyang Li

Proceedings of the Computational Science and Its Applications - ICCSA 2015, 2015

2014

Sufficient conditions for k-restricted edge connected graphs.

[BibT_eX]

[DOI]

Theor. Comput. Sci., 2014

Fault tolerance in the arrangement graphs.

[BibT_eX]

[DOI]

Theor. Comput. Sci., 2014

Strong matching preclusion for torus networks.

[BibT_eX]

[DOI]

Theor. Comput. Sci., 2014

Conditional connectivity of recursive interconnection networks respect to embedding restriction.

[BibT_eX]

[DOI]

Inf. Sci., 2014

Hamiltonian path embeddings in conditional faulty k-ary n-cubes.

[BibT_eX]

[DOI]

Inf. Sci., 2014

Panconnectivity and pancyclicity of the 3-ary n-cube network under the path restrictions.

[BibT_eX]

[DOI]

Appl. Math. Comput., 2014

2013

Many-to-many disjoint path covers in kk-ary nn-cubes.

[BibT_eX]

[DOI]

Theor. Comput. Sci., 2013

Fault-free Hamiltonian cycles passing through a linear forest in ternary nn-cubes with faulty edges.

[BibT_eX]

[DOI]

Theor. Comput. Sci., 2013

Fault-tolerant embedding of cycles of various lengths in k-ary n-cubes.

[BibT_eX]

[DOI]

Inf. Comput., 2013

Underlying graphs of 3-quasi-transitive digraphs and 3-transitive digraphs.

[BibT_eX]

[DOI]

Discuss. Math. Graph Theory, 2013

A sufficient condition for graphs to be λk-optimal.

[BibT_eX]

[DOI]

Discret. Appl. Math., 2013

Strong matching preclusion for k-ary n-cubes.

[BibT_eX]

[DOI]

Discret. Appl. Math., 2013

2012

Fault tolerance in k-ary n-cube networks.

[BibT_eX]

[DOI]

Theor. Comput. Sci., 2012

Fault tolerance in bubble-sort graph networks.

[BibT_eX]

[DOI]

Theor. Comput. Sci., 2012

Conditional connectivity of star graph networks under embedding restriction.

[BibT_eX]

[DOI]

Inf. Sci., 2012

A neighborhood condition for graphs to be maximally k-restricted edge connected.

[BibT_eX]

[DOI]

Inf. Process. Lett., 2012

Embeddings of hamiltonian paths in faulty k-ary 2-cubes.

[BibT_eX]

[DOI]

Discuss. Math. Graph Theory, 2012

Embedding long cycles in faulty k-ary 2-cubes.

[BibT_eX]

[DOI]

Appl. Math. Comput., 2012

2011

Embedding hamiltonian paths in k-ary n-cubes with conditional edge faults.

[BibT_eX]

[DOI]

Theor. Comput. Sci., 2011

Hamiltonian paths and cycles with prescribed edges in the 3-ary n-cube.

[BibT_eX]

[DOI]

Inf. Sci., 2011

Edge-bipancyclicity of the k-ary n-cubes with faulty nodes and edges.

[BibT_eX]

[DOI]

Inf. Sci., 2011

Pancyclicity of ternary n-cube networks under the conditional fault model.

[BibT_eX]

[DOI]

Di Liu

Inf. Process. Lett., 2011

Independent sets and non-augmentable paths in arc-locally in-semicomplete digraphs and quasi-arc-transitive digraphs.

[BibT_eX]

[DOI]

Discret. Math., 2011

Hamiltonian cycles passing through linear forests in k-ary n-cubes.

[BibT_eX]

[DOI]

Discret. Appl. Math., 2011

Panconnectivity and edge-pancyclicity of k-ary n-cubes with faulty elements.

[BibT_eX]

[DOI]

Chunfang Li

Discret. Appl. Math., 2011

Sufficient conditions for maximally edge-connected graphs and arc-connected digraphs.

[BibT_eX]

[DOI]

Xiuli Wang

Australas. J Comb., 2011

2010

Neighborhood conditions for graphs to be super restricted edge connected.

[BibT_eX]

[DOI]

Networks, 2010

Kings in locally semicomplete digraphs.

[BibT_eX]

[DOI]

Aimin Yang

J. Graph Theory, 2010

Path embeddings in faulty 3-ary n-cubes.

[BibT_eX]

[DOI]

Inf. Sci., 2010

Matching preclusion for k-ary n-cubes.

[BibT_eX]

[DOI]

Discret. Appl. Math., 2010

Optimum control mode analysis and numerical backtracking of microfluidic cell-secreted analyte detection.

[BibT_eX]

[DOI]

Wei Wang

Proceedings of the 5th IEEE International Conference on Nano/Micro Engineered and Molecular Systems, 2010

Effects of non-ideal fabrication on the dilution performance of serially functioned microfluidic concentration gradient generator.

[BibT_eX]

[DOI]

Proceedings of the 5th IEEE International Conference on Nano/Micro Engineered and Molecular Systems, 2010

2009

Super p-restricted edge connectivity of line graphs.

[BibT_eX]

[DOI]

Inf. Sci., 2009

Sufficient conditions for bipartite graphs to be super-k-restricted edge connected.

[BibT_eX]

[DOI]

Discret. Math., 2009

The structure of strong arc-locally in-semicomplete digraphs.

[BibT_eX]

[DOI]

Discret. Math., 2009

Sufficient conditions for super k-restricted edge connectivity in graphs of diameter 2.

[BibT_eX]

[DOI]

Chunfang Li

Discret. Math., 2009

The k-restricted edge connectivity of undirected Kautz graphs.

[BibT_eX]

[DOI]

Discret. Math., 2009

Matrix Multiplication Based on DNA Computing.

[BibT_eX]

[DOI]

Guozhi Zhang

Proceedings of the Fifth International Conference on Natural Computation, 2009

2008

Sufficient conditions for a graph to be super restricted edge-connected.

[BibT_eX]

[DOI]

Networks, 2008

lambda.

[BibT_eX]

[DOI]

Inf. Process. Lett., 2008

Sufficient Conditions for Super-Arc-Strongly Connected Oriented Graphs.

[BibT_eX]

[DOI]

Graphs Comb., 2008

k-Restricted edge connectivity for some interconnection networks.

[BibT_eX]

[DOI]

Appl. Math. Comput., 2008

2005

The maximal restricted edge connectivity of Kautz undirected graphs: (extended abstract).

[BibT_eX]

[DOI]

Electron. Notes Discret. Math., 2005

DNA solution of integer linear programming.

[BibT_eX]

[DOI]

Aimin Yang

Appl. Math. Comput., 2005

Recent land use changes in north dust storm source area affecting Beijing and Tianjin II: Otindag Sandy land.

[BibT_eX]

[DOI]

Qiangguo Cai

Yanchun Gao

Proceedings of the IEEE International Geoscience & Remote Sensing Symposium, 2005

Recent land use changes in north dust storm source area affecting Beijing and Tianjin I: agro-pastoral transitional zone.

[BibT_eX]

[DOI]

Qiangguo Cai

Yanchun Gao

Proceedings of the IEEE International Geoscience & Remote Sensing Symposium, 2005

2003

The extreme set condition of a graph.

[BibT_eX]

[DOI]