全文获取类型
收费全文 | 134篇 |
免费 | 22篇 |
国内免费 | 19篇 |
出版年
2024年 | 1篇 |
2023年 | 1篇 |
2022年 | 1篇 |
2021年 | 2篇 |
2019年 | 4篇 |
2018年 | 1篇 |
2017年 | 7篇 |
2016年 | 16篇 |
2015年 | 11篇 |
2014年 | 15篇 |
2013年 | 9篇 |
2012年 | 14篇 |
2011年 | 9篇 |
2010年 | 8篇 |
2009年 | 16篇 |
2008年 | 8篇 |
2007年 | 5篇 |
2006年 | 16篇 |
2005年 | 8篇 |
2004年 | 7篇 |
2003年 | 4篇 |
2002年 | 1篇 |
2001年 | 4篇 |
2000年 | 1篇 |
1998年 | 1篇 |
1997年 | 2篇 |
1994年 | 1篇 |
1992年 | 1篇 |
1990年 | 1篇 |
排序方式: 共有175条查询结果,搜索用时 0 毫秒
151.
In this article, we define two different workforce leveling objectives for serial transfer lines. Each job is to be processed on each transfer station for c time periods (e.g., hours). We assume that the number of workers needed to complete each operation of a job in precisely c periods is given. Jobs transfer forward synchronously after every production cycle (i.e., c periods). We study two leveling objectives: maximin workforce size () and min range (R). Leveling objectives produce schedules where the cumulative number of workers needed in all stations of a transfer line does not experience dramatic changes from one production cycle to the next. For and a two‐station system, we develop a fast polynomial algorithm. The range problem is known to be NP‐complete. For the two‐station system, we develop a very fast optimal algorithm that uses a tight lower bound and an efficient procedure for finding complementary Hamiltonian cycles in bipartite graphs. Via a computational experiment, we demonstrate that range schedules are superior because not only do they limit the workforce fluctuations from one production cycle to the next, but they also do so with a minor increase in the total workforce size. We extend our results to the m‐station system and develop heuristic algorithms. We find that these heuristics work poorly for min range (R), which indicates that special structural properties of the m‐station problem need to be identified before we can develop efficient algorithms. © 2016 Wiley Periodicals, Inc. Naval Research Logistics 63: 577–590, 2016 相似文献
152.
153.
154.
针对基于对称量测方程的多目标跟踪,传统的滤波手段无法解决因对称变换带来的非高斯问题,提出一种新的遗传粒子滤波方法。新的滤波算法利用粒子的噪声含量与权值的负相关,改进了更新过程中权值计算所依赖的概率密度函数,避免了新量测噪声的求解。同时利用遗传算法的优势,保障了粒子的多样性,提高了粒子的使用效率,防止了滤波发散及局部最优。仿真结果表明,基于对称量测方程的多目标跟踪中,改进的遗传粒子滤波算法较扩展卡尔曼滤波算法、不敏卡尔曼滤波算法和联合概率数据关联滤波算法跟踪效果更好。 相似文献
155.
156.
157.
王胜兵 《海军工程大学学报》2001,13(2):45-48
引入带权的Sobolev空间 ,讨论了奇型非线性抛物问题的有限元方法 ,在a(u) ,f(u)均满足Lips chitz条件下 ,证明了相应椭圆投影算子Rhu与u之间误差估计式 ,并在一定的假设下 ,给出了奇型非线性抛物问题的广义解u及半离散问题的有限元解uh 误差估计式 . 相似文献
158.
John M. Ballard 《Arms and Armour》2018,15(1):83-95
In 1920, the Birmingham Small Arms Company supplied 10,000 Pattern 1907 bayonets to the government of Siam to accompany an order for rifles. The original maker of these bayonets was unknown, but historical research indicates that the Wilkinson Sword Co. Ltd. was a primary maker. The weights of some surviving Pattern 1907 bayonets, including twelve bayonets from the 10,000 described above, produced by the six makers in the UK before and during the Great War (1914–1918) period were available. A statistical analysis of the data was performed to compare with the historical research. The results strongly supported that the Wilkinson Sword Co. Ltd. was a primary maker. They were also sufficient to exclude from this batch of twelve bayonets the Royal Small Arms Factory (Enfield) and Vickers Ltd. as manufacturers. The statistical evidence for the presence of bayonets made by J.A. Chapman Ltd., R. Mole & Sons and Sanderson Bros. was weaker than that for the Wilkinson Sword Co. Ltd., but was nevertheless supportive of that hypothesis. Overall, the analysis was consistent with the supply to Siam of commingled bayonets from British government stores. It was noted that the bayonets for the Siam contract fell into a relatively narrow weight range, but the reason for this could not be determined. 相似文献
159.
大型综合公共建筑的火灾有其特殊性,应用层次分析法进行火灾风险评估时,关键在于根据消防工作的特点,结合在实际工作中得到的经验,建立评估的指标体系和各指标的评价尺度,这样才能得出符合实际的工作方法。 相似文献
160.
在综述消防责任事故罪中的"经消防监督机构通知采取改正措施拒绝执行"要件观点的基础上,对该要件的存在基础、对主体范围的限制、放纵犯罪以及刑法的预防功能等方面进行了分析,指出该要件的缺陷,进而提出合理化建议。 相似文献