Back to Search
Start Over
Optimal Design And Randomly Topological Coloring Of Dynamic Networks
- Source :
- 2020 IEEE 9th Joint International Information Technology and Artificial Intelligence Conference (ITAIC).
- Publication Year :
- 2020
- Publisher :
- IEEE, 2020.
-
Abstract
- In order to serve the need of resisting full-scale attacks and sabotage by supercomputers and quantum computers in the future, we make two systems of linear equations for optimizing network models such that they can simulate and approximate to high quality networks such as BA-models, tree-like network models, network models containing blockchain. We will design two algorithms for encrypting randomly growing network models wholly in dynamic evolution of the networks. These network models mentioned here produce network-network lattices, graphic group lattices, infinite every-zero graphic group homomorphism, mutually equivalent infinite every-zero graphic groups, and relate to mathematical problems.
- Subjects :
- Optimal design
0209 industrial biotechnology
Mathematical problem
Computer science
Group (mathematics)
02 engineering and technology
System of linear equations
Topology
020901 industrial engineering & automation
0202 electrical engineering, electronic engineering, information engineering
020201 artificial intelligence & image processing
Group homomorphism
Graphics
Quantum computer
Network model
Subjects
Details
- Database :
- OpenAIRE
- Journal :
- 2020 IEEE 9th Joint International Information Technology and Artificial Intelligence Conference (ITAIC)
- Accession number :
- edsair.doi...........0a926b1c689feef619630b5ff119cad4