全文获取类型
收费全文 | 319篇 |
免费 | 126篇 |
国内免费 | 24篇 |
出版年
2024年 | 2篇 |
2022年 | 3篇 |
2021年 | 14篇 |
2020年 | 7篇 |
2019年 | 6篇 |
2018年 | 4篇 |
2017年 | 17篇 |
2016年 | 24篇 |
2015年 | 11篇 |
2014年 | 23篇 |
2013年 | 33篇 |
2012年 | 21篇 |
2011年 | 24篇 |
2010年 | 16篇 |
2009年 | 27篇 |
2008年 | 31篇 |
2007年 | 26篇 |
2006年 | 20篇 |
2005年 | 26篇 |
2004年 | 16篇 |
2003年 | 17篇 |
2002年 | 15篇 |
2001年 | 12篇 |
2000年 | 5篇 |
1999年 | 10篇 |
1998年 | 12篇 |
1997年 | 6篇 |
1996年 | 4篇 |
1995年 | 2篇 |
1994年 | 5篇 |
1993年 | 5篇 |
1992年 | 2篇 |
1991年 | 4篇 |
1990年 | 17篇 |
1989年 | 2篇 |
排序方式: 共有469条查询结果,搜索用时 15 毫秒
31.
王祖华 《中国人民武装警察部队学院学报》2010,26(8):9-11
为规范和统一基层消防部队制作灭火救援预案所使用的计算机图标符号,作者以字符库为基础,开发了在Office上使用的消防符号插件,以及软件在实际使用过程中的问题与效果,并探讨了灭火救援预案制图的发展方向。 相似文献
32.
CABAC(Context based Adaptive Binary Arithmetic Coding)是H.264/AVC主要档次以上配置中推荐采用的熵编码方法.相比其他的熵编码方法,CABAC能够节省编码码率,但其计算串行性强,不能较好适应片上多核环境.针对这一问题提出了基于多线程的CABAC并行编码方法.大量实验统计表明,该方法负载划分较为均衡,对序列熵编码的单独加速比最高可达1.78. 相似文献
33.
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 相似文献
34.
目前微小卫星正在积极地发展中,脉冲等离子体推力器是其推进系统的一个重要发展方向,为了能够将PPT成功地运用于空间,需对其羽流进行研究.将DSMC(Direct Simulation Monte-Carlo)/PIC(Particle in Cell)流体混合算法与一维MHD放电模型相结合,一体化模拟NASA Glenn PPT羽流,对不同出口偏转角的羽流场进行模拟,并与实验结果进行了比较.计算结果显示引入出口速度的偏转角提高了模型的羽流扩散能力,羽流的扩散角是影响羽流的一个主要因素. 相似文献
35.
36.
给出某地炮营通信系统信息传输的CSMA/CD(Carrier Sense Multiple Acces/Collision Detection)排队论模型,提出了信道争用和碰撞的问题,用单机和网络仿真分析了载波监听条件下通信失效的概率,给出信道争用和碰撞的几个性能指标,并利用软件的方法,提供了减少碰撞的方案 相似文献
37.
38.
39.
This study investigates the statistical process control application for monitoring queue length data in M/G/1 systems. Specifically, we studied the average run length (ARL) characteristics of two different control charts for detecting changes in system utilization. First, the nL chart monitors the sums of successive queue length samples by subgrouping individual observations with sample size n. Next is the individual chart with a warning zone whose control scheme is specified by two pairs of parameters, (upper control limit, du) and (lower control limit, dl), as proposed by Bhat and Rao (Oper Res 20 (1972) 955–966). We will present approaches to calculate ARL for the two types of control charts using the Markov chain formulation and also investigate the effects of parameters of the control charts to provide useful design guidelines for better performance. Extensive numerical results are included for illustration. © 2011 Wiley Periodicals, Inc. Naval Research Logistics, 2011 相似文献
40.
We study a stochastic inventory model of a firm that periodically orders a product from a make‐to‐order manufacturer. Orders can be shipped by a combination of two freight modes that differ in lead‐times and costs, although orders are not allowed to cross. Placing an order as well as each use of each freight mode has a fixed and a quantity proportional cost. The decision of how to allocate units between the two freight modes utilizes information about demand during the completion of manufacturing. We derive the optimal freight mode allocation policy, and show that the optimal policy for placing orders is not an (s,S) policy in general. We provide tight bounds for the optimal policy that can be calculated by solving single period problems. Our analysis enables insights into the structure of the optimal policy specifying the conditions under which it simplifies to an (s,S) policy. We characterize the best (s,S) policy for our model, and through extensive numerical investigation show that its performance is comparable with the optimal policy in most cases. Our numerical study also sheds light on the benefits of the dual freight model over the single freight models. © 2011 Wiley Periodicals, Inc. Naval Research Logistics, 2011 相似文献