全文获取类型
收费全文 | 275篇 |
免费 | 45篇 |
国内免费 | 7篇 |
出版年
2022年 | 1篇 |
2021年 | 5篇 |
2020年 | 3篇 |
2019年 | 7篇 |
2018年 | 2篇 |
2017年 | 6篇 |
2016年 | 11篇 |
2015年 | 15篇 |
2014年 | 15篇 |
2013年 | 61篇 |
2012年 | 10篇 |
2011年 | 11篇 |
2010年 | 8篇 |
2009年 | 13篇 |
2008年 | 13篇 |
2007年 | 16篇 |
2006年 | 7篇 |
2005年 | 18篇 |
2004年 | 10篇 |
2003年 | 12篇 |
2002年 | 10篇 |
2001年 | 9篇 |
2000年 | 6篇 |
1999年 | 9篇 |
1998年 | 5篇 |
1997年 | 12篇 |
1996年 | 7篇 |
1995年 | 2篇 |
1994年 | 4篇 |
1993年 | 6篇 |
1992年 | 1篇 |
1991年 | 6篇 |
1990年 | 2篇 |
1988年 | 2篇 |
1986年 | 1篇 |
1983年 | 1篇 |
排序方式: 共有327条查询结果,搜索用时 234 毫秒
321.
Gamma accelerated degradation tests (ADT) are widely used to assess timely lifetime information of highly reliable products with degradation paths that follow a gamma process. In the existing literature, there is interest in addressing the problem of deciding how to conduct an efficient, ADT that includes determinations of higher stress‐testing levels and their corresponding sample‐size allocations. The existing results mainly focused on the case of a single accelerating variable. However, this may not be practical when the quality characteristics of the product have slow degradation rates. To overcome this difficulty, we propose an analytical approach to address this decision‐making problem using the case of two accelerating variables. Specifically, based on the criterion of minimizing the asymptotic variance of the estimated q quantile of lifetime distribution of the product, we analytically show that the optimal stress levels and sample‐size allocations can be simultaneously obtained via a general equivalence theorem. In addition, we use a practical example to illustrate the proposed procedure. 相似文献
322.
何银 《中国人民武装警察部队学院学报》2009,25(7):29-32
奥巴马对联合国政策的调整,反映出奥巴马政府全球外交和安全战略的需要,体现了实用主义外交风格。较之于其前任,奥巴马将更加重视联合国维和行动,并让联合国更多地参与解决包括伊拉克和阿富汗在内的热点问题。奥巴马的联合国政策面临挑战,联合国仅仅是奥巴马实现美国国家利益的手段之一。 相似文献
323.
宋代商业分工细致,竞争激烈,商人为了招揽顾客,推销自家商品,开始用“新颖”、“文雅”的名称命名自家商品,逐渐形成文字、图形或实物等不同类别的商品标识。宋代商标的使用,既维护了生产者和经营者的利益,也有利于商业经济的正常秩序;既提高了商品的信誉,保证了商品的质量,又扩大了商品服务的范围,增加了商品在市场中的竞争力。 相似文献
324.
325.
326.
In urban rail transit systems of large cities, the headway and following distance of successive trains have been compressed as much as possible to enhance the corridor capacity to satisfy extremely high passenger demand during peak hours. To prevent train collisions and ensure the safety of trains, a safe following distance of trains must be maintained. However, this requirement is subject to a series of complex factors, such as the uncertain train braking performance, train communication delay, and driver reaction time. In this paper, we propose a unified mathematical framework to analyze the safety‐oriented reliability of metro train timetables with different corridor capacities, that is, the train traffic density, and determine the most reliable train timetable for metro lines in an uncertain environment. By employing a space‐time network representation in the formulations, the reliability‐based train timetabling problem is formulated as a nonlinear stochastic programming model, in which we use 0‐1 variables to denote the time‐dependent velocity and position of all involved trains. Several reformulation techniques are developed to obtain an equivalent mixed integer programming model with quadratic constraints (MIQCP) that can be solved to optimality by some commercial solvers. To improve the computational efficiency of the MIQCP model, we develop a dual decomposition solution framework that decomposes the primal problem into several sets of subproblems by dualizing the coupling constraints across different samples. An exact dynamic programming combined with search space reduction strategies is also developed to solve the exact optimal solutions of these subproblems. Two sets of numerical experiments, which involve a relatively small‐scale case and a real‐world instance based on the operation data of the Beijing subway Changping Line are implemented to verify the effectiveness of the proposed approaches. 相似文献
327.
Assigning storage locations to incoming or reshuffled containers is a fundamental problem essential to the operations efficiency of container terminals. The problem is notoriously hard for its combinatorial and dynamic nature. In this article, we minimize the number of reshuffles in assigning storage locations for incoming and reshuffled export containers. For the static problem to empty a given stack without any new container arrival, the optimum reshuffle sequence is identified by an integer program (IP). The integer program captures the evolution of stack configurations as a function of decisions and is of interest by itself. Heuristics based on the integer program are then derived. Their competitiveness in accuracy and time are established by extensive numerical runs comparing them with existing heuristics in literature and in practice as well as with extensions of the existing heuristics. Variants of the IP‐based heuristics are then applied to the dynamic problem with continual retrievals and arrivals of containers. Again, numerical runs confirm that the IP‐based heuristic is competitive. © 2009 Wiley Periodicals, Inc. Naval Research Logistics, 2009 相似文献