全文获取类型
收费全文 | 740篇 |
免费 | 31篇 |
国内免费 | 13篇 |
专业分类
化学 | 35篇 |
力学 | 43篇 |
综合类 | 6篇 |
数学 | 603篇 |
物理学 | 97篇 |
出版年
2024年 | 1篇 |
2023年 | 10篇 |
2022年 | 13篇 |
2021年 | 8篇 |
2020年 | 8篇 |
2019年 | 13篇 |
2018年 | 24篇 |
2017年 | 18篇 |
2016年 | 14篇 |
2015年 | 20篇 |
2014年 | 30篇 |
2013年 | 85篇 |
2012年 | 31篇 |
2011年 | 55篇 |
2010年 | 35篇 |
2009年 | 54篇 |
2008年 | 50篇 |
2007年 | 64篇 |
2006年 | 35篇 |
2005年 | 24篇 |
2004年 | 23篇 |
2003年 | 19篇 |
2002年 | 17篇 |
2001年 | 14篇 |
2000年 | 20篇 |
1999年 | 12篇 |
1998年 | 13篇 |
1997年 | 10篇 |
1996年 | 5篇 |
1995年 | 6篇 |
1994年 | 11篇 |
1993年 | 6篇 |
1992年 | 6篇 |
1991年 | 2篇 |
1990年 | 1篇 |
1989年 | 2篇 |
1988年 | 4篇 |
1987年 | 1篇 |
1986年 | 2篇 |
1985年 | 4篇 |
1984年 | 1篇 |
1982年 | 2篇 |
1981年 | 3篇 |
1980年 | 2篇 |
1979年 | 2篇 |
1978年 | 1篇 |
1977年 | 2篇 |
1976年 | 1篇 |
排序方式: 共有784条查询结果,搜索用时 17 毫秒
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.
Adrian Doicu Franz Schreier Michael Hess 《Journal of Quantitative Spectroscopy & Radiative Transfer》2004,83(1):47-61
In this paper we present different inversion algorithms for nonlinear ill-posed problems arising in atmosphere remote sensing. The proposed methods are Landweber's method (LwM), the iteratively regularized Gauss-Newton method, and the conventional and regularizing Levenberg-Marquardt method. In addition, some accelerated LwMs and a technique for smoothing the Levenberg-Marquardt solution are proposed. The numerical performance of the methods is studied by means of simulations. Results are presented for an inverse problem in atmospheric remote sensing, i.e., temperature sounding with an airborne uplooking high-resolution far-infrared spectrometer. 相似文献
3.
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). 相似文献
4.
In the present work we consider the problem of interpolating scattered data using radial basis functions (RBF). In general, it is well known that this leads to a discrete linear inverse problem that needs to be regularized in order to provide a meaningful solution. The work focuses on a metric-regularization approach, based on a new class of RBF, called anisotropic RBF. The work provides theoretical justifications for the regularization approach and it considers a suitable proposal for the metric, supporting it by numerical examples. 相似文献
5.
Thomas Andreae 《Journal of Graph Theory》2002,39(4):222-229
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 i ≠ j. 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 相似文献
6.
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. 相似文献
7.
An adaptive pruning algorithm for the discrete L-curve criterion 总被引:1,自引:0,他引:1
Per Christian Hansen Toke Koldborg Jensen Giuseppe Rodriguez 《Journal of Computational and Applied Mathematics》2007
We describe a robust and adaptive implementation of the L-curve criterion. The algorithm locates the corner of a discrete L-curve which is a log–log plot of corresponding residual norms and solution norms of regularized solutions from a method with a discrete regularization parameter (such as truncated SVD or regularizing CG iterations). Our algorithm needs no predefined parameters, and in order to capture the global features of the curve in an adaptive fashion, we use a sequence of pruned L-curves that correspond to considering the curves at different scales. We compare our new algorithm to existing algorithms and demonstrate its robustness by numerical examples. 相似文献
8.
Nicolas Victoir 《Journal of Functional Analysis》2004,208(1):107-121
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. 相似文献
9.
Ronald I. Becker Isabella Lari Andrea Scozzari Giovanni Storchi 《Annals of Operations Research》2007,150(1):65-78
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. 相似文献
10.
Peter Friz Nicolas Victoir 《Annales de l'Institut Henri Poincaré (B) Probabilités et Statistiques》2007,43(6):775-785
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. 相似文献