全文获取类型
收费全文 | 166篇 |
免费 | 83篇 |
国内免费 | 12篇 |
出版年
2024年 | 2篇 |
2023年 | 2篇 |
2022年 | 3篇 |
2021年 | 2篇 |
2020年 | 6篇 |
2019年 | 3篇 |
2018年 | 6篇 |
2017年 | 10篇 |
2016年 | 19篇 |
2015年 | 14篇 |
2014年 | 16篇 |
2013年 | 10篇 |
2012年 | 9篇 |
2011年 | 10篇 |
2010年 | 7篇 |
2009年 | 17篇 |
2008年 | 13篇 |
2007年 | 7篇 |
2006年 | 19篇 |
2005年 | 15篇 |
2004年 | 9篇 |
2003年 | 10篇 |
2002年 | 7篇 |
2001年 | 9篇 |
2000年 | 10篇 |
1999年 | 6篇 |
1998年 | 4篇 |
1997年 | 5篇 |
1996年 | 4篇 |
1995年 | 1篇 |
1994年 | 1篇 |
1992年 | 3篇 |
1991年 | 1篇 |
1989年 | 1篇 |
排序方式: 共有261条查询结果,搜索用时 265 毫秒
101.
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 相似文献
102.
In various scenarios, consumers may become satiated with products, and the degree of satiation is directly associated with their prior experiences. Confronted with consumer satiation, the seller is unable to either identify consumers who have a higher likelihood of being satiated ex ante or distinguish satiated from non‐satiated consumers ex post. Therefore, the seller should address dynamic selling, valuation uncertainty, and quantity decisions, all of which are important operational issues. We consider a two‐period problem in which consumer types are influenced by their prior consumption experiences. Faced with these consumers, the seller intends to optimize quantities and adjust the prices of the products in each period to maximize revenue. We find that the seller may reduce ex ante production quantity as some consumers become satiated. Moreover, the ex ante quantity is first decreasing and then increasing with regard to the satiation rate. Furthermore, two‐period information asymmetries may provide a rationale for upward distortion in quantity when consumer preferences are highly sensitive to first‐period consumption. © 2016 Wiley Periodicals, Inc. Naval Research Logistics 63: 386–400, 2016 相似文献
103.
104.
探讨了采用锁相环频率跟踪,通过环路补偿达到磁平衡的方法,隔离测量直流和低频、中频交流电流,利用磁性材料自身特性,进行温度补偿,用低成本达到较高的稳定度和测量精度. 相似文献
105.
简要介绍了目前稀土永磁减振器的研究现状和单质量稀土永磁减振器的结构与工作原理,运用大型有限元软件ANSYS对稀土永磁减振器的工作过程进行数值模拟,分析其在工作过程中的磁通密度、磁力线分布、力学特性以及它们之间的相互关系。研究表明:稀土永磁减振器具有较好的非线性减振效果;ANSYS在模拟稀土永磁减振器工作过程时,能形象直观的反映其在工作过程中的各种特性参数。 相似文献
106.
对非线性最小二乘法应用于纯方位系统目标运动分析进行了综合评述,介绍了经典的非线性最小二乘法及几种常规算法:高斯—牛顿迭代法,麦夸脱迭代法,自适应非线性最小二乘法,给出了非线性最小二乘法对纯方位目标运动分析的四个数学模型:高度非线性模型,减弱非线性模型,再减弱非线性模型,再进一步减弱非线性模型。 相似文献
107.
成洁 《武警工程学院学报》2011,(6):24-27
针对越野汽车的行驶条件,对传统线性被动悬架、非线性被动悬架和非线性主动悬架的动态特性进行了研究。建立了悬架系统的动力学模型,采用统计线性化方法对非线性弹簧悬架进行求解,利用MATLAB/SIMULlNK工具箱对悬架模型进行了动力学仿真。仿真结果表明:非线性弹簧悬架模型比传统的线性悬架模型更符合越野汽车悬架系统的振动运动,而采用基于线性二次型最优控制方法的主动控制非线性悬架,则能获得更好的行驶平顺性和操纵稳定性。 相似文献
108.
109.
110.