全文获取类型
收费全文 | 2803篇 |
免费 | 177篇 |
国内免费 | 231篇 |
专业分类
化学 | 188篇 |
晶体学 | 5篇 |
力学 | 111篇 |
综合类 | 38篇 |
数学 | 1837篇 |
物理学 | 365篇 |
无线电 | 667篇 |
出版年
2024年 | 4篇 |
2023年 | 35篇 |
2022年 | 31篇 |
2021年 | 44篇 |
2020年 | 45篇 |
2019年 | 64篇 |
2018年 | 33篇 |
2017年 | 78篇 |
2016年 | 78篇 |
2015年 | 67篇 |
2014年 | 128篇 |
2013年 | 199篇 |
2012年 | 130篇 |
2011年 | 164篇 |
2010年 | 131篇 |
2009年 | 146篇 |
2008年 | 160篇 |
2007年 | 185篇 |
2006年 | 149篇 |
2005年 | 136篇 |
2004年 | 111篇 |
2003年 | 117篇 |
2002年 | 103篇 |
2001年 | 81篇 |
2000年 | 120篇 |
1999年 | 79篇 |
1998年 | 93篇 |
1997年 | 75篇 |
1996年 | 54篇 |
1995年 | 31篇 |
1994年 | 41篇 |
1993年 | 31篇 |
1992年 | 23篇 |
1991年 | 30篇 |
1990年 | 13篇 |
1989年 | 11篇 |
1988年 | 17篇 |
1987年 | 19篇 |
1986年 | 12篇 |
1985年 | 26篇 |
1984年 | 23篇 |
1983年 | 5篇 |
1982年 | 12篇 |
1981年 | 11篇 |
1980年 | 14篇 |
1979年 | 17篇 |
1978年 | 12篇 |
1977年 | 8篇 |
1976年 | 8篇 |
1974年 | 3篇 |
排序方式: 共有3211条查询结果,搜索用时 15 毫秒
1.
A new method for the polygonal approximation is presented. The method is based on the search for break points through a context-free grammar, that accepts digital straight segments with loss of information, as well as the decrease in the error committed employing the comparison of a tolerable error. We present an application of our method to different sets of objects widely used, as well as a comparison of our results with the best results reported in the literature, proving that our method achieves better values of error criteria. Besides, a new way to find polygonal approximations, with context-free grammars to recognize digital straight segments without loss of pixels, it is also addressed. 相似文献
2.
测向误差的减小一直以来都是无线电测向精度提高的一个难点,对于不同的测向体制所采用的减小测向误差的方法都不尽相同。本文主要介绍的是相关干涉仪测向体制的基本原理以及通过内插法的应用来减小测向误差的方法。 相似文献
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.
Artūras Dubickas 《Proceedings Mathematical Sciences》2005,115(4):391-397
Suppose that α > 1 is an algebraic number and ξ > 0 is a real number. We prove that the sequence of fractional partsξα
n
, n = 1, 2, 3, …, has infinitely many limit points except when α is a PV-number and ξ ∈ ℚ(α). For ξ = 1 and α being a rational
non-integer number, this result was proved by Vijayaraghavan. 相似文献