全文获取类型
收费全文 | 601篇 |
免费 | 34篇 |
国内免费 | 67篇 |
专业分类
化学 | 10篇 |
晶体学 | 1篇 |
力学 | 17篇 |
综合类 | 13篇 |
数学 | 632篇 |
物理学 | 29篇 |
出版年
2022年 | 11篇 |
2021年 | 11篇 |
2020年 | 7篇 |
2019年 | 16篇 |
2018年 | 17篇 |
2017年 | 8篇 |
2016年 | 15篇 |
2015年 | 8篇 |
2014年 | 21篇 |
2013年 | 38篇 |
2012年 | 29篇 |
2011年 | 17篇 |
2010年 | 32篇 |
2009年 | 31篇 |
2008年 | 43篇 |
2007年 | 37篇 |
2006年 | 48篇 |
2005年 | 26篇 |
2004年 | 32篇 |
2003年 | 31篇 |
2002年 | 28篇 |
2001年 | 26篇 |
2000年 | 28篇 |
1999年 | 26篇 |
1998年 | 32篇 |
1997年 | 21篇 |
1996年 | 16篇 |
1995年 | 3篇 |
1994年 | 4篇 |
1993年 | 8篇 |
1992年 | 1篇 |
1991年 | 1篇 |
1990年 | 3篇 |
1989年 | 8篇 |
1988年 | 3篇 |
1987年 | 3篇 |
1986年 | 4篇 |
1985年 | 2篇 |
1984年 | 2篇 |
1982年 | 2篇 |
1980年 | 2篇 |
1979年 | 1篇 |
排序方式: 共有702条查询结果,搜索用时 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.
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 相似文献
3.
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 相似文献
4.
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. 相似文献
5.
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. 相似文献
6.
Jouni PARKKONEN Vesa RUUSKA 《数学学报(英文版)》2007,23(1):89-94
A conjecture of Ehrenpreis states that any two compact Riemann surfaces of genus at least two have finite degree unbranched holomorphic covers that are arbitrarily close to each other in moduli space. Here we prove a weaker result where certain branched covers associated with arithmetic Riemann surfaces are allowed, and investigate the connection of our result with the original conjecture. 相似文献
7.
对覆盖广义Rough集中的隶属关系、隶属函数进行了定义,并利用隶属函数定义了集合的Rough包含与Rough相等,得到一些与Pawlak的Rough集不同的性质。 相似文献
8.
Simon R. Blackburn 《Journal of Combinatorial Theory, Series A》2006,113(7):1572-1581
The paper contains proofs of the following results. For all sufficiently large odd integers n, there exists a set of 2n−1 permutations that pairwise generate the symmetric group Sn. There is no set of 2n−1+1 permutations having this property. For all sufficiently large integers n with n≡2mod4, there exists a set of 2n−2 even permutations that pairwise generate the alternating group An. There is no set of 2n−2+1 permutations having this property. 相似文献
9.
Covering numbers of precompact symmetric convex subsets of Hilbert spaces are investigated. Lower bounds are derived for sets containing orthogonal subsets with norms of their elements converging to zero sufficiently slowly. When these sets are convex hulls of sets with power-type covering numbers, the bounds are tight. The arguments exploit properties of generalized Hadamard matrices. The results are illustrated by examples from machine learning, neurocomputing, and nonlinear approximation. 相似文献
10.
We show that every plane graph of diameter 2r in which all inner faces are triangles and all inner vertices have degree larger than 5 can be covered with two balls of radius r. © 2003 Wiley Periodicals, Inc. J Graph Theory 44: 65–80, 2003 相似文献