全文获取类型
收费全文 | 658篇 |
免费 | 150篇 |
国内免费 | 20篇 |
出版年
2024年 | 1篇 |
2023年 | 4篇 |
2022年 | 6篇 |
2021年 | 11篇 |
2020年 | 14篇 |
2019年 | 32篇 |
2018年 | 17篇 |
2017年 | 53篇 |
2016年 | 50篇 |
2015年 | 38篇 |
2014年 | 44篇 |
2013年 | 107篇 |
2012年 | 37篇 |
2011年 | 43篇 |
2010年 | 40篇 |
2009年 | 41篇 |
2008年 | 33篇 |
2007年 | 48篇 |
2006年 | 34篇 |
2005年 | 29篇 |
2004年 | 33篇 |
2003年 | 19篇 |
2002年 | 22篇 |
2001年 | 20篇 |
2000年 | 21篇 |
1999年 | 7篇 |
1998年 | 5篇 |
1997年 | 4篇 |
1996年 | 4篇 |
1995年 | 4篇 |
1994年 | 1篇 |
1993年 | 2篇 |
1992年 | 1篇 |
1990年 | 2篇 |
1988年 | 1篇 |
排序方式: 共有828条查询结果,搜索用时 93 毫秒
781.
Ilmari Käihkö 《Small Wars & Insurgencies》2013,24(2):248-270
In 1999, rebels rose to oppose the newly elected former warlord Charles Taylor in Liberia. Motivated by a variety of reasons, the minimal common denominator of these rebels, who assumed the name Liberians United for Reconciliation and Democracy (LURD), was that Charles Taylor must leave the country. The decentralized nature of LURD though stands out in their struggle, as they don't fit the unitary actor assumed by literature on strategy, nor the alternative conception of decentralized forces fighting for purely local reasons. Understanding such aberrations as LURD is the first step to finding strategies that can incorporate and manage them. 相似文献
782.
本文研究了节点负载处理能力异质条件下的无标度网络交通动力学过程,提出了一种基于节点资源利用率的全局动态路由策略。该策略利用网络中节点资源利用率构建了一种全局代价函数,选择使该代价函数最小的路径来传输负载。实验结果表明该路由策略在略微增加平均路径长度的情况下成倍地提高了网络负载传输能力,与有效路由策略的比较进一步验证了该策略的有效性。 相似文献
783.
784.
于冬梅 《中国人民武装警察部队学院学报》2013,(11):77-79
通过探讨一例多元案例教学法的教学理念、设计策略、实施方法和过程,解决程序设计课程教学不能点、线、面融合,缺少培养学员设计综合应用程序能力的方法和手段,学员学习目标不明确、缺乏学习兴趣等问题,以有效提高教学效果和质量. 相似文献
785.
马云飞 《中国人民武装警察部队学院学报》2013,(12):37-39
近年来,大型商业性建筑火灾事故时有发生,造成了重大损失,火灾发生时如何提高人员的疏散效率是降低伤亡率的要素.通过对大型商业性建筑火灾危险性和疏散中存在的问题进行分析,结合实际从设置消防救援窗,严格划分防火分区,合理设置疏散楼梯和安全出口,制定安全疏散预案,加强消防安全培训,充分利用声光报警等方面论述了优化大型商业性建筑人员疏散效率的策略. 相似文献
786.
针对传统捕捉概率模型难以满足远程反舰导弹机动搜捕概率建模计算的问题,提出利用搜索论进行导弹机动搜捕概率计算的建模方法。该方法根据目标机动规律建立其分布概率密度函数,并依据末制导雷达发现目标概率的"倒四次方律"及弹目相对运动轨迹,构建其探测函数,通过求取两者之积的积分实现搜捕概率计算。计算结果显示:若远程反舰导弹不采取机动搜捕策略,目标指示误差增加1km时搜捕概率降低0.47,目标速度增加10节时搜捕概率降低0.3,末制导雷达搜索半径减小50%时搜捕概率降低0.3;若采取平行搜捕策略,上述因素对其影响大幅下降。可见,该方法综合考虑了目标机动规律、传感器探测规律、导弹搜捕策略,可实现远程反舰导弹机动搜捕概率的解算。 相似文献
787.
Using a birth‐and‐death process to estimate the steady‐state distribution of a periodic queue
下载免费PDF全文
![点击此处可从《海军后勤学研究》网站下载免费的PDF全文](/ch/ext_images/free.gif)
If the number of customers in a queueing system as a function of time has a proper limiting steady‐state distribution, then that steady‐state distribution can be estimated from system data by fitting a general stationary birth‐and‐death (BD) process model to the data and solving for its steady‐state distribution using the familiar local‐balance steady‐state equation for BD processes, even if the actual process is not a BD process. We show that this indirect way to estimate the steady‐state distribution can be effective for periodic queues, because the fitted birth and death rates often have special structure allowing them to be estimated efficiently by fitting parametric functions with only a few parameters, for example, 2. We focus on the multiserver Mt/GI/s queue with a nonhomogeneous Poisson arrival process having a periodic time‐varying rate function. We establish properties of its steady‐state distribution and fitted BD rates. We also show that the fitted BD rates can be a useful diagnostic tool to see if an Mt/GI/s model is appropriate for a complex queueing system. © 2015 Wiley Periodicals, Inc. Naval Research Logistics 62: 664–685, 2015 相似文献
788.
Inventory models with nonlinear shortage costs and stochastic lead times; applications of shape properties of randomly stopped counting processes
下载免费PDF全文
![点击此处可从《海军后勤学研究》网站下载免费的PDF全文](/ch/ext_images/free.gif)
In this article, we study generalizations of some of the inventory models with nonlinear costs considered by Rosling in (Oper. Res. 50 (2002) 797–809). In particular, we extend the study of both the periodic review and the compound renewal demand processes from a constant lead time to a random lead time. We find that the quasiconvexity properties of the cost function (and therefore the existence of optimal (s, S) policies), holds true when the lead time has suitable log‐concavity properties. The results are derived by structural properties of renewal delayed processes stopped at an independent random time and by the study of log‐concavity properties of compound distributions. © 2015 Wiley Periodicals, Inc. Naval Research Logistics 62: 345–356, 2015 相似文献
789.
Integrated scheduling of loading and transportation with tractors and semitrailers separated
下载免费PDF全文
![点击此处可从《海军后勤学研究》网站下载免费的PDF全文](/ch/ext_images/free.gif)
Motivated by some practical applications, we study a new integrated loading and transportation scheduling problem. Given a set of jobs, a single crane is available to load jobs, one by one, onto semitrailers with a given capacity. Loaded semitrailers are assigned to tractors for transportation tasks. Subject to limited resources (crane, semitrailers, and tractors), the problem is to determine (1) an assignment of jobs to semitrailers for loading tasks, (2) a sequence for the crane to load jobs onto semitrailers, (3) an assignment of loaded semitrailers to tractors for transportation tasks, and (4) a transportation schedule of assigned tractors such that the completion time of the last transportation task is minimized. We first formulate the problem as a mixed integer linear programming model (MILPM) and prove that the problem is strongly NP‐hard. Then, optimality properties are provided which are useful in establishing an improved MILPM and designing solution algorithms. We develop a constructive heuristic, two LP‐based heuristics, and a recovering beam search heuristic to solve this problem. An improved procedure for solutions by heuristics is also presented. Furthermore, two branch‐and‐bound (B&B) algorithms with two different lower bounds are developed to solve the problem to optimality. Finally, computational experiments using both real data and randomly generated data demonstrate that our heuristics are highly efficient and effective. In terms of computational time and the number of instances solved to optimality in a time limit, the B&B algorithms are better than solving the MILPM. © 2015 Wiley Periodicals, Inc. Naval Research Logistics 62: 416–433, 2015 相似文献
790.
In Assemble‐To‐Order (ATO) systems, situations may arise in which customer demand must be backlogged due to a shortage of some components, leaving available stock of other components unused. Such unused component stock is called remnant stock. Remnant stock is a consequence of both component ordering decisions and decisions regarding allocation of components to end‐product demand. In this article, we examine periodic‐review ATO systems under linear holding and backlogging costs with a component installation stock policy and a First‐Come‐First‐Served (FCFS) allocation policy. We show that the FCFS allocation policy decouples the problem of optimal component allocation over time into deterministic period‐by‐period optimal component allocation problems. We denote the optimal allocation of components to end‐product demand as multimatching. We solve the multi‐matching problem by an iterative algorithm. In addition, an approximation scheme for the joint replenishment and allocation optimization problem with both upper and lower bounds is proposed. Numerical experiments for base‐stock component replenishment policies show that under optimal base‐stock policies and optimal allocation, remnant stock holding costs must be taken into account. Finally, joint optimization incorporating optimal FCFS component allocation is valuable because it provides a benchmark against which heuristic methods can be compared. © 2015 Wiley Periodicals, Inc. Naval Research Logistics 62: 158–169, 2015 相似文献