全文获取类型
收费全文 | 23082篇 |
免费 | 1766篇 |
国内免费 | 1336篇 |
专业分类
化学 | 1321篇 |
晶体学 | 42篇 |
力学 | 4111篇 |
综合类 | 228篇 |
数学 | 17396篇 |
物理学 | 3086篇 |
出版年
2024年 | 41篇 |
2023年 | 255篇 |
2022年 | 291篇 |
2021年 | 325篇 |
2020年 | 550篇 |
2019年 | 547篇 |
2018年 | 585篇 |
2017年 | 617篇 |
2016年 | 657篇 |
2015年 | 521篇 |
2014年 | 985篇 |
2013年 | 1920篇 |
2012年 | 1009篇 |
2011年 | 1246篇 |
2010年 | 1057篇 |
2009年 | 1443篇 |
2008年 | 1498篇 |
2007年 | 1521篇 |
2006年 | 1346篇 |
2005年 | 1103篇 |
2004年 | 997篇 |
2003年 | 987篇 |
2002年 | 884篇 |
2001年 | 692篇 |
2000年 | 698篇 |
1999年 | 611篇 |
1998年 | 598篇 |
1997年 | 520篇 |
1996年 | 398篇 |
1995年 | 311篇 |
1994年 | 262篇 |
1993年 | 242篇 |
1992年 | 233篇 |
1991年 | 206篇 |
1990年 | 159篇 |
1989年 | 90篇 |
1988年 | 77篇 |
1987年 | 75篇 |
1986年 | 71篇 |
1985年 | 89篇 |
1984年 | 109篇 |
1983年 | 60篇 |
1982年 | 72篇 |
1981年 | 50篇 |
1980年 | 35篇 |
1979年 | 37篇 |
1978年 | 27篇 |
1977年 | 18篇 |
1976年 | 15篇 |
1973年 | 11篇 |
排序方式: 共有10000条查询结果,搜索用时 15 毫秒
981.
V. A. Yumaguzhin 《Acta Appl Math》2002,72(1-2):155-181
It is known that a linear ordinary differential equation of order n3 can be transformed to the Laguerre–Forsyth form y
(n)=
i=3
n
a
n–i
(x)y
(n–i) by a point transformation of variables. The classification of equations of this form in a neighborhood of a regular point up to a contact transformation is given. 相似文献
982.
1 IntroductionWe consider tlie variational inequality problelll, deuoted by VIP(X, F), wliicli is to find avector x* E X such thatF(X*)"(X -- X-) 2 0, VX E X, (1)where F: R" - R" is any vector-valued f11uction and X is a uonelllpty subset of R'.This problem has important applicatiolls. in equilibriun1 modeIs arising in fields such asecououtics, transportatioll scieuce alld operations research. See [1]. There exist mauy lllethodsfor solviug tlie variational li1equality problem VIP(X. … 相似文献
983.
984.
985.
An iterative method for the minimization of convex functions f :n , called a Newton Bracketing (NB) method, is presented. The NB method proceeds by using Newton iterations to improve upper and lower bounds on the minimum value. The NB method is valid for n = 1, and in some cases for n > 1 (sufficient conditions given here). The NB method is applied to large scale Fermat–Weber location problems. 相似文献
986.
Martin V. Day J. Hall J. Menendez D. Potter I. Rothstein 《Computational Optimization and Applications》2002,22(2):261-302
We generalize the analysis of J.A. Ball, M.V. Day, and P. Kachroo (Mathematics of Control, Signals, and Systems, vol. 12, pp. 307–345, 1999) to a fluid model of a single server re-entrant queue. The approach is to solve the Hamilton-Jacobi-Isaacs equation associated with optimal robust control of the system. The method of staged characteristics is generalized from Ball et al. (1999) to construct the solution explicitly. Formulas are developed allowing explicit calculations for the Skorokhod problem involved in the system equations. Such formulas are particularly important for numerical verification of conditions on the boundary of the nonnegative orthant. The optimal control (server) strategy is shown to be of linear-index type. Dai-type stability properties are discussed. A modification of the model in which new customers are allowed only at a specified entry queue is considered in 2 dimensions. The same optimal strategy is found in that case as well. 相似文献
987.
The multiple knapsack problem denoted by MKP (B,S,rn,n) can be defined as follows. A set B of n items and a set S of rn knapsacks are given such that each item j has a profit pi and weight wj,and each knapsack i has a capacity Ci. The goal is to find a subset of items of maximum profit such that they have a feasible packing in the knapsacks. MKP (B,S,m,n) is strongly NP-Complete and no polynomial time approximation algorithm can have an approximation ratio better than 0.5. In the last ten years,semi-definite programming has been empolyed to solve some combinatorial problems successfully. This paper firstly presents a semi-definite relaxation algorithm (MKPS) for MKP (B,S,rn,n). It is proved that MKPS have a approximation ratio better than 0. 5 for a subclass of MKP (B,S,m,n) with n≤100, m≤5 and max^nj=1{wj}/min^mi=1={Ci}≤2/3. 相似文献
988.
11尬roductlonIn this paper;we study the exlstence ofnonneg时Ive solutions ofone dl-menslonal-Lapfaclan boundary value problems一(电N》’二入M;0<x<1,儿1)u’仰二0,*’川十口叫)二0,队2)where入>0md a>0 are parmetersmd f E C’[0,1],屯(。)=I冲-‘。,p>1二This problem ppears In the study ofnon-Newtonlan luids(see[1;2])andnon-Newtonlan iltratlon(see[3]).The quantity p Is a characteristic of*theteristicmadium.Media with p>2 are called dllatantn"ids and those with p<2 arecalled pseudop… 相似文献
989.
In this paper, we give a short proof for the existence of nontrivial choreography solution to the equal-mass three-body problem,
which is discovered by Chenciner and Montgomery recently. 相似文献
990.
Arie Leizarowitz 《Set-Valued Analysis》2002,10(2-3):185-207
The order reduction method for singularly perturbed optimal control systems consists of employing the system obtained while setting the small parameter to be zero. In many situations the differential-algebraic system thus obtained indeed provides an appropriate approximation to the singularly perturbed problem with a small parameter. In this paper we establish that if relaxed controls are allowed then the answer to the question whether or not this method is valid depends essentially on one simple parameter: the dimension of the fast variable, denoted n. More specifically, if n=1 then the order reduction method is indeed applicable, while if n>1 then the set of singularly perturbed optimal control systems for which it is not applicable is dense (in the L
norm). 相似文献