全文获取类型
收费全文 | 515篇 |
免费 | 145篇 |
国内免费 | 32篇 |
出版年
2024年 | 2篇 |
2023年 | 1篇 |
2022年 | 5篇 |
2021年 | 4篇 |
2020年 | 10篇 |
2019年 | 15篇 |
2018年 | 10篇 |
2017年 | 33篇 |
2016年 | 32篇 |
2015年 | 28篇 |
2014年 | 32篇 |
2013年 | 80篇 |
2012年 | 34篇 |
2011年 | 48篇 |
2010年 | 34篇 |
2009年 | 46篇 |
2008年 | 36篇 |
2007年 | 45篇 |
2006年 | 40篇 |
2005年 | 26篇 |
2004年 | 32篇 |
2003年 | 18篇 |
2002年 | 18篇 |
2001年 | 17篇 |
2000年 | 14篇 |
1999年 | 6篇 |
1998年 | 5篇 |
1997年 | 3篇 |
1996年 | 3篇 |
1995年 | 3篇 |
1994年 | 4篇 |
1993年 | 1篇 |
1992年 | 2篇 |
1991年 | 2篇 |
1990年 | 2篇 |
1975年 | 1篇 |
排序方式: 共有692条查询结果,搜索用时 531 毫秒
671.
克服多路径效应的自适应偏轴跟踪方法 总被引:1,自引:0,他引:1
在已有的偏轴跟踪方法的基础上,利用海情、目标距离、正交分量的误差电压及其变化,自适应地进行偏轴跟踪,以达到用普通单脉冲雷达精确地跟踪超低空飞行海上目标的目的. 相似文献
672.
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 相似文献
673.
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 相似文献
674.
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 相似文献
675.
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 相似文献
676.
677.
678.
679.
多目标跟踪问题通常包括目标信号的检测与目标状态的估计,同时还涉及到对探测范围内目标数量的确定。传统的跟踪方法将目标检测、状态估计与数量确定分别使用独立的模块或算法来处理。在这种模式下,每个模块仅考虑测量数据中与其功能直接相关的信息,模块之间没有信息的交互,因而很难得到全局最优的解。基于随机集理论的多目标跟踪方法将场景内的全部目标看作一个全局变量,目标状态与目标测量分别构成各自的随机有限集。从而多目标跟踪问题可以放在一个随机集模型下的贝叶斯滤波框架中研究。在每一个滤波周期内,通过对随机集的处理,实时地估计目标的数量、状态与类型,实现多目标的联合检测、跟踪与识别。 相似文献
680.