全文获取类型
收费全文 | 532篇 |
免费 | 104篇 |
国内免费 | 10篇 |
出版年
2024年 | 1篇 |
2022年 | 7篇 |
2021年 | 4篇 |
2020年 | 4篇 |
2019年 | 13篇 |
2018年 | 6篇 |
2017年 | 19篇 |
2016年 | 29篇 |
2015年 | 24篇 |
2014年 | 27篇 |
2013年 | 82篇 |
2012年 | 25篇 |
2011年 | 42篇 |
2010年 | 40篇 |
2009年 | 33篇 |
2008年 | 34篇 |
2007年 | 39篇 |
2006年 | 37篇 |
2005年 | 29篇 |
2004年 | 31篇 |
2003年 | 19篇 |
2002年 | 33篇 |
2001年 | 25篇 |
2000年 | 16篇 |
1999年 | 7篇 |
1998年 | 6篇 |
1997年 | 6篇 |
1994年 | 4篇 |
1993年 | 2篇 |
1991年 | 1篇 |
1990年 | 1篇 |
排序方式: 共有646条查询结果,搜索用时 15 毫秒
71.
为了得到横向效应增强型弹(Penetration with Enhanced Lateral Efficiency projectile, PELE)对金属薄靶垂直侵彻后的弹体轴向剩余速度,运用平面冲击波理论,对PELE的侵彻机理进行分析。参照平头弹体对靶板的侵彻模型,将PELE侵彻过程中的能量损失划分为以下几个部分:外壳体和内芯撞靶区域对应的环形塞块获得的能量、冲击波作用下弹体的内能增量以及剪切耗能等。然后根据能量守恒原理,得到PELE垂直侵彻金属薄靶后的PELE弹体轴向剩余速度的理论模型。为了验证该模型的合理性和准确性,设计相应的试验进行验证。结果表明,不同条件下得到的试验结果和理论模型得到的计算结果均吻合得较好。因此,得到的PELE垂直侵彻薄靶的轴向剩余速度理论模型可为工程应用提供指导和参考。 相似文献
72.
We consider supply chain coordination in which a manufacturer supplies some product to multiple heterogeneous retailers and wishes to coordinate the supply chain via wholesale price and holding cost subsidy. The retail price is either exogenous or endogenous. The market demand is described by the market share attraction model based on all retailers'shelf‐spaces and retail prices. We obtain optimal solutions for the centralized supply chain, where the optimal retail pricing is a modified version of the well‐known cost plus pricing strategy. We further get feasible contracts for the manufacturer to coordinate the hybrid and decentralized supply chains. The manufacturer can allocate the total profit free to himself and the retail market via the wholesale price when the retail price is exogenous, but otherwise he cannot. Finally, we point out that different characteristics of the retail market are due to different powers of the manufacturer, and the more power the manufacturer has, the simpler the contract to coordinate the chain will be. © 2010 Wiley Periodicals, Inc. Naval Research Logistics, 2010 相似文献
73.
In this article, we consider a classic dynamic inventory control problem of a self‐financing retailer who periodically replenishes its stock from a supplier and sells it to the market. The replenishment decisions of the retailer are constrained by cash flow, which is updated periodically following purchasing and sales in each period. Excess demand in each period is lost when insufficient inventory is in stock. The retailer's objective is to maximize its expected terminal wealth at the end of the planning horizon. We characterize the optimal inventory control policy and present a simple algorithm for computing the optimal policies for each period. Conditions are identified under which the optimal control policies are identical across periods. We also present comparative statics results on the optimal control policy. © 2008 Wiley Periodicals, Inc. Naval Research Logistics 2008 相似文献
74.
This article presents new tools and methods for finding optimum step‐stress accelerated life test plans. First, we present an approach to calculate the large‐sample approximate variance of the maximum likelihood estimator of a quantile of the failure time distribution at use conditions from a step‐stress accelerated life test. The approach allows for multistep stress changes and censoring for general log‐location‐scale distributions based on a cumulative exposure model. As an application of this approach, the optimum variance is studied as a function of shape parameter for both Weibull and lognormal distributions. Graphical comparisons among test plans using step‐up, step‐down, and constant‐stress patterns are also presented. The results show that depending on the values of the model parameters and quantile of interest, each of the three test plans can be preferable in terms of optimum variance. © 2008 Wiley Periodicals, Inc. Naval Research Logistics, 2008 相似文献
75.
模糊信息的信息量及其计算 总被引:2,自引:0,他引:2
定义了有关信息的基本概念 ,给出了一种关于位置的模糊信息即闭区间 [a ,b]上模糊数的信息量计算公式 ,讨论了模糊数信息量的性质 ,最后介绍了在模糊层次分析的比较判断矩阵构造中的算例 相似文献
76.
分布式系统仿真技术研究及其实现 总被引:4,自引:1,他引:3
以舰炮武器系统全数字仿真为例 ,讨论了分布式仿真系统的设计过程 ,提出了仿真系统的体系结构、网络通信方案、多任务并发控制等分布式仿真中关键问题的解决方法 相似文献
77.
78.
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. 相似文献
79.
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 相似文献
80.
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 相似文献