全文获取类型
收费全文 | 799篇 |
免费 | 367篇 |
国内免费 | 75篇 |
出版年
2024年 | 5篇 |
2023年 | 5篇 |
2022年 | 4篇 |
2021年 | 19篇 |
2020年 | 11篇 |
2019年 | 21篇 |
2018年 | 15篇 |
2017年 | 57篇 |
2016年 | 73篇 |
2015年 | 46篇 |
2014年 | 76篇 |
2013年 | 86篇 |
2012年 | 58篇 |
2011年 | 83篇 |
2010年 | 52篇 |
2009年 | 64篇 |
2008年 | 41篇 |
2007年 | 69篇 |
2006年 | 53篇 |
2005年 | 49篇 |
2004年 | 55篇 |
2003年 | 24篇 |
2002年 | 31篇 |
2001年 | 37篇 |
2000年 | 39篇 |
1999年 | 33篇 |
1998年 | 15篇 |
1997年 | 20篇 |
1996年 | 13篇 |
1995年 | 11篇 |
1994年 | 20篇 |
1993年 | 20篇 |
1992年 | 12篇 |
1991年 | 10篇 |
1990年 | 8篇 |
1989年 | 3篇 |
1988年 | 2篇 |
1987年 | 1篇 |
排序方式: 共有1241条查询结果,搜索用时 31 毫秒
181.
带混合误差的Ishikawa迭代格式 总被引:1,自引:0,他引:1
将Ishikawa型迭代格式的收敛性问题推广到带混合误差的Ishikawa型迭代格式的情形 ,同时所用的证明方法和技巧有所改进 相似文献
182.
183.
184.
装备器材库温湿度监控系统的设计与实现 总被引:3,自引:0,他引:3
军用装备器材仓库温湿度监控是目前亟待解决的问题.文中详细地阐述了种切实可行的设计方法--主从式两级数字化监控系统的设计原理与实现方法,并用Borland C++Builder语言对其组态软件进行程序设计. 相似文献
185.
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. 相似文献
186.
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 相似文献
187.
后方油库整体生存概率分析计算 总被引:1,自引:1,他引:0
针对我军后方油库特点,探讨了油库整体生存概率计算的基本思路和方法,分析了各类分项目标生存概率的计算方法,采用层次分析对后方油库各分项目标权值进行了详细分析计算,可为后方油库伪装防护效能评估提供依据。 相似文献
188.
调频连续波具有较长的脉宽和较大的信号带宽,通常采用去调频的处理方式,但是,去调频的处理会引入空变的相位误差。从去调频的处理方式入手,根据发射信号相位误差缓变的特点,提出了依据发射信号相位误差模型补偿空变相位误差的方法,并在理论上对该方法进行了推导。该补偿方法分为两步,从差频信号中去除发射信号相位误差,在残余视频相位误差校正之后,通过与补偿函数相乘去除剩余的相位误差。仿真和实测的实验结果表明,该方法能够克服目标距离的限制,有效地补偿空变相位误差带来的影响,提高脉压水平。提出的误差补偿方法能够很好地平衡系统负载、误差补偿精度和算法开销,具有较强实用性。 相似文献
189.
This paper studies a queueing system with a Markov arrival process with marked arrivals and PH‐distribution service times for each type of customer. Customers (regardless of their types) are served on a mixed first‐come‐first‐served (FCFS) and last‐come‐first‐served (LCFS) nonpreemptive basis. That is, when the queue length is N (a positive integer) or less, customers are served on an FCFS basis; otherwise, customers are served on an LCFS basis. The focus is on the stationary distribution of queue strings, busy periods, and waiting times of individual types of customers. A computational approach is developed for computing the stationary distribution of queue strings, the mean of busy period, and the means and variances of waiting times. The relationship between these performance measures and the threshold number N is analyzed in depth numerically. It is found that the variance of the virtual (actual) waiting time of an arbitrary customer can be reduced by increasing N. © 2000 John Wiley & Sons, Inc. Naval Research Logistics 47: 399–421, 2000 相似文献
190.
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 相似文献