全文获取类型
收费全文 | 3351篇 |
免费 | 274篇 |
国内免费 | 325篇 |
专业分类
化学 | 195篇 |
晶体学 | 2篇 |
力学 | 110篇 |
综合类 | 57篇 |
数学 | 2845篇 |
物理学 | 741篇 |
出版年
2024年 | 5篇 |
2023年 | 24篇 |
2022年 | 54篇 |
2021年 | 68篇 |
2020年 | 78篇 |
2019年 | 87篇 |
2018年 | 102篇 |
2017年 | 96篇 |
2016年 | 102篇 |
2015年 | 68篇 |
2014年 | 159篇 |
2013年 | 318篇 |
2012年 | 110篇 |
2011年 | 147篇 |
2010年 | 124篇 |
2009年 | 200篇 |
2008年 | 232篇 |
2007年 | 232篇 |
2006年 | 194篇 |
2005年 | 180篇 |
2004年 | 133篇 |
2003年 | 163篇 |
2002年 | 156篇 |
2001年 | 130篇 |
2000年 | 125篇 |
1999年 | 103篇 |
1998年 | 100篇 |
1997年 | 84篇 |
1996年 | 71篇 |
1995年 | 45篇 |
1994年 | 35篇 |
1993年 | 25篇 |
1992年 | 22篇 |
1991年 | 13篇 |
1990年 | 18篇 |
1989年 | 6篇 |
1988年 | 16篇 |
1987年 | 12篇 |
1986年 | 11篇 |
1985年 | 14篇 |
1984年 | 11篇 |
1983年 | 8篇 |
1982年 | 15篇 |
1981年 | 6篇 |
1980年 | 10篇 |
1979年 | 8篇 |
1978年 | 8篇 |
1977年 | 6篇 |
1976年 | 5篇 |
1975年 | 4篇 |
排序方式: 共有3950条查询结果,搜索用时 15 毫秒
11.
Miklós Csörgő 《Periodica Mathematica Hungarica》2005,50(1-2):1-27
Summary This article provides a glimpse of some of the highlights of the joint work of Endre Csáki and Pál Révész since 1979. The topics of this short exploration of the rich stochastic milieu of this inspiring collaboration revolve around Brownian motion, random walks and their long excursions, local times and additive functionals, iterated processes, almost sure local and global central limit theorems, integral functionals of geometric stochastic processes, favourite sites--favourite values and jump sizes for random walk and Brownian motion, random walking in a random scenery, and large void zones and occupation times for coalescing random walks. 相似文献
12.
Kenneth Weber Vilmar Trevisan Luiz Felipe Martins 《Journal of Algorithms in Cognition, Informatics and Logic》2005,54(2):152-167
This paper describes the first algorithm to compute the greatest common divisor (GCD) of two n-bit integers using a modular representation for intermediate values U, V and also for the result. It is based on a reduction step, similar to one used in the accelerated algorithm [T. Jebelean, A generalization of the binary GCD algorithm, in: ISSAC '93: International Symposium on Symbolic and Algebraic Computation, Kiev, Ukraine, 1993, pp. 111–116; K. Weber, The accelerated integer GCD algorithm, ACM Trans. Math. Softw. 21 (1995) 111–122] when U and V are close to the same size, that replaces U by (U−bV)/p, where p is one of the prime moduli and b is the unique integer in the interval (−p/2,p/2) such that . When the algorithm is executed on a bit common CRCW PRAM with O(nlognlogloglogn) processors, it takes O(n) time in the worst case. A heuristic model of the average case yields O(n/logn) time on the same number of processors. 相似文献
13.
本文是[1,12]的继续,研究描述架中概念的结构;本文讨论后半部分,内容涉及概念内涵与外延的转换,清晰关系的内投影与内变换,概念的结构*以及有关问题的注记。 相似文献
14.
In this paper we show that the Boltzmann weights of the three-dimensional Baxter-Bazhanov model give representations of the braid group if some suitable spectral limits are taken. In the trigonometric case we classify all possible spectral limits which produce braid group representations. Furthermore, we prove that for some of them we get cyclotomic invariants of links and for others we obtain tangle invariants generalizing the cyclotomic ones. 相似文献
15.
H. R. Ebrahimi-Vishki M. A. Pourabdollah 《Proceedings of the American Mathematical Society》1997,125(7):2171-2174
The purpose of this paper is to introduce an algebra of functions on a semitopological semigroup and to study these functions from the point of view of universal semigroup compactification. We show that the corresponding semigroup compactification of this algebra is universal with respect to the property of being a nilpotent group.
16.
Héctor J. Sussmann 《Set-Valued Analysis》2002,10(2-3):233-285
It is shown that the construction of needle variations can be carried out for almost lower semicontinuous differential inclusions rather than for the case of ordinary single-valued continuously differentiable vector fields usually considered in the literature. The construction leads to needle variations whose flows are in general set-valued but still have good differentiability properties. The variations are constructed by using single-valued selections that are not necessarily continuous with respect to the state variable, but have instead a much weaker 'integral continuity' property, somewhat more general that the 'directional continuity' considered in previous work by A. Cambini and S. Querci, A. Pucci, and A. Bressan. The existence of many such selections is proved by slightly adapting an argument due to Bressan, extending it from the lower semicontinuous to the almost lower semicontinuous case, and strengthening it to yield not only directional continuity at all points but also full continuity at a specified point. 相似文献
17.
Bing Yong HSIE 《数学学报(英文版)》2006,22(2):507-514
This paper gives a p-adic analogue of the Mackey theory, which relates representations of a group of type G - H × t A to systems of imprimitivity. 相似文献
18.
Rafał Bocian Thorsten Holm Andrzej Skowroński 《Central European Journal of Mathematics》2004,2(1):67-75
Auslander’s representation dimension measures how far a finite dimensional algebra is away from being of finite representation
type. In [1], M. Auslander proved that a finite dimensional algebra A is of finite representation type if and only if the representation dimension of A is at most 2. Recently, R. Rouquier proved that there are finite dimensional algebras of an arbitrarily large finite representation
dimension. One of the exciting open problems is to show that all finite dimensional algebras of tame representation type have
representation dimension at most 3. We prove that this is true for all domestic weakly symmetric algebras over algebraically
closed fields having simply connected Galois coverings. 相似文献
19.
We show that functions which are invariant for suitable product semigroups (one of which is a quasi-Poisson semigroup on a general state space) decompose into a singular eigen-function and a mixture of products of minimal eigen-functions. 相似文献
20.
Algorithm for Optimal Triangulations in Scattered Data Representation and Implementation 总被引:2,自引:0,他引:2
Scattered data collected at sample points may be used to determine simple functions to best fit the data. An ideal choice for these simple functions is bivariate splines. Triangulation of the sample points creates partitions over which the bivariate splines may be defined. But the optimality of the approximation is dependent on the choice of triangulation. An algorithm, referred to as an Edge Swapping Algorithm, has been developed to transform an arbitrary triangulation of the sample points into an optimal triangulation for representation of the scattered data. A Matlab package has been completed that implements this algorithm for any triangulation on a given set of sample points. 相似文献