全文获取类型
收费全文 | 314309篇 |
免费 | 4322篇 |
国内免费 | 1085篇 |
专业分类
化学 | 170947篇 |
晶体学 | 4459篇 |
力学 | 13047篇 |
综合类 | 7篇 |
数学 | 36322篇 |
物理学 | 94934篇 |
出版年
2020年 | 1987篇 |
2019年 | 1966篇 |
2018年 | 1974篇 |
2017年 | 1883篇 |
2016年 | 3877篇 |
2015年 | 3249篇 |
2014年 | 4452篇 |
2013年 | 14027篇 |
2012年 | 10744篇 |
2011年 | 13407篇 |
2010年 | 8289篇 |
2009年 | 8280篇 |
2008年 | 12362篇 |
2007年 | 12610篇 |
2006年 | 12227篇 |
2005年 | 11175篇 |
2004年 | 10050篇 |
2003年 | 8872篇 |
2002年 | 8716篇 |
2001年 | 10117篇 |
2000年 | 7739篇 |
1999年 | 6119篇 |
1998年 | 4896篇 |
1997年 | 4734篇 |
1996年 | 4780篇 |
1995年 | 4366篇 |
1994年 | 4119篇 |
1993年 | 3943篇 |
1992年 | 4435篇 |
1991年 | 4295篇 |
1990年 | 4011篇 |
1989年 | 3831篇 |
1988年 | 4121篇 |
1987年 | 3787篇 |
1986年 | 3679篇 |
1985年 | 5322篇 |
1984年 | 5399篇 |
1983年 | 4380篇 |
1982年 | 4756篇 |
1981年 | 4798篇 |
1980年 | 4546篇 |
1979年 | 4668篇 |
1978年 | 4671篇 |
1977年 | 4646篇 |
1976年 | 4598篇 |
1975年 | 4511篇 |
1974年 | 4359篇 |
1973年 | 4525篇 |
1972年 | 2570篇 |
1971年 | 1880篇 |
排序方式: 共有10000条查询结果,搜索用时 0 毫秒
991.
Hyperfine Interactions - The YFe4Al8 and ErFe4Al8 intermetallics were studied by57Fe Mössbauer spectroscopy between 2 K and room temperature. The spectra are consistent with iron occupying 8f... 相似文献
992.
Some properties of the bilevel programming problem 总被引:8,自引:0,他引:8
J. F. Bard 《Journal of Optimization Theory and Applications》1991,68(2):371-378
The purpose of this paper is to elaborate on the difficulties accompanying the development of efficient algorithms for solving the bilevel programming problem (BLPP). We begin with a pair of examples showing that, even under the best of circumstances, solutions may not exist. This is followed by a proof that the BLPP is NP-hard.This work was partially supported by a grant from the Advanced Research Program of the Texas Higher Education Coordinating Board. 相似文献
993.
J. A. Morrison 《Queueing Systems》1991,9(1-2):191-213
In this paper the steady-state behavior of a closed queueing network with multiple classes and large populations is investigated. One of the two nodes of the network simply introduces random delays and the discipline in the other node is discriminatory processor sharing. The network is not product-form, so not even the steady-state behavior is known. We assume that the usage is moderately heavy, and obtain two-term asymptotic approximations to the mean number of jobs, and the mean sojourn time, of each class of jobs in the processor node. We also obtain the leading term in the asymptotic approximation to the joint distribution of the number of jobs in the processor node, which is a zero-mean multivariate Gaussian distribution around a line through the origin. 相似文献
994.
Manufacturing cell formation using similarity coefficients and a parallel genetic TSP algorithm: Formulation and comparison 总被引:2,自引:0,他引:2
J. BalakrishnanP. D. Jog 《Mathematical and Computer Modelling》1995,21(12):61-73
Many algorithms have been proposed to form manufacturing cells from component routings. However, many of these do not have the capability of solving large problems. We propose a procedure using similarity coefficients and a parallel genetic implementation of a TSP algorithm that is capable of solving large problems of up to 1000 parts and 1000 machines. In addition, we also compare our procedure with many existing procedures using nine well-known problems from the literature.
The results show that the proposed procedure compares well with the existing procedures and should be useful to practitioners and researchers. 相似文献
995.
This note outlines an algorithm for solving the complex ‘matrix Procrustes problem’. This is a least‐squares approximation over the cone of positive semi‐definite Hermitian matrices, which has a number of applications in the areas of Optimization, Signal Processing and Control. The work generalizes the method of Allwright (SIAM J. Control Optim. 1988; 26 (3):537–556), who obtained a numerical solution to the real‐valued version of the problem. It is shown that, subject to an appropriate rank assumption, the complex problem can be formulated in a real setting using a matrix‐dilation technique, for which the method of Allwright is applicable. However, this transformation results in an over‐parametrization of the problem and, therefore, convergence to the optimal solution is slow. Here, an alternative algorithm is developed for solving the complex problem, which exploits fully the special structure of the dilated matrix. The advantages of the modified algorithm are demonstrated via a numerical example. Copyright © 2007 John Wiley & Sons, Ltd. 相似文献
996.
We give several new constructions for moderate rank elliptic curves over Q(T). In particular we construct infinitely many rational elliptic surfaces (not in Weierstrass form) of rank 6 over Q using polynomials of degree two in T. While our method generates linearly independent points, we are able to show the rank is exactly 6 without having to verify the points are independent. The method generalizes; however, the higher rank surfaces are not rational, and we need to check that the constructed points are linearly independent. 相似文献
997.
Joo J.H. Choi J.J. 《IEEE transactions on plasma science. IEEE Nuclear and Plasma Sciences Society》2004,32(6):2263-2264
A new type of microwave amplifier module, consisting of a solid-state amplifier, a predistortion linearizer, and a traveling-wave-tube (TWT), is realized. Measurements show a noise figure of 2.2 dB at 9.5 GHz and the third-order intermodulation distortion ratio of 53 dBc at 10 dB back off from P1 dB point. 相似文献
998.
Genetic algorithms are stochastic search algorithms that have been applied to optimization problems. In this paper we analyze the run-time complexity of a genetic algorithm when we are interested in one of a set of distinguished solutions. One such case occurs when multiple optima exist. We define the worst case scenario and derive a probabilistic worst case bound on the number of iterations required to find one of these multiple solutions of interest. 相似文献
999.
1000.