全文获取类型
收费全文 | 22142篇 |
免费 | 668篇 |
国内免费 | 733篇 |
专业分类
化学 | 4268篇 |
晶体学 | 860篇 |
力学 | 482篇 |
综合类 | 73篇 |
数学 | 15172篇 |
物理学 | 2688篇 |
出版年
2023年 | 76篇 |
2022年 | 208篇 |
2021年 | 173篇 |
2020年 | 175篇 |
2019年 | 528篇 |
2018年 | 552篇 |
2017年 | 357篇 |
2016年 | 361篇 |
2015年 | 338篇 |
2014年 | 730篇 |
2013年 | 1199篇 |
2012年 | 714篇 |
2011年 | 1490篇 |
2010年 | 1509篇 |
2009年 | 1661篇 |
2008年 | 1699篇 |
2007年 | 1665篇 |
2006年 | 1364篇 |
2005年 | 1003篇 |
2004年 | 937篇 |
2003年 | 745篇 |
2002年 | 625篇 |
2001年 | 487篇 |
2000年 | 433篇 |
1999年 | 433篇 |
1998年 | 385篇 |
1997年 | 316篇 |
1996年 | 444篇 |
1995年 | 378篇 |
1994年 | 381篇 |
1993年 | 329篇 |
1992年 | 268篇 |
1991年 | 161篇 |
1990年 | 141篇 |
1989年 | 142篇 |
1988年 | 102篇 |
1987年 | 111篇 |
1986年 | 110篇 |
1985年 | 170篇 |
1984年 | 101篇 |
1983年 | 70篇 |
1982年 | 100篇 |
1981年 | 86篇 |
1980年 | 49篇 |
1979年 | 42篇 |
1978年 | 43篇 |
1977年 | 53篇 |
1976年 | 43篇 |
1975年 | 12篇 |
1974年 | 20篇 |
排序方式: 共有10000条查询结果,搜索用时 15 毫秒
91.
92.
93.
The pulsed positron beam at the Helsinki University of Technology is designed for the end energy of 3-30 keV and grounded target. This is achieved with a constant voltage acceleration followed by an adjustable deceleration. In the design of this accelerator-decelerator the possibility for electrical breakdowns and partial discharges must be eliminated.For designing the electrode and insulator structures for accelerator-decelerator configuration electric field simulations were carried out with the finite element analysis program. In this paper we present the design of the accelerator-decelerator and the results of the electric field simulations. The results of high voltage tests will also be presented and compared with the simulations. 相似文献
94.
In this paper, we report that the phase transformation of Ni-B, Ni-P diffusion barriers deposited electrolessly on Cu, for the reason that the Ni-P layer is a more effective diffusion barrier than the Ni-B layer. The Ni3B crystallized was decomposed to Ni and B2O3 above 400 °C and the Ni3P crystallized was decomposed to Ni and P2O5 above 600 °C respectively in Ar atmosphere. Also, the Ni3B was decomposed to Ni and free B above 400 °C and the Ni3P was decomposed to Ni and free P above 600 °C respectively in H2 atmosphere. The decomposed Ni formed a solid solution with Cu. The Cu diffusion occurred above 400 °C for Ni-B layer and above 600 °C for Ni-P layer, respectively. Because the decomposition temperature of Ni-P layer is about 200 °C higher than that of Ni-B layer, the Ni-P layer is a more effective barrier for Cu than the Ni-B layer. 相似文献
95.
Hans L. Bodlaender 《Discrete Applied Mathematics》2007,155(11):1348-1372
The Maximum Cardinality Search (MCS) algorithm visits the vertices of a graph in some order, such that at each step, an unvisited vertex that has the largest number of visited neighbours becomes visited. A maximum cardinality search ordering (MCS-ordering) of a graph is an ordering of the vertices that can be generated by the MCS algorithm. The visited degree of a vertex v in an MCS-ordering is the number of neighbours of v that are before v in the ordering. The visited degree of an MCS-ordering ψ of G is the maximum visited degree over all vertices v in ψ. The maximum visited degree over all MCS-orderings of graph G is called its maximum visited degree. Lucena [A new lower bound for tree-width using maximum cardinality search, SIAM J. Discrete Math. 16 (2003) 345-353] showed that the treewidth of a graph G is at least its maximum visited degree.We show that the maximum visited degree is of size O(logn) for planar graphs, and give examples of planar graphs G with maximum visited degree k with O(k!) vertices, for all k∈N. Given a graph G, it is NP-complete to determine if its maximum visited degree is at least k, for any fixed k?7. Also, this problem does not have a polynomial time approximation algorithm with constant ratio, unless P=NP. Variants of the problem are also shown to be NP-complete.In this paper, we also propose some heuristics for the problem, and report on an experimental analysis of them. Several tiebreakers for the MCS algorithm are proposed and evaluated. We also give heuristics that give upper bounds on the value of the maximum visited degree of a graph, which appear to give results close to optimal on many graphs from real life applications. 相似文献
96.
Robert Hochberg 《Combinatorica》2006,26(1):47-64
We prove that the class of homogeneous quasi-arithmetic progressions has unbounded discrepancy. That is, we show that given any 2-coloring of the natural numbers and any positive integer D, one can find a real number α≥1 and a set of natural numbers of the form {0, [α], [2α], [3α], . . . , [kα]} so that one color appears at least D times more than the other color. This was already proved by Beck in 1983, but the proof given here is somewhat simpler and
gives a better bound on the discrepancy. 相似文献
97.
A magic labelling of a set system is a labelling of its points by distinct positive integers so that every set of the system has the same sum,
the magic sum. Examples are magic squares (the sets are the rows, columns, and diagonals) and semimagic squares (the same, but without
the diagonals). A magilatin labelling is like a magic labelling but the values need be distinct only within each set. We show that the number of n × n magic or magilatin labellings is a quasipolynomial function of the magic sum, and also of an upper bound on the entries in
the square. Our results differ from previous ones because we require that the entries in the square all be different from
each other, and because we derive our results not by ad hoc reasoning but from a general theory of counting lattice points in rational inside-out polytopes. We also generalize from
set systems to rational linear forms.
Dedicated to the memory of Claudia Zaslavsky, 1917–2006
Received August 10, 2005 相似文献
98.
We present a scheme for perfectly teleporting an arbitrary and unknown N-particle GHZ-class state from a sender to a receiver. We just need one quantum channel composed of two or three particles in the maximally entangled state. The sender performs one Bell-state measurement on two of her particles and N - 1 Hadamard operations and N - 1 yon Neumann measurements on the rest N - 1 particles. The receiver adopts one corresponding unitary transformation on his particles shared with the sender. After that, the receiver can obtain the original N-particle GHZ-class state by introducing N - 1 ancillary particles and carrying out N - 1 controlled-NOT operations. We also generalize the scheme to the case of controlled teleportation. 相似文献
99.
Consider the problem of three point vortices (also called Helmholtz’ vortices) on a plane, with arbitrarily given vorticities.
The interaction between vortices is proportional to 1/r, where r is the distance between two vortices. The problem has 2 equilateral and at most 3 collinear normalized relative equilibria.
This 3 is the optimal upper bound. Our main result is that the above standard statements remain unchanged if we consider an
interaction proportional to r
b, for any b < 0. For 0 < b < 1, the optimal upper bound becomes 5. For positive vorticities and any b < 1, there are exactly 3 collinear normalized relative equilibria. The case b = −2 of this last statement is the well-known theorem due to Euler: in the Newtonian 3-body problem, for any choice of the
3 masses, there are 3 Euler configurations (also known as the 3 Euler points). These small upper bounds strengthen the belief
of Kushnirenko and Khovanskii [18]: real varieties defined by simple systems should have a simple topology. We indicate some
hard conjectures about the configurations of relative equilibrium and suggest they could be attacked within the quasi-polynomial
framework. 相似文献
100.