首页 | 本学科首页   官方微博 | 高级检索  
文章检索
  按 检索   检索词:      
出版年份:   被引次数:   他引次数: 提示:输入*表示无穷大
  收费全文   108篇
  免费   3篇
化学   44篇
力学   4篇
数学   62篇
物理学   1篇
  2020年   1篇
  2016年   2篇
  2015年   2篇
  2014年   1篇
  2013年   5篇
  2012年   4篇
  2011年   8篇
  2010年   4篇
  2009年   4篇
  2008年   6篇
  2007年   8篇
  2006年   4篇
  2005年   5篇
  2004年   2篇
  2003年   3篇
  2002年   1篇
  2001年   3篇
  2000年   4篇
  1999年   3篇
  1998年   4篇
  1997年   1篇
  1996年   1篇
  1995年   4篇
  1993年   2篇
  1990年   1篇
  1989年   4篇
  1987年   2篇
  1985年   5篇
  1984年   4篇
  1983年   4篇
  1982年   1篇
  1981年   2篇
  1980年   1篇
  1978年   1篇
  1977年   1篇
  1975年   2篇
  1972年   1篇
排序方式: 共有111条查询结果,搜索用时 31 毫秒
31.
We propose an on-line control approach which will adjust the steady-state shape of a large antenna arbitrarily close to any achievable desired profile. The method makes use of distributed-parameter system theory and allows refocusing using a limited number of control actuators and sensors.The controller gains are calculated by approximating the solution to an infinite-dimensional optimal quasi-static control problem. The controller gain calculation is computationally simpler than that proposed in a companion paper. The Galerkin (finite element) approximation method is used for model reduction. We prove that both gain and state convergence can be achieved by using the proposed approximation scheme.This work was partially supported by the Air Force Office of Scientific Research, Grant No. AFOSR 83-0124, and by the National Aeronautics and Space Administration, Grant No. NAG-1-515.  相似文献   
32.
The master problem in Benders's partitioning method is an integer program with a very large number of constraints, each of which is usually generated by solving the integer program with the constraints generated earlier. Computational experience shows that the subset B of those constraints of the master problem that are satisfied with equality at the linear programming optimum often play a crucial role in determining the integer optimum, in the sense that only a few of the remaining inequalities are needed. We characterize this subset B of inequalities. If an optimal basic solution to the linear program is nondegenerate in the continuous variables and has p integer-constrained basic variables, then the corresponding set B contains at most 2p inequalities, none of which is implied by the others. We give an efficient procedure for generating an appropriate subset of the inequalities in B, which leads to a considerably improved version of Benders's method.  相似文献   
33.
A note on duality in disjunctive programming   总被引:1,自引:0,他引:1  
We state a duality theorem for disjunctive programming, which generalizes to this class of problems the corresponding result for linear programming.This work was supported by the National Science Foundation under Grant No. MPS73-08534 A02 and by the US Office of Naval Research under Contract No. N00014-75-C-0621-NR047-048.  相似文献   
34.
35.
Using a singular perturbation formulation of the linear time-invariant distributed parameter system, we develop a method to design finite-dimensional feedback compensators of any fixed order which will stabilize the infinite-dimensional distributed parameter system. The synthesis conditions are given entirely in terms of a finite-dimensional reduced-order model; the stability results depend on an infinite-dimensional version of the Klimushchev-Krasovskii lemma presented here.  相似文献   
36.
37.
38.
39.
40.
设为首页 | 免责声明 | 关于勤云 | 加入收藏

Copyright©北京勤云科技发展有限公司  京ICP备09084417号