全文获取类型
| 收费全文 | 553篇 |
| 免费 | 8篇 |
| 国内免费 | 1篇 |
专业分类
| 562篇 |
出版年
| 2024年 | 3篇 |
| 2023年 | 4篇 |
| 2022年 | 4篇 |
| 2021年 | 26篇 |
| 2020年 | 10篇 |
| 2019年 | 2篇 |
| 2018年 | 7篇 |
| 2017年 | 13篇 |
| 2016年 | 5篇 |
| 2015年 | 12篇 |
| 2014年 | 10篇 |
| 2013年 | 22篇 |
| 2012年 | 15篇 |
| 2011年 | 15篇 |
| 2010年 | 20篇 |
| 2009年 | 34篇 |
| 2008年 | 35篇 |
| 2007年 | 27篇 |
| 2006年 | 17篇 |
| 2005年 | 14篇 |
| 2004年 | 10篇 |
| 2003年 | 3篇 |
| 2002年 | 2篇 |
| 2001年 | 5篇 |
| 2000年 | 24篇 |
| 1999年 | 48篇 |
| 1998年 | 22篇 |
| 1997年 | 31篇 |
| 1996年 | 29篇 |
| 1995年 | 15篇 |
| 1994年 | 20篇 |
| 1993年 | 14篇 |
| 1992年 | 11篇 |
| 1991年 | 9篇 |
| 1990年 | 8篇 |
| 1989年 | 5篇 |
| 1988年 | 3篇 |
| 1987年 | 1篇 |
| 1986年 | 3篇 |
| 1985年 | 1篇 |
| 1983年 | 2篇 |
| 1982年 | 1篇 |
排序方式： 共有562条查询结果，搜索用时 0 毫秒
81.
82.
83.
西南边防部队驻防于我国西南边境地区,西起西藏自治区的日土县,东至广西壮族自治区的防城港市,担负着边防管控和边境防御作战等重要职能,在捍卫国家主权和安全中地位作用十分特殊。随着军队调整改革的深入落实,西南边防部队正处于转型重塑的关键时期,必须紧紧围绕新形势、新体制、新职能,着眼应急指挥、军事训练、边境管控、内外环境等关键要素和现实问题,在求\"变\"中推进创新发展,不断提升履职能力,切实为捍卫国家领土主权完整和维护边境稳定提供坚强保证。 相似文献
84.
85.
Under quasi‐hyperbolic discounting, the valuation of a payoff falls relatively rapidly for earlier delay periods, but then falls more slowly for longer delay periods. When the salespersons with quasi‐hyperbolic discounting consider the product sale problem, they would exert less effort than their early plan, thus resulting in losses of future profit. We propose a winner‐takes‐all competition to alleviate the above time inconsistent behaviors of the salespersons, and allow the company to maximize its revenue by choosing an optimal bonus. To evaluate the effects of the competition scheme, we define the group time inconsistency degree of the salespersons, which measures the consequence of time inconsistent behaviors, and two welfare measures, the group welfare of the salespersons and the company revenue. We show that the competition always improves the group welfare and the company revenue as long as the company chooses to run the competition in the first place. However, the effect on group time inconsistency degree is mixed. When the optimal bonus is moderate (extreme high), the competition motivates (over‐motivates) the salesperson to work hard, thus alleviates (worsens) the time inconsistent behaviors. © 2017 Wiley Periodicals, Inc. Naval Research Logistics 64: 357–372, 2017 相似文献
86.
87.
The evaluation index of camouflage patterns is important in the field of military application. It is the goal that researchers have always pursued to make the computable evaluation indicators more in line with the human visual mechanism. In order to make the evaluation method more computationally intelligent, a Multi-Feature Camouflage Fused Index (MF-CFI) is proposed based on the comparison of grayscale, color and texture features between the target and the background. In order to verify the effectiveness of the proposed index, eye movement experiments are conducted to compare the proposed index with existing indexes including Universal Image Quality Index (UIQI), Camouflage Similarity Index (CSI) and Structural Similarity (SSIM). Twenty-four different simulated targets are designed in a grassland background, 28 observers participate in the experiment and record the eye movement data during the observation process. The results show that the highest Pearson correlation coefficient is observed between MF-CFI and the eye movement data, both in the designed digital camouflage patterns and large-spot camouflage patterns. Since MF-CFI is more in line with the detection law of camouflage targets in human visual perception, the proposed index can be used for the comparison and parameter optimization of camouflage design algorithms. 相似文献
88.
This article studies a min‐max path cover problem, which is to determine a set of paths for k capacitated vehicles to service all the customers in a given weighted graph so that the largest path cost is minimized. The problem has wide applications in vehicle routing, especially when the minimization of the latest service completion time is a critical performance measure. We have analyzed four typical variants of this problem, where the vehicles have either unlimited or limited capacities, and they start from either a given depot or any depot of a given depot set. We have developed approximation algorithms for these four variants, which achieve approximation ratios of max{3 ‐ 2/k,2}, 5, max{5 ‐ 2/k,4}, and 7, respectively. We have also analyzed the approximation hardness of these variants by showing that, unless P = NP , it is impossible for them to achieve approximation ratios less than 4/3, 3/2, 3/2, and 2, respectively. We have further extended the techniques and results developed for this problem to other min‐max vehicle routing problems.© 2010 Wiley Periodicals, Inc. Naval Research Logistics, 2010 相似文献
89.
We consider a finite horizon periodic review, single product inventory system with a fixed setup cost and two stochastic demand classes that differ in their backordering costs. In each period, one must decide whether and how much to order, and how much demand of the lower class should be satisfied. We show that the optimal ordering policy can be characterized as a state dependent (s,S) policy, and the rationing structure is partially obtained based on the subconvexity of the cost function. We then propose a simple heuristic rationing policy, which is easy to implement and close to optimal for intensive numerical examples. We further study the case when the first demand class is deterministic and must be satisfied immediately. We show the optimality of the state dependent (s,S) ordering policy, and obtain additional rationing structural properties. Based on these properties, the optimal ordering and rationing policy for any state can be generated by finding the optimal policy of only a finite set of states, and for each state in this set, the optimal policy is obtained simply by choosing a policy from at most two alternatives. An efficient algorithm is then proposed. © 2010 Wiley Periodicals, Inc. Naval Research Logistics, 2010 相似文献
90.