首页 | 本学科首页   官方微博 | 高级检索  
文章检索
  按 检索   检索词:      
出版年份:   被引次数:   他引次数: 提示:输入*表示无穷大
  收费全文   2577篇
  免费   361篇
  国内免费   171篇
化学   74篇
力学   409篇
综合类   40篇
数学   1545篇
物理学   1041篇
  2024年   5篇
  2023年   36篇
  2022年   63篇
  2021年   62篇
  2020年   59篇
  2019年   79篇
  2018年   72篇
  2017年   63篇
  2016年   93篇
  2015年   71篇
  2014年   112篇
  2013年   285篇
  2012年   108篇
  2011年   129篇
  2010年   120篇
  2009年   134篇
  2008年   174篇
  2007年   167篇
  2006年   172篇
  2005年   158篇
  2004年   113篇
  2003年   129篇
  2002年   113篇
  2001年   81篇
  2000年   87篇
  1999年   68篇
  1998年   76篇
  1997年   43篇
  1996年   30篇
  1995年   41篇
  1994年   26篇
  1993年   15篇
  1992年   21篇
  1991年   10篇
  1990年   12篇
  1989年   12篇
  1988年   10篇
  1987年   11篇
  1986年   8篇
  1985年   6篇
  1984年   5篇
  1983年   2篇
  1982年   5篇
  1981年   2篇
  1980年   4篇
  1978年   7篇
  1976年   3篇
  1975年   2篇
  1970年   1篇
  1969年   1篇
排序方式: 共有3109条查询结果,搜索用时 0 毫秒
41.
本文应用不动点原理研究了高维离散周期系统的存在周期解的唯一性和稳定性,给出了存在平稳振荡和唯一周期解的充分条件.  相似文献   
42.
在引进几乎不变子集的基础上定义一般的离散交换群上的广义Toeplitz算子,研究该算子的一些性质,得到了几乎不变子集的一个刻画以及由该广义Toeplitz算子生成的C*-代数的一个正合序列。  相似文献   
43.
Let X 1, X 2,... be a sequence of nonnegative integer valued random variables.For each nonnegative integer i, we are given a positive integer k i . For every i = 0, 1, 2,..., E i denotes the event that a run of i of length k i occurs in the sequence X 1, X 2,.... For the sequence X 1, X 2,..., the generalized pgf's of the distributions of the waiting times until the r-th occurrence among the events % MathType!MTEF!2!1!+-% feaafeart1ev1aaatCvAUfeBSjuyZL2yd9gzLbvyNv2CaerbuLwBLn% hiov2DGi1BTfMBaeXafv3ySLgzGmvETj2BSbqefm0B1jxALjhiov2D% aebbfv3ySLgzGueE0jxyaibaiiYdd9qrFfea0dXdf9vqai-hEir8Ve% ea0de9qq-hbrpepeea0db9q8as0-LqLs-Jirpepeea0-as0Fb9pgea% 0lrP0xe9Fve9Fve9qapdbaqaaeGacaGaaiaabeqaamaabaabcaGcba% WaaiWabeaacaWGfbWaaSbaaSqaaiaadMgaaeqaaaGccaGL7bGaayzF% aaWaa0baaSqaaiaadMgacqGH9aqpcaaIWaaabaGaeyOhIukaaaaa!43D8!\[\left\{ {E_i } \right\}_{i = 0}^\infty\]are obtained. Though our situations are general, the results are very simple. For the special cases that X's are i.i.d. and {0, 1}-valued, the corresponding results are consistent with previously published results.This research was partially supported by the ISM Cooperative Research Program (90-ISM-CRP-11) of the Institute of Statistical Mathematics.  相似文献   
44.
既不离散也不连续的随机变量   总被引:1,自引:1,他引:1  
杨桂元 《大学数学》2003,19(3):95-96
讨论了既不离散也不连续的随机变量 ,并纠正了有关文献中关于连续型随机变量定义中的错误 .  相似文献   
45.
We address the problem of interrelations between the properties of an action of a discrete group on a compact Hausdorff space and the algebraic and analytical properties of the module of all continuous functions over the algebra of invariant continuous functions . The present paper is a continuation of our joint paper with M. Frank and V. Manuilov. Here we prove some statements inverse to the ones obtained in that paper: we deduce properties of actions from properties of modules. In particular, it is proved that if for a uniformly continuous action the module is finitely generated projective over , then the cardinality of orbits of the action is finite and fixed. Sufficient conditions for existence of natural conditional expectations are obtained.

  相似文献   

46.
本文建立了森林发展系统的一类非线性林龄面积结构的半离散模型 ,并讨论了半离散系统解的存在唯一性 ,给出了线性半离散系统稳定的一些充分条件  相似文献   
47.
In this paper, theoretical results are described on the maximum norm stability and accuracy of finite difference discretizations of parabolic equations on overset nonmatching space-time grids. We consider parabolic equations containing a linear reaction term on a space-time domain which is decomposed into an overlapping collection of cylindrical subregions of the form , for . Each of the space-time domains are assumed to be independently grided (in parallel) according to the local geometry and space-time regularity of the solution, yielding space-time grids with mesh parameters and . In particular, the different space-time grids need not match on the regions of overlap, and the time steps can differ from one grid to the next. We discretize the parabolic equation on each local grid by employing an explicit or implicit -scheme in time and a finite difference scheme in space satisfying a discrete maximum principle. The local discretizations are coupled together, without the use of Lagrange multipliers, by requiring the boundary values on each space-time grid to match a suitable interpolation of the solution on adjacent grids. The resulting global discretization yields a large system of coupled equations which can be solved by a parallel Schwarz iterative procedure requiring some communication between adjacent subregions. Our analysis employs a contraction mapping argument.

Applications of the results are briefly indicated for reaction-diffusion equations with contractive terms and heterogeneous hyperbolic-parabolic approximations of parabolic equations.

  相似文献   

48.
This work is devoted to near-optimal controls of large-scale discrete-time nonlinear dynamic systems driven by Markov chains; the underlying problem is to minimize an expected cost function. Our main goal is to reduce the complexity of the underlying systems. To achieve this goal, discrete-time control models under singularly-perturbed Markov chains are introduced. Using a relaxed control representation, our effort is devoted to finding near-optimal controls. Lumping the states in each irreducible class into a single state gives rise to a limit system. Applying near-optimal controls of the limit system to the original system, near-optimal controls of the original system are derived.  相似文献   
49.
This paper examines the complexity of global verification for MAX-SAT, MAX-k-SAT (for k3), Vertex Cover, and Traveling Salesman Problem. These results are obtained by adaptations of the transformations that prove such problems to be NP-complete. The class of problems PGS is defined to be those discrete optimization problems for which there exists a polynomial time algorithm such that given any solution , either a solution can be found with a better objective function value or it can be concluded that no such solution exists and is a global optimum. This paper demonstrates that if any one of MAX-SAT, MAX-k-SAT (for k3), Vertex Cover, or Traveling Salesman Problem are in PGS, then P=NP.  相似文献   
50.
李子臣和杨义先基于离散对数和素因子分解两个困难问题提出了具有消息恢复的数字签名方案-LY方案,武丹和李善庆指出了LY方案的安全性仅仅依赖于因子分解问题,为弥补这个缺陷他们同时给出了一个改进方案——WL方案.但是,该改进方案的安全性并不象作者所认为的那样依赖于两个难题.一旦因子分解问题可解,攻击者就可以伪造签名.  相似文献   
设为首页 | 免责声明 | 关于勤云 | 加入收藏

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