全文获取类型
收费全文 | 3014篇 |
免费 | 44篇 |
国内免费 | 37篇 |
专业分类
化学 | 1669篇 |
晶体学 | 17篇 |
力学 | 98篇 |
数学 | 626篇 |
物理学 | 685篇 |
出版年
2018年 | 25篇 |
2016年 | 38篇 |
2015年 | 32篇 |
2014年 | 39篇 |
2013年 | 141篇 |
2012年 | 85篇 |
2011年 | 85篇 |
2010年 | 59篇 |
2009年 | 67篇 |
2008年 | 77篇 |
2007年 | 92篇 |
2006年 | 95篇 |
2005年 | 99篇 |
2004年 | 90篇 |
2003年 | 81篇 |
2002年 | 82篇 |
2001年 | 70篇 |
2000年 | 73篇 |
1999年 | 51篇 |
1998年 | 44篇 |
1997年 | 53篇 |
1996年 | 49篇 |
1995年 | 59篇 |
1994年 | 43篇 |
1993年 | 48篇 |
1992年 | 34篇 |
1991年 | 50篇 |
1990年 | 35篇 |
1989年 | 46篇 |
1988年 | 39篇 |
1987年 | 49篇 |
1986年 | 39篇 |
1985年 | 54篇 |
1984年 | 52篇 |
1983年 | 41篇 |
1982年 | 53篇 |
1981年 | 38篇 |
1980年 | 46篇 |
1979年 | 58篇 |
1978年 | 42篇 |
1977年 | 43篇 |
1976年 | 38篇 |
1975年 | 41篇 |
1974年 | 33篇 |
1973年 | 40篇 |
1972年 | 33篇 |
1970年 | 27篇 |
1968年 | 35篇 |
1967年 | 62篇 |
1966年 | 68篇 |
排序方式: 共有3095条查询结果,搜索用时 15 毫秒
1.
2.
Let A be a symmetric matrix of size n×n with entries in some (commutative) field K. We study the possibility of decomposing A into two blocks by conjugation by an orthogonal matrix T∈Matn(K). We say that A is absolutely indecomposable if it is indecomposable over every extension of the base field. If K is formally real then every symmetric matrix A diagonalizes orthogonally over the real closure of K. Assume that K is a not formally real and of level s. We prove that in Matn(K) there exist symmetric, absolutely indecomposable matrices iff n is congruent to 0, 1 or −1 modulo 2s. 相似文献
3.
Jaime Keller 《International Journal of Theoretical Physics》1991,30(2):137-184
From the definition of spinors as the minimal left (right) modules of multivectors (that is, of vectors and their outer products), we can construct a unified mathematical approach for the study of matter and its interaction fields, which are either defined as fields in the geometrical spacetime or considered as generators of the physical spacetime. It is also shown how matter and interaction fields can be represented either by spinor fields or by multivector fields, both types of fields carrying the same information as the traditional corresponding spinors, vectors, or tensors. Geometry is more transparent in one representation (multivector form), and physics is more obvious in the spinor representation. Our theory provides a unified and totally self-consistent representation of quarks (barions), leptons, and all their known interactions. 相似文献
4.
Quiver Hopf algebras 总被引:1,自引:0,他引:1
In this paper we study subHopfalgebras of graded Hopf algebra structures on a path coalgebra kQc. We prove that a Hopf structure on some subHopfquivers can be lifted to a Hopf structure on the whole Hopf quiver. If Q is a Schurian Hopf quiver, then we classified all simple-pointed subHopfalgebras of a graded Hopf structure on kQc. We also prove a dual Gabriel theorem for pointed Hopf algebras. 相似文献
5.
Keller Teichmann Hans Pfeiffer W. Langenbeck A. Reid Heinrich Menzel Th. Höpner W. Mühlsteph M. Ulmann Geib R. E. Liesegang 《Colloid and polymer science》1939,87(1):100-104
Ohne Zusammenfassung 相似文献
6.
7.
The effect of viscous dissipation on the development of the boundary layer flow from a cold vertical surface embedded in a Darcian porous medium is investigated. It is found that the flow evolves gradually from the classical Cheng–Minkowycz form to the recently discovered asymptotic dissipation profile which is a parallel flow. 相似文献
8.
Alvim Adriana C.F. Ribeiro Celso C. Glover Fred Aloise Dario J. 《Journal of Heuristics》2004,10(2):205-229
We propose in this work a hybrid improvement procedure for the bin packing problem. This heuristic has several features: the use of lower bounding strategies; the generation of initial solutions by reference to the dual min-max problem; the use of load redistribution based on dominance, differencing, and unbalancing; and the inclusion of an improvement process utilizing tabu search. Encouraging results have been obtained for a very wide range of benchmark instances, illustrating the robustness of the algorithm. The hybrid improvement procedure compares favourably with all other heuristics in the literature. It improved the best known solutions for many of the benchmark instances and found the largest number of optimal solutions with respect to the other available approximate algorithms. 相似文献
9.
10.