全文获取类型
收费全文 | 714篇 |
免费 | 71篇 |
国内免费 | 61篇 |
专业分类
化学 | 124篇 |
晶体学 | 4篇 |
力学 | 49篇 |
综合类 | 14篇 |
数学 | 507篇 |
物理学 | 148篇 |
出版年
2023年 | 4篇 |
2022年 | 8篇 |
2021年 | 11篇 |
2020年 | 18篇 |
2019年 | 19篇 |
2018年 | 11篇 |
2017年 | 20篇 |
2016年 | 24篇 |
2015年 | 23篇 |
2014年 | 44篇 |
2013年 | 53篇 |
2012年 | 26篇 |
2011年 | 37篇 |
2010年 | 36篇 |
2009年 | 40篇 |
2008年 | 57篇 |
2007年 | 59篇 |
2006年 | 46篇 |
2005年 | 29篇 |
2004年 | 35篇 |
2003年 | 28篇 |
2002年 | 29篇 |
2001年 | 24篇 |
2000年 | 18篇 |
1999年 | 23篇 |
1998年 | 20篇 |
1997年 | 21篇 |
1996年 | 11篇 |
1995年 | 8篇 |
1994年 | 8篇 |
1993年 | 4篇 |
1992年 | 5篇 |
1991年 | 4篇 |
1990年 | 5篇 |
1989年 | 2篇 |
1988年 | 1篇 |
1986年 | 4篇 |
1985年 | 4篇 |
1984年 | 3篇 |
1983年 | 1篇 |
1982年 | 6篇 |
1981年 | 2篇 |
1980年 | 1篇 |
1979年 | 3篇 |
1978年 | 1篇 |
1977年 | 4篇 |
1976年 | 3篇 |
1974年 | 1篇 |
1973年 | 1篇 |
1962年 | 1篇 |
排序方式: 共有846条查询结果,搜索用时 78 毫秒
1.
受Peng-中心极限定理的启发,本文主要应用G-正态分布的概念,放宽Peng-中心极限定理的条件,在次线性期望下得到形式更为一般的中心极限定理.首先,将均值条件E[X_n]=ε[X_n]=0放宽为|E[X_n]|+|ε[X_n]|=O(1/n);其次,应用随机变量截断的方法,放宽随机变量的2阶矩与2+δ阶矩条件;最后,将该定理的Peng-独立性条件进行放宽,得到卷积独立随机变量的中心极限定理. 相似文献
2.
3.
研究桉树控制授粉后目标性状的基因作用方式是探索其基因重组规律的重要内容。常规的数量统计分析精度往往不高,而DNA分析的专业要求高,且费时费力。该研究利用近红外光谱(NIRs)研究不同基因型桉树杂交种、亲本及杂交种与亲本间近红外光谱信息的关系,探索NIRs用于桉树杂交种与其亲本判别的可行性和准确性。以控制授粉的桉树亲本及其杂交F1代材料为对象,每种基因型从各自田间试验分别选取10个单株,采集树冠中上部新鲜健康叶片。用手持式近红外仪Phazir Rx(1624)采集桉树杂交种与其亲本叶片的NIRs信息。每单株选10片完全生理成熟的健康叶片,避开叶脉扫描其正面光谱5次,以50条NIRs信息的均值代表单个叶片的NIRs信息,最终每个基因型获得10条NIRs信息。对原始NIRs采用二阶多项式S.G一阶导数预处理。预处理后的NIRs用于多元统计分析,首先对桉树杂交亲本和子代样本进行主成分分析(PCA),直观展示不同基因型的分类情况。然后运用簇类独立软模式(SIMCA)和偏最小二乘判别分析(PLS-DA)两种有监督的判别模式验证NIRs用于桉树杂交种与其亲本树种的分类判别效果。PCA结果显示,不同的亲本间、杂交种间及杂交种与亲本间样本的主因子得分可以清晰地将各基因型分开。SIMCA模式判别分析中,桉树杂交种样本到亲本PCA模型的样本距离显示,待判别样本能够形成单独的聚类,且能直观反映两者的遗传相似。PLS-DA判别结果显示,桉树杂交亲本的PLS模型能通过预测其杂交子代的响应变量将其与亲本准确分开。结果表明,桉树叶片的NIRs信息可以准确地反映桉树杂交子代遗传信息的传递规律,NIRs判别模型可以准确地将各种基因型予以区分。因此,NIRs信息不仅可用于桉树杂交种和纯种的定性判别,还可以分析桉树基因重组过程中加性遗传效应的大小,从而为桉树遗传基础分析及其育种改良研究提供理论支撑。 相似文献
4.
Due to the applications in network coding, subspace codes and designs have received many attentions. Suppose that and is an ‐dimensional space over the finite field . A ‐spread is a ‐set of ‐dimensional subspaces of such that each nonzero vector is contained in exactly one element of it. A partial ‐parallelism in is a set of pairwise disjoint ‐spreads. As the number of ‐dimensional subspaces in is , there are at most spreads in a partial ‐parallelism. By studying the independence numbers of Cayley graphs associated to a special type of partial ‐parallelisms in , we obtain new lower bounds for partial ‐parallelisms. In particular, we show that there exist at least pairwise disjoint ‐spreads in . 相似文献
5.
6.
Prof. Dr. Amnon Stanger 《Chemphyschem》2023,24(10):e202300080
When close to the molecular plane, the behavior of nucleus independent chemical shift (NICS) as a function of the distance from the molecular plane deviates from its behavior at larger distances. By using a dense grid of NICS-probes (BQs) it is shown that, when close to the molecular plane, maximal (absolute) NICS values are obtained above the atoms. These maxima move towards the center as the grid is elevated until the (absolute) maximum NICS is obtained at the center and stay there when the grid is further elevated. It is shown that this behavior is a result of the current density, which is influenced by the electron density, according to the Biot-Savart law, which, in turn, causes the induced magnetic field measured by the NICS. It is thus concluded that if magnetic aromaticity is studied, the NICS calculations should be carried out at a large enough distance so that only the π-ring current affects the NICS. At distances ≥2 Å, NICS(r)π,zz=A+B*Cr. Using non-linear correlation for obtaining A, B and C and extrapolate to NICS(1)π,zz and NICS(1.7)π,zz is recommended as measures for aromaticity. 相似文献
7.
Jian Xu Qingsong Xu Lunzhao Yi Chi‐On Chan Daniel Kam‐Wah Mok 《Journal of Chemometrics》2016,30(1):37-45
High throughput data are frequently observed in contemporary chemical studies. Classification through spectral information is an important issue in chemometrics. Linear discriminant analysis (LDA) fails in the large‐p‐small‐n situation for two main reasons: (1) the sample covariance matrix is singular when p > n and (2) there is an accumulation of noise in the estimation of the class centroid in high dimensional feature space. The Independence Rule is a class of methods used to overcome these drawbacks by ignoring the correlation information between spectral variables. However, a strong correlation is an essential characteristic of spectral data. We proposed a new correlation‐assisted nearest shrunken centroid classifier (CA‐NSC) to incorporate correlation information into the classification. CA‐NSC combines two sources of information [class centroid (mean) and correlation structure (variance)] to generate the classification. We used two real data analyses and a simulation study to verify our CA‐NSC method. In addition to NSC, we also performed a comparison with the soft independent modeling of class analogy (SIMCA) approach, which uses only correlation structure information for classification. The results show that CA‐NSC consistently improves on NSC and SIMCA. The misclassification rate of CA‐NSC is reduced by almost half compared with NSC in one of the real data analyses. Generally, correlation among variables will worsen the performance of NSC, even though the discriminatory information contained in the class centroid remains unchanged. If only correlation structure information is used (as in the case of SIMCA), the result will be satisfactory only when the correlation structure alone can provide sufficient information for classification. Copyright © 2015 John Wiley & Sons, Ltd. 相似文献
8.
9.
Zoltán Lóránt Nagy 《Journal of Graph Theory》2017,84(4):566-580
We study the existence and the number of k‐dominating independent sets in certain graph families. While the case namely the case of maximal independent sets—which is originated from Erd?s and Moser—is widely investigated, much less is known in general. In this paper we settle the question for trees and prove that the maximum number of k‐dominating independent sets in n‐vertex graphs is between and if , moreover the maximum number of 2‐dominating independent sets in n‐vertex graphs is between and . Graph constructions containing a large number of k‐dominating independent sets are coming from product graphs, complete bipartite graphs, and finite geometries. The product graph construction is associated with the number of certain Maximum Distance Separable (MDS) codes. 相似文献
10.
Quay van der Hoff Ansie Harding 《International Journal of Mathematical Education in Science & Technology》2017,48(1):16-30
This study focuses on the mathematics department at a South African university and in particular on teaching of calculus to first year engineering students. The paper reports on a cause–effect analysis, often used for business improvement. The cause–effect analysis indicates that there are many factors that impact on secondary school teaching of mathematics, factors that the tertiary sector has no control over. The analysis also indicates the undesirable issues that are at the root of impeding success in the calculus module. Most important is that students are not encouraged to become independent thinkers from an early age. This triggers problems in follow-up courses where students are expected to have learned to deal with the work load and understanding of certain concepts. A new model was designed to lessen the impact of these undesirable issues. 相似文献