全文获取类型
收费全文 | 3119篇 |
免费 | 119篇 |
国内免费 | 244篇 |
专业分类
化学 | 608篇 |
晶体学 | 4篇 |
力学 | 106篇 |
综合类 | 31篇 |
数学 | 2094篇 |
物理学 | 639篇 |
出版年
2023年 | 34篇 |
2022年 | 47篇 |
2021年 | 36篇 |
2020年 | 48篇 |
2019年 | 73篇 |
2018年 | 50篇 |
2017年 | 83篇 |
2016年 | 97篇 |
2015年 | 66篇 |
2014年 | 126篇 |
2013年 | 252篇 |
2012年 | 138篇 |
2011年 | 151篇 |
2010年 | 151篇 |
2009年 | 179篇 |
2008年 | 165篇 |
2007年 | 214篇 |
2006年 | 172篇 |
2005年 | 146篇 |
2004年 | 123篇 |
2003年 | 125篇 |
2002年 | 119篇 |
2001年 | 78篇 |
2000年 | 117篇 |
1999年 | 79篇 |
1998年 | 93篇 |
1997年 | 88篇 |
1996年 | 50篇 |
1995年 | 33篇 |
1994年 | 44篇 |
1993年 | 30篇 |
1992年 | 22篇 |
1991年 | 32篇 |
1990年 | 15篇 |
1989年 | 11篇 |
1988年 | 17篇 |
1987年 | 18篇 |
1986年 | 12篇 |
1985年 | 29篇 |
1984年 | 24篇 |
1983年 | 4篇 |
1982年 | 14篇 |
1981年 | 13篇 |
1980年 | 13篇 |
1979年 | 18篇 |
1978年 | 13篇 |
1977年 | 8篇 |
1976年 | 6篇 |
1975年 | 2篇 |
1974年 | 3篇 |
排序方式: 共有3482条查询结果,搜索用时 296 毫秒
1.
Neng-Pin Lu 《The Journal of mathematical sociology》2019,43(3):164-178
Principal eigenvectors of adjacency matrices are often adopted as measures of centrality for a graph or digraph. However, previous principal-eigenvector-like measures for a digraph usually consider only the strongly connected component whose adjacency submatrix has the largest eigenvalue. In this paper, for each and every strongly connected component in a digraph, we add weights to diagonal elements of its member nodes in the adjacency matrix such that the modified matrix will have the new unique largest eigenvalue and corresponding principal eigenvectors. Consequently, we use the new principal eigenvectors of the modified matrices, based on different strongly connected components, not only to compose centrality measures but also to identify bowtie structures for a digraph. 相似文献
2.
研究桉树控制授粉后目标性状的基因作用方式是探索其基因重组规律的重要内容。常规的数量统计分析精度往往不高,而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信息不仅可用于桉树杂交种和纯种的定性判别,还可以分析桉树基因重组过程中加性遗传效应的大小,从而为桉树遗传基础分析及其育种改良研究提供理论支撑。 相似文献
3.
4.
Well-Posedness by Perturbations of Variational Problems 总被引:3,自引:0,他引:3
Lemaire B. Ould Ahmed Salem C. Revalski J. P. 《Journal of Optimization Theory and Applications》2002,115(2):345-368
In this paper, we consider the extension of the notion of well-posedness by perturbations, introduced by Zolezzi for optimization problems, to other related variational problems like inclusion problems and fixed-point problems. Then, we study the conditions under which there is equivalence of the well-posedness in the above sense between different problems. Relations with the so-called diagonal well-posedness are also given. Finally, an application to staircase iteration methods is presented. 相似文献
5.
Filippo Bracci Roberto Tauraso Fabio Vlacci 《Journal of Mathematical Analysis and Applications》2002,270(2):1131-473
Let f,g be two commuting holomorphic self-maps of the unit disc. If f and g agree at the common Wolff point up to a certain order of derivatives (no more than 3 if the Wolff point is on the unit circle), then f≡g. 相似文献
6.
Efficient measurement of the performance index (the distance of a loading parameter from the voltage collapse point) is one of the key problems in power system operations and planning and such an index indicates the severity of a power system with regard to voltage collapse. There exist many interesting methods and ideas to compute this index. However, some successful methods are not yet mathematically justified while other mathematically sound methods are often proposed directly based on the bifurcation theory and they require the initial stationary state to be too close to the unknown turning point to make the underlying methods practical.This paper first gives a survey of several popular methods for estimating the fold bifurcation point including the continuation methods, bifurcation methods and the test function methods (Seydel's direct solution methods, the tangent vector methods and the reduced Jacobian method) and discuss their relative advantages and problems. Test functions are usually based on scaling of the determinant of the Jacobian matrix and it is generally not clear how to determine the behaviour of such functions. As the underlying nonlinear equations are of a particular type, this allows us to do a new analysis of the determinants of the Jacobian and its submatrices in this paper. Following the analysis, we demonstrate how to construct a class of test functions with a predictable analytical behaviour so that a suitable index can be produced. Finally, examples of two test functions from this class are proposed. For several standard IEEE test systems, promising numerical results have been achieved. 相似文献
7.
8.
9.
On the average complexity of 3D-Voronoi diagrams of random points on convex polytopes 总被引:1,自引:0,他引:1
It is well known that the complexity, i.e. the number of vertices, edges and faces, of the 3-dimensional Voronoi diagram of n points can be as bad as Θ(n2). It is also known that if the points are chosen Independently Identically Distributed uniformly from a 3-dimensional region such as a cube or sphere, then the expected complexity falls to O(n). In this paper we introduce the problem of analyzing what occurs if the points are chosen from a 2-dimensional region in 3-dimensional space. As an example, we examine the situation when the points are drawn from a Poisson distribution with rate n on the surface of a convex polytope. We prove that, in this case, the expected complexity of the resulting Voronoi diagram is O(n). 相似文献
10.