首页 | 本学科首页   官方微博 | 高级检索  
文章检索
  按 检索   检索词:      
出版年份:   被引次数:   他引次数: 提示:输入*表示无穷大
  收费全文   38133篇
  免费   4394篇
  国内免费   2337篇
化学   3354篇
晶体学   42篇
力学   4059篇
综合类   428篇
数学   26402篇
物理学   10579篇
  2024年   80篇
  2023年   373篇
  2022年   476篇
  2021年   644篇
  2020年   1129篇
  2019年   1105篇
  2018年   1027篇
  2017年   1017篇
  2016年   1138篇
  2015年   945篇
  2014年   1735篇
  2013年   3440篇
  2012年   1816篇
  2011年   2179篇
  2010年   2041篇
  2009年   2319篇
  2008年   2398篇
  2007年   2387篇
  2006年   2066篇
  2005年   2035篇
  2004年   1708篇
  2003年   1690篇
  2002年   1492篇
  2001年   1201篇
  2000年   1161篇
  1999年   1057篇
  1998年   986篇
  1997年   837篇
  1996年   622篇
  1995年   521篇
  1994年   434篇
  1993年   287篇
  1992年   304篇
  1991年   276篇
  1990年   240篇
  1989年   156篇
  1988年   147篇
  1987年   138篇
  1986年   145篇
  1985年   171篇
  1984年   159篇
  1983年   76篇
  1982年   129篇
  1981年   116篇
  1980年   92篇
  1979年   93篇
  1978年   59篇
  1977年   62篇
  1976年   54篇
  1973年   21篇
排序方式: 共有10000条查询结果,搜索用时 15 毫秒
91.
变质量非线性非完整系统的Gibbs-Appell方程   总被引:1,自引:0,他引:1  
本文首先将Gibbs-Appell方程推广到最一般的变质量非完整系统.得到变质量非线性非完整系统在广义坐标、准坐标下的Gibbs-Appell方程和积分变分原理,最后给出一个例子.  相似文献   
92.
丁桦  徐守泽 《应用数学和力学》1990,11(12):1043-1047
本文给出了一种求解波动方程反演问题的“多目标函数法”.这种方法简单、有效,并具有明确的物理意义.对于三维问题的程序化它有很强的优越性.  相似文献   
93.
I. Atencia  P. Moreno 《TOP》2003,11(2):285-310
We analyse a single-server retrial queueing system with infinite buffer, Poisson arrivals, general distribution of service time and linear retrial policy. If an arriving customer finds the server occupied, he joins with probabilityp a retrial group (called orbit) and with complementary probabilityq a priority queue in order to be served. After the customer is served completely, he will decide either to return to the priority queue for another service with probability ϑ or to leave the system forever with probability =1−ϑ, where 0≤ϑ<1. We study the ergodicity of the embedded Markov chain, its stationary distribution function and the joint generating function of the number of customers in both groups in the steady-state regime. Moreover, we obtain the generating function of system size distribution, which generalizes the well-knownPollaczek-Khinchin formula. Also we obtain a stochastic decomposition law for our queueing system and as an application we study the asymptotic behaviour under high rate of retrials. The results agree with known special cases. Finally, we give numerical examples to illustrate the effect of the parameters on several performance characteristics.  相似文献   
94.
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.  相似文献   
95.
Glazebrook  K.D.  Lumley  R.R.  Ansell  P.S. 《Queueing Systems》2003,45(2):81-111
We consider the optimal service control of a multiclass M/G/1 queueing system in which customers are served nonpreemptively and the system cost rate is additive across classes and increasing convex in the numbers present in each class. Following Whittle's approach to a class of restless bandit problems, we develop a Langrangian relaxation of the service control problem which serves to motivate the development of a class of index heuristics. The index for a particular customer class is characterised as a fair charge for service of that class. The paper develops these indices and reports an extensive numerical investigation which exhibits strong performance of the index heuristics for both discounted and average costs.  相似文献   
96.
Filippov  V. V. 《Mathematical Notes》2003,73(5-6):859-870
In this paper, we continue extending the theory of boundary-value problems to ordinary differential equations and inclusions with discontinuous right-hand side. To this end, we construct a new version of the method of shifts along trajectories. We compare the results obtained by the new approach and those obtained by the method of Fuik spectra.  相似文献   
97.
We use the classical and nonclassical methods to obtain symmetry reductions and exact solutions of the (2+1)-dimensional integrable Calogero–Bogoyavlenskii–Schiff equation. Although this (2+1)-dimensional equation arises in a nonlocal form, it can be written as a system of differential equations and, in potential form, as a fourth-order partial differential equation. The classical and nonclassical methods yield some exact solutions of the (2+1)-dimensional equation that involve several arbitrary functions and hence exhibit a rich variety of qualitative behavior.  相似文献   
98.
99.
Svinin  A. K. 《Mathematical Notes》2003,74(1-2):91-99
We construct classical point symmetry groups for joint pairs of evolution equations (systems of equations) of integrable hierarchies related to the auxiliary equation of the method of the inverse problem of second order. For the two cases: the hierarchy of Korteweg--de Vries (KdV) equations and of the systems of Kaup equations, we construct simultaneous solutions invariant with respect to the symmetry group. The problem of the construction of these solutions can be reduced, respectively, to the first and second Painlevé equations depending on a parameter. The Painlevé equations are supplemented by the linear evolution equations defining the deformation of the solution of the corresponding Painlevé equation.  相似文献   
100.
Kolesov  Yu. S. 《Mathematical Notes》2003,74(1-2):228-231
We state a theorem on the instability of self-similar cycles and tori of a certain type in a system which is a quasinormal form of a boundary-value problem for a nonlinear wave equation in the square.  相似文献   
设为首页 | 免责声明 | 关于勤云 | 加入收藏

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