全文获取类型
收费全文 | 1263篇 |
免费 | 99篇 |
国内免费 | 26篇 |
专业分类
化学 | 177篇 |
晶体学 | 1篇 |
力学 | 87篇 |
综合类 | 5篇 |
数学 | 845篇 |
物理学 | 273篇 |
出版年
2024年 | 2篇 |
2023年 | 14篇 |
2022年 | 34篇 |
2021年 | 37篇 |
2020年 | 28篇 |
2019年 | 38篇 |
2018年 | 32篇 |
2017年 | 36篇 |
2016年 | 65篇 |
2015年 | 44篇 |
2014年 | 84篇 |
2013年 | 125篇 |
2012年 | 65篇 |
2011年 | 75篇 |
2010年 | 90篇 |
2009年 | 97篇 |
2008年 | 94篇 |
2007年 | 88篇 |
2006年 | 52篇 |
2005年 | 36篇 |
2004年 | 34篇 |
2003年 | 22篇 |
2002年 | 21篇 |
2001年 | 15篇 |
2000年 | 19篇 |
1999年 | 15篇 |
1998年 | 3篇 |
1997年 | 8篇 |
1996年 | 11篇 |
1995年 | 7篇 |
1994年 | 13篇 |
1993年 | 2篇 |
1992年 | 5篇 |
1991年 | 6篇 |
1990年 | 5篇 |
1989年 | 3篇 |
1988年 | 2篇 |
1987年 | 5篇 |
1986年 | 6篇 |
1985年 | 6篇 |
1984年 | 9篇 |
1983年 | 4篇 |
1982年 | 7篇 |
1981年 | 8篇 |
1980年 | 2篇 |
1979年 | 3篇 |
1978年 | 6篇 |
1977年 | 2篇 |
1976年 | 2篇 |
1973年 | 1篇 |
排序方式: 共有1388条查询结果,搜索用时 15 毫秒
1.
2.
3.
As borders between different entities, lines are an important element of natural images. Indeed, the neurons of the mammalian
visual cortex are tuned to respond best to lines of a given orientation. This preferred orientation varies continuously across
most of the cortex, but also has vortex-like singularities known as pinwheels. In attempting to describe such patterns of
orientation preference, we are led to consider underlying rotation symmetries: Oriented segments in natural images tend to
be collinear; neurons are more likely to be connected if their preferred orientations are aligned to their topographic separation.
These are indications of a reduced symmetry requiring joint rotations of both orientation preference and the underlying topography.
This is verified by direct statistical tests in both natural images and in cortical maps. Using the statistics of natural
scenes we construct filters that are best suited to extracting information from such images, and find qualitative similarities
to mammalian vision.
PACS84.35+i 89.70.+c 87.57.Nk 相似文献
4.
5.
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. 相似文献
6.
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. 相似文献
7.
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. 相似文献
8.
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). 相似文献
9.
本文对几种模糊传递关系进行比较 ,从一个侧面说明了用于构造偏好关系的模糊关系应是互逆关系 .文中证明了对任意的 n阶互逆传递模糊关系 R,必有 Rn=Rn+1 . 相似文献
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. 相似文献