全文获取类型
收费全文 | 3424篇 |
免费 | 232篇 |
国内免费 | 90篇 |
专业分类
化学 | 155篇 |
晶体学 | 1篇 |
力学 | 146篇 |
综合类 | 41篇 |
数学 | 2761篇 |
物理学 | 642篇 |
出版年
2024年 | 5篇 |
2023年 | 60篇 |
2022年 | 70篇 |
2021年 | 76篇 |
2020年 | 125篇 |
2019年 | 87篇 |
2018年 | 82篇 |
2017年 | 81篇 |
2016年 | 97篇 |
2015年 | 75篇 |
2014年 | 146篇 |
2013年 | 295篇 |
2012年 | 172篇 |
2011年 | 177篇 |
2010年 | 152篇 |
2009年 | 234篇 |
2008年 | 255篇 |
2007年 | 223篇 |
2006年 | 179篇 |
2005年 | 138篇 |
2004年 | 123篇 |
2003年 | 89篇 |
2002年 | 69篇 |
2001年 | 80篇 |
2000年 | 62篇 |
1999年 | 78篇 |
1998年 | 55篇 |
1997年 | 58篇 |
1996年 | 39篇 |
1995年 | 43篇 |
1994年 | 39篇 |
1993年 | 29篇 |
1992年 | 20篇 |
1991年 | 22篇 |
1990年 | 23篇 |
1989年 | 15篇 |
1988年 | 12篇 |
1987年 | 8篇 |
1986年 | 21篇 |
1985年 | 22篇 |
1984年 | 8篇 |
1983年 | 8篇 |
1982年 | 11篇 |
1981年 | 13篇 |
1980年 | 19篇 |
1979年 | 14篇 |
1978年 | 12篇 |
1977年 | 14篇 |
1976年 | 6篇 |
1971年 | 2篇 |
排序方式: 共有3746条查询结果,搜索用时 31 毫秒
21.
Various problems associated with optimal path planning for mobile observers such as mobile robots equipped with cameras to obtain maximum visual coverage of a surface in the three-dimensional Euclidean space are considered. The existence of solutions to these problems is discussed first. Then, optimality conditions are derived by considering local path perturbations. Numerical algorithms for solving the corresponding approximate problems are proposed. Detailed solutions to the optimal path planning problems for a few examples are given. 相似文献
22.
Monique Laurent 《Mathematical Programming》2007,109(2-3):239-261
We give a hierarchy of semidefinite upper bounds for the maximum size A(n,d) of a binary code of word length n and minimum distance at least d. At any fixed stage in the hierarchy, the bound can be computed (to an arbitrary precision) in time polynomial in n; this is based on a result of de Klerk et al. (Math Program, 2006) about the regular ∗-representation for matrix ∗-algebras.
The Delsarte bound for A(n,d) is the first bound in the hierarchy, and the new bound of Schrijver (IEEE Trans. Inform. Theory 51:2859–2866, 2005) is located
between the first and second bounds in the hierarchy. While computing the second bound involves a semidefinite program with
O(n
7) variables and thus seems out of reach for interesting values of n, Schrijver’s bound can be computed via a semidefinite program of size O(n
3), a result which uses the explicit block-diagonalization of the Terwilliger algebra. We propose two strengthenings of Schrijver’s
bound with the same computational complexity.
Supported by the Netherlands Organisation for Scientific Research grant NWO 639.032.203. 相似文献
23.
René Meziat Diego Patiño Pablo Pedregal 《Computational Optimization and Applications》2007,38(1):147-171
We propose an alternative method for computing effectively the solution of non-linear, fixed-terminal-time, optimal control
problems when they are given in Lagrange, Bolza or Mayer forms. This method works well when the nonlinearities in the control
variable can be expressed as polynomials. The essential of this proposal is the transformation of a non-linear, non-convex
optimal control problem into an equivalent optimal control problem with linear and convex structure. The method is based on
global optimization of polynomials by the method of moments. With this method we can determine either the existence or lacking
of minimizers. In addition, we can calculate generalized solutions when the original problem lacks of minimizers. We also
present the numerical schemes to solve several examples arising in science and technology. 相似文献
24.
A review of the optimal stopping problem with more than a single decision maker (DM) is presented in this paper. We classify
the existing literature according to the arrival of the offers, the utility of the DMs, the length of the sequence of offers,
the nature of the game and the number of offers to be selected. We enumerate various definitions for this problem and describe
some dynamic approaches.
Fouad Ben Abdelaziz is on leave from the Institut Superieur de Gestion, University of Tunis, Tunisia e-mail: foued.benabdelaz@isg.run.tn. 相似文献
25.
Yen-Shung TSAI 《中国科学A辑(英文版)》2007,50(7):1026-1034
By means of further investigation of solid codes,the problem“Is every fd-domain uni- formly dense”proposed by Yuqi Guo,C.M.Reis and G.Thierrin in 1988 is solved in this paper. 相似文献
26.
K. Holmåker 《Journal of Optimization Theory and Applications》1991,71(2):205-235
Some optimization problems concerning a substrate in a fluid are considered. The concentration of the substrate is affected by diffusion, convection, and elimination by enzymes, and the problem is to find the optimal distribution of enzymes. In this paper, the rate of elimination and the transmission coefficient are optimized. Mathematically, these problems are optimal control problems, and they are analyzed by means of Pontryagin's maximum principle. 相似文献
27.
Direct Shooting Method for the Numerical Solution of Higher-Index DAE Optimal Control Problems 总被引:3,自引:0,他引:3
A method for the numerical solution of state-constrained optimal control problems subject to higher-index differential-algebraic equation (DAE) systems is introduced. For a broad and important class of DAE systems (semiexplicit systems with algebraic variables of different index), a direct multiple shooting method is developed. The multiple shooting method is based on the discretization of the optimal control problem and its transformation into a finite-dimensional nonlinear programming problem (NLP). Special attention is turned to the mandatory calculation of consistent initial values at the multiple shooting nodes within the iterative solution process of (NLP). Two different methods are proposed. The projection method guarantees consistency within each iteration, whereas the relaxation method achieves consistency only at an optimal solution. An illustrative example completes this article. 相似文献
28.
Alexander J. Zaslavski 《Journal of Mathematical Analysis and Applications》2007,335(2):962-973
The Tonelli existence theorem in the calculus of variations and its subsequent modifications were established for integrands f which satisfy convexity and growth conditions. In this paper we consider a large class of optimal control problems which is identified with a complete metric space of integrands without convexity assumptions and show that for a generic integrand the corresponding optimal control problem possesses a unique solution and this solution is Lipschitzian. 相似文献
29.
B. Ivorra A. M. Ramos B. Mohammadi 《Journal of Optimization Theory and Applications》2007,135(3):549-561
This paper has two objectives. We introduce a new global optimization algorithm reformulating optimization problems in terms
of boundary-value problems. Then, we apply this algorithm to a pointwise control problem of the viscous Burgers equation,
where the control weight coefficient is progressively decreased. The results are compared with those obtained with a genetic
algorithm and an LM-BFGS algorithm in order to check the efficiency of our method and the necessity of using global optimization
techniques. 相似文献
30.
年龄相关的非线性时变种群扩散系统最优分布控制的存在性 总被引:1,自引:0,他引:1
讨论了一类非线性时变种群扩散系统的最优分布控制问题,利用LionsJL的偏微控制理论和先验估计,证明了系统最优分布控制的存在性.所得结果可为非线性种群扩散系统中的最优控制问题的实际研究提供必要的理论基础. 相似文献