首页 | 本学科首页   官方微博 | 高级检索  
文章检索
  按 检索   检索词:      
出版年份:   被引次数:   他引次数: 提示:输入*表示无穷大
  收费全文   5606篇
  免费   788篇
  国内免费   492篇
化学   201篇
力学   698篇
综合类   155篇
数学   4642篇
物理学   1190篇
  2024年   12篇
  2023年   48篇
  2022年   76篇
  2021年   85篇
  2020年   138篇
  2019年   132篇
  2018年   166篇
  2017年   186篇
  2016年   219篇
  2015年   129篇
  2014年   230篇
  2013年   435篇
  2012年   262篇
  2011年   330篇
  2010年   301篇
  2009年   342篇
  2008年   387篇
  2007年   369篇
  2006年   367篇
  2005年   329篇
  2004年   295篇
  2003年   245篇
  2002年   251篇
  2001年   186篇
  2000年   209篇
  1999年   158篇
  1998年   133篇
  1997年   134篇
  1996年   102篇
  1995年   115篇
  1994年   68篇
  1993年   73篇
  1992年   58篇
  1991年   37篇
  1990年   49篇
  1989年   27篇
  1988年   20篇
  1987年   19篇
  1986年   22篇
  1985年   16篇
  1984年   18篇
  1983年   9篇
  1982年   15篇
  1981年   6篇
  1980年   9篇
  1979年   10篇
  1978年   13篇
  1977年   14篇
  1974年   8篇
  1973年   7篇
排序方式: 共有6886条查询结果,搜索用时 16 毫秒
1.
This work is concerned with the extension of the Jacobi spectral Galerkin method to a class of nonlinear fractional pantograph differential equations. First, the fractional differential equation is converted to a nonlinear Volterra integral equation with weakly singular kernel. Second, we analyze the existence and uniqueness of solutions for the obtained integral equation. Then, the Galerkin method is used for solving the equivalent integral equation. The error estimates for the proposed method are also investigated. Finally, illustrative examples are presented to confirm our theoretical analysis.  相似文献   
2.
3.
Parallel preconditioners are presented for the solution of general linear systems of equations. The computation of these preconditioners is achieved by orthogonal projections related to the Frobenius inner product. So, minM∈??AM?IF and matrix M0∈?? corresponding to this minimum (?? being any vectorial subspace of ??n(?)) are explicitly computed using accumulative formulae in order to reduce computational cost when subspace ?? is extended to another one containing it. Every step, the computation is carried out taking advantage of the previous one, what considerably reduces the amount of work. These general results are illustrated with the subspace of matrices M such that AM is symmetric. The main application is developed for the subspace of matrices with a given sparsity pattern which may be constructed iteratively by augmenting the set of non‐zero entries in each column. Finally, the effectiveness of the sparse preconditioners is illustrated with some numerical experiments. Copyright © 2002 John Wiley & Sons, Ltd.  相似文献   
4.
本文引入了一类新的含参广义集值拟变分包含组,应用隐预解算子技巧,建立了该类变分包含组与一类不动点问题的等价性,在适当的条件下,分析了含参广义集值拟变分包含组的解的灵敏性,所得结果推广改进了最新文献中的许多结果.  相似文献   
5.
6.
We generalize the method that is used to study corrections to Cardy-Verlinde formula due to generalized uncertainty principle and discuss corrections to Cardy-Verlinde formula due to generalized uncertainty principle in (anti)-de Sitter space. Because in de Sitter black hole spacetime the radiation temperature of the black hole horizon is different from the one of the cosmological horizon, this spacetime is a thermodynamical non-equilibrium spacetime.  相似文献   
7.
Summary A lower bound is established for the strip discrepancy of a broad class of point distributions. The bound implies unbounded strip discrepancy for equally weighted point distributions under favorable conditions. The methods of proof use notions from integral geometry.  相似文献   
8.
The multilevel generalized assignment problem is a problem of assigning agents to tasks where the agents can perform tasks at more than one efficiency level. A profit is associated with each assignment and the objective of the problem is profit maximization. Two heuristic solution methods are presented for the problem. The heuristics are developed from solution methods for the generalized assignment problem. One method uses a regret minimization approach whilst the other method uses a repair approach on a relaxation of the problem. The heuristics are able to solve moderately large instances of the problem rapidly and effectively. Procedures for deriving an upper bound on the solution of the problem are also described. On larger and harder instances of the problem one heuristic is particularly effective.  相似文献   
9.
We show that the difference between the Schrödinger uncertainty relations (UR) and the Heisenberg UR is fundamental. We propose a modified version of stochastic mechanics that allows clearly demonstrating that the contributions from the anticommutator and the commutator to the Schrödinger UR are equally important. A classification of quantum states minimizing the Schrödinger UR at an arbitrary instant is proposed. We show that the correlation of the coordinate and momentum fluctuations in such correlated-coherent states (CCS) is largely determined by the contributions from not only the commutator but also the anticommutator of the corresponding operators. We demonstrate that the character of this correlation changes qualitatively in time from the antiphase correlation typical for the Heisenberg UR to the inphase correlation for which the contribution from the anticommutator is decisive. We comparatively analyze properties of a free microparticle and a quantum oscillator in CCS and show that the CCS correspond to traveling-standing de Broglie waves in both models.  相似文献   
10.
In this paper we introduce a generalization of stable sets: stable multi-sets. A stable multi-set is an assignment of integers to the vertices of a graph, such that specified bounds on vertices and edges are not exceeded. In case all vertex and edge bounds equal one, stable multi-sets are equivalent to stable sets.  For the stable multi-set problem, we derive reduction rules and study the associated polytope. We state necessary and sufficient conditions for the extreme points of the linear relaxation to be integer. These conditions generalize the conditions for the stable set polytope. Moreover, the classes of odd cycle and clique inequalities for stable sets are generalized to stable multi-sets and conditions for them to be facet defining are determined.  The study of stable multi-sets is initiated by optimization problems in the field of telecommunication networks. Stable multi-sets emerge as an important substructure in the design of optical networks. Received: February 14, 2001/Revised version: September 7, 2001  相似文献   
设为首页 | 免责声明 | 关于勤云 | 加入收藏

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