全文获取类型
收费全文 | 8236篇 |
免费 | 322篇 |
国内免费 | 142篇 |
专业分类
化学 | 169篇 |
晶体学 | 1篇 |
力学 | 214篇 |
综合类 | 66篇 |
数学 | 6921篇 |
物理学 | 185篇 |
无线电 | 1144篇 |
出版年
2023年 | 35篇 |
2022年 | 71篇 |
2021年 | 91篇 |
2020年 | 97篇 |
2019年 | 113篇 |
2018年 | 117篇 |
2017年 | 154篇 |
2016年 | 152篇 |
2015年 | 142篇 |
2014年 | 373篇 |
2013年 | 376篇 |
2012年 | 471篇 |
2011年 | 352篇 |
2010年 | 356篇 |
2009年 | 493篇 |
2008年 | 514篇 |
2007年 | 565篇 |
2006年 | 380篇 |
2005年 | 347篇 |
2004年 | 278篇 |
2003年 | 261篇 |
2002年 | 253篇 |
2001年 | 231篇 |
2000年 | 229篇 |
1999年 | 193篇 |
1998年 | 170篇 |
1997年 | 148篇 |
1996年 | 185篇 |
1995年 | 179篇 |
1994年 | 119篇 |
1993年 | 129篇 |
1992年 | 129篇 |
1991年 | 117篇 |
1990年 | 93篇 |
1989年 | 64篇 |
1988年 | 84篇 |
1987年 | 53篇 |
1986年 | 79篇 |
1985年 | 108篇 |
1984年 | 75篇 |
1983年 | 23篇 |
1982年 | 46篇 |
1981年 | 37篇 |
1980年 | 33篇 |
1979年 | 26篇 |
1978年 | 47篇 |
1977年 | 46篇 |
1976年 | 26篇 |
1975年 | 12篇 |
1974年 | 12篇 |
排序方式: 共有8700条查询结果,搜索用时 8 毫秒
51.
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. 相似文献
52.
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. 相似文献
53.
解线性及二次型规划问题增广的神经网络 总被引:3,自引:1,他引:2
本文提出了一个解线性及二次型规划问题的神经网络模型,证明了该网络是全局稳定于平衡点,而平衡点就是线性及二次型规划问题的解,该网络的优点是能够实时获得问题的精确解,且可以同时获得带等式不式约束的对偶问题解,该网络易于电路实现。 相似文献
54.
多功能滚齿机的数字控制系统 总被引:1,自引:1,他引:0
本文叙述了以STDPC/XT(或PC/AT)机为主要核心构成的滚齿机数字控制系统的结构,软件设计和特点,系统采用混合语言编程,极大地提高了软件设计的灵活性与快速性,也分析了CNC系统的加工过程,提出了加工中的软件预处理控制方法,并给出了轴伺服控制的并行算法分析与实现。 相似文献
55.
56.
The many facets of linear programming 总被引:1,自引:0,他引:1
Michael J. Todd 《Mathematical Programming》2002,91(3):417-436
We examine the history of linear programming from computational, geometric, and complexity points of view, looking at simplex,
ellipsoid, interior-point, and other methods.
Received: June 22, 2000 / Accepted: April 4, 2001?Published online October 2, 2001 相似文献
57.
Jesús M. Velásquez Bermúdez 《Annals of Operations Research》2002,117(1-4):21-31
This document presents theoretical considerations about the solution of dynamic optimization problems integrating the Benders Theory, the Dynamic Programming approach and the concepts of Control Theory. The so called Generalized Dual Dynamic Programming Theory (GDDP) can be considered as an extension of two previous approaches known as Dual Dynamic Programming (DDP): The first is the work developed by Pereira and Pinto [3–5], which was revised by Velásquez and others [8,9]. The second is the work developed by Read and others [2,6,7]. 相似文献
58.
F. Blanchini 《Journal of Optimization Theory and Applications》1991,71(3):465-484
The linear state feedback synthesis problem for uncertain linear systems with state and control constraints is considered. We assume that the uncertainties are present in both the state and input matrices and they are bounded. The main goal is to find a linear control law assuring that both state and input constraints are fulfilled at each time. The problem is solved by confining the state within a compact and convex positively invariant set contained in the allowable state region.It is shown that, if the controls, the state, and the uncertainties are subject to linear inequality constraints and if a candidate compact and convex polyhedral set is assigned, a feedback matrix assuring that this region is positively invariant for the closed-loop system is found as a solution of a set of linear inequalities for both continuous and discrete time design problems.These results are extended to the case in which additive disturbances are present. The relationship between positive invariance and system stability is investigated and conditions for the existence of positively invariant regions of the polyhedral type are given.The author is grateful to Drs. Vito Cerone and Roberto Tempo for their comments. 相似文献
59.
C. D. Bisbos 《Optimization Letters》2007,1(1):101-109
Limit and shakedown analysis problems of Computational Mechanics lead to convex optimization problems, characterized by linear objective functions, linear equality constraints and constraints expressing the restrictions imposed by the material strength. It is shown that two important strength criteria, the Mohr–Coulomb and the Tresca criterion, can be represented as systems of semidefinite constraints, leading this way to semidefinite programming problems. 相似文献
60.
In this paper, we propose and analyze an SQP-type method for solving linearly constrained convex minimization problems where the objective functions are too complex to be evaluated exactly. Some basic results for global convergence and local superlinear convergence are obtained according to the properties of the approximation sequence. We illustrate the applicability of our approach by proposing a new method for solving two-stage stochastic programs with fixed recourse. 相似文献