全文获取类型
收费全文 | 190篇 |
免费 | 20篇 |
国内免费 | 3篇 |
专业分类
213篇 |
出版年
2022年 | 1篇 |
2021年 | 2篇 |
2020年 | 8篇 |
2019年 | 11篇 |
2018年 | 21篇 |
2017年 | 19篇 |
2016年 | 15篇 |
2015年 | 5篇 |
2014年 | 11篇 |
2013年 | 43篇 |
2012年 | 9篇 |
2011年 | 7篇 |
2010年 | 5篇 |
2009年 | 6篇 |
2008年 | 9篇 |
2007年 | 7篇 |
2006年 | 7篇 |
2005年 | 4篇 |
2004年 | 4篇 |
2003年 | 3篇 |
2001年 | 4篇 |
2000年 | 1篇 |
1999年 | 2篇 |
1998年 | 1篇 |
1997年 | 1篇 |
1995年 | 2篇 |
1993年 | 3篇 |
1991年 | 1篇 |
1990年 | 1篇 |
排序方式: 共有213条查询结果,搜索用时 0 毫秒
1.
Carlos Martí Sempere 《Defence and Peace Economics》2018,29(3):225-246
This article surveys the body of available evidence regarding the spill-over effects of defence R&D. It reviews the routes through which defence R&D spills over to the economy with positive externalities – in terms of new products, technologies or processes; the barriers that impede or block such a process; potential negative repercussions, and the measure of such effects. The main conclusion is that the uncertainty of these effects, and the inaccurate appraisal of their value, hardly supports informed decisions concerning defence R&D policies. 相似文献
2.
Martijn van Ee 《海军后勤学研究》2020,67(2):147-158
We consider the salvo policy problem, in which there are k moments, called salvos, at which we can fire multiple missiles simultaneously at an incoming object. Each salvo is characterized by a probability pi: the hit probability of a single missile. After each salvo, we can assess whether the incoming object is still active. If it is, we fire the missiles assigned to the next salvo. In the salvo policy problem, the goal is to assign at most n missiles to salvos in order to minimize the expected number of missiles used. We consider three problem versions. In Gould's version, we have to assign all n missiles to salvos. In the Big Bomb version, a cost of B is incurred when all salvo's are unsuccessful. Finally, we consider the Quota version in which the kill probability should exceed some quota Q. We discuss the computational complexity and the approximability of these problem versions. In particular, we show that Gould's version and the Big Bomb version admit pseudopolynomial time exact algorithms and fully polynomial time approximation schemes. We also present an iterative approximation algorithm for the Quota version, and show that a related problem is NP-complete. 相似文献
3.
张碧凡 《中国人民武装警察部队学院学报》2005,21(1):84-86
目前高等教育中存在的种种弊端,迫使高等教育必须改革。高等教育决不能脱离党的教育方针,要强化世界观和价值观教育,远离社会不良风气的干扰,培养出德智体全面发展的人才。 相似文献
4.
R.E. Lillo 《海军后勤学研究》2001,48(3):201-209
An optimal operating policy is characterized for the infinite‐horizon average‐cost case of a single server queueing control problem. The server may be turned on at arrival epochs or off at departure epochs. Two classes of customers, each of them arriving according to an independent Poisson processes, are considered. An arriving 1‐customer enters the system if the server is turned on upon his arrival, or if the server is on and idle. In the former case, the 1‐customer is selected for service ahead of those customers waiting in the system; otherwise he leaves the system immediately. 2‐Customers remain in the system until they complete their service requirements. Under a linear cost structure, this paper shows that a stationary optimal policy exists such that either (1) leaves the server on at all times, or (2) turns the server off when the system is empty. In the latter case, we show that the stationary optimal policy is a threshold strategy, this feature being commonplace in most of priority queueing systems and inventory models. However, the optimal policy in our model is determined by two thresholds instead of one. © 2001 John Wiley & Sons, Inc. Naval Research Logistics 48: 201–209, 2001 相似文献
5.
In many practical multiserver queueing systems, servers not only serve randomly arriving customers but also work on the secondary jobs with infinite backlog during their idle time. In this paper, we propose a c‐server model with a two‐threshold policy, denoted by (e d), to evaluate the performance of this class of systems. With such a policy, when the number of idle servers has reached d (<c), then e (<d) idle agents will process secondary jobs. These e servers keep working on the secondary jobs until they find waiting customers exist in the system at a secondary job completion instant. Using the matrix analytic method, we obtain the stationary performance measures for evaluating different (e, d) policies. © 2006 Wiley Periodicals, Inc. Naval Research Logistics, 2007. 相似文献
6.
In this paper, two different kinds of (N, T)‐policies for an M/M/m queueing system are studied. The system operates only intermittently and is shut down when no customers are present any more. A fixed setup cost of K > 0 is incurred each time the system is reopened. Also, a holding cost of h > 0 per unit time is incurred for each customer present. The two (N, T)‐policies studied for this queueing system with cost structures are as follows: (1) The system is reactivated as soon as N customers are present or the waiting time of the leading customer reaches a predefined time T, and (2) the system is reactivated as soon as N customers are present or the time units after the end of the last busy period reaches a predefined time T. The equations satisfied by the optimal policy (N*, T*) for minimizing the long‐run average cost per unit time in both cases are obtained. Particularly, we obtain the explicit optimal joint policy (N*, T*) and optimal objective value for the case of a single server, the explicit optimal policy N* and optimal objective value for the case of multiple servers when only predefined customers number N is measured, and the explicit optimal policy T* and optimal objective value for the case of multiple servers when only predefined time units T is measured, respectively. These results partly extend (1) the classic N or T policy to a more practical (N, T)‐policy and (2) the conclusions obtained for single server system to a system consisting of m (m ≥ 1) servers. © 2000 John Wiley & Sons, Inc. Naval Research Logistics 47: 240–258, 2000 相似文献
7.
刘玉藏 《中国人民武装警察部队学院学报》2001,17(4):75-76
通过简要介绍消防网络的构成及功能,进行网络安全及需求分析,并结合消防办公信息网的实际恃况,提出制定安全对策的几种建议. 相似文献
8.
设备的一种计划维修策略 总被引:1,自引:0,他引:1
本文根据设备在全寿命内有事后修理、计划修理和最后报废的实际情况,以全寿命内单位时间的更新维修期望费用最少为目标函数,建立一种数学模型,寻求设备在全寿命内最佳计划修理次数N和最佳的一组计划维修时间间隔集T。 相似文献
9.
王兴晓 《中国人民武装警察部队学院学报》2008,24(7):31-34
刑事政策影响定罪,尤其是定罪政策。当前我国受贿罪的定罪政策是单向化犯罪。建构严密的受贿罪体系要求扩大受贿罪的对象,不能局限于“财物”,对“为他人谋取利益”重新定位,并且采用主从式立法方法建立完整的罪名体系。 相似文献
10.
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 相似文献