首页 | 本学科首页   官方微博 | 高级检索  
文章检索
  按 检索   检索词:      
出版年份:   被引次数:   他引次数: 提示:输入*表示无穷大
  收费全文   372183篇
  免费   5636篇
  国内免费   1354篇
化学   200097篇
晶体学   4829篇
力学   14787篇
综合类   20篇
数学   51784篇
物理学   107656篇
  2021年   2076篇
  2020年   2570篇
  2019年   2470篇
  2018年   3861篇
  2017年   3942篇
  2016年   5897篇
  2015年   4865篇
  2014年   5925篇
  2013年   16887篇
  2012年   15507篇
  2011年   17490篇
  2010年   10968篇
  2009年   10525篇
  2008年   14638篇
  2007年   14753篇
  2006年   14143篇
  2005年   16571篇
  2004年   14769篇
  2003年   11883篇
  2002年   10029篇
  2001年   10844篇
  2000年   8401篇
  1999年   6644篇
  1998年   5303篇
  1997年   5090篇
  1996年   5212篇
  1995年   4683篇
  1994年   4503篇
  1993年   4289篇
  1992年   4888篇
  1991年   4649篇
  1990年   4391篇
  1989年   4121篇
  1988年   4407篇
  1987年   4044篇
  1986年   3935篇
  1985年   5630篇
  1984年   5666篇
  1983年   4597篇
  1982年   4975篇
  1981年   5031篇
  1980年   4742篇
  1979年   4851篇
  1978年   4844篇
  1977年   4820篇
  1976年   4802篇
  1975年   4687篇
  1974年   4545篇
  1973年   4710篇
  1972年   2704篇
排序方式: 共有10000条查询结果,搜索用时 31 毫秒
161.
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.  相似文献   
162.
In this Note we give a necessary and sufficient condition for the spectral controllability from one simple node of a general network of strings that undergoes transversal vibrations in a sufficiently large time. This condition asserts that no eigenfunction vanishes identically on the string that contains the controlled node. The proof combines the Beurling–Malliavin's theorem and an asymptotic formula for the eigenvalues of the network. The optimal control time may be characterized as twice the sum of the lengths of all the strings of the network. To cite this article: R. Dáger, E. Zuazua, C. R. Acad. Sci. Paris, Ser. I 334 (2002) 545–550.  相似文献   
163.
164.
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.  相似文献   

165.
166.
167.
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  相似文献   
168.
169.
170.
Experimental and theoretical results are presented on an XeF(C?A) blue-green laser driven by 5-kJ energy. The laser was pumped by a ferrite-induced discharge of 90 cm in length. The output energy of 0.22 J was obtained with a plane-parallel resonator. A program to simulate laser operation has been developed. Numerical results for a wide range of conditions are compared with experiments performed by us and by other authors. It is found that intracavity refractive losses limit laser operation for XeF pressures above 3 torr. The laser efficiency strongly depends on the discharge-to-cavity length ratio. Possible ways to increase the laser power and efficiency are discussed.  相似文献   
设为首页 | 免责声明 | 关于勤云 | 加入收藏

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