全文获取类型
| 收费全文 | 767篇 |
| 免费 | 21篇 |
| 国内免费 | 6篇 |
专业分类
| 794篇 |
出版年
| 2025年 | 5篇 |
| 2024年 | 6篇 |
| 2023年 | 11篇 |
| 2022年 | 8篇 |
| 2021年 | 16篇 |
| 2020年 | 14篇 |
| 2019年 | 15篇 |
| 2018年 | 12篇 |
| 2017年 | 26篇 |
| 2016年 | 35篇 |
| 2015年 | 22篇 |
| 2014年 | 52篇 |
| 2013年 | 52篇 |
| 2012年 | 50篇 |
| 2011年 | 49篇 |
| 2010年 | 33篇 |
| 2009年 | 59篇 |
| 2008年 | 28篇 |
| 2007年 | 40篇 |
| 2006年 | 52篇 |
| 2005年 | 39篇 |
| 2004年 | 29篇 |
| 2003年 | 25篇 |
| 2002年 | 14篇 |
| 2001年 | 20篇 |
| 2000年 | 16篇 |
| 1999年 | 7篇 |
| 1998年 | 7篇 |
| 1997年 | 5篇 |
| 1996年 | 8篇 |
| 1995年 | 8篇 |
| 1994年 | 5篇 |
| 1993年 | 3篇 |
| 1992年 | 2篇 |
| 1991年 | 8篇 |
| 1990年 | 10篇 |
| 1989年 | 3篇 |
排序方式： 共有794条查询结果，搜索用时 15 毫秒
161.
Greg Janzen 《Journal of Military Ethics》2016,15(1):36-57
According to just war theory, a resort to war is justified only if it satisfies the right intention condition. This article offers a critical examination of this condition, defending the thesis that, despite its venerable history as part of the just war tradition, it ought to be jettisoned. When properly understood, it turns out to be an unnecessary element of jus ad bellum, adding nothing essential to our assessments of the justice of armed conflict. 相似文献
162.
针对常规海上航线决策没有考虑决策选择过程的问题,引入多选择决策场理论（ MDFT）,构建了海上能源通道航线动态决策模型。基于信息完备、信息不确定和特殊情况等三种情景想定,进行了海上能源通道航线规划决策及其实验仿真。结果表明,决策过程受时间压力和信息质量的制约,时间压力会制约决策质量,同时还可能引起“偏好逆转”现象,信息不确定也会导致确定性决策。该模型不仅综合考虑了海上能源通道航线选择时需关注的各类要素,且模型参数可动态调整,进而能合理模拟真实的海上状况和决策过程。 相似文献
163.
Stochastic network design is fundamental to transportation and logistic problems in practice, yet faces new modeling and computational challenges resulted from heterogeneous sources of uncertainties and their unknown distributions given limited data. In this article, we design arcs in a network to optimize the cost of single‐commodity flows under random demand and arc disruptions. We minimize the network design cost plus cost associated with network performance under uncertainty evaluated by two schemes. The first scheme restricts demand and arc capacities in budgeted uncertainty sets and minimizes the worst‐case cost of supply generation and network flows for any possible realizations. The second scheme generates a finite set of samples from statistical information (e.g., moments) of data and minimizes the expected cost of supplies and flows, for which we bound the worst‐case cost using budgeted uncertainty sets. We develop cutting‐plane algorithms for solving the mixed‐integer nonlinear programming reformulations of the problem under the two schemes. We compare the computational efficacy of different approaches and analyze the results by testing diverse instances of random and real‐world networks. © 2017 Wiley Periodicals, Inc. Naval Research Logistics 64: 154–173, 2017 相似文献
164.
165.
针对机载雷达信号的复杂性和模糊性等特点,提出一种D-S(登普斯特-谢弗)证据理论和模糊理论组合应用的方法用于对机载雷达的识别。通过对信号的积累和对信任度(模糊隶属度)的重新分配,有效地解决了机载雷达信号的不确定性问题以及如何利用信号在时间上的冗余信息问题,提高了信号的正确识别率。仿真实验和正确识别率的统计结果验证了这种方法十分有效。 相似文献
166.
Consider the conditional covering problem on an undirected graph, where each node represents a site that must be covered by a facility, and facilities may only be established at these nodes. Each facility can cover all sites that lie within some common covering radius, except the site at which it is located. Although this problem is difficult to solve on general graphs, there exist special structures on which the problem is easily solvable. In this paper, we consider the special case in which the graph is a simple path. For the case in which facility location costs do not vary based on the site, we derive characteristics of the problem that lead to a linear‐time shortest path algorithm for solving the problem. When the facility location costs vary according to the site, we provide a more complex, but still polynomial‐time, dynamic programming algorithm to find the optimal solution. © 2005 Wiley Periodicals, Inc. Naval Research Logistics, 2005. 相似文献
167.
全球信息栅格的产生和实现技术研究 总被引：1，自引：0，他引：1
介绍了全球信息栅格的概念与定义,详细论述了全球信息栅格产生与发展的动因、实现技术的研究现状.介绍了研究与实现全球信息栅格的关键技术、基础理论,重点论述了实现全球信息栅格总体架构的有关内容. 相似文献
168.
169.
A system reliability is often evaluated by individual tests of components that constitute the system. These component test plans have advantages over complete system based tests in terms of time and cost. In this paper, we consider the series system with n components, where the lifetime of the i‐th component follows exponential distribution with parameter λi. Assuming test costs for the components are different, we develop an efficient algorithm to design a two‐stage component test plan that satisfies the usual probability requirements on the system reliability and in addition minimizes the maximum expected cost. For the case of prior information in the form of upper bounds on λi's, we use the genetic algorithm to solve the associated optimization problems which are otherwise difficult to solve using mathematical programming techniques. The two‐stage component test plans are cost effective compared to single‐stage plans developed by Rajgopal and Mazumdar. We demonstrate through several numerical examples that our approach has the potential to reduce the overall testing costs significantly. © 2002 John Wiley & Sons, Inc. Naval Research Logistics, 49: 95–116, 2002; DOI 10.1002/nav.1051 相似文献
170.
Given a number of patrollers that are required to detect an intruder in a channel, the channel patrol problem consists of determining the periodic trajectories that the patrollers must trace out so as to maximized the probability of detection of the intruder. We formulate this problem as an optimal control problem. We assume that the patrollers' sensors are imperfect and that their motions are subject to turn‐rate constraints, and that the intruder travels straight down a channel with constant speed. Using discretization of time and space, we approximate the optimal control problem with a large‐scale nonlinear programming problem which we solve to obtain an approximately stationary solution and a corresponding optimized trajectory for each patroller. In numerical tests for one, two, and three underwater patrollers, an underwater intruder, different trajectory constraints, several intruder speeds and other specific parameter choices, we obtain new insight—not easily obtained using simply geometric calculations—into efficient patrol trajectory design under certain conditions for multiple patrollers in a narrow channel where interaction between the patrollers is unavoidable due to their limited turn rate.© 2011 Wiley Periodicals, Inc. Naval Research Logistics, 2011 相似文献