全文获取类型
| 收费全文 | 689篇 |
| 免费 | 3篇 |
专业分类
| 692篇 |
出版年
| 2023年 | 3篇 |
| 2022年 | 1篇 |
| 2021年 | 6篇 |
| 2020年 | 9篇 |
| 2019年 | 25篇 |
| 2018年 | 26篇 |
| 2017年 | 38篇 |
| 2016年 | 36篇 |
| 2015年 | 23篇 |
| 2014年 | 30篇 |
| 2013年 | 118篇 |
| 2012年 | 30篇 |
| 2011年 | 28篇 |
| 2010年 | 30篇 |
| 2009年 | 25篇 |
| 2008年 | 31篇 |
| 2007年 | 40篇 |
| 2006年 | 30篇 |
| 2005年 | 24篇 |
| 2004年 | 25篇 |
| 2003年 | 18篇 |
| 2002年 | 19篇 |
| 2001年 | 17篇 |
| 2000年 | 14篇 |
| 1999年 | 7篇 |
| 1998年 | 3篇 |
| 1997年 | 4篇 |
| 1996年 | 4篇 |
| 1995年 | 6篇 |
| 1994年 | 3篇 |
| 1993年 | 5篇 |
| 1992年 | 3篇 |
| 1991年 | 6篇 |
| 1990年 | 3篇 |
| 1989年 | 2篇 |
排序方式： 共有692条查询结果，搜索用时 15 毫秒
141.
The sequential order statistics (SOS) are a good way to model the lifetimes of the components in a system when the failure of a component at time t affects the performance of the working components at this age t. In this article, we study properties of the lifetimes of the coherent systems obtained using SOS. Specifically, we obtain a mixture representation based on the signature of the system. This representation is used to obtain stochastic comparisons. To get these comparisons, we obtain some ordering properties for the SOS, which in this context represent the lifetimes of k‐out‐of‐n systems. In particular, we show that they are not necessarily hazard rate ordered. © 2011 Wiley Periodicals, Inc. Naval Research Logistics, 2011 相似文献
142.
We evaluate the effect of competition on prices, profits, and consumers' surplus in multiperiod, finite horizon, dynamic pricing settings. In our base model, a single myopic consumer visits two competing retailers, who offer identical goods, in a (first order Markovian) probabilistic fashion—if the posted price exceeds the consumer's valuation for the good, he returns to the same store in the following period with a certain probability. We find that even a small reduction in the return probability from one—which corresponds to the monopoly case at which prices decline linearly—is sufficient to revert the price decline from a linear into an exponential shape. Each retailer's profit is particularly sensitive to changes in his return probability when it is relatively high, and is maximized under complete loyalty behavior (i.e., return probability is one). On the other hand, consumer surplus is maximized under complete switching behavior (i.e., return probability is zero). In the presence of many similar consumers, the insights remain valid. We further focus on the extreme scenario where all consumers follow a complete switching behavior, to derive sharp bounds, and also consider the instance where, in this setting, myopic consumers are replaced with strategic consumers. © 2011 Wiley Periodicals, Inc. Naval Research Logistics, 2011 相似文献
143.
Service systems such as call centers and hospital emergency rooms typically have strongly time‐varying arrival rates. Thus, a nonhomogeneous Poisson process (NHPP) is a natural model for the arrival process in a queueing model for performance analysis. Nevertheless, it is important to perform statistical tests with service system data to confirm that an NHPP is actually appropriate, as emphasized by Brown et al. [8]. They suggested a specific statistical test based on the Kolmogorov–Smirnov (KS) statistic after exploiting the conditional‐uniform (CU) property to transform the NHPP into a sequence of i.i.d. random variables uniformly distributed on [0,1] and then performing a logarithmic transformation of the data. We investigate why it is important to perform the final data transformation and consider what form it should take. We conduct extensive simulation experiments to study the power of these alternative statistical tests. We conclude that the general approach of Brown et al. [8] is excellent, but that an alternative data transformation proposed by Lewis [22], drawing upon Durbin [10], produces a test of an NHPP test with consistently greater power. We also conclude that the KS test after the CU transformation, without any additional data transformation, tends to be best to test against alternative hypotheses that primarily differ from an NHPP only through stochastic and time dependence. © 2014 Wiley Periodicals, Inc. Naval Research Logistics 61: 66–90, 2014 相似文献
144.
In scheduling problems with two competing agents, each one of the agents has his own set of jobs to be processed and his own objective function, and both share a common processor. In the single‐machine problem studied in this article, the goal is to find a joint schedule that minimizes the total deviation of the job completion times of the first agent from a common due‐date, subject to an upper bound on the maximum deviation of job completion times of the second agent. The problem is shown to be NP‐hard even for a nonrestrictive due‐date, and a pseudopolynomial dynamic program is introduced and tested numerically. For the case of a restrictive due‐date (a sufficiently small due‐date that may restrict the number of early jobs), a faster pseudopolynomial dynamic program is presented. We also study the multiagent case, which is proved to be strongly NP‐hard. A simple heuristic for this case is introduced, which is tested numerically against a lower bound, obtained by extending the dynamic programming algorithm. © 2013 Wiley Periodicals, Inc. Naval Research Logistics 61: 1–16, 2014 相似文献
145.
We develop the first approximation algorithm with worst‐case performance guarantee for capacitated stochastic periodic‐review inventory systems with setup costs. The structure of the optimal control policy for such systems is extremely complicated, and indeed, only some partial characterization is available. Thus, finding provably near‐optimal control policies has been an open challenge. In this article, we construct computationally efficient approximate optimal policies for these systems whose demands can be nonstationary and/or correlated over time, and show that these policies have a worst‐case performance guarantee of 4. We demonstrate through extensive numerical studies that the policies empirically perform well, and they are significantly better than the theoretical worst‐case guarantees. We also extend the analyses and results to the case with batch ordering constraints, where the order size has to be an integer multiple of a base load. © 2014 Wiley Periodicals, Inc. Naval Research Logistics 61: 304–319, 2014 相似文献
146.
Richard B. White 《The Nonproliferation Review》2014,21(3-4):261-274
The Indian government has not made a public comment about the status of its nuclear weapon program since approving a nuclear doctrine in 2003. However, there is now enough information in the public domain to determine that the command-and-control system for the nuclear program has steadily matured in accordance with the intent of the approved nuclear doctrine. The Indian government has successfully mitigated many of the issues that plague the conventional military. The result is a basic command-and-control system that is focused only on the delivery, if ordered by the prime minister, of nuclear weapons. The system is not as robust as those of the United States and Russia, but is in place and ready as new Indian nuclear weapons enter into operation. The command-and-control system is developing to meet India's needs and political compulsions, but not necessarily as part of a more assertive nuclear policy. 相似文献
147.
The ability to cope with uncertainty in dynamic scheduling environments is becoming an increasingly important issue. In such environments, any disruption in the production schedule will translate into a disturbance of the plans for several external activities as well. Hence, from a practical point of view, deviations between the planned and realized schedules are to be avoided as much as possible. The term stability refers to this concern. We propose a proactive approach to generate efficient and stable schedules for a job shop subject to processing time variability and random machine breakdowns. In our approach, efficiency is measured by the makespan, and the stability measure is the sum of the variances of the realized completion times. Because the calculation of the original measure is mathematically intractable, we develop a surrogate stability measure. The version of the problem with the surrogate stability measure is proven to be NP‐hard, even without machine breakdowns; a branch‐and‐bound algorithm is developed for this problem variant. A tabu search algorithm is proposed to handle larger instances of the problem with machine breakdowns. The results of extensive computational experiments indicate that the proposed algorithms are quite promising in performance. © 2011 Wiley Periodicals, Inc. Naval Research Logistics, 2011 相似文献
148.
张俊峰;窦长旭;陈企华;张扬 《火力与指挥控制》2023,48(7):115-119
军事标图是军队参谋人员一项重要的指挥技能训练内容。提出基于知识推理和兴趣区域过滤的标图评判方法,用于实现军事标图作业的自动化评判。阐述了知识推理的一般原理,以及针对标图要素的知识表示,分析基于Rete算法的知识推理网络运用;采用兴趣区域过滤的方式,提高评判精准度,阐述标图作业智能化评判的具体实现流程。通过在标图训练系统中的运用,证实了方法的有效性。 相似文献
149.
150.
秦晓 《国防科技大学学报》1990,12(4):66-72
MT-l是在汉字dBASE-Ⅲ的基础上开发的数据库工具软件,它具有图形化的数据描述和数据操纵语言,是一个实用的微机管理信息系统开发工具。它在图形化用户界面、数据字典、视图、数据完整性和安全性等方面优越于dBASE-Ⅲ。本文描述了 MT-l的总体结构和主要功能,讨论了主要设计和实现问题。 相似文献