全文获取类型
收费全文 | 4883篇 |
免费 | 155篇 |
国内免费 | 101篇 |
专业分类
化学 | 240篇 |
晶体学 | 3篇 |
力学 | 217篇 |
综合类 | 28篇 |
数学 | 4154篇 |
物理学 | 497篇 |
出版年
2024年 | 4篇 |
2023年 | 57篇 |
2022年 | 73篇 |
2021年 | 74篇 |
2020年 | 99篇 |
2019年 | 78篇 |
2018年 | 69篇 |
2017年 | 62篇 |
2016年 | 93篇 |
2015年 | 87篇 |
2014年 | 161篇 |
2013年 | 316篇 |
2012年 | 219篇 |
2011年 | 221篇 |
2010年 | 225篇 |
2009年 | 328篇 |
2008年 | 366篇 |
2007年 | 363篇 |
2006年 | 262篇 |
2005年 | 206篇 |
2004年 | 172篇 |
2003年 | 161篇 |
2002年 | 139篇 |
2001年 | 116篇 |
2000年 | 112篇 |
1999年 | 111篇 |
1998年 | 114篇 |
1997年 | 98篇 |
1996年 | 87篇 |
1995年 | 71篇 |
1994年 | 69篇 |
1993年 | 63篇 |
1992年 | 46篇 |
1991年 | 43篇 |
1990年 | 37篇 |
1989年 | 28篇 |
1988年 | 32篇 |
1987年 | 20篇 |
1986年 | 34篇 |
1985年 | 38篇 |
1984年 | 29篇 |
1983年 | 11篇 |
1982年 | 23篇 |
1981年 | 20篇 |
1980年 | 28篇 |
1979年 | 19篇 |
1978年 | 18篇 |
1977年 | 21篇 |
1976年 | 11篇 |
1974年 | 2篇 |
排序方式: 共有5139条查询结果,搜索用时 15 毫秒
51.
In this article a simple form of expressing and studying the order conditions to be satisfied by starting algorithms for Runge–Kutta methods, which use information from the two previous steps is presented. In particular, starting algorithms of highest order for Runge–Kutta–Gauss methods up to seven stages are derived. Some numerical experiments with Hamiltonian systems to compare the behaviour of the new starting algorithms with other existing ones are presented. 相似文献
52.
This study investigates the robust output tracking problem for a class of uncertain linear systems. The uncertainties are assumed to be time invariant and to satisfy the matching conditions. According to the selected nominal parameters, an optimal solution with a prescribed degree of stability is determined. Then, an auxiliary input via the use of an adapting factor, connected to the nominal optimal control, is introduced to guarantee the robustness and prescribed degree of stability for the output tracking control of the uncertain linear systems. This method is very simple and effective and can reject bounded uncertainties imposed on the states. A maglev vehicle model example is given to show its effectiveness. 相似文献
53.
We develop two implementable algorithms, the first for the solution of finite and the second for the solution of semi-infinite min-max-min problems. A smoothing technique (together with discretization for the semi-infinite case) is used to construct a sequence of approximating finite min-max problems, which are solved with increasing precision. The smoothing and discretization approximations are initially coarse, but are made progressively finer as the number of iterations is increased. This reduces the potential ill-conditioning due to high smoothing precision parameter values and computational cost due to high levels of discretization. The behavior of the algorithms is illustrated with three semi-infinite numerical examples. 相似文献
54.
Lou 《Applied Mathematics and Optimization》2003,47(2):121-142
Abstract. Optimal control problems governed by semilinear parabolic partial differential equations are considered. No Cesari-type conditions
are assumed. By proving the existence theorem and the Pontryagin maximum principle of optimal ``state-control" pairs for the
corresponding relaxed problems, an existence theorem of optimal pairs for the original problem is established. 相似文献
55.
We consider the problem of minimizing an SC1 function subject to inequality constraints. We propose a local algorithm whose distinguishing features are that: (a) a fast convergence rate is achieved under reasonable assumptions that do not include strict complementarity at the solution; (b) the solution of only linear systems is required at each iteration; (c) all the points generated are feasible. After analyzing a basic Newton algorithm, we propose some variants aimed at reducing the computational costs and, in particular, we consider a quasi-Newton version of the algorithm. 相似文献
56.
Parallel Newton two-stage iterative methods to solve nonlinear systems are studied. These algorithms are based on both the multisplitting technique and the two-stage iterative methods. Convergence properties of these methods are studied when the Jacobian matrix is either monotone or an H-matrix. Furthermore, in order to illustrate the performance of the algorithms studied, computational results about these methods on a distributed memory multiprocessor are discussed.This revised version was published online in October 2005 with corrections to the Cover Date. 相似文献
57.
Jongho?Bae Jongwoo?Kim Eui Yong?LeeEmail author 《Mathematical Methods of Operations Research》2003,58(3):477-482
We consider a two-stage service policy for a Poisson arrival queueing system. The idle server starts to work with ordinary service rate when a customer arrives. If the number of customers in the system reaches N, the service rate gets faster and continues until the system becomes empty. Otherwise, the server finishes the busy period with ordinary service rate. After assigning various operating costs to the system, we show that there exists a unique fast service rate minimizing the long-run average cost per unit time.This work was supported by Korea Research Foundation Grant(KRF-2002-070-C00021). 相似文献
58.
59.
On spanning tree problems with multiple objectives 总被引:4,自引:0,他引:4
We investigate two versions of multiple objective minimum spanning tree problems defined on a network with vectorial weights. First, we want to minimize the maximum ofQ linear objective functions taken over the set of all spanning trees (max-linear spanning tree problem, ML-ST). Secondly, we look for efficient spanning trees (multi-criteria spanning tree problem, MC-ST).Problem ML-ST is shown to be NP-complete. An exact algorithm which is based on ranking is presented. The procedure can also be used as an approximation scheme. For solving the bicriterion MC-ST, which in the worst case may have an exponential number of efficient trees, a two-phase procedure is presented. Based on the computation of extremal efficient spanning trees we use neighbourhood search to determine a sequence of solutions with the property that the distance between two consecutive solutions is less than a given accuracy.Partially supported by Deutsche Forschungsgemeinschaft and HCº Contract no. ERBCHRXCT 930087.Partially supported by Alexander von Humboldt-Stiftung. 相似文献
60.
We consider the minimization of a quadratic formzVz+2zq subject to the two-norm constraint z=. The problem received considerable attention in the literature, notably due to its applications to a class of trust region methods in nonlinear optimization. While the previous studies were concerned with just the global minimum of the problem, we investigate the existence of all local minima. The problem is approached via the dual Lagrangian, and the necessary and sufficient conditions for the existence of all local minima are derived. We also examine the suitability of the conventional numerical techniques used to solve the problem to a class of single-instruction multiple-data computers known as processor arrays (in our case, AMT DAP 610). Simultaneously, we introduce certain hardware-oriented multisection algorithms, showing their efficiency in the case of small to medium size problems.This research was partially supported by the National Physical Laboratories of England under Contract RTP2/155/127. 相似文献