全文获取类型
收费全文 | 23796篇 |
免费 | 1418篇 |
国内免费 | 1088篇 |
专业分类
化学 | 1347篇 |
晶体学 | 31篇 |
力学 | 1072篇 |
综合类 | 187篇 |
数学 | 6910篇 |
物理学 | 1484篇 |
综合类 | 15271篇 |
出版年
2024年 | 102篇 |
2023年 | 326篇 |
2022年 | 534篇 |
2021年 | 681篇 |
2020年 | 517篇 |
2019年 | 511篇 |
2018年 | 515篇 |
2017年 | 669篇 |
2016年 | 646篇 |
2015年 | 665篇 |
2014年 | 1187篇 |
2013年 | 1206篇 |
2012年 | 1446篇 |
2011年 | 1398篇 |
2010年 | 1236篇 |
2009年 | 1311篇 |
2008年 | 1512篇 |
2007年 | 1862篇 |
2006年 | 1522篇 |
2005年 | 1162篇 |
2004年 | 949篇 |
2003年 | 808篇 |
2002年 | 700篇 |
2001年 | 632篇 |
2000年 | 565篇 |
1999年 | 463篇 |
1998年 | 452篇 |
1997年 | 372篇 |
1996年 | 302篇 |
1995年 | 300篇 |
1994年 | 248篇 |
1993年 | 237篇 |
1992年 | 198篇 |
1991年 | 185篇 |
1990年 | 151篇 |
1989年 | 151篇 |
1988年 | 120篇 |
1987年 | 85篇 |
1986年 | 58篇 |
1985年 | 60篇 |
1984年 | 54篇 |
1983年 | 15篇 |
1982年 | 25篇 |
1981年 | 21篇 |
1980年 | 17篇 |
1979年 | 32篇 |
1978年 | 20篇 |
1977年 | 29篇 |
1976年 | 18篇 |
1955年 | 7篇 |
排序方式: 共有10000条查询结果,搜索用时 453 毫秒
61.
近年来,决定椭圆型方程系数反问题在地磁、地球物理、冶金和生物等实际问题上有着广泛的应用.本文讨论了二维的决定椭圆型方程系数反问题的数值求解方法.由误差平方和最小原则,这个反问题可化为一个变分问题,并进一步离散化为一个最优化问题,其目标函数依赖于要决定的方程系数.本文着重考察非线性共轭梯度法在此最优化问题数值计算中的表现,并与拟牛顿法作为对比.为了提高算法的效率我们适当选择加快收敛速度的预处理矩阵.同时还考察了线搜索方法的不同对优化算法的影响.数值实验的结果表明,非线性共轭梯度法在这类大规模优化问题中相对于拟牛顿法更有效. 相似文献
62.
A new approach to the robust handling of non‐linear constraints for GAs (genetic algorithms) optimization is proposed. A specific feature of the approach consists of the change in the conventional search strategy by employing search paths which pass through both feasible and infeasible points (contrary to the traditional approach where only feasible points may be included in a path). The method (driven by full Navier–Stokes computations) was applied to the problem of multiobjective optimization of aerodynamic shapes subject to various geometrical and aerodynamic constraints. The results demonstrated that the method retains high robustness of conventional GAs while keeping CFD computational volume to an acceptable level, which allowed the algorithm to be used in a demanding engineering environment. Copyright © 2004 John Wiley & Sons, Ltd. 相似文献
63.
64.
Grigor'ev S. A. Kalinnikov A. A. Porembskii V. I. Baranov I. E. Borisova E. V. Fateev V. N. 《Russian Journal of Electrochemistry》2004,40(11):1188-1192
A two-dimensional mathematical model for the transport of reactants in a fuel cell with a solid polymer electrolyte is developed. The model is used for analyzing spatial distributions of the concentration of reactants and current density over the cell. The effect of the catalytic-layer activity, reactant speed, bipolar-plate geometry, thickness and porosity of current collector and/or gas-diffusion sublayer, and the reaction mixture composition on the fuel cell efficiency is estimated theoretically and experimentally. 相似文献
65.
We introduce extensions of the Mangasarian-Fromovitz and Abadie constraint qualifications to nonsmooth optimization problems with feasibility given by means of lower-level sets. We do not assume directional differentiability, but only upper semicontinuity of the defining functions. By deriving and reviewing primal first-order optimality conditions for nonsmooth problems, we motivate the formulations of the constraint qualifications. Then, we study their interrelation, and we show how they are related to the Slater condition for nonsmooth convex problems, to nonsmooth reverse-convex problems, to the stability of parametric feasible set mappings, and to alternative theorems for the derivation of dual first-order optimality conditions.In the literature on general semi-infinite programming problems, a number of formally different extensions of the Mangasarian-Fromovitz constraint qualification have been introduced recently under different structural assumptions. We show that all these extensions are unified by the constraint qualification presented here. 相似文献
66.
By extracting combinatorial structures in well-solved nonlinear combinatorial optimization problems, Murota (1996,1998) introduced the concepts of M-convexity and L-convexity to functions defined over the integer lattice. Recently, Murota–Shioura (2000, 2001) extended these concepts to polyhedral convex functions and quadratic functions in continuous variables. In this paper, we consider a further extension to more general convex functions defined over the real space, and provide a proof for the conjugacy relationship between general M-convex and L-convex functions.Mathematics Subject Classification (1991): 90C10, 90C25, 90C27, 90C35This work is supported by Grant-in-Aid of the Ministry of Education, Culture, Sports, Science and Technology of Japan 相似文献
67.
Many real problems can be modelled as robust shortest path problems on interval digraphs, where intervals represent uncertainty about real costs and a robust path is not too far from the shortest path for each possible configuration of the arc costs.A branch and bound algorithm for this problem is presented. 相似文献
68.
Robust linear optimization under general norms 总被引:1,自引:0,他引:1
We explicitly characterize the robust counterpart of a linear programming problem with uncertainty set described by an arbitrary norm. Our approach encompasses several approaches from the literature and provides guarantees for constraint violation under probabilistic models that allow arbitrary dependencies in the distribution of the uncertain coefficients. 相似文献
69.
Asaf Levin 《Operations Research Letters》2004,32(6):530-534
Consider the following problem: given a ground set and two minimization objectives of the same type find a subset from a given subset-class that minimizes the first objective subject to a budget constraint on the second objective. Using Megiddo's parametric method we improve an earlier weakly polynomial time algorithm. 相似文献
70.
Alvim Adriana C.F. Ribeiro Celso C. Glover Fred Aloise Dario J. 《Journal of Heuristics》2004,10(2):205-229
We propose in this work a hybrid improvement procedure for the bin packing problem. This heuristic has several features: the use of lower bounding strategies; the generation of initial solutions by reference to the dual min-max problem; the use of load redistribution based on dominance, differencing, and unbalancing; and the inclusion of an improvement process utilizing tabu search. Encouraging results have been obtained for a very wide range of benchmark instances, illustrating the robustness of the algorithm. The hybrid improvement procedure compares favourably with all other heuristics in the literature. It improved the best known solutions for many of the benchmark instances and found the largest number of optimal solutions with respect to the other available approximate algorithms. 相似文献