全文获取类型
收费全文 | 15191篇 |
免费 | 582篇 |
国内免费 | 451篇 |
专业分类
化学 | 678篇 |
晶体学 | 41篇 |
力学 | 917篇 |
综合类 | 75篇 |
数学 | 10524篇 |
物理学 | 2236篇 |
无线电 | 1753篇 |
出版年
2023年 | 111篇 |
2022年 | 140篇 |
2021年 | 180篇 |
2020年 | 218篇 |
2019年 | 230篇 |
2018年 | 239篇 |
2017年 | 301篇 |
2016年 | 301篇 |
2015年 | 307篇 |
2014年 | 764篇 |
2013年 | 918篇 |
2012年 | 775篇 |
2011年 | 872篇 |
2010年 | 775篇 |
2009年 | 955篇 |
2008年 | 1030篇 |
2007年 | 1075篇 |
2006年 | 702篇 |
2005年 | 599篇 |
2004年 | 514篇 |
2003年 | 481篇 |
2002年 | 447篇 |
2001年 | 385篇 |
2000年 | 410篇 |
1999年 | 360篇 |
1998年 | 317篇 |
1997年 | 281篇 |
1996年 | 296篇 |
1995年 | 294篇 |
1994年 | 207篇 |
1993年 | 191篇 |
1992年 | 178篇 |
1991年 | 147篇 |
1990年 | 127篇 |
1989年 | 91篇 |
1988年 | 102篇 |
1987年 | 68篇 |
1986年 | 93篇 |
1985年 | 138篇 |
1984年 | 104篇 |
1983年 | 46篇 |
1982年 | 70篇 |
1981年 | 59篇 |
1980年 | 65篇 |
1979年 | 55篇 |
1978年 | 65篇 |
1977年 | 57篇 |
1976年 | 29篇 |
1975年 | 13篇 |
1974年 | 13篇 |
排序方式: 共有10000条查询结果,搜索用时 15 毫秒
61.
The projective method for solving linear matrix inequalities 总被引:2,自引:0,他引:2
Numerous problems in control and systems theory can be formulated in terms of linear matrix inequalities (LMI). Since solving
an LMI amounts to a convex optimization problem, such formulations are known to be numerically tractable. However, the interest
in LMI-based design techniques has really surged with the introduction of efficient interior-point methods for solving LMIs
with a polynomial-time complexity. This paper describes one particular method called the Projective Method. Simple geometrical
arguments are used to clarify the strategy and convergence mechanism of the Projective algorithm. A complexity analysis is
provided, and applications to two generic LMI problems (feasibility and linear objective minimization) are discussed. 相似文献
62.
Fully and partially observed stochastic control of systems with nonlinear dynamics and terminal and running costs are considered.
Measure changes are introduced which allow both state and observation dynamics to be thought of as linear. In the case when
the terms of the cost have a special form the measure change transformation “cancels out” the nonlinearities and changes the
original nonlinear problem into a classical LQG one and standard results can be applied. We also consider unnormalized conditional
densities of the whole path as state variables and obtain dynamic programming and verification results.
R. J. Elliott wishes to acknowledge support of the Natural Sciences and Engineering Research Council of Canada, Grant A7964. 相似文献
63.
We develop a production policy that controls work-in-process (WIP) levels and satisfies demand in a multistage manufacturing system with significant uncertainty in yield, rework, and demand. The problem addressed in this paper is more general than those in the literature in three aspects: (i) multiple products are processed at multiple workstations, and the capacity of each workstation is limited and shared by multiple operations; (ii) the behavior of a production policy is investigated over an infinite-time horizon, and thus the system stability can be evaluated; (iii) the representation of yield and rework uncertainty is generalized. Generalizing both the system structure and the nature of uncertainty requires a new mathematical development in the theory of infinite-horizon stochastic dynamic programming. The theoretical contributions of this paper are the existence proofs of the optimal stationary control for a stochastic dynamic programming problem and the finite covariances of WIP and production levels under the general expression of uncertainty. We develop a simple and explicit sufficient condition that guarantees the existence of both the optimal stationary control and the system stability. We describe how a production policy can be constructed for the manufacturing system based on the propositions derived. 相似文献
64.
65.
Efficient Sequential Quadratic Programming Implementations for Equality-Constrained Discrete-Time Optimal Control 总被引:1,自引:0,他引:1
Efficient sequential quadratic programming (SQP) implementations are presented for equality-constrained, discrete-time, optimal control problems. The algorithm developed calculates the search direction for the equality-based variant of SQP and is applicable to problems with either fixed or free final time. Problem solutions are obtained by solving iteratively a series of constrained quadratic programs. The number of mathematical operations required for each iteration is proportional to the number of discrete times N. This is contrasted by conventional methods in which this number is proportional to N
3. The algorithm results in quadratic convergence of the iterates under the same conditions as those for SQP and simplifies to an existing dynamic programming approach when there are no constraints and the final time is fixed. A simple test problem and two application problems are presented. The application examples include a satellite dynamics problem and a set of brachistochrone problems involving viscous friction. 相似文献
66.
Kurt M. Anstreicher 《Mathematical Programming》1997,76(1):245-263
We consider the construction of small step path following algorithms using volumetric, and mixed volumetric-logarithmic, barriers.
We establish quadratic convergence of a volumetric centering measure using pure Newton steps, enabling us to use relatively
standard proof techniques for several subsequently needed results. Using a mixed volumetric-logarithmic barrier we obtain
an O(n
1/4
m
1/4
L) iteration algorithm for linear programs withn variables andm inequality constraints, providing an alternative derivation for results first obtained by Vaidya and Atkinson. In addition,
we show that the same iteration complexity can be attained while holding the work per iteration to O(n
2
m), as opposed to O(nm
2), operations, by avoiding use of the true Hessian of the volumetric barrier. Our analysis also provides a simplified proof
of self-concordancy of the volumetric and mixed volumetric-logarithmic barriers, originally due to Nesterov and Nemirovskii.
This paper was first presented at the 1994 Faculty Research Seminar “Optimization in Theory and Practice”, at the University
of Iowa Center for Advanced Studies. 相似文献
67.
A Modified SQP Method and Its Global Convergence 总被引:6,自引:0,他引:6
Guanglu Zhou 《Journal of Global Optimization》1997,11(2):193-205
The sequential quadratic programming method developed by Wilson, Han andPowell may fail if the quadratic programming subproblems become infeasibleor if the associated sequence of search directions is unbounded. In [1], Hanand Burke give a modification to this method wherein the QP subproblem isaltered in a way which guarantees that the associated constraint region isnonempty and for which a robust convergence theory is established. In thispaper, we give a modification to the QP subproblem and provide a modifiedSQP method. Under some conditions, we prove that the algorithm eitherterminates at a Kuhn–Tucker point within finite steps or generates aninfinite sequence whose every cluster is a Kuhn–Tucker point.Finally, we give some numerical examples. 相似文献
68.
This paper considers a problem of nonlinear programming in which the objective function is the ratio of two linear functions and the constraints define a bounded and connected feasible region. Using a coordinate transformation, this problem is transformed into a simpler one, whose geometric interpretation is of particular significance. The transformation leads to a characterization of some special vertices of the feasible region from both the theoretical and operational points of view. 相似文献
69.
This paper describes a method and the corresponding algorithms for simplification of large-scale linear programming models. It consists of the elimination of the balance constraints (i.e. constraints with zero RHS term). The idea is to apply some linear transformations to the original problem in order to nullify the balance constraints. These transformations are able to simultaneously eliminate more balance rows. The core of this contribution is the introduction of the reduction matrix and the associated theorems on the equivalent linear programs (original and reduced). The numerical experiments with this method of simplification proved this approach to be beneficial for a large class of LP problems.This research work was done while the first author was at Duisburg University, Mess-, Steuer und Regelungstechnik, Germany, under the greatly appreciated financial assistance given by the Alexander-von-Humboldt Foundation. 相似文献
70.
郭飞 《应用数学与计算数学学报》1997,11(1):19-26
Wilson,Han和Powell提出的序列二次规划方法(简称SQP方法)是求解非线性规划问题的一个著名方法,这种方法每次迭代的搜索方向是通过求解一个二次规划子问题得到的,本文受[1]启发,得到二次规划子问题的一个近似解,进而给出了一类求解线性约束非线性规划问题的可行方向法,在约束集合满足正则性的条件下,证明了该算法对五种常用线性搜索方法具有全局收敛性。 相似文献