首页 | 本学科首页   官方微博 | 高级检索  
文章检索
  按 检索   检索词:      
出版年份:   被引次数:   他引次数: 提示:输入*表示无穷大
  收费全文   255584篇
  免费   2711篇
  国内免费   924篇
化学   131933篇
晶体学   4232篇
力学   11426篇
综合类   1篇
数学   27653篇
物理学   83974篇
  2021年   2140篇
  2020年   2203篇
  2019年   2464篇
  2018年   3088篇
  2017年   2985篇
  2016年   4560篇
  2015年   2962篇
  2014年   4770篇
  2013年   11415篇
  2012年   9163篇
  2011年   11232篇
  2010年   7850篇
  2009年   7634篇
  2008年   10231篇
  2007年   10037篇
  2006年   9609篇
  2005年   8635篇
  2004年   7923篇
  2003年   6965篇
  2002年   6864篇
  2001年   7564篇
  2000年   5815篇
  1999年   4544篇
  1998年   3767篇
  1997年   3666篇
  1996年   3549篇
  1995年   3186篇
  1994年   3142篇
  1993年   3245篇
  1992年   3306篇
  1991年   3451篇
  1990年   3205篇
  1989年   3125篇
  1988年   3131篇
  1987年   3024篇
  1986年   2845篇
  1985年   3878篇
  1984年   4051篇
  1983年   3241篇
  1982年   3470篇
  1981年   3395篇
  1980年   3260篇
  1979年   3381篇
  1978年   3463篇
  1977年   3381篇
  1976年   3483篇
  1975年   3172篇
  1974年   3183篇
  1973年   3228篇
  1972年   2254篇
排序方式: 共有10000条查询结果,搜索用时 15 毫秒
71.
72.
We discuss a mass change that has its origin in the action of forces on an object. This phenomenon, well-known in the context of quantum field theory (mass renormalization), can be discussed systematically in both classical and quantum mechanics in a framework given by Stückelberg. We employ this framework to resolve an interesting conflict of opinions between Schopenhauer and Hegel in the mid-19th century. We show that Hegel, Kant, and Schopenhauer demonstrated remarkable prescience in their views as seen from a modern perspective.  相似文献   
73.
A (w,r) cover‐free family is a family of subsets of a finite set such that no intersection of w members of the family is covered by a union of r others. A (w,r) superimposed code is the incidence matrix of such a family. Such a family also arises in cryptography as the concept of key distribution pattern. In the present paper, we give some new results on superimposed codes. First we construct superimposed codes from super‐simple designs which give us results better than superimposed codes constructed by other known methods. Next we prove the uniqueness of the (1,2) superimposed code of size 9 × 12, the (2,2) superimposed code of size 14 × 8, and the (2,3) superimposed code of size 30 × 10. Finally, we improve numerical values of upper bounds for the asymptotic rate of some (w,r) superimposed codes. © 2004 Wiley Periodicals, Inc.  相似文献   
74.
The results of experimental investigations on thermal nonequilibrium ionization in CO2: N2: He mixtures are presented. Measurements of electron density, ne, in vibrationally excited nitrogen were made in a supersonic flow with different CO2 contents as well as in a CO2: N2: He = 1 : 5 : 4 mixture laser gas. The mixtures were heated in a shock tube and expanded through a supersonic nozzle. Furthermore, supersonic mixing of N2 and CO2 + He was used in some experiments. The measured values of ne in the plenum chamber and in the supersonic nozzle are reported, and the processes responsible for nonequilibrium ionization in a laser-active medium are discussed.  相似文献   
75.
76.
    
3-[4-(Azidocarbonyl)]phenylsydnone (2) obtained from 3-(4-hydrazinocarbonyl) phenylsydnone (1) on Curtius rearrangement with alcohols, water and amines afforded the corresponding carbamates (3a-h), 4,4′-(sydnone-3-yl) diphenyl urea (4) and 4-(heterocyclyl)phenyl ureas (5a-l). Compounds (5a-l) on one-pot ring conversion yielded the 1,3,4-oxadiazolin-2-one derivatives (6a-l), which on reaction with N2H4 gave the 4-amino-1,2,4-triazolin-3-ones (7a-l). All these compounds exhibited moderate antimicrobial activity against the few microbes tested. The carbamates have been found to be more toxic against fourth instar larvae ofAedes aegypti, in particular, then-butyl derivative (3e).  相似文献   
77.
We extend the matrix version of Cochran's statistical theorem to outer inverses of a matrix. As applications, we investigate the Wishartness and independence of matrix quadratic forms for Kronecker product covariance structures.  相似文献   
78.
The auction algorithm for the transportation problem   总被引:1,自引:0,他引:1  
The auction algorithm is a parallel relaxation method for solving the classical assignment problem. It resembles a competitive bidding process whereby unassigned persons bid simultaneously for objects, thereby raising their prices. Once all bids are in, objects are awarded to the highest bidder. This paper generalizes the auction algorithm to solve linear transportation problems. The idea is to convert the transportation problem into an assignment problem, and then to modify the auction algorithm to exploit the special structure of this problem. Computational results show that this modified version of the auction algorithm is very efficient for certain types of transportation problems.  相似文献   
79.
Radio Engineering and Electronics Institute, Academy of Sciences of the USSR. Translated from Izvestiya Vysshikh Uchebnykh Zavedenii, Radiofizika, Vol. 32, No. 9, pp. 1113–1124, September, 1989.  相似文献   
80.
设为首页 | 免责声明 | 关于勤云 | 加入收藏

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