全文获取类型
收费全文 | 109篇 |
免费 | 40篇 |
国内免费 | 4篇 |
出版年
2023年 | 3篇 |
2021年 | 2篇 |
2020年 | 2篇 |
2019年 | 5篇 |
2018年 | 1篇 |
2017年 | 6篇 |
2016年 | 7篇 |
2015年 | 3篇 |
2014年 | 10篇 |
2013年 | 16篇 |
2012年 | 12篇 |
2011年 | 9篇 |
2010年 | 12篇 |
2009年 | 7篇 |
2008年 | 4篇 |
2007年 | 9篇 |
2006年 | 7篇 |
2005年 | 5篇 |
2004年 | 3篇 |
2003年 | 4篇 |
2002年 | 5篇 |
2001年 | 5篇 |
2000年 | 3篇 |
1999年 | 1篇 |
1998年 | 2篇 |
1997年 | 1篇 |
1996年 | 1篇 |
1995年 | 1篇 |
1994年 | 1篇 |
1993年 | 3篇 |
1992年 | 2篇 |
1990年 | 1篇 |
排序方式: 共有153条查询结果,搜索用时 15 毫秒
1.
航天器进行气动力辅助异面变轨时 ,确定可达范围 (变轨结束时的倾角和升交点赤经 )是一个十分重要的问题。文中利用坐标变化法 ,得到了由初始轨道倾角为 0时的倾角改变量 ,确定任意初始倾角下可达范围的公式 ,使求解大为简化 相似文献
2.
In this paper we consider the capacitated multi‐facility Weber problem with the Euclidean, squared Euclidean, and ?p‐distances. This problem is concerned with locating m capacitated facilities in the Euclidean plane to satisfy the demand of n customers with the minimum total transportation cost. The demand and location of each customer are known a priori and the transportation cost between customers and facilities is proportional to the distance between them. We first present a mixed integer linear programming approximation of the problem. We then propose new heuristic solution methods based on this approximation. Computational results on benchmark instances indicate that the new methods are both accurate and efficient. © 2006 Wiley Periodicals, Inc. Naval Research Logistics 2006 相似文献
3.
用Hyperchem 7.0软件的半经验分子轨道法(Semi-empirical-AM1)和分子力学(Molecular Dynamics)法计算了二羟基苯氧基硅烷不同合成过程反应的焓变,对反应途径进行优选,计算了产物的IR谱图,并与实验结果进行了对比。研究表明,以对苯二酚与二乙氧基硅烷进行反应制备二羟基苯氧基硅烷在热力学上是有利的,可得到目标产物;Hyperchem 7.0软件用于新型有机硅化合物合成途径优化及产物表征具有一定的应用价值。 相似文献
4.
5.
刘小舟 《中国人民武装警察部队学院学报》2007,23(2):55-57
简述了灰色系统理论的基本概念与方法,并着重阐述了灰色理论中灾变预测的特点和其建模过程,并将其应用于实际火灾预测之中。 相似文献
6.
大整数乘除运算在PC机上的实现 总被引:3,自引:0,他引:3
大整数在要求高精度的应用中非常有用.特别是大质数和一般大整数有一个极为重要的应用,就是关于计算机数据加密.在计算机数据加密技术中,常会遇到大整数的算术运算问题.由于所使用的机器和所用语言的限制,大整数的"乘""模"两种运算很难运用高级语言中的"乘""除"运算.提出了一种逐位存储、按字节运算的方法,并用C 实现了大整数的十进制乘除法运算,之后将提出的算法与类似算法的时间复杂度进行了比较,最后给出了算法的运行时间. 相似文献
7.
Subspace dynamic‐simplex linear interpolation search for mixed‐integer black‐box optimization problems 下载免费PDF全文
Honggang Wang 《海军后勤学研究》2017,64(4):305-322
Design and management of complex systems with both integer and continuous decision variables can be guided using mixed‐integer optimization models and analysis. We propose a new mixed‐integer black‐box optimization (MIBO) method, subspace dynamic‐simplex linear interpolation search (SD‐SLIS), for decision making problems in which system performance can only be evaluated with a computer black‐box model. Through a sequence of gradient‐type local searches in subspaces of solution space, SD‐SLIS is particularly efficient for such MIBO problems with scaling issues. We discuss the convergence conditions and properties of SD‐SLIS algorithms for a class of MIBO problems. Under mild conditions, SD‐SLIS is proved to converge to a stationary solution asymptotically. We apply SD‐SLIS to six example problems including two MIBO problems associated with petroleum field development projects. The algorithm performance of SD‐SLIS is compared with that of a state‐of‐the‐art direct‐search method, NOMAD, and that of a full space simplex interpolation search, Full‐SLIS. The numerical results suggest that SD‐SLIS solves the example problems efficiently and outperforms the compared methods for most of the example cases. © 2017 Wiley Periodicals, Inc. Naval Research Logistics 64: 305–322, 2017 相似文献
8.
一种基于部分搜索的GNSS模糊度解算方法 总被引:2,自引:0,他引:2
为解决LAMBDA算法搜索策略效率不高的问题,提出了一种基于部分搜索的模糊度解算新方法。该方法的解算成功率接近LAMBDA算法,且只需对最后3维模糊度元素采取搜索策略。同时,通过合理设定搜索椭球的大小和搜索策略;大大提高了搜索效率。通过实验对该新算法与Bootraping算法、LAMBDA算法进行了比较分析,进一步验证了该新算法的有效性。 相似文献
9.
10.
B. Jay Coleman 《海军后勤学研究》2014,61(1):17-33
This article presents two meta‐ranking models that minimize or nearly minimize violations of past game results while predicting future game winners as well as or better than leading current systems—a combination never before offered for college football. Key to both is the development and integration of a highly predictive ensemble probability model generated from the analysis of 36 existing college football ranking systems. This ensemble model is used to determine a target ranking that is used in two versions of a hierarchical multiobjective mixed binary integer linear program (MOMBILP). When compared to 75 other systems out‐of‐sample, one MOMBILP was the leading predictive system while getting within 0.64% of the retrodictive optimum; the other MOMBILP minimized violations while achieving a prediction total that was 2.55% lower than the best mark. For bowls, prediction sums were not statistically significantly different from the leading value, while achieving optimum or near‐optimum violation counts. This performance points to these models as potential means of reconciling the contrasting perspectives of predictiveness versus the matching of past performance when it comes to ranking fairness in college football. © 2013 Wiley Periodicals, Inc. Naval Research Logistics 61: 17–33, 2014 相似文献