全文获取类型
收费全文 | 1163篇 |
免费 | 63篇 |
国内免费 | 162篇 |
专业分类
化学 | 40篇 |
力学 | 30篇 |
综合类 | 19篇 |
数学 | 735篇 |
物理学 | 139篇 |
综合类 | 425篇 |
出版年
2024年 | 4篇 |
2023年 | 15篇 |
2022年 | 11篇 |
2021年 | 22篇 |
2020年 | 17篇 |
2019年 | 26篇 |
2018年 | 21篇 |
2017年 | 26篇 |
2016年 | 27篇 |
2015年 | 34篇 |
2014年 | 51篇 |
2013年 | 104篇 |
2012年 | 45篇 |
2011年 | 50篇 |
2010年 | 69篇 |
2009年 | 80篇 |
2008年 | 65篇 |
2007年 | 76篇 |
2006年 | 76篇 |
2005年 | 71篇 |
2004年 | 51篇 |
2003年 | 60篇 |
2002年 | 74篇 |
2001年 | 50篇 |
2000年 | 39篇 |
1999年 | 41篇 |
1998年 | 37篇 |
1997年 | 37篇 |
1996年 | 23篇 |
1995年 | 13篇 |
1994年 | 12篇 |
1993年 | 8篇 |
1992年 | 6篇 |
1991年 | 4篇 |
1990年 | 4篇 |
1989年 | 5篇 |
1988年 | 9篇 |
1987年 | 1篇 |
1986年 | 6篇 |
1985年 | 2篇 |
1984年 | 4篇 |
1983年 | 1篇 |
1982年 | 1篇 |
1981年 | 2篇 |
1980年 | 1篇 |
1979年 | 1篇 |
1978年 | 2篇 |
1977年 | 3篇 |
1973年 | 1篇 |
排序方式: 共有1388条查询结果,搜索用时 16 毫秒
11.
大整数因子分解新算法及对RSA密码制的解密 总被引:1,自引:1,他引:0
王泽辉 《中山大学学报(自然科学版)》2003,42(5):15-18
对一大类大整数的因子分解构造算法WZH,可在O(L(lnm)2)+O(lnm)3(L相似文献
12.
13.
G. R. Everest A. J. van der Poorten 《Proceedings of the American Mathematical Society》1997,125(5):1293-1298
We study factorisation in the ring of exponential polynomials and provide a proof of Ritt's factorisation theorem in modern notation and so generalised as to deal with polynomial coefficients as well as with several variables. We do this in the more general context of a group ring of a divisible torsion-free ordered abelian group over a unique factorisation domain.
14.
Popularized by Zassenhaus in the seventies, several algorithms for factoring polynomials use a so-called lifting and recombination scheme. Concerning bivariate polynomials, we present a new algorithm for the recombination stage that requires a lifting up to precision twice the total degree of the polynomial to be factored. Its cost is dominated by the computation of reduced echelon solution bases of linear systems. We show that our bound on precision is asymptotically optimal.
15.
16.
张秉儒 《内蒙古大学学报(自然科学版)》2002,(4)
通过研究图的伴随多项式的因式分解 ,给出了证明非色唯一图的一种新方法 ,并且得到了若干图簇的色等价图的结构性质 相似文献
17.
Hong Tao Gao Dong Mei Dai Tong Hua Li 《中国化学快报》2007,18(4):495-498
Non-negative matrix factorization(NMF)is a technique for dimensionality reduction by placing non-negativity constraints onthe matrix.Based on the PARAFAC model,NMF was extended for three-dimension data decomposition.The three-dimension non-negative matrix factorization(NMF3)algorithm,which was concise and easy to implement,was given in this paper.The NMF3algorithm implementation was based on elements but not on vectors.It could decompose a data array directly without unfolding,which was not similar to that the traditional algorithms do.It has been applied to the simulated data array decomposition andobtained reasonable results.It showed that NMF3 could be introduced for curve resolution in chemometrics. 相似文献
18.
Samuel S. Wagstaff Jr.. 《Mathematics of Computation》1996,65(213):383-391
We show that the minimum period modulo of the Bell exponential integers is for all primes and several larger . Our proof of this result requires the prime factorization of these periods. For some primes the factoring is aided by an algebraic formula called an Aurifeuillian factorization. We explain how the coefficients of the factors in these formulas may be computed.
19.
Jim Coykendall 《Proceedings of the American Mathematical Society》1996,124(6):1727-1732
The image of the norm map from to (two rings of algebraic integers) is a multiplicative monoid . We present conditions under which is a UFD if and only if has unique factorization into irreducible elements. From this we derive a bound for checking if is a UFD.
20.
Non-negative matrix factorization (NMF), with the constraints of non-negativity, has been recently proposed for multi-variate data analysis. Because it allows only additive, not subtractive, combinations of the original data, NMF is capable of producing region or parts-based representation of objects. It has been used for image analysis and text processing. Unlike PCA, the resolutions of NMF are non-negative and can be easily interpreted and understood directly. Due to multiple solutions, the original algorithm of NMF [D.D. Lee, H.S. Seung, Nature 401 (1999) 788] is not suitable for resolving chemical mixed signals. In reality, NMF has never been applied to resolving chemical mixed signals. It must be modified according to the characteristics of the chemical signals, such as smoothness of spectra, unimodality of chromatograms, sparseness of mass spectra, etc. We have used the modified NMF algorithm to narrow the feasible solution region for resolving chemical signals, and found that it could produce reasonable and acceptable results for certain experimental errors, especially for overlapping chromatograms and sparse mass spectra. Simulated two-dimensional (2-D) data and real GUJINGGONG alcohol liquor GC-MS data have been resolved soundly by NMF technique. Butyl caproate and its isomeric compound (butyric acid, hexyl ester) have been identified from the overlapping spectra. The result of NMF is preferable to that of Heuristic evolving latent projections (HELP). It shows that NMF is a promising chemometric resolution method for complex samples. 相似文献