首页 | 本学科首页   官方微博 | 高级检索  
文章检索
  按 检索   检索词:      
出版年份:   被引次数:   他引次数: 提示:输入*表示无穷大
  收费全文   73篇
  免费   41篇
  国内免费   4篇
  2023年   1篇
  2022年   1篇
  2020年   3篇
  2019年   5篇
  2018年   4篇
  2017年   4篇
  2016年   7篇
  2015年   6篇
  2014年   8篇
  2013年   8篇
  2012年   7篇
  2011年   2篇
  2010年   7篇
  2009年   2篇
  2008年   4篇
  2007年   5篇
  2006年   3篇
  2005年   5篇
  2004年   5篇
  2003年   3篇
  2002年   4篇
  2001年   2篇
  2000年   5篇
  1998年   7篇
  1996年   5篇
  1995年   1篇
  1994年   1篇
  1993年   2篇
  1992年   1篇
排序方式: 共有118条查询结果,搜索用时 31 毫秒
1.
在PCB上,两个不相邻的芯片管脚或引线发生短路是实际应用当中最常见的故障。通过分析固定型故障和桥接故障之间的关系,给出桥接故障测试序列产生的系统计算方法。该方法已应用在一个PCB故障测试系统中。  相似文献   
2.
为了系统地计算水下航行体全套惯性类水动力系数,提高计算效率和计算精度,通过基于无粘模型的计算方法对水下航行体的运动进行了预报;通过UDF及动网格技术,对匀速运动和匀加速运动的SUBOFF模型进行了分析.设计了单方向速度线性变化的匀加速直线运动和匀加速回转运动,并通过换算和数值拟合处理得到了潜艇所受的惯性力和惯性类水动力系数.该系数与试验误差保证在6%之内,验证了所提方法的可行性及准确性.  相似文献   
3.
为解决当样本数据不断增加时,利用传统方法反复计算样本协方差迹耗时多的缺点,提出了一种快速递推算法。理论分析和仿真试验都表明,算法的时间复杂度比传统的方法降低了一个数量级,从而大大减少了计算时间。  相似文献   
4.
固-液旋流分离器结构优化模拟研究   总被引:1,自引:0,他引:1  
采用计算流体力学方法与流体动力学分析软件Fluent,探讨了固-液旋流分离器的溢流口直径、锥角、圆柱段长度和入口直径等主要结构参数对其颗粒溢流率的影响,并在此基础上进行结构参数的优化。结果表明,锥角、圆柱段长度和入口直径过大或过小都不利于旋流分离器的固液分离,均存在一个最佳值。对于主直径为75 mm的单锥双入口固-液旋流分离器,最佳圆柱段长度为87.0 mm,最佳入口直径为16.0 mm,最佳溢流口直径为16.5 mm,最佳锥角为6.0°。  相似文献   
5.
穿甲弹对自行火炮易损性分析与计算   总被引:1,自引:0,他引:1  
分析了自行火炮在穿甲弹作用下的易损性,建立了自行火炮易损性计算模型,并以某型自行火炮为例,分别计算了该炮在120mm穿甲弹正面命中与侧面命中时的毁伤概率。  相似文献   
6.
This paper examines scheduling problems in which the setup phase of each operation needs to be attended by a single server, common for all jobs and different from the processing machines. The objective in each situation is to minimize the makespan. For the processing system consisting of two parallel dedicated machines we prove that the problem of finding an optimal schedule is N P‐hard in the strong sense even if all setup times are equal or if all processing times are equal. For the case of m parallel dedicated machines, a simple greedy algorithm is shown to create a schedule with the makespan that is at most twice the optimum value. For the two machine case, an improved heuristic guarantees a tight worst‐case ratio of 3/2. We also describe several polynomially solvable cases of the later problem. The two‐machine flow shop and the open shop problems with a single server are also shown to be N P‐hard in the strong sense. However, we reduce the two‐machine flow shop no‐wait problem with a single server to the Gilmore—Gomory traveling salesman problem and solve it in polynomial time. © 2000 John Wiley & Sons, Inc. Naval Research Logistics 47: 304–328, 2000  相似文献   
7.
We consider a single-machine scheduling model in which the job processing times are controllable variables with linear costs. The objective is to minimize the sum of the cost incurred in compressing job processing times and the cost associated with the number of late jobs. The problem is shown to be NP-hard even when the due dates of all jobs are identical. We present a dynamic programming solution algorithm and a fully polynomial approximation scheme for the problem. Several efficient heuristics are proposed for solving the problem. Computational experiments demonstrate that the heuristics are capable of producing near-optimal solutions quickly. © 1998 John Wiley & Sons, Inc. Naval Research Logistics 45: 67–82, 1998  相似文献   
8.
We consider a make‐to‐order production–distribution system with one supplier and one or more customers. A set of orders with due dates needs to be processed by the supplier and delivered to the customers upon completion. The supplier can process one order at a time without preemption. Each customer is at a distinct location and only orders from the same customer can be batched together for delivery. Each delivery shipment has a capacity limit and incurs a distribution cost. The problem is to find a joint schedule of order processing at the supplier and order delivery from the supplier to the customers that optimizes an objective function involving the maximum delivery tardiness and the total distribution cost. We first study the solvability of various cases of the problem by either providing an efficient algorithm or proving the intractability of the problem. We then develop a fast heuristic for the general problem. We show that the heuristic is asymptotically optimal as the number of orders goes to infinity. We also evaluate the performance of the heuristic computationally by using lower bounds obtained by a column generation approach. Our results indicate that the heuristic is capable of generating near optimal solutions quickly. Finally, we study the value of production–distribution integration by comparing our integrated approach with two sequential approaches where scheduling decisions for order processing are made first, followed by order delivery decisions, with no or only partial integration of the two decisions. We show that in many cases, the integrated approach performs significantly better than the sequential approaches. © 2005 Wiley Periodicals, Inc. Naval Research Logistics, 2005  相似文献   
9.
舰艇协同作战导弹防御模型研究   总被引:1,自引:0,他引:1  
舰艇协同作战是未来战争的主要作战形式,导弹防御是其主要的作战职责.运用信息论的方法对舰艇协同作战中敌方导弹发射策略的不确定性进行建模,运用可靠性理论对协作效果进行建模,并引进知识的概念作为其度量,同时用边的函数对网络复杂性进行建模,综合这两种因素在以最大化防御时间为总的决策目标,以己方导弹储备和敌方来袭速率为决策因素对导弹防御作出辅助决策.  相似文献   
10.
Abstract

There is an assumption that we can enhance peacebuilding by improving the tools that we use for assessments, planning and evaluation. However, the focus on tools creates the impression that peacebuilding challenges are technical. Improving tools is not meaningless, but our preoccupation with tools has a negative effect when it becomes a front for avoiding dealing with the deeper inherent contradictions in peacebuilding. There are limits to our knowledge and our ability to engineer specific outcomes in complex systems. There are unrealistically high expectations of coherence, unity of purpose and cooperation among peacebuilding actors. Peacebuilding agents are interconnected, but that does not imply that they have the same objectives, mandates, principles and values. Interconnected problems call for interconnected responses, not for one coherent response. Coherence should not be about negotiating a common position, and then promoting it regardless of changing dynamics. Coherence should be about continuously managing competing interests and interdependencies. The interaction between dissention, competition for resources, and the tension between different approaches and policy choices is not only normal but necessary to ensure the optimal functioning of the system.  相似文献   
设为首页 | 免责声明 | 关于勤云 | 加入收藏

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