全文获取类型
收费全文 | 1401篇 |
免费 | 439篇 |
国内免费 | 207篇 |
出版年
2024年 | 4篇 |
2023年 | 17篇 |
2022年 | 18篇 |
2021年 | 31篇 |
2020年 | 37篇 |
2019年 | 33篇 |
2018年 | 24篇 |
2017年 | 66篇 |
2016年 | 104篇 |
2015年 | 56篇 |
2014年 | 117篇 |
2013年 | 115篇 |
2012年 | 132篇 |
2011年 | 95篇 |
2010年 | 88篇 |
2009年 | 128篇 |
2008年 | 85篇 |
2007年 | 109篇 |
2006年 | 139篇 |
2005年 | 117篇 |
2004年 | 91篇 |
2003年 | 75篇 |
2002年 | 59篇 |
2001年 | 54篇 |
2000年 | 33篇 |
1999年 | 41篇 |
1998年 | 35篇 |
1997年 | 30篇 |
1996年 | 20篇 |
1995年 | 16篇 |
1994年 | 12篇 |
1993年 | 12篇 |
1992年 | 14篇 |
1991年 | 13篇 |
1990年 | 20篇 |
1989年 | 6篇 |
1987年 | 1篇 |
排序方式: 共有2047条查询结果,搜索用时 15 毫秒
141.
刘伟斌 《中国人民武装警察部队学院学报》2010,(11):74-76
考核是军队院校教育教学中的重要组成部分,加强考核模式改革事关军队院校教育的全局。应根据军队院校考核模式的特点、存在的问题以及多元互动式教学模式的构建,为军队院校考核改革提出解决之策。 相似文献
142.
军队抢险救灾物资消耗的确定,一直是困扰着各级部队的难题,也是影响部队战斗力再生的重要因素。军队抢险救灾物资消耗的确定可采用确定资金和确定实物来完成。通过建立数学模型对物资消耗进行计算,利用实例分析验证物资消耗模型。通过物资消耗模型解决了以往物资消耗确定的难题,减少了部队抢险救灾的隐形消耗。 相似文献
143.
沈珏敏 《武警工程学院学报》2010,(3):73-75
由于军队的纪律性与服从性,使得军队的院校教育模式多了一层神秘感。在军队院校中,师生之间如何互动,才能达到理想的教学效果,成了近年来研究的热点。军队院校中,教师的权威固然不可缺少,但是民主的氛围同样可以遍及课堂。权威与民主,两者并非对立。权威与民主并存,应该成为现今军队院校教育中师生互动的理想模式。 相似文献
144.
焦向磊 《武警工程学院学报》2010,(5):84-86
武警院校拥有丰富的教育资源,依托武警部队日益健全的内部网络系统,大力开展现代远程教育,能够更加紧密院校与部队的联系,及时了解部队的需求,制定出更加符合部队实际的课程体系,更大限度发挥现有教学资源的效益。由于远程教育具有方便快捷,受时间、空间局限小的特性,弥补了由于武警部队点多、线长、面广,分布相对分散,导致部队官兵学习时间不固定、人员难以集中等不便的问题,为武警部队官兵获取文化知识,学习科学技术提供了新的途径。 相似文献
145.
146.
普适计算的适应性特征对于软件重用的要求决定了构件模型是目前普适计算软件体系结构的理想选择.在面向普适计算的自适应软件平台UbiStar的研究过程中,为了准确地对普适应用中构件的外部特征进行抽象描述,参考了CORBA构件模型使用IDL3和CIDL对构件进行特征抽象的方法,结合UbiStar普适计算平台的特点与需求,提出了一种适用于普适计算环境的构件定义语言UCDL,并且给出了一个应用示例. 相似文献
147.
信息中心网络(Information-Centric Networking, ICN)“泛在缓存”的特性,引发数据副本率过高、缓存空间不能充分利用等问题。为了解决上述问题,分别从用户、服务提供商和网络运营商的角度出发,以最小化网络流量与网络费用开销为优化目标建立两个单目标优化模型,并将二者结合为帕累托模型;基于帕累托求解方法中数学规划法的思想,详细描述缓存节点位置选择算法。仿真结果表明:在流量性价比方面,所提缓存节点选择算法优于ICN的默认缓存机制;在网络费用开销方面,所提算法更适用于只有少数内容较为流行的网络中,而在所有内容都流行的情况下,ICN中默认的“遍地缓存”机制更为适宜。 相似文献
148.
The aim of this paper is to investigate the determinants of international arms transfers in a gravity model framework. By distinguishing between the decision to export arms (extensive margin) and the value of the arms exported (intensive margin), while also considering its interdependence, is what differentiates this paper from previous research. A theoretically justified gravity model of trade augmented with political and security motives is estimated using a two-stage panel data approach for 104 exporting countries over the period from 1950 to 2007. In addition to the usual gravity variables related to the economic mass of the trading countries and the trade cost factors, the model is extended with political and security factors. The level of democracy in both trading partners, political differences between trading partners and voting similarity with the United States in the UN General Assembly of the countries engaged in trade are the main political factors, whereas the existence of conflicts, military pacts, and embargoes are taken as security motives. The key result indicates that both political and security motives are an important determinant of an arms trade, but their effects on the extensive margin of exports (the decision to order a transfer) differs from their effect on the intensive margin (average value of exports). Moreover, the relative importance of the factors under study has changed since 1989. In the post-cold war period, countries that are less democratic are more likely to export arms, military pacts are less relevant and embargoes play a role. 相似文献
149.
We seek dynamic server assignment policies in finite‐capacity queueing systems with flexible and collaborative servers, which involve an assembly and/or a disassembly operation. The objective is to maximize the steady‐state throughput. We completely characterize the optimal policy for a Markovian system with two servers, two feeder stations, and instantaneous assembly and disassembly operations. This optimal policy allocates one server per station unless one of the stations is blocked, in which case both servers work at the unblocked station. For Markovian systems with three stations and instantaneous assembly and/or disassembly operations, we consider similar policies that move a server away from his/her “primary” station only when that station is blocked or starving. We determine the optimal assignment of each server whose primary station is blocked or starving in systems with three stations and zero buffers, by formulating the problem as a Markov decision process. Using this optimal assignment, we develop heuristic policies for systems with three or more stations and positive buffers, and show by means of a numerical study that these policies provide near‐optimal throughput. Furthermore, our numerical study shows that these policies developed for assembly‐type systems also work well in tandem systems. © 2008 Wiley Periodicals, Inc. Naval Research Logistics, 2008 相似文献
150.
This article presents new tools and methods for finding optimum step‐stress accelerated life test plans. First, we present an approach to calculate the large‐sample approximate variance of the maximum likelihood estimator of a quantile of the failure time distribution at use conditions from a step‐stress accelerated life test. The approach allows for multistep stress changes and censoring for general log‐location‐scale distributions based on a cumulative exposure model. As an application of this approach, the optimum variance is studied as a function of shape parameter for both Weibull and lognormal distributions. Graphical comparisons among test plans using step‐up, step‐down, and constant‐stress patterns are also presented. The results show that depending on the values of the model parameters and quantile of interest, each of the three test plans can be preferable in terms of optimum variance. © 2008 Wiley Periodicals, Inc. Naval Research Logistics, 2008 相似文献