首页 | 本学科首页   官方微博 | 高级检索  
文章检索
  按 检索   检索词:      
出版年份:   被引次数:   他引次数: 提示:输入*表示无穷大
  收费全文   3456篇
  免费   124篇
  国内免费   22篇
化学   2040篇
晶体学   11篇
力学   145篇
数学   493篇
物理学   683篇
无线电   230篇
  2024年   3篇
  2023年   42篇
  2022年   59篇
  2021年   121篇
  2020年   107篇
  2019年   96篇
  2018年   65篇
  2017年   52篇
  2016年   142篇
  2015年   98篇
  2014年   145篇
  2013年   178篇
  2012年   239篇
  2011年   270篇
  2010年   152篇
  2009年   133篇
  2008年   216篇
  2007年   207篇
  2006年   215篇
  2005年   195篇
  2004年   152篇
  2003年   133篇
  2002年   130篇
  2001年   54篇
  2000年   26篇
  1999年   30篇
  1998年   33篇
  1997年   41篇
  1996年   37篇
  1995年   21篇
  1994年   22篇
  1993年   18篇
  1992年   7篇
  1991年   16篇
  1990年   9篇
  1989年   9篇
  1988年   12篇
  1987年   9篇
  1986年   12篇
  1985年   9篇
  1984年   10篇
  1983年   9篇
  1982年   12篇
  1981年   15篇
  1980年   8篇
  1979年   10篇
  1978年   5篇
  1977年   4篇
  1976年   2篇
  1975年   9篇
排序方式: 共有3602条查询结果,搜索用时 765 毫秒
991.
The high- and low-energy limits of a chain of coupled rotators are integrable and correspond respectively to a set of free rotators and to a chain of harmonic oscillators. For intermediate values of the energy, numerical calculations show the agreement of finite time averages of physical observables with their Gibbsian estimate. The boundaries between the two integrable limits and the statistical domain are analytically computed using the Gibbsian estimates of dynamical observables. For large energies the geometry of nonlinear resonances enables the definition of relevant 1.5-degree-of-freedom approximations of the dynamics. They provide resonance overlap parameters whose Gibbsian probability distribution may be computed. Requiring the support of this distribution to be right above the large-scale stochasticity threshold of the 1.5-degree-of-freedom dynamics yields the boundary at the large-energy limit. At the low-energy limit, the boundary is shown to correspond to the energy where the specific heat departs from that of the corresponding harmonic chain.  相似文献   
992.
In this paper we introduce a theory of finite sets FST with a strong negation of the axiom of infinity asserting that every set is provably bijective with a natural number. We study in detail the role of the axioms of Power Set, Choice, Regularity in FST, pointing out the relative dependences or independences among them. FST is shown to be provably equivalent to a fragment of Alternative Set Theory. Furthermore, the introduction of FST is motivated in view of a non-standard development. MSC: 03E30, 03E35.  相似文献   
993.
Positronium, the bound state of an electron and a positron, is an exactly soluble quantum system, similar to a light isotope of hydrogen. It can be studied using the finite basis quantum chemistry codes developed for atoms and molecules. In fact, positronium can be mimicked by two electrons with opposite spins, in the absence of any nucleus and having the sign of the Coulomb interaction reversed. The exact wave function has a cusp in the points of coalescence of the two particles (a “Coulomb peak”), and this fact makes the convergence of the total energy, as a function of the basis set size, extremely slow. For this reason, positronium can be used to test the convergence properties of the quantum chemistry methods used to describe the dynamic correlation. © 2001 John Wiley & Sons, Inc. Int J Quantum Chem, 2001  相似文献   
994.
In this paper we consider strongly polynomial variations of the auction algorithm for the single origin/many destinations shortest path problem. These variations are based on the idea of graph reduction, that is, deleting unnecessary arcs of the graph by using certain bounds naturally obtained in the course of the algorithm. We study the structure of the reduced graph and we exploit this structure to obtain algorithms withO (n min{m, n logn}) andO(n 2) running time. Our computational experiments show that these algorithms outperform their closest competitors on randomly generated dense all destinations problems, and on a broad variety of few destination problems.Research supported by NSF under Grant No. DDM-8903385, by the ARO under Grant DAAL03-86-K-0171, by a CNR-GNIM grant, and by a Fullbright grant  相似文献   
995.
We report finite-bias differential conductance measurements through a split-gate constriction in the integer quantum Hall regime at ν=1. Both enhanced and suppressed zero-bias inter-edge backscattering can be obtained in a controllable way by changing the split-gate voltage. This behavior is interpreted in terms of local charge depletion and particle–hole symmetry. We discuss the relevance of particle–hole symmetry in connection with the chiral Luttinger model of edge states.  相似文献   
996.
997.
We present an argument for proving the existence of local stable and unstable manifolds in a general abstract setting and under very weak hyperbolicity conditions.  相似文献   
998.
We study the asymptotic time behavior of global smooth solutions to general entropy, dissipative, hyperbolic systems of balance laws in m space dimensions, under the Shizuta‐Kawashima condition. We show that these solutions approach a constant equilibrium state in the Lp‐norm at a rate O(t? (m/2)(1 ? 1/p)) as t → ∞ for p ∈ [min{m, 2}, ∞]. Moreover, we can show that we can approximate, with a faster order of convergence, the conservative part of the solution in terms of the linearized hyperbolic operator for m ≥ 2, and by a parabolic equation, in the spirit of Chapman‐Enskog expansion in every space dimension. The main tool is given by a detailed analysis of the Green function for the linearized problem. © 2007 Wiley Periodicals, Inc.  相似文献   
999.
1000.
In this paper, the problem of locating new facilities in a competitive environment is considered. The problem is formulated as the firm expected profit maximization and a set of nodes is selected in a graph representing the geographical zone. Profit depends on fixed and deterministic location costs and, since customers are independent decision-makers, on the expected market share. The problem is an instance of nonlinear integer programming, because the objective function is concave and submodular. Due to this complexity a branch & bound method is developed for solving small size problems (that is, when the number of nodes is less than 50), while a heuristic is necessary for larger problems. The branch & bound is called data-correcting method, while the approximate solutions are obtained using the heuristic-concentration method.  相似文献   
设为首页 | 免责声明 | 关于勤云 | 加入收藏

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