全文获取类型
收费全文 | 8749篇 |
免费 | 395篇 |
国内免费 | 221篇 |
专业分类
化学 | 450篇 |
晶体学 | 3篇 |
力学 | 253篇 |
综合类 | 225篇 |
数学 | 7708篇 |
物理学 | 726篇 |
出版年
2023年 | 48篇 |
2022年 | 101篇 |
2021年 | 115篇 |
2020年 | 108篇 |
2019年 | 139篇 |
2018年 | 128篇 |
2017年 | 157篇 |
2016年 | 154篇 |
2015年 | 130篇 |
2014年 | 364篇 |
2013年 | 395篇 |
2012年 | 446篇 |
2011年 | 354篇 |
2010年 | 368篇 |
2009年 | 546篇 |
2008年 | 541篇 |
2007年 | 598篇 |
2006年 | 413篇 |
2005年 | 376篇 |
2004年 | 292篇 |
2003年 | 289篇 |
2002年 | 299篇 |
2001年 | 249篇 |
2000年 | 263篇 |
1999年 | 214篇 |
1998年 | 181篇 |
1997年 | 169篇 |
1996年 | 205篇 |
1995年 | 213篇 |
1994年 | 140篇 |
1993年 | 152篇 |
1992年 | 143篇 |
1991年 | 125篇 |
1990年 | 105篇 |
1989年 | 78篇 |
1988年 | 90篇 |
1987年 | 61篇 |
1986年 | 84篇 |
1985年 | 114篇 |
1984年 | 78篇 |
1983年 | 26篇 |
1982年 | 48篇 |
1981年 | 39篇 |
1980年 | 35篇 |
1979年 | 28篇 |
1978年 | 48篇 |
1977年 | 46篇 |
1976年 | 26篇 |
1975年 | 12篇 |
1974年 | 12篇 |
排序方式: 共有9365条查询结果,搜索用时 0 毫秒
31.
Valentin Brimkov 《Discrete Applied Mathematics》2007,155(14):1812-1825
We consider the problem of computing the Lovász theta function for circulant graphs Cn,J of degree four with n vertices and chord length J, 2?J?n. We present an algorithm that takes O(J) operations if J is an odd number, and O(n/J) operations if J is even. On the considered class of graphs our algorithm strongly outperforms the known algorithms for theta function computation. We also provide explicit formulas for the important special cases J=2 and J=3. 相似文献
32.
Mixed integer programming (MIP) models are extensively usedto aid strategic and tactical decision making in many businesssectors. Solving MIP models is a computationally intensive processand there is a need to develop solution approaches that enablelarger models to be solved within acceptable timeframes. Inthis paper, we describe the implementation of a two-stage parallelbranch and bound (PB & B) algorithm for MIP. In stage 1of the algorithm, a multiple heuristic search is implementedin which a number of alternative search trees are investigatedusing a forest search in the hope of finding a good solutionquickly. In stage 2, the search is reorganized so that the branchesof a chosen tree are investigated in parallel. A new heuristicis introduced, based on a best projection criterion, which evaluatesalternative B & B trees in order to choose one for investigationin stage 2 of the algorithm. The heuristic also serves as away of implementing a quality load balancing scheme for stage2 of the algorithm. The results of experimental investigationsare reported for a range of models taken from the MIPLIB libraryof benchmark problems. 相似文献
33.
多目标半定规划的互补弱鞍点和G-鞍点最优性条件 总被引:1,自引:0,他引:1
对于含矩阵函数半定约束和多个目标函数的多目标半定规划问题,给出Lagrange函数在弱有效意义下的互补弱鞍点和Geofrrion恰当有效意义下的G-鞍点的定义及其等价定义.然后,在较弱的凸性条件下,利用含矩阵和向量约束的择一性定理,建立多目标半定规划的互补弱鞍点和G-鞍点充分必要条件. 相似文献
34.
Sylvia Pulmannová 《International Journal of Theoretical Physics》2003,42(5):907-919
Tensor products of quantum logics and effect algebras with some known problems are reviewed. It is noticed that although tensor products of effect algebras having at least one state exist, in the category of complex Hilbert space effect algebras similar problems as with tensor products of projection lattices occur. Nevertheless, if one of the two coupled physical systems is classical, tensor product exists and can be considered as a Boolean power. Some applications of tensor products (in the form of Boolean powers) to quantum measurements are reviewed. 相似文献
35.
本文给出多目标规划有效解适应鞍点准则的一个新的判别法 ,它不使用凸性的几何术语及凸分析中的概念。最后给出单目标规划的一个相应的判别法 相似文献
36.
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. 相似文献
37.
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. 相似文献
38.
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. 相似文献
39.
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 相似文献
40.
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. 相似文献