全文获取类型
收费全文 | 517篇 |
免费 | 8篇 |
出版年
2021年 | 5篇 |
2020年 | 5篇 |
2019年 | 5篇 |
2017年 | 10篇 |
2016年 | 13篇 |
2015年 | 10篇 |
2014年 | 10篇 |
2013年 | 71篇 |
2012年 | 22篇 |
2011年 | 27篇 |
2010年 | 22篇 |
2009年 | 15篇 |
2008年 | 27篇 |
2007年 | 15篇 |
2006年 | 16篇 |
2005年 | 5篇 |
2004年 | 4篇 |
2002年 | 5篇 |
2001年 | 4篇 |
1998年 | 7篇 |
1997年 | 7篇 |
1996年 | 4篇 |
1995年 | 6篇 |
1994年 | 4篇 |
1993年 | 12篇 |
1992年 | 8篇 |
1991年 | 6篇 |
1990年 | 4篇 |
1989年 | 16篇 |
1988年 | 4篇 |
1987年 | 12篇 |
1986年 | 12篇 |
1985年 | 11篇 |
1983年 | 7篇 |
1982年 | 5篇 |
1981年 | 8篇 |
1980年 | 9篇 |
1979年 | 11篇 |
1978年 | 4篇 |
1977年 | 8篇 |
1976年 | 7篇 |
1975年 | 8篇 |
1973年 | 4篇 |
1972年 | 12篇 |
1971年 | 3篇 |
1970年 | 3篇 |
1969年 | 9篇 |
1968年 | 8篇 |
1967年 | 3篇 |
1966年 | 3篇 |
排序方式: 共有525条查询结果,搜索用时 15 毫秒
141.
142.
143.
C4ISR(Command、Control、Communication、Computer、Intelligence、Surveillance and Reconnaissance)系统开发的仿真活动贯穿于系统全生命周期的各个阶段,仿真支持过程联系着C4ISR系统开发仿真的各类要素。首先对C4ISR系统开发仿真支持的内容进行分析,从生命周期维、仿真产品维和仿真任务维三个维度描述仿真支持内容之间的联系。然后分析了C4ISR系统开发仿真支持过程的层次性,应用UML描述了支持过程中的仿真项目模型和仿真过程模型。在此基础上,应用基于Petri网的工作流网,对C4ISR系统开发的仿真支持过程进行建模,分析了支持过程中活动、产品、角色、约束四类要素的Petri网表示方式。最后在一个C4ISR系统开发仿真支持实例中应用以上分析和建模方法,验证了方法的可行性和应用效果。 相似文献
144.
大规模地形作为分布式虚拟战场的重要组成部分,在非常有限的资源下,很难达到实时性绘制。针对此问题,设计了两级三层的概要四叉树组织地形数据,用多线程模式算法调度数据,以提高庞大地形数据的交互速率;提出基于衔接索引模板的算法来消除裂缝,实现不同细节层次的无缝拼接;引入样本纹理堆栈的纹理合成算子,增强各层次细节地貌的逼真表现。实验表明:该方法能够很好地实现战场环境下地形的实时性绘制,提供稳定的视觉漫游效果。 相似文献
145.
Consider a stochastic simulation experiment consisting of v independent vector replications consisting of an observation from each of k independent systems. Typical system comparisons are based on mean (long‐run) performance. However, the probability that a system will actually be the best is sometimes more relevant, and can provide a very different perspective than the systems' means. Empirically, we select one system as the best performer (i.e., it wins) on each replication. Each system has an unknown constant probability of winning on any replication and the numbers of wins for the individual systems follow a multinomial distribution. Procedures exist for selecting the system with the largest probability of being the best. This paper addresses the companion problem of estimating the probability that each system will be the best. The maximum likelihood estimators (MLEs) of the multinomial cell probabilities for a set of v vector replications across k systems are well known. We use these same v vector replications to form vk unique vectors (termed pseudo‐replications) that contain one observation from each system and develop estimators based on AVC (All Vector Comparisons). In other words, we compare every observation from each system with every combination of observations from the remaining systems and note the best performer in each pseudo‐replication. AVC provides lower variance estimators of the probability that each system will be the best than the MLEs. We also derive confidence intervals for the AVC point estimators, present a portion of an extensive empirical evaluation and provide a realistic example. © 2002 Wiley Periodicals, Inc. Naval Research Logistics 49: 341–358, 2002; Published online in Wiley InterScience (www.interscience.wiley.com). DOI 10.1002/nav.10019 相似文献
146.
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. 相似文献
147.
Clustering problems are often difficult to solve due to nonlinear cost functions and complicating constraints. Set partitioning formulations can help overcome these challenges, but at the cost of a very large number of variables. Therefore, techniques such as delayed column generation must be used to solve these large integer programs. The underlying pricing problem can suffer from the same challenges (non‐linear cost, complicating constraints) as the original problem, however, making a mathematical programming approach intractable. Motivated by a real‐world problem in printed circuit board (PCB) manufacturing, we develop a search‐based algorithm (Rank‐Cluster‐and‐Prune) as an alternative, present computational results for the PCB problem to demonstrate the tractability of our approach, and identify a broader class of clustering problems for which this approach can be used. © 2009 Wiley Periodicals, Inc. Naval Research Logistics 2009 相似文献
148.
149.
150.
履带车辆动力舱空气流场的CFD模拟与试验研究 总被引:2,自引:0,他引:2
以某履带车辆动力舱为研究对象,建立了舱内空气流动与传热计算的物理模型和数学模型,采用标准k-ε方程湍流模型对动力舱内的空气流动进行了描述,采用Fluent软件中的薄面模型对散热器与冷却风扇进行了简化处理,对舱内空气的速度场和温度场进行了三维数值模拟,采用热线风速仪对进、排气窗处的气体流速与温度进行了试验测试,测试值与模拟值的最大相对误差为9.42%,精度能够满足工程需要,表明该计算模型合理可行。 相似文献