全文获取类型
收费全文 | 730篇 |
免费 | 40篇 |
国内免费 | 84篇 |
专业分类
化学 | 37篇 |
晶体学 | 1篇 |
力学 | 26篇 |
综合类 | 14篇 |
数学 | 685篇 |
物理学 | 91篇 |
出版年
2024年 | 2篇 |
2023年 | 5篇 |
2022年 | 19篇 |
2021年 | 18篇 |
2020年 | 19篇 |
2019年 | 21篇 |
2018年 | 11篇 |
2017年 | 13篇 |
2016年 | 19篇 |
2015年 | 9篇 |
2014年 | 26篇 |
2013年 | 51篇 |
2012年 | 28篇 |
2011年 | 29篇 |
2010年 | 29篇 |
2009年 | 40篇 |
2008年 | 44篇 |
2007年 | 46篇 |
2006年 | 49篇 |
2005年 | 47篇 |
2004年 | 52篇 |
2003年 | 31篇 |
2002年 | 36篇 |
2001年 | 28篇 |
2000年 | 46篇 |
1999年 | 26篇 |
1998年 | 23篇 |
1997年 | 21篇 |
1996年 | 12篇 |
1995年 | 9篇 |
1994年 | 13篇 |
1993年 | 5篇 |
1992年 | 5篇 |
1991年 | 2篇 |
1990年 | 2篇 |
1988年 | 1篇 |
1987年 | 2篇 |
1984年 | 4篇 |
1982年 | 2篇 |
1979年 | 1篇 |
1978年 | 3篇 |
1976年 | 1篇 |
1972年 | 1篇 |
1971年 | 1篇 |
1969年 | 1篇 |
1959年 | 1篇 |
排序方式: 共有854条查询结果,搜索用时 31 毫秒
1.
Let Ψ(x,y) (resp. Ψm(x,y)) denote the number of integers not exceeding x that are y-friable, i.e. have no prime factor exceeding y (resp. and are coprime to m). Evaluating the ratio Ψm(x/d,y)/Ψ(x,y) for 1≤slantd≤slantx, m≥slant 1, x≥slant y≥slant 2, turns out to be a crucial step for estimating arithmetic sums over friable integers. Here, it is crucial to obtain formulae with a very wide range of validity. In this paper, several uniform estimates are provided for the aforementioned ratio, which supersede all previously known results. Applications are given to averages of various arithmetic functions over friable integers which in turn improve corresponding results from the literature. The technique employed rests mainly on the saddle-point method, which is an efficient and specific tool for the required design.2000 Mathematics Subject Classification: Primary—11N25; Secondary—11K65, 11N37 相似文献
2.
Kenneth Weber Vilmar Trevisan Luiz Felipe Martins 《Journal of Algorithms in Cognition, Informatics and Logic》2005,54(2):152-167
This paper describes the first algorithm to compute the greatest common divisor (GCD) of two n-bit integers using a modular representation for intermediate values U, V and also for the result. It is based on a reduction step, similar to one used in the accelerated algorithm [T. Jebelean, A generalization of the binary GCD algorithm, in: ISSAC '93: International Symposium on Symbolic and Algebraic Computation, Kiev, Ukraine, 1993, pp. 111–116; K. Weber, The accelerated integer GCD algorithm, ACM Trans. Math. Softw. 21 (1995) 111–122] when U and V are close to the same size, that replaces U by (U−bV)/p, where p is one of the prime moduli and b is the unique integer in the interval (−p/2,p/2) such that . When the algorithm is executed on a bit common CRCW PRAM with O(nlognlogloglogn) processors, it takes O(n) time in the worst case. A heuristic model of the average case yields O(n/logn) time on the same number of processors. 相似文献
3.
In [5] Phillips proved that one can obtain the additive group of any nonstandard model *? of the ring ? of integers by using a linear mod 1 function h : F ?, where F is the α-dimensional vector space over ? when α is the cardinality of *?. In this connection it arises the question whether there are linear mod 1 functions which are neither addition nor quasi-linear. We prove that this is the case. 相似文献
4.
Guang-hua DONG~ Yan-pei LIU Department of Mathematics School of Science Beijing Jiaotong University Beijing China 《中国科学A辑(英文版)》2007,50(11):1563-1570
In this paper,we provide a new class of up-embeddable graphs,and obtain a tight lower bound on the maximum genus of a class of 2-connected pseudographs of diameter 2 and of a class of diameter 4 multi-graphs.This extends a result of Skoviera. 相似文献
5.
Let E\subset \Bbb R
s
be compact and let d
n
E
denote the dimension of the space of polynomials of degree at most n in s variables restricted to E . We introduce the notion of an asymptotic interpolation measure (AIM). Such a measure, if it exists , describes the asymptotic behavior of any scheme τ
n
={ \bf x
k,n
}
k=1
dnE
, n=1,2,\ldots , of nodes for multivariate polynomial interpolation for which the norms of the corresponding interpolation operators do
not grow geometrically large with n . We demonstrate the existence of AIMs for the finite union of compact subsets of certain algebraic curves in R
2
. It turns out that the theory of logarithmic potentials with external fields plays a useful role in the investigation. Furthermore,
for the sets mentioned above, we give a computationally simple construction for ``good' interpolation schemes.
November 9, 2000. Date revised: August 4, 2001. Date accepted: September 14, 2001. 相似文献
6.
7.
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.相似文献
8.
提出了用于TEXONO实验中双端读出的长柱形CsI(Tl)闪烁晶体探测器的两种粒子能量重建方法———“算术平均值能量重建法”和“几何平均值能量重建法”,讨论了两种算法的理论依据和计算方法,并对两种算法进行了比较 相似文献
9.
李斌 《数学的实践与认识》2006,36(8):25-30
在分析我国房地产自有资本收益率操作中所存在问题的基础上,论述了自有资本收益率的实质是自有资金直接资本化率,并在房地产持有期小于抵押贷款期以及房地产持有期和土地批租年限相同的两种情况下,推导出了与土地有限期使用制度相适应的房地产资本化率和自有资本收益率的计算方法,提出了利用债务保障比率的取值范围检验资本化率合理性的基本公式. 相似文献
10.
It is well known that S 12 cannot prove the injective weak pigeonhole principle for polynomial time functions unless RSA is insecure. In this note we investigate the provability of the surjective (dual) weak pigeonhole principle in S 12 for provably weaker function classes. (© 2006 WILEY‐VCH Verlag GmbH & Co. KGaA, Weinheim) 相似文献