全文获取类型
收费全文 | 3546篇 |
免费 | 26篇 |
国内免费 | 22篇 |
专业分类
化学 | 44篇 |
晶体学 | 1篇 |
力学 | 38篇 |
综合类 | 9篇 |
数学 | 3005篇 |
物理学 | 78篇 |
综合类 | 419篇 |
出版年
2022年 | 1篇 |
2021年 | 3篇 |
2020年 | 4篇 |
2019年 | 2篇 |
2018年 | 1篇 |
2017年 | 5篇 |
2016年 | 3篇 |
2015年 | 13篇 |
2014年 | 15篇 |
2013年 | 99篇 |
2012年 | 129篇 |
2011年 | 41篇 |
2010年 | 45篇 |
2009年 | 733篇 |
2008年 | 615篇 |
2007年 | 433篇 |
2006年 | 192篇 |
2005年 | 167篇 |
2004年 | 161篇 |
2003年 | 191篇 |
2002年 | 325篇 |
2001年 | 325篇 |
2000年 | 68篇 |
1999年 | 9篇 |
1997年 | 1篇 |
1996年 | 1篇 |
1992年 | 1篇 |
1991年 | 1篇 |
1986年 | 1篇 |
1985年 | 4篇 |
1980年 | 1篇 |
1979年 | 2篇 |
1978年 | 1篇 |
1976年 | 1篇 |
排序方式: 共有3594条查询结果,搜索用时 15 毫秒
81.
For a finite projective plane , let denote the maximum number of classes in a partition of the point set, such that each line has at least two points in the same partition class. We prove that the best possible general estimate in terms of the order of projective planes is , which is tight apart from a multiplicative constant in the third term :
- (1) As holds for every projective plane of order q.
- (2) If q is a square, then the Galois plane of order q satisfies .
82.
We introduce new entropy concepts measuring the size of a given class of increasing sequences of positive integers. Under
the assumption that the entropy function of
is not too large, many strong limit theorems will continue to hold uniformly over all sequences in
. We demonstrate this fact by extending the Chung-Smirnov law of the iterated logarithm on empirical distribution functions
for independent identically distributed random variables as well as for stationary strongly mixing sequences to hold uniformly
over all sequences in
. We prove a similar result for sequences (n
k
ω) mod 1 where the sequence (n
k
) of real numbers satisfies a Hadamard gap condition.
Authors’ addresses: István Berkes, Department of Statistics, Technical University Graz, Steyrergasse 17/IV, A-8010 Graz, Austria;
Walter Philipp, Department of Statistics, University of Illinois, 725 S. Wright Street, Champaign, IL 61820, USA; Robert F.
Tichy, Department of Analysis and Computational Number Theory, Technical University Graz, Steyrergasse 30, A-8010 Graz, Austria 相似文献
83.
Carlo Magagna 《Monatshefte für Mathematik》2008,153(1):59-81
For a positive integer N, we define the N-rank of a non singular integer d × d matrix A to be the maximum integer r such that there exists a minor of order r whose determinant is not divisible by N. Given a positive integer r, we study the growth of the minimum integer k, such that A
k
− I has N-rank at most r, as a function of N. We show that this integer k goes to infinity faster than log N if and only if for every eigenvalue λ which is not a root of unity, the sum of the dimensions of the eigenspaces relative
to eigenvalues which are multiplicatively dependent with λ and are not roots of unity, plus the dimensions of the eigenspaces
relative to eigenvalues which are roots of unity, does not exceed d − r − 1. This result will be applied to recover a recent theorem of Luca and Shparlinski [6] which states that the group of rational
points of an ordinary elliptic curve E over a finite field with q
n
elements is almost cyclic, in a sense to be defined, when n goes to infinity. We will also extend this result to the product of two elliptic curves over a finite field and show that
the orders of the groups of
rational points of two non isogenous elliptic curves are almost coprime when n approaches infinity.
Author’s address: Dipartimento di Matematica e Informatica, Via Delle Scienze 206, 33100 Udine, Italy 相似文献
84.
Bisubmodular functions are a natural “directed”, or “signed”, extension of submodular functions with several applications.
Recently Fujishige and Iwata showed how to extend the Iwata, Fleischer, and Fujishige (IFF) algorithm for submodular function
minimization (SFM) to bisubmodular function minimization (BSFM). However, they were able to extend only the weakly polynomial
version of IFF to BSFM. Here we investigate the difficulty that prevented them from also extending the strongly polynomial
version of IFF to BSFM, and we show a way around the difficulty. This new method gives a somewhat simpler strongly polynomial
SFM algorithm, as well as the first combinatorial strongly polynomial algorithm for BSFM. This further leads to extending
Iwata’s fully combinatorial version of IFF to BSFM.
The research of S. T. McCormick was supported by an NSERC Operating Grant.
The research of S. Fujishige was supported by a Grant-in-Aid of the Ministry of Education, Culture, Science and Technology
of Japan. 相似文献
85.
定义了H~2×R中曲面的法高斯映照,给出了给定平均曲率曲面的Weierstrass表示,证明了法高斯映照满足一个二阶偏微分方程,并且该方程是所得到的Weierstrass表示的完全可积条件. 相似文献
86.
Grooming uniform all‐to‐all traffic in optical (SONET) rings with grooming ratio C requires the determination of a decomposition of the complete graph into subgraphs each having at most C edges. The drop cost of such a grooming is the total number of vertices of nonzero degree in these subgraphs, and the grooming is optimal when the drop cost is minimum. The determination of optimal C‐groomings has been considered for , and completely solved for . For , it has been shown that the lower bound for the drop cost of an optimal C‐grooming can be attained for almost all orders with 5 exceptions and 308 possible exceptions. For , there are infinitely many unsettled orders; especially the case is far from complete. In this paper, we show that the lower bound for the drop cost of a 6‐grooming can be attained for almost all orders by reducing the 308 possible exceptions to 3, and that the lower bound for the drop cost of a 7‐grooming can be attained for almost all orders with seven exceptions and 16 possible exceptions. Moreover, for the unsettled orders, we give upper bounds for the minimum drop costs. 相似文献
87.
针对JPEG2000图像压缩标准所具有的渐进传输、一次编码多次解码等特性,提出了一种基于图像特征的鲁棒性图像认证算法.该算法在JPEG2000编码过程中,先根据图像不变特征,生成认证水印,再根据实际的鲁棒性认证需求,在量化后的小波系数中确定每个子带的认证水印嵌入位平面,最后基于小波系数位平面的特征嵌入认证水印.算法不仅能适应JPEG2000各种灵活的编码方式,还能定位图像篡改的位置.实验结果验证了图像认证算法对可允许图像操作的鲁棒性以及对图像篡改的敏感性. 相似文献
88.
Improved Bounds for Acyclic Job Shop Scheduling 总被引:2,自引:0,他引:2
In acyclic job shop scheduling problems there are n jobs and m machines. Each job is composed of a sequence of operations to be performed on different machines. A legal schedule is one
in which within each job, operations are carried out in order, and each machine performs at most one operation in any unit
of time. If D denotes the length of the longest job, and C denotes the number of time units requested by all jobs on the most loaded machine, then clearly lb = max[C,D] is a lower bound on the length of the shortest legal schedule. A celebrated result of Leighton, Maggs, and Rao shows that
if all operations are of unit length, then there always is a legal schedule of length O(lb), independent of n and m. For the case that operations may have different lengths, Shmoys, Stein and Wein showed that there always is a legal schedule
of length , where the notation is used to suppress terms. We improve the upper bound to . We also show that our new upper bound is essentially best possible, by proving the existence of instances of acyclic job
shop scheduling for which the shortest legal schedule is of length . This resolves (negatively) a known open problem of whether the linear upper bound of Leighton, Maggs, and Rao applies to
arbitrary job shop scheduling instances (without the restriction to acyclicity and unit length operations).
Received June 30, 1998
RID="*"
ID="*" Incumbent of the Joseph and Celia Reskin Career Development Chair
RID="†"
ID="†" Research was done while staying at the Weizmann Institute, supported by a scholarship from the Minerva foundation. 相似文献
89.
We study biorthogonal bases of compactly supported wavelets constructed from box splines in ℝ
N
with any integer dilation factor. For a suitable class of box splines we write explicitly dual low-pass filters of arbitrarily
high regularity and indicate how to construct the corresponding high-pass filters (primal and dual).
Received: August 23, 2000; in final form: March 10, 2001?Published online: May 29, 2002 相似文献
90.
Kevin Houston 《Inventiones Mathematicae》2002,147(3):471-485
The disentanglement of certain augmentations is shown to be the topological join of a disentanglement and a Milnor fibre.
The kth disentanglement of a finite map is defined and for corank 1 maps from ℂ
n
to ℂ
n
+1 it is shown that they are homotopically equivalent to a wedge of spheres. Applications to the Mond conjecture are given.
Oblatum 24-VII-2000 & 5-VII-2001?Published online: 12 October 2001 相似文献