全文获取类型
收费全文 | 317篇 |
免费 | 142篇 |
国内免费 | 9篇 |
出版年
2024年 | 3篇 |
2023年 | 4篇 |
2022年 | 7篇 |
2021年 | 7篇 |
2020年 | 13篇 |
2019年 | 4篇 |
2018年 | 8篇 |
2017年 | 19篇 |
2016年 | 24篇 |
2015年 | 17篇 |
2014年 | 22篇 |
2013年 | 31篇 |
2012年 | 20篇 |
2011年 | 31篇 |
2010年 | 21篇 |
2009年 | 28篇 |
2008年 | 16篇 |
2007年 | 16篇 |
2006年 | 26篇 |
2005年 | 33篇 |
2004年 | 17篇 |
2003年 | 13篇 |
2002年 | 12篇 |
2001年 | 16篇 |
2000年 | 10篇 |
1999年 | 6篇 |
1998年 | 11篇 |
1997年 | 7篇 |
1996年 | 5篇 |
1995年 | 2篇 |
1994年 | 4篇 |
1993年 | 2篇 |
1992年 | 1篇 |
1991年 | 3篇 |
1990年 | 4篇 |
1989年 | 5篇 |
排序方式: 共有468条查询结果,搜索用时 15 毫秒
241.
We study two‐agent scheduling on a single sequential and compatible batching machine in which jobs in each batch are processed sequentially and compatibility means that jobs of distinct agents can be processed in a common batch. A fixed setup time is required before each batch is started. Each agent seeks to optimize some scheduling criterion that depends on the completion times of its own jobs only. We consider several scheduling problems arising from different combinations of some regular scheduling criteria, including the maximum cost (embracing lateness and makespan as its special cases), the total completion time, and the (weighted) number of tardy jobs. Our goal is to find an optimal schedule that minimizes the objective value of one agent, subject to an upper bound on the objective value of the other agent. For each problem under consideration, we provide either a polynomial‐time or a pseudo‐polynomial‐time algorithm to solve it. We also devise a fully polynomial‐time approximation scheme when both agents’ scheduling criteria are the weighted number of tardy jobs. 相似文献
242.
Jack S. Levy 《战略研究杂志》2017,40(5):731-769
If a declining state has incentives for preventive war, the rising state should have incentives to delay a confrontation until it is stronger. We develop the theoretical paradox and examine the July 1914 crisis. Why did Russia, rising relative to Germany, not adopt a buying-time strategy? We argue that although most Russian leaders hoped to avoid a confrontation, they feared that the failure to support Serbia would lead to a loss of Russian credibility and a significant setback to Russia’s position in the Balkans, one that could not easily be reversed, even with Russia’s expected increase in relative military power. 相似文献
243.
电磁轨道炮轨道温度场与热应力数值仿真 总被引:1,自引:0,他引:1
在电磁轨道炮发射过程中,因热量累积而引起的急速温升与热应力对轨道性能和寿命有着重要的影响。为获得发射过程中轨道温度场及热应力分布情况,在分析轨道热载荷的基础上,建立了热载荷计算模型,并在给定的参数下,利用有限元仿真软件ANSYS Workbench对3种典型截面轨道的温度场与热应力进行了数值仿真。仿真结果表明:轨道温度场与热应力轴向上呈梯度分布,纵向上只扩散到内表面很薄的区域,温度与热应力最大值在电枢初始位置处;相较于矩形与凹形截面轨道,凸形截面轨道温升与热应力较低,性能较好。 相似文献
244.
By drawing on the literature about security regimes, this article posits the idea that a particular type of regime, which can be termed a “tacit security regime” (TSR), has begun to emerge between Israel, on the one hand, and several Gulf Arab states, on the other. It is a regime which, unlike liberal institutional variants that attempt to privilege the promotion of collective norms, remains configured around perceptions of threats to be countered and strategic interests to be realized. By examining the development, scope, and scale of this nascent TSR, this article explores the extent to which Israel, mindful of Washington, DC’s regional retrenchment, sees the emergence of such a regime as redefining the political and strategic contours of Israel’s relations with much of the Middle East. 相似文献
245.
一种齿轮箱振动控制方法 总被引:4,自引:0,他引:4
从机械结构的振动控制理论出发 ,提出了一种齿轮箱振动控制方法 ,研究并讨论几种齿轮箱箱体以及齿轮本体的结构参数对动态特性的影响 ,其结论可以为齿轮箱的振动设计提供参考依据 相似文献
246.
拖缆系统直线定常运动仿真计算 总被引:10,自引:4,他引:6
推导了一个三因次拖缆系统动力平衡运动方程式 ,采用中心差分方法数值离散拖缆系统动力平衡方程 .根据离散方程编制了拖缆系统直线定常运动程序 ,在设定拖缆尾端自由边界条件及拖点边界条件下 ,数值仿真计算 30m拖缆的阵形 .根据仿真计算讨论了拖缆的材料刚度、拖缆水中重量、拖点速度、水动力系数主要参数等对拖缆阵形的影响 .拖缆系统直线定常运动的仿真计算为拖缆系统设计可提供参考依据 ,同时通过该仿真计算及讨论 ,为拖缆系统非定常运动仿真计算奠定了基础 相似文献
247.
248.
通过建立钢筋钢纤维混凝土既有裂缝梁和钢筋混凝土既有裂缝梁的有限元分析模型,借助ANSYS分析了两种梁在荷载作用下的裂缝尖端处应力、裂缝宽度增幅和挠度并作出对比。分析结果表明钢纤维对裂缝开展有很好的阻止作用,而且能明显缓和裂缝尖端处应力,减小梁的挠度。 相似文献
249.
Most machine scheduling models assume that the machines are available all of the time. However, in most realistic situations, machines need to be maintained and hence may become unavailable during certain periods. In this paper, we study the problem of processing a set of n jobs on m parallel machines where each machine must be maintained once during the planning horizon. Our objective is to schedule jobs and maintenance activities so that the total weighted completion time of jobs is minimized. Two cases are studied in this paper. In the first case, there are sufficient resources so that different machines can be maintained simultaneously if necessary. In the second case, only one machine can be maintained at any given time. In this paper, we first show that, even when all jobs have the same weight, both cases of the problem are NP-hard. We then propose branch and bound algorithms based on the column generation approach for solving both cases of the problem. Our algorithms are capable of optimally solving medium sized problems within a reasonable computational time. We note that the general problem where at most j machines, 1 ≤ j ≤ m, can be maintained simultaneously, can be solved similarly by the column generation approach proposed in this paper. © 2000 John Wiley & Sons, Inc. Naval Research Logistics 47: 145–165, 2000 相似文献
250.
从节能降耗角度探讨了对风幕机进行改进的必要性 ,通过计算分析确定了风速为系统改进所要考虑的主要环境因素 ,研究了利用热电式风速传感器和变频器实现系统智能化改进的可行性。 相似文献