首页 | 本学科首页   官方微博 | 高级检索  
文章检索
  按 检索   检索词:      
出版年份:   被引次数:   他引次数: 提示:输入*表示无穷大
  收费全文   25641篇
  免费   2059篇
  国内免费   2329篇
化学   5608篇
晶体学   107篇
力学   2518篇
综合类   208篇
数学   5924篇
物理学   2528篇
综合类   13136篇
  2024年   112篇
  2023年   289篇
  2022年   526篇
  2021年   593篇
  2020年   702篇
  2019年   598篇
  2018年   603篇
  2017年   744篇
  2016年   904篇
  2015年   775篇
  2014年   1204篇
  2013年   1651篇
  2012年   1423篇
  2011年   1399篇
  2010年   1133篇
  2009年   1379篇
  2008年   1418篇
  2007年   1641篇
  2006年   1396篇
  2005年   1246篇
  2004年   1174篇
  2003年   1026篇
  2002年   1010篇
  2001年   870篇
  2000年   788篇
  1999年   801篇
  1998年   639篇
  1997年   559篇
  1996年   483篇
  1995年   461篇
  1994年   421篇
  1993年   384篇
  1992年   306篇
  1991年   296篇
  1990年   248篇
  1989年   204篇
  1988年   164篇
  1987年   127篇
  1986年   76篇
  1985年   51篇
  1984年   41篇
  1983年   23篇
  1982年   28篇
  1981年   23篇
  1980年   24篇
  1979年   22篇
  1978年   8篇
  1977年   15篇
  1976年   7篇
  1957年   5篇
排序方式: 共有10000条查询结果,搜索用时 15 毫秒
31.
We consider a splitting finite-difference scheme for an initial-boundary value problem for a two-dimensional nonlinear evolutionary equation. The problem is split into nonlinear and linear parts. The linear part is also split into locally one-dimensional equations. We prove the convergence and stability of the scheme in L 2 and C norms. Printed in Lietuvos Matematikos Rinkinys, Vol. 45, No. 3, pp. 413–434, July–September, 2005.  相似文献   
32.
We develop a production policy that controls work-in-process (WIP) levels and satisfies demand in a multistage manufacturing system with significant uncertainty in yield, rework, and demand. The problem addressed in this paper is more general than those in the literature in three aspects: (i) multiple products are processed at multiple workstations, and the capacity of each workstation is limited and shared by multiple operations; (ii) the behavior of a production policy is investigated over an infinite-time horizon, and thus the system stability can be evaluated; (iii) the representation of yield and rework uncertainty is generalized. Generalizing both the system structure and the nature of uncertainty requires a new mathematical development in the theory of infinite-horizon stochastic dynamic programming. The theoretical contributions of this paper are the existence proofs of the optimal stationary control for a stochastic dynamic programming problem and the finite covariances of WIP and production levels under the general expression of uncertainty. We develop a simple and explicit sufficient condition that guarantees the existence of both the optimal stationary control and the system stability. We describe how a production policy can be constructed for the manufacturing system based on the propositions derived.  相似文献   
33.
We consider the following Type of problems. Calls arrive at a queue of capacity K (which is called the primary queue), and attempt to get served by a single server. If upon arrival, the queue is full and the server is busy, the new arriving call moves into an infinite capacity orbit, from which it makes new attempts to reach the primary queue, until it finds it non-full (or it finds the server idle). If the queue is not full upon arrival, then the call (customer) waits in line, and will be served according to the FIFO order. If λ is the arrival rate (average number per time unit) of calls and μ is one over the expected service time in the facility, it is well known that μ > λ is not always sufficient for stability. The aim of this paper is to provide general conditions under which it is a sufficient condition. In particular, (i) we derive conditions for Harris ergodicity and obtain bounds for the rate of convergence to the steady state and large deviations results, in the case that the inter-arrival times, retrial times and service times are independent i.i.d. sequences and the retrial times are exponentially distributed; (ii) we establish conditions for strong coupling convergence to a stationary regime when either service times are general stationary ergodic (no independence assumption), and inter-arrival and retrial times are i.i.d. exponentially distributed; or when inter-arrival times are general stationary ergodic, and service and retrial times are i.i.d. exponentially distributed; (iii) we obtain conditions for the existence of uniform exponential bounds of the queue length process under some rather broad conditions on the retrial process. We finally present conditions for boundedness in distribution for the case of nonpatient (or non persistent) customers. This revised version was published online in June 2006 with corrections to the Cover Date.  相似文献   
34.
采用分枝理论推导非线性系统两变量P和PI控制下的分枝特性,所导得的几个定理阐明了简单分枝点和Hopf分枝点的位置和性质。一个简化精馏塔模型用于演示这一过程,展示出精馏塔系统在闭环时,可能出现多态和极限环。  相似文献   
35.
36.
本文根据两步递归插补的思想,导出了任意三维椭圆弧高速插补的公式和算法.它是空间圆弧高速插补方法在三维椭圆弧的情况下进一步推广应用.本文最后还对插补算法进行了稳定性分析和误差分析.  相似文献   
37.
A singularly perturbed parabolic equation with a nonlinear right-hand side of a special form is examined. A numerical analytical study of such equations is performed.  相似文献   
38.
New photocrosslinkable maleimide copolymers have been synthesized by the attachment of a tricyanopyrrolidene‐based chromophore. The 2‐(3‐cyano‐4‐(2‐{4‐[hexyl‐(6‐hydroxy‐hexyl)‐amino]‐phenyl}‐vinyl)‐5‐oxo‐1‐{4‐[4‐(3‐oxo‐3‐phenyl‐propenyl)‐ phenoxy]‐butyl}‐1,5‐dihydro‐pyrrol‐2‐ylidene)‐malononitrile chromophore exhibits nonlinear optical activity and contains a chalcone moiety that is sensitive to UV light (λ = 330–360 nm) for crosslink formation. The maleimide monomers have also been functionalized with chalcone moieties. The resultant copolymers exhibit great processability, and one of them shows a maximum electrooptic coefficient of 90 pm/V at 1300 nm. We could control the thermal stability of the electrooptic coefficient with the newly synthesized photoreactive copolymers successfully. © 2006 Wiley Periodicals, Inc. J Polym Sci Part A: Polym Chem 45: 531–542, 2007  相似文献   
39.
We give a short proof of a generalization of the Rolewicz theorem based on the uniform boundedness principle.

  相似文献   

40.
In the present paper we develop our approach for studying the stability of integer programming problems. We prove that the L-class enumeration method is stable on integer linear programming problems in the case of bounded relaxation sets [9]. The stability of some cutting plane algorithms is discussed.  相似文献   
设为首页 | 免责声明 | 关于勤云 | 加入收藏

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