全文获取类型
收费全文 | 6580篇 |
免费 | 297篇 |
国内免费 | 281篇 |
专业分类
化学 | 76篇 |
力学 | 569篇 |
综合类 | 41篇 |
数学 | 5986篇 |
物理学 | 486篇 |
出版年
2024年 | 8篇 |
2023年 | 60篇 |
2022年 | 54篇 |
2021年 | 74篇 |
2020年 | 129篇 |
2019年 | 146篇 |
2018年 | 137篇 |
2017年 | 149篇 |
2016年 | 159篇 |
2015年 | 139篇 |
2014年 | 242篇 |
2013年 | 580篇 |
2012年 | 247篇 |
2011年 | 306篇 |
2010年 | 256篇 |
2009年 | 402篇 |
2008年 | 425篇 |
2007年 | 435篇 |
2006年 | 320篇 |
2005年 | 286篇 |
2004年 | 223篇 |
2003年 | 234篇 |
2002年 | 203篇 |
2001年 | 192篇 |
2000年 | 188篇 |
1999年 | 152篇 |
1998年 | 195篇 |
1997年 | 155篇 |
1996年 | 117篇 |
1995年 | 84篇 |
1994年 | 89篇 |
1993年 | 76篇 |
1992年 | 71篇 |
1991年 | 44篇 |
1990年 | 45篇 |
1989年 | 37篇 |
1988年 | 43篇 |
1987年 | 43篇 |
1986年 | 47篇 |
1985年 | 43篇 |
1984年 | 42篇 |
1983年 | 24篇 |
1982年 | 34篇 |
1981年 | 30篇 |
1980年 | 45篇 |
1979年 | 39篇 |
1978年 | 29篇 |
1977年 | 27篇 |
1976年 | 35篇 |
1974年 | 7篇 |
排序方式: 共有7158条查询结果,搜索用时 15 毫秒
161.
W. Seidel 《Journal of Global Optimization》1991,1(3):295-303
We ask the experts in global optimization if there is an efficient solution to an optimization problem in acceptance sampling: Here, one often has incomplete prior information about the quality of incoming lots. Given a cost model, a decision rule for the inspection of a lot may then be designed that minimizes the maximum loss compatible with the available information. The resulting minimax problem is sometimes hard to solve, as the loss functions may have several local maxima which vary in an unpredictable way with the parameters of the decision rule. 相似文献
162.
On affine scaling algorithms for nonconvex quadratic programming 总被引:8,自引:0,他引:8
Yinyu Ye 《Mathematical Programming》1992,56(1-3):285-300
We investigate the use of interior algorithms, especially the affine-scaling algorithm, to solve nonconvex — indefinite or negative definite — quadratic programming (QP) problems. Although the nonconvex QP with a polytope constraint is a hard problem, we show that the problem with an ellipsoidal constraint is easy. When the hard QP is solved by successively solving the easy QP, the sequence of points monotonically converge to a feasible point satisfying both the first and the second order optimality conditions.Research supported in part by NSF Grant DDM-8922636 and the College Summer Grant, College of Business Administration, The University of Iowa. 相似文献
163.
Kazunori Yokoyama 《Mathematical Programming》1992,56(1-3):233-243
In this paper, we present-optimality criteria for convex programming problems associated with exact penalty functions. Several authors have given various criteria under the assumption that such convex problems and the associated dual problems can be solved. We assume the solvability of neither the convex problem nor the dual problem. To derive our criteria, we estimate the size of the penalty parameter in terms of an-solution for the dual problem. 相似文献
164.
Convexlike and concavelike conditions in alternative,minimax, and minimization theorems 总被引:7,自引:0,他引:7
S. Paeck 《Journal of Optimization Theory and Applications》1992,74(2):317-332
Convexlike and concavelike conditions are of interest for extensions of the Von Neumann minimax theorem. Since the beginning of the 80's, these conditions also play a certain role in deriving generalized alternative theorems of the Gordan, Motzkin, and Farkas type and Lagrange multiplier results for constrained minimization problems.In this paper, we study various known convexlike conditions for vector-valued functions on a set and investigate convexlike and concavelike conditions for real-valued functions on a product setC×D, where we are mainly interested in the relationships between these conditions. At the end of the paper, we point out several conclusions from our results for the above-mentioned mathematical fields.The author is indebted to Dr. R. Reemtsen and Dr. V. Jeyakumar for their helpful comments during the preparations of this paper. 相似文献
165.
Wentian Li 《Journal of statistical physics》1992,68(5-6):829-882
Dynamical systems with nonlocal connections have potential applications to economic and biological systems. This paper studies the dynamics of nonlocal cellular automata. In particular, all two-state, three-input nonlocal cellular automata are classified according to the dynamical behavior starting from random initial configurations and random wirings, although it is observed that sometimes a rule can have different dynamical behaviors with different wirings. The nonlocal cellular automata rule space is studied using a mean-field parametrization which is ideal for the situation of random wiring. Nonlocal cellular automata can be considered as computers carrying out computation at the level of each component. Their computational abilities are studied from the point of view of whether they contain many basic logical gates. In particular, I ask the question of whether a three-input cellular automaton rule contains the three fundamental logical gates: two-input rules AND and OR, and one-input rule NOT. A particularly interesting edge-of-chaos nonlocal cellular automaton, the rule 184, is studied in detail. It is a system of coupled selectors or multiplexers. It is also part of the Fredkin's gate—a proposed fundamental gate for conservative computations. This rule exhibits irregular fluctuations of density, large coherent structures, and long transient times. 相似文献
166.
A. Miele B. P. Mohanty P. Venkataraman Y. M. Kuo 《Journal of Optimization Theory and Applications》1982,38(1):97-109
This paper contains general transformation techniques useful to convert minimax problems of optimal control into the Mayer-Bolza problem of the calculus of variations [Problem (P)]. We consider two types of minimax problems: minimax problems of Type (Q), in which the minimax function depends on the state and does not depend on the control; and minimax problems of Type (R), in which the minimax function depends on both the state and the control. Both Problem (Q) and Problem (R) can be reduced to Problem (P).For Problem (Q), we exploit the analogy with a bounded-state problem in combination with a transformation of the Jacobson type. This requires the proper augmentation of the state vectorx(t), the control vectoru(t), and the parameter vector , as well as the proper augmentation of the constraining relations. As a result of the transformation, the unknown minimax value of the performance index becomes a component of the parameter vector being optimized.For Problem (R), we exploit the analogy with a bounded-control problem in combination with a transformation of the Valentine type. This requires the proper augmentation of the control vectoru(t) and the parameter vector , as well as the proper augmentation of the constraining relations. As a result of the transformation, the unknown minimax value of the performance index becomes a component of the parameter vector being optimized.In a subsequent paper (Part 2), the transformation techniques presented here are employed in conjunction with the sequential gradient-restoration algorithm for solving optimal control problems on a digital computer; both the single-subarc approach and the multiple-subarc approach are discussed.This research was supported by the National Science Foundation, Grant No. ENG-79-18667, and by Wright-Patterson Air Force Base, Contract No. F33615-80-C3000. This paper is a condensation of the investigations reported in Refs. 1–7. The authors are indebted to E. M. Coker and E. M. Sims for analytical and computational assistance. 相似文献
167.
An investigation was conducted of various glasses, other than soda lime or borosilicate, for use in glass capillary gas chromatography. The work has uncovered some unique chromatographic qualities in the use of potash soda lead and fused silica glasses as materials for making glass capillary columns. The fused silica proved to be an ideal material for capillary column construction, being inherently more inert than glass containing metal oxides. It has been shown that through the use of thin wall capillary tubing of high flexibility many of the mechanical problems associated with glass capillary columns, such as fragility and column straightening, can be avoided. 相似文献
168.
H. J. Greenberg W. P. Pierskalla 《Journal of Optimization Theory and Applications》1975,16(5-6):409-428
The primary concern of this paper is to investigate stability conditions for the mathematical program: findx E
n that maximizesf(x):g
j(x)0 for somej J, wheref is a real scalarvalued function and eachg is a real vector-valued function of possibly infinite dimension. It should be noted that we allow, possibly infinitely many, disjunctive forms. In an earlier work, Evans and Gould established stability theorems wheng is a continuous finite-dimensional real-vector function andJ=1. It is pointed out that the results of this paper reduce to the Evans-Gould results under their assumptions. Furthermore, since we use a slightly more general definition of lower and upper semicontinuous point-to-set mappings, we can dispense with the continuity ofg (except in a few instances where it is implied by convexity assumptions). 相似文献
169.
The paper proposes a special iterative method for a nonlinear TPBVP of the form
(t)=f(t, x(t),p(t)),
(t)=g(t, x(t),p(t)), subject toh(x(0),p(0))=0,e(x(T),p(T))=0. Certain stability properties of the above differential equations are taken into consideration in the method, so that the integration directions associated with these equations respectively are opposite to each other, in contrast with the conventional shooting methods. Via an embedding and a Riccati-type transformation, the TPBVP is reduced to consecutive initial-value problems of ordinary differential equations. A preliminary numerical test is given by a simple example originating in an optimal control problem. 相似文献
170.
Stefan Langer 《International Journal of Computational Fluid Dynamics》2013,27(3):131-150
For unstructured finite volume methods, we present a line implicit Runge–Kutta method applied as smoother in an agglomerated multigrid algorithm to significantly improve the reliability and convergence rate to approximate steady-state solutions of the Reynolds-averaged Navier–Stokes equations. To describe turbulence, we consider a one-equation Spalart–Allmaras turbulence model. The line implicit Runge–Kutta method extends a basic explicit Runge–Kutta method by a preconditioner given by an approximate derivative of the residual function. The approximate derivative is only constructed along predetermined lines which resolve anisotropies in the given grid. Therefore, the method is a canonical generalisation of point implicit methods. Numerical examples demonstrate the improvements of the line implicit Runge–Kutta when compared with explicit Runge–Kutta methods accelerated with local time stepping. 相似文献