全文获取类型
| 收费全文 | 1125篇 |
| 免费 | 18篇 |
| 国内免费 | 8篇 |
专业分类
| 1151篇 |
出版年
| 2025年 | 5篇 |
| 2024年 | 2篇 |
| 2023年 | 9篇 |
| 2022年 | 10篇 |
| 2021年 | 8篇 |
| 2020年 | 15篇 |
| 2019年 | 23篇 |
| 2018年 | 13篇 |
| 2017年 | 36篇 |
| 2016年 | 53篇 |
| 2015年 | 29篇 |
| 2014年 | 59篇 |
| 2013年 | 114篇 |
| 2012年 | 72篇 |
| 2011年 | 88篇 |
| 2010年 | 59篇 |
| 2009年 | 78篇 |
| 2008年 | 69篇 |
| 2007年 | 72篇 |
| 2006年 | 55篇 |
| 2005年 | 44篇 |
| 2004年 | 47篇 |
| 2003年 | 41篇 |
| 2002年 | 37篇 |
| 2001年 | 25篇 |
| 2000年 | 25篇 |
| 1999年 | 17篇 |
| 1998年 | 4篇 |
| 1997年 | 7篇 |
| 1996年 | 12篇 |
| 1995年 | 7篇 |
| 1994年 | 3篇 |
| 1993年 | 4篇 |
| 1992年 | 2篇 |
| 1991年 | 1篇 |
| 1990年 | 3篇 |
| 1989年 | 1篇 |
| 1988年 | 2篇 |
排序方式： 共有1151条查询结果，搜索用时 0 毫秒
241.
分析了防空通信系统的组织结构和对抗特点,利用性能评价过程代数描述防空通信系统的状态演化,提出一种防空通信系统抗毁特性分析方法。通过具体案例,对通信系统的组织结构、抗击软硬杀伤的能力进行建模和仿真验证。实验结果表明,该方法适用于防空通信系统的建模与分析,能够实现对防空通信系统的结构进行对抗过程的建模;通信系统的不同要素对抗毁性能的影响不同,可以采取有效策略以提高防空通信系统的抗毁能力。 相似文献
242.
可测性指标是开展可测性设计、验证和评估的依据.针对传统可测性指标主要用于故障可检测性和故障可隔离性水平评价,不能全面反映面向装备健康管理可测性水平的问题,在定性分析装备健康管理对可测性的本质需求基础上,从全域和瞬态角度提出了五个可测性指标以定量描述面向装备健康管理的可测性水平;并基于故障模式状态矢量给出了可测性指标的分析计算流程.最后以某装备柴油机的机体子系统为案例详细说明了可测性指标的计算过程,应用结果表明所提指标具有一定的可行性和合理性,可以有效指导面向装备健康管理的可测性优化设计. 相似文献
243.
In this article, we analyze a discrete‐time queue that is motivated from studying hospital inpatient flow management, where the customer count process captures the midnight inpatient census. The stationary distribution of the customer count has no explicit form and is difficult to compute in certain parameter regimes. Using the Stein's method framework, we identify a continuous random variable to approximate the steady‐state customer count. The continuous random variable corresponds to the stationary distribution of a diffusion process with state‐dependent diffusion coefficients. We characterize the error bounds of this approximation under a variety of system load conditions—from lightly loaded to heavily loaded. We also identify the critical role that the service rate plays in the convergence rate of the error bounds. We perform extensive numerical experiments to support the theoretical findings and to demonstrate the approximation quality. In particular, we show that our approximation performs better than those based on constant diffusion coefficients when the number of servers is small, which is relevant to decision making in a single hospital ward. 相似文献
244.
This article argues that logistics constrains strategic opportunity while itself being heavily circumscribed by strategic and operational planning. With the academic literature all but ignoring the centrality of logistics to strategy and war, this article argues for a reappraisal of the critical role of military logistics, and posits that the study and conduct of war and strategy are incomplete at best or false at worst when they ignore this crucial component of the art of war. The article conceptualises the logistics–strategy nexus in a novel way, explores its contemporary manifestation in an age of uncertainty, and applies it to a detailed case study of UK operations in Iraq and Afghanistan since 2001. 相似文献
245.
We consider the problem of efficiently scheduling deliveries by an uncapacitated courier from a central location under online arrivals. We consider both adversary‐controlled and Poisson arrival processes. In the adversarial setting we provide a randomized (3βΔ/2δ ? 1) ‐competitive algorithm, where β is the approximation ratio of the traveling salesman problem, δ is the minimum distance between the central location and any customer, and Δ is the length of the optimal traveling salesman tour overall customer locations and the central location. We provide instances showing that this analysis is tight. We also prove a 1 + 0.271Δ/δ lower‐bound on the competitive ratio of any algorithm in this setting. In the Poisson setting, we relax our assumption of deterministic travel times by assuming that travel times are distributed with a mean equal to the excursion length. We prove that optimal policies in this setting follow a threshold structure and describe this structure. For the half‐line metric space we bound the performance of the randomized algorithm in the Poisson setting, and show through numerical experiments that the performance of the algorithm is often much better than this bound. 相似文献
246.
This article studies the optimal capacity investment problem for a risk‐averse decision maker. The capacity can be either purchased or salvaged, whereas both involve a fixed cost and a proportional cost/revenue. We incorporate risk preference and use a consumption model to capture the decision maker's risk sensitivity in a multiperiod capacity investment model. We show that, in each period, capacity and consumption decisions can be separately determined. In addition, we characterize the structure of the optimal capacity strategy. When the parameters are stationary, we present certain conditions under which the optimal capacity strategy could be easily characterized by a static two‐sided (s, S) policy, whereby, the capacity is determined only at the beginning of period one, and held constant during the entire planning horizon. It is purchased up to B when the initial capacity is below b, salvaged down to Σ when it is above σ, and remains constant otherwise. Numerical tests are presented to investigate the impact of demand volatility on the optimal capacity strategy. © 2016 Wiley Periodicals, Inc. Naval Research Logistics 63: 218–235, 2016 相似文献
247.
We consider a stochastic partially observable system that can switch between a normal state and a transient abnormal state before entering a persistent abnormal state. Only the persistent abnormal state requires alarms. The transient and persistent abnormal states may be similar in appearance, which can result in excess false alarms. We propose a partially observable Markov decision process model to minimize the false alarm rate, subject to a given upper bound on the expected alarm delay time. The cost parameter is treated as the Lagrange multiplier, which can be estimated from the bound of the alarm delay. We show that the optimal policy has a control‐limit structure on the probability of persistent abnormality, and derive closed‐form bounds for the control limit and present an algorithm to specify the Lagrange multiplier. We also study a specialized model where the transient and persistent abnormal states have the same observation distribution, in which case an intuitive “watchful‐waiting” policy is optimal. © 2016 Wiley Periodicals, Inc. Naval Research Logistics 63: 320–334, 2016 相似文献
248.
The United States has conducted armed drone strikes in Pakistan since 2004. While there has been some recent work on Pakistani public opinion about drones, there is very little research on how Pakistan’s media characterize the US drone program. This is an important gap in understanding the determinants of Pakistani popular perceptions of this program. Decades of research has shown that “news framing”, a process by which certain aspects of a complex concept are emphasized in political communications with others played down, influences individual cognition while forming political opinions. In this essay, we address this lacuna by assembling an unprecedented sample of editorials about the drone program from three English newspapers and one Urdu newspaper and analyzing the news frames within them. We next compare the trends in these news frames to public opinion data collected by Pew between the spring of 2009 and 2014. Initially, most Pakistanis were unaware of the drone program, media coverage of the program expanded as drone strikes increased in frequency. While Pakistanis became more cognizant of the US drone strikes, even by 2014 large minorities remained unaware. Pakistani public opinion strongly reflected the top media frames, particularly those that are negative. This is an important finding suggesting that newspaper editorials are a good barometer of Pakistani opinions despite the fact that only information elites rely upon newspapers for political information. 相似文献
249.
In this article, we propose a branch‐and‐price‐and‐cut (BPC) algorithm to exactly solve the manpower routing problem with synchronization constraints (MRPSC). Compared with the classical vehicle routing problems (VRPs), the defining characteristic of the MRPSC is that multiple workers are required to work together and start at the same time to carry out a job, that is, the routes of the scheduling subjects are dependent. The incorporation of the synchronization constraints increases the difficulty of the MRPSC significantly and makes the existing VRP exact algorithm inapplicable. Although there are many types of valid inequalities for the VRP or its variants, so far we can only adapt the infeasible path elimination inequality and the weak clique inequality to handle the synchronization constraints in our BPC algorithm. The experimental results at the root node of the branch‐and‐bound tree show that the employed inequalities can effectively improve the lower bound of the problem. Compared with ILOG CPLEX, our BPC algorithm managed to find optimal solutions for more test instances within 1 hour. © 2016 Wiley Periodicals, Inc. Naval Research Logistics 63: 138–171, 2016 相似文献
250.
We present the green telecommunication network planning problem with switchable base stations, where the location and configuration of the base stations are optimized, while taking into account uncertainty and variability of demand. The problem is formulated as a two‐stage stochastic program under demand uncertainty with integers in both stages. Since solving the presented problem is computationally challenging, we develop the corresponding Dantzig‐Wolfe reformulation and propose a solution approach based on column generation. Comprehensive computational results are provided for instances of varying characteristics. The results show that the joint location and dynamic switching of base stations leads to significant savings in terms of energy cost. Up to 30% reduction in power consumption cost is achieved while still serving all users. In certain cases, allowing dynamic configurations leads to more installed base stations and higher user coverage, while having lower total energy consumption. The Dantzig‐Wolfe reformulation provides solutions with a tight LP‐gap eliminating the need for a full branch‐and‐price scheme. Furthermore, the proposed column generation solution approach is computationally efficient and outperforms CPLEX on the majority of the tested instances. © 2016 Wiley Periodicals, Inc. Naval Research Logistics 63: 351–366, 2016 相似文献