首页 | 本学科首页   官方微博 | 高级检索  
文章检索
  按 检索   检索词:      
出版年份:   被引次数:   他引次数: 提示:输入*表示无穷大
  收费全文   75篇
  免费   119篇
  国内免费   8篇
  2024年   2篇
  2023年   4篇
  2022年   2篇
  2021年   1篇
  2020年   8篇
  2019年   5篇
  2018年   3篇
  2017年   6篇
  2016年   4篇
  2015年   14篇
  2014年   10篇
  2013年   9篇
  2012年   10篇
  2011年   11篇
  2010年   6篇
  2009年   7篇
  2008年   10篇
  2007年   4篇
  2006年   7篇
  2005年   4篇
  2004年   8篇
  2003年   6篇
  2002年   8篇
  2001年   7篇
  2000年   5篇
  1999年   6篇
  1998年   7篇
  1997年   3篇
  1996年   3篇
  1995年   3篇
  1994年   4篇
  1993年   3篇
  1992年   3篇
  1991年   2篇
  1990年   1篇
  1989年   6篇
排序方式: 共有202条查询结果,搜索用时 171 毫秒
131.
可扩充性分析是评价并行算法或并行系统性能的重要工作,特别是在大规模并行处理环境下更是如此。本文利用新近提出的扩张串行分量分析技术,研究了三个并行排序算法的可扩充性,以及这些算法在超立方体结构上的实现的可扩充性。给出了使三种算法都为可扩充的条件,解释了每个算法的适用范围。展示了算法的实质性质,计算了它们的扩张串行分量、扩张效率以及扩张加速比。本文的解析分析结果与其它文献中的实验结果一致。  相似文献   
132.
We investigate the joint signature of m coherent systems, under the assumption that the components have independent and identically distributed lifetimes. The joint signature, for a particular ordering of failure times, is an m ‐dimensional matrix depending solely on the composition of the systems and independent of the underlying distribution function of the component lifetimes. The elements of the m ‐dimensional matrix are formulated based on the joint signatures of numerous series of parallel systems. The number of the joint signatures involved is an exponential function of the number of the minimal cut sets of each original system and may, therefore, be significantly large. We prove that although this number is typically large, a great number of the joint signatures are repeated, or removed by negative signs. We determine the maximum number of different joint signatures based on the number of systems and components. It is independent of the number of the minimal cut sets of each system and is polynomial in the number of components. Moreover, we consider all permutations of failure times and demonstrate that the results for one permutation can be of use for the others. Our theorems are applied to various examples. The main conclusion is that the joint signature can be computed much faster than expected.  相似文献   
133.
提出并验证了基于随机并行梯度下降(SPGD)算法的主动相位控制脉冲激光相干合成方案.利用低通滤波器滤除脉冲激光光强变化导致的性能评价函数起伏,提取出相位噪声导致的性能评价函数变化,然后将这个低通滤波后的性能评价函数用于SPGD算法的极值寻优过程,从而实现脉冲激光的锁相.对该方案进行了理论分析和数值模拟,并进行了两路脉冲激光相干合成实验.实验结果表明,当系统从闭环到开环时,系统性能评价函数均值提高到开环的1.6倍,干涉条纹长曝光对比度从0提高到0.43.在该方案中,通过增加合成脉冲激光路数,并在各路脉冲激光中引入多级功率放大器,能够得到更高的合成功率输出.  相似文献   
134.
We consider a parallel‐machine scheduling problem with jobs that require setups. The duration of a setup does not depend only on the job just completed but on a number of preceding jobs. These setup times are referred to as history‐dependent. Such a scheduling problem is often encountered in the food processing industry as well as in other process industries. In our model, we consider two types of setup times—a regular setup time and a major setup time that becomes necessary after several “hard‐to‐clean” jobs have been processed on the same machine. We consider multiple objectives, including facility utilization, flexibility, number of major setups, and tardiness. We solve several special cases assuming predetermined job sequences and propose strongly polynomial time algorithms to determine the optimal timing of the major setups for given job sequences. We also extend our analysis to develop pseudopolynomial time algorithms for cases with additional objectives, including the total weighted completion time, the total weighted tardiness, and the weighted number of tardy jobs. © 2012 Wiley Periodicals, Inc. Naval Research Logistics, 2012  相似文献   
135.
机电设备油液渗漏是一种典型的多发性故障,利用人工嗅觉技术对渗漏油液挥发气体进行测试从而进行故障诊断是一种新的无损检测方法。使用人工嗅觉系统对模拟柴油、齿轮油和机油渗漏产生的挥发气体进行检测,结果为三维数据阵列(样本×时间×传感器)。应用二维主成分分析法和三维平铺主成分分析法、平行因子分析方法对三种油液挥发气体样本进行分类,结果表明平行因子分析法由于利用了数据集的三维结构信息,所以分类效果更佳;应用主成分回归方法实现了机油挥发气体样本的定量确定,说明使用人工嗅觉系统实现设定阈值报警是可能的。  相似文献   
136.
We consider the single machine parallel batch scheduling problems to minimize makespan and total completion time, respectively, under precedence relations. The complexities of these two problems are reported as open in the literature. In this paper, we settle these open questions by showing that both problems are strongly NP‐hard, even when the precedence relations are chains. When the processing times of jobs are directly agreeable or inversely agreeable with the precedence relations, there is an O(n2) time algorithm to minimize the makespan. © 2004 Wiley Periodicals, Inc. Naval Research Logistics, 2004  相似文献   
137.
并联机构奇异点的运动分岔研究   总被引:2,自引:0,他引:2       下载免费PDF全文
采用静态分岔理论研究一般并联机构在奇异点处的运动分岔现象。通过约束方程研究了几种简单机构在驱动奇异和末端执行器奇异下的不同分岔类型,并研究了机构参数对分岔性态的影响。指出非持久性奇异分岔可以通过调整机构参数转换为持久性奇异分岔,从而克服机构在奇异点邻域内的运动不确定性。  相似文献   
138.
A generalized parallel replacement problem is considered with both fixed and variable replacement costs, capital budgeting, and demand constraints. The demand constraints specify that a number of assets, which may vary over time, are required each period over a finite horizon. A deterministic, integer programming formulation is presented as replacement decisions must be integer. However, the linear programming relaxation is shown to have integer extreme points if the economies of scale binary variables are fixed. This allows for the efficient computation of large parallel replacement problems as only a limited number of 0–1 variables are required. Examples are presented to provide insight into replacement rules, such as the “no‐splitting‐rule” from previous research, under various demand scenarios. © 2000 John Wiley & Sons, Inc. Naval Research Logistics 47: 40–56, 2000  相似文献   
139.
并行分布式检测网最优设计是复杂难解的,相同门限假定使I.I.D.网的设计极度简化,并在实际工程中广泛使用。本文研究了相同门限假定的合理性条件,为合理采用习惯性处理方法提供了理论依据。  相似文献   
140.
根据先进战斗机的技术特点和中远距协同空战发展方向,提出一种基于先敌发现、先敌发射、先敌摧毁能力的空战态势分析模型。同时,将并行遗传算法与分布估计算法相结合的并行分布遗传算法应用于上述模型,给出了求解多目标攻击决策问题的算法。最后利用具体算例进行仿真验证。结果表明空战态势分析模型能够较为准确地描述中远距多机协同空战,采用的算法具有较好的可行性和实时性,为中远距多机协同空战的多目标攻击决策提供了新的思路和方法。  相似文献   
设为首页 | 免责声明 | 关于勤云 | 加入收藏

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