全文获取类型
收费全文 | 397篇 |
免费 | 28篇 |
专业分类
化学 | 297篇 |
晶体学 | 4篇 |
力学 | 11篇 |
数学 | 61篇 |
物理学 | 52篇 |
出版年
2024年 | 1篇 |
2023年 | 4篇 |
2022年 | 3篇 |
2021年 | 7篇 |
2020年 | 10篇 |
2019年 | 14篇 |
2018年 | 8篇 |
2017年 | 7篇 |
2016年 | 18篇 |
2015年 | 26篇 |
2014年 | 8篇 |
2013年 | 25篇 |
2012年 | 28篇 |
2011年 | 39篇 |
2010年 | 28篇 |
2009年 | 21篇 |
2008年 | 33篇 |
2007年 | 23篇 |
2006年 | 20篇 |
2005年 | 27篇 |
2004年 | 19篇 |
2003年 | 9篇 |
2002年 | 11篇 |
2001年 | 8篇 |
1999年 | 3篇 |
1998年 | 4篇 |
1997年 | 2篇 |
1996年 | 2篇 |
1995年 | 4篇 |
1994年 | 1篇 |
1993年 | 1篇 |
1992年 | 1篇 |
1991年 | 1篇 |
1990年 | 1篇 |
1989年 | 2篇 |
1988年 | 1篇 |
1986年 | 1篇 |
1985年 | 1篇 |
1984年 | 1篇 |
1979年 | 2篇 |
排序方式: 共有425条查询结果,搜索用时 15 毫秒
21.
Imprecision of input data is one of the main obstacles that prevent geometric algorithms from being used in practice. We model an imprecise point by a region in which the point must lie. Given a set of imprecise points, we study computing the largest and smallest possible values of various basic geometric measures on point sets, such as the diameter, width, closest pair, smallest enclosing circle, and smallest enclosing bounding box. We give efficient algorithms for most of these problems, and identify the hardness of others. 相似文献
22.
Akin to the mathematical recreations, John Wilkins' Mathematicall Magick ( 1648) elaborates the pleasant, useful and wondrous part of practical mathematics, dealing in particular with its material culture of machines and instruments. We contextualize the Mathematicall Magick by studying its institutional setting and its place within changing conceptions of art, nature, religion and mathematics. We devote special attention to the way Wilkins inscribes mechanical innovations within a discourse of wonder. Instead of treating ‘wonder’ as a monolithic category, we present a typology, showing that wonders were not only recreative, but were meant to inspire Wilkins' readers to new mathematical inventions. 相似文献
23.
Stochastic integer programs are notoriously difficult. Very few properties are known and solution algorithms are very scarce. In this paper, we introduce the class of stochastic programs with simple integer recourse, a natural extension of the simple recourse case extensively studied in stochastic continuous programs.Analytical as well as computational properties of the expected recourse function of simple integer recourse problems are studied. This includes sharp bounds on this function and the study of the convex hull. Finally, a finite termination algorithm is obtained that solves two classes of stochastic simple integer recourse problems.Supported by the National Operations Research Network in the Netherlands (LNMB). 相似文献
24.
Seismic data is modeled in the high‐frequency approximation, using the techniques of microlocal analysis. We consider general, anisotropic elastic media. Our methods are designed to allow for the formation of caustics. The data is modeled in two ways. First, we give a microlocal treatment of the Kirchhoff approximation, where the medium is assumed to be piecewise smooth, and reflection and transmission occur at interfaces. Second, we give a refined view on the Born approximation based upon a linearization of the scattering process in the medium parameters around a smooth background medium. The joint formulation of Born and Kirchhoff scattering allows us to take into account general scatterers as well as the nonlinear dependence of reflection coefficients on the medium parameters. The latter allows the treatment of scattering up to grazing angles. The outcome of the analysis is a characterization of the singular part of seismic data. We obtain a set of pseudodifferential operators that annihilate the data. In the process we construct a Fourier integral operator and a reflectivity function such that the data can be represented by this operator acting on the reflectivity function. In our construction this Fourier integral operator becomes invertible. We give the conditions for invertibility for general acquisition geometry. The result is also of interest for inverse scattering in acoustic media. © 2002 John Wiley & Sons, Inc. 相似文献
25.
26.
Rüdiger Schultz Leen Stougie Maarten H. van der Vlerk 《Mathematical Programming》1998,83(1-3):229-252
In this paper we present a framework for solving stochastic programs with complete integer recourse and discretely distributed right-hand side vector, using Gröbner basis methods from computational algebra to solve the numerous second-stage integer programs. Using structural properties of the expected integer recourse function, we prove that under mild conditions an optimal solution is contained in a finite set. Furthermore, we present a basic scheme to enumerate this set and suggest improvements to reduce the number of function evaluations needed. 相似文献
27.
28.
Maarten H. van der Vlerk 《Mathematical Methods of Operations Research》2005,62(2):225-242
We consider multiple simple recourse (MSR) models, both continuous and integer versions, which generalize the corresponding
simple recourse (SR) models by allowing for a refined penalty cost structure for individual shortages and surpluses. It will
be shown that (convex approximations of) such MSR models can be represented as explicitly specified continuous SR models,
and thus can be solved efficiently by existing algorithms.
This research has been made possible by a fellowship of the Royal Netherlands Academy of Arts and Sciences. 相似文献
29.
Niels van der Laan Ward Romeijnders Maarten H. van der Vlerk 《Computational Management Science》2018,15(3-4):325-349
We derive bounds on the expectation of a class of periodic functions using the total variations of higher-order derivatives of the underlying probability density function. These bounds are a strict improvement over those of Romeijnders et al. (Math Program 157:3–46, 2016b), and we use them to derive error bounds for convex approximations of simple integer recourse models. In fact, we obtain a hierarchy of error bounds that become tighter if the total variations of additional higher-order derivatives are taken into account. Moreover, each error bound decreases if these total variations become smaller. The improved bounds may be used to derive tighter error bounds for convex approximations of more general recourse models involving integer decision variables. 相似文献
30.
An impulsive plane wave traverses a stratified medium consisting of a large number N of homogeneous isotropic perfectly elastic layers. The directly transmitted wave is greatly reduced by the cumulative effect of scattering loss at each of the many interfaces. However, close to the arrival of the direct wave is a broad pulse, arising from multiple scattering; this pulse does not decay as rapidly as the direct wave and ultimately appears to diffuse about a moving center. The latter process, which is determined by the medium statistics, leads to time delays, effective anisotropy, and apparent attenuation.
The present work may be regarded as an extension of that described by Burridge, White and Papanicolaou (1988) and Burridge and Chang (1989) to allow for tunneling P waves for S-wave incidence beyond the critical angle.
When the reflection coefficients at the interfaces are scaled as 1/√N while N → ∞, and when time is measured in units of vertical travel time across an average layer, numerical solutions of the exact problem show that the shape of the broad transmitted pulse approaches the limiting form given as the solution of a certain integrodifferential equation in accordance with our asymptotic theory. 相似文献