全文获取类型
收费全文 | 8074篇 |
免费 | 664篇 |
国内免费 | 536篇 |
专业分类
化学 | 1237篇 |
晶体学 | 12篇 |
力学 | 343篇 |
综合类 | 246篇 |
数学 | 5378篇 |
物理学 | 2058篇 |
出版年
2024年 | 10篇 |
2023年 | 61篇 |
2022年 | 187篇 |
2021年 | 245篇 |
2020年 | 188篇 |
2019年 | 218篇 |
2018年 | 226篇 |
2017年 | 307篇 |
2016年 | 321篇 |
2015年 | 241篇 |
2014年 | 440篇 |
2013年 | 657篇 |
2012年 | 350篇 |
2011年 | 410篇 |
2010年 | 361篇 |
2009年 | 439篇 |
2008年 | 499篇 |
2007年 | 530篇 |
2006年 | 421篇 |
2005年 | 385篇 |
2004年 | 326篇 |
2003年 | 331篇 |
2002年 | 286篇 |
2001年 | 254篇 |
2000年 | 210篇 |
1999年 | 203篇 |
1998年 | 197篇 |
1997年 | 136篇 |
1996年 | 138篇 |
1995年 | 102篇 |
1994年 | 79篇 |
1993年 | 60篇 |
1992年 | 55篇 |
1991年 | 46篇 |
1990年 | 35篇 |
1989年 | 27篇 |
1988年 | 38篇 |
1987年 | 28篇 |
1986年 | 22篇 |
1985年 | 34篇 |
1984年 | 35篇 |
1983年 | 20篇 |
1982年 | 27篇 |
1981年 | 15篇 |
1980年 | 14篇 |
1979年 | 13篇 |
1978年 | 10篇 |
1976年 | 11篇 |
1975年 | 6篇 |
1973年 | 5篇 |
排序方式: 共有9274条查询结果,搜索用时 15 毫秒
51.
We study the number of determining modes necessary for continuous data assimilation in the two-dimensional incompressible Navier–Stokes equations. Our focus is on how the spatial structure of the body forcing affects the rate of continuous data assimilation and the number of determining modes. We treat this problem analytically by proving a convergence result depending on the H
–1 norm of f and computationally by considering a family of forcing functions with identical Grashof numbers that are supported on different annuli in Fourier space. The rate of continuous data assimilation and the number of determining modes is shown to depend strongly on the length scales present in the forcing. 相似文献
52.
Nobuyuki Hanaki 《Complexity》2004,9(5):41-50
This article seeks to ascertain whether the strategy‐learning model of Hanaki, Sethi, Erev, and Peterhansl (2003) better accounts for observed behavior than do the various action‐learning models. It does so by measuring the goodness‐of‐fit of the models' predictions against published experimental results for such games as Coordination, Prisoner's Dilemma, and Chicken. The fit is measured via the mean squared deviation (MSD) between the observed behavior and the one predicted by the model. The results show that, for Chicken, the strategy‐learning model fits the observed data much better than do the action‐learning models. The best action‐learning model, on the other hand, fits the observed data well in Coordination. Overall, the strength of the strategy‐learning model is best shown in games where alternations between the two stage‐game Nash equilibria are often observed in the laboratory experiments. © 2004 Wiley Periodicals, Inc. Complexity 9: 41–50, 2004 相似文献
53.
Telecommunications systems have recently undergone significant innovations. These call for suitable statistical models that can properly describe the behaviour of the input traffic in a network. Here we use fractional Brownian motion (FBM) to model cumulative traffic network, thus taking into account the possible presence of long‐range dependence in the data. A Bayesian approach is devised in such a way that we are able to: (a) estimate the Hurst parameter H of the FBM; (b) estimate the overflow probability which is a parameter measuring the quality of service of a network: (c) develop a test for comparing the null hypothesis of long‐range dependence in the data versus the alternative of short‐range dependence. In order to achieve these inferential results, we elaborate an MCMC sampling scheme whose output enables us to obtain an approximation of the quantities of interest. An application to three real datasets, corresponding to three different levels of traffic, is finally considered. Copyright © 2004 John Wiley & Sons, Ltd. 相似文献
54.
Let a text of u characters over an alphabet of size σ be compressible to n phrases by the LZ78 algorithm. We show how to build a data structure based on the Ziv–Lempel trie, called the LZ-index, that takes 4nlog2n(1+o(1)) bits of space (that is, 4 times the entropy of the text for ergodic sources) and reports the R occurrences of a pattern of length m in worst case time O(m3logσ+(m+R)logn). We present a practical implementation of the LZ-index, which is faster than current alternatives when we take into consideration the time to report the positions or text contexts of the occurrences found. 相似文献
55.
Dmitry Dolgopyat 《Transactions of the American Mathematical Society》2004,356(4):1637-1689
We consider a large class of partially hyperbolic systems containing, among others, affine maps, frame flows on negatively curved manifolds, and mostly contracting diffeomorphisms. If the rate of mixing is sufficiently high, the system satisfies many classical limit theorems of probability theory.
56.
Using the iterative scheme we prove the local existence and uniqueness of solutions of the spherically symmetric Einstein-Vlasov-Maxwell system with small initial data. We prove a continuation criterion to global in-time solutions. 相似文献
57.
吴炯圻 《纯粹数学与应用数学》2003,19(3):206-212
在平面上以直径为d(d>0)的正M边形为基本集(M≥3为整数),构造压缩比为1∶k(k为不小于M的实数)的广义Sierpinski地毯,并用初等方法计算出它的Hausdorff测度为ds,其中s=logkM. 相似文献
58.
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. 相似文献
59.
K-强凸空间的一些性质 总被引:4,自引:0,他引:4
结合Banach空间的Drop性,利用K维体积给出了K—强凸空间的一个新的定义,同时也给出了K—强光滑空间定义的K维体积表示,然后利用单位圆的切片证明了K—强凸空间是自反空间,进而证明了K—强凸空间与K—强光滑空间是一对对偶空间.最后利用Drop性的切片描述证明了K—强凸空间具有Drop性. 相似文献
60.
Shui Cao ZHENG Huo Nan LIN Di He HU 《数学学报(英文版)》2005,21(5):1137-1148
In this paper, we investigate the Hausdorff measure for level sets of N-parameter Rd-valued stable processes, and develop a means of seeking the exact Hausdorff measure function for level sets of N-parameter Rd-valued stable processes. We show that the exact Hausdorff measure function of level sets of N-parameter Rd-valued symmetric stable processes of index α is Ф(r) = r^N-d/α (log log l/r)d/α when Nα 〉 d. In addition, we obtain a sharp lower bound for the Hausdorff measure of level sets of general (N, d, α) strictly stable processes. 相似文献