全文获取类型
收费全文 | 392篇 |
免费 | 204篇 |
国内免费 | 13篇 |
出版年
2024年 | 1篇 |
2023年 | 6篇 |
2022年 | 7篇 |
2021年 | 10篇 |
2020年 | 13篇 |
2019年 | 14篇 |
2018年 | 8篇 |
2017年 | 23篇 |
2016年 | 29篇 |
2015年 | 31篇 |
2014年 | 32篇 |
2013年 | 22篇 |
2012年 | 44篇 |
2011年 | 40篇 |
2010年 | 17篇 |
2009年 | 27篇 |
2008年 | 26篇 |
2007年 | 33篇 |
2006年 | 36篇 |
2005年 | 21篇 |
2004年 | 15篇 |
2003年 | 14篇 |
2002年 | 17篇 |
2001年 | 21篇 |
2000年 | 11篇 |
1999年 | 18篇 |
1998年 | 18篇 |
1997年 | 8篇 |
1996年 | 9篇 |
1995年 | 4篇 |
1994年 | 3篇 |
1993年 | 5篇 |
1992年 | 9篇 |
1991年 | 4篇 |
1990年 | 8篇 |
1989年 | 3篇 |
1988年 | 1篇 |
1987年 | 1篇 |
排序方式: 共有609条查询结果,搜索用时 31 毫秒
271.
Kyle Y. Lin 《海军后勤学研究》2014,61(1):56-65
Two forces engage in a duel, with each force initially consisting of several heterogeneous units. Each unit can be assigned to fire at any opposing unit, but the kill rate depends on the assignment. As the duel proceeds, each force—knowing which units are still alive in real time—decides dynamically how to assign its fire, in order to maximize the probability of wiping out the opposing force before getting wiped out. It has been shown in the literature that an optimal pure strategy exists for this two‐person zero‐sum game, but computing the optimal strategy remained cumbersome because of the game's huge payoff matrix. This article gives an iterative algorithm to compute the optimal strategy without having to enumerate the entire payoff matrix, and offers some insights into the special case, where one force has only one unit. © 2013 Wiley Periodicals, Inc. Naval Research Logistics 61: 56–65, 2014 相似文献
272.
张茜 《国防科技大学学报》2014,36(5)
基于小波树模型的压缩感知可以通过较少的观测量得到鲁棒的信号重构,但采用最优树逼近时存在复杂度大的问题。在证明分层后的小波树仍然具备连通树性质的基础上,提出了基于小波分层连通树结构的压缩重构算法,在与原观测量一致的情况下,保证了重构精度并且提高了重构效率。实验结果表明,改进算法相对于原算法在处理大尺度数据时,效率有明显改善。 相似文献
273.
铁路区间信号系统测试评估平台中数据采集和验证子系统研究移频信号的数据采集、A/D转换和信号显示,移频信号的处理是对被测系统发送和接收的移频信号的载频和调制低频鉴频鉴幅,进行验证,为测试评估平台对被测系统的功能、可靠性和安全性评估作必要的数据准备. 相似文献
274.
Kyle Y. Lin 《海军后勤学研究》2004,51(4):501-521
Consider a sequential dynamic pricing model where a seller sells a given stock to a random number of customers. Arriving one at a time, each customer will purchase one item if the product price is lower than her personal reservation price. The seller's objective is to post a potentially different price for each customer in order to maximize the expected total revenue. We formulate the seller's problem as a stochastic dynamic programming model, and develop an algorithm to compute the optimal policy. We then apply the results from this sequential dynamic pricing model to the case where customers arrive according to a continuous‐time point process. In particular, we derive tight bounds for the optimal expected revenue, and develop an asymptotically optimal heuristic policy. © 2004 Wiley Periodicals, Inc. Naval Research Logistics, 2004. 相似文献
275.
We analyze the moments of the random time required for a vehicle to traverse a transportation network link of arbitrary length when its speed is governed by a random environment. The problem is motivated by stochastic transportation network applications in which the estimation of travel time moments is of great importance. We analyze this random time in a transient and asymptotic sense by employing results from the field of fluid queues. The results are demonstrated on two example problems. © 2003 Wiley Periodicals, Inc. Naval Research Logistics, 2004 相似文献
276.
277.
研究一类具有随机时滞与随机干扰的离散型BAM神经网络的全局指数稳定性,所建模型同时考虑离散时滞变化区间与分布概率对稳定性的影响.通过构造新的Lyapunov泛函并结合线性矩阵不等式(LMI)方法,得到了均方意义下依赖于时滞分布的全局指数稳定性条件. 相似文献
278.
研究一类具有leakage时滞的随机马尔科夫跳变神经网络的稳定性,通过构造一个新的Lyapunov-Kra—sovskii泛函,并应用It6公式、随机不等式技术,得到了基于线性矩阵不等式(LMI)的均方意义下的全局稳定性判定条件. 相似文献
279.
The significance of integrating reliability into logistics performance has been established [The Logistics Performance Index and Its Indicators, World Bank International Trade and Transport Departments, (2010)]. Hence, as a response to the work by the World Bank, the present article aims to evaluate the performance index Rb,d of logistics systems as the probability that a specified demand d can be distributed successfully through multistate arc capacities from the source to the destination under the constraint that the total distribution cost should not exceed the cost limitation b. This article provides a pioneering approach for a straightforward computation of the performance index Rb,d. The proposed algorithm is a hybrid between the polynomial time capacity‐scaling algorithm, which was presented by Edmonds and Karp [JACM 19 (1972)], and the decomposition algorithm, which was presented by Jane and Laih [IEEE (2008)]. Currently, the proposed approach is the only algorithm that can directly compute Rb,d. An illustration of the proposed algorithm is presented. The results of the computational experiments indicate that the presented algorithm outperforms existing algorithms. © 2012 Wiley Periodicals, Inc. Naval Research Logistics, 2012 相似文献
280.
片内直流电压信号摆幅较小,且受到CMOS工艺中被动器件一致性较差、易被高频交流信号干扰等因素的影响,采用典型的比例放大电路难以放大这类信号.为此提出了一种基于“载频”的“电压→频率→电压”放大方法,使用载波信号作为片上长距离传输的信号,将易受到干扰的直流信号局部化,利用前馈补偿技术构建了具有高度线性转换关系的“电压→频率”调制电路,采用具有较高线性度的频率解调电路实现后级电压信号的解调,有效地放大片内直流电压信号.电路仿真结果表明,所提出的放大器电路能有效地放大片上电压信号,直流电压增益为2.4. 相似文献