首页 | 本学科首页   官方微博 | 高级检索  
文章检索
  按 检索   检索词:      
出版年份:   被引次数:   他引次数: 提示:输入*表示无穷大
  收费全文   144篇
  免费   57篇
  国内免费   5篇
  2023年   3篇
  2022年   2篇
  2021年   2篇
  2020年   1篇
  2019年   6篇
  2018年   1篇
  2017年   7篇
  2016年   4篇
  2015年   2篇
  2014年   10篇
  2013年   11篇
  2012年   15篇
  2011年   15篇
  2010年   10篇
  2009年   7篇
  2008年   9篇
  2007年   13篇
  2006年   15篇
  2005年   11篇
  2004年   8篇
  2003年   7篇
  2002年   3篇
  2001年   10篇
  2000年   4篇
  1999年   7篇
  1998年   4篇
  1997年   1篇
  1996年   3篇
  1995年   3篇
  1994年   1篇
  1993年   5篇
  1992年   4篇
  1991年   1篇
  1990年   1篇
排序方式: 共有206条查询结果,搜索用时 156 毫秒
91.
以二次不含交叉项的多项式为例,解析推导了正态相关输入变量对输出响应量方差贡献的结构贡献部分和相关贡献部分。通过算例验证了解析结果的正确性。将所研究的指标和已有的进行对比,归纳出结构贡献部分和相关贡献部分的侧重与统一。解析解可直接用于极限状态函数不超过两次且不含交叉项的结构和相关贡献的识别,为其他新的数值算法提供了参考对照。  相似文献   
92.
构造迭代算法研究了矩阵方程[AXB,GXH] = [C,D] ,证明了该算法可经有限步得到方程的对称最小二乘解及其最佳逼近,并给出了相关性质.最后,通过数值例子表明该算法是有效的.  相似文献   
93.
We consider a discrete time‐and‐space route‐optimization problem across a finite time horizon in which multiple searchers seek to detect one or more probabilistically moving targets. This article formulates a novel convex mixed‐integer nonlinear program for this problem that generalizes earlier models to situations with multiple targets, searcher deconfliction, and target‐ and location‐dependent search effectiveness. We present two solution approaches, one based on the cutting‐plane method and the other on linearization. These approaches result in the first practical exact algorithms for solving this important problem, which arises broadly in military, rescue, law enforcement, and border patrol operations. The cutting‐plane approach solves many realistically sized problem instances in a few minutes, while existing branch‐and‐bound algorithms fail. A specialized cut improves solution time by 50[percnt] in difficult problem instances. The approach based on linearization, which is applicable in important special cases, may further reduce solution time with one or two orders of magnitude. The solution time for the cutting‐plane approach tends to remain constant as the number of searchers grows. In part, then, we overcome the difficulty that earlier solution methods have with many searchers. © 2010 Wiley Periodicals, Inc. Naval Research Logistics, 2010  相似文献   
94.
考虑地球非球形引力摄动影响的自由段弹道解析解   总被引:1,自引:0,他引:1       下载免费PDF全文
针对地球非球形引力摄动影响下的自由段弹道快速计算问题,在非正交坐标系内建立考虑J2项摄动的地球引力作用下的运动微分方程,在轨道坐标系内建立扰动引力作用下的运动微分方程,并计算天向扰动引力加速度对应的质量偏差,进而通过椭圆轨道以修正J2项摄动运动微分方程;在建立上述运动微分方程解析解的基础上,给出了地心坐标系内弹道飞行器位置和绝对速度的表达式,从而提出了J2项摄动引力和扰动引力作用下的自由段弹道解析计算方法。仿真分析表明:该方法具有较高的计算效率,落点位置偏差小于20 m,满足弹道飞行器高精度实时制导、轨迹预测等应用需求。  相似文献   
95.
We consider an expansion planning problem for Waste‐to‐Energy (WtE) systems facing uncertainty in future waste supplies. The WtE expansion plans are regarded as strategic, long term decisions, while the waste distribution and treatment are medium to short term operational decisions which can adapt to the actual waste collected. We propose a prediction set uncertainty model which integrates a set of waste generation forecasts and is constructed based on user‐specified levels of forecasting errors. Next, we use the prediction sets for WtE expansion scenario analysis. More specifically, for a given WtE expansion plan, the guaranteed net present value (NPV) is evaluated by computing an extreme value forecast trajectory of future waste generation from the prediction set that minimizes the maximum NPV of the WtE project. This problem is essentially a multiple stage min‐max dynamic optimization problem. By exploiting the structure of the WtE problem, we show this is equivalent to a simpler min‐max optimization problem, which can be further transformed into a single mixed‐integer linear program. Furthermore, we extend the model to optimize the guaranteed NPV by searching over the set of all feasible expansion scenarios, and show that this can be solved by an exact cutting plane approach. We also propose a heuristic based on a constant proportion distribution rule for the WtE expansion optimization model, which reduces the problem into a moderate size mixed‐integer program. Finally, our computational studies demonstrate that our proposed expansion model solutions are very stable and competitive in performance compared to scenario tree approaches. © 2016 Wiley Periodicals, Inc. Naval Research Logistics 63: 47–70, 2016  相似文献   
96.
双频去相关单历元动态解算整周模糊度研究   总被引:2,自引:0,他引:2       下载免费PDF全文
针对GPS实时动态精密相对定位应用背景,提出一种整周模糊度实时求解方法。采用宽巷组合载波相位双差、伪距双差观测信息建立观测模型;对浮点模糊度协方差阵进行一次Cholesky分解,构造了浮点转换矩阵,使浮点模糊度完全去相关;推导确定整周模糊度的搜索空间;利用最小残差平方和搜索准则,确定单历元整周模糊度,并用OVT检验方法,对不同历元得到的整周模糊度进行一致性检验。结果表明,观测量误差均方差取值对整周模糊度搜索空间和成功率有较大影响,附加OVT检验的双频去相关单历元动态解算整周模糊度方法正确可行。  相似文献   
97.
针对车辆运动模拟器运动参数的实时测量要求研制了一套计算机实时在线监测系统,介绍了监测系统的组成和功能,通过对车辆运动模拟器油缸位移的分析,推导了模拟器运动参数的理论解算方法,并从数据通讯、处理和管理等方面对监测软件进行分析与设计,从而实现了模拟器运动参数监测模式的多样化。  相似文献   
98.
新疆基层文化建设已经取得了很大成绩,但仍存在文化基础设施落后,基层文化单位工作条件差,公共文化服务缺乏财政保障,基层文化工作队伍不健全等问题。发展新疆基层文化建设必须完善基础设施建设,不断创新文化内容和形式,进一步落实文化经济政策,完善公共文化服务体系,加强基层文化队伍建设,争取优惠政策解决新疆农村文化发展面临的突出问题。  相似文献   
99.
利用非线性泛函分析中半序Banach空间的锥理论和不动点指数方法,讨论了一类多时滞泛函微分方程周期正解的存在性问题,并得到此类多时滞泛函微分方程周期正解存在的几个充分条件。  相似文献   
100.
This article considers the order batching problem in steelmaking and continuous‐casting production. The problem is to jointly specify the slabs needed to satisfy each customer order and group all the slabs of different customer orders into production batches. A novel mixed integer programming model is formulated for the problem. Through relaxing the order assignment constraints, a Lagrangian relaxation model is then obtained. By exploiting the relationship between Lagrangian relaxation and column generation, we develop a combined algorithm that contains nested double loops. At the inner loop, the subgradient method is applied for approximating the Lagrangian dual problem and pricing out columns of the master problem corresponding to the linear dual form of the Lagrangian dual problem. At the outer loop, column generation is employed to solve the master problem exactly and adjust Lagrangian multipliers. Computational experiments are carried out using real data collected from a large steel company, as well as on large‐scaled problem instances randomly generated. The results demonstrate that the combined algorithm can obtain tighter lower bound and higher quality solution within an acceptable computation time as compared to the conventional Lagrangian relaxation algorithm. © 2011 Wiley Periodicals, Inc. Naval Research Logistics, 2011  相似文献   
设为首页 | 免责声明 | 关于勤云 | 加入收藏

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