全文获取类型
收费全文 | 571篇 |
免费 | 36篇 |
国内免费 | 13篇 |
专业分类
化学 | 35篇 |
力学 | 20篇 |
综合类 | 14篇 |
数学 | 490篇 |
物理学 | 61篇 |
出版年
2024年 | 1篇 |
2023年 | 6篇 |
2022年 | 13篇 |
2021年 | 9篇 |
2020年 | 5篇 |
2019年 | 16篇 |
2018年 | 20篇 |
2017年 | 15篇 |
2016年 | 7篇 |
2015年 | 15篇 |
2014年 | 21篇 |
2013年 | 46篇 |
2012年 | 20篇 |
2011年 | 31篇 |
2010年 | 27篇 |
2009年 | 36篇 |
2008年 | 36篇 |
2007年 | 43篇 |
2006年 | 37篇 |
2005年 | 23篇 |
2004年 | 27篇 |
2003年 | 22篇 |
2002年 | 19篇 |
2001年 | 20篇 |
2000年 | 16篇 |
1999年 | 11篇 |
1998年 | 9篇 |
1997年 | 8篇 |
1996年 | 2篇 |
1995年 | 9篇 |
1994年 | 5篇 |
1993年 | 5篇 |
1992年 | 7篇 |
1991年 | 3篇 |
1990年 | 1篇 |
1989年 | 1篇 |
1988年 | 4篇 |
1987年 | 1篇 |
1986年 | 2篇 |
1985年 | 4篇 |
1984年 | 2篇 |
1982年 | 2篇 |
1981年 | 5篇 |
1980年 | 2篇 |
1979年 | 2篇 |
1978年 | 1篇 |
1977年 | 2篇 |
1976年 | 1篇 |
排序方式: 共有620条查询结果,搜索用时 93 毫秒
81.
The Itô map gives the solution of a Rough Differential Equation, a generalization of an Ordinary Differential Equation driven by an irregular path, when existence and uniqueness hold. By studying how a path is transformed through the vector field which is integrated, we prove that the Itô map is Hölder or Lipschitz continuous with respect to all its parameters. This result unifies and weakens the hypotheses of the regularity results already established in the literature. 相似文献
82.
Following the approach and the terminology introduced in Deya and Schott (2013) [6], we construct a product Lévy area above the q-Brownian motion (for ) and use this object to study differential equations driven by the process.We also provide a detailed comparison between the resulting “rough” integral and the stochastic “Itô” integral exhibited by Donati-Martin (2003) [7]. 相似文献
83.
S. Dereich 《Journal of Functional Analysis》2010,258(9):2910-2936
In this article, we carry out a rough paths analysis for Banach space-valued Wiener processes. We show that most of the features of the classical Wiener process pertain to its rough path analog. To be more precise, the enhanced process has the same scaling properties and it satisfies a Fernique type theorem, a support theorem and a large deviation principle in the same Hölder topologies as the classical Wiener process does. Moreover, the canonical rough paths of finite dimensional approximating Wiener processes converge to the enhanced Wiener process. Finally, a new criterion for the existence of the enhanced Wiener process is provided which is based on compact embeddings. This criterion is particularly handy when analyzing Kunita flows by means of rough paths analysis which is the topic of a forthcoming article. 相似文献
84.
Wilfried Imrich Iztok Peterin Simon Špacapan Cun‐Quan Zhang 《Journal of Graph Theory》2010,64(4):267-276
We prove that the strong product G1? G2 of G1 and G2 is ?3‐flow contractible if and only if G1? G2 is not T? K2, where T is a tree (we call T? K2 a K4‐tree). It follows that G1? G2 admits an NZ 3 ‐flow unless G1? G2 is a K4 ‐tree. We also give a constructive proof that yields a polynomial algorithm whose output is an NZ 3‐flow if G1? G2 is not a K4 ‐tree, and an NZ 4‐flow otherwise. © 2009 Wiley Periodicals, Inc. J Graph Theory 64: 267–276, 2010 相似文献
85.
An exact algorithm for a vehicle routing problem with time windows and multiple use of vehicles 总被引:2,自引:0,他引:2
Nabila Azi Michel Gendreau Jean-Yves Potvin 《European Journal of Operational Research》2010,202(3):756-763
The vehicle routing problem with multiple use of vehicles is a variant of the classical vehicle routing problem. It arises when each vehicle performs several routes during the workday due to strict time limits on route duration (e.g., when perishable goods are transported). The routes are defined over customers with a revenue, a demand and a time window. Given a fixed-size fleet of vehicles, it might not be possible to serve all customers. Thus, the customers must be chosen based on their associated revenue minus the traveling cost to reach them. We introduce a branch-and-price approach to address this problem where lower bounds are computed by solving the linear programming relaxation of a set packing formulation, using column generation. The pricing subproblems are elementary shortest path problems with resource constraints. Computational results are reported on euclidean problems derived from well-known benchmark instances for the vehicle routing problem with time windows. 相似文献
86.
87.
88.
Vladimir Gurvich 《Discrete Applied Mathematics》2010,158(14):1496-302
Consider an electrical circuit, each edge e of which is an isotropic conductor with a monomial conductivity function . In this formula, ye is the potential difference and current in e, while μe is the resistance of e; furthermore, r and s are two strictly positive real parameters common for all edges. In particular, the case r=s=1 corresponds to the standard Ohm’s law.In 1987, Gvishiani and Gurvich [A.D. Gvishiani, V.A. Gurvich, Metric and ultrametric spaces of resistances, in: Communications of the Moscow Mathematical Society, Russian Math. Surveys 42 (6 (258)) (1987) 235-236] proved that, for every two nodes a,b of the circuit, the effective resistance μa,b is well-defined and for every three nodes a,b,c the inequality holds. It obviously implies the standard triangle inequality μa,b≤μa,c+μc,b whenever s≥r. For the case s=r=1, these results were rediscovered in the 1990s. Now, after 23 years, I venture to reproduce the proof of the original result for the following reasons:
- •
- It is more general than just the case r=s=1 and one can get several interesting metric and ultrametric spaces playing with parameters r and s. In particular, (i) the effective Ohm resistance, (ii) the length of a shortest path, (iii) the inverse width of a bottleneck path, and (iv) the inverse capacity (maximum flow per unit time) between any pair of terminals a and b provide four examples of the resistance distances μa,b that can be obtained from the above model by the following limit transitions: (i) r(t)=s(t)≡1, (ii) r(t)=s(t)→∞, (iii) r(t)≡1,s(t)→∞, and (iv) r(t)→0,s(t)≡1, as t→∞. In all four cases the limits μa,b=limt→∞μa,b(t) exist for all pairs a,b and the metric inequality μa,b≤μa,c+μc,b holds for all triplets a,b,c, since s(t)≥r(t) for any sufficiently large t. Moreover, the stronger ultrametric inequality μa,b≤max(μa,c,μc,b) holds for all triplets a,b,c in examples (iii) and (iv), since in these two cases s(t)/r(t)→∞, as t→∞.
- •
- Communications of the Moscow Math. Soc. in Russ. Math. Surveys were (and still are) strictly limited to two pages; the present paper is much more detailed.Although a translation in English of the Russ. Math. Surveys is available, it is not free in the web and not that easy to find.
- •
- The last but not least: priority.
89.
90.