全文获取类型
收费全文 | 1194篇 |
免费 | 25篇 |
国内免费 | 24篇 |
专业分类
化学 | 162篇 |
晶体学 | 1篇 |
力学 | 90篇 |
综合类 | 2篇 |
数学 | 720篇 |
物理学 | 268篇 |
出版年
2024年 | 1篇 |
2023年 | 11篇 |
2022年 | 16篇 |
2021年 | 20篇 |
2020年 | 18篇 |
2019年 | 27篇 |
2018年 | 23篇 |
2017年 | 26篇 |
2016年 | 53篇 |
2015年 | 40篇 |
2014年 | 74篇 |
2013年 | 113篇 |
2012年 | 57篇 |
2011年 | 67篇 |
2010年 | 84篇 |
2009年 | 96篇 |
2008年 | 102篇 |
2007年 | 79篇 |
2006年 | 56篇 |
2005年 | 35篇 |
2004年 | 30篇 |
2003年 | 19篇 |
2002年 | 20篇 |
2001年 | 15篇 |
2000年 | 21篇 |
1999年 | 12篇 |
1998年 | 1篇 |
1997年 | 9篇 |
1996年 | 15篇 |
1995年 | 10篇 |
1994年 | 14篇 |
1993年 | 4篇 |
1992年 | 5篇 |
1991年 | 4篇 |
1990年 | 6篇 |
1989年 | 1篇 |
1988年 | 2篇 |
1987年 | 6篇 |
1986年 | 3篇 |
1985年 | 5篇 |
1984年 | 9篇 |
1983年 | 2篇 |
1982年 | 5篇 |
1981年 | 5篇 |
1980年 | 5篇 |
1979年 | 5篇 |
1978年 | 8篇 |
1977年 | 2篇 |
1976年 | 1篇 |
1973年 | 1篇 |
排序方式: 共有1243条查询结果,搜索用时 31 毫秒
1.
2.
3.
4.
Manfred Sommer 《Constructive Approximation》2006,23(2):211-227
Hermite interpolation of 2n + k data by spline spaces of order k with n variable knots counting multiplicities is studied.
A characterization of the minimal spline spaces which admit a solution of the interpolation problem is obtained. A sufficient
condition on uniqueness of interpolating spline functions is given. 相似文献
5.
D.L. Skuratov Yu.L. Ratis I.A. Selezneva J. Pérez P. Fernández de Córdoba J.F. Urchueguía 《Applied Mathematical Modelling》2007
This paper deals with modelling the workpiece temperature field produced during the grinding process. The proposed model is given in terms of a two-dimensional boundary-value problem where the interdependence among the grinding wheel, the workpiece and the coolant is described by two variable functions in the boundary condition. An explicit integral form solution is constructed using the Laplace and Fourier transforms and the Green’s function method. 相似文献
6.
George Lagogiannis Christos Makris Athanasios Tsakalidis 《Journal of Discrete Algorithms》2006,4(1):106-141
We consider the problem of maintaining a dynamic ordered set of n integers in a universe U under the operations of insertion, deletion and predecessor queries. The computation model used is a unit-cost RAM, with a word length of w bits, and the universe size is |U|=2w. We present a data structure that uses O(|U|/log|U|+n) space, performs all the operations in O(loglog|U|) time and needs O(loglog|U|/logloglog|U|) structural changes per update operation. The data structure is a simplified version of the van Emde Boas' tree introducing, in its construction and functioning, new concepts, which help to keep the important information for searching along the path of the tree, in a more compact and organized way. 相似文献
7.
8.
Vicky Mak 《Operations Research Letters》2007,35(1):36-44
This paper, using the Unconstrained Shape Matrix Optimization Problem as a test bed, we investigate various aspects of variable aggregation and disaggregation for a class of integer programs that contains binary expansion. We present theoretical and numerical results, and propose an iterative algorithm for exact solutions. 相似文献
9.
In this paper, the possibility of using the gradients of the temperature and of the internal parameters as additional state variables in Continuum Thermodynamics is considered. The expressions of the two principles are discussed and Clausius–Duhem inequality is derived under an appropriate statement of the internal entropy production. Several formulations are proposed and compared to existing results in the literature. To cite this article: P. Ireman, Q.S. Nguyen, C. R. Mecanique 332 (2004). 相似文献
10.
A Variable Neighborhood Search for the Multi Depot Vehicle Routing Problem with Time Windows 总被引:6,自引:0,他引:6
Michael Polacek Richard F. Hartl Karl Doerner Marc Reimann 《Journal of Heuristics》2004,10(6):613-627
The aim of this paper is to propose an algorithm based on the philosophy of the Variable Neighborhood Search (VNS) to solve Multi Depot Vehicle Routing Problems with Time Windows. The paper has two main contributions. First, from a technical point of view, it presents the first application of a VNS for this problem and several design issues of VNS algorithms are discussed. Second, from a problem oriented point of view the computational results show that the approach is competitive with an existing Tabu Search algorithm with respect to both solution quality and computation times. 相似文献