全文获取类型
收费全文 | 24474篇 |
免费 | 577篇 |
国内免费 | 141篇 |
专业分类
化学 | 16718篇 |
晶体学 | 123篇 |
力学 | 575篇 |
数学 | 4334篇 |
物理学 | 3442篇 |
出版年
2022年 | 177篇 |
2021年 | 261篇 |
2020年 | 302篇 |
2019年 | 317篇 |
2018年 | 233篇 |
2017年 | 195篇 |
2016年 | 481篇 |
2015年 | 453篇 |
2014年 | 490篇 |
2013年 | 1300篇 |
2012年 | 1137篇 |
2011年 | 1429篇 |
2010年 | 726篇 |
2009年 | 707篇 |
2008年 | 1256篇 |
2007年 | 1279篇 |
2006年 | 1251篇 |
2005年 | 1210篇 |
2004年 | 1053篇 |
2003年 | 912篇 |
2002年 | 818篇 |
2001年 | 347篇 |
2000年 | 278篇 |
1999年 | 248篇 |
1998年 | 276篇 |
1997年 | 307篇 |
1996年 | 358篇 |
1995年 | 239篇 |
1994年 | 279篇 |
1993年 | 262篇 |
1992年 | 237篇 |
1991年 | 240篇 |
1990年 | 191篇 |
1989年 | 231篇 |
1988年 | 239篇 |
1987年 | 202篇 |
1986年 | 195篇 |
1985年 | 291篇 |
1984年 | 338篇 |
1983年 | 218篇 |
1982年 | 366篇 |
1981年 | 336篇 |
1980年 | 316篇 |
1979年 | 319篇 |
1978年 | 324篇 |
1977年 | 292篇 |
1976年 | 280篇 |
1975年 | 250篇 |
1974年 | 248篇 |
1973年 | 234篇 |
排序方式: 共有10000条查询结果,搜索用时 15 毫秒
41.
Numerical methods for ordinary initial value problems that do not depend on special properties of the system are usually found in the class of linear multistage multivalue methods, first formulated by J.C. Butcher. Among these the explicit methods are easiest to implement. For these reasons there has been considerable research activity devoted to generating methods of this class which utilize independent function evaluations that can be performed in parallel. Each such group of concurrent function evaluations can be regarded as a stage of the method. However, it turns out that parallelism affords only limited opportunity for reducing the computing time with such methods. This is most evident for the simple linear homogeneous constant-coefficient test problem, whose solution is essentially a matter of approximating the exponential by an algebraic function. For a given number of stages and a given number of saved values, parallelism offers a somewhat enlarged set of algebraic functions from which to choose. However, there is absolutely no benefit in having the degree of parallelism (number of processors) exceed the number of saved values of the method. Thus, in particular, parallel one-step methods offer no speedup over serial one-step methods for the standard linear test problem. Although the implication of this result for general nonlinear problems is unclear, there are indications that dramatic speedups are not possible in general. Also given are some results relevant to the construction of methods.Work supported in part by National Science Foundation grants DMS 89 11410 and DMS 90 15533 and by US Department of Energy grant DOE DEFG02-87ER25026. Work of the second author was completed while at the University of Illinois. 相似文献
42.
In this paper a statistical multiplexer that processes a mixture of real-time and non-real-time traffic is studied under bursts of traffic. Different scheduling algorithms are compared under conditions when one of the classes of traffic has a sudden increase in its arrival rate during a short period of time. The results show a difference in the way the scheduling disciplines studied behave under short overloads of traffic even though the scheduling algorithms had been set up to give similar performance under steady-state arrivals. The lifetime of real-time packets is shown to have a great effect on the way in which the performance of the scheduling algorithms compare.Robert Lackman is an IBM employee in the IBM Resident Study Program. 相似文献
43.
Robert J. Daverman 《Topology and its Applications》2007,155(2):105-111
This paper sets forth three mismatch properties, strictly ordered in strength, about sewings of crumpled n-cubes. The strongest is a sufficient but not a necessary condition for a sewing to yield Sn, and the weakest, a necessary but not sufficient one. We show that when both crumpled cubes satisfies the Disjoint Disks Property, then the weakest property implies the sewing yields Sn, and we also show that the intermediate property leads to the same conclusion when just one of the crumpled cubes possesses the Disjoint Disks Property. In addition, we develop examples that confirm sharpness of the relevant Disjoint Disks conditions. 相似文献
44.
We evaluate the practical relevance of two measures of conic convex problem complexity as applied to second-order cone problems solved using the homogeneous self-dual (HSD) embedding model in the software SeDuMi. The first measure we evaluate is Renegar's data-based condition measure C(d), and the second measure is a combined measure of the optimal solution size and the initial infeasibility/optimality residuals denoted by S (where the solution size is measured in a norm that is naturally associated with the HSD model). We constructed a set of 144 second-order cone test problems with widely distributed values of C(d) and S and solved these problems using SeDuMi. For each problem instance in the test set, we also computed estimates of C(d) (using Peña’s method) and computed S directly. Our computational experience indicates that SeDuMi iteration counts and log (C(d)) are fairly highly correlated (sample correlation R = 0.675), whereas SeDuMi iteration counts are not quite as highly correlated with S (R = 0.600). Furthermore, the experimental evidence indicates that the average rate of convergence of SeDuMi iterations is affected by the condition number C(d) of the problem instance, a phenomenon that makes some intuitive sense yet is not directly implied by existing theory. 相似文献
45.
Robert McKelvey 《Natural Resource Modeling》1986,1(1):171-189
Fishing vessels, harvesting geographically dispersed and heterogeneous multispecies aggregates, are presumed to target on the most profitable pools. But, this behavior may lead to depletion of biologically valuable species, and consequent early closure by the management agency of the entire fishery. In this article, a simple model is analyzed in order to understand the dynamics of such targeting behavior. Further analysis explores the theoretical extent to which targeting might be altered through economic rationalization measures, landings taxes or quota markets, to achieve a more nearly optimal pattern of exploitation. 相似文献
46.
47.
Mira Bozzini Licia Lenarduzzi Robert Schaback 《Advances in Computational Mathematics》2002,16(4):375-387
We present an adaptive method to extract shape-preserving information from a univariate data sample. The behavior of the signal is obtained by interpolating at adaptively selected few data points by a linear combination of multiquadrics with variable scaling parameters. On the theoretical side, we give a sufficient condition for existence of the scaled multiquadric interpolant. On the practical side, we give various examples to show the applicability of the method. 相似文献
48.
Christopher K. Yee‐Chan Robert C. Scogna Richard A. Register 《Journal of Polymer Science.Polymer Physics》2007,45(10):1198-1204
In the idealized two‐phase model of a semicrystalline polymer, the amorphous intercrystalline layers are considered to have the same properties as the fully‐amorphous polymer. In reality, these thin intercrystalline layers can be substantially influenced by the presence of the crystals, as individual polymer molecules traverse both crystalline and amorphous phases. In polymers with rigid backbone units, such as poly(etheretherketone), PEEK, previous work has shown this coupling to be particularly severe; the glass transition temperature (Tg) can be elevated by tens of degrees celsius, with the magnitude of the elevation correlating directly with the thinness of the amorphous layer. However, this connection has not been explored for flexible‐chain polymers, such as those formed from vinyl‐type monomers. Here, we examine Tg in both isotactic polystyrene (iPS) and syndiotactic polystyrene (sPS), crystallized under conditions that produce a range of amorphous layer thicknesses. Tg is indeed shown to be elevated relative to fully‐amorphous iPS and sPS, by an amount that correlates with the thinness of the amorphous layer; the magnitude of the effect is severalfold less than that in PEEK, consistent with the minimum lengths of polymer chain required to make a fold in the different cases. © 2007 Wiley Periodicals, Inc. J Polym Sci Part B: Polym Phys 45: 1198–1204, 2007 相似文献
49.
Jean-Jacques Jutier Even Lemieux Robert E. Prud'homme 《Journal of Polymer Science.Polymer Physics》1988,26(6):1313-1329
The miscibility of polyester/nitrocellulose blends was investigated by differential scanning calorimetry and Fourier-transform infrared (FTIR) spectroscopy. Two nitrocelluloses (NC) derived from wood and having different nitrogen contents (12.62 and 13.42%) were used. On the basis of the glass transition temperature criterion, poly(?-caprolactone) (PCL), poly(valerolactone), poly(ethylene adipate), and poly(butylene adipate) are miscible with nitrocellulose, whereas poly(α-methyl α-propyl β-propiolactone) and poly(α-methyl β-proiolactone) are immiscible. The Tg versus composition curves of PCL/NC blends do not follow a monotone function but exhibit a singular point at a critical PCL volume fraction of 0.51 for NC-1342 and 0.45 for NC-1262 in agreement with Kovacs' theory. A shift of 17 cm-1 of the carbonyl stretching band was observed with PCL/NC blends and is taken as evidence for hydrogen bonding interaction between the PCL carbonyl group and NC hydroxyl group. The frequency difference between the free hydroxyl absorbance and the absorbances of the hydrogen-bonded species was found to be 85 cm-1 in pure NC and 125 cm-1 in PCL/NC blends; it indicates that the average strength of this interaction is stronger than the corresponding self-associated hydrogen bonding in pure NC. The presence of a dipole-dipole interaction between the nitrate-ester groups of NC and the carbonyl groups of the polyesters is reported. The relative strength of the hydrogen bonding and dipole-dipole interactions is discussed and correlated with polymer miscibility. 相似文献
50.
Pure adaptive search in global optimization 总被引:10,自引:0,他引:10
Pure adaptive seach iteratively constructs a sequence of interior points uniformly distributed within the corresponding sequence of nested improving regions of the feasible space. That is, at any iteration, the next point in the sequence is uniformly distributed over the region of feasible space containing all points that are strictly superior in value to the previous points in the sequence. The complexity of this algorithm is measured by the expected number of iterations required to achieve a given accuracy of solution. We show that for global mathematical programs satisfying the Lipschitz condition, its complexity increases at mostlinearly in the dimension of the problem.This work was supported in part by NATO grant 0119/89. 相似文献