全文获取类型
收费全文 | 8163篇 |
免费 | 217篇 |
国内免费 | 151篇 |
专业分类
化学 | 345篇 |
晶体学 | 7篇 |
力学 | 284篇 |
综合类 | 67篇 |
数学 | 7474篇 |
物理学 | 354篇 |
出版年
2023年 | 42篇 |
2022年 | 77篇 |
2021年 | 92篇 |
2020年 | 94篇 |
2019年 | 104篇 |
2018年 | 108篇 |
2017年 | 144篇 |
2016年 | 136篇 |
2015年 | 109篇 |
2014年 | 342篇 |
2013年 | 406篇 |
2012年 | 446篇 |
2011年 | 327篇 |
2010年 | 337篇 |
2009年 | 518篇 |
2008年 | 510篇 |
2007年 | 549篇 |
2006年 | 347篇 |
2005年 | 304篇 |
2004年 | 261篇 |
2003年 | 250篇 |
2002年 | 255篇 |
2001年 | 224篇 |
2000年 | 234篇 |
1999年 | 197篇 |
1998年 | 207篇 |
1997年 | 154篇 |
1996年 | 181篇 |
1995年 | 167篇 |
1994年 | 117篇 |
1993年 | 131篇 |
1992年 | 128篇 |
1991年 | 121篇 |
1990年 | 99篇 |
1989年 | 66篇 |
1988年 | 85篇 |
1987年 | 54篇 |
1986年 | 81篇 |
1985年 | 109篇 |
1984年 | 78篇 |
1983年 | 23篇 |
1982年 | 48篇 |
1981年 | 39篇 |
1980年 | 37篇 |
1979年 | 28篇 |
1978年 | 50篇 |
1977年 | 48篇 |
1976年 | 27篇 |
1975年 | 13篇 |
1974年 | 12篇 |
排序方式: 共有8531条查询结果,搜索用时 15 毫秒
31.
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 相似文献
32.
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. 相似文献
33.
34.
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 相似文献
35.
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]. 相似文献
36.
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. 相似文献
37.
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. 相似文献
38.
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. 相似文献
39.
基于模糊方法的多人合作对策的研究 总被引:2,自引:0,他引:2
多人合作对策模型中联盟的收入和总体的收入常常出现相互矛盾的情况 ,此时核是空集 .由于不存在核 ,无法用 Nash-Harsanyi谈判模型求解 .采用模糊数学方法 ,调整模型中线性约束的右端系数 ,使核在一定程度上是非空集合 ,得到模糊意义下的 Nash平衡解 .该方法一定程度上解决了各联盟收入与总体收入的矛盾 .最后通过一个算例说明该方法的可行性 . 相似文献
40.
Some properties of the bilevel programming problem 总被引:8,自引:0,他引:8
J. F. Bard 《Journal of Optimization Theory and Applications》1991,68(2):371-378
The purpose of this paper is to elaborate on the difficulties accompanying the development of efficient algorithms for solving the bilevel programming problem (BLPP). We begin with a pair of examples showing that, even under the best of circumstances, solutions may not exist. This is followed by a proof that the BLPP is NP-hard.This work was partially supported by a grant from the Advanced Research Program of the Texas Higher Education Coordinating Board. 相似文献