全文获取类型
收费全文 | 2316篇 |
免费 | 34篇 |
国内免费 | 55篇 |
专业分类
化学 | 22篇 |
力学 | 103篇 |
综合类 | 3篇 |
数学 | 2085篇 |
物理学 | 192篇 |
出版年
2023年 | 20篇 |
2022年 | 20篇 |
2021年 | 21篇 |
2020年 | 21篇 |
2019年 | 27篇 |
2018年 | 40篇 |
2017年 | 42篇 |
2016年 | 41篇 |
2015年 | 26篇 |
2014年 | 84篇 |
2013年 | 133篇 |
2012年 | 185篇 |
2011年 | 101篇 |
2010年 | 101篇 |
2009年 | 152篇 |
2008年 | 183篇 |
2007年 | 135篇 |
2006年 | 108篇 |
2005年 | 88篇 |
2004年 | 62篇 |
2003年 | 45篇 |
2002年 | 52篇 |
2001年 | 51篇 |
2000年 | 38篇 |
1999年 | 47篇 |
1998年 | 43篇 |
1997年 | 51篇 |
1996年 | 45篇 |
1995年 | 42篇 |
1994年 | 31篇 |
1993年 | 21篇 |
1992年 | 22篇 |
1991年 | 15篇 |
1990年 | 10篇 |
1989年 | 9篇 |
1988年 | 8篇 |
1987年 | 4篇 |
1986年 | 21篇 |
1985年 | 32篇 |
1984年 | 29篇 |
1983年 | 27篇 |
1982年 | 33篇 |
1981年 | 20篇 |
1980年 | 39篇 |
1979年 | 24篇 |
1978年 | 38篇 |
1977年 | 8篇 |
1976年 | 3篇 |
1972年 | 2篇 |
1969年 | 2篇 |
排序方式: 共有2405条查询结果,搜索用时 15 毫秒
1.
This paper through discussing subdifferentiability and convexity of convex functions shows that a Banach space admits an equivalent
uniformly [locally uniformly, strictly] convex norm if and only if there exists a continuous uniformly [locally uniformly,
strictly] convex function on some nonempty open convex subset of the space and presents some characterizations of super-reflexive
Banach spaces.
Supported by NSFC 相似文献
2.
Optimization technologies and environmental applications 总被引:1,自引:0,他引:1
3.
On the average complexity of 3D-Voronoi diagrams of random points on convex polytopes 总被引:1,自引:0,他引:1
It is well known that the complexity, i.e. the number of vertices, edges and faces, of the 3-dimensional Voronoi diagram of n points can be as bad as Θ(n2). It is also known that if the points are chosen Independently Identically Distributed uniformly from a 3-dimensional region such as a cube or sphere, then the expected complexity falls to O(n). In this paper we introduce the problem of analyzing what occurs if the points are chosen from a 2-dimensional region in 3-dimensional space. As an example, we examine the situation when the points are drawn from a Poisson distribution with rate n on the surface of a convex polytope. We prove that, in this case, the expected complexity of the resulting Voronoi diagram is O(n). 相似文献
4.
A locally convex space is said to be a Gateaux differentiability space (GDS)provided every continuous convex function defined on a nonempty convex open subset D of the space is densely Gateaux differentiable in D.This paper shows that the product of a GDS and a family of separable Frechet spaces is a GDS,and that the product of a GDS and an arbitrary locally convex space endowed with the weak topology is a GDS. 相似文献
5.
关于Banach空间中凸泛函的广义次梯度不等式 总被引:2,自引:0,他引:2
本文在前人^[1,2]的基础之上,以凸泛函的次梯度不等式为工具,将Jensen不等式推广到Banach空间中的凸泛函,导出了Banach空间中的Bochner积分型的广义Jensen不等式,给出其在Banach空间概率论中某些应用,从而推广了文献[3—6]的工作. 相似文献
6.
An Application of Branch and Cut to Open Pit Mine Scheduling 总被引:5,自引:0,他引:5
The economic viability of the modern day mine is highly dependent upon careful planning and management. Declining trends in average ore grades, increasing mining costs and environmental considerations will ensure that this situation will remain in the foreseeable future. The operation and management of a large open pit mine having a life of several years is an enormous and complex task. Though a number of optimization techniques have been successfully applied to resolve some important problems, the problem of determining an optimal production schedule over the life of the deposit is still very much unresolved. In this paper we will critically examine the techniques that are being used in the mining industry for production scheduling indicating their limitations. In addition, we present a mixed integer linear programming model for the scheduling problems along with a Branch and Cut solution strategy. Computational results for practical sized problems are discussed. 相似文献
7.
Lahcne Mezrag 《Mathematische Nachrichten》2004,266(1):60-67
In [5], it is proved that a bounded linear operator u, from a Banach space Y into an Lp(S, ν) factors through Lp1 (S, ν) for some p1 > 1, if Y* is of finite cotype; (S, ν) is a probability space for p = 0, and any measure space for 0 < p < 1. In this paper, we generalize this result to uv, where u : Y → Lp(S, ν) and v : X → Y are linear operators such that v* is of finite Ka?in cotype. This result gives also a new proof of Grothendieck's theorem. (© 2004 WILEY‐VCH Verlag GmbH & Co. KGaA, Weinheim) 相似文献
8.
Asaf Levin 《Operations Research Letters》2004,32(6):530-534
Consider the following problem: given a ground set and two minimization objectives of the same type find a subset from a given subset-class that minimizes the first objective subject to a budget constraint on the second objective. Using Megiddo's parametric method we improve an earlier weakly polynomial time algorithm. 相似文献
9.
Xu Tianzhou 《东北数学》1997,(1)
ModulesoverOperatorAlgebrasandItsModuleMapsXuTianzhou(许天周)(DepartmentofMathematics,NanjingUniersity,Nanjing,210093)AbstractLe... 相似文献
10.
郭飞 《应用数学与计算数学学报》1997,11(1):19-26
Wilson,Han和Powell提出的序列二次规划方法(简称SQP方法)是求解非线性规划问题的一个著名方法,这种方法每次迭代的搜索方向是通过求解一个二次规划子问题得到的,本文受[1]启发,得到二次规划子问题的一个近似解,进而给出了一类求解线性约束非线性规划问题的可行方向法,在约束集合满足正则性的条件下,证明了该算法对五种常用线性搜索方法具有全局收敛性。 相似文献