首页 | 本学科首页   官方微博 | 高级检索  
文章检索
  按 检索   检索词:      
出版年份:   被引次数:   他引次数: 提示:输入*表示无穷大
  收费全文   447844篇
  免费   5717篇
  国内免费   1513篇
化学   240838篇
晶体学   6840篇
力学   18908篇
综合类   10篇
数学   53532篇
物理学   134946篇
  2020年   3192篇
  2019年   3337篇
  2018年   3710篇
  2017年   3719篇
  2016年   6634篇
  2015年   4820篇
  2014年   7051篇
  2013年   20235篇
  2012年   15184篇
  2011年   18668篇
  2010年   12300篇
  2009年   12226篇
  2008年   17362篇
  2007年   17411篇
  2006年   16789篇
  2005年   15243篇
  2004年   13874篇
  2003年   12366篇
  2002年   12154篇
  2001年   13748篇
  2000年   10557篇
  1999年   8303篇
  1998年   6803篇
  1997年   6536篇
  1996年   6490篇
  1995年   5972篇
  1994年   5724篇
  1993年   5515篇
  1992年   6201篇
  1991年   5997篇
  1990年   5714篇
  1989年   5517篇
  1988年   5737篇
  1987年   5454篇
  1986年   5234篇
  1985年   7381篇
  1984年   7521篇
  1983年   6275篇
  1982年   6687篇
  1981年   6555篇
  1980年   6330篇
  1979年   6549篇
  1978年   6642篇
  1977年   6539篇
  1976年   6493篇
  1975年   6348篇
  1974年   6192篇
  1973年   6501篇
  1972年   3970篇
  1971年   3031篇
排序方式: 共有10000条查询结果,搜索用时 187 毫秒
201.
202.
We have recently demonstrated that polarization transfer using an adiabatic passage through the Hartmann-Hahn condition (APHH-CP) by a variation of the radio-frequency amplitude can substantially improve the transfer efficiency over Hartmann-Hahn cross polarization. Here we show that APHH-CP can be combined with fast magic angle sample spinning (MAS). The heteronuclear dipolar order, established in the course of the transfer, can indeed be created and preserved.  相似文献   
203.
We investigate the following process: N people select b losers by flipping coins. The 0-party continues until there are less than b losers; then the 1-party has to find the other losers by the same process. The average time for this process is about long2 N, but this result requires rather advanced methods. Furthermore, the average size of a binary tree associated to this process and the average number of coin flippings are computed. The method used in this article can be used to give asympotical solutions of a special type of bivariate recurrences. © 1993 John Wiley & Sons, Inc.  相似文献   
204.
An M/G/1 retrial queueing system with additional phase of service and possible preemptive resume service discipline is considered. For an arbitrarily distributed retrial time distribution, the necessary and sufficient condition for the system stability is obtained, assuming that only the customer at the head of the orbit has priority access to the server. The steady-state distributions of the server state and the number of customers in the orbit are obtained along with other performance measures. The effects of various parameters on the system performance are analysed numerically. A general decomposition law for this retrial queueing system is established.  相似文献   
205.
206.
207.
We present a new data structure for a set of n convex simply-shaped fat objects in the plane, and use it to obtain efficient and rather simple solutions to several problems including (i) vertical ray shooting—preprocess a set of n non-intersecting convex simply-shaped flat objects in 3-space, whose xy-projections are fat, for efficient vertical ray shooting queries, (ii) point enclosure—preprocess a set C of n convex simply-shaped fat objects in the plane, so that the k objects containing a query point p can be reported efficiently, (iii) bounded-size range searching— preprocess a set C of n convex fat polygons, so that the k objects intersecting a “not-too-large” query polygon can be reported efficiently, and (iv) bounded-size segment shooting—preprocess a set C as in (iii), so that the first object (if exists) hit by a “not-too-long” oriented query segment can be found efficiently. For the first three problems we construct data structures of size O(λs(n)log3n), where s is the maximum number of intersections between the boundaries of the (xy-projections) of any pair of objects, and λs(n) is the maximum length of (n, s) Davenport-Schinzel sequences. The data structure for the fourth problem is of size O(λs(n)log2n). The query time in the first problem is O(log4n), the query time in the second and third problems is O(log3n + klog2n), and the query time in the fourth problem is O(log3n).

We also present a simple algorithm for computing a depth order for a set as in (i), that is based on the solution to the vertical ray shooting problem. (A depth order for , if exists, is a linear order of , such that, if K1, K2 and K1 lies vertically above K2, then K1 precedes K2.) Unlike the algorithm of Agarwal et al. (1995) that might output a false order when a depth order does not exist, the new algorithm is able to determine whether such an order exists, and it is often more efficient in practical situations than the former algorithm.  相似文献   

208.
209.
210.
Using a system based on non-dispersive infrared (NDIR) detectors, evolved gas analysis (EGA) was able to identify and quantify the principal volatiles produced by heating powdered samples of UK brick clays. From these results, atmospheric emissions likely to result from brick production can be predicted. In addition, EGA results for extruded brick clay test pieces are significantly different from those of powdered samples. Within an extruded brick clay body, evolved gases are contained within a pore system and evolved gas-solid phase reactions also occur. This EGA study provides further evidence on the nature of firing reactions within brick clay bodies. The qualitative and quantitative influence of heating rate — a key process condition in brick manufacture — on gas release is also outlined.Dedicated to Dr. Robert Mackenzie on the occasion of his 75th birthday  相似文献   
设为首页 | 免责声明 | 关于勤云 | 加入收藏

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