全文获取类型
收费全文 | 814篇 |
免费 | 10篇 |
国内免费 | 16篇 |
专业分类
840篇 |
出版年
2025年 | 4篇 |
2024年 | 5篇 |
2023年 | 4篇 |
2022年 | 4篇 |
2021年 | 11篇 |
2020年 | 12篇 |
2019年 | 8篇 |
2018年 | 9篇 |
2017年 | 31篇 |
2016年 | 45篇 |
2015年 | 14篇 |
2014年 | 57篇 |
2013年 | 35篇 |
2012年 | 52篇 |
2011年 | 61篇 |
2010年 | 40篇 |
2009年 | 56篇 |
2008年 | 55篇 |
2007年 | 48篇 |
2006年 | 52篇 |
2005年 | 65篇 |
2004年 | 41篇 |
2003年 | 28篇 |
2002年 | 21篇 |
2001年 | 19篇 |
2000年 | 14篇 |
1999年 | 7篇 |
1998年 | 9篇 |
1997年 | 8篇 |
1996年 | 5篇 |
1995年 | 5篇 |
1994年 | 3篇 |
1993年 | 4篇 |
1992年 | 3篇 |
1991年 | 2篇 |
1990年 | 3篇 |
排序方式: 共有840条查询结果,搜索用时 15 毫秒
491.
为提升无人机的作战效能和作战指标,提升无人机的相对导航精度和导航系统可靠性,以无人机编队的相对导航系统为研究背景,基于容积卡尔曼滤波算法和信息滤波算法,研究容积信息滤波算法。此外,还采用多传感器信息融合理论,利用分布式信息融合结构构建了无人机相对导航滤波器,对来自惯导、视觉和卫星的信息进行融合,获取无人机间的相对位置、速度和姿态信息。该方法提升了无人机相对导航的导航精度、导航可靠性和滤波稳定性,容积信息滤波算法的应用避免了传统滤波算法在高维系统中出现的数值不稳定以及精度降低等问题。数学仿真结果表明,该方法提高了无人机编队之间相对导航的精度和可靠性,证明了算法的有效性。 相似文献
492.
493.
494.
针对基于多传感器组网进行机动目标跟踪的传感器管理问题,提出了一种基于Rényi信息增量的机动目标协同跟踪算法。首先结合\"当前\"统计模型和交互式多模型不敏卡尔曼滤波算法设计了一种变结构多模型算法,来进行机动目标的状态估计;然后以Rényi信息增量为评价准则,选择使Rényi信息增量最大的单个传感器进行目标跟踪;最后利用得到的最优加速度估计进行网格划分,更新变结构多模型中的模型集合。在一般机动及强机动场景下进行了算法性能分析,仿真结果表明,该算法能够合理地选择传感器,提高了对机动目标的跟踪精度。 相似文献
495.
在分析构建消防重点保卫单位灭火救援信息系统的必要性及可行性基础上,论述了系统建立的组织结构、功能设计和系统的作用。 相似文献
496.
497.
针对物资保障的信息化建设和物资保障网络管理信息系统的开发,论述了系统应具备的特点,提出了系统建设的总体方案.对信息系统功能进行了总体规划和划分对信息系统建设的关键技术进行了讨论.最后,结合信息系统开发方法学对系统开发的具体方法进行了讨论. 相似文献
498.
Albert Y. Ha 《海军后勤学研究》2001,48(1):41-64
We consider the problem of designing a contract to maximize the supplier's profit in a one‐supplier–one‐buyer relationship for a short‐life‐cycle product. Demand for the finished product is stochastic and price‐sensitive, and only its probability distribution is known when the supply contract is written. When the supplier has complete information on the marginal cost of the buyer, we show that several simple contracts can induce the buyer to choose order quantity that attains the single firm profit maximizing solution, resulting in the maximum possible profit for the supplier. When the marginal cost of the buyer is private information, we show that it is no longer possible to achieve the single firm solution. In this case, the optimal order quantity is always smaller while the optimal sale price of the finished product is higher than the single firm solution. The supplier's profit is lowered while that of the buyer is improved. Moreover, a buyer who has a lower marginal cost will extract more profit from the supplier. Under the optimal contract, the supplier employs a cutoff level policy on the buyer's marginal cost to determine whether the buyer should be induced to sign the contract. We characterize the optimal cutoff level and show how it depends on the parameters of the problem. © 2001 John Wiley & Sons, Inc. Naval Research Logistics 48: 41–64, 2001 相似文献
499.
Corine M. Laan Ana Isabel Barros Richard J. Boucherie Herman Monsuur Judith Timmer 《海军后勤学研究》2019,66(2):174-190
In this paper, we introduce partially observable agent‐intruder games (POAIGs). These games model dynamic search games on graphs between security forces (an agent) and an intruder given possible (border) entry points and high value assets that require protection. The agent faces situations with dynamically changing, partially observable information about the state of the intruder and vice versa. The agent may place sensors at selected locations, while the intruder may recruit partners to observe the agent's movement. We formulate the problem as a two‐person zero‐sum game, and develop efficient algorithms to compute each player's optimal strategy. The solution to the game will help the agent choose sensor locations and design patrol routes that can handle imperfect information. First, we prove the existence of ?‐optimal strategies for POAIGs with an infinite time horizon. Second, we introduce a Bayesian approximation algorithm to identify these ?‐optimal strategies using belief functions that incorporate the imperfect information that becomes available during the game. For the solutions of large POAIGs with a finite time horizon, we use a solution method common to extensive form games, namely, the sequence form representation. To illustrate the POAIGs, we present several examples and numerical results. 相似文献
500.
Greys Sošić 《海军后勤学研究》2010,57(3):279-295
In their recent article, Leng and Parlar (L&P) (2009) analyze information‐sharing alliances in a three‐level supply chain (consisting of a manufacturer, a distributor, and a retailer) that faces a nonstationary end demand. Supply chain members can share demand information, which reduces information distortion and thus decreases their inventory holding and shortage costs. We expand the results from L&P by considering dynamic (farsighted) stability concepts. We use two different allocation rules and show that under some reasonable assumptions there should always be some information sharing in this supply chain. We also identify conditions under which the retailer in a stable outcome shares his demand information with the distributor, with the manufacturer, or with both remaining supply chain members. © 2010 Wiley Periodicals, Inc. Naval Research Logistics, 2010 相似文献