全文获取类型
收费全文 | 336篇 |
免费 | 95篇 |
国内免费 | 26篇 |
出版年
2024年 | 2篇 |
2022年 | 6篇 |
2021年 | 2篇 |
2020年 | 14篇 |
2019年 | 13篇 |
2018年 | 24篇 |
2017年 | 26篇 |
2016年 | 25篇 |
2015年 | 14篇 |
2014年 | 25篇 |
2013年 | 56篇 |
2012年 | 29篇 |
2011年 | 20篇 |
2010年 | 14篇 |
2009年 | 17篇 |
2008年 | 22篇 |
2007年 | 23篇 |
2006年 | 20篇 |
2005年 | 18篇 |
2004年 | 18篇 |
2003年 | 13篇 |
2002年 | 6篇 |
2001年 | 7篇 |
2000年 | 8篇 |
1999年 | 4篇 |
1998年 | 3篇 |
1997年 | 4篇 |
1996年 | 6篇 |
1995年 | 4篇 |
1993年 | 5篇 |
1992年 | 2篇 |
1991年 | 4篇 |
1990年 | 2篇 |
1989年 | 1篇 |
排序方式: 共有457条查询结果,搜索用时 15 毫秒
31.
基于小偏差理论,对无摄三体动力学方程沿标称轨道线性化,推导了三体动力模型的误差线性模型。在此基础上,进一步利用该最优控制方法推导了转移轨道周期内的连续小推力控制方案,验证了控制加速度及状态量的收敛。同时针对整周期控制方式在超调后状态量收敛速度慢的问题,通过分段连续推力控制模式(Segm en ta l Con tinuous T hrust Con tro l,SCTC)来近似瞬时脉冲推力控制模式,并给出了最短分段控制时间的计算方法。实验表明,SCTC模式加快了轨道状态的收敛速度。对于km级入轨偏差,通过1次控制即可使实际轨道收敛至标称轨道。 相似文献
32.
We consider the problem of nonparametric multi-product dynamic pricing with unknown demand and show that the problem may be formulated as an online model-free stochastic program, which can be solved by the classical Kiefer-Wolfowitz stochastic approximation (KWSA) algorithm. We prove that the expected cumulative regret of the KWSA algorithm is bounded above by where κ1, κ2 are positive constants and T is the number of periods for any T = 1, 2, … . Therefore, the regret of the KWSA algorithm grows in the order of , which achieves the lower bounds known for parametric dynamic pricing problems and shows that the nonparametric problems are not necessarily more difficult to solve than the parametric ones. Numerical experiments further demonstrate the effectiveness and efficiency of our proposed KW pricing policy by comparing with some pricing policies in the literature. 相似文献
33.
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 相似文献
34.
Let X and Xτ denote the lifetime and the residual life at age τ of a system, respectively. X is said to be a NBUL random variable if Xτ is smaller than X in Laplace order, i.e., Xτ ≤L X. We obtain some characterizations for this class of life distribution by means of the lifetime of a series system and the residual life at random time. We also discuss preservation properties for this class of life distribution under shock models. Finally, under the assumption that the lifetimes have the NBUL property, we make stochastic comparisons between some basic replacement policies. © 2001 John Wiley & Sons, Inc. Naval Research Logistics 48: 578–591, 2001. 相似文献
35.
刘玉藏 《中国人民武装警察部队学院学报》2001,17(4):75-76
通过简要介绍消防网络的构成及功能,进行网络安全及需求分析,并结合消防办公信息网的实际恃况,提出制定安全对策的几种建议. 相似文献
36.
火力运用对策空间模型 总被引:1,自引:0,他引:1
根据空 -地作战的特点 ,提出了软、硬火力单位的概念 ,根据模型提出了作战指数、生存指数 ,为双方的实力与“保卫目标”的安全度分析提供了数量依据 ;根据微分对策和战术原则提出了规范作战模式等概念 ,为构造火力运用、兵力数量需求等算法搭起一个框架。 相似文献
37.
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 相似文献
38.
编队构形设计是分布式干涉SAR系统总体设计的关键问题,它必须紧密结合系统性能评价和编队运动规律进行。针对星载分布式干涉SAR的双站、斜视、空间基线等特点,以主星带辅星群分布式InSAR为例,建立干涉测高精度与基线矢量的关系;以直角坐标过渡,建立基线矢量与卫星间轨道根数差的关系,从而建立了测高精度与卫星轨道根数差的关系;以雷达工作的中间时刻达到测高精度最优值为设计准则,得到双星和多星编队设计方法;仿真分析表明根据上述设计方法得到的优化编队构形,其测高性能要优于干涉车轮和干涉钟摆编队。 相似文献
39.
Consider a threshold control policy for an imperfect production system with only a work center handling both regular and rework jobs. An imperfect production system studied here, generates defect jobs by factors other than machine failures. A threshold control or (ω, s) policy sets the guideline for a work center to switch between regular and rework jobs. A production cycle begins with loading and processing of several batches of regular jobs with a lot size equal to s. The outcome of each completed regular job is an independent Bernoulli trial with three possibilities: good, rework, or scrap. Once the work center accumulates more than a threshold ω of rework jobs, it finishes the last batch of regular jobs and switches to rework jobs. The objective of this research is to find a threshold ω and a lot size s that maximize the average long‐term profit. The ultimate goal is to construct a simple algorithm to search for ω and s that can be implemented directly in production management systems, as a result of this work. © 1999 John Wiley & Sons, Inc. Naval Research Logistics 46: 273–301, 1999 相似文献
40.
在分析基于格理论的信息流控制军用安全模型在实际应用中存在的不足的基础上,从安全类定义和信息流控制策略两个方面对原模型进行了理论扩展和安全性分析.扩展模型安全类在作为对象和主体时具有相同的表达方式,以及在保持原模型信息流关系情况下,允许同职权等级用户交流他们共知的信息,以及高职权等级用户访问低职权等级用户他们之间共知的信息.以数字文档安全管理系统为例对扩展模型应用进行了描述.实例表明扩展模型更适合实际系统对信息流控制的要求. 相似文献