首页 | 本学科首页   官方微博 | 高级检索  
文章检索
  按 检索   检索词:      
出版年份:   被引次数:   他引次数: 提示:输入*表示无穷大
  收费全文   658篇
  免费   10篇
  2021年   6篇
  2019年   15篇
  2018年   10篇
  2017年   16篇
  2016年   12篇
  2015年   12篇
  2013年   124篇
  2011年   6篇
  2010年   6篇
  2009年   7篇
  2008年   7篇
  2007年   8篇
  2006年   8篇
  2005年   11篇
  2004年   12篇
  2003年   7篇
  2002年   8篇
  2001年   6篇
  2000年   11篇
  1999年   9篇
  1998年   8篇
  1997年   13篇
  1996年   15篇
  1995年   10篇
  1994年   15篇
  1993年   10篇
  1992年   12篇
  1991年   20篇
  1990年   13篇
  1989年   14篇
  1988年   9篇
  1987年   17篇
  1986年   13篇
  1985年   16篇
  1984年   11篇
  1983年   9篇
  1982年   9篇
  1981年   11篇
  1980年   13篇
  1979年   7篇
  1978年   9篇
  1977年   8篇
  1976年   11篇
  1975年   8篇
  1974年   13篇
  1973年   11篇
  1972年   10篇
  1971年   13篇
  1969年   9篇
  1968年   6篇
排序方式: 共有668条查询结果,搜索用时 15 毫秒
531.
When modeling the detection of targets in a simulation of combat, the detection process is frequently represented as a series of independent detections of individual elements of the target. This assumption ignores the effect of a common but unknown field environment within which the detections take place. In this article, multivariate survival distributions are developed for target element detections which occur in an unknown dynamic environment. A proportional hazards representation is adopted, which uses a random variable multiplying the detection rate to account for the effect of the environment. Several special cases are examined which are useful for modeling target unit detections.  相似文献   
532.
533.
We consider a problem of scheduling jobs on m parallel machines. The machines are dedicated, i.e., for each job the processing machine is known in advance. We mainly concentrate on the model in which at any time there is one unit of an additional resource. Any job may be assigned the resource and this reduces its processing time. A job that is given the resource uses it at each time of its processing. No two jobs are allowed to use the resource simultaneously. The objective is to minimize the makespan. We prove that the two‐machine problem is NP‐hard in the ordinary sense, describe a pseudopolynomial dynamic programming algorithm and convert it into an FPTAS. For the problem with an arbitrary number of machines we present an algorithm with a worst‐case ratio close to 3/2, and close to 3, if a job can be given several units of the resource. For the problem with a fixed number of machines we give a PTAS. Virtually all algorithms rely on a certain variant of the linear knapsack problem (maximization, minimization, multiple‐choice, bicriteria). © 2008 Wiley Periodicals, Inc. Naval Research Logistics, 2008  相似文献   
534.
This article investigates optimal static prices for a finite capacity queueing system serving customers from different classes. We first show that the original multi‐class formulation in which the price for each class is a decision variable can be reformulated as a single dimensional problem with the total load as the decision variable. Using this alternative formulation, we prove an upper bound for the optimal arrival rates for a fairly large class of queueing systems and provide sufficient conditions that ensure the existence of a unique optimal arrival rate vector. We show that these conditions hold for M/M/1/m and M/G/s/s systems and prove structural results on the relationships between the optimal arrival rates and system capacity. © 2008 Wiley Periodicals, Inc. Naval Research Logistics, 2008  相似文献   
535.
536.
Accelerated degradation testing (ADT) is usually conducted under deterministic stresses such as constant‐stress, step‐stress, and cyclic‐stress. Based on ADT data, an ADT model is developed to predict reliability under normal (field) operating conditions. In engineering applications, the “standard” approach for reliability prediction assumes that the normal operating conditions are deterministic or simply uses the mean values of the stresses while ignoring their variability. Such an approach may lead to significant prediction errors. In this paper, we extend an ADT model obtained from constant‐stress ADT experiments to predict field reliability by considering the stress variations. A case study is provided to demonstrate the proposed statistical inference procedure. The accuracy of the procedure is verified by simulation using various distributions of field stresses. © 2006 Wiley Periodicals, Inc. Naval Research Logistics, 2006.  相似文献   
537.
Passenger prescreening is a critical component of aviation security systems. This paper introduces the Multilevel Allocation Problem (MAP), which models the screening of passengers and baggage in a multilevel aviation security system. A passenger is screened by one of several classes, each of which corresponds to a set of procedures using security screening devices, where passengers are differentiated by their perceived risk levels. Each class is defined in terms of its fixed cost (the overhead costs), its marginal cost (the additional cost to screen a passenger), and its security level. The objective of MAP is to assign each passenger to a class such that the total security is maximized subject to passenger assignments and budget constraints. This paper shows that MAP is NP‐hard and introduces a Greedy heuristic that obtains approximate solutions to MAP that use no more than two classes. Examples are constructed using data extracted from the Official Airline Guide. Analysis of the examples suggests that fewer security classes for passenger screening may be more effective and that using passenger risk information can lead to more effective security screening strategies. © 2006 Wiley Periodicals, Inc. Naval Research Logistics, 2006  相似文献   
538.
In rewards-based crowdfunding, entrepreneurs solicit donations from a large number of individual contributors. If total donations exceed a prespecified funding target, the entrepreneur distributes nonmonetary rewards to contributors; otherwise, their donations are refunded. We study how to design such campaigns when contributors choose not just whether to contribute, but also when to contribute. We show that strategic contribution behavior—when contributors intentionally delay until campaign success is likely—can arise from the combination of nonrefundable (potentially very small) hassle costs and the risk of campaign failure, and can explain pledging patterns commonly observed in crowdfunding. Furthermore, such delays do not hurt the entrepreneur if contributors are perfectly rational, but they do if contributors are distracted, that is, if they might fail to return to the campaign after an intentional delay. To mitigate this, we find that an entrepreneur can use a simple menu of rewards with a fixed number of units sold at a low price, and an unlimited number sold at a higher price; this segments contributors over time based on the information they observe upon arrival. We show that, despite its simplicity, such a menu performs well compared to a theoretically optimal menu consisting of an infinite number of different rewards and price levels under many conditions.  相似文献   
539.
This article explains why Singapore, despite its small size and semi-authoritarian regime, retains one of the best military forces in the Indo-Pacific. It unpacks Singapore’s ability to continuously innovate since the 1960s – technologically, organizationally, and conceptually – and even recently joined the Revolution in Military Affairs bandwagon. Drawing from the broader military innovation studies literature, this article argues evolutionary peacetime military innovation is more likely to occur in a state with a unified civil–military relation and whose military faces a high-level diverse set of threats. This argument explains how the civil–military fusion under the People’s Action Party-led government since Singapore’s founding moment has been providing coherent and consistent strategic guidance, political support, and financial capital, allowing the Singapore Armed Forces to continuously innovate in response to high levels and diversity of threats.  相似文献   
540.
During the Cold War, the spread and fear of communism furnished the overarching ideological rationale for American foreign policy and for the deployment of United States military forces and resources. Subscribing to the domino theory and its potential impact on Southeast Asia, the Johnson Administration committed the United States to the Vietnam War. Following the September 11, 2001 attacks on the United States, and the commencement of the Global War on Terrorism, Washington once again set a national agenda rooted in a simplistic analysis reminiscent of Vietnam and the domino theory. Ignorant of Iraq’s mammoth sectarian, historical, ethnic, and global strategic complexities, the Bush Administration launched Operation Iraqi Freedom (OIF). The absence of critical analysis, contrarian viewpoints, and sound judgment characterized the US policy and strategy for both the Vietnam War and OIF, exhibiting the lack of moral courage that the national security enterprise seeks, but seldom attains. Faced with this challenge, this article draws attention to the ethical lessons we can learn from the dissent of William Fulbright and Andrew Bacevich.  相似文献   
设为首页 | 免责声明 | 关于勤云 | 加入收藏

Copyright©北京勤云科技发展有限公司  京ICP备09084417号