-
1
Identifying optimal large N limits for marginal ϕ 4 theory in 4d
Published 2025-01-01Get full text
Article -
2
Global dynamics of a general class of multi-group epidemic models with latency and relapse
Published 2014-11-01“…The results show that the global dynamics are completelydetermined by the basic reproduction number $R_0.$ In particular, a matrix-theoretic method is used to provethe global stability of the disease-free equilibrium when $R_0\leq1,$while a new combinatorial identity (Theorem 3.3 in Shuai and vanden Driessche [29]) in graph theory is applied to provethe global stability of the endemic equilibrium when $R_0>1.…”
Get full text
Article -
3
Public Transportation Hub Location with Stochastic Demand: An Improved Approach Based on Multiple Attribute Group Decision-Making
Published 2015-01-01“…Finally, stochastic programming theory is applied to solve the model and to determine the location result. …”
Get full text
Article -
4
Coefficients of prolongations for symmetries of ODEs
Published 2004-01-01“…He found that transformations which form a continuous group and leave a differential equation invariant can be used to simplify the equation. …”
Get full text
Article -
5
Eigenvalues of Relatively Prime Graphs Connected with Finite Quasigroups
Published 2024-01-01“…A relatively new and rapidly expanding area of mathematics research is the study of graphs’ spectral properties. Spectral graph theory plays a very important role in understanding certifiable applications such as cryptography, combinatorial design, and coding theory. …”
Get full text
Article -
6
Construction of Mutually Orthogonal Graph Squares Using Novel Product Techniques
Published 2022-01-01“…Mutually orthogonal graph squares are an area of combinatorial design theory that has many applications in optical communications, wireless communications, cryptography, storage system design, algorithm design and analysis, and communication protocols, to mention just a few areas. …”
Get full text
Article -
7
Non-hierarchic document clustering
Published 1995-01-01“…GAs are a class of non-deterministic algorithms that derive from Darwinian theories of evolution. They provide good, though not necessarily optimal solutions to combinatorial optimisation problems, where the number of possible solutions is far too great for all of the possibilities to be explored in a reasonable time by a deterministic algorithm. …”
Get full text
Article