全文获取类型
收费全文 | 2050篇 |
免费 | 130篇 |
国内免费 | 222篇 |
专业分类
化学 | 56篇 |
晶体学 | 2篇 |
力学 | 71篇 |
综合类 | 44篇 |
数学 | 2125篇 |
物理学 | 104篇 |
出版年
2024年 | 2篇 |
2023年 | 19篇 |
2022年 | 29篇 |
2021年 | 26篇 |
2020年 | 39篇 |
2019年 | 55篇 |
2018年 | 55篇 |
2017年 | 57篇 |
2016年 | 45篇 |
2015年 | 36篇 |
2014年 | 58篇 |
2013年 | 193篇 |
2012年 | 78篇 |
2011年 | 70篇 |
2010年 | 82篇 |
2009年 | 102篇 |
2008年 | 142篇 |
2007年 | 120篇 |
2006年 | 132篇 |
2005年 | 99篇 |
2004年 | 109篇 |
2003年 | 111篇 |
2002年 | 114篇 |
2001年 | 83篇 |
2000年 | 105篇 |
1999年 | 82篇 |
1998年 | 79篇 |
1997年 | 62篇 |
1996年 | 58篇 |
1995年 | 17篇 |
1994年 | 21篇 |
1993年 | 17篇 |
1992年 | 10篇 |
1991年 | 10篇 |
1990年 | 6篇 |
1989年 | 17篇 |
1988年 | 4篇 |
1987年 | 6篇 |
1986年 | 7篇 |
1985年 | 11篇 |
1984年 | 6篇 |
1983年 | 2篇 |
1982年 | 6篇 |
1981年 | 5篇 |
1980年 | 5篇 |
1979年 | 4篇 |
1978年 | 2篇 |
1977年 | 2篇 |
1975年 | 2篇 |
排序方式: 共有2402条查询结果,搜索用时 15 毫秒
1.
《Operations Research Letters》2022,50(3):274-280
The minimum k-enclosing ball problem seeks the ball with smallest radius that contains at least k of m given points. This problem is NP-hard. We present a branch-and-bound algorithm on the tree of the subsets of k points to solve this problem. Our method is able to solve the problem exactly in a short amount of time for small and medium sized datasets. 相似文献
2.
3.
Charles J. Colbourn Sosina S. Martirosyan Gary L. Mullen Dennis Shasha George B. Sherwood Joseph L. Yucas 《组合设计杂志》2006,14(2):124-138
A covering array CA(N;t,k, v is an N × k array such that every N × t subarray contains all t‐tuples from v symbols at least once, where t is the strength of the array. Covering arrays are used to generate software test suites to cover all t‐sets of component interactions. The particular case when t = 2 (pairwise coverage) has been extensively studied, both to develop combinatorial constructions and to provide effective algorithmic search techniques. In this paper, a simple “cut‐and‐paste” construction is extended to covering arrays in which different columns (factors) admit different numbers of symbols (values); in the process an improved recursive construction for covering arrays with t = 2 is derived. © 2005 Wiley Periodicals, Inc. J Combin Designs 14: 124–138, 2006 相似文献
4.
具有某种断面的半群的研究进展 总被引:1,自引:0,他引:1
本文综述了几类具有特殊断面的半群的近期研究结果。在介绍逆半群和正则半群的一般结构之后,概述了具有逆断面的正则半群的结构和同余格的研究成果。总结了作为逆断面的推广的可裂断面,纯正断面,正则^*-断面和恰当断面。提出了可以进一步研究的重要的问题。 相似文献
5.
曾六川 《数学年刊A辑(中文版)》2002,(6)
设X是p一致凸Banach空间,具有弱一致正规结构与非严格的Opial性质.又设C是X的非空凸弱紧子集.在适当的条件下,证明了C上每个渐近正则半群T={T(t):t∈S}都有不动点进一步,在类似的条件下,也讨论了一致凸Banach空间中渐近正则半群的不动点的存在性. 相似文献
6.
In this note we show how coverings induced by voltage assignments can be used to produce packings of disjoint copies of the Hoffman‐Singleton graph into K50. © 2003 Wiley Periodicals, Inc. J Combin Designs 11: 408–412, 2003; Published online in Wiley InterScience ( www.interscience.wiley.com ). DOI 10.1002/jcd.10049 相似文献
8.
A triangulation of a connected closed surface is called weakly regular if the action of its automorphism group on its vertices
is transitive. A triangulation of a connected closed surface is called degree-regular if each of its vertices have the same
degree. Clearly, a weakly regular triangulation is degree-regular. In [8], Lutz has classified all the weakly regular triangulations
on at most 15 vertices. In [5], Datta and Nilakantan have classified all the degree-regular triangulations of closed surfaces
on at most 11 vertices.
In this article, we have proved that any degree-regular triangulation of the torus is weakly regular. We have shown that there
exists ann-vertex degree-regular triangulation of the Klein bottle if and only if n is a composite number ≥ 9. We have constructed two
distinctn-vertex weakly regular triangulations of the torus for eachn ≥ 12 and a (4m + 2)-vertex weakly regular triangulation of the Klein bottle for eachm ≥ 2. For 12 ≤n ≤ 15, we have classified all then-vertex degree-regular triangulations of the torus and the Klein bottle. There are exactly 19 such triangulations, 12 of which
are triangulations of the torus and remaining 7 are triangulations of the Klein bottle. Among the last 7, only one is weakly
regular. 相似文献
9.
Jensen and Toft 8 conjectured that every 2‐edge‐connected graph without a K5‐minor has a nowhere zero 4‐flow. Walton and Welsh 19 proved that if a coloopless regular matroid M does not have a minor in {M(K3,3), M*(K5)}, then M admits a nowhere zero 4‐flow. In this note, we prove that if a coloopless regular matroid M does not have a minor in {M(K5), M*(K5)}, then M admits a nowhere zero 4‐flow. Our result implies the Jensen and Toft conjecture. © 2005 Wiley Periodicals, Inc. J Graph Theory 相似文献
10.
A. P. Prishivalko 《Journal of Applied Spectroscopy》1997,64(1):94-100
A method for finding the optimum sizes of pigment particles, their volume concentration, and the paint coating thickness that
provide the covering power and the required coloristic characteristics of reflected light for the minimum flow rate of pigments
is based on using a four-flow approximation of the solution to the equation of radiation transfer in dispersion media and
is extended to coatings of complex composition. The capabilities of the method are demonstrated by examples of coatings of
mixtures of hematite and rutile particles in a binder with n=1.5 for variations of the modal size and the half-width of the
size distribution of the pigment particles.
B. I. Stepanov Institute of Physics, Academy of Sciences of Belarus, 70, F. Skorina Ave., Minsk, 220072, Belarus. Translated
from Zhurnal Prikladnoi Spektroskopii, Vol. 64, No. 1, pp. 90–96, January–February, 1997. 相似文献