全文获取类型
收费全文 | 694篇 |
免费 | 271篇 |
国内免费 | 38篇 |
出版年
2024年 | 1篇 |
2023年 | 8篇 |
2022年 | 9篇 |
2021年 | 9篇 |
2020年 | 17篇 |
2019年 | 19篇 |
2018年 | 7篇 |
2017年 | 37篇 |
2016年 | 54篇 |
2015年 | 40篇 |
2014年 | 52篇 |
2013年 | 61篇 |
2012年 | 63篇 |
2011年 | 67篇 |
2010年 | 37篇 |
2009年 | 51篇 |
2008年 | 55篇 |
2007年 | 50篇 |
2006年 | 55篇 |
2005年 | 48篇 |
2004年 | 56篇 |
2003年 | 40篇 |
2002年 | 33篇 |
2001年 | 21篇 |
2000年 | 28篇 |
1999年 | 16篇 |
1998年 | 15篇 |
1997年 | 12篇 |
1996年 | 10篇 |
1995年 | 6篇 |
1994年 | 7篇 |
1993年 | 7篇 |
1992年 | 1篇 |
1991年 | 5篇 |
1990年 | 3篇 |
1989年 | 2篇 |
1988年 | 1篇 |
排序方式: 共有1003条查询结果,搜索用时 15 毫秒
91.
基于自适应累量算法的舰船轴频电场信号检测方法 总被引:1,自引:0,他引:1
提出一种新的舰船轴频电场信号检测方法.该方法利用高阶累量对高斯噪声的抑制作用,首先使用基于自适应累量算法的FIR滤波器对接收信号进行滤波消噪处理,以提高信噪比;然后再对滤波输出信号进行滑动功率谱检测.实测数据处理结果表明了该方法的稳健性和有效性. 相似文献
92.
提出并研究了布尔函数的Walsh谱绝对值分布.指出布尔函数Walsh谱绝对值分布在仿射变换下的不变性,计算了n(n≤5)元布尔函数的Walsh谱绝对值分布,研究了Walsh谱绝对值分布与Walsh谱支撑和Walsh谱中非零取值个数以及其他一些密码学难题的联系,最后研究了布尔函数的Walsh谱绝对值分布的大小. 相似文献
93.
薛志群 《军械工程学院学报》1998,(3)
在一致光滑的Banach空间,证明了满足不等式‖Tx≤C ‖x‖的一类非线性强增生算子的Mann迭代序列强收敛于Tx=f的唯一解。 相似文献
94.
95.
Pirja Heiskanen 《海军后勤学研究》2001,48(3):210-225
In this paper a constraint proposal method is developed for computing Pareto‐optimal solutions in multiparty negotiations over continuous issues. Constraint proposal methods have been previously studied in a case where the decision set is unconstrained. Here we extend the method to situations with a constrained decision set. In the method the computation of the Pareto‐optimal solutions is decentralized so that the DMs do not have to know each others' value functions. During the procedure they have to indicate their optimal solutions on different sets of linear constraints. When the optimal solutions coincide, the common optimum is a candidate for a Pareto‐optimal point. The constraint proposal method can be used to generate either one Pareto‐optimal solution dominating the status quo solution or several Pareto‐optimal solutions. In latter case a distributive negotiation among the efficient points can be carried out afterwards. © 2001 John Wiley & Sons, Inc. Naval Research Logistics 48: 210–225, 2001 相似文献
96.
后方油库整体生存概率分析计算 总被引:1,自引:1,他引:0
针对我军后方油库特点,探讨了油库整体生存概率计算的基本思路和方法,分析了各类分项目标生存概率的计算方法,采用层次分析对后方油库各分项目标权值进行了详细分析计算,可为后方油库伪装防护效能评估提供依据。 相似文献
97.
针对VARI-METRIC模型在低可用度下结果不准确的问题,建立基于生灭过程的任意等级、任意层级可修件库存优化模型。通过对各级站点、各类备件需求率与到达率的预测,对每个部件建立其生灭过程模型,并提出基于生灭过程的装备可用度计算方法。以整个保障系统的装备可用度为约束指标,以备件总购置费最低为目标,利用边际算法得到最优备件配置方案,并建立仿真模型对所得优化方案进行评估与调整。结合算例,以仿真结果作为检验标准,选取权威的VMETRIC软件与该解析模型在优化性能、计算精度及适用性上进行对比和说明。结果表明,无论是解析模型还是VMETRIC软件,均存在一定的适用范围,而采用解析与仿真相结合的方法无疑具有更强的适应性。 相似文献
98.
This paper studies a queueing system with a Markov arrival process with marked arrivals and PH‐distribution service times for each type of customer. Customers (regardless of their types) are served on a mixed first‐come‐first‐served (FCFS) and last‐come‐first‐served (LCFS) nonpreemptive basis. That is, when the queue length is N (a positive integer) or less, customers are served on an FCFS basis; otherwise, customers are served on an LCFS basis. The focus is on the stationary distribution of queue strings, busy periods, and waiting times of individual types of customers. A computational approach is developed for computing the stationary distribution of queue strings, the mean of busy period, and the means and variances of waiting times. The relationship between these performance measures and the threshold number N is analyzed in depth numerically. It is found that the variance of the virtual (actual) waiting time of an arbitrary customer can be reduced by increasing N. © 2000 John Wiley & Sons, Inc. Naval Research Logistics 47: 399–421, 2000 相似文献
99.
Fangruo Chen 《海军后勤学研究》2000,47(5):422-439
Consider a distribution system with a central warehouse and multiple retailers. Customer demand arrives at each of the retailers continuously at a constant rate. The retailers replenish their inventories from the warehouse which in turn orders from an outside supplier with unlimited stock. There are economies of scale in replenishing the inventories at both the warehouse and the retail level. Stockouts at the retailers are backlogged. The system incurs holding and backorder costs. The objective is to minimize the long‐run average total cost in the system. This paper studies the cost effectiveness of (R, Q) policies in the above system. Under an (R, Q) policy, each facility orders a fixed quantity Q from its supplier every time its inventory position reaches a reorder point R. It is shown that (R, Q) policies are at least 76% effective. Numerical examples are provided to further illustrate the cost effectiveness of (R, Q) policies. © 2000 John Wiley & Sons, Inc. Naval Research Logistics 47: 422–439, 2000 相似文献
100.
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 相似文献