首页 | 本学科首页   官方微博 | 高级检索  
文章检索
  按 检索   检索词:      
出版年份:   被引次数:   他引次数: 提示:输入*表示无穷大
  收费全文   31530篇
  免费   2216篇
  国内免费   2535篇
化学   14855篇
晶体学   282篇
力学   1729篇
综合类   125篇
数学   11745篇
物理学   7545篇
  2024年   39篇
  2023年   460篇
  2022年   443篇
  2021年   551篇
  2020年   790篇
  2019年   856篇
  2018年   764篇
  2017年   757篇
  2016年   845篇
  2015年   898篇
  2014年   1240篇
  2013年   2092篇
  2012年   1476篇
  2011年   2235篇
  2010年   1716篇
  2009年   2149篇
  2008年   2286篇
  2007年   2123篇
  2006年   1683篇
  2005年   1414篇
  2004年   1267篇
  2003年   1127篇
  2002年   1366篇
  2001年   846篇
  2000年   741篇
  1999年   763篇
  1998年   606篇
  1997年   494篇
  1996年   547篇
  1995年   518篇
  1994年   449篇
  1993年   345篇
  1992年   307篇
  1991年   250篇
  1990年   214篇
  1989年   207篇
  1988年   156篇
  1987年   147篇
  1986年   129篇
  1985年   161篇
  1984年   137篇
  1983年   74篇
  1982年   123篇
  1981年   112篇
  1980年   66篇
  1979年   54篇
  1978年   42篇
  1977年   65篇
  1976年   45篇
  1971年   26篇
排序方式: 共有10000条查询结果,搜索用时 265 毫秒
121.
We prove that the class of homogeneous quasi-arithmetic progressions has unbounded discrepancy. That is, we show that given any 2-coloring of the natural numbers and any positive integer D, one can find a real number α≥1 and a set of natural numbers of the form {0, [α], [2α], [3α], . . . , [kα]} so that one color appears at least D times more than the other color. This was already proved by Beck in 1983, but the proof given here is somewhat simpler and gives a better bound on the discrepancy.  相似文献   
122.
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  相似文献   
123.
条件愈苦,意志愈坚 --记王淦昌早年的科研活动   总被引:1,自引:0,他引:1  
姚立澄 《物理》2006,35(2):160-167
文章介绍了中国物理学家王淦昌早期的科研工作,特别是在抗日战争时期的科研成绩.王淦昌早期的科研贡献并不是在先进的实验仪器上,在条件优裕的实验室内完成的,而是在实验设备缺乏,科学文献不足等极端困难的环境中完成的.从王淦昌身上,可以看到那个时代中国优秀科学家脚踏实地、执志若金的奋斗精神.  相似文献   
124.
Finite-sheeted covering mappings onto compact connected groups are studied. We show that for a covering mapping from a connected Hausdorff topological space onto a compact (in general, non-abelian) group there exists a topological group structure on the covering space such that the mapping becomes a homomorphism of groups. To prove this fact we construct an inverse system of covering mappings onto Lie groups which approximates the given covering mapping. As an application, it is shown that a covering mapping onto a compact connected abelian group G must be a homeomorphism provided that the character group of G admits division by degree of the mapping. We also get a criterion for triviality of coverings in terms of means and prove that each finite covering of G is equivalent to a polynomial covering.  相似文献   
125.
The possibility that pairs of quarks will form diquark clusters in the regime above deconfinement transition for hadron matter at finite density is revisited. Here we present the results on the diquark-diquark (dq-dq) interaction in the framework of constituent quark model taking account of spin, isospin and color degrees of freedom in the spirit of generalized Pauli principle. By constructing the appropriate spin and color states of the dq-dq clusters we compute the expectation values of the interaction Hamiltonian involving pairwise quark—quark interaction. We find that the effective interaction between two diquark clusters is quite sensitive to different configurations characterized by color and spin states, obtained after the coupling of two diquark states. The value of the coupling parameter for a particular color—spin state, i.e., -3, 1 is compared to the one obtained earlier by Donoghue and Sateesh,Phys. Rev. D38, 360 (1988) based on the effective Φ4-theory. This new value of λ derived for different color-spin dq-dq states, may lead to several important implications in the studies of diquark star and diquark gas.  相似文献   
126.
本文用COSY,CHCOR等二维核磁共振技术对TRANILAST,2[]3-(3.4-二甲基苯基)1-氧代-2-丙烯基]氨基]苯甲到进行了~1H、~(13)C NMR谱数据分析及归属,并结合~(13)C弛豫时间T_1 及变温实验对合成产品进行了结构鉴定.  相似文献   
127.
FexPt100−x(30 nm) and [FexPt100−x(3 nm)/ZrO2]10 (x = 37, 48, 57, 63, 69) films with different ZrO2 content were prepared by RF magnetron sputtering technique, then were annealed at 550 °C for 30 min. This work investigates the effect of ZrO2 doping on the microstructural evolution, magnetic properties, grain size, as well as the ordering kinetics of FePt alloy films. The as-deposited films behaved a disordered state, and the ordered L10 structure was obtained by post-annealing. The magnetic properties of the films are changed from soft magnetism to hard magnetism after annealing. The variation of the largest coercivities of [FexPt100−x/ZrO2]10 films with the Fe atomic percentage, x and differing amounts of ZrO2 content reveals that as we increase the ZrO2 content we must correspondingly increase the amount of Fe. This phenomenon suggests that the Zr or O atoms of ZrO2 preferentially react with the Fe atoms of FePt alloy to form compounds. In addition, introducing the nonmagnetic ZrO2 can reduce the intergrain exchange interactions of the FePt/ZrO2 films, and the interactions are decreased as the ZrO2 content increases, the dipole interactions are observed in FePt/ZrO2 films as the ZrO2 content is more than 15%.  相似文献   
128.
Let M be a compact manifold with dimM?2. We prove that some iteration of the generic homeomorphism on M is semiconjugated to the shift map and has infinite topological entropy (Theorem 1.1).  相似文献   
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.
The minimum span of L(2,1)-labelings of certain generalized Petersen graphs   总被引:1,自引:0,他引:1  
In the classical channel assignment problem, transmitters that are sufficiently close together are assigned transmission frequencies that differ by prescribed amounts, with the goal of minimizing the span of frequencies required. This problem can be modeled through the use of an L(2,1)-labeling, which is a function f from the vertex set of a graph G to the non-negative integers such that |f(x)-f(y)|? 2 if xand y are adjacent vertices and |f(x)-f(y)|?1 if xand y are at distance two. The goal is to determine the λ-number of G, which is defined as the minimum span over all L(2,1)-labelings of G, or equivalently, the smallest number k such that G has an L(2,1)-labeling using integers from {0,1,…,k}. Recent work has focused on determining the λ-number of generalized Petersen graphs (GPGs) of order n. This paper provides exact values for the λ-numbers of GPGs of orders 5, 7, and 8, closing all remaining open cases for orders at most 8. It is also shown that there are no GPGs of order 4, 5, 8, or 11 with λ-number exactly equal to the known lower bound of 5, however, a construction is provided to obtain examples of GPGs with λ-number 5 for all other orders. This paper also provides an upper bound for the number of distinct isomorphism classes for GPGs of any given order. Finally, the exact values for the λ-number of n-stars, a subclass of the GPGs inspired by the classical Petersen graph, are also determined. These generalized stars have a useful representation on Möebius strips, which is fundamental in verifying our results.  相似文献   
设为首页 | 免责声明 | 关于勤云 | 加入收藏

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