全文获取类型
收费全文 | 531篇 |
免费 | 259篇 |
国内免费 | 61篇 |
专业分类
851篇 |
出版年
2024年 | 6篇 |
2023年 | 12篇 |
2022年 | 15篇 |
2021年 | 12篇 |
2020年 | 25篇 |
2019年 | 21篇 |
2018年 | 16篇 |
2017年 | 48篇 |
2016年 | 54篇 |
2015年 | 34篇 |
2014年 | 70篇 |
2013年 | 40篇 |
2012年 | 61篇 |
2011年 | 52篇 |
2010年 | 32篇 |
2009年 | 54篇 |
2008年 | 36篇 |
2007年 | 38篇 |
2006年 | 55篇 |
2005年 | 34篇 |
2004年 | 22篇 |
2003年 | 18篇 |
2002年 | 19篇 |
2001年 | 12篇 |
2000年 | 7篇 |
1999年 | 11篇 |
1998年 | 8篇 |
1997年 | 1篇 |
1996年 | 4篇 |
1995年 | 7篇 |
1994年 | 4篇 |
1993年 | 5篇 |
1992年 | 3篇 |
1991年 | 5篇 |
1990年 | 4篇 |
1989年 | 6篇 |
排序方式: 共有851条查询结果,搜索用时 15 毫秒
761.
We consider a design problem for wastewater treatment systems that considers uncertainty in pollutant concentration levels at water sources. The goal is to optimize the selection of treatment technologies and pipeline connections, so that treated wastewater can achieve specified effluents discharge limits as well as possible. We propose a new two-stage model to optimize a set of guarantee levels, that is, the maximum concentration level of source pollutants for which treated wastewater can be compliant with discharge limits. In the first stage, treatment technologies and pipeline connections are selected. In the second stage, when pollutant concentration levels are revealed, wastewater distribution and mixing are determined. A key attractiveness of the proposed guarantee rate optimization model is that it can be simplified into a single-stage mixed-integer linear program. In our numerical experiments based on real-world pollutants data, the guarantee rate model demonstrates its advantages in terms of computational efficiency, scalability and solution quality, compared with the standard probability maximization model. Finally, the methodology proposed in this paper can also be applied to other two-stage problems under uncertainty with similar uncertainty characteristics. 相似文献
762.
基于所提出的火力分配方案,使用数值积分方法将对均匀分布集群目标射击的火力分配优化问题转化为由多变量初等函数表示的积分和函数在单位多面正方体内的最小值求解问题,火力分配优化的瞄准点坐标可以尝试利用成熟的Matlab优化计算软件来直接求解,算例说明所给出方法对于火力分配优化问题的深入研究是有裨益的. 相似文献
763.
变薄拔伸是厚壁深筒件生产的关键工序,成形难度大.针对现行的拔伸成形工艺,为改善成形稳定性、提高成形质量、延长模具寿命,通过采用刚粘塑性有限元法,根据不同参数和条件,在计算机上对拔伸工艺进行数值模拟分析,分别讨论了拔伸模圈道数、变形量分配、模圈间距及入模角等因素对拔伸成形过程的影响,进而提出了"多模短距长拔"、变形量依次递减和较小入模角等优化措施.这样既减少了大量现场试验,又达到了工艺优化的目的. 相似文献
764.
针对防空部署研究的特点,探讨遗传算法求解防空部署优化问题。分析了传统遗传算法求解武器部署优化问题的缺点,提出了并行的基因组合型改进遗传算法,克服了编码不唯一和基因重码的现象,提高了搜索速度和解的质量;利用启发式信息缩小了解空间,并保证了算法寻优的每个个体都是可行解;对遗传操作算子进行了改进,克服了整数编码固有的缺点。该方法应用于求解防空部署优化问题中得到了较好的结果。 相似文献
765.
766.
Sven Axsäter 《海军后勤学研究》2007,54(5):485-491
A two‐echelon distribution inventory system with a central warehouse and a number of retailers is considered. The retailers face stochastic demand and replenish from the warehouse, which, in turn, replenishes from an outside supplier. The system is reviewed continuously and demands that cannot be met directly are backordered. Standard holding and backorder costs are considered. In the literature on multi‐echelon inventory control it is standard to assume that backorders at the warehouse are served according to a first come–first served policy (FCFS). This allocation rule simplifies the analysis but is normally not optimal. It is shown that the FCFS rule can, in the worst case, lead to an asymptotically unbounded relative cost increase as the number of retailers approaches infinity. We also provide a new heuristic that will always give a reduction of the expected costs. A numerical study indicates that the average cost reduction when using the heuristic is about two percent. The suggested heuristic is also compared with two existing heuristics. © 2007 Wiley Periodicals, Inc. Naval Research Logistics, 2007 相似文献
767.
介绍了用于舰船蒸汽动力装置热线图优化的可视化程序设计与研究.阐述了软件的主要功能、开发环境、数据库设计以及关键技术问题的解决途径.程序能通过调整各种设计参数来得到良好的热线图. 相似文献
768.
基于马尔柯夫决策过程动态WTA最优化模型分析 总被引:2,自引:0,他引:2
在作战过程中,通过把目标群的威胁程度作为目标函数制定决策,可将目标分配决策过程变成马尔柯夫决策过程.即首先对攻防作战态势进行抽象性描述,建立基于马尔柯夫决策过程动态WTA最优化模型,然后提出了有限次迭代求解最优策略的新方法,并进行了算例验证和分析.结果表明该方法可使武器系统获得最大的射击效率,并能有效地减少重点目标突防的概率. 相似文献
769.
A districting problem is formulated as a network partitioning model where each link has one weight to denote travel time and another weight to denote workload. The objective of the problem is to minimize the maximum diameter of the districts while equalizing the workload among the districts. The case of tree networks is addressed and efficient algorithms are developed when the network is to be partitioned into two or three districts. © 2002 Wiley Periodicals, Inc. Naval Research Logistics 49: 143–158, 2002; DOI 10.1002/nav.10003 相似文献
770.