全文获取类型
收费全文 | 1210篇 |
免费 | 104篇 |
国内免费 | 110篇 |
专业分类
化学 | 39篇 |
晶体学 | 1篇 |
力学 | 105篇 |
综合类 | 32篇 |
数学 | 1030篇 |
物理学 | 217篇 |
出版年
2023年 | 9篇 |
2022年 | 20篇 |
2021年 | 13篇 |
2020年 | 25篇 |
2019年 | 28篇 |
2018年 | 28篇 |
2017年 | 27篇 |
2016年 | 39篇 |
2015年 | 18篇 |
2014年 | 49篇 |
2013年 | 108篇 |
2012年 | 46篇 |
2011年 | 64篇 |
2010年 | 51篇 |
2009年 | 69篇 |
2008年 | 63篇 |
2007年 | 60篇 |
2006年 | 72篇 |
2005年 | 74篇 |
2004年 | 65篇 |
2003年 | 69篇 |
2002年 | 54篇 |
2001年 | 46篇 |
2000年 | 49篇 |
1999年 | 53篇 |
1998年 | 39篇 |
1997年 | 32篇 |
1996年 | 23篇 |
1995年 | 9篇 |
1994年 | 17篇 |
1993年 | 21篇 |
1992年 | 10篇 |
1991年 | 10篇 |
1990年 | 5篇 |
1989年 | 8篇 |
1988年 | 7篇 |
1987年 | 7篇 |
1986年 | 6篇 |
1985年 | 4篇 |
1984年 | 2篇 |
1982年 | 5篇 |
1981年 | 2篇 |
1980年 | 3篇 |
1979年 | 4篇 |
1978年 | 4篇 |
1977年 | 1篇 |
1975年 | 1篇 |
1974年 | 2篇 |
1972年 | 1篇 |
1959年 | 1篇 |
排序方式: 共有1424条查询结果,搜索用时 15 毫秒
1.
Recursive algorithms for the computation of standard deviation and average deviation are derived and their applications in data acquisition are discussed. The relative speeds and accuracies of the two algorithms are compared for synthetic data. The performance of recursive estimation under shot and proportional noise limitations is also described. As an example of the utility of these algorithms, absorbance data with constant confidence intervals are collected regardless of incident and transmitted intensities. The desired precision is specified prior to data acquisition and used to control signal-averaging of the data in real time. 相似文献
2.
主要介绍了一个引理,这个引理奠定了K4-同胚图K4(α,1,1,δ,ε,η)色性研究的基础。 相似文献
3.
We propose a unified method for deducing recursive relations for the canonical partition function of a system of noninteracting particles with charge conservation if the particles follow the Bose–Einstein, Fermi–Dirac, or Maxwell–Boltzmann statistics or parastatistics. For all these types of statistics, we find recursive relations for the partition function of a new statistical model of nuclear multifragmentation with electric charge and baryon number conservation, accounting for the internal degrees of freedom of the nuclear fragments. 相似文献
4.
Weaving is a matrix construction developed in 1990 for the purpose of obtaining new weighing matrices. Hadamard matrices obtained by weaving have the same orders as those obtained using the Kronecker product, but weaving affords greater control over the internal structure of matrices constructed, leading to many new Hadamard equivalence classes among these known orders. It is known that different classes of Hadamard matrices may have different maximum excess. We explain why those classes with smaller excess may be of interest, apply the method of weaving to explore this question, and obtain constructions for new Hadamard matrices with maximum excess in their respective classes. With this method, we are also able to construct Hadamard matrices of near‐maximal excess with ease, in orders too large for other by‐hand constructions to be of much value. We obtain new lower bounds for the maximum excess among Hadamard matrices in some orders by constructing candidates for the largest excess. For example, we construct a Hadamard matrix with excess 1408 in order 128, larger than all previously known values. We obtain classes of Hadamard matrices of order 96 with maximum excess 912 and 920, which demonstrates that the maximum excess for classes of that order may assume at least three different values. Since the excess of a woven Hadamard matrix is determined by the row sums of the matrices used to weave it, we also investigate the properties of row sums of Hadamard matrices and give lists of them in small orders. © 2004 Wiley Periodicals, Inc. J Combin Designs 12: 233–255, 2004. 相似文献
5.
单循环赛赛程安排的一个图论方法 总被引:2,自引:0,他引:2
唐保祥 《数学的实践与认识》2004,34(5):120-125
利用图论的边着色理论建立了一个赛程安排的数学模型 .首先建立 n支球队与完全图 Kn的 n个顶点间的一一对应 ,把球队 Ai和 Aj间的比赛关系抽象成 Kn的顶点 i和 j间的边 ( i,j) .然后分别构造出了图K2 m- 1和 K2 m的正常 2 m-1边着色 .从而给出了各球队每两场比赛间得到的休整时间最均等 ,休整的间隔场次数达到上限值 n2 的一个赛程安排方案 相似文献
6.
Arthur W. Apter 《Mathematical Logic Quarterly》2006,52(5):457-463
We construct models for the level by level equivalence between strong compactness and supercompactness in which for κ the least supercompact cardinal and δ ≤ κ any cardinal which is either a strong cardinal or a measurable limit of strong cardinals, 2δ > δ + and δ is < 2δ supercompact. In these models, the structure of the class of supercompact cardinals can be arbitrary, and the size of the power set of κ can essentially be made as large as desired. This extends and generalizes [5, Theorem 2] and [4, Theorem 4]. We also sketch how our techniques can be used to establish a weak indestructibility result. (© 2006 WILEY‐VCH Verlag GmbH & Co. KGaA, Weinheim) 相似文献
7.
Jing Ping YANG Shi Hong CHENG Xiao Qian WANG 《数学学报(英文版)》2007,23(3):467-478
This paper investigates bivariate recursive equations on excess-of-loss reinsurance. For an insurance portfolio, under the assumptions that the individual claim severity distribution has bounded continuous density and the number of claims belongs to R1 (a, b) family, bivariate recursive equations for the joint distribution of the cedent's aggregate claims and the reinsurer's aggregate claims are obtained. 相似文献
8.
9.
10.
Remco van der Hofstad Gerard Hooghiemstra Piet Van Mieghem 《Random Structures and Algorithms》2002,20(4):519-539
In this paper we study the covariance structure of the number of nodes k and l steps away from the root in random recursive trees. We give an analytic expression valid for all k, l and tree sizes N. The fraction of nodes k steps away from the root is a random probability distribution in k. The expression for the covariances allows us to show that the total variation distance between this (random) probability distribution and its mean converges in probability to zero. © 2002 Wiley Periodicals, Inc. Random Struct. Alg., 20: 519–539, 2002 相似文献