全文获取类型
收费全文 | 4945篇 |
免费 | 163篇 |
国内免费 | 31篇 |
专业分类
化学 | 3195篇 |
晶体学 | 21篇 |
力学 | 219篇 |
数学 | 883篇 |
物理学 | 821篇 |
出版年
2023年 | 21篇 |
2022年 | 61篇 |
2021年 | 75篇 |
2020年 | 65篇 |
2019年 | 76篇 |
2018年 | 58篇 |
2017年 | 61篇 |
2016年 | 133篇 |
2015年 | 120篇 |
2014年 | 150篇 |
2013年 | 268篇 |
2012年 | 333篇 |
2011年 | 399篇 |
2010年 | 206篇 |
2009年 | 218篇 |
2008年 | 281篇 |
2007年 | 290篇 |
2006年 | 303篇 |
2005年 | 290篇 |
2004年 | 227篇 |
2003年 | 233篇 |
2002年 | 213篇 |
2001年 | 75篇 |
2000年 | 83篇 |
1999年 | 49篇 |
1998年 | 65篇 |
1997年 | 71篇 |
1996年 | 69篇 |
1995年 | 46篇 |
1994年 | 55篇 |
1993年 | 38篇 |
1992年 | 42篇 |
1991年 | 33篇 |
1990年 | 26篇 |
1989年 | 25篇 |
1988年 | 24篇 |
1987年 | 22篇 |
1986年 | 16篇 |
1985年 | 31篇 |
1984年 | 31篇 |
1983年 | 16篇 |
1982年 | 21篇 |
1981年 | 18篇 |
1980年 | 26篇 |
1979年 | 29篇 |
1978年 | 19篇 |
1977年 | 15篇 |
1976年 | 19篇 |
1975年 | 18篇 |
1973年 | 14篇 |
排序方式: 共有5139条查询结果,搜索用时 31 毫秒
81.
82.
Finite strains at the tip of a crack in a sheet of hyperelastic material: I. Homogeneous case 总被引:1,自引:0,他引:1
This paper describes an asymptotic analysis of the strain and stress fields at the tip of a crack in a sheet of incompressible hyperelastic material. The investigations are carried out within the framework of finite elastostatics and for the class of Generalized Neo-Hookean materials. Both the symmetric (mode I) and non-symmetric (mixed-mode) cases are considered. It is shown that the latter situation corresponds locally to a rigid body rotation of the symmetric fields. The effect of the hardening parameter on crack tip blunting is investigated analytically and numerically. 相似文献
83.
Information
Congresses, conferences, symposia, meetings, and seminars in the field of chemical sciences held in 1995–1996 相似文献84.
85.
86.
Inclusion-exclusion: Exact and approximate 总被引:1,自引:0,他引:1
It is often required to find the probability of the union of givenn eventsA
1
,...,A
n
. The answer is provided, of course, by the inclusion-exclusion formula: Pr(A
i
)=
i
–
i<j
Pr(A
i
A
j
)±.... Unfortunately, this formula has exponentially many terms, and only rarely does one manage to carry out the exact calculation. From a computational point of view, finding the probability of the union is an intractable, #P-hard problem, even in very restricted cases. This state of affairs makes it reasonable to seek approximate solutions that are computationally feasible. Attempts to find such approximate solutions have a long history starting already with Boole [1]. A recent step in this direction was taken by Linial and Nisan [4] who sought approximations to the probability of the union, given the probabilities of allj-wise intersections of the events forj=1,...k. The developed a method to approximate Pr(A
i
), from the above data with an additive error of exp
. In the present article we develop an expression that can be computed in polynomial time, that, given the sums |S|=j
Pr(
iS
A
i
) forj=1,...k, approximates Pr(A
i
) with an additive error of exp
. This error is optimal, up to the logarithmic factor implicit in the
notation.The problem of enumerating satisfying assignments of a boolean formula in DNF formF=v
l
m
C
i
is an instance of the general problem that had been extensively studied [7]. HereA
i
is the set of assignments that satisfyC
i
, and Pr(
iS
A
i
)=a
S
/2n where
iS
C
i
is satisfied bya
S
assignments. Judging from the general results, it is hard to expect a decent approximation ofF's number of satisfying assignments, without knowledge of the numbersa
S
for, say, all cardinalities
. Quite surprisingly, already the numbersa
S
over |S|log(n+1)uniquely determine the number of satisfying assignments for F.We point out a connection between our work and the edge-reconstruction conjecture. Finally we discuss other special instances of the problem, e.g., computing permanents of 0,1 matrices, evaluating chromatic polynomials of graphs and for families of events whose VC dimension is bounded.Work supported in part by a grant of the Binational Israel-US Science Foundation.Work supported in part by a grant of the Binational Israel-US Science Foundation and by the Israel Science Foundation. 相似文献
87.
Consider anM/M/1 queueing system with server vacations where the server is turned off as soon as the queue gets empty. We assume that the vacation durations form a sequence of i.i.d. random variables with exponential distribution. At the end of a vacation period, the server may either be turned on if the queue is non empty or take another vacation. The following costs are incurred: a holding cost ofh per unit of time and per customer in the system and a fixed cost of each time the server is turned on. We show that there exists a threshold policy that minimizes the long-run average cost criterion. The approach we use was first proposed in Blanc et al. (1990) and enables us to determine explicitly the optimal threshold and the optimal long-run average cost in terms of the model parameters. 相似文献
88.
89.
Philippe Rukimbira 《Annals of Global Analysis and Geometry》1993,11(2):165-171
Let (M, ) be an R-contact manifold, then the set of periodic points of the characteristic vector field is a nonempty union of closed, totally geodesic odd-dimensional submanifolds. Moreover, the R-metric cannot have nonpositive sectional curvature. We also prove that no R-contact form can exist on any torus. 相似文献
90.