首页 | 本学科首页   官方微博 | 高级检索  
文章检索
  按 检索   检索词:      
出版年份:   被引次数:   他引次数: 提示:输入*表示无穷大
  收费全文   35555篇
  免费   419篇
  国内免费   313篇
化学   15598篇
晶体学   294篇
力学   1495篇
综合类   12篇
数学   9588篇
物理学   9300篇
  2023年   69篇
  2022年   84篇
  2021年   131篇
  2020年   158篇
  2019年   167篇
  2018年   1307篇
  2017年   1544篇
  2016年   944篇
  2015年   730篇
  2014年   653篇
  2013年   960篇
  2012年   3626篇
  2011年   2915篇
  2010年   2075篇
  2009年   1750篇
  2008年   1009篇
  2007年   1053篇
  2006年   1075篇
  2005年   4852篇
  2004年   4215篇
  2003年   2580篇
  2002年   716篇
  2001年   368篇
  2000年   153篇
  1999年   216篇
  1998年   156篇
  1997年   114篇
  1996年   94篇
  1995年   90篇
  1994年   89篇
  1993年   67篇
  1992年   210篇
  1991年   192篇
  1990年   167篇
  1989年   135篇
  1988年   127篇
  1987年   84篇
  1986年   68篇
  1985年   75篇
  1984年   68篇
  1983年   53篇
  1979年   58篇
  1976年   108篇
  1975年   61篇
  1974年   71篇
  1973年   74篇
  1972年   57篇
  1969年   54篇
  1967年   54篇
  1966年   54篇
排序方式: 共有10000条查询结果,搜索用时 187 毫秒
1.
2.
3.
4.
5.
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.  相似文献   

6.
A new solvent-free sample preparation method using silver trifluoroacetate (AgTFA) was developed for the analysis of low molecular weight paraffins and microcrystalline waxes by laser desorption/ionization time-of-flight mass spectrometry (LDI-TOFMS). Experiments show that spectral quality can be enhanced by dispersing AgTFA directly in liquid paraffins without the use of additional solvents. This preparation mixture is applied directly to the MALDI probe. Solid waxes could be examined by melting prior to analysis. The method also provides sufficiently reproducible spectra that peak area ratios between mono- and bicyclic alkane peaks indicated variations in the cycloalkane content of paraffin samples. Dehydrogenation of hydrocarbons observed during the desorption/ionization process was studied by analysis of alkane standards.  相似文献   
7.
The versatile behavior of a trihydrazidophosphoradamantane allowing the synthesis of a variety of neutral, mono- or di-cationic water-soluble molecules of potential interest for biphasic catalysis is reported.  相似文献   
8.
In this paper we construct an example of a word metric on an infinite cyclic subgroup. This example shows that subexponential distortion does not obstruct non-trivial growth of connected radii. This answers a question of Gromov [6]. The constructed metric has other pathological properies. Specifically, its asymptotic cone depends on the choice of ultrafilter and scaling sequence. The work has been partially supported by the Swiss National Science Foundation.  相似文献   
9.
We build a metric space which is homeomorphic to a Cantor set but cannot be realized as the attractor of an iterated function system. We give also an example of a Cantor set K in R3 such that every homeomorphism f of R3 which preserves K coincides with the identity on K.  相似文献   
10.
We consider immersions: and construct a subspace of which corresponds to a set of embedded manifolds which are either parallel to f, tubes around f or, in general, partial tubes around f. This space is invariant under the action of the normal holonomy group, We investigate the case where is non-trivial and obtain some results on the number of connected components of . Received 24 March 2000.  相似文献   
设为首页 | 免责声明 | 关于勤云 | 加入收藏

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