全文获取类型
收费全文 | 18095篇 |
免费 | 2087篇 |
国内免费 | 915篇 |
专业分类
化学 | 2734篇 |
晶体学 | 52篇 |
力学 | 2202篇 |
综合类 | 263篇 |
数学 | 11401篇 |
物理学 | 4445篇 |
出版年
2024年 | 20篇 |
2023年 | 229篇 |
2022年 | 378篇 |
2021年 | 415篇 |
2020年 | 384篇 |
2019年 | 405篇 |
2018年 | 385篇 |
2017年 | 608篇 |
2016年 | 693篇 |
2015年 | 612篇 |
2014年 | 830篇 |
2013年 | 1390篇 |
2012年 | 922篇 |
2011年 | 944篇 |
2010年 | 866篇 |
2009年 | 1088篇 |
2008年 | 1165篇 |
2007年 | 1150篇 |
2006年 | 906篇 |
2005年 | 738篇 |
2004年 | 723篇 |
2003年 | 712篇 |
2002年 | 654篇 |
2001年 | 472篇 |
2000年 | 493篇 |
1999年 | 451篇 |
1998年 | 420篇 |
1997年 | 329篇 |
1996年 | 330篇 |
1995年 | 291篇 |
1994年 | 260篇 |
1993年 | 196篇 |
1992年 | 172篇 |
1991年 | 151篇 |
1990年 | 142篇 |
1989年 | 103篇 |
1988年 | 104篇 |
1987年 | 84篇 |
1986年 | 93篇 |
1985年 | 117篇 |
1984年 | 88篇 |
1983年 | 50篇 |
1982年 | 93篇 |
1981年 | 59篇 |
1980年 | 77篇 |
1979年 | 82篇 |
1978年 | 51篇 |
1977年 | 59篇 |
1976年 | 56篇 |
1974年 | 15篇 |
排序方式: 共有10000条查询结果,搜索用时 15 毫秒
81.
82.
基于改进遗传算法的布局优化子问题 总被引:2,自引:0,他引:2
本针对子问题,构造了布局子问题(关于同构布局等价类)的改进遗传算法。将该算法应用于二维布局优化子问题,数值实验表明该算法能够在很好地保持图元的邻接关系的前提下找到子问题的最优解。由于布局优化问题可分解为有限个子问题,所以利用该算法可以找到整个布局优化问题的全局最优解。 相似文献
83.
84.
本文首先提出逆(反)对策这一新问题,给出了数学模型;探讨了“奇门遁甲”预测理论(术)中的数学问题;通过系统分析“专门遁甲”预测过程,可知它的预测过程隐含着一个特殊的逆(反)对策问题;最后指出逆(反)对策问题的广泛存在并给出案例分析. 相似文献
85.
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. 相似文献
86.
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. 相似文献
87.
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. 相似文献
88.
Lai Chunhui 《东北数学》1997,(1)
SomePropertiesofQuasi┐keep┐rangeOperatorsandTheirApplicationsLaiChunhui(赖春晖)(DepartmentofMathematics,ZhangzhouTeachersColege,... 相似文献
89.
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. 相似文献
90.
In this paper, we investigate a constrained optimization problem with a quadratic cost functional and two quadratic equality constraints. It is assumed that the cost functional is positive definite and that the constraints are both feasible and regular (but otherwise they are unrestricted quadratic functions). Thus, the existence of a global constrained minimum is assured. We develop a necessary and sufficient condition that completely characterizes the global minimum cost. Such a condition is of essential importance in iterative numerical methods for solving the constrained minimization problem, because it readily distinguishes between local minima and global minima and thus provides a stopping criterion for the computation. The result is similar to one obtained previously by the authors. In the previous result, we gave a characterization of the global minimum of a constrained quadratic minimization problem in which the cost functional was an arbitrary quadratic functional (as opposed to positive-definite here) and the constraints were at least positive-semidefinite quadratic functions (as opposed to essentially unrestricted here). 相似文献