首页 | 本学科首页   官方微博 | 高级检索  
文章检索
  按 检索   检索词:      
出版年份:   被引次数:   他引次数: 提示:输入*表示无穷大
  收费全文   1065篇
  免费   80篇
  国内免费   77篇
化学   58篇
力学   158篇
综合类   9篇
数学   756篇
物理学   241篇
  2024年   10篇
  2023年   11篇
  2022年   19篇
  2021年   11篇
  2020年   15篇
  2019年   19篇
  2018年   29篇
  2017年   27篇
  2016年   20篇
  2015年   28篇
  2014年   29篇
  2013年   73篇
  2012年   28篇
  2011年   57篇
  2010年   44篇
  2009年   59篇
  2008年   68篇
  2007年   88篇
  2006年   82篇
  2005年   52篇
  2004年   52篇
  2003年   53篇
  2002年   57篇
  2001年   57篇
  2000年   45篇
  1999年   33篇
  1998年   23篇
  1997年   32篇
  1996年   14篇
  1995年   16篇
  1994年   10篇
  1993年   8篇
  1992年   7篇
  1991年   2篇
  1990年   4篇
  1989年   4篇
  1988年   8篇
  1987年   2篇
  1986年   5篇
  1985年   6篇
  1984年   2篇
  1982年   2篇
  1981年   4篇
  1980年   1篇
  1979年   2篇
  1978年   1篇
  1977年   2篇
  1976年   1篇
排序方式: 共有1222条查询结果,搜索用时 15 毫秒
1.
We discuss the symplectic geometry of linear Hamiltonian systems with nondegenerate Hamiltonians. These systems can be reduced to linear second-order differential equations characteristic of linear oscillation theory. This reduction is related to the problem on the signatures of restrictions of quadratic forms to Lagrangian planes. We study vortex symplectic planes invariant with respect to linear Hamiltonian systems. These planes are determined by the solutions of quadratic matrix equations of a special form. New conditions for gyroscopic stabilization are found.  相似文献   
2.
We derive a test problem for evaluating the ability of time-steppingmethods to preserve the statistical properties of systems inmolecular dynamics. We consider a family of deterministic systemsconsisting of a finite number of particles interacting on acompact interval. The particles are given random initial conditionsand interact through instantaneous energy- and momentum-conservingcollisions. As the number of particles, the particle density,and the mean particle speed go to infinity, the trajectory ofa tracer particle is shown to converge to a stationary Gaussianstochastic process. We approximate this system by one describedby a system of ordinary differential equations and provide numericalevidence that it converges to the same stochastic process. Wesimulate the latter system with a variety of numerical integrators,including the symplectic Euler method, a fourth-order Runge-Kuttamethod, and an energyconserving step-and-project method. Weassess the methods' ability to recapture the system's limitingstatistics and observe that symplectic Euler performs significantlybetter than the others for comparable computational expense.  相似文献   
3.
4.
In this paper, we evaluate various analytic Feynman integrals of first variation, conditional first variation, Fourier-Feynman transform and conditional Fourier-Feynman transform of cylinder type functions defined over Wiener paths in abstract Wiener space. We also derive the analytic Feynman integral of the conditional Fourier-Feynman transform for the product of the cylinder type functions which define the functions in a Banach algebra introduced by Yoo, with n linear factors.  相似文献   
5.
6.
On Covariant Phase Space and the Variational Bicomplex   总被引:1,自引:0,他引:1  
The notion of a phase space in classical mechanics is well known. The extension of this concept to field theory however, is a challenging endeavor, and over the years numerous proposals for such a generalization have appeared in the literature. In this paper We review a Hamiltonian formulation of Lagrangian field theory based on an extension to infinite dimensions of J.-M. Souriau's symplectic approach to mechanics. Following G. Zuckerman, we state our results in terms of the modern geometric theory of differential equations and the variational bicomplex. As an elementary example, we construct a phase space for the Monge–Ampere equation.  相似文献   
7.
8.
For a graph A and a positive integer n, let nA denote the union of n disjoint copies of A; similarly, the union of ?0 disjoint copies of A is referred to as ?0A. It is shown that there exist (connected) graphs A and G such that nA is a minor of G for all n??, but ?0A is not a minor of G. This supplements previous examples showing that analogous statements are true if, instead of minors, isomorphic embeddings or topological minors are considered. The construction of A and G is based on the fact that there exist (infinite) graphs G1, G2,… such that Gi is not a minor of Gj for all ij. In contrast to previous examples concerning isomorphic embeddings and topological minors, the graphs A and G presented here are not locally finite. The following conjecture is suggested: for each locally finite connected graph A and each graph G, if nA is a minor of G for all n ? ?, then ?0A is a minor of G, too. If true, this would be a far‐reaching generalization of a classical result of R. Halin on families of disjoint one‐way infinite paths in graphs. © 2002 Wiley Periodicals, Inc. J Graph Theory 39: 222–229, 2002; DOI 10.1002/jgt.10016  相似文献   
9.
Let G=(V,E) be a (directed) graph with vertex set V and edge (arc) set E. Given a set P of source-sink pairs of vertices of G, an important problem that arises in the computation of network reliability is the enumeration of minimal subsets of edges (arcs) that connect/disconnect all/at least one of the given source-sink pairs of P. For undirected graphs, we show that the enumeration problems for conjunctions of paths and disjunctions of cuts can be solved in incremental polynomial time. Furthermore, under the assumption that P consists of all pairs within a given vertex set, we also give incremental polynomial time algorithm for enumerating all minimal path disjunctions and cut conjunctions. For directed graphs, the enumeration problem for cut disjunction is known to be NP-complete. We extend this result to path conjunctions and path disjunctions, leaving open the complexity of the enumeration of cut conjunctions. Finally, we give a polynomial delay algorithm for enumerating all minimal sets of arcs connecting two given nodes s1 and s2 to, respectively, a given vertex t1, and each vertex of a given subset of vertices T2.  相似文献   
10.
This note extends the work of Capitaine (J. Funct. Anal. 179 (1) (2001) 153) on the Levy area process for the free Brownian motion in two directions. First, we reprove that a Levy area for the Free Brownian motion exists in the Von Neumann tensor product, by exhibiting a non-commutative Burkholder-Davis-Gundy type inequality. Then, we show that there does not exist a Levy area in the projective tensor product.  相似文献   
设为首页 | 免责声明 | 关于勤云 | 加入收藏

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