全文获取类型
收费全文 | 9972篇 |
免费 | 924篇 |
国内免费 | 863篇 |
专业分类
化学 | 1535篇 |
晶体学 | 46篇 |
力学 | 1128篇 |
综合类 | 241篇 |
数学 | 5791篇 |
物理学 | 3018篇 |
出版年
2024年 | 22篇 |
2023年 | 122篇 |
2022年 | 255篇 |
2021年 | 237篇 |
2020年 | 291篇 |
2019年 | 271篇 |
2018年 | 274篇 |
2017年 | 350篇 |
2016年 | 371篇 |
2015年 | 260篇 |
2014年 | 470篇 |
2013年 | 718篇 |
2012年 | 446篇 |
2011年 | 575篇 |
2010年 | 503篇 |
2009年 | 696篇 |
2008年 | 681篇 |
2007年 | 663篇 |
2006年 | 617篇 |
2005年 | 556篇 |
2004年 | 422篇 |
2003年 | 392篇 |
2002年 | 358篇 |
2001年 | 281篇 |
2000年 | 293篇 |
1999年 | 265篇 |
1998年 | 275篇 |
1997年 | 197篇 |
1996年 | 158篇 |
1995年 | 96篇 |
1994年 | 101篇 |
1993年 | 75篇 |
1992年 | 64篇 |
1991年 | 67篇 |
1990年 | 48篇 |
1989年 | 36篇 |
1988年 | 43篇 |
1987年 | 28篇 |
1986年 | 33篇 |
1985年 | 28篇 |
1984年 | 23篇 |
1983年 | 7篇 |
1982年 | 20篇 |
1981年 | 14篇 |
1980年 | 11篇 |
1979年 | 11篇 |
1978年 | 10篇 |
1977年 | 4篇 |
1974年 | 3篇 |
1972年 | 4篇 |
排序方式: 共有10000条查询结果,搜索用时 15 毫秒
61.
The syntenic distance between two species is the minimum number of fusions, fissions, and translocations required to transform one genome into the other. The linear syntenic distance, a restricted form of this model, has been shown to be close to the syntenic distance. Both models are computationally difficult to compute and have resisted efficient approximation algorithms with non-trivial performance guarantees. In this paper, we prove that many useful properties of syntenic distance carry over to linear syntenic distance. We also give a reduction from the general linear synteny problem to the question of whether a given instance can be solved using the maximum possible number of translocations. Our main contribution is an algorithm exactly computing linear syntenic distance in nested instances of the problem. This is the first polynomial time algorithm exactly solving linear synteny for a non-trivial class of instances. It is based on a novel connection between the syntenic distance and a scheduling problem that has been studied in the operations research literature. 相似文献
62.
Ioan Tomescu 《Journal of Graph Theory》2003,43(3):210-222
In the set of graphs of order n and chromatic number k the following partial order relation is defined. One says that a graph G is less than a graph H if ci(G) ≤ ci(H) holds for every i, k ≤ i ≤ n and at least one inequality is strict, where ci(G) denotes the number of i‐color partitions of G. In this paper the first ? n/2 ? levels of the diagram of the partially ordered set of connected 3‐chromatic graphs of order n are described. © 2003 Wiley Periodicals, Inc. J Graph Theory 43: 210–222, 2003 相似文献
63.
Frank N. Proske Madan L. Puri 《Proceedings of the American Mathematical Society》2003,131(9):2937-2944
In this article we prove a strong law of large numbers for Borel measurable nonseparably valued random elements in the case of generalized random sets.
64.
65.
Dao-sheng Zheng 《计算数学(英文版)》1998,(2)
1.IntroductionSince1984,severalchinesemathematicianshaveobtailledmanyresultsboutmatrixoperatornormcondition.umbe.[ll'12'18].Twokindsmatrixconditionnllmbers[9]are:(1)IfAECoxsisnonsingular,thellunlberK.(A)~IIAll.llA--'if.iscalledtheor--normconditionnumberof… 相似文献
66.
A layer of stratified combination composed of selected radiation shielding materials acquires better shielding property. Albedo
is used in such measurements as an integral measure ofγ-ray scattering. The stratified slabs of alternating heterogeneous layers have been found to have a virtual homogeneous property
with a definite effective atomic number. The angular distribution of back-scattered photons as well as the total number albedo
values for iron, aluminium and concrete in stratified combination for 662 keV and 1250 keV photons are reported. 相似文献
67.
Pierre L'Ecuyer 《Annals of Operations Research》1994,53(1):77-120
In typical stochastic simulations, randomness is produced by generating a sequence of independent uniform variates (usually real-valued between 0 and 1, or integer-valued in some interval) and transforming them in an appropriate way. In this paper, we examine practical ways of generating (deterministic approximations to) such uniform variates on a computer. We compare them in terms of ease of implementation, efficiency, theoretical support, and statistical robustness. We look in particular at several classes of generators, such as linear congruential, multiple recursive, digital multistep, Tausworthe, lagged-Fibonacci, generalized feedback shift register, matrix, linear congruential over fields of formal series, and combined generators, and show how all of them can be analyzed in terms of their lattice structure. We also mention other classes of generators, like non-linear generators, discuss other kinds of theoretical and empirical statistical tests, and give a bibliographic survey of recent papers on the subject. 相似文献
68.
69.
70.
In Homma M and Kim SJ [2], the authors considered two-point codes on a Hermitian curve defined over fields of odd characteristic.
In this paper, we study the geometry of a Hermitian curve over fields of even characteristic and classify the two-point codes
whose minimum distances agree with the designed ones. 相似文献