全文获取类型
收费全文 | 7282篇 |
免费 | 1304篇 |
国内免费 | 392篇 |
专业分类
化学 | 1161篇 |
晶体学 | 35篇 |
力学 | 1116篇 |
综合类 | 42篇 |
数学 | 2553篇 |
物理学 | 4071篇 |
出版年
2024年 | 5篇 |
2023年 | 41篇 |
2022年 | 80篇 |
2021年 | 120篇 |
2020年 | 138篇 |
2019年 | 209篇 |
2018年 | 247篇 |
2017年 | 174篇 |
2016年 | 190篇 |
2015年 | 162篇 |
2014年 | 382篇 |
2013年 | 515篇 |
2012年 | 358篇 |
2011年 | 491篇 |
2010年 | 452篇 |
2009年 | 536篇 |
2008年 | 632篇 |
2007年 | 570篇 |
2006年 | 527篇 |
2005年 | 406篇 |
2004年 | 384篇 |
2003年 | 303篇 |
2002年 | 261篇 |
2001年 | 213篇 |
2000年 | 191篇 |
1999年 | 175篇 |
1998年 | 177篇 |
1997年 | 127篇 |
1996年 | 164篇 |
1995年 | 154篇 |
1994年 | 137篇 |
1993年 | 74篇 |
1992年 | 70篇 |
1991年 | 55篇 |
1990年 | 59篇 |
1989年 | 40篇 |
1988年 | 35篇 |
1987年 | 26篇 |
1986年 | 16篇 |
1985年 | 17篇 |
1984年 | 14篇 |
1983年 | 5篇 |
1982年 | 13篇 |
1981年 | 7篇 |
1980年 | 5篇 |
1979年 | 5篇 |
1978年 | 5篇 |
1977年 | 4篇 |
1974年 | 2篇 |
1973年 | 2篇 |
排序方式: 共有8978条查询结果,搜索用时 15 毫秒
41.
Robert L. Jerrard Halil Mete Soner 《Calculus of Variations and Partial Differential Equations》2002,14(2):151-191
We study the Ginzburg-Landau functional
for , where U is a bounded, open subset of . We show that if a sequence of functions satisfies , then their Jacobians are precompact in the dual of for every . Moreover, any limiting measure is a sum of point masses. We also characterize the -limit of the functionals , in terms of the function space B2V introduced by the authors in [16,17]: we show that I(u) is finite if and only if , and for is equal to the total variation of the Jacobian measure Ju. When the domain U has dimension greater than two, we prove if then the Jacobians are again precompact in for all , and moreover we show that any limiting measure must be integer multiplicity rectifiable. We also show that the total variation
of the Jacobian measure is a lower bound for the limit of the Ginzburg-Landau functional.
Received: 15 December 2000 / Accepted: 23 January 2001 / Published online: 25 June 2001 相似文献
42.
43.
J.S. Tsay H.W. Chang Y.L. Chiou K.T. Huang W.Y. Chan Y.D. Yao 《Journal of magnetism and magnetic materials》2006
Influences of oxygen exposure on the magnetic properties of Co/Ge(1 1 1) ultrathin films have been investigated by surface magneto-optic Kerr effect technique. As the oxygen exposure increases on Co/Ge(1 1 1) films, their magnetic properties could be modified. As an example for 15 ML Co/Ge(1 1 1) films, the coercivity increases from 730 to 920 Oe and the remanence Kerr intensity is reduced for 500 Langmuir (L) of oxygen exposure. Corresponding compositions analyzed by Auger electron spectroscopy measurement shows that the amount of oxygen on the surface layers increases with increasing the oxygen exposure time. Oxygen distributes on the topmost layers of the film. The adsorbed oxygen influences the electronic density of states of Co and results in the changes of the magnetic properties. Besides, the appearance of O/Co/Ge interface could modify the stress anisotropy, and as a result the coercivity of ultrathin Co/Ge(1 1 1) film is enhanced. 相似文献
44.
Pascal Cherrier 《Bulletin des Sciences Mathématiques》2007,131(4):375-396
We study a parabolic version of a system of Von Karman type on a compact Kähler manifold of arbitrary dimension. We provide local in time regular solutions, which can be extended to global bounded ones if the data of the problem are small. 相似文献
45.
The microstructure evolution of decagonal quasicrystals in Al72Ni12Co16 alloy was investigated by the electromagnetic melting and cyclic superheating method. Single-phase decagonal quasicrystals have been obtained when the undercoolings were larger than 60 K. The decagonal quasicrystals formed at various undercoolings show different microstructural morphologies. Furthermore, grain refinement was found near the undercooling of 120 K. Based on current thermodynamic and dendrite growth theories, a dimensionless superheating parameter was adopted to explain the effect of processing conditions on the microstructure of Al72Ni12Co16 alloy. The result indicate that the fine equiaxied microstructure of decagonal quasicrystal (D-phase) formed near on undercooling of 120 K originates from the break-up of dendrites. 相似文献
46.
We have presented an investigation of the induced focusing in Kerr media of two laser beams, the pump beam and the probe beam,
which could be either Gaussian or elliptic Gaussian or a combination of the two. We have used variational formalism to derive
relevant beam-width equations. Among several important findings, the finding that a very week probe beam can be guided and
focused when power of both beams are well below their individual threshold for self-focusing, is a noteworthy one. It has
been found that induced focusing is not possible for laser beams of any wavelength and beam radius. In case both beams are
elliptic Gaussian, we have shown that when power of both beams is above a certain threshold value then the effective radius
of both beams collapses and collapse distance depends on power. Moreover, it has been found that induced focusing can be employed
to convert a circular Gaussian beam into an elliptic Gaussian beam. 相似文献
47.
48.
49.
导出了类Kerr介质中双模SU(1,1)相干态场与Λ型三能级原子相互作用系统的态函数,研究了Kerr效应对Λ型三能级原子布居概率、双模SU(1,1)相干态场的互关联函数、Cauchy-Schwartz不等式及二阶相干度的影响.结果表明:Kerr效应使原子与光场的耦合减弱,原子布居的崩塌与复苏的周期缩短;在初始光场较弱和较强两种情况下,类Kerr介质对双模SU(1,1)相干态场两模间的相关性、相关程度以及光子的聚束与反聚束效应产生的作用有明显的区别. 相似文献
50.
Hans L. Bodlaender 《Discrete Applied Mathematics》2007,155(11):1348-1372
The Maximum Cardinality Search (MCS) algorithm visits the vertices of a graph in some order, such that at each step, an unvisited vertex that has the largest number of visited neighbours becomes visited. A maximum cardinality search ordering (MCS-ordering) of a graph is an ordering of the vertices that can be generated by the MCS algorithm. The visited degree of a vertex v in an MCS-ordering is the number of neighbours of v that are before v in the ordering. The visited degree of an MCS-ordering ψ of G is the maximum visited degree over all vertices v in ψ. The maximum visited degree over all MCS-orderings of graph G is called its maximum visited degree. Lucena [A new lower bound for tree-width using maximum cardinality search, SIAM J. Discrete Math. 16 (2003) 345-353] showed that the treewidth of a graph G is at least its maximum visited degree.We show that the maximum visited degree is of size O(logn) for planar graphs, and give examples of planar graphs G with maximum visited degree k with O(k!) vertices, for all k∈N. Given a graph G, it is NP-complete to determine if its maximum visited degree is at least k, for any fixed k?7. Also, this problem does not have a polynomial time approximation algorithm with constant ratio, unless P=NP. Variants of the problem are also shown to be NP-complete.In this paper, we also propose some heuristics for the problem, and report on an experimental analysis of them. Several tiebreakers for the MCS algorithm are proposed and evaluated. We also give heuristics that give upper bounds on the value of the maximum visited degree of a graph, which appear to give results close to optimal on many graphs from real life applications. 相似文献