全文获取类型
收费全文 | 286篇 |
免费 | 117篇 |
国内免费 | 35篇 |
出版年
2024年 | 3篇 |
2023年 | 4篇 |
2022年 | 7篇 |
2021年 | 7篇 |
2020年 | 9篇 |
2019年 | 8篇 |
2018年 | 9篇 |
2017年 | 19篇 |
2016年 | 24篇 |
2015年 | 32篇 |
2014年 | 25篇 |
2013年 | 29篇 |
2012年 | 27篇 |
2011年 | 27篇 |
2010年 | 20篇 |
2009年 | 26篇 |
2008年 | 20篇 |
2007年 | 21篇 |
2006年 | 21篇 |
2005年 | 19篇 |
2004年 | 24篇 |
2003年 | 6篇 |
2002年 | 9篇 |
2001年 | 7篇 |
2000年 | 5篇 |
1999年 | 6篇 |
1998年 | 2篇 |
1997年 | 4篇 |
1996年 | 1篇 |
1995年 | 3篇 |
1994年 | 2篇 |
1992年 | 3篇 |
1991年 | 1篇 |
1990年 | 4篇 |
1989年 | 3篇 |
1987年 | 1篇 |
排序方式: 共有438条查询结果,搜索用时 15 毫秒
241.
242.
243.
244.
为了获得毫米级自旋小目标的清晰成像,采用逆合成孔径成像激光雷达技术设计了基于距离向数据与方位向数据相融合的图像重建系统。系统采用大带宽、窄线宽光纤激光器配合调制器实现激光脉冲的线性调频,利用光外差原理对回波信号进行采集处理。结合自旋目标的运动特性,给出了含有自旋分量的回波信号函数方程,并将该分量引入传统的R-D算法中实现了对自旋目标的ISAIL二维图像的重建。实验采用毫米级铝条构成被测小目标,通过步进电机及带倾角的转台完成运动及自旋模拟。实验结果显示,当目标固定时,可通过回波能量数据获得一维距离向图像,与被测目标的4个特征点位置一致。当目标运动时,通过数据压缩并代入自旋参量,最后通过R-D算法可以获得可识别的ISAIL二维图像,验证了系统符合自旋小目标成像的设计要求。 相似文献
245.
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 相似文献
246.
We develop a risk‐sensitive strategic facility sizing model that makes use of readily obtainable data and addresses both capacity and responsiveness considerations. We focus on facilities whose original size cannot be adjusted over time and limits the total production equipment they can hold, which is added sequentially during a finite planning horizon. The model is parsimonious by design for compatibility with the nature of available data during early planning stages. We model demand via a univariate random variable with arbitrary forecast profiles for equipment expansion, and assume the supporting equipment additions are continuous and decided ex‐post. Under constant absolute risk aversion, operating profits are the closed‐form solution to a nontrivial linear program, thus characterizing the sizing decision via a single first‐order condition. This solution has several desired features, including the optimal facility size being eventually decreasing in forecast uncertainty and decreasing in risk aversion, as well as being generally robust to demand forecast uncertainty and cost errors. We provide structural results and show that ignoring risk considerations can lead to poor facility sizing decisions that deteriorate with increased forecast uncertainty. Existing models ignore risk considerations and assume the facility size can be adjusted over time, effectively shortening the planning horizon. Our main contribution is in addressing the problem that arises when that assumption is relaxed and, as a result, risk sensitivity and the challenges introduced by longer planning horizons and higher uncertainty must be considered. Finally, we derive accurate spreadsheet‐implementable approximations to the optimal solution, which make this model a practical capacity planning tool.© 2008 Wiley Periodicals, Inc. Naval Research Logistics, 2008 相似文献
247.
平均曲率运动模型(MCM)是基于偏微分方程的图像处理模型的一种,具有明确的几何意义.提出了模型中退化扩散项的精确计算方法,并采用了两种新的方向估计方法.实验证明了新方法所得的结果优于原方法. 相似文献
248.
李雅普诺夫运动稳定性与平衡状态稳定性的关系 总被引:7,自引:0,他引:7
齐晓慧 《军械工程学院学报》2002,14(4):35-38
稳定性是系统分析的重要内容 ,针对在系统稳定性分析中 ,运动稳定性和平衡状态稳定性之间常易于混淆的问题 ,详细分析了两种稳定性之间内在本质联系 ,给出了从一种稳定性过渡到另一种稳定性的方法 相似文献
249.
In this study, we illustrate a real‐time approximate dynamic programming (RTADP) method for solving multistage capacity decision problems in a stochastic manufacturing environment, by using an exemplary three‐stage manufacturing system with recycle. The system is a moderate size queuing network, which experiences stochastic variations in demand and product yield. The dynamic capacity decision problem is formulated as a Markov decision process (MDP). The proposed RTADP method starts with a set of heuristics and learns a superior quality solution by interacting with the stochastic system via simulation. The curse‐of‐dimensionality associated with DP methods is alleviated by the adoption of several notions including “evolving set of relevant states,” for which the value function table is built and updated, “adaptive action set” for keeping track of attractive action candidates, and “nonparametric k nearest neighbor averager” for value function approximation. The performance of the learned solution is evaluated against (1) an “ideal” solution derived using a mixed integer programming (MIP) formulation, which assumes full knowledge of future realized values of the stochastic variables (2) a myopic heuristic solution, and (3) a sample path based rolling horizon MIP solution. The policy learned through the RTADP method turned out to be superior to polices of 2 and 3. © 2010 Wiley Periodicals, Inc. Naval Research Logistics 2010 相似文献
250.
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 相似文献