全文获取类型
收费全文 | 918篇 |
免费 | 57篇 |
国内免费 | 49篇 |
学科分类
数理化 | 1024篇 |
出版年
2024年 | 3篇 |
2023年 | 4篇 |
2022年 | 12篇 |
2021年 | 17篇 |
2020年 | 26篇 |
2019年 | 32篇 |
2018年 | 31篇 |
2017年 | 22篇 |
2016年 | 21篇 |
2015年 | 18篇 |
2014年 | 31篇 |
2013年 | 67篇 |
2012年 | 31篇 |
2011年 | 34篇 |
2010年 | 40篇 |
2009年 | 72篇 |
2008年 | 75篇 |
2007年 | 88篇 |
2006年 | 68篇 |
2005年 | 33篇 |
2004年 | 30篇 |
2003年 | 31篇 |
2002年 | 44篇 |
2001年 | 30篇 |
2000年 | 29篇 |
1999年 | 21篇 |
1998年 | 21篇 |
1997年 | 15篇 |
1996年 | 13篇 |
1995年 | 6篇 |
1994年 | 7篇 |
1993年 | 6篇 |
1992年 | 11篇 |
1991年 | 4篇 |
1990年 | 3篇 |
1989年 | 3篇 |
1988年 | 1篇 |
1987年 | 2篇 |
1986年 | 1篇 |
1985年 | 3篇 |
1984年 | 2篇 |
1982年 | 4篇 |
1981年 | 3篇 |
1980年 | 2篇 |
1979年 | 2篇 |
1978年 | 1篇 |
1977年 | 1篇 |
1975年 | 2篇 |
1973年 | 1篇 |
排序方式: 共有1024条查询结果,搜索用时 218 毫秒
51.
Norbert Polat 《Czechoslovak Mathematical Journal》2001,51(3):477-492
For an end and a tree T of a graph G we denote respectively by m() and m
T
() the maximum numbers of pairwise disjoint rays of G and T belonging to , and we define tm() := min{m
T(): T is a spanning tree of G}. In this paper we give partial answers — affirmative and negative ones — to the general problem of determining if, for a function f mapping every end of G to a cardinal f() such that tm() f() m(), there exists a spanning tree T of G such that m
T
() = f() for every end of G. 相似文献
52.
The Hardy operator Ta on a tree is defined by Properties of Ta as a map from Lp() into itselfare established for 1 p . The main result is that, with appropriateassumptions on u and v, the approximation numbers an(Ta) ofTa satisfy for a specified constant p and 1 p < . This extends results of Naimark, Newmanand Solomyak for p = 2. Hitherto, for p 2, (*) was unknowneven when is an interval. Also, upper and lower estimates forthe lq and weak-lq norms of an(Ta) are determined. 2000 MathematicalSubject Classification: 47G10, 47B10. 相似文献
53.
Spiros A. Argyros 《Proceedings of the American Mathematical Society》2001,129(11):3231-3239
It is shown that every separable Banach space universal for the class of reflexive Hereditarily Indecomposable space contains isomorphically and hence it is universal for all separable spaces. This result shows the large variety of reflexive H.I. spaces.
54.
Hans H. Brungs Joachim Grä ter 《Transactions of the American Mathematical Society》2000,352(7):3357-3379
A subring of a division algebra is called a valuation ring of if or holds for all nonzero in . The set of all valuation rings of is a partially ordered set with respect to inclusion, having as its maximal element. As a graph is a rooted tree (called the valuation tree of ), and in contrast to the commutative case, may have finitely many but more than one vertices. This paper is mainly concerned with the question of whether each finite, rooted tree can be realized as a valuation tree of a division algebra , and one main result here is a positive answer to this question where can be chosen as a quaternion division algebra over a commutative field.
55.
T. S. Evans 《The European Physical Journal B - Condensed Matter and Complex Systems》2007,56(1):65-69
Evolving networks with a constant number of edges may be
modelled using a rewiring process. These models are used to
describe many real-world processes including the evolution of
cultural artifacts such as family names, the evolution of gene
variations, and the popularity of strategies in simple
econophysics models such as the minority game. The model is
closely related to Urn models used for glasses, quantum gravity
and wealth distributions. The full mean field equation for the
degree distribution is found and its exact solution and generating
solution are given. 相似文献
56.
Zhongzhi Zhang Shuigeng Zhou Lichao Chen Jihong Guan Lujun Fang Yichao Zhang 《The European Physical Journal B - Condensed Matter and Complex Systems》2007,59(1):99-107
We propose a geometric growth model for weighted
scale-free networks, which is controlled by two tunable parameters.
We derive exactly the main characteristics of the networks, which
are partially determined by the parameters. Analytical results
indicate that the resulting networks have power-law distributions of
degree, strength, weight and betweenness, a scale-free behavior for
degree correlations, logarithmic small average path length and
diameter with network size. The obtained properties are in agreement
with empirical data observed in many real-life networks, which shows
that the presented model may provide valuable insight into the real
systems. 相似文献
57.
Inevitable self-similar topology of binary trees and their diverse hierarchical density 总被引:1,自引:0,他引:1
K. Paik P. Kumar 《The European Physical Journal B - Condensed Matter and Complex Systems》2007,60(2):247-258
Self-similar topology, which can be characterized
as power law size distribution, has been found in diverse tree
networks ranging from river networks to taxonomic trees. In this
study, we find that the statistical self-similar topology is an
inevitable consequence of any full binary tree organization. We show
this by coding a binary tree as a unique bifurcation string. This
coding scheme allows us to investigate trees over the realm from
deterministic to entirely random trees. To obtain partial random
trees, partial random perturbation is added to the deterministic
trees by an operator similar to that used in genetic algorithms. Our
analysis shows that the hierarchical density of binary trees is more
diverse than has been described in earlier studies. We find that the
connectivity structure of river networks is far from strict
self-similar trees. On the other hand, organization of some social
networks is close to deterministic supercritical trees. 相似文献
58.
This paper investigates the topological properties of the Brazilian term structure of interest rates network. We build the minimum spanning tree (MST), which is based on the concept of ultrametricity, using the correlation matrix for interest rates of different maturities. We show that the short-term interest rate is the most important within the interest rates network, which is in line with the Expectation Hypothesis of interest rates. Furthermore, we find that the Brazilian interest rates network forms clusters by maturity. 相似文献
59.
60.
The range searching problem is a fundamental problem in computational geometry, with numerous important applications. Most research has focused on solving this problem exactly, but lower bounds show that if linear space is assumed, the problem cannot be solved in polylogarithmic time, except for the case of orthogonal ranges. In this paper we show that if one is willing to allow approximate ranges, then it is possible to do much better. In particular, given a bounded range Q of diameter w and >0, an approximate range query treats the range as a fuzzy object, meaning that points lying within distance w of the boundary of Q either may or may not be counted. We show that in any fixed dimension d, a set of n points in
can be preprocessed in O(n+logn) time and O(n) space, such that approximate queries can be answered in O(logn(1/)d) time. The only assumption we make about ranges is that the intersection of a range and a d-dimensional cube can be answered in constant time (depending on dimension). For convex ranges, we tighten this to O(logn+(1/)d−1) time. We also present a lower bound for approximate range searching based on partition trees of Ω(logn+(1/)d−1), which implies optimality for convex ranges (assuming fixed dimensions). Finally, we give empirical evidence showing that allowing small relative errors can significantly improve query execution times. 相似文献