首页 | 本学科首页   官方微博 | 高级检索  
文章检索
  按 检索   检索词:      
出版年份:   被引次数:   他引次数: 提示:输入*表示无穷大
  收费全文   7027篇
  免费   355篇
  国内免费   30篇
化学   5327篇
晶体学   78篇
力学   183篇
数学   763篇
物理学   1061篇
  2023年   64篇
  2022年   72篇
  2021年   122篇
  2020年   148篇
  2019年   166篇
  2018年   133篇
  2017年   111篇
  2016年   257篇
  2015年   211篇
  2014年   213篇
  2013年   339篇
  2012年   567篇
  2011年   650篇
  2010年   297篇
  2009年   223篇
  2008年   485篇
  2007年   479篇
  2006年   495篇
  2005年   457篇
  2004年   315篇
  2003年   277篇
  2002年   241篇
  2001年   79篇
  2000年   56篇
  1999年   39篇
  1998年   51篇
  1997年   44篇
  1996年   47篇
  1995年   39篇
  1994年   44篇
  1993年   39篇
  1992年   45篇
  1991年   32篇
  1990年   38篇
  1989年   32篇
  1988年   29篇
  1987年   25篇
  1985年   39篇
  1984年   43篇
  1983年   25篇
  1982年   24篇
  1981年   24篇
  1980年   20篇
  1979年   24篇
  1978年   18篇
  1977年   32篇
  1976年   20篇
  1975年   18篇
  1974年   22篇
  1973年   24篇
排序方式: 共有7412条查询结果,搜索用时 109 毫秒
1.
2.
3.
4.
A fully quantitative theory of the relationship between protein conformation and optical spectroscopy would facilitate deeper insights into biophysical and simulation studies of protein dynamics and folding. In contrast to intense bands in the far-ultraviolet, near-UV bands are much weaker and have been challenging to compute theoretically. We report some advances in the accuracy of calculations in the near-UV, which were realised through the consideration of the vibrational structure of the electronic transitions of aromatic side chains.  相似文献   
5.
6.
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.  相似文献   

7.
We describe a new algorithm which uses the trajectories of a discrete dynamical system to sample the domain of an unconstrained objective function in search of global minima. The algorithm is unusually adept at avoiding nonoptimal local minima and successfully converging to a global minimum. Trajectories generated by the algorithm for objective functions with many local minima exhibit chaotic behavior, in the sense that they are extremely sensitive to changes in initial conditions and system parameters. In this context, chaos seems to have a beneficial effect: failure to converge to a global minimum from a given initial point can often be rectified by making arbitrarily small changes in the system parameters.  相似文献   
8.
Summary A lower bound is established for the strip discrepancy of a broad class of point distributions. The bound implies unbounded strip discrepancy for equally weighted point distributions under favorable conditions. The methods of proof use notions from integral geometry.  相似文献   
9.
A finite-deformation theory is developed to study the mechanics of thin buckled films on compliant substrates. Perturbation analysis is performed for this highly nonlinear system to obtain the analytical solution. The results agree well with experiments and finite element analysis in wavelength and amplitude. In particular, it is found that the wavelength depends on the strain. Based on the accurate wavelength and amplitude, the membrane and peak strains in thin films, and stretchability and compressibility of the system are also obtained analytically.  相似文献   
10.
设为首页 | 免责声明 | 关于勤云 | 加入收藏

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