全文获取类型
收费全文 | 1676篇 |
免费 | 39篇 |
国内免费 | 6篇 |
专业分类
化学 | 928篇 |
晶体学 | 10篇 |
力学 | 74篇 |
数学 | 313篇 |
物理学 | 396篇 |
出版年
2023年 | 9篇 |
2022年 | 30篇 |
2021年 | 36篇 |
2020年 | 33篇 |
2019年 | 47篇 |
2018年 | 37篇 |
2017年 | 40篇 |
2016年 | 71篇 |
2015年 | 36篇 |
2014年 | 57篇 |
2013年 | 111篇 |
2012年 | 102篇 |
2011年 | 124篇 |
2010年 | 84篇 |
2009年 | 70篇 |
2008年 | 100篇 |
2007年 | 78篇 |
2006年 | 83篇 |
2005年 | 85篇 |
2004年 | 60篇 |
2003年 | 58篇 |
2002年 | 41篇 |
2001年 | 20篇 |
2000年 | 22篇 |
1999年 | 24篇 |
1998年 | 21篇 |
1997年 | 20篇 |
1996年 | 23篇 |
1995年 | 17篇 |
1994年 | 17篇 |
1993年 | 10篇 |
1992年 | 7篇 |
1991年 | 14篇 |
1990年 | 10篇 |
1989年 | 7篇 |
1987年 | 6篇 |
1986年 | 6篇 |
1984年 | 10篇 |
1983年 | 5篇 |
1980年 | 4篇 |
1979年 | 7篇 |
1978年 | 5篇 |
1976年 | 9篇 |
1975年 | 4篇 |
1974年 | 4篇 |
1973年 | 5篇 |
1972年 | 6篇 |
1971年 | 7篇 |
1965年 | 4篇 |
1938年 | 7篇 |
排序方式: 共有1721条查询结果,搜索用时 15 毫秒
1.
The paper discusses the applicability of quasi-crystalline approximation to describing the thermal motion of water molecules in their normal and supercooled states. The problem is subjected to the critical analysis of experimental data on incoherent scattering of slow neutrons based on theories developed by Singwi-Sjolander [1] and Oskotsky [2] modified to duly take into account the limited applicability range of diffusion approximation. The applicability conditions of quasi-crystalline approximation are shown to be consistently satisfied only when water is in supercooled state and within a narrow temperature range above the melting temperature. 相似文献
2.
E. L. Pankratov 《Technical Physics》2004,49(1):114-118
The establishment of the steady-state dopant profile in a medium with a time-variable diffusion coefficient is considered
within the approach proposed previously for estimating mass-and heat-transfer time characteristics. It is shown that the time
it takes for the equilibrium concentration to set in may be increased or decreased by appropriately choosing the law of variation
of the diffusion coefficient. 相似文献
3.
B. Amaziane M. Goncharenko L. Pankratov 《Mathematical Methods in the Applied Sciences》2005,28(15):1847-1865
We study the asymptotic behaviour of the solution of a stationary quasilinear elliptic problem posed in a domain Ω(ε) of asymptotically degenerating measure, i.e. meas Ω(ε) → 0 as ε → 0, where ε is the parameter that characterizes the scale of the microstructure. We obtain the convergence of the solution and the homogenized model of the problem is constructed using the notion of convergence in domains of degenerating measure. Proofs are given using the method of local characteristics of the medium Ω(ε) associated with our problem in a variational form. Copyright © 2005 John Wiley & Sons, Ltd. 相似文献
4.
Multinomial permutations on a circle are considered in the framework of combinatorics. Different cases are presented and shown to agree with previously derived formula for the number of cyclic necklaces. Two applied examples are discussed with a view to illustrate the implications of derived formulas. Copyright © 2006 John Wiley & Sons, Ltd. 相似文献
5.
6.
Leonid Polterovich 《Geometric And Functional Analysis》1996,6(4):726-739
Supported by the United States-Israel Binational Science Foundation grant 94-00302 相似文献
7.
Let G=(V,E) be a (directed) graph with vertex set V and edge (arc) set E. Given a set P of source-sink pairs of vertices of G, an important problem that arises in the computation of network reliability is the enumeration of minimal subsets of edges (arcs) that connect/disconnect all/at least one of the given source-sink pairs of P. For undirected graphs, we show that the enumeration problems for conjunctions of paths and disjunctions of cuts can be solved in incremental polynomial time. Furthermore, under the assumption that P consists of all pairs within a given vertex set, we also give incremental polynomial time algorithm for enumerating all minimal path disjunctions and cut conjunctions. For directed graphs, the enumeration problem for cut disjunction is known to be NP-complete. We extend this result to path conjunctions and path disjunctions, leaving open the complexity of the enumeration of cut conjunctions. Finally, we give a polynomial delay algorithm for enumerating all minimal sets of arcs connecting two given nodes s1 and s2 to, respectively, a given vertex t1, and each vertex of a given subset of vertices T2. 相似文献
8.
The enthalpies and free energies of proton affinity (PA) were calculated by the PM3 method for 27 thiophenoxide anions. For thiophenols, linear correlation has been found between the PAs and the values of pK
a
measured by different authors in aqueous acetone, aqueous ethanol, and methanol media. The dependences found permit one to predict a priori the protolytic properties of thiophenols. The differential effects of aqueous ethanol media with different ethanol contents on thiophenol acidity were evaluated based on quantum-chemical data.Original Russian Text Copyright © 2004 by A. N. Pankratov and A. V. Shalabai__________Translated from Zhurnal Strukturnoi Khimii, Vol. 45, No. 5, pp. 800–806, September–October, 2004. 相似文献
9.
L. S. Pankratov 《Journal of Mathematical Sciences》1992,58(4):364-371
Translated from Teoriya Funktsii, Funktsional'nyi Analiz i Ikh Prilozheniya, No. 54, pp. 97–105, 1990. 相似文献
10.