首页 | 本学科首页   官方微博 | 高级检索  
文章检索
  按 检索   检索词:      
出版年份:   被引次数:   他引次数: 提示:输入*表示无穷大
  收费全文   280篇
  免费   11篇
  国内免费   1篇
  292篇
  2025年   4篇
  2024年   1篇
  2023年   3篇
  2022年   2篇
  2021年   11篇
  2020年   9篇
  2019年   10篇
  2018年   4篇
  2017年   10篇
  2016年   16篇
  2015年   14篇
  2014年   16篇
  2013年   7篇
  2012年   17篇
  2011年   22篇
  2010年   10篇
  2009年   13篇
  2008年   15篇
  2007年   11篇
  2006年   12篇
  2005年   16篇
  2004年   11篇
  2003年   7篇
  2002年   7篇
  2001年   12篇
  2000年   7篇
  1999年   6篇
  1998年   6篇
  1997年   5篇
  1996年   2篇
  1993年   3篇
  1992年   1篇
  1991年   1篇
  1990年   1篇
排序方式: 共有292条查询结果,搜索用时 15 毫秒
261.
结合前人在海浪功率谱以及海浪产生磁场两方面的研究 ,求出了海浪 磁场系统的传递函数 ,分析了该系统的性质 ,并利用该传递函数和Neumann谱、PM谱计算了磁场功率谱 ;在此基础上 ,根据实际观测我国海区的海浪高度 周期分布 ,求解海浪分布参数 ,模拟实际的海浪过程 ,求出了实际情况下的海浪感应磁场功率谱 ,并分析了其特性 .  相似文献   
262.
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  相似文献   
263.
研究搜索型多对二随机格斗战斗模型。假设格斗开始时A方有m件武器,B方有2件武器,B方处于隐蔽状态,格斗开始后B方可以直接对A方进行射击,A方需先搜索到B方后才能进行射击。双方各为同类武器,都是集火射击,所有开火都是独立的,每件武器开火射击直到毁伤对方才重新射击下一个目标。对搜索时间和毁伤间隔时间都服从一般分布的随机格斗模型,通过分析各状态的特征,利用状态概率分析方法和向后递归时间方法建立状态方程,求出了格斗处在各个状态的概率,并得到双方的获胜概率计算公式。  相似文献   
264.
Network epidemiology has become a core framework for investigating the role of human contact patterns in the spreadingof infectious diseases. In network epidemiology, one represents the contact structure as a network of nodes(individuals) connected bylinks(sometimes as a temporal network where the links are not continuously active) and the disease as a compartmental model(whereindividuals are assigned states with respect to the disease and follow certain transition rules between the states). In this paper, we discussfast algorithms for such simulations and also compare two commonly used versions,one where there is a constant recovery rate(the numberof individuals that stop being infectious per time is proportional to the number of such people);the other where the duration of the diseaseis constant. The results show that, for most practical purposes, these versions are qualitatively the same.  相似文献   
265.
剩余寿命预测是视情维修决策的重点和难点.针对工程实践中历史数据少、模型参数估计精度低的问题,建立一种基于随机滤波(SF)的齿轮箱剩余寿命预测模型.该方法采用递归期望最大化(REM)算法对模型参数进行递归更新,推导极大似然估计方法的参数递归更新过程,最后经实例验证模型的有效性和实用性.  相似文献   
266.
为研究T型分支坑道对油气爆炸传播特性的影响,通过对比实验,测定了相同初始条件下T型分支坑道和直坑道中油气混合物爆炸的火焰传播速度和爆炸波超压值。利用高速摄影仪,记录了火焰传播至T型分支坑道时的火焰阵面变化情况,并对T型分支坑道中油气混合物爆炸的传播情况进行了理论分析。结果表明:T型分支坑道对油气混合物爆炸的影响可以视为面积突扩和障碍物扰动双重作用的影响;火焰经过支坑道时,火焰阵面发生扭曲并产生皱褶,表面积增大导致火焰传播速度增大;T型分支坑道处,大量反射波和绕射波进入波后反应区,加强了气流湍流强度,并推动已燃气体回传,迅速提高了燃烧反应速度和能量释放率,起到了增大火焰传播速度和爆炸波超压值的作用。  相似文献   
267.
射击策略的选择在随机格斗中是一重要战术问题,当一方武器面临多个武器目标时,如何确定射击目标顺序的研究,显然是具有实际意义的。依据发射间隔服从负指数分布的多对一随机格斗中最优策略应满足的条件,推出求解此类多对一格斗最优策略的方法。进而研究了射击间隔服从此类分布的多对二随机格斗中处于劣势一方的射击策略选择问题,得出寻求最优射击策略的一般方法。  相似文献   
268.
    
We develop a simple, approximately optimal solution to a model with Erlang lead time and deterministic demand. The method is robust to misspecification of the lead time and has good accuracy. We compare our approximate solution to the optimal for the case where we have prior information on the lead‐time distribution, and another where we have no information, except for computer‐generated sample data. It turns out that our solution is as easy as the EOQ's, with an accuracy rate of 99.41% when prior information on the lead‐time distribution is available and 97.54–99.09% when only computer‐generated sample information is available. Apart from supplying the inventory practitioner with an easy heuristic, we gain insights into the efficacy of stochastic lead time models and how these could be used to find the cost and a near‐optimal policy for the general model, where both demand rate and lead time are stochastic. © 2004 Wiley Periodicals, Inc. Naval Research Logistics, 2004  相似文献   
269.
    
Designing Code Division Multiple Access networks includes determining optimal locations of radio towers and assigning customer markets to the towers. In this paper, we describe a deterministic model for tower location and a stochastic model to optimize revenue given a set of constructed towers. We integrate these models in a stochastic integer programming problem with simple recourse that optimizes the location of towers under demand uncertainty. We develop algorithms using Benders' reformulation, and we provide computational results. © 2006 Wiley Periodicals, Inc. Naval Research Logistics, 2007  相似文献   
270.
    
A two‐echelon distribution inventory system with a central warehouse and a number of retailers is considered. The retailers face stochastic demand and replenish from the warehouse, which, in turn, replenishes from an outside supplier. The system is reviewed continuously and demands that cannot be met directly are backordered. Standard holding and backorder costs are considered. In the literature on multi‐echelon inventory control it is standard to assume that backorders at the warehouse are served according to a first come–first served policy (FCFS). This allocation rule simplifies the analysis but is normally not optimal. It is shown that the FCFS rule can, in the worst case, lead to an asymptotically unbounded relative cost increase as the number of retailers approaches infinity. We also provide a new heuristic that will always give a reduction of the expected costs. A numerical study indicates that the average cost reduction when using the heuristic is about two percent. The suggested heuristic is also compared with two existing heuristics. © 2007 Wiley Periodicals, Inc. Naval Research Logistics, 2007  相似文献   
设为首页 | 免责声明 | 关于勤云 | 加入收藏

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