全文获取类型
收费全文 | 1078篇 |
免费 | 54篇 |
国内免费 | 135篇 |
专业分类
化学 | 32篇 |
晶体学 | 1篇 |
力学 | 57篇 |
综合类 | 16篇 |
数学 | 1003篇 |
物理学 | 158篇 |
出版年
2023年 | 6篇 |
2022年 | 15篇 |
2021年 | 16篇 |
2020年 | 20篇 |
2019年 | 27篇 |
2018年 | 23篇 |
2017年 | 23篇 |
2016年 | 20篇 |
2015年 | 21篇 |
2014年 | 37篇 |
2013年 | 81篇 |
2012年 | 40篇 |
2011年 | 34篇 |
2010年 | 53篇 |
2009年 | 56篇 |
2008年 | 73篇 |
2007年 | 56篇 |
2006年 | 83篇 |
2005年 | 55篇 |
2004年 | 58篇 |
2003年 | 69篇 |
2002年 | 49篇 |
2001年 | 44篇 |
2000年 | 44篇 |
1999年 | 44篇 |
1998年 | 48篇 |
1997年 | 43篇 |
1996年 | 31篇 |
1995年 | 8篇 |
1994年 | 10篇 |
1993年 | 13篇 |
1992年 | 4篇 |
1991年 | 6篇 |
1990年 | 4篇 |
1989年 | 9篇 |
1988年 | 3篇 |
1987年 | 10篇 |
1986年 | 8篇 |
1985年 | 5篇 |
1984年 | 3篇 |
1983年 | 1篇 |
1982年 | 4篇 |
1980年 | 3篇 |
1979年 | 1篇 |
1978年 | 3篇 |
1976年 | 1篇 |
1969年 | 1篇 |
1957年 | 1篇 |
排序方式: 共有1267条查询结果,搜索用时 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.
In this paper, we investigate the evolution of joint invariants under invariant geometric flows using the theory of equivariant moving frames and the induced invariant discrete variational complex. For certain arc length preserving planar curve flows invariant under the special Euclidean group , the special linear group , and the semidirect group , we find that the induced evolution of the discrete curvature satisfies the differential‐difference mKdV, KdV, and Burgers' equations, respectively. These three equations are completely integrable, and we show that a recursion operator can be constructed by precomposing the characteristic operator of the curvature by a certain invariant difference operator. Finally, we derive the constraint for the integrability of the discrete curvature evolution to lift to the evolution of the discrete curve itself. 相似文献
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.
The paper proposes a rational method to derive fairness measures for surfaces. It works in cases where isophotes, reflection lines, planar intersection curves, or other curves are used to judge the fairness of the surface. The surface fairness measure is derived by demanding that all the given curves should be fair with respect to an appropriate curve fairness measure. The method is applied to the field of ship hull design where the curves are plane intersections. The method is extended to the case where one considers, not the fairness of one curve, but the fairness of a one parameter family of curves. Six basic third order invariants by which the fairing measures can be expressed are defined. Furthermore, the geometry of a plane intersection curve is studied, and the variation of the total, the normal, and the geodesic curvature and the geodesic torsion is determined. 相似文献
5.
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 相似文献
6.
Kayll Lake 《General Relativity and Gravitation》2004,36(5):1159-1169
The norms associated with the gradients of the two non-differential invariants of the Kerr vacuum are examined. Whereas both locally single out the horizons, their global behavior is more interesting. Both reflect the background angular momentum as the volume of space allowing a timelike gradient decreases with increasing angular momentum becoming zero in the degenerate and naked cases. These results extend directly to the Kerr-Newman geometry. 相似文献
7.
Goryunov proved that the space of local invariants of Vassiliev type for generic maps from surfaces to three-space is three-dimensional.
The basic invariants were the number of pinch points, the number of triple points and one linked to a Rokhlin type invariant.
In this paper we show that, by colouring the complement of the image of the map with a chess board pattern, we can produce
a six-dimensional space of local invariants. These are essentially black and white versions of the above. Simple examples
show how these are more effective.
This revised version was published online in August 2006 with corrections to the Cover Date. 相似文献
8.
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. 相似文献
9.
Tsonka Stefanova Baicheva 《Designs, Codes and Cryptography》1998,13(3):223-227
The covering radius of all ternary cyclic codes of length up to 25 is given. Some of the results were obtained by computer
and for others mathematical reasonings were applied. The minimal distances of all codes were recalculated. 相似文献
10.
In this paper we show that the Boltzmann weights of the three-dimensional Baxter-Bazhanov model give representations of the braid group if some suitable spectral limits are taken. In the trigonometric case we classify all possible spectral limits which produce braid group representations. Furthermore, we prove that for some of them we get cyclotomic invariants of links and for others we obtain tangle invariants generalizing the cyclotomic ones. 相似文献