全文获取类型
收费全文 | 337篇 |
免费 | 156篇 |
国内免费 | 22篇 |
出版年
2023年 | 3篇 |
2022年 | 5篇 |
2021年 | 10篇 |
2020年 | 6篇 |
2019年 | 12篇 |
2018年 | 7篇 |
2017年 | 26篇 |
2016年 | 23篇 |
2015年 | 16篇 |
2014年 | 28篇 |
2013年 | 21篇 |
2012年 | 15篇 |
2011年 | 23篇 |
2010年 | 20篇 |
2009年 | 32篇 |
2008年 | 25篇 |
2007年 | 23篇 |
2006年 | 26篇 |
2005年 | 25篇 |
2004年 | 25篇 |
2003年 | 16篇 |
2002年 | 13篇 |
2001年 | 18篇 |
2000年 | 17篇 |
1999年 | 13篇 |
1998年 | 9篇 |
1997年 | 8篇 |
1996年 | 8篇 |
1995年 | 5篇 |
1994年 | 1篇 |
1993年 | 6篇 |
1992年 | 5篇 |
1991年 | 7篇 |
1990年 | 8篇 |
1989年 | 7篇 |
1988年 | 2篇 |
1987年 | 1篇 |
排序方式: 共有515条查询结果,搜索用时 31 毫秒
31.
为使线性调频连续波 (L FMCW)雷达能获得理论上的高测距精度和距离分辨力 ,在工程应用中对其性能的限制因素倍受关注 ,其中发射信道的非线性放大失真将引起 L FMCW信号功率谱产生边带杂散 ,是限制 L FMCW雷达测距精度和距离分辨力的重要因素之一。依据 L FMCW雷达回波功率谱特性 ,从工程应用角度分析了这种信号功率谱边带杂散对 L FM-CW雷达测距精度和距离分辨力的影响 ,为实现高性能系统设计 ,确定合理的实施方案和相关的技术指标及后续的校正处理提供了理论依据。 相似文献
32.
提出应用线阵CCD技术测量飞行弹丸攻角 ,建立了测量飞行弹丸攻角的计算方法。实际测量结果表明应用单个线阵CCD可以测量飞行弹丸的一个攻角分量。对测量误差进行了分析 ,发现线阵CCD的采样频率对测量误差的影响较大 相似文献
33.
34.
We seek dynamic server assignment policies in finite‐capacity queueing systems with flexible and collaborative servers, which involve an assembly and/or a disassembly operation. The objective is to maximize the steady‐state throughput. We completely characterize the optimal policy for a Markovian system with two servers, two feeder stations, and instantaneous assembly and disassembly operations. This optimal policy allocates one server per station unless one of the stations is blocked, in which case both servers work at the unblocked station. For Markovian systems with three stations and instantaneous assembly and/or disassembly operations, we consider similar policies that move a server away from his/her “primary” station only when that station is blocked or starving. We determine the optimal assignment of each server whose primary station is blocked or starving in systems with three stations and zero buffers, by formulating the problem as a Markov decision process. Using this optimal assignment, we develop heuristic policies for systems with three or more stations and positive buffers, and show by means of a numerical study that these policies provide near‐optimal throughput. Furthermore, our numerical study shows that these policies developed for assembly‐type systems also work well in tandem systems. © 2008 Wiley Periodicals, Inc. Naval Research Logistics, 2008 相似文献
35.
Yoshinori Suzuki 《海军后勤学研究》2008,55(8):737-746
Fuel optimizers are decision models (software products) that are increasingly recognized as effective fuel management tools by U.S. truckload carriers. Using the latest price data of every truck stop, these models calculate the optimal fueling schedule for each route that indicates: (i) which truck stop(s) to use, and (ii) how much fuel to buy at the chosen truck stop(s) to minimize the refueling cost. In the current form, however, these models minimize only the fuel cost, and ignore or underestimate other costs that are affected by the models' decision variables. On the basis of the interviews with carrier managers, truck drivers, and fuel‐optimizer vendors, this article proposes a comprehensive model of motor‐carrier fuel optimization that considers all of the costs that are affected by the model's decision variables. Simulation results imply that the proposed model not only attains lower vehicle operating costs than the commercial fuel optimizers, but also gives solutions that are more desirable from the drivers' viewpoint. © 2008 Wiley Periodicals, Inc. Naval Research Logistics, 2008 相似文献
36.
Ryusuke Hohzaki 《海军后勤学研究》2008,55(1):76-90
This article deals with a two‐person zero‐sum game called a search allocation game (SAG), in which a searcher and a target participate as players. The searcher distributes his searching resources in a search space to detect the target. The effect of resources lasts a certain period of time and extends to some areas at a distance from the resources' dropped points. On the other hand, the target moves around in the search space to evade the searcher. In the history of search games, there has been little research covering the durability and reachability of searching resources. This article proposes two linear programming formulations to solve the SAG with durable and reachable resources, and at the same time provide an optimal strategy of distributing searching resources for the searcher and an optimal moving strategy for the target. Using examples, we will analyze the influences of two attributes of resources on optimal strategies. © 2007 Wiley Periodicals, Inc. Naval Research Logistics 2008 相似文献
37.
分数阶傅立叶变换(FRFT)是傅立叶变换的广义形式,对线性调频(LFM)信号具有很好的能量积累作用.针对反辐射导弹(ARM)雷达回波信号的线性调频特性,提出了一种基于FRFT的反辐射导弹检测方法,并根据ARM信号的调频特性将FRFF局域化,缩小了峰值搜索区域,提高了检测效率.仿真实验表明该方法能够在高斯、非高斯分布杂波环境下有效地检测ARM信号. 相似文献
38.
研究了线性定常系统在循环指数大于1(即其约当标准形不同的约当块有重根)的情况下测试矩阵的优化方法.以循环子空间相关定理的证明为基础,根据根向量链的相关特性,得到了测试向量的线性和与系统观测性的直接关系,给出了在保证系统可观测性的同时,使得测试代价最小的测试矩阵优化方法.算例表明,提出的方法简单直观,对配置测试向量具有良好的工程价值. 相似文献
39.
研究了机动目标宽带线性调频脉冲回波全去斜率信号模型,根据速度和加速度的调频频谱展宽特点,提出了机动目标宽带一维距离像线性化调频回波模型,给出了Radon模糊图转换(RAT)法线性参数估计与运动补偿方法,并进一步分析了测速和测距误差.仿真实验验证了RAT法一维距离像线性化参数估计与补偿,表明该方法很好地解决了运动参数未知情况下机动目标的一维距离像频谱展宽问题. 相似文献
40.
Adjacency‐based local top‐down search method for finding maximal efficient faces in multiple objective linear programming
下载免费PDF全文
![点击此处可从《海军后勤学研究》网站下载免费的PDF全文](/ch/ext_images/free.gif)
It is well‐known that the efficient set of a multiobjective linear programming (MOLP) problem can be represented as a union of the maximal efficient faces of the feasible region. In this paper, we propose a method for finding all maximal efficient faces for an MOLP. The new method is based on a condition that all efficient vertices (short for the efficient extreme points and rays) for the MOLP have been found and it relies on the adjacency, affine independence and convexity results of efficient sets. The method uses a local top‐down search strategy to determine maximal efficient faces incident to every efficient vertex for finding maximal efficient faces of an MOLP problem. To our knowledge, the proposed method is the first top‐down search method that uses the adjacency property of the efficient set to find all maximal efficient faces. We discuss this and other advantages and disadvantages of the algorithm. We also discuss some computational experience we have had with our computer code for implementing the algorithm. This computational experience involved solving several MOLP problems with the code. 相似文献