全文获取类型
收费全文 | 1929篇 |
免费 | 624篇 |
国内免费 | 255篇 |
出版年
2024年 | 5篇 |
2023年 | 22篇 |
2022年 | 26篇 |
2021年 | 50篇 |
2020年 | 50篇 |
2019年 | 38篇 |
2018年 | 33篇 |
2017年 | 93篇 |
2016年 | 144篇 |
2015年 | 89篇 |
2014年 | 178篇 |
2013年 | 165篇 |
2012年 | 164篇 |
2011年 | 142篇 |
2010年 | 118篇 |
2009年 | 166篇 |
2008年 | 126篇 |
2007年 | 143篇 |
2006年 | 182篇 |
2005年 | 168篇 |
2004年 | 145篇 |
2003年 | 97篇 |
2002年 | 65篇 |
2001年 | 73篇 |
2000年 | 50篇 |
1999年 | 54篇 |
1998年 | 49篇 |
1997年 | 38篇 |
1996年 | 23篇 |
1995年 | 18篇 |
1994年 | 18篇 |
1993年 | 15篇 |
1992年 | 20篇 |
1991年 | 17篇 |
1990年 | 16篇 |
1989年 | 7篇 |
1987年 | 1篇 |
排序方式: 共有2808条查询结果,搜索用时 15 毫秒
361.
针对企业应用CAPP的需要 ,研制成功了工艺表格自动生成系统。该系统建立一个处理工艺表格的通用模型 ,把企业的具体工艺表格当作模型的实例 ,并将工艺表格的形式和要求等作为实例的属性。系统采用ODBC(开放式数据库互连 )技术 ,为MIS、PDM等系统内部不同模式数据交换提供接口。实践证明系统具有设计方法新颖、通用性强和实用性好等特点。 相似文献
362.
Tsuyoshi Katayama 《海军后勤学研究》2001,48(7):638-651
We consider a single‐queue with exhaustive or gated time‐limited services and server vacations, in which the length of each service period at the queue is controlled by a timer, i.e., the server serves customers until the timer expires or the queue becomes empty, whichever occurs first, and then takes vacations. The customer whose service is interrupted due to the timer expiration may be attended according to nonpreemptive or preemptive service disciplines. For the M/G/1 exhaustive/gated time‐limited service queueing system with an exponential timer and four typical preemptive/nonpreemptive service disciplines, we derive the Laplace—Stieltjes transforms and the moment formulas for waiting times and sojourn times through a unified approach, and provide some new results for these time‐limited service disciplines. © John Wiley & Sons, Inc. Naval Research Logistics 48: 638–651, 2001. 相似文献
363.
The minimum storage‐time sequencing problem generalizes many well‐known problems in combinatorial optimization, such as the directed linear arrangement and the problem of minimizing the weighted sum of completion times, subject to precedence constraints on a single processor. In this paper we propose a new lower bound, based on a Lagrangian relaxation, which can be computed very efficiently. To improve upon this lower bound, we employ a bundle optimization algorithm. We also show that the best bound obtainable by this approach equals the one obtainable from the linear relaxation computed on a formulation whose first Chvàtal closure equals the convex hull of all the integer solutions of the problem. © 2001 John Wiley & Sons, Inc. Naval Research Logistics 48: 313–331, 2001 相似文献
364.
Pirja Heiskanen 《海军后勤学研究》2001,48(3):210-225
In this paper a constraint proposal method is developed for computing Pareto‐optimal solutions in multiparty negotiations over continuous issues. Constraint proposal methods have been previously studied in a case where the decision set is unconstrained. Here we extend the method to situations with a constrained decision set. In the method the computation of the Pareto‐optimal solutions is decentralized so that the DMs do not have to know each others' value functions. During the procedure they have to indicate their optimal solutions on different sets of linear constraints. When the optimal solutions coincide, the common optimum is a candidate for a Pareto‐optimal point. The constraint proposal method can be used to generate either one Pareto‐optimal solution dominating the status quo solution or several Pareto‐optimal solutions. In latter case a distributive negotiation among the efficient points can be carried out afterwards. © 2001 John Wiley & Sons, Inc. Naval Research Logistics 48: 210–225, 2001 相似文献
365.
We introduce a formulation and an exact solution method for a nonpreemptive resource constrained project scheduling problem in which the duration/cost of an activity is determined by the mode selection and the duration reduction (crashing) within the mode. This problem is a natural combination of the time/cost tradeoff problem and the resource constrained project scheduling problem. It involves the determination, for each activity, of its resource requirements, the extent of crashing, and its start time so that the total project cost is minimized. We present a branch and bound procedure and report computational results with a set of 160 problems. Computational results demonstrate the effectiveness of our procedure. © 2001 John Wiley & Sons, Inc. Naval Research Logistics 48: 107–127, 2001 相似文献
366.
Let X and Xτ denote the lifetime and the residual life at age τ of a system, respectively. X is said to be a NBUL random variable if Xτ is smaller than X in Laplace order, i.e., Xτ ≤L X. We obtain some characterizations for this class of life distribution by means of the lifetime of a series system and the residual life at random time. We also discuss preservation properties for this class of life distribution under shock models. Finally, under the assumption that the lifetimes have the NBUL property, we make stochastic comparisons between some basic replacement policies. © 2001 John Wiley & Sons, Inc. Naval Research Logistics 48: 578–591, 2001. 相似文献
367.
对钢丝绳联轴器进行了动刚度性能实验 ,在此基础上建立了数学模型 ,并进行了参数辨识 ,指出钢丝绳联轴器具有强非线性 ,对减小轴系扭转振动具有良好的效果 相似文献
368.
测定了溶胀的PPU/PSAB 交联聚合物中链段和侧基的13CT1和NOE ,用VJGM模型和三等价位跃迁内旋转、扩散内旋转以及等价、不等价两位置跃迁内旋转模型分析了其中的主链链段运动和侧基内旋转运动 ,求出了主链和侧基的运动相关时间、扩散系数和活化能等参数 .结果表明PS含量对PPU运动的影响极小 ,PS主链运动活化能与PPU含量存在线性关系 .丙烯酸与苯乙烯共聚对PPU的运动几乎无影响 相似文献
369.
后方油库整体生存概率分析计算 总被引:1,自引:1,他引:0
针对我军后方油库特点,探讨了油库整体生存概率计算的基本思路和方法,分析了各类分项目标生存概率的计算方法,采用层次分析对后方油库各分项目标权值进行了详细分析计算,可为后方油库伪装防护效能评估提供依据。 相似文献
370.
Fangruo Chen 《海军后勤学研究》2000,47(5):422-439
Consider a distribution system with a central warehouse and multiple retailers. Customer demand arrives at each of the retailers continuously at a constant rate. The retailers replenish their inventories from the warehouse which in turn orders from an outside supplier with unlimited stock. There are economies of scale in replenishing the inventories at both the warehouse and the retail level. Stockouts at the retailers are backlogged. The system incurs holding and backorder costs. The objective is to minimize the long‐run average total cost in the system. This paper studies the cost effectiveness of (R, Q) policies in the above system. Under an (R, Q) policy, each facility orders a fixed quantity Q from its supplier every time its inventory position reaches a reorder point R. It is shown that (R, Q) policies are at least 76% effective. Numerical examples are provided to further illustrate the cost effectiveness of (R, Q) policies. © 2000 John Wiley & Sons, Inc. Naval Research Logistics 47: 422–439, 2000 相似文献