全文获取类型
收费全文 | 9278篇 |
免费 | 1242篇 |
国内免费 | 374篇 |
专业分类
化学 | 841篇 |
晶体学 | 16篇 |
力学 | 1101篇 |
综合类 | 330篇 |
数学 | 5597篇 |
物理学 | 3009篇 |
出版年
2024年 | 22篇 |
2023年 | 97篇 |
2022年 | 311篇 |
2021年 | 296篇 |
2020年 | 201篇 |
2019年 | 222篇 |
2018年 | 242篇 |
2017年 | 357篇 |
2016年 | 464篇 |
2015年 | 308篇 |
2014年 | 565篇 |
2013年 | 635篇 |
2012年 | 510篇 |
2011年 | 556篇 |
2010年 | 445篇 |
2009年 | 593篇 |
2008年 | 619篇 |
2007年 | 627篇 |
2006年 | 489篇 |
2005年 | 452篇 |
2004年 | 392篇 |
2003年 | 329篇 |
2002年 | 302篇 |
2001年 | 268篇 |
2000年 | 235篇 |
1999年 | 202篇 |
1998年 | 190篇 |
1997年 | 167篇 |
1996年 | 136篇 |
1995年 | 109篇 |
1994年 | 74篇 |
1993年 | 82篇 |
1992年 | 74篇 |
1991年 | 38篇 |
1990年 | 46篇 |
1989年 | 28篇 |
1988年 | 32篇 |
1987年 | 23篇 |
1986年 | 30篇 |
1985年 | 29篇 |
1984年 | 29篇 |
1983年 | 9篇 |
1982年 | 18篇 |
1981年 | 6篇 |
1980年 | 5篇 |
1979年 | 7篇 |
1978年 | 4篇 |
1977年 | 5篇 |
1959年 | 5篇 |
1957年 | 2篇 |
排序方式: 共有10000条查询结果,搜索用时 31 毫秒
161.
162.
163.
164.
An augmented Lagrange algorithm for nonlinear optimizations with second-order cone constraints is proposed based on a Löwner operator associated with a potential function for the optimization problems with inequality constraints. The favorable properties of both the Löwner operator and the corresponding augmented Lagrangian are discussed. And under some mild assumptions, the rate of convergence of the augmented Lagrange algorithm is studied in detail. 相似文献
165.
We make a high-precision Monte Carlo study of two- and three-dimensional self-avoiding walks (SAWs) of length up to 80,000 steps, using the pivot algorithm and the Karp-Luby algorithm. We study the critical exponentsv and 2
4 – as well as several universal amplitude ratios; in particular, we make an extremely sensitive test of the hyperscaling relationdv = 2
4 –. In two dimensions, we confirm the predicted exponentv=3/4 and the hyperscaling relation; we estimate the universal ratios <R
g
2
>/<R
e
2
>=0.14026±0.00007, <R
m
2
>/<R
e
2
>=0.43961±0.00034, and *=0.66296±0.00043 (68% confidence limits). In three dimensions, we estimatev=0.5877±0.0006 with a correctionto-scaling exponent
1=0.56±0.03 (subjective 68% confidence limits). This value forv agrees excellently with the field-theoretic renormalization-group prediction, but there is some discrepancy for
1. Earlier Monte Carlo estimates ofv, which were 0.592, are now seen to be biased by corrections to scaling. We estimate the universal ratios <R
g
2
>/<R
e
2
>=0.1599±0.0002 and *=0.2471±0.0003; since *>0, hyperscaling holds. The approach to * is from above, contrary to the prediction of the two-parameter renormalization-group theory. We critically reexamine this theory, and explain where the error lies. In an appendix, we prove rigorously (modulo some standard scaling assumptions) the hyperscaling relationdv = 2
4 – for two-dimensional SAWs. 相似文献
166.
黄干平 《武汉大学学报(理学版)》1994,(1)
并行“冒泡”排序算法的改进黄干平(武汉大学计算机科学系,武汉,430072)关键词排序,并行算法,冒泡中国法分类号w301.6PBSM并行排序算法是对KazuhirsSado和YoshihideIgarash的并行“冒泡’书r序算法’“的改进,其并行... 相似文献
167.
The linear complementarity problem is to find nonnegative vectors which are affinely related and complementary. In this paper we propose a new complementary pivoting algorithm for solving the linear complementarity problem as a more efficient alternative to the algorithms proposed by Lemke and by Talman and Van der Heyden. The algorithm can start at an arbitrary nonnegative vector and converges under the same conditions as Lemke's algorithm.This research is part of the VF-program Competition and Cooperation. 相似文献
168.
The linear ordering problem is an NP-hard combinatorial problem with a large number of applications. Contrary to another very popular problem from the same category, the traveling salesman problem, relatively little space in the literature has been devoted to the linear ordering problem so far. This is particularly true for the question of developing good heuristic algorithms solving this problem.In the paper we propose a new heuristic algorithm solving the linear ordering problem. In this algorithm we made use of the sorting through insertion pattern as well as of the operation of permutation reversal. The surprisingly positive effect of the reversal operation, justified in part theoretically and confirmed in computational examples, seems to be the result of a unique property of the problem, called in the paper the symmetry of the linear ordering problem. This property consists in the fact that if a given permutation is an optimal solution of the problem with the criterion function being maximized, then the reversed permutation is a solution of the problem with the same criterion function being minimized. 相似文献
169.
We show that an ε-approximate solution of the cost-constrainedK-commodity flow problem on anN-nodeM-arc network,G can be computed by sequentially solving O(K(? ?2+logGK) logGM log (G? ?1 GK)) single-commodity minimum-cost flow problems on the same network. In particular, an approximate minimum-cost multicommodity flow can be computed in $\tilde O$ (G? ?2 GKNM) running time, where the notation Õ(·) means “up to logarithmic factors”. This result improves the time bound mentioned by Grigoriadis and Khachiyan [4] by a factor ofM/N and that developed more recently by Karger and Plotkin [8] by a factor of? ?1. We also provide a simple $\tilde O$ (NM)-time algorithm for single-commodity budget-constrained minimum-cost flows which is $\tilde O$ (? ?3) times faster than the algorithm developed in the latter paper. 相似文献
170.
For a stochastic matrix (Q
ij
T
)
i,j=1
M
withQ
ij
T
exp(–U(ij)/T) at the off-diagonal positions, we develop an algorithm to evaluate the asymptotic convergence rate of all eigenvalues ofQ
ij
T
asT 0 using Ventcel's optimal graphs. As an application we can compare the convergence rates of some random updating schemes used in image processing.This research was partially supported by the National Science Council, Taiwan and Air Force Office of Scientific Research Contract No. F49620 S5C 0144, and was completed while Tzuu-Shuh Chiang was visiting the Center for Stochastic Processes, Department of Statistics, University of North Carolina, Chapel Hill, NC 27599-3260, USA. 相似文献