全文获取类型
收费全文 | 2454篇 |
免费 | 642篇 |
国内免费 | 246篇 |
出版年
2024年 | 3篇 |
2023年 | 24篇 |
2022年 | 20篇 |
2021年 | 66篇 |
2020年 | 57篇 |
2019年 | 46篇 |
2018年 | 32篇 |
2017年 | 161篇 |
2016年 | 197篇 |
2015年 | 110篇 |
2014年 | 199篇 |
2013年 | 195篇 |
2012年 | 203篇 |
2011年 | 182篇 |
2010年 | 134篇 |
2009年 | 248篇 |
2008年 | 182篇 |
2007年 | 178篇 |
2006年 | 198篇 |
2005年 | 160篇 |
2004年 | 126篇 |
2003年 | 101篇 |
2002年 | 81篇 |
2001年 | 83篇 |
2000年 | 48篇 |
1999年 | 47篇 |
1998年 | 48篇 |
1997年 | 41篇 |
1996年 | 32篇 |
1995年 | 18篇 |
1994年 | 26篇 |
1993年 | 22篇 |
1992年 | 21篇 |
1991年 | 13篇 |
1990年 | 30篇 |
1989年 | 9篇 |
1988年 | 1篇 |
排序方式: 共有3342条查询结果,搜索用时 18 毫秒
101.
电子对抗环境下飞机编队突防能力模型 总被引:1,自引:0,他引:1
现代战争通常在电子对抗的复杂环境下进行,对电子对抗环境下飞机编队突防能力进行建模研究.首先运用模糊数学的方法对雷达电子对抗的效果进行了分析,重点从干扰频率、干扰功率、干扰时机、干扰样式、信号环境因素5个方面研究了雷达电子对抗的干扰效果,然后运用解析法对飞机编队在雷达电子对抗环境下对地空导弹、防空高炮防御体系的突防能力进行计算,得到了关于飞机编队在电子对抗环境下突防能力的定量结果. 相似文献
102.
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 相似文献
103.
A genetic algorithm with neighborhood search for the resource‐constrained project scheduling problem
The resource‐constrained project scheduling problem (RCPSP) consists of a set of non‐preemptive activities that follow precedence relationship and consume resources. Under the limited amount of the resources, the objective of RCPSP is to find a schedule of the activities to minimize the project makespan. This article presents a new genetic algorithm (GA) by incorporating a local search strategy in GA operators. The local search strategy improves the efficiency of searching the solution space while keeping the randomness of the GA approach. Extensive numerical experiments show that the proposed GA with neighborhood search works well regarding solution quality and computational time compared with existing algorithms in the RCPSP literature, especially for the instances with a large number of activities. © 2011 Wiley Periodicals, Inc. Naval Research Logistics, 2011 相似文献
104.
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 相似文献
105.
106.
We study a pull‐type, flexible, multi‐product, and multi‐stage production/inventory system with decentralized two‐card kanban control policies. Each stage involves a processor and two buffers with finite target levels. Production stages, arranged in series, can process several product types one at a time. Transportation of semi‐finished parts from one stage to another is performed in fixed lot sizes. The exact analysis is mathematically intractable even for smaller systems. We present a robust approximation algorithm to model two‐card kanban systems with batch transfers under arbitrary complexity. The algorithm uses phase‐type modeling to find effective processing times and busy period analysis to identify delays among product types in resource contention. Our algorithm reduces the effort required for estimating performance measures by a considerable margin and resolves the state–space explosion problem of analytical approaches. Using this analytical tool, we present new findings for a better understanding of some tactical and operational issues. We show that flow of material in small procurement sizes smoothes flow of information within the system, but also necessitates more frequent shipments between stages, raising the risk of late delivery. Balancing the risk of information delays vis‐à‐vis shipment delays is critical for the success of two‐card kanban systems. Although product variety causes time wasted in setup operations, it also facilitates relatively short production cycles enabling processors to switch from one product type to another more rapidly. The latter point is crucial especially in high‐demand environments. Increasing production line size prevents quick response to customer demand, but it may improve system performance if the vendor lead‐time is long or subject to high variation. Finally, variability in transportation and processing times causes the most damage if it arises at stages closer to the customer. © 2007 Wiley Periodicals, Inc. Naval Research Logistics, 2007 相似文献
107.
In many practical multiserver queueing systems, servers not only serve randomly arriving customers but also work on the secondary jobs with infinite backlog during their idle time. In this paper, we propose a c‐server model with a two‐threshold policy, denoted by (e d), to evaluate the performance of this class of systems. With such a policy, when the number of idle servers has reached d (<c), then e (<d) idle agents will process secondary jobs. These e servers keep working on the secondary jobs until they find waiting customers exist in the system at a secondary job completion instant. Using the matrix analytic method, we obtain the stationary performance measures for evaluating different (e, d) policies. © 2006 Wiley Periodicals, Inc. Naval Research Logistics, 2007. 相似文献
108.
针对现有服务聚合流程建模方法的不足,基于扩展Petri网提出了一种新的服务聚合流程/资源描述模型WSCP/R-net,有效解决了动态服务聚合流程模型中不确定路径选择和服务的动态变化性问题。给出了WSCP/R-net模型向BPEL4WS的转换算法,并以城市应急处理为例说明了转换算法的有效性。 相似文献
109.
MUSIC方法是空间谱估计中经典的子空间方法。提出了一种构造参考信号的预处理模型,提出了一种适合于MUSIC方法的多级维纳滤波结构。新方法避免了采样数据二阶统计的特征值分解,降低了运算量。仿真结果证明了方法的有效性。 相似文献
110.
运动补偿是ISAR成像中的关键技术,通常包括包络对齐和相位补偿,而包络对齐是相位补偿的基础。现有包络对齐方法较多,在无法直观判断包络对齐效果的情况下,需要进行定量评估,以选择最优的对齐方法用于ISAR成像。提出基于距离单元方差的包络对齐评估方法:以对齐后各距离单元方差的加权和作为评估指标,对包络对齐结果直接进行评估。进行了相应的仿真实验,结果证明了该评估方法的有效性。 相似文献