全文获取类型
收费全文 | 105篇 |
免费 | 28篇 |
国内免费 | 11篇 |
出版年
2022年 | 1篇 |
2020年 | 6篇 |
2019年 | 5篇 |
2018年 | 1篇 |
2017年 | 7篇 |
2016年 | 5篇 |
2015年 | 7篇 |
2014年 | 8篇 |
2013年 | 9篇 |
2012年 | 7篇 |
2011年 | 4篇 |
2010年 | 2篇 |
2009年 | 9篇 |
2008年 | 3篇 |
2007年 | 4篇 |
2006年 | 6篇 |
2005年 | 6篇 |
2004年 | 6篇 |
2003年 | 7篇 |
2002年 | 1篇 |
2001年 | 4篇 |
2000年 | 4篇 |
1999年 | 4篇 |
1998年 | 2篇 |
1997年 | 5篇 |
1996年 | 1篇 |
1995年 | 1篇 |
1994年 | 2篇 |
1993年 | 1篇 |
1992年 | 7篇 |
1991年 | 3篇 |
1990年 | 3篇 |
1989年 | 3篇 |
排序方式: 共有144条查询结果,搜索用时 62 毫秒
141.
王波 《中国人民武装警察部队学院学报》2009,25(11):64-67,71
武警学院研究生教育已开办六年,分析六年来研究生教育的基本情况、取得的成绩和存在的问题,对于今后一个时期的研究生教育具有现实指导作用。 相似文献
142.
程序控制流图不能表示DA交互发生点处实际执行的SQL语句,因而不能清晰地表示出程序数据库的交互过程。针对该问题提出了用有限状态自动机表示DMLSQL语句,根据自动机的运行过程确定交互语句使用或定义的数据对象,并利用此信息生成表示交互语句的结点,以扩展CFG。实验表明,经过扩展后的ECFG能够直观地表示DA程序中与数据库的交互结构。 相似文献
143.
In this article, we define two different workforce leveling objectives for serial transfer lines. Each job is to be processed on each transfer station for c time periods (e.g., hours). We assume that the number of workers needed to complete each operation of a job in precisely c periods is given. Jobs transfer forward synchronously after every production cycle (i.e., c periods). We study two leveling objectives: maximin workforce size () and min range (R). Leveling objectives produce schedules where the cumulative number of workers needed in all stations of a transfer line does not experience dramatic changes from one production cycle to the next. For and a two‐station system, we develop a fast polynomial algorithm. The range problem is known to be NP‐complete. For the two‐station system, we develop a very fast optimal algorithm that uses a tight lower bound and an efficient procedure for finding complementary Hamiltonian cycles in bipartite graphs. Via a computational experiment, we demonstrate that range schedules are superior because not only do they limit the workforce fluctuations from one production cycle to the next, but they also do so with a minor increase in the total workforce size. We extend our results to the m‐station system and develop heuristic algorithms. We find that these heuristics work poorly for min range (R), which indicates that special structural properties of the m‐station problem need to be identified before we can develop efficient algorithms. © 2016 Wiley Periodicals, Inc. Naval Research Logistics 63: 577–590, 2016 相似文献
144.
Rajeswari Pillai Rajagopalan 《The Nonproliferation Review》2019,26(5-6):465-479
ABSTRACTOver the last five decades, India’s nuclear and space programs have gone through several phases, from collaboration to divorce to supportive. An interplay of two factors determined the nature of the relationship. One was the state of India’s nuclear-weapon program. The second was international conditions, especially India’s relationship with the nuclear-nonproliferation regime. In the early decades, because of the rudimentary nature of India’s nuclear and space programs, the relationship was collaborative, since the rocket technology being developed was a necessary adjunct to the nuclear-weapon program. Subsequently, as India’s rocketry capabilities and nuclear-weapon program began to mature and concerns about international sanctions under the non-proliferation regime began to grow, the two programs were separated. The Indian rocketry program was also divided, with the civilian-space and ballistic-missile programs clearly demarcated. After India declared itself a nuclear-weapon state in 1998 and the programs matured, the relationship has become more supportive. As the two programs mature further, this relationship is likely to deepen, as the nuclear-weapon program requires space assets to build a robust and survivable nuclear deterrent force. 相似文献