全文获取类型
收费全文 | 16666篇 |
免费 | 436篇 |
国内免费 | 98篇 |
专业分类
化学 | 610篇 |
晶体学 | 18篇 |
力学 | 202篇 |
综合类 | 11篇 |
数学 | 15390篇 |
物理学 | 969篇 |
出版年
2023年 | 18篇 |
2022年 | 36篇 |
2021年 | 23篇 |
2020年 | 56篇 |
2019年 | 455篇 |
2018年 | 539篇 |
2017年 | 280篇 |
2016年 | 184篇 |
2015年 | 208篇 |
2014年 | 522篇 |
2013年 | 940篇 |
2012年 | 567篇 |
2011年 | 993篇 |
2010年 | 891篇 |
2009年 | 1189篇 |
2008年 | 1306篇 |
2007年 | 1270篇 |
2006年 | 948篇 |
2005年 | 629篇 |
2004年 | 530篇 |
2003年 | 468篇 |
2002年 | 366篇 |
2001年 | 351篇 |
2000年 | 345篇 |
1999年 | 414篇 |
1998年 | 342篇 |
1997年 | 277篇 |
1996年 | 379篇 |
1995年 | 381篇 |
1994年 | 368篇 |
1993年 | 276篇 |
1992年 | 227篇 |
1991年 | 143篇 |
1990年 | 142篇 |
1989年 | 137篇 |
1988年 | 92篇 |
1987年 | 85篇 |
1986年 | 77篇 |
1985年 | 106篇 |
1984年 | 98篇 |
1983年 | 56篇 |
1982年 | 107篇 |
1981年 | 84篇 |
1980年 | 73篇 |
1979年 | 41篇 |
1978年 | 53篇 |
1977年 | 44篇 |
1976年 | 45篇 |
1975年 | 12篇 |
1973年 | 11篇 |
排序方式: 共有10000条查询结果,搜索用时 15 毫秒
91.
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. 相似文献
92.
Historians have always seen jabr (restoration) and muqābala (confrontation) as technical terms for specific operations in Arabic algebra. This assumption clashes with the fact that the words were used in a variety of contexts. By examining the different uses of jabr, muqābala, ikmāl (completion), and radd (returning) in the worked-out problems of several medieval mathematics texts, we show that they are really nontechnical words used to name the immediate goals of particular steps. We also find that the phrase al-jabr wa'l-muqābala was first used within the solutions of problems to mean al-jabr and/or al-muqābala, and from there it became the name of the art of algebra. 相似文献
93.
A magic labelling of a set system is a labelling of its points by distinct positive integers so that every set of the system has the same sum,
the magic sum. Examples are magic squares (the sets are the rows, columns, and diagonals) and semimagic squares (the same, but without
the diagonals). A magilatin labelling is like a magic labelling but the values need be distinct only within each set. We show that the number of n × n magic or magilatin labellings is a quasipolynomial function of the magic sum, and also of an upper bound on the entries in
the square. Our results differ from previous ones because we require that the entries in the square all be different from
each other, and because we derive our results not by ad hoc reasoning but from a general theory of counting lattice points in rational inside-out polytopes. We also generalize from
set systems to rational linear forms.
Dedicated to the memory of Claudia Zaslavsky, 1917–2006
Received August 10, 2005 相似文献
94.
Application of Electron-Shelving Detection via 423 nm Transition in Calcium-Beam Optical Frequency Standard
下载免费PDF全文
![点击此处可从《中国物理快报》网站下载免费的PDF全文](/ch/ext_images/free.gif)
A new scheme of small compact optical frequency standard based on thermal calcium beam with application of 423 nm shelving detection and sharp-angle velocity selection detection is proposed. Combining these presented techniques, we conclude that a small compact optical frequency standard based on thermal calcium beam will outperform the commercial caesium-beam microwave dock, like the 5071 Cs clock (from Hp to Agilent, now Symmetricom company), both in accuracy and stability. 相似文献
95.
Changbing Hu 《Journal of Differential Equations》2007,236(1):133-163
In this article we study the 3D Navier-Stokes equations with Navier friction boundary condition in thin domains. We prove the global existence of strong solutions to the 3D Navier-Stokes equations when the initial data and external forces are in large sets as the thickness of the domain is small. We generalize the techniques developed to study the 3D Navier-Stokes equations in thin domains, see [G. Raugel, G. Sell, Navier-Stokes equations on thin 3D domains I: Global attractors and global regularity of solutions, J. Amer. Math. Soc. 6 (1993) 503-568; G. Raugel, G. Sell, Navier-Stokes equations on thin 3D domains II: Global regularity of spatially periodic conditions, in: Nonlinear Partial Differential Equations and Their Application, College de France Seminar, vol. XI, Longman, Harlow, 1994, pp. 205-247; R. Temam, M. Ziane, Navier-Stokes equations in three-dimensional thin domains with various boundary conditions, Adv. Differential Equations 1 (1996) 499-546; R. Temam, M. Ziane, Navier-Stokes equations in thin spherical shells, in: Optimization Methods in Partial Differential Equations, in: Contemp. Math., vol. 209, Amer. Math. Soc., Providence, RI, 1996, pp. 281-314], to the Navier friction boundary condition by introducing a new average operator Mε in the thin direction according to the spectral decomposition of the Stokes operator Aε. Our analysis hinges on the refined investigation of the eigenvalue problem corresponding to the Stokes operator Aε with Navier friction boundary condition. 相似文献
96.
In a structural measurement error model the structural quasi-score (SQS) estimator is based on the distribution of the latent regressor variable. If this distribution is misspecified, the SQS estimator is (asymptotically) biased. Two types of misspecification are considered. Both assume that the statistician erroneously adopts a normal distribution as his model for the regressor distribution. In the first type of misspecification, the true model consists of a mixture of normal distributions which cluster around a single normal distribution, in the second type, the true distribution is a normal distribution admixed with a second normal distribution of low weight. In both cases of misspecification, the bias, of course, tends to zero when the size of misspecification tends to zero. However, in the first case the bias goes to zero in a flat way so that small deviations from the true model lead to a negligible bias, whereas in the second case the bias is noticeable even for small deviations from the true model. 相似文献
97.
Teruhisa Tsuda 《Letters in Mathematical Physics》2006,77(1):21-30
Starting from certain point sets in the projective plane, we construct a tropical (or subtraction-free birational) representation of Weyl groups over the field of τ-functions. In particular, our construction includes E
8
(1)
, E
7
(1)
, E
6
(1)
and D
5
(1)
as affine cases; each of them gives rise to the q-difference Painlevé equation. 相似文献
98.
We prove a conjecture by F. Ferrari. Let X be the total space of a nonlinear deformation of a rank two holomorphic vector bundle on a smooth rational curve, such that X has trivial canonical bundle and has sections. Then the normal bundle to such sections is computed in terms of the rank of the Hessian of a suitably defined superpotential at its critical points. 相似文献
99.
We study the inverse scattering problem for the nonlinear Schrödinger equation and for the nonlinear Klein–Gordon equation with the generalized Hartree type nonlinearity. We reconstruct the nonlinearity from knowledge of the scattering operator, which improves the known results. 相似文献
100.
Hirofumi Tsumura 《Journal of Number Theory》2004,106(1):155-168
In this paper, we define the multiple Euler numbers and consider some multiple harmonic series of Mordell-Tornheim's type, which is a partial sum of the Mordell-Tornheim zeta series defined by Matsumoto. Indeed, we prove a certain reducibility of these series as well as the multiple zeta values. 相似文献