首页 | 本学科首页   官方微博 | 高级检索  
文章检索
  按 检索   检索词:      
出版年份:   被引次数:   他引次数: 提示:输入*表示无穷大
  收费全文   68篇
  免费   71篇
  139篇
  2021年   2篇
  2020年   1篇
  2019年   1篇
  2016年   1篇
  2015年   2篇
  2014年   5篇
  2013年   5篇
  2012年   2篇
  2011年   2篇
  2010年   3篇
  2009年   3篇
  2008年   3篇
  2007年   3篇
  2006年   2篇
  2005年   6篇
  2003年   1篇
  2001年   2篇
  2000年   1篇
  1999年   12篇
  1998年   16篇
  1997年   14篇
  1996年   9篇
  1995年   5篇
  1994年   3篇
  1993年   8篇
  1992年   6篇
  1991年   2篇
  1990年   5篇
  1989年   3篇
  1988年   5篇
  1987年   2篇
  1986年   1篇
  1985年   1篇
  1983年   2篇
排序方式: 共有139条查询结果,搜索用时 7 毫秒
31.
本文利用自适应卡尔曼滤波器原理建立机械系统过程监测模型—AR模型,并根据AR模型系数的变化可以表征系统过程状态这一特点,通过序贯概率比(SPRT)这一假设检验法,对机械系统的运行状况进行判别。实验表明,该方法行之有效,最后,本文给出了实验结果。  相似文献   
32.
本文以日本幕末时期(1853-1867)著名倒幕志士、兵学家吉田松阴(1830—1859)所著《孙子评注》为中心,重点分析其借助《孙子兵法》而构筑的兵学思想的三个特点:重视民政和仁政,强调将领的道德勇气,坚持进攻优先。这一切构成了他批判幕府国防政策的依据,是其走向政治激进主义的重要思想支柱。  相似文献   
33.
<中共中央关于加强党的执政能力建设的决定>指出,坚持国防建设与经济建设协调发展,建设一支现代化、正规化的革命军队,是党执政的一项重大战略任务.坚持党对军队的绝对领导,加强军队全面建设,既是对我们党取得执政经验的科学总结,又是巩固我们党执政地位的现实保障,同时,加强军队全面建设对提高我们党的执政能力还具有服务和促进的功能.  相似文献   
34.
人工智能技术在众多领域获得广泛应用.为满足现代战争对防化指挥手段的现代化要求,针对不易量化的防化指挥决策问题的评估,提出了构建知识库并应用模糊推理机制建立专家系统,据此进行防化保障预案的评估选优方法,并对该方法的求解过程进行了探讨.  相似文献   
35.
军事思想是人们对战争、军队和国防的基本问题的理性认识。研究和总结人类各个时期军事思想的历史发展和特点,是对军事领域问题探讨的过程之一,是人类在军事领域自我认知的手段和途径,是超越自我、实现突破的必经之路。中世纪世界军事思想在特定的历史条件下.经历了一个缓慢的历史演变过程,其战争观、军队建设和战略战术思想有了较大的发展,呈现出缓慢性、演进性和多元性的特征。  相似文献   
36.
Jones, Zydiak, and Hopp [1] consider the parallel machine replacement problem (PMRP), in which there are both fixed and variable costs associated with replacing machines. Increasing maintenance cost motivates replacements, and a fixed replacement cost provides incentive for replacing machines of the same age in clusters. They prove two intuitive but important results for finite- or infinite-horizon PMRPs, which significantly reduce the size of the linear programming (LP) formulation of the problem and computing efforts required to obtain an optimal replacement policy. Their results are the no-splitting rule (NSR) and the older cluster replacement rule (OCRR). Under a slightly weaker set of assumptions, we prove a third rule, the all-or-none rule (AONR), which states that in any period, an optimal policy is to keep or to replace all the machines regardless of age. This result further reduces the size of the LP formulation of the PMRP. © 1993 John Wiley & Sons, Inc.  相似文献   
37.
We study a single batching machine scheduling problem with transportation and deterioration considerations arising from steel production. A set of jobs are transported, one at a time, by a vehicle from a holding area to the single batching machine. The machine can process several jobs simultaneously as a batch. The processing time of a job will increase if the duration from the time leaving the holding area to the start of its processing exceeds a given threshold. The time needed to process a batch is the longest of the job processing times in the batch. The problem is to determine the job sequence for transportation and the job batching for processing so as to minimize the makespan and the number of batches. We study four variations (P1, P2, P3, P4) of the problem with different treatments of the two criteria. We prove that all the four variations are strongly NP‐hard and further develop polynomial time algorithms for their special cases. For each of the first three variations, we propose a heuristic algorithm and analyze its worst‐case performance. For P4, which is to find the Pareto frontier, we provide a heuristic algorithm and an exact algorithm based on branch and bound. Computational experiments show that all the heuristic algorithms perform well on randomly generated problem instances, and the exact algorithm for P4 can obtain Pareto optimal schedules for small‐scale instances. © 2014 Wiley Periodicals, Inc. Naval Research Logistics 61: 269–285, 2014  相似文献   
38.
We consider a ship stowage planning problem where steel coils with known destination ports are to be loaded onto a ship. The coils are to be stowed on the ship in rows. Due to their heavy weight and cylindrical shape, coils can be stowed in at most two levels. Different from stowage problems in previous studies, in this problem there are no fixed positions on the ship for the coils due to their different sizes. At a destination port, if a coil to be unloaded is not at a top position, those blocking it need to be shuffled. In addition, the stability of ship has to be maintained after unloading at each destination port. The objective for the stowage planning problem is to minimize a combination of ship instability throughout the entire voyage, the shuffles needed for unloading at the destination ports, and the dispersion of coils to be unloaded at the same destination port. We formulate the problem as a novel mixed integer linear programming model. Several valid inequalities are derived to help reducing solution time. A tabu search (TS) algorithm is developed for the problem with the initial solution generated using a construction heuristic. To evaluate the proposed TS algorithm, numerical experiments are carried out on problem instances of three different scales by comparing it with a model‐based decomposition heuristic, the classic TS algorithm, the particle swarm optimization algorithm, and the manual method used in practice. The results show that for small problems, the proposed algorithm can generate optimal solutions. For medium and large practical problems, the proposed algorithm outperforms other methods. © 2015 Wiley Periodicals, Inc. Naval Research Logistics 62: 564–581, 2015  相似文献   
39.
System reliability is often estimated by the use of components' reliability test results when system test data are not available, or are very scarce. A method is proposed for computing the exact posterior probability density function, cumulative distribution function, and credible intervals for system reliability in a Bayesian setting, with the use of components' prior probability distributions and current test results. The method can be applied to series, parallel, and many mixed systems. Although in theory the method involves evaluating infinite series, numerical results show that a small number of terms from the infinite series are sufficient in practice to provide accurate estimates of system reliability. Furthermore, because the coefficients in the series follow some recurrence relations, our results allow us to calculate the reliability distribution of a large system from that of its subsystems. Error bounds associated with the proposed method are also given. Numerical comparisons with other existing approaches show that the proposed method is efficient and accurate. © 1997 John Wiley & Sons, Inc.  相似文献   
40.
We examine the setup and improvement policies for a production process with multiple performance states. Assume that the production process deteriorates randomly over time, following a Markovian process with known transition probabilities. In order to reduce the production cost incurred because of process deterioration, the process is inspected at the end of each period. Then one of three actions may be taken: do nothing, perform routine process setup, or perform routine setup and process improvement. The routine setup operation returns the process to its best performance state, whereas the process improvement action may reduce future production and setup costs and improve the process-state transition probabilities. A discounted Markovian model is formulated to find the strategy that minimizes the total cost of operating the production process. © 1997 John Wiley & Sons, Inc. Naval Research Logistics 44: 383–400, 1997  相似文献   
设为首页 | 免责声明 | 关于勤云 | 加入收藏

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