全文获取类型
收费全文 | 10935篇 |
免费 | 1476篇 |
国内免费 | 1483篇 |
专业分类
电工技术 | 1028篇 |
综合类 | 884篇 |
化学工业 | 252篇 |
金属工艺 | 120篇 |
机械仪表 | 1054篇 |
建筑科学 | 122篇 |
矿业工程 | 99篇 |
能源动力 | 170篇 |
轻工业 | 47篇 |
水利工程 | 231篇 |
石油天然气 | 24篇 |
武器工业 | 75篇 |
无线电 | 1455篇 |
一般工业技术 | 1250篇 |
冶金工业 | 178篇 |
原子能技术 | 4篇 |
自动化技术 | 6901篇 |
出版年
2024年 | 81篇 |
2023年 | 201篇 |
2022年 | 314篇 |
2021年 | 334篇 |
2020年 | 447篇 |
2019年 | 378篇 |
2018年 | 376篇 |
2017年 | 463篇 |
2016年 | 515篇 |
2015年 | 574篇 |
2014年 | 779篇 |
2013年 | 1244篇 |
2012年 | 868篇 |
2011年 | 825篇 |
2010年 | 638篇 |
2009年 | 773篇 |
2008年 | 799篇 |
2007年 | 792篇 |
2006年 | 670篇 |
2005年 | 595篇 |
2004年 | 469篇 |
2003年 | 357篇 |
2002年 | 290篇 |
2001年 | 216篇 |
2000年 | 163篇 |
1999年 | 151篇 |
1998年 | 110篇 |
1997年 | 91篇 |
1996年 | 63篇 |
1995年 | 65篇 |
1994年 | 52篇 |
1993年 | 35篇 |
1992年 | 37篇 |
1991年 | 29篇 |
1990年 | 16篇 |
1989年 | 16篇 |
1988年 | 6篇 |
1987年 | 2篇 |
1986年 | 11篇 |
1985年 | 10篇 |
1984年 | 12篇 |
1983年 | 6篇 |
1981年 | 3篇 |
1980年 | 4篇 |
1979年 | 2篇 |
1978年 | 2篇 |
1976年 | 3篇 |
1975年 | 3篇 |
1972年 | 1篇 |
1971年 | 1篇 |
排序方式: 共有10000条查询结果,搜索用时 0 毫秒
31.
Xianpeng Wang Lixin Tang 《The International Journal of Advanced Manufacturing Technology》2008,36(5-6):431-441
This paper investigates the hot rolling production scheduling problem in the steel industry and proposes a new mixed integer
programming model for this problem based on the monolithic modeling strategy that integrates batching and scheduling. Using
this strategy, the new model can simultaneously schedule multiple turns and simultaneously determine the production timetable
of these turns in a global optimal view. A long-term tabu search heuristic using frequency-based memory is developed to obtain
near-optimal solutions for this problem. Three kinds of speed-up strategies are developed to accelerate the search procedure
of the proposed tabu search. A practical scheduling system combining the proposed mathematical model and the tabu search heuristic
has been developed and tested on instances collected from practical production data. The experimental results show that the
proposed mathematical model and the tabu search heuristic outperform both the current manual scheduling method and the traditional
serial method. 相似文献
32.
This paper addresses the problem of bandwidth allocation under the weighted maximum rate constrained link sharing policy and proves a key theory in the condition of allocation termination. We propose several algorithms with various worst-case and average-case time complexities, and evaluate their computation elapse times. 相似文献
33.
Intelligent scheduling with tabu search: An application to jobs with linear delay penalties and sequence-dependent setup costs and times 总被引:3,自引:0,他引:3
In this article we study thetabu search (TS) method in an application for solving an important class of scheduling problems. Tabu search is characterized by integrating artificial intelligence and optimization principles, with particular emphasis on exploiting flexible memory structures, to yield a highly effective solution procedure. We first discuss the problem of minimizing the sum of the setup costs and linear delay penalties when N jobs, arriving at time zero, are to be scheduled for sequential processing on a continuously available machine. A prototype TS method is developed for this problem using the common approach of exchanging the position of two jobs to transform one schedule into another. A more powerful method is then developed that employs insert moves in combination with swap moves to search the solution space. This method and the best parameters found for it during the preliminary experimentation with the prototype procedure are used to obtain solutions to a more complex problem that considers setup times in addition to setup costs. In this case, our procedure succeeded in finding optimal solutions to all problems for which these solutions are known and a better solution to a larger problem for which optimizing procedures exceeded a specified time limit (branch and bound) or reached a memory overflow (branch and bound/dynamic programming) before normal termination. These experiments confirm not only the effectiveness but also the robustness of the TS method, in terms of the solution quality obtained with a common set of parameter choices for two related but different problems. 相似文献
34.
水调自动化系统是电网运行的重要生产系统,该系统对数据库备份、数据完整性、实时性和并发访问能力等都提出了较高的要求,如何科学地应用商用数据库提供的高级功能构建稳定、可靠、高效的水调自动化系统,成为一个新课题.文中针对该问题,分析比较了多种常见的高可用数据库方案,最终选择应用Oracle Data Guard技术,构建高性能、高可用、低成本、易维护的水调自动化系统. 相似文献
35.
36.
37.
Providing performance guarantees for arriving traffic flows has become an important measure for today’s routing and switching systems. However, none of current scheduling algorithms built on CICQ (combined input and cross-point buffered) switches can provide flow level performance guarantees. Aiming at meeting this requirement, the feasibility of implementing flow level scheduling is discussed thoroughly. Then, based on the discussion, it comes up with a hybrid and stratified fair scheduling (HSFS) scheme, which is hierarchical and hybrid, for CICQ switches. With HSFS, each input port and output port can schedule variable length packets independently with a complexity of O(1). Theoretical analysis show that HSFS can provide delay bound, service rate and fair performance guarantees without speedup. Finally, we implement HSFS in SPES (switch performance evaluation system) to verify the analytical results. 相似文献
38.
《International Journal of Parallel, Emergent and Distributed Systems》2012,27(1-3):165-184
The purpose of this paper is to examine the impact of scheduling parallel tasks onto non-uniform memory access (NUMA) shared-memory multiprocessor systems by considering non-negligible intertask communications and communication contentions. Communication contentions arise from the communication medium having insufficient capacity to serve all transmissions, thereby causing significant contention delays. Therefore, a new scheduling algorithm, herein referred to as the Extended Critical Path (ECP) algorithm is proposed. The proposed algorithm schedules parallel tasks by considering non-negligible intertask communications and the contentions among shared communication resources. Moreover, it ensures performance within a factor of two of the optimum for general directed acyclic task graphs (DATGs). Experimental results demonstrate the superiority of the ECP algorithm over the scheduling algorithms presented in previous literature. 相似文献
39.
40.
针对诊疗设备维护和住院患者候诊难以有效协调的问题,建立了联合优化模型。首先,假设设备具有离散的劣化状态,将设备的劣化过程建模为连续时间马尔可夫链;其次,考虑到患者对诊疗设备的不同功能频率需求,以及不同劣化状态对患者治疗时间、费用的影响,以患者就诊顺序、检查策略、修复策略为决策变量建立了设备维护和患者调度模型;最后,采用改进后的非支配排序遗传算法对多目标问题进行了求解。实验结果验证了设备维护与患者调度联合优化模型的有效性。改进后的算法提高了整体和局部的搜索能力,且具有鲁棒性。 相似文献