全文获取类型
收费全文 | 19040篇 |
免费 | 1592篇 |
国内免费 | 1090篇 |
专业分类
化学 | 2033篇 |
晶体学 | 25篇 |
力学 | 1157篇 |
综合类 | 372篇 |
数学 | 14501篇 |
物理学 | 3634篇 |
出版年
2024年 | 26篇 |
2023年 | 117篇 |
2022年 | 244篇 |
2021年 | 334篇 |
2020年 | 302篇 |
2019年 | 367篇 |
2018年 | 362篇 |
2017年 | 505篇 |
2016年 | 583篇 |
2015年 | 418篇 |
2014年 | 895篇 |
2013年 | 1212篇 |
2012年 | 1054篇 |
2011年 | 935篇 |
2010年 | 874篇 |
2009年 | 1133篇 |
2008年 | 1226篇 |
2007年 | 1265篇 |
2006年 | 1063篇 |
2005年 | 934篇 |
2004年 | 763篇 |
2003年 | 694篇 |
2002年 | 727篇 |
2001年 | 649篇 |
2000年 | 625篇 |
1999年 | 530篇 |
1998年 | 456篇 |
1997年 | 410篇 |
1996年 | 389篇 |
1995年 | 328篇 |
1994年 | 259篇 |
1993年 | 225篇 |
1992年 | 225篇 |
1991年 | 200篇 |
1990年 | 149篇 |
1989年 | 127篇 |
1988年 | 122篇 |
1987年 | 99篇 |
1986年 | 117篇 |
1985年 | 153篇 |
1984年 | 119篇 |
1983年 | 36篇 |
1982年 | 75篇 |
1981年 | 61篇 |
1980年 | 56篇 |
1979年 | 49篇 |
1978年 | 60篇 |
1977年 | 64篇 |
1976年 | 41篇 |
1975年 | 18篇 |
排序方式: 共有10000条查询结果,搜索用时 15 毫秒
91.
René Meziat Diego Patiño Pablo Pedregal 《Computational Optimization and Applications》2007,38(1):147-171
We propose an alternative method for computing effectively the solution of non-linear, fixed-terminal-time, optimal control
problems when they are given in Lagrange, Bolza or Mayer forms. This method works well when the nonlinearities in the control
variable can be expressed as polynomials. The essential of this proposal is the transformation of a non-linear, non-convex
optimal control problem into an equivalent optimal control problem with linear and convex structure. The method is based on
global optimization of polynomials by the method of moments. With this method we can determine either the existence or lacking
of minimizers. In addition, we can calculate generalized solutions when the original problem lacks of minimizers. We also
present the numerical schemes to solve several examples arising in science and technology. 相似文献
92.
A review of the optimal stopping problem with more than a single decision maker (DM) is presented in this paper. We classify
the existing literature according to the arrival of the offers, the utility of the DMs, the length of the sequence of offers,
the nature of the game and the number of offers to be selected. We enumerate various definitions for this problem and describe
some dynamic approaches.
Fouad Ben Abdelaziz is on leave from the Institut Superieur de Gestion, University of Tunis, Tunisia e-mail: foued.benabdelaz@isg.run.tn. 相似文献
93.
In this note we show that many classes of global optimization problems can be treated most satisfactorily by classical optimization theory and conventional algorithms. We focus on the class of problems involving the minimization of the product of several convex functions on a convex set which was studied recently by Kunoet al. [3]. It is shown that these problems are typical composite concave programming problems and thus can be handled elegantly by c-programming [4]–[8] and its techniques. 相似文献
94.
N. E. Tovmasyan H. A. Babayan 《Journal of Contemporary Mathematical Analysis (Armenian Academy of Sciences)》2007,42(4):198-204
The paper establishes some solvability conditions of the Cauchy problem for linear differential equation in the class of monotone increasing functions. The results are applied for clarifying the possibility of flight along a given trajectory under existence of braking forces. 相似文献
95.
用光栅衍射法测试液体表面张力 总被引:1,自引:0,他引:1
利用π型直线状振源,在待测液面产生正弦形表面驻波,将其作为一种理想的反射式光栅,通过对激光束的衍射,形成线阵衍射光斑.借助LCCD等硬件测试系统及相应的数据采集与处理系统,实时准确地测量液体表面张力。 相似文献
96.
A combined programming and iteration algorithm for finite element analysis of three-dimensional contact problems 总被引:3,自引:0,他引:3
Comparing with two-dimensional contact problems, three-dimensional frictional contact problems are more difficult to deal
with, because of the unknown slip direction of the tangential force and enormous computing time. In order to overcome these
difficulties, a combined PQP (Parametric Quadratic Programming) and iteration method is derived in this paper. The iteration
algorithm, which alleviates the difficulty of unknown slip direction, is used along with the PQP method to cut down computing
costs. Numerical example is given to demonstrate the validity of the present algorithm.
The project supported by the Machinary and Electronics Ministry of China 相似文献
97.
Dashan Huang Yoshitaka Kai Frank J. Fabozzi Masao Fukushima 《European Journal of Operational Research》2007
This paper presents a model for optimally designing a collateralized mortgage obligation (CMO) with a planned amortization class (PAC)-companion structure using dynamic cash reserve. In this structure, the mortgage pool’s cash flow is allocated by rule to the two bond classes such that PAC bondholders receive substantial prepayment protection, that protection being provided by the companion bondholders. The structure we propose provides greater protection to the PAC bondholders than current structures during periods of rising interest rates when this class of bondholders faces greater extension risk. We do so by allowing a portion of the cash flow from the collateral to be reserved to meet the PAC’s scheduled cash flow in subsequent periods. The greater protection is provided by the companion bondholders exposure to interest loss. To tackle this problem, we transform the problem of designing the optimal PAC-companion structure into a standard stochastic linear programming problem which can be solved efficiently. Moreover, we present an extended model by considering the quality of the companion bond and by relaxing the PAC bondholder shortfall constraint. Based on numerical experiments through Monte Carlo simulation, we show the utility of the proposed model. 相似文献
98.
Let P(z) be a polynomial of degree n with complex coefficients and consider the n–th order linear differential operator P(D). We show that the equation P(D)f = 0 has the Hyers–Ulam stability, if and only if the equation P(z) = 0 has no pure imaginary solution. (© 2003 WILEY‐VCH Verlag GmbH & Co. KGaA, Weinheim) 相似文献
99.
Adam B. Levy 《Mathematical Programming》2007,110(3):615-639
Numerical methods for solving constrained optimization problems need to incorporate the constraints in a manner that satisfies
essentially competing interests; the incorporation needs to be simple enough that the solution method is tractable, yet complex
enough to ensure the validity of the ultimate solution. We introduce a framework for constraint incorporation that identifies
a minimal acceptable level of complexity and defines two basic types of constraint incorporation which (with combinations)
cover nearly all popular numerical methods for constrained optimization, including trust region methods, penalty methods,
barrier methods, penalty-multiplier methods, and sequential quadratic programming methods. The broad application of our framework
relies on addition and chain rules for constraint incorporation which we develop here. 相似文献
100.