全文获取类型
| 收费全文 | 1083篇 |
| 免费 | 6篇 |
专业分类
| 1089篇 |
出版年
| 2024年 | 7篇 |
| 2023年 | 6篇 |
| 2022年 | 10篇 |
| 2021年 | 33篇 |
| 2020年 | 12篇 |
| 2019年 | 10篇 |
| 2018年 | 10篇 |
| 2017年 | 12篇 |
| 2016年 | 16篇 |
| 2015年 | 35篇 |
| 2014年 | 25篇 |
| 2013年 | 97篇 |
| 2012年 | 28篇 |
| 2011年 | 25篇 |
| 2010年 | 34篇 |
| 2009年 | 43篇 |
| 2008年 | 31篇 |
| 2007年 | 53篇 |
| 2006年 | 24篇 |
| 2005年 | 43篇 |
| 2004年 | 15篇 |
| 2003年 | 14篇 |
| 2002年 | 14篇 |
| 2001年 | 17篇 |
| 2000年 | 26篇 |
| 1999年 | 67篇 |
| 1998年 | 56篇 |
| 1997年 | 44篇 |
| 1996年 | 44篇 |
| 1995年 | 36篇 |
| 1994年 | 35篇 |
| 1993年 | 30篇 |
| 1992年 | 24篇 |
| 1991年 | 26篇 |
| 1990年 | 27篇 |
| 1989年 | 14篇 |
| 1988年 | 5篇 |
| 1987年 | 10篇 |
| 1986年 | 10篇 |
| 1985年 | 9篇 |
| 1983年 | 2篇 |
| 1982年 | 3篇 |
| 1981年 | 1篇 |
| 1980年 | 1篇 |
| 1978年 | 1篇 |
| 1977年 | 2篇 |
| 1973年 | 1篇 |
| 1967年 | 1篇 |
排序方式： 共有1089条查询结果，搜索用时 0 毫秒
991.
The accelerated degradation test (ADT) is an efficient tool for assessing the lifetime information of highly reliable products. However, conducting an ADT is very expensive. Therefore, how to conduct a cost-constrained ADT plan is a great challenging issue for reliability analysts. By taking the experimental cost into consideration, this paper proposes a semi-analytical procedure to determine the total sample size, testing stress levels, the measurement frequencies, and the number of measurements (within a degradation path) globally under a class of exponential dispersion degradation models. The proposed method is also extended to determine the global planning of a three-level compromise plan. The advantage of the proposed method not only provides better design insights for conducting an ADT plan, but also provides an efficient algorithm to obtain a cost-constrained ADT plan, compared with conventional optimal plans by grid search algorithms. 相似文献
992.
Capacity providers such as airlines often sell the same capacity to different market segments at different prices to improve their expected revenues. The absence of a secondary market, due to the nontransferability of airline tickets, gives rise to an opportunity for airlines to broker capacity between consumers with different willingness to pay. One way to broker capacity is by the introduction of callable products. The idea is similar to callable bonds where the issuer has the right, but not the obligation, to buy back the bonds at a certain price by a certain date. The idea of callable products was introduced before under the assumption that the fare-class demands are all independent. The independent assumption becomes untenable when there is significant demand recovery (respectively, demand cannibalization) when lower fares are closed (respectively, opened). In this case, consumer choice behavior should be modeled explicitly to make meaningful decisions. In this paper, we consider a general consumer choice model and develop the optimal strategy for callable products. Our numerical study illustrates how callable products are win-win-win, for the capacity provider and for both high and low fare consumers. Our studies also identify conditions for callable products to result in significant improvements in expected revenues. 相似文献
993.
This paper presents a model for designing a trade credit contract between a supplier and a retailer that would coordinate a supply chain in the presence of investment opportunity for the retailer. Specifically, we study a newsvendor model where the supplier offers a trade credit contract to the retailer who, by delaying the payment, can invest the accounts payable amount and earn returns. We find that when the channel partners have symmetric information about the retailer's investment return, a conditionally concessional trade credit (CTC) contract, which includes a wholesale price, an interest‐free period, and a minimum order requirement, can achieve channel coordination. We then extend the model to the information asymmetry setting in which the retailer's investment return is unobservable by the supplier. We show that, although the CTC contract cannot achieve the coordination in this setting, it can effectively improve channel efficiency as well as profitability for individual partners. 相似文献
994.
We present a validation of a centralized feedback control law for robotic or partially robotic water craft whose task is to defend a harbor from an intruding fleet of water craft. Our work was motivated by the need to provide harbor defenses against hostile, possibly suicidal intruders, preferably using unmanned craft to limit potential casualties. Our feedback control law is a sample‐data receding horizon control law, which requires the solution of a complex max‐min problem at the start of each sample time. In developing this control law, we had to deal with three challenges. The first was to develop a max‐min problem that captures realistically the nature of the defense‐intrusion game. The second was to ensure the solution of this max‐min problem can be accomplished in a small fraction of the sample time that would be needed to control a possibly fast moving craft. The third, to which this article is dedicated, was to validate the effectiveness of our control law first through computer simulations pitting a computer against a computer or a computer against a human, then through the use of model hovercraft in a laboratory, and finally on the Chesapeake Bay, using Yard Patrol boats. © 2016 Wiley Periodicals, Inc. Naval Research Logistics 63: 247–259, 2016 相似文献
995.
We consider the problem of scheduling n independent and simultaneously available jobs without preemption on a single machine, where the machine has a fixed maintenance activity. The objective is to find the optimal job sequence to minimize the total amount of late work, where the late work of a job is the amount of processing of the job that is performed after its due date. We first discuss the approximability of the problem. We then develop two pseudo‐polynomial dynamic programming algorithms and a fully polynomial‐time approximation scheme for the problem. Finally, we conduct extensive numerical studies to evaluate the performance of the proposed algorithms. © 2016 Wiley Periodicals, Inc. Naval Research Logistics 63: 172–183, 2016 相似文献
996.
Kathryn M. Schumacher Richard Li‐Yang Chen Amy E.M. Cohn Jeremy Castaing 《海军后勤学研究》2016,63(3):236-246
We consider the problem of determining the capacity to assign to each arc in a given network, subject to uncertainty in the supply and/or demand of each node. This design problem underlies many real‐world applications, such as the design of power transmission and telecommunications networks. We first consider the case where a set of supply/demand scenarios are provided, and we must determine the minimum‐cost set of arc capacities such that a feasible flow exists for each scenario. We briefly review existing theoretical approaches to solving this problem and explore implementation strategies to reduce run times. With this as a foundation, our primary focus is on a chance‐constrained version of the problem in which α% of the scenarios must be feasible under the chosen capacity, where α is a user‐defined parameter and the specific scenarios to be satisfied are not predetermined. We describe an algorithm which utilizes a separation routine for identifying violated cut‐sets which can solve the problem to optimality, and we present computational results. We also present a novel greedy algorithm, our primary contribution, which can be used to solve for a high quality heuristic solution. We present computational analysis to evaluate the performance of our proposed approaches. © 2016 Wiley Periodicals, Inc. Naval Research Logistics 63: 236–246, 2016 相似文献
997.
The warehouse problem with deterministic production cost, selling prices, and demand was introduced in the 1950s and there is a renewed interest recently due to its applications in energy storage and arbitrage. In this paper, we consider two extensions of the warehouse problem and develop efficient computational algorithms for finding their optimal solutions. First, we consider a model where the firm can invest in capacity expansion projects for the warehouse while simultaneously making production and sales decisions in each period. We show that this problem can be solved with a computational complexity that is linear in the product of the length of the planning horizon and the number of capacity expansion projects. We then consider a problem in which the firm can invest to improve production cost efficiency while simultaneously making production and sales decisions in each period. The resulting optimization problem is non‐convex with integer decision variables. We show that, under some mild conditions on the cost data, the problem can be solved in linear computational time. © 2016 Wiley Periodicals, Inc. Naval Research Logistics 63: 367–373, 2016 相似文献
998.
在英美文学教学中培养大学生批判性思维能力的 创新研究与实践 总被引：1，自引：0，他引：1
陈晨 《兵团教育学院学报》2018,(1):62-66
批判性思维能力的培养对大学生的心理健康、自主学习能力、创新能力以及个性发展等方面都有重要的作用.批判性思维是大学生综合素质的体现.大学英语提高课程\"英文小说与电影\"以英美文学中经典小说为教学内容,旨在通过英美文学的教学培养学生的批判性思维能力,本课程改变传统教学中教师\"一言堂\"的教学模式,采用混合式教学模式和问题导向式学习方法,营造批判性思维学习氛围,通过让学生们解读、分析和言说文学经典作品,提高学生的批判性思维能力. 相似文献
999.
We consider an integrated usage and maintenance optimization problem for a k‐out‐of‐n system pertaining to a moving asset. The k‐out‐of‐n systems are commonly utilized in practice to increase availability, where n denotes the total number of parallel and identical units and k the number of units required to be active for a functional system. Moving assets such as aircraft, ships, and submarines are subject to different operating modes. Operating modes can dictate not only the number of system units that are needed to be active, but also where the moving asset physically is, and under which environmental conditions it operates. We use the intrinsic age concept to model the degradation process. The intrinsic age is analogous to an intrinsic clock which ticks on a different pace in different operating modes. In our problem setting, the number of active units, degradation rates of active and standby units, maintenance costs, and type of economic dependencies are functions of operating modes. In each operating mode, the decision maker should decide on the set of units to activate (usage decision) and the set of units to maintain (maintenance decision). Since the degradation rate differs for active and standby units, the units to be maintained depend on the units that have been activated, and vice versa. In order to minimize maintenance costs, usage and maintenance decisions should be jointly optimized. We formulate this problem as a Markov decision process and provide some structural properties of the optimal policy. Moreover, we assess the performance of usage policies that are commonly implemented for maritime systems. We show that the cost increase resulting from these policies is up to 27% for realistic settings. Our numerical experiments demonstrate the cases in which joint usage and maintenance optimization is more valuable. © 2017 Wiley Periodicals, Inc. Naval Research Logistics 64: 418–434, 2017 相似文献
1000.
物流单证是物流系统之间数据交换的载体,是实现物流业务流程无缝衔接的条件。文章介绍了物流单证结构,研究了军事物流单证的信息交换过程,建立了军事物流单证的信息交换架构,探讨了军事物流单证信息查询和业务状态信息跟踪服务。 相似文献