全文获取类型
| 收费全文 | 279篇 |
| 免费 | 23篇 |
| 国内免费 | 5篇 |
专业分类
| 307篇 |
出版年
| 2025年 | 8篇 |
| 2024年 | 10篇 |
| 2023年 | 16篇 |
| 2022年 | 6篇 |
| 2021年 | 8篇 |
| 2020年 | 9篇 |
| 2019年 | 9篇 |
| 2018年 | 8篇 |
| 2017年 | 12篇 |
| 2016年 | 17篇 |
| 2015年 | 17篇 |
| 2014年 | 17篇 |
| 2013年 | 23篇 |
| 2012年 | 19篇 |
| 2011年 | 15篇 |
| 2010年 | 11篇 |
| 2009年 | 17篇 |
| 2008年 | 13篇 |
| 2007年 | 16篇 |
| 2006年 | 13篇 |
| 2005年 | 12篇 |
| 2004年 | 10篇 |
| 2003年 | 4篇 |
| 2002年 | 3篇 |
| 2001年 | 4篇 |
| 1999年 | 3篇 |
| 1998年 | 1篇 |
| 1997年 | 2篇 |
| 1992年 | 1篇 |
| 1990年 | 3篇 |
排序方式： 共有307条查询结果，搜索用时 0 毫秒
131.
We consider a discrete time‐and‐space route‐optimization problem across a finite time horizon in which multiple searchers seek to detect one or more probabilistically moving targets. This article formulates a novel convex mixed‐integer nonlinear program for this problem that generalizes earlier models to situations with multiple targets, searcher deconfliction, and target‐ and location‐dependent search effectiveness. We present two solution approaches, one based on the cutting‐plane method and the other on linearization. These approaches result in the first practical exact algorithms for solving this important problem, which arises broadly in military, rescue, law enforcement, and border patrol operations. The cutting‐plane approach solves many realistically sized problem instances in a few minutes, while existing branch‐and‐bound algorithms fail. A specialized cut improves solution time by 50[percnt] in difficult problem instances. The approach based on linearization, which is applicable in important special cases, may further reduce solution time with one or two orders of magnitude. The solution time for the cutting‐plane approach tends to remain constant as the number of searchers grows. In part, then, we overcome the difficulty that earlier solution methods have with many searchers. © 2010 Wiley Periodicals, Inc. Naval Research Logistics, 2010 相似文献
132.
《防务技术》2020,16(4):811-824
For the automatic tracking of unknown moving targets on the ground, most of the commonly used methods involve circling above the target. With such a tracking mode, there is a moving laser spot on the target, which will bring trouble for cooperative manned helicopters. In this paper, we propose a new way of tracking, where an unmanned aerial vehicle (UAV) circles on one side of the tracked target. A circular path algorithm is developed for monitoring the relative position between the UAV and the target considering the real-time range and the bearing angle. This can determine the center of the new circular path if the predicted range between the UAV and the target does not meet the monitoring requirements. A transition path algorithm is presented for planning the transition path between circular paths that constrain the turning radius of the UAV. The transition path algorithm can generate waypoints that meet the flight ability. In this paper, we analyze the entire method and detail the scope of applications. We formulate an observation angle as an evaluation index. A series of simulations and evaluation index comparisons verify the effectiveness of the proposed algorithms. 相似文献
133.
We consider an expansion planning problem for Waste‐to‐Energy (WtE) systems facing uncertainty in future waste supplies. The WtE expansion plans are regarded as strategic, long term decisions, while the waste distribution and treatment are medium to short term operational decisions which can adapt to the actual waste collected. We propose a prediction set uncertainty model which integrates a set of waste generation forecasts and is constructed based on user‐specified levels of forecasting errors. Next, we use the prediction sets for WtE expansion scenario analysis. More specifically, for a given WtE expansion plan, the guaranteed net present value (NPV) is evaluated by computing an extreme value forecast trajectory of future waste generation from the prediction set that minimizes the maximum NPV of the WtE project. This problem is essentially a multiple stage min‐max dynamic optimization problem. By exploiting the structure of the WtE problem, we show this is equivalent to a simpler min‐max optimization problem, which can be further transformed into a single mixed‐integer linear program. Furthermore, we extend the model to optimize the guaranteed NPV by searching over the set of all feasible expansion scenarios, and show that this can be solved by an exact cutting plane approach. We also propose a heuristic based on a constant proportion distribution rule for the WtE expansion optimization model, which reduces the problem into a moderate size mixed‐integer program. Finally, our computational studies demonstrate that our proposed expansion model solutions are very stable and competitive in performance compared to scenario tree approaches. © 2016 Wiley Periodicals, Inc. Naval Research Logistics 63: 47–70, 2016 相似文献
134.
This study introduces one modeling methodology that describes a broad range of multiple stage production planning issues, including multiple limited resources with setup times and joint fixed cost relationships. An existing production system is modeled in this fashion, creating a new set of 1350 highly generalized benchmark problems. A computational study is conducted with the 1350 benchmark problems introduced in this paper and 2100 benchmark problems, with more restrictive assumptions, from the existing literature. The relative merits of a decomposition‐based algorithm and a neighborhood search technique known as NIPPA, or the Non‐sequential Incremental Part Period Algorithm, are assessed. NIPPA is generally the more successful of the two techniques, although there are specific instances in which the decomposition‐based algorithm displayed a distinct advantage. © 2005 Wiley Periodicals, Inc. Naval Research Logistics, 2005 相似文献
135.
针对基本粒子群算法(particle swarm optimization,PSO)易局部收敛的缺陷,设计了一种根据种群多样性测度动态调整惯性权重的改进粒子群算法,通过仿真测试函数与基本粒子群算法、自适应粒子群算法(adaptive particle swarm optimization,APSO)、带收缩因子的粒子群算法(contractive particle swarm optimization,CPSO)进行比较,改进的PSO算法在提高算法的综合搜索能力方面具有优越性。将改进的PSO算法运用到作战飞行器航迹规划中,并进行了仿真实验,仿真结果验证了改进算法的有效性。 相似文献
136.
曾耀农 《兵团教育学院学报》2012,(1):62-66,80
电影是一门结合文学、戏剧、摄影、音乐、舞蹈、绘画等多种艺术形式的综合艺术,且其本身又具有独自的艺术特征。作为一种核心文化创意产业,在诞生的那一刻开始就具有了艺术与商业的双重属性。电影策划工作是确立作品创作走向、保证作品艺术质量、获取预期的社会效益与经济效益的重要工作。从纵向来说,电影策划工作包括了作品出台前的市场调研、作品制作的过程以及作品推出后的营销创意、实施方案、配合宣传和相关产品制作和开发等各个相关的环节;从横向来说,它就是一种既统观全局又体察入微的创意过程,是一个名副其实的系统工程。 相似文献
137.
自动化电弧喷涂路径偏移间距的优化模型 总被引：1，自引：0，他引：1
基于电弧喷涂沉积丘的轮廓呈高斯分布的假设,并结合实验结果,建立了电弧喷涂沉积丘轮廓的数学模型,由此推导出了自动化喷涂过程中平行路径偏移间距这一重要参量的优化模型。该模型为合理规划自动化喷涂的路径提供了依据。 相似文献
138.
基于辅助制导的无人飞行器多航迹规划是现今航迹规划的主流研究方向之一。飞行器规划空间广,规划过程耗时长,如何提高航迹规划的速度是一个急待解决的问题。因此,提出了一种在预处理过程中生成的、满足战场环境和基于辅助制导无人飞行器飞行特性的有向航迹网络图。该网络图适用于基于辅助制导的无人飞行器多航迹快速规划,使用数据库存储和管理,具有整体数据结构化、易扩充、占用内存资源小、可大大缩短规划时间等优点。 相似文献
139.
We present a robust optimization model for production planning under the assumption that electricity supply is subject to uncertain interruptions caused by participation in interruptible load contracts (ILCs). The objective is to minimize the cost of electricity used for production while providing a robust production plan which ensures demand satisfaction under all possible interruption scenarios. The combinatorial size of the set of interruption scenarios makes this a challenging problem. Furthermore, we assume that no probabilistic information is known about the supply uncertainty: we only use the information given in the ILC to identify an uncertainty set that captures the possible scenarios. We construct a general robust framework to handle this uncertainty and present a heuristic to compute a good feasible solution of the robust model. We provide computational experiments on a real‐world example and compare the performance of an exact solver applied to the robust model with that of the heuristic procedure. Finally, we include the operational impact of interruptions such as “recovery modes” in the definition of the uncertainty set. © 2013 Wiley Periodicals, Inc. Naval Research Logistics, 2013 相似文献
140.
Bence Nemeth 《Defense & Security Analysis》2016,32(4):321-335
Hungary, a former communist state, adapted a Western-style defense planning system during the 1990s and 2000s. Although on the surface the elements of this planning system were similar to the planning programming budgeting system (PPBS) developed by the US Department of Defense, strategic guidance for defense planning has not been properly developed until recently. Thus, albeit PPBS-based defense plans were developed in the Hungarian Ministry of Defense (Hungarian MoD) regularly, they lacked both an expression of clear priorities and strategic focus. This article delineates the evolution of strategic guidance in the Hungarian MoD concentrating on current developments, and introduces the newly elaborated analytical concepts and tools, which helped to create needed strategic guidance in Hungary. 相似文献