首页 | 本学科首页   官方微博 | 高级检索  
文章检索
  按 检索   检索词:      
出版年份:   被引次数:   他引次数: 提示:输入*表示无穷大
  收费全文   522篇
  免费   162篇
  国内免费   14篇
  2022年   3篇
  2021年   10篇
  2020年   7篇
  2019年   8篇
  2018年   5篇
  2017年   9篇
  2016年   13篇
  2015年   26篇
  2014年   30篇
  2013年   79篇
  2012年   31篇
  2011年   33篇
  2010年   31篇
  2009年   41篇
  2008年   35篇
  2007年   29篇
  2006年   27篇
  2005年   26篇
  2004年   27篇
  2003年   21篇
  2002年   27篇
  2001年   31篇
  2000年   12篇
  1999年   24篇
  1998年   18篇
  1997年   18篇
  1996年   15篇
  1995年   6篇
  1994年   8篇
  1993年   10篇
  1992年   9篇
  1991年   2篇
  1990年   7篇
  1989年   5篇
  1988年   6篇
  1987年   3篇
  1986年   3篇
  1985年   1篇
  1983年   2篇
排序方式: 共有698条查询结果,搜索用时 93 毫秒
621.
Accelerated life testing (ALT) is commonly used to obtain reliability information about a product in a timely manner. Several stress loading designs have been proposed and recent research interests have emerged concerning the development of equivalent ALT plans. Step‐stress ALT (SSALT) is one of the most commonly used stress loadings because it usually shortens the test duration and reduces the number of required test units. This article considers two fundamental questions when designing a SSALT and provides formal proofs in answer to each. Namely: (1) can a simple SSALT be designed so that it is equivalent to other stress loading designs? (2) when optimizing a multilevel SSALT, does it degenerate to a simple SSALT plan? The answers to both queries, under certain reasonable model assumptions, are shown to be a qualified YES. In addition, we provide an argument to support the rationale of a common practice in designing a SSALT, that is, setting the higher stress level as high as possible in a SSALT plan. © 2012 Wiley Periodicals, Inc. Naval Research Logistics, 2013  相似文献   
622.
623.
624.
We introduce an optimal stopping problem for selling an asset when the fixed but unknown distribution of successive offers is from one of n possible distributions. The initial probabilities as to which is the true distribution are given and updated in a Bayesian manner as the successive offers are observed. After receiving an offer, the seller has to decide whether to accept the offer or continue to observe the next offer. Each time an offer is observed a fixed cost is incurred. We consider both the cases where recalling a past offer is allowed and where it is not allowed. For each case, a dynamic programming model and some heuristic policies are presented. Using simulation, the performances of the heuristic methods are evaluated and upper bounds on the optimal expected return are obtained. © 2013 Wiley Periodicals, Inc. Naval Research Logistics, 2013  相似文献   
625.
Book reviews     
Norman Cigar, Genocide in Bosnia: The Policy of “Ethnic Cleansing”. College Station, Texas: Texas A&M University Press, 1995. Pp.xiv + 247; app., map, notes, cartoon.

Maria Jose Moyano, Argentina's Lost Patrol: Armed Struggle, 1969–1979. New Haven: Connecticut Yale University Press, 1995. Pp.xiii + 226, biblio., abbreviations, 10 figures, 1 map, tables, index; $25/£16.95. ISBN 0–300–01622–6.

Donald E. Schulz and Deborah Sundloff Schulz, The United States, Honduras, and the Crisis in Central America, Westview Thematic Studies in Latin America, Boulder, Co: Westview, 1994. Pp.368, map, figure, select biblio., abbreviations, index. $52.50/£37.50; (cloth) $17.95/£11.95 (paper). ISBN 0–8133–1324–4 and 1323–6.

Joseph H. Alexander and Merrill L. Bartlett, Sea Soldiers in the Cold War: Amphibious Warfare 1945–1991. Annapolis, Maryland: Naval Institute Press, 1995. Pp.iii + 178, 1 map, 29 illus, biblio, index. $32.95. ISBN

Gary P. Cox, The Halt in the Mud: French Strategic Planning from Waterloo to Sedan. Westview Press, 1994. Pp.258, maps, notes, biblio, index. £33.50. ISBN 0–133–1536–0.  相似文献   
626.
报道了采用亲和树脂法对相思子毒素蛋白进行反复的SELEX筛选,获得与靶物质结合率这32.5%的富集文库,并克隆得到了单克隆适配子序列,软件模拟了这些序列的二级结构,选择部分序列选择性剪切后利用荧光偏振方法进行检测,对靶蛋白的检测限达到亚nmol量。  相似文献   
627.
We consider a manufacturer (i.e., a capacitated supplier) that produces to stock and has two classes of customers. The primary customer places orders at regular intervals of time for a random quantity, while the secondary customers request a single item at random times. At a predetermined time the manufacturer receives advance demand information regarding the order size of the primary customer. If the manufacturer is not able to fill the primary customer's demand, there is a penalty. On the other hand, serving the secondary customers results in additional profit; however, the manufacturer can refuse to serve the secondary customers in order to reserve inventory for the primary customer. We characterize the manufacturer's optimal production and stock reservation policies that maximize the manufacturer's discounted profit and the average profit per unit time. We show that these policies are threshold‐type policies, and these thresholds are monotone with respect to the primary customer's order size. Using a numerical study we provide insights into how the value of information is affected by the relative demand size of the primary and secondary customers. © 2007 Wiley Periodicals, Inc. Naval Research Logistics, 2007  相似文献   
628.
We consider three network disconnection problems in a centralized network where a source node provides service to the other nodes, called demand nodes. In network disconnection problems, each demand node gets a certain benefit when connected to a source node and a network attacker destroys edges to prevent demand nodes from achieving benefits. As destroying edges incurs expenses, an attacker considers the following three different strategies. The first is to maximize the sum of benefits of the disconnected nodes while keeping the total edge destruction cost no more than a given budget. The second is to minimize the total destruction cost needed to make a certain amount of benefits not accomplished. The last is to minimize the ratio of the total destruction cost to the benefits not accomplished. In this paper, we develop exact algorithms to solve the above three problems. © 2007 Wiley Periodicals, Inc. Naval Research Logistics, 2007  相似文献   
629.
We consider a dynamic lot‐sizing model with production time windows where each of n demands has earliest and latest production due dates and it must be satisfied during the given time window. For the case of nonspeculative cost structure, an O(nlogn) time procedure is developed and it is shown to run in O(n) when demands come in the order of latest production due dates. When the cost structure is somewhat general fixed plus linear that allows speculative motive, an optimal procedure with O(T4) is proposed where T is the length of a planning horizon. Finally, for the most general concave production cost structure, an optimal procedure with O(T5) is designed. © 2007 Wiley Periodicals, Inc. Naval Research Logistics, 2007  相似文献   
630.
We formulate exact expressions for the expected values of selected estimators of the variance parameter (that is, the sum of covariances at all lags) of a steady‐state simulation output process. Given in terms of the autocovariance function of the process, these expressions are derived for variance estimators based on the simulation analysis methods of nonoverlapping batch means, overlapping batch means, and standardized time series. Comparing estimator performance in a first‐order autoregressive process and the M/M/1 queue‐waiting‐time process, we find that certain standardized time series estimators outperform their competitors as the sample size becomes large. © 2007 Wiley Periodicals, Inc. Naval Research Logistics, 2007  相似文献   
设为首页 | 免责声明 | 关于勤云 | 加入收藏

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