全文获取类型
收费全文 | 699篇 |
免费 | 222篇 |
国内免费 | 11篇 |
出版年
2023年 | 3篇 |
2022年 | 9篇 |
2021年 | 30篇 |
2020年 | 6篇 |
2019年 | 10篇 |
2018年 | 8篇 |
2017年 | 10篇 |
2016年 | 13篇 |
2015年 | 32篇 |
2014年 | 22篇 |
2013年 | 85篇 |
2012年 | 27篇 |
2011年 | 21篇 |
2010年 | 26篇 |
2009年 | 35篇 |
2008年 | 28篇 |
2007年 | 47篇 |
2006年 | 21篇 |
2005年 | 40篇 |
2004年 | 14篇 |
2003年 | 13篇 |
2002年 | 14篇 |
2001年 | 15篇 |
2000年 | 27篇 |
1999年 | 52篇 |
1998年 | 50篇 |
1997年 | 39篇 |
1996年 | 41篇 |
1995年 | 30篇 |
1994年 | 33篇 |
1993年 | 27篇 |
1992年 | 18篇 |
1991年 | 24篇 |
1990年 | 21篇 |
1989年 | 11篇 |
1988年 | 5篇 |
1987年 | 7篇 |
1986年 | 8篇 |
1985年 | 5篇 |
1983年 | 2篇 |
1982年 | 2篇 |
1977年 | 1篇 |
排序方式: 共有932条查询结果,搜索用时 46 毫秒
121.
本文介绍了武昌造船厂在企业质量文化中,继承和拓展优良传统,牢固树立"100 1"的质量理念,采取特色管理活动,结合生产经营管理实际,把质量文化理念与生产经营深度融合,在企业管理中落地生根,促进质量管理水平不断提高和产品实物质量的持续提升。 相似文献
122.
This article analyses the doctrine development of the People’s Liberation Army (PLA) coping with the Soviet military threat between 1969 and 1989. In the 1970s, the PLA applied a doctrine of ‘active defence and luring the enemy into depth’ based on its traditional operational art. In 1980, the PLA decided to focus its doctrine on positional defence. In 1986, the PLA introduced ‘integrated operations and prioritised strike’, a generalised doctrine that originated from its war history. Many organisational and intellectual challenges in peacetime doctrine development contributed to the PLA’s operational idealism, including its aging leadership, command structure, attitude towards its previous experience, limited analysis of contemporary military developments, and failure in test and validation of doctrines. In the post-Cold War decade, many of these challenges persisted in spite of military modernization efforts. The ongoing military reform has to address these challenges and improve the PLA doctrine development in peacetime. 相似文献
123.
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. 相似文献
124.
125.
一般情况下,缺陷定位技术的应用前提是必须存在测试预言,以判断测试用例的运行结果是失败或者成功,否则将无法使用。然而,在许多实际情况下,测试预言不存在或者很难定义,这就是著名的"预言家难题"。为了应对"预言家难题",利用蜕变测试,扩充了采用逆向切片基于频谱的缺陷定位技术的方法学,实现了其在无测试预言下的有效应用。基于上述研究,进一步对比了SFL技术中执行切片与逆向切片的缺陷定位能力。实验表明,在有测试预言和无测试预言两种情况下,逆向切片比执行切片具有更强的缺陷定位能力,并且公式GP19和ER1’相比于其他公式,更有可能达到最优结果。 相似文献
126.
以简谐外磁场环境下的J-C模型为研究对象,从系统的哈密顿矩阵出发,通过计算模拟得出热力学纠缠度解析表达式。计算结果表明,对应于不同的外磁场强度,系统热力学纠缠度呈周期性余弦变化,但随环境温度升高快速衰减;在相同环境温度下,系统热力学纠缠度关于磁场强度左右不对称变化。 相似文献
127.
针对蚁群算法求解CVRP问题时收敛速度慢、求解质量不高的缺点,提出了一种改进启发式蚁群算法。该算法借鉴蚁群系统和基于排列的蚂蚁系统的优点设计信息素更新策略,既加强了对每次迭代最好解的利用,又避免了陷入局部最优;按一定比例使用基本方法和基于PFIH方法构造路径,扩大了算法的搜索空间;采用一种混合局部搜索算子,增强了算法局部寻优能力。实验结果表明,改进启发式蚁群算法可以大幅度减少车辆运行成本,具有较快的收敛速度。 相似文献
128.
用适宜载体将粉体材料固定是提高光催化材料稳定性的关键。采用溶胶-凝胶法,以钛酸丁酯为原料,选取活性炭纤维(ACF)为载体,制备了TiO2/ACF复合光催化材料。利用X射线衍射仪(XRD)、热分析仪(DSC-TG)和扫描电子显微镜(SEM)等测试技术对复合光催化材料的结构进行了表征分析。在紫外光照射下,通过对甲醛气体的光催化降解,考察了煅烧温度、煅烧时间、负载次数和负载时间等不同制备条件对复合光催化材料结构和性能的影响,结果表明:当煅烧温度为400℃,煅烧时间为2h,负载3次,负载时间为6min制备的TiO2/ACF光催化性能最佳。 相似文献
129.
Sungil Kim Heeyoung Kim Jye‐Chyi Lu Michael J. Casciato Martha A. Grover Dennis W. Hess Richard W. Lu Xin Wang 《海军后勤学研究》2015,62(2):127-142
In the field of nanofabrication, engineers often face unique challenges in resource‐limited experimental budgets, the sensitive nature of process behavior with respect to controllable variables, and highly demanding tolerance requirements. To effectively overcome these challenges, this article proposes a methodology for a sequential design of experiments through batches of experimental runs, aptly named Layers of Experiments with Adaptive Combined Design (LoE/ACD). In higher layers, where process behavior is less understood, experimental regions cover more design space and data points are more spread out. In lower layers, experimental regions are more focused to improve understanding of process sensitivities in a local, data‐rich environment. The experimental design is a combination of a space‐filling and an optimal design with a tuning parameter that is dependent on the amount of information accumulated over the various layers. The proposed LoE/ACD method is applied to optimize a carbon dioxide (epet‐CO2) assisted deposition process for fabricating silver nanoparticles with pressure and temperature variables. © 2015 Wiley Periodicals, Inc. Naval Research Logistics 62: 127–142, 2015 相似文献
130.
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 相似文献