全文获取类型
收费全文 | 11023篇 |
免费 | 618篇 |
国内免费 | 984篇 |
专业分类
化学 | 798篇 |
晶体学 | 8篇 |
力学 | 520篇 |
综合类 | 122篇 |
数学 | 9777篇 |
物理学 | 1400篇 |
出版年
2023年 | 98篇 |
2022年 | 93篇 |
2021年 | 112篇 |
2020年 | 199篇 |
2019年 | 221篇 |
2018年 | 253篇 |
2017年 | 286篇 |
2016年 | 305篇 |
2015年 | 220篇 |
2014年 | 421篇 |
2013年 | 718篇 |
2012年 | 471篇 |
2011年 | 458篇 |
2010年 | 426篇 |
2009年 | 648篇 |
2008年 | 743篇 |
2007年 | 708篇 |
2006年 | 670篇 |
2005年 | 596篇 |
2004年 | 460篇 |
2003年 | 509篇 |
2002年 | 476篇 |
2001年 | 375篇 |
2000年 | 429篇 |
1999年 | 386篇 |
1998年 | 334篇 |
1997年 | 351篇 |
1996年 | 198篇 |
1995年 | 168篇 |
1994年 | 153篇 |
1993年 | 115篇 |
1992年 | 90篇 |
1991年 | 85篇 |
1990年 | 91篇 |
1989年 | 59篇 |
1988年 | 68篇 |
1987年 | 53篇 |
1986年 | 47篇 |
1985年 | 61篇 |
1984年 | 69篇 |
1983年 | 27篇 |
1982年 | 52篇 |
1981年 | 46篇 |
1980年 | 43篇 |
1979年 | 39篇 |
1978年 | 39篇 |
1977年 | 44篇 |
1976年 | 28篇 |
1974年 | 22篇 |
1973年 | 17篇 |
排序方式: 共有10000条查询结果,搜索用时 125 毫秒
101.
G. Mastroianni 《Numerical Algorithms》1995,10(1):113-126
The author gives some upper and lower bounds for the generalized Christoffel functions related to a Ditzian-Totik generalized weight. As an application, an error estimate of Gauss quadrature formula inL
1-weighted norm is derived.Dedicated to Prof. Luigi Gatteschi on the occasion of his 70th birthdayWork sponsored by MURST 40%. 相似文献
102.
In this paper, we consider a queueing system in which there are two exponential servers, each having his own queue, and arriving
customers will join the shorter queue. Based on the results given in Flatto and McKean, we rewrite the formula for the probability
that there are exactlyk customers in each queue, wherek = 0, 1,…. This enables us to present an algorithm for computing these probabilities and then to find the joint distribution
of the queue lengths in the system. A program and numerical examples are given. 相似文献
103.
THENBELCANDNWELCCLASSESOFLIFEDISTRIBUTIONS¥CAOJINHUA;WANGYUEDONG(InstituteofAppliedMathematics,ChineseAcademyofScience,Beijin... 相似文献
104.
A PICARD TYPE THEOREM AND BLOCH LAW 总被引:9,自引:0,他引:9
Ye Yasheng 《数学年刊B辑(英文版)》1994,15(1):75-80
A PICARD TYPE THEOREM AND BLOCH LAW ¥YEYASHENGAbstract:Apicardtypetheoremisproved,andacounterexampleisgiventoshowthattheBolch... 相似文献
105.
M. Pappalardo 《Journal of Optimization Theory and Applications》1991,70(1):97-107
We prove a property of the Bouligand tangent cone to the epigraph (or to the graph) of a locally Lipschitz function. It is also shown how this result can be used in determining Dini sequences. Finally, some relationships between such a cone and Dini derivatives are provided. 相似文献
106.
HypersurfacewithConstantMainCurvatureSymmetricFunctions¥WuBaoqiang;SongHongzao(XuzhouTeachersCollege,221009)(HenanUniversity,... 相似文献
107.
尹传存 《数学物理学报(A辑)》1997,17(2):145-151
设中的角域.该文绘出了A上正调和函数的Martin表示,讨论了极小调和函数与条件Brown运动的一个0—1律之间的关系,并给出了A上极小调和函数的表现形式, 相似文献
108.
A BRANCH BOUND METHOD FOR SUBSET SUM PROBLEM 总被引:1,自引:0,他引:1
吴士泉 《应用数学学报(英文版)》1994,10(3):302-314
ABRANCHBOUNDMETHODFORSUBSETSUMPROBLEMWUSHIQUAN(吴士泉)(InstituteofAppliedMathematics,theChineseAcademyofSciences,Beijing100080,C... 相似文献
109.
We provide some inequalities and integral inequalities connected to the Jensen-Hadamard inequalities for convex functions.
In particular, we give some refinements to these inequalities. Some natural applications and further extensions are given.
Sunto Forniamo alcune diseguaglianze e diseguaglianze integrali connesse alle dise-gueglianze di Jensen-Hadamard per funzioni convesse. In particolare, diamo qualche miglioramento di queste diseguaglianze. Alcune applicazioni naturali ed ulteriori estensioni sono date.相似文献
110.
Satoru Ibaraki Masao Fukushima Toshihide Ibaraki 《Computational Optimization and Applications》1992,1(2):207-226
A primal-dual version of the proximal point algorithm is developed for linearly constrained convex programming problems. The algorithm is an iterative method to find a saddle point of the Lagrangian of the problem. At each iteration of the algorithm, we compute an approximate saddle point of the Lagrangian function augmented by quadratic proximal terms of both primal and dual variables. Specifically, we first minimize the function with respect to the primal variables and then approximately maximize the resulting function of the dual variables. The merit of this approach exists in the fact that the latter function is differentiable and the maximization of this function is subject to no constraints. We discuss convergence properties of the algorithm and report some numerical results for network flow problems with separable quadratic costs. 相似文献