全文获取类型
收费全文 | 848篇 |
免费 | 44篇 |
国内免费 | 107篇 |
专业分类
化学 | 40篇 |
力学 | 30篇 |
综合类 | 19篇 |
数学 | 771篇 |
物理学 | 139篇 |
出版年
2024年 | 1篇 |
2023年 | 12篇 |
2022年 | 8篇 |
2021年 | 14篇 |
2020年 | 11篇 |
2019年 | 18篇 |
2018年 | 15篇 |
2017年 | 18篇 |
2016年 | 20篇 |
2015年 | 19篇 |
2014年 | 35篇 |
2013年 | 87篇 |
2012年 | 28篇 |
2011年 | 32篇 |
2010年 | 50篇 |
2009年 | 63篇 |
2008年 | 45篇 |
2007年 | 55篇 |
2006年 | 59篇 |
2005年 | 54篇 |
2004年 | 37篇 |
2003年 | 44篇 |
2002年 | 51篇 |
2001年 | 40篇 |
2000年 | 35篇 |
1999年 | 28篇 |
1998年 | 28篇 |
1997年 | 29篇 |
1996年 | 18篇 |
1995年 | 10篇 |
1994年 | 5篇 |
1993年 | 3篇 |
1992年 | 1篇 |
1991年 | 2篇 |
1990年 | 1篇 |
1989年 | 1篇 |
1988年 | 3篇 |
1987年 | 1篇 |
1986年 | 1篇 |
1985年 | 2篇 |
1984年 | 3篇 |
1983年 | 1篇 |
1982年 | 1篇 |
1981年 | 2篇 |
1980年 | 1篇 |
1979年 | 1篇 |
1978年 | 2篇 |
1977年 | 3篇 |
1973年 | 1篇 |
排序方式: 共有999条查询结果,搜索用时 15 毫秒
1.
Pierluigi Contucci Sandro Graffi Stefano Isola 《Journal of statistical physics》2002,106(5-6):895-914
For the long-range deterministic spin models with glassy behaviour of Marinari, Parisi and Ritort we prove weighted factorization properties of the correlation functions which represent the natural generalization of the factorization rules valid for the Curie–Weiss case. 相似文献
2.
We investigate the conjecture that every circulant graph X admits a k‐isofactorization for every k dividing |E(X)|. We obtain partial results with an emphasis on small values of k. © 2006 Wiley Periodicals, Inc. J Combin Designs 14: 406–414, 2006 相似文献
3.
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) 相似文献
4.
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.
5.
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. 相似文献
6.
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.
7.
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. 相似文献
8.
n阶矩阵A称为完全正的,如果A有分解:A=BBT,其中B为元素非负矩阵,B的最小可能列数称为A的分解指数.本文考察低阶双非负矩阵在整数环上的完全正分解及其分解指数. 相似文献
9.
10.
Yong-Yeon Keum 《Pramana》2004,63(6):1151-1170
We discuss applications of the perturbative QCD approach in the exclusive non-leptonic two-bodyB-meson decays. We briefly review its ingredients and some important theoretical issues on the factorization approach. PQCD
results are compatible with present experimental data for charmless B-meson decays. We predict the possibility of large direct
CP asymmetry in B0 → π+π− (23 +7%) and B0 →K
+π− (− 17 ± 5%). We also investigate the branching ratios, CP asymmetry and isospin symmetry breaking in radiativeB →(K*/ρ)γ decays. 相似文献