全文获取类型
收费全文 | 602篇 |
免费 | 146篇 |
国内免费 | 8篇 |
出版年
2023年 | 5篇 |
2022年 | 9篇 |
2021年 | 19篇 |
2020年 | 8篇 |
2019年 | 20篇 |
2018年 | 12篇 |
2017年 | 26篇 |
2016年 | 42篇 |
2015年 | 29篇 |
2014年 | 51篇 |
2013年 | 81篇 |
2012年 | 38篇 |
2011年 | 42篇 |
2010年 | 38篇 |
2009年 | 35篇 |
2008年 | 34篇 |
2007年 | 48篇 |
2006年 | 27篇 |
2005年 | 27篇 |
2004年 | 37篇 |
2003年 | 20篇 |
2002年 | 20篇 |
2001年 | 21篇 |
2000年 | 23篇 |
1999年 | 11篇 |
1998年 | 6篇 |
1997年 | 2篇 |
1996年 | 2篇 |
1995年 | 5篇 |
1994年 | 5篇 |
1993年 | 3篇 |
1992年 | 2篇 |
1991年 | 5篇 |
1990年 | 2篇 |
1989年 | 1篇 |
排序方式: 共有756条查询结果,搜索用时 218 毫秒
31.
This study combines inspection and lot‐sizing decisions. The issue is whether to INSPECT another unit or PRODUCE a new lot. A unit produced is either conforming or defective. Demand need to be satisfied in full, by conforming units only. The production process may switch from a “good” state to a “bad” state, at constant rate. The proportion of conforming units in the good state is higher than in the bad state. The true state is unobservable and can only be inferred from the quality of units inspected. We thus update, after each inspection, the probability that the unit, next candidate for inspection, was produced while the production process was in the good state. That “good‐state‐probability” is the basis for our decision to INSPECT or PRODUCE. We prove that the optimal policy has a simple form: INSPECT only if the good‐state‐probability exceeds a control limit. We provide a methodology to calculate the optimal lot size and the expected costs associated with INSPECT and PRODUCE. Surprisingly, we find that the control limit, as a function of the demand (and other problem parameters) is not necessarily monotone. Also, counter to intuition, it is possible that the optimal action is PRODUCE, after revealing a conforming unit. © 2007 Wiley Periodicals, Inc. Naval Research Logistics, 2007 相似文献
32.
This paper proposes a kurtosis correction (KC) method for constructing the X? and R control charts for symmetrical long‐tailed (leptokurtic) distributions. The control charts are similar to the Shewhart control charts and are very easy to use. The control limits are derived based on the degree of kurtosis estimated from the actual (subgroup) data. It is assumed that the underlying quality characteristic is symmetrically distributed and no other distributional and/or parameter assumptions are made. The control chart constants are tabulated and the performance of these charts is compared with that of the Shewhart control charts. For the case of the logistic distribution, the exact control limits are derived and are compared with the KC method and the Shewhart method. © 2007 Wiley Periodicals, Inc. Naval Research Logistics, 2007 相似文献
33.
为提高石英角速率传感器(QRS)的测量性能,提出了基于数字相关检测技术的QRS信号解调方案。该方案需将一组互相正交的参考信号作为两个相关器的输入,能够同时分离出QRS敏感信号相对于参考信号的同相分量和正交分量。通过角速度提取算法可由以上分量进一步得到输入角速度。分析了实现参考通道功能的两种方法:锁相环(PLL)和Hilbert变换,通过对这两种方法的对比得知,PLL更适合作为QRS相关检测的参考通道。 相似文献
34.
35.
铝合金表面涂覆隐身吸波涂层脱落原因分析 总被引:2,自引:0,他引:2
通过对某装备车体外脱落隐身吸波涂层样品的表面形貌、截面形貌、元素组成及含量分析,发现吸波涂层和Al2O3钝化层之间没有化学结合键,只存在物理吸附和机械结合,在外部环境的作用下,很容易引起隐身吸波涂层的脱落。 相似文献
36.
Subspace dynamic‐simplex linear interpolation search for mixed‐integer black‐box optimization problems 下载免费PDF全文
Honggang Wang 《海军后勤学研究》2017,64(4):305-322
Design and management of complex systems with both integer and continuous decision variables can be guided using mixed‐integer optimization models and analysis. We propose a new mixed‐integer black‐box optimization (MIBO) method, subspace dynamic‐simplex linear interpolation search (SD‐SLIS), for decision making problems in which system performance can only be evaluated with a computer black‐box model. Through a sequence of gradient‐type local searches in subspaces of solution space, SD‐SLIS is particularly efficient for such MIBO problems with scaling issues. We discuss the convergence conditions and properties of SD‐SLIS algorithms for a class of MIBO problems. Under mild conditions, SD‐SLIS is proved to converge to a stationary solution asymptotically. We apply SD‐SLIS to six example problems including two MIBO problems associated with petroleum field development projects. The algorithm performance of SD‐SLIS is compared with that of a state‐of‐the‐art direct‐search method, NOMAD, and that of a full space simplex interpolation search, Full‐SLIS. The numerical results suggest that SD‐SLIS solves the example problems efficiently and outperforms the compared methods for most of the example cases. © 2017 Wiley Periodicals, Inc. Naval Research Logistics 64: 305–322, 2017 相似文献
37.
Under quasi‐hyperbolic discounting, the valuation of a payoff falls relatively rapidly for earlier delay periods, but then falls more slowly for longer delay periods. When the salespersons with quasi‐hyperbolic discounting consider the product sale problem, they would exert less effort than their early plan, thus resulting in losses of future profit. We propose a winner‐takes‐all competition to alleviate the above time inconsistent behaviors of the salespersons, and allow the company to maximize its revenue by choosing an optimal bonus. To evaluate the effects of the competition scheme, we define the group time inconsistency degree of the salespersons, which measures the consequence of time inconsistent behaviors, and two welfare measures, the group welfare of the salespersons and the company revenue. We show that the competition always improves the group welfare and the company revenue as long as the company chooses to run the competition in the first place. However, the effect on group time inconsistency degree is mixed. When the optimal bonus is moderate (extreme high), the competition motivates (over‐motivates) the salesperson to work hard, thus alleviates (worsens) the time inconsistent behaviors. © 2017 Wiley Periodicals, Inc. Naval Research Logistics 64: 357–372, 2017 相似文献
38.
We study a setting with a single type of resource and with several players, each associated with a single resource (of this type). Unavailability of these resources comes unexpectedly and with player‐specific costs. Players can cooperate by reallocating the available resources to the ones that need the resources most and let those who suffer the least absorb all the costs. We address the cost savings allocation problem with concepts of cooperative game theory. In particular, we formulate a probabilistic resource pooling game and study them on various properties. We show that these games are not necessarily convex, do have non‐empty cores, and are totally balanced. The latter two are shown via an interesting relationship with Böhm‐Bawerk horse market games. Next, we present an intuitive class of allocation rules for which the resulting allocations are core members and study an allocation rule within this class of allocation rules with an appealing fairness property. Finally, we show that our results can be applied to a spare parts pooling situation. 相似文献
39.
以水下单元的短路/开路故障模式为基础,提出了一种分析缆系海底观测网络恒流远供系统可靠性的方法。根据系统供电和结构特性,将系统分成不同的供电链路和链路段。详细研究了处于不同位置的各种水下单元发生故障时,对链路和观测设备的供电状态的影响。归纳了导致系统和各链路无法正常导通、观测设备无法得到供电的状态情况,分析了不同故障状态发生的概率,进而得出了求解系统、供电链路与供电设备的供电可靠度的方法。通过算例分析,进一步梳理了3种供电可靠性的共性规律,说明在设计和建设恒流远供系统时,应综合须考量这3种供电可靠性。 相似文献
40.
We consider the problem of scheduling a set of n jobs on a single batch machine, where several jobs can be processed simultaneously. Each job j has a processing time pj and a size sj. All jobs are available for processing at time 0. The batch machine has a capacity D. Several jobs can be batched together and processed simultaneously, provided that the total size of the jobs in the batch does not exceed D. The processing time of a batch is the largest processing time among all jobs in the batch. There is a single vehicle available for delivery of the finished products to the customer, and the vehicle has capacity K. We assume that K = rD, where and r is an integer. The travel time of the vehicle is T; that is, T is the time from the manufacturer to the customer. Our goal is to find a schedule of the jobs and a delivery plan so that the service span is minimized, where the service span is the time that the last job is delivered to the customer. We show that if the jobs have identical sizes, then we can find a schedule and delivery plan in time such that the service span is minimum. If the jobs have identical processing times, then we can find a schedule and delivery plan in time such that the service span is asymptotically at most 11/9 times the optimal service span. When the jobs have arbitrary processing times and arbitrary sizes, then we can find a schedule and delivery plan in time such that the service span is asymptotically at most twice the optimal service span. We also derive upper bounds of the absolute worst‐case ratios in both cases. © 2015 Wiley Periodicals, Inc. Naval Research Logistics 62: 470–482, 2015 相似文献