全文获取类型
收费全文 | 1160篇 |
免费 | 82篇 |
国内免费 | 164篇 |
专业分类
化学 | 38篇 |
晶体学 | 1篇 |
力学 | 26篇 |
综合类 | 44篇 |
数学 | 1190篇 |
物理学 | 107篇 |
出版年
2024年 | 1篇 |
2023年 | 18篇 |
2022年 | 12篇 |
2021年 | 15篇 |
2020年 | 24篇 |
2019年 | 31篇 |
2018年 | 29篇 |
2017年 | 32篇 |
2016年 | 29篇 |
2015年 | 25篇 |
2014年 | 32篇 |
2013年 | 77篇 |
2012年 | 44篇 |
2011年 | 40篇 |
2010年 | 47篇 |
2009年 | 65篇 |
2008年 | 80篇 |
2007年 | 67篇 |
2006年 | 77篇 |
2005年 | 91篇 |
2004年 | 63篇 |
2003年 | 68篇 |
2002年 | 68篇 |
2001年 | 64篇 |
2000年 | 65篇 |
1999年 | 42篇 |
1998年 | 44篇 |
1997年 | 38篇 |
1996年 | 25篇 |
1995年 | 17篇 |
1994年 | 16篇 |
1993年 | 11篇 |
1992年 | 7篇 |
1991年 | 6篇 |
1990年 | 2篇 |
1989年 | 8篇 |
1988年 | 3篇 |
1987年 | 1篇 |
1986年 | 1篇 |
1985年 | 3篇 |
1984年 | 2篇 |
1983年 | 2篇 |
1982年 | 4篇 |
1981年 | 2篇 |
1980年 | 2篇 |
1979年 | 1篇 |
1978年 | 1篇 |
1977年 | 3篇 |
1936年 | 1篇 |
排序方式: 共有1406条查询结果,搜索用时 0 毫秒
21.
Manuel Barros 《Annals of Global Analysis and Geometry》1992,10(3):219-226
In this paper we deal with the following particular case of a weaker conjecture by B. Y. Chen: Are there 2-type Willmore surfaces in E 3? In particular we prove that the above question has a negative answer when the surface is the image under stereographic projection of a minimal surface in S 3. 相似文献
22.
本在无向网络中,建立了带有边集限制的最均匀支撑树问题的网络模型.中首先解决最均匀支撑树问题,并给出求无向网络中最均匀支撑树的多项式时间算法;然后,给出了求无向网络中带有边集限制的最小树多项式时间算法;最后,在已解决的两个问题的基础上解决了带有边集限制的最均匀支撑树问题. 相似文献
23.
Nadya Gurevich 《Compositio Mathematica》2003,136(1):25-59
We establish an example of a functorial lift from generic cuspidal representations of a similitude group of the type A
1×C
2 to generic representations of Spin7. Our construction uses the theta correspondence associated to the dual pair of the type (A
1×C
2
B
3) inside E
7. We also consider another theta correspondence associated to the dual pair of type (A
1×C
2
A
1×A
1) in D
6 and show that these two pairs fit into a tower and the standard properties of a tower of theta correspondences hold. 相似文献
24.
Banach空间中二阶积分-微分方程的初值问题 总被引:5,自引:0,他引:5
王文霞 《应用泛函分析学报》2003,5(2):132-142
使用锥理论及单调迭代技术,首先讨论了Banach空间中一阶积分-微分方程初值问题的最小最大解的存在性,并在此基础上讨论了带有一阶微分项的二阶积分-微分方程初值问题的最小最大解的存在性。 相似文献
25.
Dave Auckly 《Proceedings of the American Mathematical Society》2005,133(3):885-889
Vidussi was the first to construct knotted Lagrangian tori in simply connected four-dimensional manifolds. Fintushel and Stern introduced a second way to detect such knotting. This note demonstrates that similar examples may be distinguished by the fundamental group of the exterior.
26.
We find a minimal system of generators and a homogeneous system of parameters for the algebra of invariants of three matrices of third order over a field of an arbitrary characteristic. 相似文献
27.
A computably enumerable (c.e.) degree a is called nonbounding, if it bounds no minimal pair, and plus cupping, if every nonzero c.e. degree x below a is cuppable. Let NB and PC be the sets of all nonbounding and plus cupping c.e. degrees, respectively. Both NB and PC are well understood, but it has not been possible so far to distinguish between the two classes. In the present paper, we investigate the relationship between the classes NB and PC , and show that there exists a minimal pair which join to a plus cupping degree, so that PC ? NB . This gives a first known difference between NB and PC . (© 2003 WILEY‐VCH Verlag GmbH & Co. KGaA, Weinheim) 相似文献
28.
29.
M. Brazil 《Discrete Applied Mathematics》2006,154(18):2545-2564
The Steiner problem in a λ-plane is the problem of constructing a minimum length network interconnecting a given set of nodes (called terminals), with the constraint that all line segments in the network have slopes chosen from λ uniform orientations in the plane. This network is referred to as a minimum λ-tree. The problem is a generalization of the classical Euclidean and rectilinear Steiner tree problems, with important applications to VLSI wiring design.A λ-tree is said to be locally minimal if its length cannot be reduced by small perturbations of its Steiner points. In this paper we prove that a λ-tree is locally minimal if and only if the length of each path in the tree cannot be reduced under a special parallel perturbation on paths known as a shift. This proves a conjecture on necessary and sufficient conditions for locally minimal λ-trees raised in [M. Brazil, D.A. Thomas, J.F. Weng, Forbidden subpaths for Steiner minimum networks in uniform orientation metrics, Networks 39 (2002) 186-222]. For any path P in a λ-tree T, we then find a simple condition, based on the sum of all angles on one side of P, to determine whether a shift on P reduces, preserves, or increases the length of T. This result improves on our previous forbidden paths results in [M. Brazil, D.A. Thomas, J.F. Weng, Forbidden subpaths for Steiner minimum networks in uniform orientation metrics, Networks 39 (2002) 186-222]. 相似文献
30.
研究全稳定广义生灭最小Q过程的可配称性,获得广义生灭最小Q过程是可配称的充分必要条件,以及最小Q过程是唯一的可配称Q过程的充分必要条件. 相似文献