全文获取类型
收费全文 | 417篇 |
免费 | 126篇 |
国内免费 | 11篇 |
出版年
2023年 | 1篇 |
2022年 | 3篇 |
2021年 | 14篇 |
2020年 | 2篇 |
2019年 | 7篇 |
2018年 | 3篇 |
2017年 | 8篇 |
2016年 | 13篇 |
2015年 | 20篇 |
2014年 | 19篇 |
2013年 | 72篇 |
2012年 | 12篇 |
2011年 | 13篇 |
2010年 | 13篇 |
2009年 | 24篇 |
2008年 | 16篇 |
2007年 | 32篇 |
2006年 | 18篇 |
2005年 | 30篇 |
2004年 | 10篇 |
2003年 | 13篇 |
2002年 | 17篇 |
2001年 | 10篇 |
2000年 | 12篇 |
1999年 | 28篇 |
1998年 | 19篇 |
1997年 | 27篇 |
1996年 | 16篇 |
1995年 | 14篇 |
1994年 | 11篇 |
1993年 | 10篇 |
1992年 | 6篇 |
1991年 | 6篇 |
1990年 | 7篇 |
1989年 | 6篇 |
1988年 | 4篇 |
1987年 | 7篇 |
1986年 | 3篇 |
1985年 | 1篇 |
1983年 | 4篇 |
1982年 | 2篇 |
1977年 | 1篇 |
排序方式: 共有554条查询结果,搜索用时 203 毫秒
31.
提出了有限元方法和数值积分相结合获得多柔体系统集中参数模型的近似方法,并基于lagrange方程,对有根树型拓扑结构的多柔体系统进行建模。 相似文献
32.
交互系统是一体化建模仿真环境中的一个重要环节,主要解决人机关系,使用户可以方便地与仿真机作高速通讯,对仿真运行进行实时监控。本文在简要介绍整个系统概况的基础上,对交互系统的总体设计、命令分析与处理、功能实现等几个方面展开了讨论。此外,还简单介绍了交互界面的设计和实现情况 相似文献
33.
As a complex system with multiple components usually deteriorates with age, preventive maintenance (PM) is often performed to keep the system functioning in a good state to prolong its effective age. In this study, a nonhomogeneous Poisson process with a power law failure intensity is used to describe the deterioration of a repairable system, and the optimal nonperiodic PM schedule can be determined to minimize the expected total cost per unit time. However, since the determination of such optimal PM policies may involve numerous uncertainties, which typically make the analyses difficult to perform because of the scarcity of data, a Bayesian decision model, which utilizes all available information effectively, is also proposed for determining the optimal PM strategies. A numerical example with a real failure data set is used to illustrate the effectiveness of the proposed approach. The results show that the optimal schedules derived by Bayesian approach are relatively more conservative than that for non‐Bayesian approach because of the uncertainty of the intensity function, and if the intensity function are updated using the collected data set, which indicates more severe deterioration than the prior belief, replacing the entire system instead of frequent PM activities before serious deterioration is suggested. © 2010 Wiley Periodicals, Inc. Naval Research Logistics, 2010 相似文献
34.
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 相似文献
35.
Joseph Y.‐T. Leung 《海军后勤学研究》2002,49(4):422-431
We consider the problem of sequencing n jobs on a single machine, with each job having a processing time and a common due date. The common due date is assumed to be so large that all jobs can complete by the due date. It is known that there is an O(n log n)‐time algorithm for finding a schedule with minimum total earliness and tardiness. In this article, we consider finding a schedule with dual criteria. The primary goal is to minimize the total earliness and tardiness. The secondary goals are to minimize: (1) the maximum earliness and tardiness; (2) the sum of the maximum of the squares of earliness and tardiness; (3) the sum of the squares of earliness and tardiness. For the first two criteria, we show that the problems are NP‐hard and we give a fully polynomial time approximation scheme for both of them. For the last two criteria, we show that the ratio of the worst schedule versus the best schedule is no more than . © 2002 Wiley Periodicals, Inc. Naval Research Logistics 49: 422–431, 2002; Published online in Wiley InterScience (www.interscience.wiley.com). DOI 10.1002/nav.10020 相似文献
36.
根据前人对海浪感应磁场研究的成果,在海浪是平稳正态随机过程的假设下,求出了飞行器接收的海浪感应磁场噪声功率谱的表达式.在讨论功率谱和飞行角度的关系时,发现海浪感应磁场随飞行角度变化,为低频、窄带大干扰或高频、宽带小干扰,并且在某些飞行角度会出现奇点.进行了仿真计算,结果符合理论表达式. 相似文献
37.
鉴于新一代机载预警相控阵雷达采用多波束且电子波束灵活可控的特点, 本文提出了一种多波束时域滑窗空时自适应处理方法。理论分析与计算机仿真实验表明, 该方法与现有的几种典型空时二维自适应信号处理 ( S T A P) 方法相比, 具有系统自由度低、低速目标检测性能好、鲁棒性强等优点, 并且实现复杂度较低, 便于工程实现。 相似文献
38.
39.
40.