全文获取类型
收费全文 | 478篇 |
免费 | 192篇 |
国内免费 | 24篇 |
出版年
2024年 | 1篇 |
2023年 | 5篇 |
2022年 | 9篇 |
2021年 | 10篇 |
2020年 | 28篇 |
2019年 | 20篇 |
2018年 | 17篇 |
2017年 | 43篇 |
2016年 | 34篇 |
2015年 | 37篇 |
2014年 | 33篇 |
2013年 | 42篇 |
2012年 | 33篇 |
2011年 | 38篇 |
2010年 | 30篇 |
2009年 | 39篇 |
2008年 | 31篇 |
2007年 | 29篇 |
2006年 | 36篇 |
2005年 | 27篇 |
2004年 | 26篇 |
2003年 | 16篇 |
2002年 | 13篇 |
2001年 | 18篇 |
2000年 | 14篇 |
1999年 | 11篇 |
1998年 | 9篇 |
1997年 | 12篇 |
1996年 | 3篇 |
1995年 | 4篇 |
1994年 | 4篇 |
1993年 | 5篇 |
1992年 | 5篇 |
1991年 | 4篇 |
1990年 | 4篇 |
1989年 | 3篇 |
1988年 | 1篇 |
排序方式: 共有694条查询结果,搜索用时 0 毫秒
421.
In this study, we illustrate a real‐time approximate dynamic programming (RTADP) method for solving multistage capacity decision problems in a stochastic manufacturing environment, by using an exemplary three‐stage manufacturing system with recycle. The system is a moderate size queuing network, which experiences stochastic variations in demand and product yield. The dynamic capacity decision problem is formulated as a Markov decision process (MDP). The proposed RTADP method starts with a set of heuristics and learns a superior quality solution by interacting with the stochastic system via simulation. The curse‐of‐dimensionality associated with DP methods is alleviated by the adoption of several notions including “evolving set of relevant states,” for which the value function table is built and updated, “adaptive action set” for keeping track of attractive action candidates, and “nonparametric k nearest neighbor averager” for value function approximation. The performance of the learned solution is evaluated against (1) an “ideal” solution derived using a mixed integer programming (MIP) formulation, which assumes full knowledge of future realized values of the stochastic variables (2) a myopic heuristic solution, and (3) a sample path based rolling horizon MIP solution. The policy learned through the RTADP method turned out to be superior to polices of 2 and 3. © 2010 Wiley Periodicals, Inc. Naval Research Logistics 2010 相似文献
422.
为研究气液针栓式火箭发动机的声学振荡特性并为其优化设计提供指导,加工了具有矩形燃烧室的LOX/GCH4针栓式发动机,采用Euler-Lagrange方法仿真横向速度扰动产生的声学响应,以期在热试前了解声学激励频率对非稳态喷雾燃烧过程的影响.仿真结果表明,采用的横向速度扰动能在燃烧室内产生同频率的一阶横向声学振荡响应.喷... 相似文献
423.
针对基于响应面的并行子空间优化(CSSo-RS)过程的不足,提出了基于邻域加强的改进CSSO-RS优化过程.其主要思路是在子空间优化后,在得到的最优解附近进行全部变量的优化,以更好地协调系统级优化与子空间优化.用经典测试函数及通用航空飞机参数优化问题对该算法进行测试,测试结果表明该算法使CSSO-RS优化效率得到较大的... 相似文献
424.
针对磁悬浮刚性转子系统,提出了一种基于在线动平衡的磁轴承参数辨识方法。采用已知大小和相位的不平衡质量作为激振源,根据动平衡仪测得的转子不平衡响应,求得磁轴承位移刚度和电流刚度。利用某型磁悬浮控制力矩陀螺对该方法进行了试验验证,得到了一定转速范围内的磁轴承位移刚度和电流刚度,证明了该方法的正确性和实用性。试验结果表明外转子型磁轴承位移刚度和电流刚度随转速的增加而下降明显。 相似文献
425.
This article is a sequel to a recent article that appeared in this journal, “An extensible modeling framework for dynamic reassignment and rerouting in cooperative airborne operations” [ 17 ], in which an integer programming formulation to the problem of rescheduling in‐flight assets due to changes in battlespace conditions was presented. The purpose of this article is to present an improved branch‐and‐bound procedure to solve the dynamic resource management problem in a timely fashion, as in‐flight assets must be quickly re‐tasked to respond to the changing environment. To facilitate the rapid generation of attractive updated mission plans, this procedure uses a technique for reducing the solution space, supports branching on multiple decision variables simultaneously, incorporates additional valid cuts to strengthen the minimal network constraints of the original mathematical model, and includes improved objective function bounds. An extensive numerical analysis indicates that the proposed approach significantly outperforms traditional branch‐and‐bound methodologies and is capable of providing improved feasible solutions in a limited time. Although inspired by the dynamic resource management problem in particular, this approach promises to be an effective tool for solving other general types of vehicle routing problems. © 2013 Wiley Periodicals, Inc. Naval Research Logistics, 2013 相似文献
426.
This article presents a flexible days‐on and days‐off scheduling problem and develops an exact branch and price (B&P) algorithm to find solutions. The main objective is to minimize the size of the total workforce required to cover time‐varying demand over a planning horizon that may extend up to 12 weeks. A new aspect of the problem is the general restriction that the number of consecutive days on and the number of consecutive days off must each fall within a predefined range. Moreover, the total assignment of working days in the planning horizon cannot exceed some maximum value. In the B&P framework, the master problem is stated as a set covering‐type problem whose columns are generated iteratively by solving one of three different subproblems. The first is an implicit model, the second is a resource constrained shortest path problem, and the third is a dynamic program. Computational experiments using both real‐word and randomly generated data show that workforce reductions up to 66% are possible with highly flexible days‐on and days‐off patterns. When evaluating the performance of the three subproblems, it was found that each yielded equivalent solutions but the dynamic program proved to be significantly more efficient. © 2013 Wiley Periodicals, Inc. Naval Research Logistics 60: 678–701, 2013 相似文献
427.
许艳玲 《兵团教育学院学报》2013,(1):57-61
师生间的言语冲突在课堂教学中时有发生,而这一现象并未引起足够重视。课堂教学中师生间冲突性话语为本文的研究对象,分析其语言表现,并依据Brown&Levinson的面子威胁论,探析教师对于学生不合作话语引发的冲突回应,旨在揭示师生间冲突性话语的面子威胁性特征及语用理据。 相似文献
428.
429.
430.
Phillip Apuuli Kasaija 《African Security Review》2013,22(2):11-25
The Intergovernmental Authority on Development's (IGAD) Conflict Early Warning and Response Mechanism (CEWARN) 2012–2019 Strategy Framework has proposed that the CEWARN mechanism expand its conflict typologies and geographic coverage. The argument advanced in this paper is that the proposed CEWARN expansion should be welcomed. Since its establishment in 2003, CEWARN had restricted itself to dealing with cross-border pastoral conflicts among the member states. However, conceptually and legally, CEWARN was not precluded from dealing with other types of conflict. Firstly, in the past, any conflict, other than cross-border pastoral ones, had been considered by the member states as firmly within their national jurisdiction that mechanisms like CEWARN are precluded from handling. Secondly, CEWARN, which has hitherto been dependent on external donations, just does not have the requisite financial resources to expand its coverage. Thirdly, and most importantly, governments often know the imminence of some, if not all, of the conflicts because they cause them. Thus, they are not interested in reacting to them. In the end, the paper concludes that the proposal to expand CEWARN's conflict portfolio and geographic spread may just remain that – a proposal. 相似文献