全文获取类型
收费全文 | 12425篇 |
免费 | 404篇 |
国内免费 | 479篇 |
专业分类
化学 | 437篇 |
晶体学 | 1篇 |
力学 | 231篇 |
综合类 | 80篇 |
数学 | 7027篇 |
物理学 | 311篇 |
综合类 | 5221篇 |
出版年
2024年 | 16篇 |
2023年 | 50篇 |
2022年 | 99篇 |
2021年 | 111篇 |
2020年 | 119篇 |
2019年 | 127篇 |
2018年 | 129篇 |
2017年 | 188篇 |
2016年 | 186篇 |
2015年 | 183篇 |
2014年 | 471篇 |
2013年 | 511篇 |
2012年 | 636篇 |
2011年 | 559篇 |
2010年 | 491篇 |
2009年 | 688篇 |
2008年 | 712篇 |
2007年 | 814篇 |
2006年 | 625篇 |
2005年 | 626篇 |
2004年 | 559篇 |
2003年 | 478篇 |
2002年 | 442篇 |
2001年 | 394篇 |
2000年 | 392篇 |
1999年 | 311篇 |
1998年 | 321篇 |
1997年 | 270篇 |
1996年 | 346篇 |
1995年 | 307篇 |
1994年 | 269篇 |
1993年 | 233篇 |
1992年 | 251篇 |
1991年 | 210篇 |
1990年 | 177篇 |
1989年 | 134篇 |
1988年 | 160篇 |
1987年 | 91篇 |
1986年 | 105篇 |
1985年 | 118篇 |
1984年 | 77篇 |
1983年 | 22篇 |
1982年 | 46篇 |
1981年 | 37篇 |
1980年 | 33篇 |
1979年 | 26篇 |
1978年 | 47篇 |
1977年 | 46篇 |
1976年 | 26篇 |
1975年 | 13篇 |
排序方式: 共有10000条查询结果,搜索用时 31 毫秒
81.
Discrete global descent method for discrete global optimization and nonlinear integer programming 总被引:2,自引:0,他引:2
A novel method, entitled the discrete global descent method, is developed in this paper to solve discrete global optimization
problems and nonlinear integer programming problems. This method moves from one discrete minimizer of the objective function
f to another better one at each iteration with the help of an auxiliary function, entitled the discrete global descent function.
The discrete global descent function guarantees that its discrete minimizers coincide with the better discrete minimizers
of f under some standard assumptions. This property also ensures that a better discrete minimizer of f can be found by some classical local search methods. Numerical experiments on several test problems with up to 100 integer
variables and up to 1.38 × 10104 feasible points have demonstrated the applicability and efficiency of the proposed method. 相似文献
82.
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. 相似文献
83.
In this paper,we consider a class of quadratic maximization problems.For a subclass of the problems,we show that the SDP relaxation approach yields an approximation solution with the ratio is dependent on the data of the problem with α being a uniform lower bound.In light of this new bound,we show that the actual worst-case performance ratio of the SDP relaxation approach (with the triangle inequalities added) is at least α δd if every weight is strictly positive,where δd > 0 is a constant depending on the problem dimension and data. 相似文献
84.
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 相似文献
85.
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. 相似文献
86.
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. 相似文献
87.
余振汉 《东华大学学报(自然科学版)》1991,(2)
本文提出混合类型数组的概念,将DBASEⅢ管理系统数据库转换成二维数组变量,解决了在DBASEⅢ中没有数组变量的缺陷。为通用管理程序的设计、不同类型数据的处理以及提高运行速度等,都带来很多方便。 相似文献
88.
In this paper, we provide bounds for the expected value of the log of the condition number C(A) of a linear feasibility problem given by a n × m matrix A (Ref. 1). We show that this expected value is O(min{n, m log n}) if n > m and is O(log n) otherwise. A similar bound applies for the log of the condition number C
R(A) introduced by Renegar (Ref. 2). 相似文献
89.
A parallel inexact Newton method with a line search is proposed for two-stage quadratic stochastic programs with recourse. A lattice rule is used for the numerical evaluation of multi-dimensional integrals, and a parallel iterative method is used to solve the quadratic programming subproblems. Although the objective only has a locally Lipschitz gradient, global convergence and local superlinear convergence of the method are established. Furthermore, the method provides an error estimate which does not require much extra computation. The performance of the method is illustrated on a CM5 parallel computer.This work was supported by the Australian Research Council and the numerical experiments were done on the Sydney Regional Centre for Parallel Computing CM5. 相似文献
90.
对数学规划模型的结构作了深入分析。从纵向揭示了数学规划模型自然、清晰的层次结构;横向又把复合模型分解成若干基本模型,而基本模型又可由决策用户十分熟悉的二维形式加以描述。在此基础上,给出了建模语言(FQL)的语法和语义。它除了具有建模能力外,消除了代数形式的索引;更重要的是具有数据库查询和模型操作能力。 相似文献