全文获取类型
收费全文 | 4327篇 |
免费 | 200篇 |
国内免费 | 157篇 |
专业分类
化学 | 1208篇 |
晶体学 | 1篇 |
力学 | 36篇 |
综合类 | 33篇 |
数学 | 2821篇 |
物理学 | 585篇 |
出版年
2024年 | 15篇 |
2023年 | 100篇 |
2022年 | 92篇 |
2021年 | 85篇 |
2020年 | 122篇 |
2019年 | 158篇 |
2018年 | 154篇 |
2017年 | 132篇 |
2016年 | 91篇 |
2015年 | 77篇 |
2014年 | 219篇 |
2013年 | 326篇 |
2012年 | 163篇 |
2011年 | 290篇 |
2010年 | 248篇 |
2009年 | 351篇 |
2008年 | 316篇 |
2007年 | 259篇 |
2006年 | 238篇 |
2005年 | 171篇 |
2004年 | 185篇 |
2003年 | 131篇 |
2002年 | 119篇 |
2001年 | 86篇 |
2000年 | 81篇 |
1999年 | 99篇 |
1998年 | 88篇 |
1997年 | 56篇 |
1996年 | 40篇 |
1995年 | 20篇 |
1994年 | 23篇 |
1993年 | 27篇 |
1992年 | 12篇 |
1991年 | 13篇 |
1990年 | 13篇 |
1989年 | 15篇 |
1988年 | 11篇 |
1987年 | 3篇 |
1986年 | 4篇 |
1985年 | 14篇 |
1984年 | 13篇 |
1983年 | 5篇 |
1982年 | 5篇 |
1981年 | 5篇 |
1979年 | 1篇 |
1978年 | 2篇 |
1977年 | 2篇 |
1974年 | 1篇 |
1973年 | 1篇 |
1970年 | 1篇 |
排序方式: 共有4684条查询结果,搜索用时 31 毫秒
51.
PSN is a fast forward permutation if for each m the computational complexity of evaluating Pm(x) is small independently of m and x. Naor and Reingold constructed fast forward pseudorandom cycluses and involutions. By studying the evolution of permutation graphs, we prove that the number of queries needed to distinguish a random cyclus from a random permutation in SN is Θ(N) if one does not use queries of the form Pm(x), but is only Θ(1) if one is allowed to make such queries. We construct fast forward permutations which are indistinguishable from random permutations even when queries of the form Pm(x) are allowed. This is done by introducing an efficient method to sample the cycle structure of a random permutation, which in turn solves an open problem of Naor and Reingold. 相似文献
52.
Michel Vasquez 《Journal of Heuristics》2004,10(4):407-413
For the Queens_n
2 graph coloring problems no chromatic numbers are available for n > 9 except where n is not a multiple of 2 or 3. In this paper we propose an exact algorithm that takes advantage of the particular structure of these graphs. The algorithm works on the independent sets of the graph rather than on the vertices to be colored. It combines branch and bound, for independent set assignment, with a clique based filtering procedure. A first experimentation of this approach provided the coloring number values ranging for n = 10 to n = 14. 相似文献
53.
Conventionally, surface roughness is predominantly determined through the use of stylus instruments. However, there are certain limitations involved in the method, particularly when a test specimen, such as a silicon wafer, has a smooth mirror-like surface. Hence, it is necessary to explore alternative non-contact techniques. Light scattering has recently been gaining popularity as an optical technique to provide prompt and precise inspection of surface roughness. In this paper, the total integrated scattering (TIS) model is modified to retrieve parameters on surface micro-topography through light scattering. The applicability of the proposed modified TIS model is studied and compared with an atomic force microscope. Experimental results obtained show that the proposed technique is highly accurate for measuring surface roughness in the nanometer range. 相似文献
54.
Andrew V. Goldberg Michael D. Grigoriadis Robert E. Tarjan 《Mathematical Programming》1991,50(1-3):277-290
Goldfarb and Hao (1990) have proposed a pivot rule for the primal network simplex algorithm that will solve a maximum flow problem on ann-vertex,m-arc network in at mostnm pivots and O(n
2
m) time. In this paper we describe how to extend the dynamic tree data structure of Sleator and Tarjan (1983, 1985) to reduce the running time of this algorithm to O(nm logn). This bound is less than a logarithmic factor larger than those of the fastest known algorithms for the problem. Our extension of dynamic trees is interesting in its own right and may well have additional applications.Research partially supported by a Presidential Young Investigator Award from the National Science Foundation, Grant No. CCR-8858097, an IBM Faculty Development Award, and AT&T Bell Laboratories.Research partially supported by the Office of Naval Research, Contract No. N00014-87-K-0467.Research partially supported by the National Science Foundation, Grant No. DCR-8605961, and the Office of Naval Research, Contract No. N00014-87-K-0467. 相似文献
55.
Axel Kohnert 《Discrete Applied Mathematics》2007,155(11):1451-1457
We construct new linear two-weight codes over the finite field with q elements. To do so we solve the equivalent problem of finding point sets in the projective geometry with certain intersection properties. These point sets are in bijection to solutions of a Diophantine linear system of equations. To reduce the size of the system of equations we restrict the search for solutions to solutions with special symmetries.Two-weight codes can be used to define strongly regular graphs. We give tables of the two-weight codes and the corresponding strongly regular graphs. In some cases we find new distance-optimal two-weight codes and also new strongly regular graphs. 相似文献
56.
Ronald I. Becker Isabella Lari Andrea Scozzari Giovanni Storchi 《Annals of Operations Research》2007,150(1):65-78
In this paper we consider the location of a path shaped facility on a grid graph. In the literature this problem was extensively
studied on particular classes of graphs as trees or series-parallel graphs. We consider here the problem of finding a path
which minimizes the sum of the (shortest) distances from it to the other vertices of the grid, where the path is also subject
to an additional constraint that takes the form either of the length of the path or of the cardinality. We study the complexity
of these problems and we find two polynomial time algorithms for two special cases, with time complexity of O(n) and O(nℓ) respectively, where n is the number of vertices of the grid and ℓ is the cardinality of the path to be located.
The literature about locating dimensional facilities distinguishes between the location of extensive facilities in continuous
spaces and network facility location. We will show that the problems presented here have a close connection with continuous
dimensional facility problems, so that the procedures provided can also be useful for solving some open problems of dimensional
facilities location in the continuous case. 相似文献
57.
在HL-1托卡马克上进行了辅助加热、加料、电流驱动的物理实验研究。在改善等离子体约束方面,某些实验取得了较好的结果。在适当的稳定放电条件下,低杂波电流驱动和弹丸注入辅助加料,均能使等离子体能量约束得到一定程度的改善,与相同密度条件下的欧姆加热放电相比,能量约束时间提高了约30%。在电子回旋共振加热等离子体实验中,等离子体总能量明显增加,但与相同密度条件下的欧姆加热放电相比,能量约束时间减少了约20%。 相似文献
58.
如果一个图G存在一个k-列表安排使得G具有一个唯一列表染色,则称 G是唯一列表可染色图,简称UkLC图.我们称图G具有M(k)性质当且仅当G不 是UkLC图.本文在借鉴θr,s,t-图概念的基础上引入θr,s,t-图的定义,并证明:除了 r=s=t=2以外,θr,s,t-图都是U2LC图.利用如上结果我们给出M.Mahdian and E.S.Mahmoodian对U2LC图所作特征化的一个简单证明. 相似文献
59.
Marston Conder Aleksander Malnič Dragan Marušič Primž Potočnik 《Journal of Algebraic Combinatorics》2006,23(3):255-294
A list is given of all semisymmetric (edge- but not vertex-transitive) connected finite cubic graphs of order up to 768. This
list was determined by the authors using Goldschmidt's classification of finite primitive amalgams of index (3,3), and a computer
algorithm for finding all normal subgroups of up to a given index in a finitely-presented group. The list includes several
previously undiscovered graphs. For each graph in the list, a significant amount of information is provided, including its
girth and diameter, the order of its automorphism group, the order and structure of a minimal edge-transitive group of automorphisms,
its Goldschmidt type, stabiliser partitions, and other details about its quotients and covers. A summary of all known infinite
families of semisymmetric cubic graphs is also given, together with explicit rules for their construction, and members of
the list are identified with these. The special case of those graphs having K1,3 as a normal quotient is investigated in detail.
Supported in part by N.Z. Marsden Fund (grant no. UOA 124) and N.Z. Centres of Research Excellence Fund (grant no. UOA 201)
Supported in part by “Ministrstvo za šolstvo, znanost in šport Slovenije”, research program no. 101-506.
Supported in part by research projects no. Z1-4186-0101 and no. Z1-3124-0101. The fourth author would like to thank the University
of Auckland for hospitality during his visit there in 2003. 相似文献
60.
Cheng Lu ZHANG Xiao Lei ZHU Ying Ge MA Li Wei ZOU 《中国化学快报》2006,17(2):163-164
12-Hydroxy-13-methylpodocarpa-9, 11, 13-trien-3-one 9 was isolated from the twigs ofCroton salutaris1. Many diterpenes exhibit significant bioactivities, such as antibac-terial and antitumour and 9 has a rare structure. In order to study the relationshipb… 相似文献