首页 | 本学科首页   官方微博 | 高级检索  
文章检索
  按 检索   检索词:      
出版年份:   被引次数:   他引次数: 提示:输入*表示无穷大
  收费全文   270篇
  免费   80篇
  国内免费   22篇
  2021年   6篇
  2020年   7篇
  2019年   8篇
  2018年   3篇
  2017年   11篇
  2016年   13篇
  2015年   14篇
  2014年   15篇
  2013年   12篇
  2012年   28篇
  2011年   37篇
  2010年   10篇
  2009年   26篇
  2008年   17篇
  2007年   16篇
  2006年   22篇
  2005年   24篇
  2004年   18篇
  2003年   10篇
  2002年   15篇
  2001年   12篇
  2000年   8篇
  1999年   11篇
  1998年   8篇
  1997年   5篇
  1996年   3篇
  1995年   1篇
  1994年   2篇
  1993年   5篇
  1992年   2篇
  1991年   1篇
  1990年   2篇
排序方式: 共有372条查询结果,搜索用时 31 毫秒
321.
结合前人在海浪功率谱以及海浪产生磁场两方面的研究 ,求出了海浪 磁场系统的传递函数 ,分析了该系统的性质 ,并利用该传递函数和Neumann谱、PM谱计算了磁场功率谱 ;在此基础上 ,根据实际观测我国海区的海浪高度 周期分布 ,求解海浪分布参数 ,模拟实际的海浪过程 ,求出了实际情况下的海浪感应磁场功率谱 ,并分析了其特性 .  相似文献   
322.
Consider an N‐item, periodic review, infinite‐horizon, undiscounted, inventory model with stochastic demands, proportional holding and shortage costs, and full backlogging. For 1 ≤ jN, orders for item j can arrive in every period, and the cost of receiving them is negligible (as in a JIT setting). Every Tj periods, one reviews the current stock level of item j and decides on deliveries for each of the next Tj periods, thus incurring an item‐by‐item fixed cost kj. There is also a joint fixed cost whenever any item is reviewed. The problem is to find review periods T1, T2, …, TN and an ordering policy satisfying the average cost criterion. The current article builds on earlier results for the single‐item case. We prove an optimal policy exists, give conditions where it has a simple form, and develop a branch and bound algorithm for its computation. We also provide two heuristic policies with O(N) computational requirements. Computational experiments indicate that the branch and bound algorithm can handle normal demand problems with N ≤ 10 and that both heuristics do well for a wide variety of problems with N ranging from 2 to 200; moreover, the performance of our heuristics seems insensitive to N. © 2001 John Wiley & Sons, Inc. Naval Research Logistics 48:430–449, 2001  相似文献   
323.
基于Petri网的C2S性能分析方法研究   总被引:1,自引:0,他引:1  
给出了用时间连续随机Petri网和时间离散随机Petri网计算系统稳态概率的方法,并将其应用于指挥控制系统(C2S)的性能分析中,分析结果表明这种计算方法是可行的。  相似文献   
324.
We apply the techniques of response surface methodology (RSM) to approximate the objective function of a two‐stage stochastic linear program with recourse. In particular, the objective function is estimated, in the region of optimality, by a quadratic function of the first‐stage decision variables. The resulting response surface can provide valuable modeling insight, such as directions of minimum and maximum sensitivity to changes in the first‐stage variables. Latin hypercube (LH) sampling is applied to reduce the variance of the recourse function point estimates that are used to construct the response surface. Empirical results show the value of the LH method by comparing it with strategies based on independent random numbers, common random numbers, and the Schruben‐Margolin assignment rule. In addition, variance reduction with LH sampling can be guaranteed for an important class of two‐stage problems which includes the classical capacity expansion model. © 1999 John Wiley & Sons, Inc. Naval Research Logistics 46: 753–776, 1999  相似文献   
325.
We consider a design problem for wastewater treatment systems that considers uncertainty in pollutant concentration levels at water sources. The goal is to optimize the selection of treatment technologies and pipeline connections, so that treated wastewater can achieve specified effluents discharge limits as well as possible. We propose a new two-stage model to optimize a set of guarantee levels, that is, the maximum concentration level of source pollutants for which treated wastewater can be compliant with discharge limits. In the first stage, treatment technologies and pipeline connections are selected. In the second stage, when pollutant concentration levels are revealed, wastewater distribution and mixing are determined. A key attractiveness of the proposed guarantee rate optimization model is that it can be simplified into a single-stage mixed-integer linear program. In our numerical experiments based on real-world pollutants data, the guarantee rate model demonstrates its advantages in terms of computational efficiency, scalability and solution quality, compared with the standard probability maximization model. Finally, the methodology proposed in this paper can also be applied to other two-stage problems under uncertainty with similar uncertainty characteristics.  相似文献   
326.
空间飞网地面碰撞试验与仿真   总被引:1,自引:0,他引:1       下载免费PDF全文
设计了空间飞网地面碰撞试验系统,并将碰撞试验结果与有限元仿真结果进行比较分析,对碰撞过程中的碰撞力和绳段内力进行分析。研究表明:试验结果与仿真结果吻合较好,这验证了仿真模型的有效性;飞网碰撞目标后产生的约束张力有利于收拢包裹目标;飞网的柔性特征可有效缓解碰撞效应,但碰撞区域绳段易产生断裂破坏。  相似文献   
327.
根据目前乌鲁木齐城网的供电方式,通过对高层建筑消防供电的可靠性分析,指出在哪些情况下,为满足高层建筑的一级负荷供电要求,用户应增设自备发电机。  相似文献   
328.
信息/求解 Petri 网系统   总被引:1,自引:0,他引:1  
绝大多数 Petri 网在变迁发生后前集库所会失去标记,不便于表达一个条件一旦具备将永远具备的情形.针对该问题,基于0-1标识与变迁发生后其前集不失去标记的思想,提出了信息/求解扩展 Petri 网系统(I/S系统).给出了I/S系统的相关定义、部分基本性质、矩阵表示、求解发生权向量的求法和状态方程.最后,给出了以I/S系统表示的几种常见滑模变结构控制策略的设计过程,该例显示了I/S系统的模型表达能力.  相似文献   
329.
军事通信中ad hoc网络路由协议性能分析   总被引:1,自引:0,他引:1  
移动ad hoc组网灵活,抗毁性很强,将在未来的军事通信中发挥重要作用。因此,对于移动ad hoc网络研究中的首要的路由问题作了探讨,先简要介绍了两种典型的路由协议OLSR(Optimized Link State Routing)和AODV(Ad hoc On-Demand Distance Vector Routing),接着利用网络仿真工具OPNET分析了AODV的协议特点,最后比较了两种路由协议的性能。仿真结果表明AODV路由开销小,但时延大,节点移动过快时存在路由稳定性的问题;OLSR路由开销很大,但时延相对较小。因此在搭建军用adhoc网时,应根据实际使用情形做出选择。  相似文献   
330.
This article considers the empty vehicle redistribution problem in a hub‐and‐spoke transportation system, with random demands and stochastic transportation times. An event‐driven model is formulated, which yields the implicit optimal control policy. Based on the analytical results for two‐depot systems, a dynamic decomposition procedure is presented which produces a near‐optimal policy with linear computational complexity in terms of the number of spokes. The resulting policy has the same asymptotic behavior as that of the optimal policy. It is found that the threshold‐type control policy is not usually optimal in such systems. The results are illustrated through small‐scale numerical examples. Through simulation the robustness of the dynamic decomposition policy is tested using a variety of scenarios: more spokes, more vehicles, different combinations of distribution types for the empty vehicle travel times and loaded vehicle arrivals. This shows that the dynamic decomposition policy is significantly better than a heuristics policy in all scenarios and appears to be robust to the assumptions of the distribution types. © 2008 Wiley Periodicals, Inc. Naval Research Logistics, 2008  相似文献   
设为首页 | 免责声明 | 关于勤云 | 加入收藏

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