全文获取类型
| 收费全文 | 778篇 |
| 免费 | 44篇 |
| 国内免费 | 6篇 |
专业分类
| 828篇 |
出版年
| 2025年 | 9篇 |
| 2024年 | 17篇 |
| 2023年 | 29篇 |
| 2022年 | 12篇 |
| 2021年 | 12篇 |
| 2020年 | 18篇 |
| 2019年 | 18篇 |
| 2018年 | 14篇 |
| 2017年 | 46篇 |
| 2016年 | 51篇 |
| 2015年 | 30篇 |
| 2014年 | 56篇 |
| 2013年 | 31篇 |
| 2012年 | 56篇 |
| 2011年 | 48篇 |
| 2010年 | 34篇 |
| 2009年 | 52篇 |
| 2008年 | 30篇 |
| 2007年 | 33篇 |
| 2006年 | 57篇 |
| 2005年 | 37篇 |
| 2004年 | 26篇 |
| 2003年 | 19篇 |
| 2002年 | 16篇 |
| 2001年 | 10篇 |
| 2000年 | 6篇 |
| 1999年 | 10篇 |
| 1998年 | 7篇 |
| 1997年 | 1篇 |
| 1996年 | 5篇 |
| 1995年 | 8篇 |
| 1994年 | 5篇 |
| 1993年 | 6篇 |
| 1992年 | 5篇 |
| 1991年 | 4篇 |
| 1990年 | 4篇 |
| 1989年 | 6篇 |
排序方式： 共有828条查询结果，搜索用时 15 毫秒
151.
基于Lipschitz下界估值和分枝定界技术,给出了一维参数化小波滤波器逼近问题的全局最优算法。由于充分利用了滤波器逼近问题的特点,本方法将原来的Lipschitz算法的线性收敛速率提高为二次收敛速率。 相似文献
152.
基于免疫FNN算法的加热炉炉温优化控制 总被引：1，自引：0，他引：1
针对复杂钢坯加热过程,提出了一种免疫克隆进化模糊神经网络(ICE-FNN)控制算法。首先根据现场样本数据建立过程神经网络模型;然后基于该模型,采用模糊神经网络控制器(FNNC)规则优化算法,确定FNNC的最佳规则数;最后由FNNC的规则优化所得参数构造初始种群的一个解,采用免疫克隆进化(ICE)算法对FNNC参数优化。该算法具有全局寻优和局部求精能力,仿真结果证实了其有效性。 相似文献
153.
以复杂地形地区物资快速投送平台设计为背景,开展尾座式电动飞机复合材料机翼设计研究.对机翼结构载荷进行分析,对机翼结构构件布置和铺层进行设计,形成复合材料机翼结构设计方案.建立复合材料机翼结构有限元模型,开展典型工况条件下的静力分析,得到机翼结构变形、应力和Tsai-Wu失效因子分布.采用分步优化策略,以机翼结构铺层厚度和铺层角度为设计变量,开展机翼结构质量优化计算,优化结果表明,优化后的机翼结构在满足强度和刚度要求下质量减轻约47.77％,可为尾座式电动飞机结构设计提供重要参考. 相似文献
154.
155.
针对红外观测站部署问题,在研究观测站位置对定位精度影响的基础上,提出了基于粒子群优化的观测站部署算法。首先对ECEF坐标系下的CRLB矩阵进行推导;然后将观测站优化部署问题抽象为非线性规划模型,并将红外传感器联合定位的CRLB作为目标函数;最后采用粒子群优化算法求解该模型,避免了传统的非线性规划算法需要求解目标函数梯度的难题。结果表明,本文的部署算法具有一定的理论依据和工程意义;可以为实际红外观测站的静态部署和动态部署提供参考。 相似文献
156.
海军建设任务重、周期长、投入大的特点决定了持续推进强大海军建设,必须要有良好的法治环境作基础。文章坚持运用辩证唯物主义的立场、观点和方法,通过对近代中日两国海军建设在经费投入、规划审定、法规制定三个方面具体做法的比较,深入分析了近代中日两国海军兴亡背后的法制因素,指出当前持续推进强大海军建设必须深入学习贯彻党的十八届四中全会精神,按照依法治军方略,强力推进依法治军进程。 相似文献
157.
In this study, we analyze the joint pricing and inventory management during new product introduction when product shortage creates additional demand due to hype. We develop a two‐period model in which a firm launches its product at the beginning of the first period, before it observes sales in the two periods. The product is successful with an exogenous probability, or unsuccessful with the complementary probability. The hype in the second period is observed only when the product is successful. The firm learns the actual status of the product only after observing the first‐period demand. The firm must decide the stocking level and price of the product jointly at the beginning of each of the two periods. In this article, we derive some structural properties of the optimal prices and inventory levels, and show that (i) firms do not always exploit hype, (ii) firms do not always increase the price of a successful product in the second period, (iii) firms may price out an unsuccessful product in the first period if the success probability is above a threshold, and (iv) such a threshold probability is decreasing in the first‐period market potential of the successful product. © 2015 Wiley Periodicals, Inc. Naval Research Logistics 62: 304–320, 2015 相似文献
158.
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 相似文献
159.
The idea of deploying noncollocated sources and receivers in multistatic sonar networks (MSNs) has emerged as a promising area of opportunity in sonar systems. This article is one of the first to address point coverage problems in MSNs, where a number of points of interest have to be monitored in order to protect them from hostile underwater assets. We consider discrete “definite range” sensors as well as various diffuse sensor models. We make several new contributions. By showing that the convex hull spanned by the targets is guaranteed to contain optimal sensor positions, we are able to limit the solution space. Under a definite range sensor model, we are able to exclude even more suboptimal solutions. We then formulate a nonlinear program and an integer nonlinear program to express the sensor placement problem. To address the nonconvex single‐source placement problem, we develop the Divide Best Sector (DiBS) algorithm, which quickly provides an optimal source position assuming fixed receivers. Starting with a basic implementation of DiBS, we show how incorporating advanced sector splitting methods and termination conditions further improve the algorithm. We also discuss two ways to use DiBS to find multiple source positions by placing sensors iteratively or simultaneously. © 2017 Wiley Periodicals, Inc. Naval Research Logistics 64: 287–304, 2017 相似文献
160.
Harold P. Benson 《海军后勤学研究》2006,53(4):309-317
The purpose of this article is to present an algorithm for globally maximizing the ratio of two convex functions f and g over a convex set X. To our knowledge, this is the first algorithm to be proposed for globally solving this problem. The algorithm uses a branch and bound search to guarantee that a global optimal solution is found. While it does not require the functions f and g to be differentiable, it does require that subgradients of g can be calculated efficiently. The main computational effort of the algorithm involves solving a sequence of subproblems that can be solved by convex programming methods. When X is polyhedral, these subproblems can be solved by linear programming procedures. Because of these properties, the algorithm offers a potentially attractive means for globally maximizing ratios of convex functions over convex sets. © 2006 Wiley Periodicals, Inc. Naval Research Logistics, 2006 相似文献