全文获取类型
收费全文 | 567篇 |
免费 | 252篇 |
国内免费 | 46篇 |
出版年
2024年 | 6篇 |
2023年 | 10篇 |
2022年 | 6篇 |
2021年 | 14篇 |
2020年 | 11篇 |
2019年 | 15篇 |
2018年 | 7篇 |
2017年 | 26篇 |
2016年 | 24篇 |
2015年 | 23篇 |
2014年 | 43篇 |
2013年 | 38篇 |
2012年 | 42篇 |
2011年 | 57篇 |
2010年 | 39篇 |
2009年 | 42篇 |
2008年 | 29篇 |
2007年 | 45篇 |
2006年 | 40篇 |
2005年 | 32篇 |
2004年 | 44篇 |
2003年 | 20篇 |
2002年 | 26篇 |
2001年 | 29篇 |
2000年 | 27篇 |
1999年 | 35篇 |
1998年 | 25篇 |
1997年 | 21篇 |
1996年 | 11篇 |
1995年 | 6篇 |
1994年 | 15篇 |
1993年 | 13篇 |
1992年 | 18篇 |
1991年 | 9篇 |
1990年 | 9篇 |
1989年 | 5篇 |
1988年 | 2篇 |
1987年 | 1篇 |
排序方式: 共有865条查询结果,搜索用时 15 毫秒
251.
从信息管理系统的模式出发,分析了系统的结构模式,并对由此产生的并发控制问题,应用时间戳法进行了分析处理,用触发器存储过程解决了对数据的随时更新问题。本系统以Sybase作为数据库,设计并实现了药库管理系统。 相似文献
252.
数字化部队指挥网络系统效能评价模型 总被引:5,自引:0,他引:5
以结构熵理论为基础,分析数字化部队作战指挥信息网络系统组织结构对系统内信息流的影响,从信息的角度对系统组织结构的有序度进行评价,引入信息流的时效和质量的概念,建立定量评价系统结构有序度计算的时效质量模型,结合系统数据传输业务效能的评价方法,形成作战指挥信息网络系统整体综合效能的评价模型。最后辅以实例。 相似文献
253.
Discrete‐time queues with D‐MAP arrival process are more useful in modeling and performance analysis of telecommunication networks based on the ATM environment. This paper analyzes a finite‐buffer discrete‐time queue with general bulk‐service rule, wherein the arrival process is D‐MAP and service times are arbitrarily and independently distributed. The distributions of buffer contents at various epochs (departure, random, and prearrival) have been obtained using imbedded Markov chain and supplementary variable methods. Finally, some performance measures such as loss probability and average delay are discussed. Numerical results are also presented in some cases. © 2003 Wiley Periodicals, Inc. Naval Research Logistics 50: 345–363, 2003. 相似文献
254.
T.C. Edwin Cheng Qing Ding Mikhail Y. Kovalyov Aleksander Bachman Adam Janiak 《海军后勤学研究》2003,50(6):531-554
We study the problems of scheduling a set of nonpreemptive jobs on a single or multiple machines without idle times where the processing time of a job is a piecewise linear nonincreasing function of its start time. The objectives are the minimization of makespan and minimization of total job completion time. The single machine problems are proved to be NP‐hard, and some properties of their optimal solutions are established. A pseudopolynomial time algorithm is constructed for makespan minimization. Several heuristics are derived for both total completion time and makespan minimization. Computational experiments are conducted to evaluate their efficiency. NP‐hardness proofs and polynomial time algorithms are presented for some special cases of the parallel machine problems. © 2003 Wiley Periodicals, Inc. Naval Research Logistics 50: 531–554, 2003 相似文献
255.
The service‐provision problem described in this paper comes from an application of distributed processing in telecommunications networks. The objective is to maximize a service provider's profit from offering computational‐based services to customers. The service provider has limited capacity and must choose which of a set of software applications he would like to offer. This can be done dynamically, taking into consideration that demand for the different services is uncertain. The problem is examined in the framework of stochastic integer programming. Approximations and complexity are examined for the case when demand is described by a discrete probability distribution. For the deterministic counterpart, a fully polynomial approximation scheme is known 2 . We show that introduction of stochasticity makes the problem strongly NP‐hard, implying that the existence of such a scheme for the stochastic problem is highly unlikely. For the general case a heuristic with a worst‐case performance ratio that increases in the number of scenarios is presented. Restricting the class of problem instances in a way that many reasonable practical problem instances satisfy allows for the derivation of a heuristic with a constant worst‐case performance ratio. Worst‐case performance analysis of approximation algorithms is classical in the field of combinatorial optimization, but in stochastic programming the authors are not aware of any previous results in this direction. © 2003 Wiley Periodicals, Inc. Naval Research Logistics, 2003 相似文献
256.
257.
258.
为了定量分析风对反潜巡逻机应召搜索延迟时间的影响,根据飞行气象学中风对飞行的影响描述以及实际需求,建立了反潜巡逻机飞往潜艇初始概略位置的航路模型。研究结果证明了模型的正确性,并通过仿真分析了反潜巡逻机的航速和航向、风速和风向的变化对延迟时间的影响。结果表明风对延迟时间的影响是不能忽略的,为反潜巡逻机航路的优化、应召搜索效能的提高提供了决策依据。 相似文献
259.
引入自挤压工艺辅助超重力下燃烧合成制备Al2O3-ZrO2(4Y)共晶复合陶瓷,可有效地消除陶瓷制品的缩孔、缩松组织等缺陷,陶瓷致密性得到明显提高,同时又有效地抑制陶瓷裂纹萌生。XRD分析显示共晶陶瓷由α-Al2O3,t-ZrO2及少量的m-ZrO2三相组成,且随自挤压力增大,陶瓷中可相变的t-ZrO2的体积分数增加。SEM观察发现陶瓷的显微组织中的棒状共晶团随自挤压力的增大而细化,体积分数增加,且分布其上的t-ZrO2纤维直径变小,共晶团组织边缘处的ZrO2枝晶逐渐转变为细小的球晶,共晶团边界组织厚度逐渐减小,从而使陶瓷力学性能得以提升。 相似文献
260.
设计了一种利用单孔径双极化天线进行GPS自适应抗干扰的方法,并对算法的性能进行了详细的分析.新方法在不降低卫星信号质量的前提下,仅占用单个天线位置,就可以对付窄带或宽带干扰,为增强安装受限装备的导航抗干扰能力提供了一种新的解决方案.仿真结果表明,新方法可行、有效. 相似文献