搜索结果: 1-15 共查到“理学 covering”相关记录32条 . 查询时间(0.093 秒)
Universal covering spaces and fundamental groups in algebraic geometry as schemes
algebraic geometry fundamental groups
2015/7/14
In topology, the notions of the fundamental group
and the universal cover are closely intertwined. By importing
usual notions from topology into the algebraic and arithmetic setting, we construct a ...
Combinatorics and Statistical Inferencing D-Optimal Experimental Designs with Covering Array Attributes
Combinatorics Statistical Inferencing
2015/3/18
Wh ile D-O p tim al exp er im ental d es ign s ar e u s ed w ith gr eat f r equ en cy in s u r f ace
r es p on s e an alys is th ey als o offer a m ech an is m to s cr een f actor s an d f actor inte...
This paper investigates the impact and potential
use of the cut-cell vertical discretisation for forecasts covering five days and climate simulations.
UNCERTAINTY MANAGEMENT IN SEISMIC VULNERABILITY ASSESSMENT USING GRANULAR COMPUTING BASED ON COVERING OF UNIVERSE
Seismic Vulnerability Assessment Granular Computing Model, Multi Criteria Decision Making
2014/4/24
Earthquake is an abrupt displacement of the earth's crust caused by the discharge of strain collected along faults or by volcanic
eruptions. Earthquake as a recurring natural cataclysm has always be...
The Minor inequalities in the description of the Set Covering Polyhedron of Circulant Matrices
polyhedral combinatorics set covering circulant matrices Combinatorics
2012/6/25
In this work we give a complete description of the set covering polyhedron of circulant matrices $C^k_{sk}$ with $s = 2,3$ and $k\geq 3 $ by linear inequalities. In particular, we prove that every non...
Unknotting numbers and triple point cancelling numbers of torus-covering knots
Surface knot 2-dimensional braid quandle cocycle invariant unknotting number triple point cancelling number
2012/6/21
It is known that any surface knot can be transformed to an unknotted surface knot or a surface knot which has a diagram with no triple points by a finite number of 1-handle additions. The minimum numb...
Topological and uniform structures on universal covering spaces
Universal covering maps uniform structures Algebraic Topology
2012/6/7
We discuss various uniform structures and topologies on the universal covering space $\widetilde X$ and on the fundamental group $\pi_1(X,x_0)$. We introduce a canonical uniform structure $CU(X)$ on a...
Anisotropic covering of fractal sets
Anisotropic covering of fractal sets Pattern Formation and Solitons
2012/4/26
We consider the optimal covering of fractal sets in a two-dimensional space using ellipses which become increasingly anisotropic as their size is reduced. If the semi-minor axis is \epsilon and the se...
Optimal box-covering algorithm for fractal dimension of complex networks
Optimal box-covering algorithm fractal dimension complex networks Computational Physics
2012/4/24
The self-similarity of complex networks is typically investigated through computational algorithms the primary task of which is to cover the structure with a minimal number of boxes. Here we introduce...
Covering Numbers for Convex Functions
Covering Numbers Convex Functions Information Theory
2012/4/17
In this paper we study the covering numbers of the space of convex and uniformly bounded functions in multi-dimension. We find optimal upper and lower bounds for the $\epsilon$-covering number of $\C(...
Covering morphisms of groupoids, derived modules and a 1-dimensional Relative Hurewicz Theorem
Covering morphisms of groupoids derived modules 1-dimensional Relative Hurewicz Theorem
2011/1/21
We fill a lacuna in the literature by giving a version in dimension 1 of the Relative Hurewicz Theorem, and relate this to abelianisations of groupoids, covering spaces,covering morphisms of groupoids...
The main results of this note are:• It is consistent that every subparacompact space X of size !1 is a D-space.
Exact Covering Systems in Number Fields
Exact covering systems Lattice parallelotopes Chinese Remainder Theorem
2011/2/22
It is well known that in an exact covering system in Z, the biggest modulus must be repeated. Very recently, S. Kim proved an analogous result for certain quadratic fields. In this paper, we prove tha...
Generalized covering designs and clique coverings
Generalized covering designs clique coverings
2010/11/22
Inspired by the "generalized t-designs" defined by Cameron [P. J. Cameron, A generalisation of t-designs, Discrete Math. 309 (2009), 4835--4842], we define a new class of combinatorial designs which ...
On the length of chains of proper subgroups covering a topological group
On the length of chains topological group
2010/11/9
We prove that if an ultrafilter L is not coherent to a Q-point, then each analytic non-sigma-bounded topological group G admits an increasing chain of its proper subgroups such that: ...