全文获取类型
收费全文 | 1658篇 |
免费 | 24篇 |
国内免费 | 70篇 |
专业分类
化学 | 8篇 |
晶体学 | 1篇 |
力学 | 11篇 |
综合类 | 4篇 |
数学 | 1670篇 |
物理学 | 58篇 |
出版年
2024年 | 3篇 |
2023年 | 17篇 |
2022年 | 17篇 |
2021年 | 18篇 |
2020年 | 17篇 |
2019年 | 22篇 |
2018年 | 35篇 |
2017年 | 30篇 |
2016年 | 21篇 |
2015年 | 19篇 |
2014年 | 53篇 |
2013年 | 98篇 |
2012年 | 109篇 |
2011年 | 71篇 |
2010年 | 74篇 |
2009年 | 119篇 |
2008年 | 159篇 |
2007年 | 111篇 |
2006年 | 87篇 |
2005年 | 67篇 |
2004年 | 51篇 |
2003年 | 50篇 |
2002年 | 43篇 |
2001年 | 38篇 |
2000年 | 24篇 |
1999年 | 36篇 |
1998年 | 34篇 |
1997年 | 46篇 |
1996年 | 34篇 |
1995年 | 30篇 |
1994年 | 26篇 |
1993年 | 20篇 |
1992年 | 18篇 |
1991年 | 17篇 |
1990年 | 13篇 |
1989年 | 6篇 |
1988年 | 8篇 |
1987年 | 5篇 |
1986年 | 7篇 |
1985年 | 16篇 |
1984年 | 8篇 |
1983年 | 8篇 |
1982年 | 12篇 |
1981年 | 11篇 |
1980年 | 17篇 |
1979年 | 7篇 |
1978年 | 12篇 |
1977年 | 4篇 |
1976年 | 2篇 |
1969年 | 1篇 |
排序方式: 共有1752条查询结果,搜索用时 0 毫秒
81.
Let X={X(t), t[0,1]} be a process on [0,1] and VX=Conv{(t,x)t[0,1], x=X(t)} be the convex hull of its path.The structure of the set ext(VX) of extreme points of VX is studied. For a Gaussian process X with stationary increments it is proved that:
- • The set ext(VX) is negligible if X is non-differentiable.
- • If X is absolutely continuous process and its derivative X′ is continuous but non-differentiable, then ext(VX) is also negligible and moreover it is a Cantor set.
82.
For two vertices u and v of a connected graph G, the set I[u,v] consists of all those vertices lying on a u−v shortest path in G, while for a set S of vertices of G, the set I[S] is the union of all sets I[u,v] for u,v∈S. A set S is convex if I[S]=S. The convexity number con(G) of G is the maximum cardinality of a proper convex set of G. The clique number ω(G) is the maximum cardinality of a clique in G. If G is a connected graph of order n that is not complete, then n≥3 and 2≤ω(G)≤con(G)≤n−1. It is shown that for every triple l,k,n of integers with n≥3 and 2≤l≤k≤n−1, there exists a noncomplete connected graph G of order n with ω(G)=l and con(G)=k. Other results on convex numbers are also presented.
Received: August 19, 1998 Final version received: May 17, 2000 相似文献
83.
Geometric Programming is extended to include convex quadratic functions. Generalized Geometric Programming is applied to this
class of programs to obtain a convex dual program. Machining economics problems fall into this class. Such problems are studied
by applying this duality to a nested set of three problems. One problem is zero degree of difficulty and the solution is obtained
by solving a simple system of equations. The inclusion of a constraint restricting the force on the tool to be less than or
equal to the breaking force provides a more realistic solution. This model is solved as a program with one degree of difficulty.
Finally the behavior of the machining cost per part is studied parametrically as a function of axial depth.
This research was supported by the Air Force Office of Scientific Research Grant AFOSR-83-0234 相似文献
84.
Pravin M. Vaidya 《Mathematical Programming》1996,73(3):291-341
Let
be a convex set for which there is an oracle with the following property. Given any pointz∈ℝ
n
the oracle returns a “Yes” ifz∈S; whereas ifz∉S then the oracle returns a “No” together with a hyperplane that separatesz fromS. The feasibility problem is the problem of finding a point inS; the convex optimization problem is the problem of minimizing a convex function overS. We present a new algorithm for the feasibility problem. The notion of a volumetric center of a polytope and a related ellipsoid
of maximum volume inscribable in the polytope are central to the algorithm. Our algorithm has a significantly better global
convergence rate and time complexity than the ellipsoid algorithm. The algorithm for the feasibility problem easily adapts
to the convex optimization problem. 相似文献
85.
Donal O'Regan 《Journal of Mathematical Analysis and Applications》2005,309(2):383-391
In this paper we present a two-norms version of Krasnoselskii's fixed point theorem in cones. The abstract result is then applied to prove the existence of positive Lp solutions of Hammerstein integral equations with better integrability properties on the kernels. 相似文献
86.
87.
Binhuan Wang Yilong Zhang Will Wei Sun Yixin Fang 《Journal of computational and graphical statistics》2018,27(2):393-403
Convex clustering, a convex relaxation of k-means clustering and hierarchical clustering, has drawn recent attentions since it nicely addresses the instability issue of traditional nonconvex clustering methods. Although its computational and statistical properties have been recently studied, the performance of convex clustering has not yet been investigated in the high-dimensional clustering scenario, where the data contains a large number of features and many of them carry no information about the clustering structure. In this article, we demonstrate that the performance of convex clustering could be distorted when the uninformative features are included in the clustering. To overcome it, we introduce a new clustering method, referred to as Sparse Convex Clustering, to simultaneously cluster observations and conduct feature selection. The key idea is to formulate convex clustering in a form of regularization, with an adaptive group-lasso penalty term on cluster centers. To optimally balance the trade-off between the cluster fitting and sparsity, a tuning criterion based on clustering stability is developed. Theoretically, we obtain a finite sample error bound for our estimator and further establish its variable selection consistency. The effectiveness of the proposed method is examined through a variety of numerical experiments and a real data application. Supplementary material for this article is available online. 相似文献
88.
89.
We give a bundle method for constrained convex optimization. Instead of using penalty functions, it shifts iterates towards
feasibility, by way of a Slater point, assumed to be known. Besides, the method accepts an oracle delivering function and
subgradient values with unknown accuracy. Our approach is motivated by a number of applications in column generation, in which
constraints are positively homogeneous—so that zero is a natural Slater point—and an exact oracle may be time consuming. Finally,
our convergence analysis employs arguments which have been little used so far in the bundle community. The method is illustrated
on a number of cutting-stock problems.
Research supported by INRIA New Investigation Grant “Convex Optimization and Dantzig–Wolfe Decomposition”. 相似文献
90.
为了刻画复杂随机系统的理性决策,提出了复杂随机系统的生存性及不变性的概念,给出并证明了复杂随机系统的生存性定理及不变性定理.并提出了均方相依锥,生存域与不变域的概念.得到了与文献中的一致的结论. 相似文献