首页 | 本学科首页   官方微博 | 高级检索  
文章检索
  按 检索   检索词:      
出版年份:   被引次数:   他引次数: 提示:输入*表示无穷大
  收费全文   26744篇
  免费   639篇
  国内免费   534篇
化学   4507篇
晶体学   942篇
力学   481篇
综合类   58篇
数学   17800篇
物理学   4129篇
  2023年   69篇
  2022年   218篇
  2021年   175篇
  2020年   183篇
  2019年   540篇
  2018年   598篇
  2017年   369篇
  2016年   390篇
  2015年   400篇
  2014年   796篇
  2013年   1712篇
  2012年   772篇
  2011年   2003篇
  2010年   1753篇
  2009年   1766篇
  2008年   1857篇
  2007年   1898篇
  2006年   1416篇
  2005年   1166篇
  2004年   997篇
  2003年   765篇
  2002年   778篇
  2001年   556篇
  2000年   534篇
  1999年   531篇
  1998年   519篇
  1997年   404篇
  1996年   484篇
  1995年   466篇
  1994年   469篇
  1993年   355篇
  1992年   352篇
  1991年   244篇
  1990年   251篇
  1989年   232篇
  1988年   154篇
  1987年   167篇
  1986年   125篇
  1985年   211篇
  1984年   156篇
  1983年   86篇
  1982年   141篇
  1981年   153篇
  1980年   135篇
  1979年   81篇
  1978年   133篇
  1977年   106篇
  1976年   100篇
  1975年   45篇
  1974年   46篇
排序方式: 共有10000条查询结果,搜索用时 31 毫秒
121.
122.
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.  相似文献   
123.
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  相似文献   
124.
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.  相似文献   
125.
126.
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.  相似文献   
127.
Jurie Conradie 《Positivity》2006,10(3):591-606
The possibility of characterizing the Mackey topology of a dual pair of vector spaces as a generalized inductive limit (or mixed) topology is investigated. Positive answers are given for a wide range of dual pairs of Riesz spaces (vector lattices) and non-commutative Banach function spaces (or symmetric operator spaces).  相似文献   
128.
This paper shows that for a local field K, a subfield kK and a variety X over k, X is complete if and only if for every finite field extension Kʹ | K, the set X(Kʹ) is compact in its strong topology. The author likes to thank Florian Pop, Jakob Stix, Stefan Wewers, Gunther Cornelissen and his own parents for their support. Received: 13 April 2006  相似文献   
129.
Let V={1,2,…,n}. A mapping p:VRr, where p1,…,pn are not contained in a proper hyper-plane is called an r-configuration. Let G=(V,E) be a simple connected graph on n vertices. Then an r-configuration p together with graph G, where adjacent vertices of G are constrained to stay the same distance apart, is called a bar-and-joint framework (or a framework) in Rr, and is denoted by G(p). In this paper we introduce the notion of dimensional rigidity of frameworks, and we study the problem of determining whether or not a given G(p) is dimensionally rigid. A given framework G(p) in Rr is said to be dimensionally rigid iff there does not exist a framework G(q) in Rs for s?r+1, such that ∥qi-qj2=∥pi-pj2 for all (i,j)∈E. We present necessary and sufficient conditions for G(p) to be dimensionally rigid, and we formulate the problem of checking the validity of these conditions as a semidefinite programming (SDP) problem. The case where the points p1,…,pn of the given r-configuration are in general position, is also investigated.  相似文献   
130.
设为首页 | 免责声明 | 关于勤云 | 加入收藏

Copyright©北京勤云科技发展有限公司  京ICP备09084417号