graph theoryquantum gravity/ graph-theory induced gravitystrongly-degenerate fermionsself-consistent Einstein universeultraviolet-finite theoryDirac fieldsscalar fieldsWe study UV-finite theory of induced gravity. We use scalar fields, Dirac fields and vector fields as matter fields whose one-loop effects ...
Work on General Systems Theory (von Bertalanffy) andCybernetics(Wiener) paved the way for the idea of self-organization. The concept of a self-organizing system was introduced by Ashby in 1947. In the 1950s a self-organizing system was considered to be a system which changes its basic struct...
A simple set of conditions is given to determine whether or not a sequence ( d 1, …, d p) is the degree sequence of a self-complementary graph. 关键词: Theoretical or Mathematical/ combinatorial mathematics graph theory/ degree sequence potentially selfcomplementary degree sequences selfcomplemen...
Shannon CE (1948) A mathematical theory of communication. Bell Syst Tech J 27(4):623–665. https://doi.org/10.1002/j.1538-7305.1948.tb00917 Article Google Scholar Perez-Riba A, Komives E, Main ERG, Itzhaki LS (2019) Decoupling a tandem-repeat protein: impact of multiple loop insertions...
The self-organizing migrating algorithm (SOMA) is a population-based meta-heuristic that belongs to swarm intelligence. In the last 20 years, we can observ
882.Reachable-Nodes-In-Subdivided-Graph (H) 1102.Path-With-Maximum-Minimum-Value (H-) 1368.Minimum-Cost-to-Make-at-Least-One-Valid-Path-in-a-Grid (H) 1514.Path-with-Maximum-Probability (H) 1786.Number-of-Restricted-Paths-From-First-to-Last-Node (M+) 1810.Minimum-Path-Cost-in-a-Hid...
Lifetime graph An unknown illness hit me very very hard, I was unable to live an even remotely normal life. The constant sense of drowning was unreal and, sometimes, when the pain was unbearable, some dark thoughts loomed in my mind. ...
Business leaders need information to make critical decisions and anticipate and respond to industry and market changes. In theory, today’s vast stores of data should make gaining insights easier. But too often the reality is that getting relevant data requires a request to an IT staff already ...
Core theory Topics covered: divide and conquer sorting and searching randomized algorithms graph search shortest paths data structures greedy algorithms minimum spanning trees dynamic programming NP-completeness and more CoursesDurationEffortPrerequisitesDiscussion Divide and Conquer, Sorting and Searching, and ...
Learning Latent Representations in Neural Networks for Clustering through Pseudo Supervision and Graph-based Activity Regularization. [pdf] [code] Ozsel Kilinc and Ismail Uysal. ICLR 2018 Improvements to context based self-supervised learning. [pdf] Terrell Mundhenk and Daniel Ho and Barry Chen. CV...