首页 | 本学科首页   官方微博 | 高级检索  
文章检索
  按 检索   检索词:      
出版年份:   被引次数:   他引次数: 提示:输入*表示无穷大
  收费全文   2162篇
  免费   52篇
  国内免费   2篇
化学   1343篇
晶体学   15篇
力学   59篇
数学   243篇
物理学   556篇
  2022年   17篇
  2021年   18篇
  2020年   15篇
  2019年   28篇
  2018年   17篇
  2017年   13篇
  2016年   31篇
  2015年   31篇
  2014年   39篇
  2013年   80篇
  2012年   101篇
  2011年   104篇
  2010年   69篇
  2009年   42篇
  2008年   91篇
  2007年   80篇
  2006年   99篇
  2005年   85篇
  2004年   98篇
  2003年   63篇
  2002年   72篇
  2001年   60篇
  2000年   68篇
  1999年   31篇
  1998年   40篇
  1997年   19篇
  1996年   33篇
  1995年   35篇
  1994年   38篇
  1993年   48篇
  1992年   27篇
  1991年   27篇
  1990年   17篇
  1989年   22篇
  1988年   29篇
  1986年   35篇
  1985年   27篇
  1984年   30篇
  1983年   29篇
  1982年   27篇
  1981年   27篇
  1980年   17篇
  1979年   24篇
  1978年   27篇
  1977年   22篇
  1976年   38篇
  1975年   29篇
  1974年   19篇
  1973年   15篇
  1971年   13篇
排序方式: 共有2216条查询结果,搜索用时 15 毫秒
1.
2.
Several new families of c‐Bhaskar Rao designs with block size 4 are constructed. The necessary conditions for the existence of a c‐BRD (υ,4,λ) are that: (1)λmin=?λ/3 ≤ c ≤ λ and (2a) c≡λ (mod 2), if υ > 4 or (2b) c≡ λ (mod 4), if υ = 4 or (2c) c≠ λ ? 2, if υ = 5. It is proved that these conditions are necessary, and are sufficient for most pairs of c and λ; in particular, they are sufficient whenever λ?c ≠ 2 for c > 0 and whenever c ? λmin≠ 2 for c < 0. For c < 0, the necessary conditions are sufficient for υ> 101; for the classic Bhaskar Rao designs, i.e., c = 0, we show the necessary conditions are sufficient with the possible exception of 0‐BRD (υ,4,2)'s for υ≡ 4 (mod 6). © 2002 Wiley Periodicals, Inc. J Combin Designs 10: 361–386, 2002; Published online in Wiley InterScience ( www.interscience.wiley.com ). DOI 10.1002/jcd.10009  相似文献   
3.
4.
5.
It is shown that under certain side conditions the natural random greedy algorithm almost always provides an asymptotically optimal packing of disjoint hyperedges from a hypergraph H.  相似文献   
6.
7.
8.
Gradient surfaces allow rapid, high-throughput investigations and systematic studies in many disparate fields, including biology, tribology and adhesion. We describe a novel method for the fabrication of material-independent morphology gradients, involving a two-step process of particle erosion followed by a chemical polishing procedure that preferentially removes features with a small radius of curvature as a function of time. Gradients are fabricated on aluminium surfaces, but they may be readily transferred to other materials via a replication technique, which allows for the production of identical roughness gradient samples with any chosen surface chemistry. The gradients have been characterized by means of scanning electron microscopy and optical profilometry. Standard roughness parameters (Ra, Rq, Rz, Sm and Sk) were calculated from optical profilometry data. The roughness has also been assessed over different wavelength windows by means of a fast Fourier transformation approach.  相似文献   
9.
The electro-optic response of ferroelectric smectic C* liquid crystals has been studied. Anomalous switching behaviour of such materials which possess a negative dielectric anisotropy has been reported. These materials show a minimum in response time at a sufficiently high field. We present results showing the dependency of this minimum upon spontaneous polarisation and the effect of AC bias. Calculations based upon the equation of motion of the director around the cone are presented which describe this effect and its dependence on the relative magnitudes of the spontaneous polarization and dielectric anisotropy of the material. Good agreement with the experimental results is found.  相似文献   
10.
In a previous paper we gave a new formulation and derived the Euler equations and other necessary conditions to solve strong, pathwise, stochastic variational problems with trajectories driven by Brownian motion. Thus, unlike current methods which minimize the control over deterministic functionals (the expected value), we find the control which gives the critical point solution of random functionals of a Brownian path and then, if we choose, find the expected value.This increase in information is balanced by the fact that our methods are anticipative while current methods are not. However, our methods are more directly connected to the theory and meaningful examples of deterministic variational theory and provide better means of solution for free and constrained problems. In addition, examples indicate that there are methods to obtain nonanticipative solutions from our equations although the anticipative optimal cost function has smaller expected value.In this paper we give new, efficient numerical methods to find the solution of these problems in the quadratic case. Of interest is that our numerical solution has a maximal, a priori, pointwise error of O(h3/2) where h is the node size. We believe our results are unique for any theory of stochastic control and that our methods of proof involve new and sophisticated ideas for strong solutions which extend previous deterministic results by the first author where the error was O(h2).We note that, although our solutions are given in terms of stochastic differential equations, we are not using the now standard numerical methods for stochastic differential equations. Instead we find an approximation to the critical point solution of the variational problem using relations derived from setting to zero the directional derivative of the cost functional in the direction of simple test functions.Our results are even more significant than they first appear because we can reformulate stochastic control problems or constrained calculus of variations problems in the unconstrained, stochastic calculus of variations formulation of this paper. This will allow us to find efficient and accurate numerical solutions for general constrained, stochastic optimization problems. This is not yet being done, even in the deterministic case, except by the first author.  相似文献   
设为首页 | 免责声明 | 关于勤云 | 加入收藏

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