全文获取类型
收费全文 | 10414篇 |
免费 | 1359篇 |
国内免费 | 475篇 |
专业分类
化学 | 1704篇 |
晶体学 | 25篇 |
力学 | 1269篇 |
综合类 | 388篇 |
数学 | 5808篇 |
物理学 | 3054篇 |
出版年
2024年 | 21篇 |
2023年 | 111篇 |
2022年 | 273篇 |
2021年 | 393篇 |
2020年 | 292篇 |
2019年 | 263篇 |
2018年 | 295篇 |
2017年 | 402篇 |
2016年 | 523篇 |
2015年 | 361篇 |
2014年 | 632篇 |
2013年 | 731篇 |
2012年 | 571篇 |
2011年 | 640篇 |
2010年 | 499篇 |
2009年 | 657篇 |
2008年 | 666篇 |
2007年 | 681篇 |
2006年 | 551篇 |
2005年 | 494篇 |
2004年 | 420篇 |
2003年 | 358篇 |
2002年 | 346篇 |
2001年 | 281篇 |
2000年 | 252篇 |
1999年 | 230篇 |
1998年 | 200篇 |
1997年 | 180篇 |
1996年 | 163篇 |
1995年 | 122篇 |
1994年 | 81篇 |
1993年 | 94篇 |
1992年 | 81篇 |
1991年 | 51篇 |
1990年 | 49篇 |
1989年 | 37篇 |
1988年 | 40篇 |
1987年 | 30篇 |
1986年 | 34篇 |
1985年 | 31篇 |
1984年 | 40篇 |
1983年 | 10篇 |
1982年 | 19篇 |
1981年 | 5篇 |
1980年 | 5篇 |
1979年 | 6篇 |
1978年 | 4篇 |
1977年 | 5篇 |
1959年 | 5篇 |
1957年 | 6篇 |
排序方式: 共有10000条查询结果,搜索用时 31 毫秒
131.
New concepts for the study of incompressible plane or axisymmetric flows are analysed by the stream tube method. Flows without eddies and pure vortex flows are considered in a transformed domain where the mapped streamlines are rectilinear or circular. The transformation between the physical domain and the computational domain is an unknown of the problem. In order to solve the non-linear set of relevant equations, we present a new algorithm based on a trust region technique which is effective for non-convex optimization problems. Experimental results show that the new algorithm is more robust compared to the Newton-Raphson method. 相似文献
132.
133.
Fabio Schoen 《Journal of Global Optimization》1994,4(1):17-35
In this paper a new algorithm is proposed for global optimization problems. The main idea is that of modifying a standard clustering approach by sequentially sampling the objective function while adaptively deciding an appropriate sample size. Theoretical as well as computational results are presented. 相似文献
134.
The peeling of a d-dimensional set of points is usually performed with successive calls to a convex hull algorithm; the optimal worst-case convex hull algorithm, known to have an O(n˙ Log (n)) execution time, may give an O(n˙n˙ Log (n)) to peel all the set; an O(n˙n) convex hull algorithm, m being the number of extremal points, is shown to peel every set with an O(n-n) time, and proved to be optimal; an implementation of this algorithm is given for planar sets and spatial sets, but the latter give only an approximate O(n˙n) performance. 相似文献
135.
Winograd矩阵乘法算法用于任意阶矩阵时的一种新处理方法 总被引:3,自引:0,他引:3
摘要t矩阵乘法StraSsen算法及其变形winograd算法用分而治之的方法把矩阵乘法时间复杂性由传统的D(n。)改进到0(佗kg。n.但是对于奇数阶矩阵,在划分子矩阵时,要作特殊处理才能继续使用此算法.本文提出了一种非等阶“十”字架划分方法,可以最少化填零,最大化性能,使得奇数阶矩阵乘法的时间复杂性更加接近偶数阶矩阵乘法的效果.计算实例显示该方法是有效的. 相似文献
136.
In this paper, we present a new algorithm to estimate a regression function in a fixed design regression model, by piecewise
(standard and trigonometric) polynomials computed with an automatic choice of the knots of the subdivision and of the degrees
of the polynomials on each sub-interval. First we give the theoretical background underlying the method: the theoretical performances
of our penalized least-squares estimator are based on non-asymptotic evaluations of a mean-square type risk. Then we explain
how the algorithm is built and possibly accelerated (to face the case when the number of observations is great), how the penalty
term is chosen and why it contains some constants requiring an empirical calibration. Lastly, a comparison with some well-known
or recent wavelet methods is made: this brings out that our algorithm behaves in a very competitive way in term of denoising
and of compression. 相似文献
137.
138.
We address the problem of computing homotopic shortest paths in the presence of obstacles in the plane. Problems on homotopy of paths received attention very recently [Cabello et al., in: Proc. 18th Annu. ACM Sympos. Comput. Geom., 2002, pp. 160–169; Efrat et al., in: Proc. 10th Annu. European Sympos. Algorithms, 2002, pp. 411–423]. We present two output-sensitive algorithms, for simple paths and non-simple paths. The algorithm for simple paths improves the previous algorithm [Efrat et al., in: Proc. 10th Annu. European Sympos. Algorithms, 2002, pp. 411–423]. The algorithm for non-simple paths achieves O(log2n) time per output vertex which is an improvement by a factor of O(n/log2n) of the previous algorithm [Hershberger, Snoeyink, Comput. Geom. Theory Appl. 4 (1994) 63–98], where n is the number of obstacles. The running time has an overhead O(n2+) for any positive constant . In the case k<n2+, where k is the total size of the input and output, we improve the running to O((n+k+(nk)2/3)logO(1)n). 相似文献
139.
This paper proposes a two step algorithm for solving a large scale semi-definite logit model, which is appreciated as a powerful
model in failure discriminant analysis. This problem has been successfully solved by a cutting plane (outer approximation)
algorithm. However, it requires much more computation time than the corresponding linear logit model. A two step algorithm
to be proposed in this paper is intended to reduce the amount of computation time by eliminating a certain portion of the
data based on the information obtained by solving an associated linear logit model. It will be shown that this algorithm can
generate a solution with almost the same quality as the solution obtained by solving the original large scale semi-definite
model within a fraction of computation time. 相似文献
140.
An algorithm for a time accurate incompressible Navier–Stokes solver on an unstructured grid is presented. The algorithm uses a second order, three‐point, backward difference formula for the physical time marching. For each time step, a divergence free flow field is obtained based on an artificial compressibility method. An implicit method with a local time step is used to accelerate the convergence for the pseudotime iteration. To validate the code, an unsteady laminar flow over a circular cylinder at a Reynolds number of 200 is calculated. The results are compared with available experimental and numerical data and good agreements are achieved. Using the developed unsteady code, an interaction of a Karman vortex street with an elliptical leading edge is simulated. The incident Karman vortex street is generated by a circular cylinder located upstream. A clustering to the path of the vortices is achieved easily due to flexibility of an unstructured grid. Details of the interaction mechanism are analysed by investigating evolutions of vortices. Characteristics of the interactions are compared for large‐ and small‐scale vortex streets. Different patterns of the interaction are observed for those two vortex streets and the observation is in agreement with experiment. Copyright © 2004 John Wiley & Sons, Ltd. 相似文献