全文获取类型
收费全文 | 5135篇 |
免费 | 118篇 |
国内免费 | 37篇 |
专业分类
化学 | 3470篇 |
晶体学 | 36篇 |
力学 | 121篇 |
数学 | 810篇 |
物理学 | 853篇 |
出版年
2022年 | 32篇 |
2021年 | 46篇 |
2020年 | 64篇 |
2019年 | 50篇 |
2018年 | 48篇 |
2017年 | 49篇 |
2016年 | 87篇 |
2015年 | 92篇 |
2014年 | 91篇 |
2013年 | 218篇 |
2012年 | 254篇 |
2011年 | 305篇 |
2010年 | 143篇 |
2009年 | 117篇 |
2008年 | 289篇 |
2007年 | 255篇 |
2006年 | 294篇 |
2005年 | 263篇 |
2004年 | 219篇 |
2003年 | 189篇 |
2002年 | 208篇 |
2001年 | 89篇 |
2000年 | 70篇 |
1999年 | 69篇 |
1998年 | 74篇 |
1997年 | 58篇 |
1996年 | 63篇 |
1995年 | 60篇 |
1994年 | 63篇 |
1993年 | 61篇 |
1992年 | 55篇 |
1991年 | 49篇 |
1990年 | 46篇 |
1989年 | 54篇 |
1988年 | 47篇 |
1987年 | 37篇 |
1986年 | 37篇 |
1985年 | 69篇 |
1984年 | 71篇 |
1983年 | 54篇 |
1982年 | 75篇 |
1981年 | 83篇 |
1980年 | 64篇 |
1979年 | 55篇 |
1978年 | 56篇 |
1977年 | 45篇 |
1976年 | 69篇 |
1975年 | 50篇 |
1974年 | 44篇 |
1973年 | 44篇 |
排序方式: 共有5290条查询结果,搜索用时 15 毫秒
1.
Clifford Henry Taubes 《Communications in Mathematical Physics》1989,122(3):455-526
A proof is given of Witten's conjectures for the rigidity of the index of the Dirac-Ramond operator on the loop space of a spin manifold which admits anS
1 symmetry.Research supported in part by the National Science Foundation 相似文献
2.
Henry P. McKean 《纯数学与应用数学通讯》2003,56(5):638-680
3.
We establish upper and lower bounds for the metric entropy and bracketing entropy of the class of d-dimensional bounded monotonic functions under Lp norms. It is interesting to see that both the metric entropy and bracketing entropy have different behaviors for p<d/(d-1) and p>d/(d-1). We apply the new bounds for bracketing entropy to establish a global rate of convergence of the MLE of a d-dimensional monotone density. 相似文献
4.
Jon Wilkening 《Linear algebra and its applications》2007,427(1):6-25
We present an efficient algorithm for obtaining a canonical system of Jordan chains for an n × n regular analytic matrix function A(λ) that is singular at the origin. For any analytic vector function b(λ), we show that each term in the Laurent expansion of A(λ)−1b(λ) may be obtained from the previous terms by solving an (n + d) × (n+d) linear system, where d is the order of the zero of det A(λ) at λ = 0. The matrix representing this linear system contains A(0) as a principal submatrix, which can be useful if A(0) is sparse. The last several iterations can be eliminated if left Jordan chains are computed in addition to right Jordan chains. The performance of the algorithm in floating point and exact (rational) arithmetic is reported for several test cases. The method is shown to be forward stable in floating point arithmetic. 相似文献
5.
6.
Ronald H. Nickel Igor Mikolic-Torreira Jon W. Tolle 《Computational Optimization and Applications》2006,35(1):109-126
Deployed US Navy aircraft carriers must stock a large number of spare parts to support the various types of aircraft embarked
on the ship. The sparing policy determines the spares that will be stocked on the ship to keep the embarked aircraft ready
to fly. Given a fleet of ten or more aircraft carriers and a cost of approximately 50 million dollars per carrier plus the
cost of spares maintained in warehouses in the United States, the sparing problem constitutes a significant portion of the
Navy’s resources. The objective of this work is to find a minimum-cost sparing policy that meets the readiness requirements
of the embarked aircraft. This is a very large, nonlinear, integer optimization problem. The cost function is piecewise linear
and convex while the constraint mapping is highly nonlinear. The distinguishing characteristics of this problem from an optimization
viewpoint are that a large number of decision variables are required to be integer and that the nonlinear constraint functions
are essentially “black box” functions; that is, they are very difficult (and expensive) to evaluate and their derivatives
are not available. Moreover, they are not convex. Integer programming problems with a large number of variables are difficult
to solve in general and most successful approaches to solving nonlinear integer problems have involved linear approximation
and relaxation techniques that, because of the complexity of the constraint functions, are inappropriate for attacking this
problem. We instead employ a pattern search method to each iteration of an interior point-type algorithm to solve the relaxed
version of the problem. From the solution found by the pattern search on each interior point iteration, we begin another pattern
search on the integer lattice to find a good integer solution. The best integer solution found across all interations is returned
as the optimal solution. The pattern searches are distributed across a local area network of non-dedicated, heterogeneous
computers in an office environment, thus, drastically reducing the time required to find the solution. 相似文献
7.
In this paper we study random orderings of the integers with a certain invariance property. We describe all such orders in a simple way. We define and represent random shuffles of a countable set of labels and then give an interpretation of these orders in terms of a class of generalized riffle shuffles. 相似文献
8.
Justina Grabowska Karuna Kar Nanda R.T. Rajendra Kumar J.P. Mosnier M.O. Henry Simon B. Newcomb Patrick McNally Lisa OReilly Xu Lu Enda McGlynn 《Superlattices and Microstructures》2007,42(1-6):327
Self-organized ZnAl2O4 nanostructures with the appearance (in SEM) of high aspect ratio horizontal nanowires are grown on uncatalysed c-sapphire by vapour phase transport. The nanostructures grow as three equivalent crystallographic variants on c-sapphire. Raman and cathodoluminescence spectroscopy confirm that the nanostructures are not ZnO and TEM shows that they are the cubic spinel, zinc aluminate, ZnAl2O4, formed by the reaction of Zn and O with the sapphire substrate. 相似文献
9.
10.