全文获取类型
收费全文 | 10696篇 |
免费 | 239篇 |
国内免费 | 27篇 |
专业分类
化学 | 6906篇 |
晶体学 | 45篇 |
力学 | 159篇 |
数学 | 1785篇 |
物理学 | 2067篇 |
出版年
2020年 | 107篇 |
2019年 | 81篇 |
2017年 | 79篇 |
2016年 | 185篇 |
2015年 | 153篇 |
2014年 | 184篇 |
2013年 | 363篇 |
2012年 | 330篇 |
2011年 | 363篇 |
2010年 | 223篇 |
2009年 | 226篇 |
2008年 | 301篇 |
2007年 | 338篇 |
2006年 | 319篇 |
2005年 | 317篇 |
2004年 | 280篇 |
2003年 | 231篇 |
2002年 | 227篇 |
2001年 | 170篇 |
2000年 | 161篇 |
1999年 | 162篇 |
1998年 | 149篇 |
1997年 | 154篇 |
1996年 | 172篇 |
1995年 | 158篇 |
1994年 | 168篇 |
1993年 | 178篇 |
1992年 | 195篇 |
1991年 | 166篇 |
1990年 | 165篇 |
1989年 | 157篇 |
1988年 | 148篇 |
1987年 | 162篇 |
1986年 | 178篇 |
1985年 | 220篇 |
1984年 | 176篇 |
1983年 | 165篇 |
1982年 | 172篇 |
1981年 | 167篇 |
1980年 | 188篇 |
1979年 | 155篇 |
1978年 | 171篇 |
1977年 | 153篇 |
1976年 | 137篇 |
1975年 | 108篇 |
1974年 | 129篇 |
1973年 | 133篇 |
1972年 | 94篇 |
1971年 | 79篇 |
1970年 | 84篇 |
排序方式: 共有10000条查询结果,搜索用时 734 毫秒
1.
Cavitation erosion is caused in solids exposed to strong pressure waves developing in an adjacent fluid field. The knowledge of the transient distribution of stresses in the solid is important to understand the cause of damaging by comparisons with breaking points of the material. The modeling of this problem requires the coupling of the models for the fluid and the solid. For this purpose, we use a strategy based on the solution of coupled Riemann problems that has been originally developed for the coupling of 2 fluids. This concept is exemplified for the coupling of a linear elastic structure with an ideal gas. The coupling procedure relies on the solution of a nonlinear equation. Existence and uniqueness of the solution is proven. The coupling conditions are validated by means of quasi‐1D problems for which an explicit solution can be determined. For a more realistic scenario, a 2D application is considered where in a compressible single fluid, a hot gas bubble at low pressure collapses in a cold gas at high pressure near an adjacent structure. 相似文献
2.
3.
4.
5.
Michel Weber 《Transactions of the American Mathematical Society》2006,358(2):911-936
We apply a majorizing measure theorem of Talagrand to obtain uniform bounds for sums of random variables satisfying increment conditions of the type considered in Gál-Koksma Theorems. We give some applications.
6.
7.
O. Kortner M.P. Locher V.E. Markushin P. Weber O. Wigger 《The European Physical Journal C - Particles and Fields》2002,25(3):353-360
We study correlations in the exclusive reaction at rest with complete reconstruction of the kinematics for each event. The inclusive distribution is fairly flat at small
invariant mass of the pion pair while a small enhancement in the double differential distribution is observed for small invariant
masses of both pion pairs. Dynamical models with resonances in the final state are shown to be consistent with the data while
the stochastic HBT mechanism is not supported by the present findings.
Received: 26 February 2002 / Revised version: 22 July 2002 / Published online: 30 August 2002 相似文献
8.
Michel Weber 《Results in Mathematics》2005,47(3-4):340-354
Under a very moderate assumption on the Fourier coefficients of a periodic function, we show the convergence almost everywhere of the sequence of averages of its associated Riemann sums. The structure of the set of averages is analyzed by proving a spectral regularization type inequality, which allows to control the corresponding Littlewood-Paley square function. 相似文献
9.
10.
Kenneth Weber Vilmar Trevisan Luiz Felipe Martins 《Journal of Algorithms in Cognition, Informatics and Logic》2005,54(2):152-167
This paper describes the first algorithm to compute the greatest common divisor (GCD) of two n-bit integers using a modular representation for intermediate values U, V and also for the result. It is based on a reduction step, similar to one used in the accelerated algorithm [T. Jebelean, A generalization of the binary GCD algorithm, in: ISSAC '93: International Symposium on Symbolic and Algebraic Computation, Kiev, Ukraine, 1993, pp. 111–116; K. Weber, The accelerated integer GCD algorithm, ACM Trans. Math. Softw. 21 (1995) 111–122] when U and V are close to the same size, that replaces U by (U−bV)/p, where p is one of the prime moduli and b is the unique integer in the interval (−p/2,p/2) such that . When the algorithm is executed on a bit common CRCW PRAM with O(nlognlogloglogn) processors, it takes O(n) time in the worst case. A heuristic model of the average case yields O(n/logn) time on the same number of processors. 相似文献