首页 | 本学科首页   官方微博 | 高级检索  
文章检索
  按 检索   检索词:      
出版年份:   被引次数:   他引次数: 提示:输入*表示无穷大
  收费全文   536篇
  免费   216篇
  国内免费   34篇
  2024年   4篇
  2023年   8篇
  2022年   6篇
  2021年   12篇
  2020年   12篇
  2019年   13篇
  2018年   11篇
  2017年   26篇
  2016年   32篇
  2015年   25篇
  2014年   40篇
  2013年   43篇
  2012年   40篇
  2011年   65篇
  2010年   43篇
  2009年   48篇
  2008年   28篇
  2007年   45篇
  2006年   37篇
  2005年   36篇
  2004年   36篇
  2003年   17篇
  2002年   22篇
  2001年   27篇
  2000年   21篇
  1999年   23篇
  1998年   14篇
  1997年   11篇
  1996年   3篇
  1995年   4篇
  1994年   7篇
  1993年   7篇
  1992年   6篇
  1991年   4篇
  1990年   5篇
  1989年   4篇
  1988年   1篇
排序方式: 共有786条查询结果,搜索用时 750 毫秒
571.
In many practical situations of production scheduling, it is either necessary or recommended to group a large number of jobs into a relatively small number of batches. A decision needs to be made regarding both the batching (i.e., determining the number and the size of the batches) and the sequencing (of batches and of jobs within batches). A setup cost is incurred whenever a batch begins processing on a given machine. This paper focuses on batch scheduling of identical processing‐time jobs, and machine‐ and sequence‐independent setup times on an m‐machine flow‐shop. The objective is to find an allocation to batches and their schedule in order to minimize flow‐time. We introduce a surprising and nonintuitive solution for the problem. © 2004 Wiley Periodicals, Inc. Naval Research Logistics, 2004  相似文献   
572.
Burn‐in is a widely used method to improve the quality of products or systems after they have been produced. In this paper, we consider the problem of determining bounds to the optimal burn‐in time and optimal replacement policy maximizing the steady state availability of a repairable system. It is assumed that two types of system failures may occur: One is Type I failure (minor failure), which can be removed by a minimal repair, and the other is Type II failure (catastrophic failure), which can be removed only by a complete repair. Assuming that the underlying lifetime distribution of the system has a bathtub‐shaped failure rate function, upper and lower bounds for the optimal burn‐in time are provided. Furthermore, some other applications of optimal burn‐in are also considered. © 2004 Wiley Periodicals, Inc. Naval Research Logistics, 2004  相似文献   
573.
We study a class of new scheduling problems which involve types of teamwork tasks. Each teamwork task consists of several components, and requires a team of processors to complete, with each team member to process a particular component of the task. Once the processor completes its work on the task, it will be available immediately to work on the next task regardless of whether the other components of the last task have been completed or not. Thus, the processors in a team neither have to start, nor have to finish, at the same time as they process a task. A task is completed only when all of its components have been processed. The problem is to find an optimal schedule to process all tasks, under a given objective measure. We consider both deterministic and stochastic models. For the deterministic model, we find that the optimal schedule exhibits the pattern that all processors must adopt the same sequence to process the tasks, even under a general objective function GC = F(f1(C1), f2(C2), … , fn(Cn)), where fi(Ci) is a general, nondecreasing function of the completion time Ci of task i. We show that the optimal sequence to minimize the maximum cost MC = max fi(Ci) can be derived by a simple rule if there exists an order f1(t) ≤ … ≤ fn(t) for all t between the functions {fi(t)}. We further show that the optimal sequence to minimize the total cost TC = ∑ fi(Ci) can be constructed by a dynamic programming algorithm. For the stochastic model, we study three optimization criteria: (A) almost sure minimization; (B) stochastic ordering; and (C) expected cost minimization. For criterion (A), we show that the results for the corresponding deterministic model can be easily generalized. However, stochastic problems with criteria (B) and (C) become quite difficult. Conditions under which the optimal solutions can be found for these two criteria are derived. © 2004 Wiley Periodicals, Inc. Naval Research Logistics, 2004  相似文献   
574.
在超声相控阵检测领域,常规成像方法遵守瑞利准则,其成像分辨率受到波长限制。研究时间反转多信号分类(Time Reversal-MUltiple SIgnal Classification, TR-MUSIC)方法,在保持超声波工作频率不变且不影响系统探测深度的前提下,可提高成像分辨率,实现超分辨率成像。通过全矩阵采集方法获取被测对象的超声阵列数据;利用平面B扫描和TR-MUSIC方法处理数据,得到二维和三维超声图像;依据图像特征评估被测对象内部状况。实验选取加工不锈钢试块作为被测对象,搭建超声相控阵检测系统,在试块内部加工6个直径为1 mm、可视为点散射体的相邻贯通孔作为缺陷。实验表明,TR-MUSIC方法能够区分并定位这6个相邻点散射体,而平面B扫描方法则不能。因此,基于时间反转声学理论的TR-MUSIC方法可以提高成像分辨率,改善超声图像质量。  相似文献   
575.
In this work, we extend the recently proposed adaptive phase field method to model fracture in orthotropic functionally graded materials (FGMs). A recovery type error indicator combined with quadtree decomposition is employed for adaptive mesh refinement. The proposed approach is capable of capturing the fracture process with a localized mesh refinement that provides notable gains in computational efficiency. The implementation is validated against experimental data and other nu-merical experiments on orthotropic materials with different material orientations. The results reveal an increase in the stiffness and the maximum force with increasing material orientation angle. The study is then extended to the analysis of orthotropic FGMs. It is observed that, if the gradation in fracture properties is neglected, the material gradient plays a secondary role, with the fracture behaviour being dominated by the orthotropy of the material. However, when the toughness increases along the crack propagation path, a substantial gain in fracture resistance is observed.  相似文献   
576.
For the case that two pursuers intercept an evasive target, the cooperative strategies and state estimation methods taken by pursuers can seriously affect the guidance accuracy for the target, which performs a bang For the case that two pursuers intercept an evasive target, the cooperative strategies and state estimation methods taken by pursuers can seriously affect the guidance accuracy for the target, which performs a bang-bang evasive maneuver with a random switching time. Combined Fast multiple model adaptive estimation (Fast MMAE) algorithm, the cooperative guidance law takes detection configuration affecting the accuracy of interception into consideration. Introduced the detection error model related to the line-of-sight (LOS) separation angle of two interceptors, an optimal cooperative guidance law solving the optimization problem is designed to modulate the LOS separation angle to reduce the estimation error and improve the interception performance. Due to the uncertainty of the target bang-bang maneuver switching time and the effective fitting of its multi-modal motion, Fast MMAE is introduced to identify its maneuver switching time and estimate the acceleration of the target to track and intercept the target accurately. The designed cooperative optimal guidance law with Fast MMAE has better estimation ability and interception performance than the traditional guidance law and estimation method via Monte Carlo simulation.  相似文献   
577.
研究BGP收敛性改进问题,考虑网络运行状况,提出一种新的机制,称为通告时间戳机制ATS(advertisement time stamp)。在该机制中,BGP路由器在向对等体发送路由通告报文时,将相应的路由前缀打上时间戳。当通告报文准备好时,通过查看相应前缀的时间戳来判断报文是否可以立即发送还是应该等待。该机制充分融合了每对等体每目的网络速率限制定时器和每对等体速率限制定时器各自的优点,克服各自缺点。分析表明,该机制可以较大地减少Tup、Tlong及Tshort事件的收敛延迟。  相似文献   
578.
复合土钉支护的有限元分析   总被引:9,自引:2,他引:7  
复合土钉支护是从土钉墙的基础上发展起来的,它在一定程度上克服了土钉墙的缺点,是一种应用更加广泛的基坑支护新技术。通过建立有限元模型模拟了水泥土桩复合土钉墙的分步开挖与支护的过程,比较了复合土钉支护与土钉支护在土体位移、地表沉降、基底隆起及超挖引起的破坏形态的不同,研究了复合土钉支护的作用机理。结果表明:复合土钉支护能够充分调动周围土体共同作用,更加有效的控制了基坑变形,其支护效果明显优于一般的土钉支护。  相似文献   
579.
舰艇编队对空中目标的威胁程度判断模型   总被引:7,自引:0,他引:7  
根据舰艇编队对空防御的要求,综合考虑了目标运动状态和历史战术动作,将目标攻击企图和攻击达成概率纳入目标威胁判断之中,建立了空中运动目标实时威胁程度判断模型,为编队防空作战火力组织提供了基本依据。该模型解决了传统静态威胁判断模型存在的一些问题,模型的仿真结果符合一般战术推理和经验判断,能较好地描述空中目标威胁程度的变化,可以为编队防空指挥自动化决策研究提供一定的参考。  相似文献   
580.
介绍了一种基于代数算法的回转对称非球面计算机控制表面成形的驻留时间算法。该算法将驻留时间转化为工件自转的整数圈数,并且将抛光模对工件的材料去除效率体现到材料去除矩阵上进行计算。利用非负最小二乘法求解驻留时间向量。最后,利用该算法在自研的磁流变抛光实验装置上对一回转对称光学零件进行3次迭代加工,使其面形精度从8μm提高到0.5μm以内。  相似文献   
设为首页 | 免责声明 | 关于勤云 | 加入收藏

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