首页 | 本学科首页   官方微博 | 高级检索  
文章检索
  按 检索   检索词:      
出版年份:   被引次数:   他引次数: 提示:输入*表示无穷大
  收费全文   16170篇
  免费   724篇
  国内免费   149篇
化学   10421篇
晶体学   65篇
力学   337篇
综合类   1篇
数学   3028篇
物理学   3191篇
  2023年   138篇
  2022年   217篇
  2021年   352篇
  2020年   422篇
  2019年   503篇
  2018年   380篇
  2017年   294篇
  2016年   604篇
  2015年   573篇
  2014年   561篇
  2013年   931篇
  2012年   1099篇
  2011年   1311篇
  2010年   696篇
  2009年   583篇
  2008年   924篇
  2007年   854篇
  2006年   872篇
  2005年   803篇
  2004年   625篇
  2003年   491篇
  2002年   453篇
  2001年   275篇
  2000年   199篇
  1999年   196篇
  1998年   170篇
  1997年   183篇
  1996年   195篇
  1995年   179篇
  1994年   135篇
  1993年   121篇
  1992年   106篇
  1991年   87篇
  1990年   79篇
  1989年   49篇
  1988年   59篇
  1987年   64篇
  1986年   49篇
  1985年   75篇
  1984年   66篇
  1983年   44篇
  1982年   73篇
  1981年   63篇
  1980年   59篇
  1979年   52篇
  1978年   54篇
  1977年   59篇
  1976年   62篇
  1974年   50篇
  1973年   40篇
排序方式: 共有10000条查询结果,搜索用时 923 毫秒
21.
22.
The sample average approximation (SAA) method is an approach for solving stochastic optimization problems by using Monte Carlo simulation. In this technique the expected objective function of the stochastic problem is approximated by a sample average estimate derived from a random sample. The resulting sample average approximating problem is then solved by deterministic optimization techniques. The process is repeated with different samples to obtain candidate solutions along with statistical estimates of their optimality gaps.We present a detailed computational study of the application of the SAA method to solve three classes of stochastic routing problems. These stochastic problems involve an extremely large number of scenarios and first-stage integer variables. For each of the three problem classes, we use decomposition and branch-and-cut to solve the approximating problem within the SAA scheme. Our computational results indicate that the proposed method is successful in solving problems with up to 21694 scenarios to within an estimated 1.0% of optimality. Furthermore, a surprising observation is that the number of optimality cuts required to solve the approximating problem to optimality does not significantly increase with the size of the sample. Therefore, the observed computation times needed to find optimal solutions to the approximating problems grow only linearly with the sample size. As a result, we are able to find provably near-optimal solutions to these difficult stochastic programs using only a moderate amount of computation time.  相似文献   
23.
The global Galerkin method is applied to the benchmark problem that considers an oscillatory regime of convection of air in a tall two‐dimensional rectangular cavity. The three most unstable modes of the linearized system of the Boussinesq equations are studied. The converged values of the critical Rayleigh numbers together with the corresponding oscillation frequencies are calculated for each mode. The oscillatory flow regimes corresponding to each of the three modes are approximated asymptotically. No direct time integration is applied. Good agreement with the previously published results obtained by solution of the time‐dependent Boussinesq equations is reported. Copyright © 2004 John Wiley & Sons, Ltd.  相似文献   
24.
25.
We consider a spinning charge coupled to the Maxwell field. Through the appropriate symmetry in the initial conditions the charge remains at rest. We establish that any time-dependent finite energy solution converges to a sum of a soliton wave and an outgoing free wave. The convergence holds in global energy norm. Under a small constant external magnetic field the soliton manifold is stable in local energy seminorms and the evolution of the angular velocity is guided by an effective finite-dimensional dynamics. The proof uses a non-autonomous integral inequality method.  相似文献   
26.
27.
28.
29.
Dukhovny  Alexander 《Queueing Systems》1997,27(3-4):351-366
We consider systems of GI/M/1 type with bulk arrivals, bulk service and exponential server vacations. The generating functions of the steady-state probabilities of the embedded Markov chain are found in terms of Riemann boundary value problems, a necessary and sufficient condition of ergodicity is proved. Explicit formulas are obtained for the case where the generating function of the arrival group size is rational. Resonance between the vacation rate and the system is studied. Complete formulas are given for the cases of single and geometric arrivals. This revised version was published online in June 2006 with corrections to the Cover Date.  相似文献   
30.
The classical Yang–Baxter equation(CYBE) is an algebraic equation central in the theory of integrable systems. Its nondegenerate solutions were classified by Belavin and Drinfeld. Quantization of CYBE led to the theory of quantum groups. A geometric interpretation of CYBE was given by Drinfeld and gave rise to the theory of Poisson–Lie groups. The classical dynamical Yang–Baxter equation (CDYBE) is an important differential equation analogous to CYBE and introduced by Felder as the consistency condition for the differential Knizhnik–Zamolodchikov–Bernard equations for correlation functions in conformal field theory on tori. Quantization of CDYBE allowed Felder to introduce an interesting elliptic analog of quantum groups. It becomes clear that numerous important notions and results connected with CYBE have dynamical analogs. In this paper we classify solutions to CDYBE and give geometric interpretation to CDYBE. The classification and interpretation are remarkably analogous to the Belavin–Drinfeld picture. Received: 24 March 1997 / Accepted: 20 June 1997  相似文献   
设为首页 | 免责声明 | 关于勤云 | 加入收藏

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