全文获取类型
收费全文 | 1622篇 |
免费 | 110篇 |
国内免费 | 68篇 |
专业分类
化学 | 185篇 |
晶体学 | 1篇 |
力学 | 157篇 |
综合类 | 29篇 |
数学 | 1212篇 |
物理学 | 216篇 |
出版年
2023年 | 13篇 |
2022年 | 18篇 |
2021年 | 27篇 |
2020年 | 33篇 |
2019年 | 39篇 |
2018年 | 36篇 |
2017年 | 40篇 |
2016年 | 41篇 |
2015年 | 35篇 |
2014年 | 51篇 |
2013年 | 106篇 |
2012年 | 74篇 |
2011年 | 65篇 |
2010年 | 65篇 |
2009年 | 78篇 |
2008年 | 92篇 |
2007年 | 71篇 |
2006年 | 88篇 |
2005年 | 71篇 |
2004年 | 71篇 |
2003年 | 68篇 |
2002年 | 64篇 |
2001年 | 54篇 |
2000年 | 57篇 |
1999年 | 44篇 |
1998年 | 44篇 |
1997年 | 43篇 |
1996年 | 36篇 |
1995年 | 29篇 |
1994年 | 24篇 |
1993年 | 14篇 |
1992年 | 26篇 |
1991年 | 18篇 |
1990年 | 22篇 |
1989年 | 10篇 |
1988年 | 18篇 |
1987年 | 11篇 |
1986年 | 12篇 |
1985年 | 9篇 |
1984年 | 8篇 |
1983年 | 3篇 |
1982年 | 11篇 |
1981年 | 7篇 |
1980年 | 7篇 |
1979年 | 6篇 |
1978年 | 7篇 |
1977年 | 13篇 |
1976年 | 8篇 |
1975年 | 3篇 |
1974年 | 4篇 |
排序方式: 共有1800条查询结果,搜索用时 15 毫秒
1.
A new approach to the robust handling of non‐linear constraints for GAs (genetic algorithms) optimization is proposed. A specific feature of the approach consists of the change in the conventional search strategy by employing search paths which pass through both feasible and infeasible points (contrary to the traditional approach where only feasible points may be included in a path). The method (driven by full Navier–Stokes computations) was applied to the problem of multiobjective optimization of aerodynamic shapes subject to various geometrical and aerodynamic constraints. The results demonstrated that the method retains high robustness of conventional GAs while keeping CFD computational volume to an acceptable level, which allowed the algorithm to be used in a demanding engineering environment. Copyright © 2004 John Wiley & Sons, Ltd. 相似文献
2.
We analyse a model for equilibrium configurations of composite systems of nematic liquid crystal with polymer inclusions, in the presence of an external magnetic field. We assume that the system has a periodic structure, and consider the relaxed problem on the unit length constraint of the nematic director field. The relaxation of the Oseen–Frank energy functional is carried out by including bulk as well as surface energy penalty terms, rendering the problem fully non‐linear. We employ two‐scale convergence methods to obtain effective configurations of the system, as the size of the polymeric inclusions tends to zero. We discuss the minimizers of the effective energies for, both, the constrained as well as the unconstrained models. Copyright © 2004 John Wiley & Sons, Ltd. 相似文献
3.
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. 相似文献
4.
This paper presents an analysis of a portfolio model which can be used to assist a property-liability insurance company in determining the optimal composition of the insurance and investment portfolios. By introducing insurer's threshold risk and relaxing some non-realistic assumptions made in traditional chance constraint insurance and investment portfolio models, we propose a method for an insurer to maximize his return threshold for a given threshold risk level. This proposed model can be used to optimize the composition of underwriting and investment portfolios regarding the insurer's threshold risk level, as well as to generate the efficient frontier by adjusting insurer's threshold risk levels. A numerical example is given based on the industry's aggregated data for a sixteen year period. 相似文献
5.
F. Blanchini 《Journal of Optimization Theory and Applications》1991,71(3):465-484
The linear state feedback synthesis problem for uncertain linear systems with state and control constraints is considered. We assume that the uncertainties are present in both the state and input matrices and they are bounded. The main goal is to find a linear control law assuring that both state and input constraints are fulfilled at each time. The problem is solved by confining the state within a compact and convex positively invariant set contained in the allowable state region.It is shown that, if the controls, the state, and the uncertainties are subject to linear inequality constraints and if a candidate compact and convex polyhedral set is assigned, a feedback matrix assuring that this region is positively invariant for the closed-loop system is found as a solution of a set of linear inequalities for both continuous and discrete time design problems.These results are extended to the case in which additive disturbances are present. The relationship between positive invariance and system stability is investigated and conditions for the existence of positively invariant regions of the polyhedral type are given.The author is grateful to Drs. Vito Cerone and Roberto Tempo for their comments. 相似文献
6.
New variants of the generalized level method for minimization of convex nondifferentiable functions taking infinite values 总被引:1,自引:1,他引:0
N. A. Sokolov 《Computational Mathematics and Mathematical Physics》2007,47(12):1952-1969
New variants of the generalized level method for minimization of convex Lipschitz functions on a compact set with a nonempty interior are proposed. These variants include the well-known generalized and classical level methods. For the new variants, an estimate of the convergence rate is found, including the variants in which the auxiliary problems are solved approximately. 相似文献
7.
Empirical minimization 总被引:3,自引:0,他引:3
We investigate the behavior of the empirical minimization algorithm using various methods. We first analyze it by comparing
the empirical, random, structure and the original one on the class, either in an additive sense, via the uniform law of large
numbers, or in a multiplicative sense, using isomorphic coordinate projections. We then show that a direct analysis of the
empirical minimization algorithm yields a significantly better bound, and that the estimates we obtain are essentially sharp.
The method of proof we use is based on Talagrand's concentration inequality for empirical processes.
Research partially supported by NSF under award DMS-0434393.
Research partially supported by the Australian Research Council Discovery Porject DP0343616. 相似文献
8.
Some effective methods for unconstrained optimization based on the solution of systems of ordinary differential equations 总被引:5,自引:0,他引:5
A. A. Brown M. C. Bartholomew-Biggs 《Journal of Optimization Theory and Applications》1989,62(2):211-224
In this paper, we review briefly some methods for minimizing a functionF(x), which proceed by follwoing the solution curve of a system of ordinary differential equations. Such methods have often been thought to be unacceptably expensive; but we show, by means of extensive numerical tests, using a variety of algorithms, that the ODE approach can in fact be implemented in such a way as to be more than competitive with currently available conventional techniques.This work was supported by a SERC research studentship for the first author. Both authors are indebted to Dr. J. J. McKeown and Dr. K. D. Patel of SCICON Ltd, the collaborating establishment, for their advice and encouragement. 相似文献
9.
首先利用Lagrange对偶 ,将球约束凸二次规划问题转化为无约束优化问题 ,然后运用单纯形法求解无约束优化问题 ,从而获得原问题的最优解 相似文献
10.
The difficulty suffered in optimization-based algorithms for the solution of nonlinear equations lies in that the traditional
methods for solving the optimization problem have been mainly concerned with finding a stationary point or a local minimizer
of the underlying optimization problem, which is not necessarily a solution of the equations. One method to overcome this
difficulty is the Lagrangian globalization (LG for simplicity) method. This paper extends the LG method to nonsmooth equations
with bound constraints. The absolute system of equations is introduced. A so-called Projected Generalized-Gradient Direction (PGGD) is constructed and proved to be a descent direction of the reformulated nonsmooth optimization problem. This projected
approach keeps the feasibility of the iterates. The convergence of the new algorithm is established by specializing the PGGD.
Numerical tests are given.
This author's work was done when she was visiting The Hong Kong Polytechnic University.
His work is also supported by the Research Grant Council of Hong Kong. 相似文献