全文获取类型
收费全文 | 951篇 |
免费 | 16篇 |
国内免费 | 40篇 |
专业分类
化学 | 26篇 |
力学 | 23篇 |
数学 | 903篇 |
物理学 | 55篇 |
出版年
2024年 | 1篇 |
2023年 | 12篇 |
2022年 | 18篇 |
2021年 | 21篇 |
2020年 | 18篇 |
2019年 | 17篇 |
2018年 | 23篇 |
2017年 | 10篇 |
2016年 | 9篇 |
2015年 | 13篇 |
2014年 | 35篇 |
2013年 | 86篇 |
2012年 | 42篇 |
2011年 | 42篇 |
2010年 | 34篇 |
2009年 | 69篇 |
2008年 | 90篇 |
2007年 | 57篇 |
2006年 | 36篇 |
2005年 | 41篇 |
2004年 | 36篇 |
2003年 | 21篇 |
2002年 | 27篇 |
2001年 | 18篇 |
2000年 | 23篇 |
1999年 | 22篇 |
1998年 | 22篇 |
1997年 | 19篇 |
1996年 | 18篇 |
1995年 | 20篇 |
1994年 | 14篇 |
1993年 | 6篇 |
1992年 | 6篇 |
1991年 | 4篇 |
1990年 | 5篇 |
1989年 | 2篇 |
1988年 | 2篇 |
1987年 | 4篇 |
1986年 | 9篇 |
1985年 | 6篇 |
1984年 | 6篇 |
1983年 | 2篇 |
1982年 | 9篇 |
1981年 | 4篇 |
1980年 | 8篇 |
1979年 | 8篇 |
1978年 | 8篇 |
1977年 | 2篇 |
1976年 | 1篇 |
1969年 | 1篇 |
排序方式: 共有1007条查询结果,搜索用时 0 毫秒
141.
Shen Yu-Liang 《Proceedings of the American Mathematical Society》1996,124(6):1879-1882
We will discuss the geometry of the unit sphere in the Banach space of integrable holomorphic quadratic differentials on a Riemann surface and answer some questions posed by L.R. Goldberg (Proc. Amer. Math. Soc. 118 (1993), 1179--1185).
142.
设0<ε<1/(6log10),x为模k的实原特征且k大于e1/ε.则除去至多一个可能的例外特征外,均有这改进了Hoffstein等人的结果. 相似文献
143.
Jin-soo Hwang Shin-ichi Nakagiri 《Journal of Mathematical Analysis and Applications》2008,342(1):125-134
The parameter identification problem of constant parameters in the equation of membrane with strong viscosity is studied. The problem is formulated by a minimization of quadratic cost functionals by distributive measurements. The existence of optimal parameters and necessary optimality conditions for the parameters are proved. 相似文献
144.
This paper presents a characterization of the solutions of a singly constrained quadratic program. This characterization is then used in the development of a polynomially bounded algorithm for this class of problems. 相似文献
145.
In the area of broad-band antenna array signal processing, the global minimum of a quadratic equality constrained quadratic cost minimization problem is often required. The problem posed is usually characterized by a large optimization space (around 50–90 tuples), a large number of linear equality constraints, and a few quadratic equality constraints each having very low rank quadratic constraint matrices. Two main difficulties arise in this class of problem. Firstly, the feasibility region is nonconvex and multiple local minima abound. This makes conventional numerical search techniques unattractive as they are unable to locate the global optimum consistently (unless a finite search area is specified). Secondly, the large optimization space makes the use of decision-method algorithms for the theory of the reals unattractive. This is because these algorithms involve the solution of the roots of univariate polynomials of order to the square of the optimization space. In this paper we present a new algorithm which exploits the structure of the constraints to reduce the optimization space to a more manageable size. The new algorithm relies on linear-algebra concepts, basic optimization theory, and a multivariate polynomial root-solving tool often used by decision-method algorithms.This research was supported by the Australian Research Council and the Corporative Research Centre for Broadband Telecommunications and Networking. 相似文献
146.
The molecular conformation problem is discussed, and a concave quadratic global minimization approach for solving it is described. This approach is based on a quadratic assignment formulation of a discrete approximation to the original problem. 相似文献
147.
AP
*-geometric linear complementarity problem (P
*GP) as a generalization of the monotone geometric linear complementarity problem is introduced. In particular, it contains
the monotone standard linear complementarity problem and the horizontal linear complementarity problem. Linear and quadratic
programming problems can be expressed in a “natural” way (i.e., without any change of variables) asP
*GP. It is shown that the algorithm of Mizunoet al. [6] can be extended to solve theP
*GP. The extended algorithm is globally convergent and its computational complexity depends on the quality of the starting
points. The algorithm is quadratically convergent for problems having a strictly complementary solution.
The work of F. A. Potra was supported in part by NSF Grant DMS 9305760 相似文献
148.
C. Roger Glassey 《Mathematical Programming》1978,14(1):98-107
When supply and demand curves for a single commodity are approximately linear in each ofN regions and interregional transportation costs are linear, then equilibrium trade flows can be computed by solving a quadratic program of special structure. An equilibrium trade flow exists in which the routes carrying positive flow form a forest, and this solution can be efficiently computed by a tree growing algorithm. 相似文献
149.
Given a Convex Quadratic Multicriteria Optimization Problem, we show the stability of the Domination Problem. By modifying Benson’s single parametric method, which is based on the Domination Problem, we are able to show the existence of an efficient compromise arc connecting any two efficient points. Moreover, we deduce an algorithm which realizes the modification in polynomial time.Part of the article is taken from the author’s doctoral dissertation at the University of Eichstätt-Ingolstadt 相似文献
150.
In this paper we motivate and describe an algorithm to solve the nonlinear programming problem. The method is based on an exact penalty function and possesses both global and superlinear convergence properties. We establish the global qualities here (the superlinear nature is proven in [7]). The numerical implementation techniques are briefly discussed and preliminary numerical results are given.This work is supported in part by NSERC Grant No. A8639 and the U.S. Dept. of Energy. 相似文献