搜索结果: 1-15 共查到“知识库 理学 degree”相关记录93条 . 查询时间(0.319 秒)
Computing the minimum stability degree of parameter-dependent linear systems
Parameters related to linear system program control system the branch and bound algorithm is calculated
2015/8/12
For linear systems with unspecified parameters that lie between given upper and lower bounds, we present a branch and bound algorithm that computes the minimum stability degree.
Branch-and-bound algorithm for computing the minimum stability degree of parameter-dependent linear systems
Branch and bound algorithm linear systems a robust nonlinear and linear system stability the parameters of linear system
2015/8/12
We consider linear systems with unspecified parameters that lie between given upper and lower bounds. Except for a few special cases, the computation of many quantities of interest for such systems ca...
RANDOM GRAPHS WITH A GIVEN DEGREE SEQUENCE。
Degree bounds for polynomial verification of the matrix cube
matrix cube polynomial verification
2015/6/19
In this paper we consider the problem of how to computationally test whether a matrix inequality is positive semidefinite on a semialgebraic set. We propose a family of sufficient conditions using the...
AzTEC half square degree survey of the SHADES fields - I. Maps, catalogues and source counts
hydrodynamical models galaxy formation
2014/12/20
We present the first results from the largest deep extragalactic mm-wavelength survey undertaken to date. These results are derived from maps covering over 0.7 deg2, made at λ= 1.1 mm, using the AzTEC...
The three-state toric homogeneous Markov chain model has Markov degree two
three-state toric Markov chain model Markov degree two Statistics Theory
2012/7/9
We prove that the three-state toric homogenous Markov chain model has Markov degree two. In algebraic terminology, that a certain class of toric ideals are generated by quadratic binomials. This was c...
Combined degree and connectivity conditions for H-linked graphs
Combined degree connectivity conditions H-linked graphs Combinatorics
2012/6/27
For a given multigraph H, a graph G is H-linked, if |G| \geq |H| and for every injective map {\tau}: V (H) \rightarrow V (G), we can find internally disjoint paths in G, such that every edge from uv i...
This note deals with the relationship between the total number of $k$-walks in a graph, and the sum of the $k$-th powers of its vertex degrees. In particular, it is shown that the the number of all $k...
Counting independent sets of a fixed size in graphs with a given minimum degree
graphs given minimum degree independent sets Combinatorics
2012/4/16
Galvin showed that for all fixed $\delta$ and sufficiently large $n$, the $n$-vertex graph with minimum degree $\delta$ that admits the most independent sets is the complete bipartite graph $K_{\delta...
Identifying edge clusters in networks via edge graphlet degree vectors (edge-GDVs) and edge-GDV-similarities
Identifying edge clusters networks edge graphlet degree vectors (edge-GDVs) edge-GDV-similarities
2012/4/28
Inference of new biological knowledge, e.g., prediction of protein function, from protein-protein interaction (PPI) networks has received attention in the post-genomic era. A popular strategy has been...
Stability of tautological bundles on the degree two Hilbert scheme of surfaces
moduli spaces irreducible holomorphic symplectic manifolds K3 surfaces
2012/3/1
Let (X,H) be a polarized smooth projective surface satisfying H^1(X,O_X)=0 and let F be either a rank one torsion-free sheaf or a rank two {\mu}H-stable vector bundle on X. Assume that c_1(F)/=0. In t...
Research on the Relief Degree of Land Surface (RDLS) Calibration Coefficient of Highway in Plateau Mountainous Area
Least Square Method (LSM) RDLS RDLS Calibration Coefficient Regression Model Traffic Engineering
2011/12/20
Different reasons leaded to highway circuitous between plateau mountainous area and plain lightly undulate area were analyzed. The main reason which leaded to highway circuitous is the RDLS was conclu...
Finiteness of nonzero degree maps between three-manifolds
Finiteness of nonzero degree maps three-manifolds Geometric Topology
2011/9/22
Abstract: In this paper, we prove that every orientable closed 3-manifold dominates at most finitely many homeomorphically distinct irreducible non-geometric 3-manifolds. Moreover, for any integer $d>...
Maximum spectral radius of graphs with given connectivity and minimum degree
connectivity spectral radius Combinatorics
2011/9/21
Abstract: Shiu, Chan and Chang [On the spectral radius of graphs with connectivity at most $k$, J. Math. Chem., 46 (2009), 340-346] studied the spectral radius of graphs of order $n$ with $\kappa(G) \...
On a Greedy 2-Matching Algorithm and Hamilton Cycles in Random Graphs with Minimum Degree at Least Three
Greedy 2-Matching Algorithm Hamilton Cycles Random Graphs Minimum Degree
2011/9/20
Abstract: We describe and analyse a simple greedy algorithm \2G\ that finds a good 2-matching $M$ in the random graph $G=G_{n,cn}^{\d\geq 3}$ when $c\geq 15$. A 2-matching is a spanning subgraph of ma...