全文获取类型
收费全文 | 2291篇 |
免费 | 104篇 |
国内免费 | 202篇 |
专业分类
化学 | 195篇 |
力学 | 35篇 |
综合类 | 30篇 |
数学 | 2205篇 |
物理学 | 132篇 |
出版年
2024年 | 3篇 |
2023年 | 19篇 |
2022年 | 30篇 |
2021年 | 25篇 |
2020年 | 35篇 |
2019年 | 48篇 |
2018年 | 50篇 |
2017年 | 44篇 |
2016年 | 59篇 |
2015年 | 41篇 |
2014年 | 98篇 |
2013年 | 151篇 |
2012年 | 82篇 |
2011年 | 98篇 |
2010年 | 87篇 |
2009年 | 147篇 |
2008年 | 187篇 |
2007年 | 137篇 |
2006年 | 131篇 |
2005年 | 125篇 |
2004年 | 85篇 |
2003年 | 96篇 |
2002年 | 83篇 |
2001年 | 85篇 |
2000年 | 80篇 |
1999年 | 79篇 |
1998年 | 74篇 |
1997年 | 61篇 |
1996年 | 53篇 |
1995年 | 32篇 |
1994年 | 25篇 |
1993年 | 25篇 |
1992年 | 22篇 |
1991年 | 15篇 |
1990年 | 15篇 |
1989年 | 16篇 |
1988年 | 15篇 |
1987年 | 5篇 |
1986年 | 4篇 |
1985年 | 25篇 |
1984年 | 17篇 |
1983年 | 4篇 |
1982年 | 13篇 |
1981年 | 15篇 |
1980年 | 19篇 |
1979年 | 15篇 |
1978年 | 8篇 |
1977年 | 5篇 |
1976年 | 4篇 |
1936年 | 1篇 |
排序方式: 共有2597条查询结果,搜索用时 171 毫秒
11.
A planar map is a 2-cell embedding of a connected planar graph, loops and parallel edges allowed, on the sphere. A plane map is a planar map with a distinguished outside (“infinite”) face. An unrooted map is an equivalence class of maps under orientation-preserving homeomorphism, and a rooted map is a map with a distinguished oriented edge. Previously we obtained formulae for the number of unrooted planar n-edge maps of various classes, including all maps, non-separable maps, eulerian maps and loopless maps. In this article, using the same technique we obtain closed formulae for counting unrooted plane maps of all these classes and their duals. The corresponding formulae for rooted maps are known to be all sum-free; the formulae that we obtain for unrooted maps contain only a sum over the divisors of n. We count also unrooted two-vertex plane maps. 相似文献
12.
Silvia Vogel 《Annals of Operations Research》2006,142(1):269-282
The paper considers upper semicontinuous behavior in distribution of sequences of random closed sets. Semiconvergence in distribution
will be described via convergence in distribution of random variables with values in a suitable topological space. Convergence
statements for suitable functions of random sets are proved and the results are employed to derive stability statements for
random optimization problems where the objective function and the constraint set are approximated simultaneously.
The author is grateful to two anonymous referees for helpful suggestions. 相似文献
13.
The objective of this paper is to analyze under what well-known operations the class of quasipolyhedral convex functions,
which can be regarded as an extension of that of polyhedral convex functions, is closed. The operations that will be considered
are those that preserve polyhedral convexity, such that the image and the inverse image under linear transformations, right
scalar multiplication (including the case where λ=0+) and pointwise addition.
相似文献
14.
Shui Cao ZHENG Huo Nan LIN Di He HU 《数学学报(英文版)》2005,21(5):1137-1148
In this paper, we investigate the Hausdorff measure for level sets of N-parameter Rd-valued stable processes, and develop a means of seeking the exact Hausdorff measure function for level sets of N-parameter Rd-valued stable processes. We show that the exact Hausdorff measure function of level sets of N-parameter Rd-valued symmetric stable processes of index α is Ф(r) = r^N-d/α (log log l/r)d/α when Nα 〉 d. In addition, we obtain a sharp lower bound for the Hausdorff measure of level sets of general (N, d, α) strictly stable processes. 相似文献
15.
Jonathan M. Borwein 《Optimization Letters》2007,1(1):21-32
This paper is a companion to a lecture given at the Prague Spring School in Analysis in April 2006. It highlights four distinct variational methods of proving that a finite dimensional Chebyshev set is convex and hopes to inspire renewed work on the open question of whether every Chebyshev set in Hilbert space is convex. 相似文献
16.
Joe Warren Scott Schaefer Anil N. Hirani Mathieu Desbrun 《Advances in Computational Mathematics》2007,27(3):319-338
In this paper we provide an extension of barycentric coordinates from simplices to arbitrary convex sets. Barycentric coordinates
over convex 2D polygons have found numerous applications in various fields as they allow smooth interpolation of data located
on vertices. However, no explicit formulation valid for arbitrary convex polytopes has been proposed to extend this interpolation
in higher dimensions. Moreover, there has been no attempt to extend these functions into the continuous domain, where barycentric
coordinates are related to Green’s functions and construct functions that satisfy a boundary value problem. First, we review
the properties and construction of barycentric coordinates in the discrete domain for convex polytopes. Next, we show how
these concepts extend into the continuous domain to yield barycentric coordinates for continuous functions. We then provide
a proof that our functions satisfy all the desirable properties of barycentric coordinates in arbitrary dimensions. Finally,
we provide an example of constructing such barycentric functions over regions bounded by parametric curves and show how they
can be used to perform freeform deformations.
相似文献
17.
An extremum problem is embedded in a parametric scheme which contains, as a particular case, the classic perturbation function. The introduction of the image of the embedded problem allows one to derive a generalized duality and, in particular, Lagrangian and Fenchel duality. 相似文献
18.
New constructions of regular disjoint distinct difference sets (DDDS) are presented. In particular, multiplicative and additive DDDS are considered. 相似文献
19.
We study game formulas the truth of which is determined by a semantical game of uncountable length. The main theme is the study of principles stating reflection of these formulas in various admissible sets. This investigation leads to two weak forms of strict-II11 reflection (or ∑1-compactness). We show that admissible sets such as H(ω2) and Lω2 which fail to have strict-II11 reflection, may or may not, depending on set-theoretic hypotheses satisfy one or both of these weaker forms. Mathematics Subject Classification : 03C70, 03C75. 相似文献
20.
Optimization theory provides a framework for determining the best decisions or actions with respect to some mathematical model of a process. This paper focuses on learning to act in a near-optimal manner through reinforcement learning for problems that either have no model or the model is too complex. One approach to solving this class of problems is via approximate dynamic programming. The application of these methods are established primarily for the case of discrete state and action spaces. In this paper we develop efficient methods of learning which act in complex systems with continuous state and action spaces. Monte-Carlo approaches are employed to estimate function values in an iterative, incremental procedure. Derivative-free line search methods are used to obtain a near-optimal action in the continuous action space for a discrete subset of the state space. This near-optimal control policy is then extended to the entire continuous state space via a fuzzy additive model. To compensate for approximation errors, a modified procedure for perturbing the generated control policy is developed. Convergence results under moderate assumptions and stopping criteria are established. 相似文献