全文获取类型
收费全文 | 1063篇 |
免费 | 72篇 |
国内免费 | 115篇 |
专业分类
化学 | 90篇 |
力学 | 59篇 |
综合类 | 22篇 |
数学 | 873篇 |
物理学 | 206篇 |
出版年
2024年 | 2篇 |
2023年 | 14篇 |
2022年 | 9篇 |
2021年 | 19篇 |
2020年 | 17篇 |
2019年 | 25篇 |
2018年 | 20篇 |
2017年 | 28篇 |
2016年 | 29篇 |
2015年 | 29篇 |
2014年 | 46篇 |
2013年 | 102篇 |
2012年 | 37篇 |
2011年 | 43篇 |
2010年 | 56篇 |
2009年 | 69篇 |
2008年 | 55篇 |
2007年 | 69篇 |
2006年 | 66篇 |
2005年 | 60篇 |
2004年 | 46篇 |
2003年 | 48篇 |
2002年 | 60篇 |
2001年 | 49篇 |
2000年 | 38篇 |
1999年 | 36篇 |
1998年 | 35篇 |
1997年 | 30篇 |
1996年 | 26篇 |
1995年 | 16篇 |
1994年 | 12篇 |
1993年 | 5篇 |
1992年 | 5篇 |
1991年 | 8篇 |
1990年 | 2篇 |
1989年 | 2篇 |
1988年 | 5篇 |
1987年 | 3篇 |
1986年 | 2篇 |
1985年 | 4篇 |
1984年 | 5篇 |
1983年 | 1篇 |
1982年 | 5篇 |
1981年 | 2篇 |
1980年 | 1篇 |
1979年 | 3篇 |
1978年 | 2篇 |
1977年 | 3篇 |
1973年 | 1篇 |
排序方式: 共有1250条查询结果,搜索用时 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.
Jenn‐Long Liu 《国际流体数值方法杂志》2004,44(12):1299-1315
This paper presents a relaxation algorithm, which is based on the overset grid technology, an unsteady three‐dimensional Navier–Stokes flow solver, and an inner‐ and outer‐relaxation method, for simulation of the unsteady flows of moving high‐speed trains. The flow solutions on the overlapped grids can be accurately updated by introducing a grid tracking technique and the inner‐ and outer‐relaxation method. To evaluate the capability and solution accuracy of the present algorithm, the computational static pressure distribution of a single stationary TGV high‐speed train inside a long tunnel is investigated numerically, and is compared with the experimental data from low‐speed wind tunnel test. Further, the unsteady flows of two TGV high‐speed trains passing by each other inside a long tunnel and at the tunnel entrance are simulated. A series of time histories of pressure distributions and aerodynamic loads acting on the train and tunnel surfaces are depicted for detailed discussions. Copyright © 2004 John Wiley & Sons, Ltd. 相似文献
4.
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) 相似文献
5.
6.
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.
7.
在本文中,我们提出了双凹规划问题和更一般的广义凹规划问题。我们给出了双凹规划问题的整体最优性条件,并构造了一个有限终止外逼近算法。 相似文献
8.
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. 相似文献
9.
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.
10.
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.