全文获取类型
收费全文 | 9784篇 |
免费 | 729篇 |
国内免费 | 262篇 |
专业分类
化学 | 1318篇 |
晶体学 | 31篇 |
力学 | 1096篇 |
综合类 | 145篇 |
数学 | 6666篇 |
物理学 | 1519篇 |
出版年
2024年 | 22篇 |
2023年 | 102篇 |
2022年 | 334篇 |
2021年 | 335篇 |
2020年 | 207篇 |
2019年 | 222篇 |
2018年 | 241篇 |
2017年 | 327篇 |
2016年 | 309篇 |
2015年 | 228篇 |
2014年 | 456篇 |
2013年 | 547篇 |
2012年 | 611篇 |
2011年 | 469篇 |
2010年 | 441篇 |
2009年 | 549篇 |
2008年 | 546篇 |
2007年 | 597篇 |
2006年 | 483篇 |
2005年 | 422篇 |
2004年 | 332篇 |
2003年 | 311篇 |
2002年 | 287篇 |
2001年 | 262篇 |
2000年 | 261篇 |
1999年 | 193篇 |
1998年 | 211篇 |
1997年 | 192篇 |
1996年 | 135篇 |
1995年 | 160篇 |
1994年 | 132篇 |
1993年 | 111篇 |
1992年 | 100篇 |
1991年 | 85篇 |
1990年 | 75篇 |
1989年 | 61篇 |
1988年 | 47篇 |
1987年 | 40篇 |
1986年 | 38篇 |
1985年 | 53篇 |
1984年 | 50篇 |
1983年 | 14篇 |
1982年 | 22篇 |
1981年 | 20篇 |
1980年 | 17篇 |
1979年 | 31篇 |
1978年 | 20篇 |
1977年 | 29篇 |
1976年 | 18篇 |
1974年 | 5篇 |
排序方式: 共有10000条查询结果,搜索用时 78 毫秒
121.
基于蚁群优化方法提出新的数字图像散斑相关算法。该方法模仿了真实蚂蚁从其巢到食物找到最短路径的方式,通过对蚁群优化方法改进,减少迭代次数并改善解的质量。将新的数字图像散斑相关算法应用到计算机模拟的散斑图像和实验获得的散斑图像中,并与广泛使用的Newton-Raphson算法进行了比较。实验结果展示了新算法的精度、可行性和有效性。当数量级为0.01像素,误差离散均方根小于0.002像素。 相似文献
122.
123.
Digital image correlation (DIC) has received a widespread research and application in experimental mechanics. In DIC, the performance of subpixel registration algorithm (e.g., Newton-Raphson method, quasi-Newton method) relies heavily on the initial guess of deformation. In the case of small inter-frame deformation, the initial guess could be found by simple search scheme, the coarse-fine search for instance. While for large inter-frame deformation, it is difficult for simple search scheme to robustly estimate displacement parameters and deformation parameters simultaneously with low computational cost. In this paper, we proposed three improving strategies, i.e. Q-stage evolutionary strategy (T), parameter control strategy (C) and space expanding strategy (E), and then combined them into three population-based intelligent algorithms (PIAs), i.e. genetic algorithm (GA), differential evolution (DE) and particle swarm optimization (PSO), and finally derived eighteen different algorithms to calculate the initial guess for qN. The eighteen algorithms were compared in three sets of experiments including large rigid body translation, finite uniaxial strain and large rigid body rotation, and the results showed the effectiveness of proposed improving strategies. Among all compared algorithms, DE-TCE is the best which is robust, convenient and efficient for large inter-frame deformation measurement. 相似文献
124.
125.
126.
In the paper, the behaviour of interior point algorithms is analyzed by using a variable metric method approach. A class of
polynomial variable metric algorithms is given achieving O ((n/β)L) iterations for solving a canonical form linear optimization problem with respect to a wide class of Riemannian metrics,
wheren is the number of dimensions and β a fixed value. It is shown that the vector fields of several interior point algorithms
for linear optimization is the negative Riemannian gradient vector field of a linear a potential or a logarithmic barrier
function for suitable Riemannian metrics.
Research Partially supported by the Hungarian National Research Foundation, Grant Nos. OTKA-T016413 and OTKA-2116. 相似文献
127.
Zbigniew Michalewicz 《Journal of Heuristics》1996,1(2):177-206
Evolutionary computation techniques, which are based on a powerful principle of evolution—survival of the fittest, constitute an interesting category of heuristic search. In other words, evolutionary techniques are stochastic algorithms whose search methods model some natural phenomena: genetic inheritance and Darwinian strife for survival.Any evolutionary algorithm applied to a particular problem must address the issue of genetic representation of solutions to the problem and genetic operators that would alter the genetic composition of offspring during the reproduction process. However, additional heuristics should be incorporated in the algorithm as well; some of these heuristic rules provide guidelines for evaluating (feasible and infeasible) individuals in the population. This paper surveys such heuristics and discusses their merits and drawbacks.An abridged version of this paper appears in the volume entitled META-HEURISTICS: Theory & Application, edited by Ibrahim H. Osman and James P. Kelly, to be published by Kluwer Academic Publishers in March 1996. 相似文献
128.
P. A. V. Ferreira M. E. S. Machado 《Journal of Optimization Theory and Applications》1996,89(3):659-680
Projection and relaxation techniques are employed to decompose a multiobjective problem into a two-level structure. The basic manipulation consists in projecting the decision variables onto the space of the implicit tradeoffs, allowing the definition of a relaxed multiobjective master problem directly in the objective space. An additional subproblem tests the feasibility of the solution encountered by the relaxed problem. Some properties of the relaxed problem (linearity, small number of variables, etc.) render its solution efficient by a number of methods. Representatives of two different classes of multiobjective methods [the Geoffrion, Dyer, Feinberg (GDF) method and the fuzzy method of Baptistella and Ollero] are implemented and applied within this context to a water resources allocation problem. The results attest the computational viability of the overall procedure and its usefulness for the solution of multiobjective problems.This work was partially sponsored by grants from CNPq and FAPESP, Brazil. The authors are indebted to the anonymous reviewers for their valuable comments. 相似文献
129.
In this paper, modified versions of the classical deterministic maximum flow and minimum cost network flow problems are presented in a stochastic queueing environment. In the maximum flow network model, the throughput rate in the network is maximized such that for each arc of the network the resulting probability of finding congestion along that arc in excess of a desirable threshold does not exceed an acceptable value. In the minimum cost network flow model, the minimum cost routing of a flow of given magnitude is determined under the same type of constraints on the arcs. After proper transformations, these models are solved by Ford and Fulkerson's labeling algorithm and out-of-kilter algorithm, respectively. 相似文献
130.
S. K. Zavriev 《Journal of Optimization Theory and Applications》1996,91(1):185-214
The steepest-descent technique dealing with the perturbed values of the objective function and its gradients and with nonexact line searches is considered. Attention is given to the case where the perturbations do not decrease on the algorithm trajectories; the aim is to investigate how perturbations at every iteration of the algorithm perturb its original attractor set.Based on the Liapunov direct method for attraction analysis of discrete-time processes, a sharp estimation of the attractor set generated by a perturbed steepest-descent technique with respect to the perturbation magnitudes is obtained. Some global optimization properties of finite-difference analogues of the gradient method are discovered. These properties are not inherent in methods which use exact gradients.The author is grateful to the referees for many useful suggestions. 相似文献