首页 | 本学科首页   官方微博 | 高级检索  
文章检索
  按 检索   检索词:      
出版年份:   被引次数:   他引次数: 提示:输入*表示无穷大
  收费全文   448篇
  免费   21篇
  国内免费   10篇
化学   36篇
力学   30篇
综合类   8篇
数学   354篇
物理学   51篇
  2024年   1篇
  2023年   5篇
  2022年   10篇
  2021年   6篇
  2020年   4篇
  2019年   12篇
  2018年   17篇
  2017年   11篇
  2016年   7篇
  2015年   13篇
  2014年   14篇
  2013年   39篇
  2012年   9篇
  2011年   29篇
  2010年   19篇
  2009年   33篇
  2008年   27篇
  2007年   33篇
  2006年   25篇
  2005年   16篇
  2004年   24篇
  2003年   15篇
  2002年   13篇
  2001年   13篇
  2000年   12篇
  1999年   8篇
  1998年   8篇
  1997年   8篇
  1996年   3篇
  1995年   5篇
  1994年   5篇
  1993年   4篇
  1992年   5篇
  1991年   2篇
  1989年   1篇
  1988年   3篇
  1987年   1篇
  1986年   2篇
  1985年   4篇
  1984年   1篇
  1982年   2篇
  1981年   3篇
  1980年   1篇
  1979年   2篇
  1978年   1篇
  1977年   2篇
  1976年   1篇
排序方式: 共有479条查询结果,搜索用时 109 毫秒
1.
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.  相似文献   
2.
We prove that the sequence of finite reflecting branching Brownian motion forests defined by Burdzy and Le Gall ([1]) converges in probability to the “super-Brownian motion with reflecting historical paths.” This solves an open problem posed in [1], where only tightness was proved for the sequence of approximations. Several results on path behavior were proved in [1] for all subsequential limits–they obviously hold for the unique limit found in the present paper.Mathematics Subject Classification (2000): Primary 60H15, Secondary 35R60Supported in part by NSF Grant DMS-0071486, Israel Science Foundation Grants 12/98 and 116/01 - 10.0, and the U.S.-Israel Binational Science Foundation (grant No. 2000065).  相似文献   
3.
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  相似文献   
4.
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.  相似文献   
5.
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.  相似文献   
6.
In this paper we consider the location of a path shaped facility on a grid graph. In the literature this problem was extensively studied on particular classes of graphs as trees or series-parallel graphs. We consider here the problem of finding a path which minimizes the sum of the (shortest) distances from it to the other vertices of the grid, where the path is also subject to an additional constraint that takes the form either of the length of the path or of the cardinality. We study the complexity of these problems and we find two polynomial time algorithms for two special cases, with time complexity of O(n) and O(nℓ) respectively, where n is the number of vertices of the grid and ℓ is the cardinality of the path to be located. The literature about locating dimensional facilities distinguishes between the location of extensive facilities in continuous spaces and network facility location. We will show that the problems presented here have a close connection with continuous dimensional facility problems, so that the procedures provided can also be useful for solving some open problems of dimensional facilities location in the continuous case.  相似文献   
7.
We study large deviation principles for Gaussian processes lifted to the free nilpotent group of step N. We apply this to a large class of Gaussian processes lifted to geometric rough paths. A large deviation principle for enhanced (fractional) Brownian motion, in Hölder- or modulus topology, appears as special case.  相似文献   
8.
We present anO(p · n) algorithm for the problem of finding disjoint simple paths of minimum total length betweenp given pairs of terminals on oriented partial 2-trees withn nodes and positive or negative arc lengths. The algorithm is inO(n) if all terminals are distinct nodes. We characterize the convex hull of the feasible solution set for the casep=2.We gratefully acknowledge the referee's many helpful suggestions to improve the presentation of this paper.  相似文献   
9.
Gradient extremals are curves in configuration space denned by the condition that the gradient of the potential energy is an eigenvector of the Hessian matrix. Solutions of a corresponding equation go along a valley floor or along a crest of a ridge, if the norm of the gradient is a minimum, and along a cirque or a cliff or a flank of one of the two if the gradient norm is a maximum. Properties of gradient extremals are discussed for simple 2D model surfaces including the problem of valley bifurcations.  相似文献   
10.
The intermolecular interaction energy for reacting systems in singlet, triplet and doublet states was partitioned by the perturbation expansion method into the chemically meaningful five interaction terms: the Coulomb, exchange-repulsion, induction, dispersion, and charge-transfer energies. In the local ZDO approximation, these energy terms were evaluated for the dimerization of methylenes (1,3CH2), the additions of carbenes (1,3CH2 and1,3CF2) as well as amino radicals (2NH2 and2NF2) toward ethylene, and the hydrogen abstractions by methylenes (1,3CH2), nitrene (3NH), and hydroxyl radical (2OH) from methane. It has been found that the reaction path is much influenced by the spinmultiplicity, and that the charge-transfer and exchange-repulsion terms play a dominant role in determining the course of reactions.  相似文献   
设为首页 | 免责声明 | 关于勤云 | 加入收藏

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