全文获取类型
收费全文 | 23799篇 |
免费 | 3801篇 |
国内免费 | 2950篇 |
学科分类
工业技术 | 30550篇 |
出版年
2024年 | 126篇 |
2023年 | 442篇 |
2022年 | 734篇 |
2021年 | 820篇 |
2020年 | 998篇 |
2019年 | 846篇 |
2018年 | 779篇 |
2017年 | 1029篇 |
2016年 | 1087篇 |
2015年 | 1264篇 |
2014年 | 1734篇 |
2013年 | 2073篇 |
2012年 | 1873篇 |
2011年 | 1736篇 |
2010年 | 1408篇 |
2009年 | 1573篇 |
2008年 | 1660篇 |
2007年 | 1770篇 |
2006年 | 1422篇 |
2005年 | 1391篇 |
2004年 | 1174篇 |
2003年 | 920篇 |
2002年 | 765篇 |
2001年 | 602篇 |
2000年 | 448篇 |
1999年 | 399篇 |
1998年 | 296篇 |
1997年 | 227篇 |
1996年 | 188篇 |
1995年 | 183篇 |
1994年 | 144篇 |
1993年 | 89篇 |
1992年 | 79篇 |
1991年 | 58篇 |
1990年 | 33篇 |
1989年 | 29篇 |
1988年 | 19篇 |
1987年 | 10篇 |
1986年 | 21篇 |
1985年 | 20篇 |
1984年 | 18篇 |
1983年 | 12篇 |
1982年 | 5篇 |
1981年 | 7篇 |
1980年 | 11篇 |
1979年 | 8篇 |
1978年 | 7篇 |
1977年 | 3篇 |
1976年 | 3篇 |
1975年 | 3篇 |
排序方式: 共有10000条查询结果,搜索用时 23 毫秒
81.
半导体晶圆制造车间层控制的内容及方法 总被引:2,自引:0,他引:2
半导体晶圆制造企业是资本密集、技术密集型产业,晶圆制造厂也是公认生产最为复杂的工厂之一。产品更新换代快、市场竞争激烈等特点使得投资者对设备产能和设备利用率高度重视。这已不仅仅是技术问题,而是生产制造过程管理的问题。本文介绍了半导体晶圆制造车间层控制的内容及方法。 相似文献
82.
Location and calculation-free node-scheduling schemes in large wireless sensor networks 总被引:1,自引:0,他引:1
In wireless sensor networks that consist of a large number of low-power, short-lived, unreliable sensors, one of the main design challenges is to obtain long system lifetime without sacrificing system original performance (sensing coverage and sensing reliability). To solve this problem, one of the potential approaches is to identify redundant nodes at the sensing interface and then assign them an off-duty operation mode that has lower energy consumption than the normal on-duty mode. In our previous work [J. Wireless Commun. Mobile Comput. 3 (2003) 271; Processing of ACM Wireless Sensor Network and Application Workshop 2002, September 2002], we proposed a node-scheduling scheme, which can provide a 100% sensing coverage preservation capability. This, however, requires each node to be aware of its own and its neighbors’ location information. Also, in that scheme, each node has to do accurate geometrical calculation to determine whether to take an off-duty status. In this paper, we propose and study several alternative node-scheduling schemes, which cannot completely preserve the original system coverage, but are nonetheless light-weighted and flexible compared with the previous one. Our simulation results compare these schemes with the previous one and demonstrate their effectiveness. 相似文献
83.
84.
Andrzej Ciepielewski 《International journal of parallel programming》1991,20(6):421-451
Implementation of or-parallel Prolog systems offers a number of interesting scheduling problems. The main issues are the interaction between memory models and scheduling, ordering of multiple solutions, and scheduling of speculative work. The problems occur partly because of the design choices (e.g. the choice of a memory model), and partly because of the desire to maintain observational equivalence between parallel and sequential implementations of Prolog, while achieving high efficiency. In the first part of this paper a common framework for discussing scheduling in or-parallel systems is introduced, and also a collection of issues that must be addressed in such systems is presented. In the second part of the paper we survey a number of solutions to these problems comparing their efficiency whenever possible. We close the survey with a short discussion of open problems.Current association: Carlstedt Elektronik AB 相似文献
85.
Parthasarathy P. Tirumalai Meng Lee Michael S. Schlansker 《The Journal of supercomputing》1991,5(2-3):119-136
Modulo scheduling theory can be applied successfully to overlap Fortran DO loops on pipelined computers issuing multiple operations per cycle both with and without special loop architectural support. This paper shows that a broader class of loops—REPEAT-UNTIL, WHILE, and loops with more than one exit, in which the trip count is not known beforehand—can also be overlapped efficiently on multiple-issue pipelined machines. The approach is described with respect to a specific machine model, but it can be extended to other models. Special features in the architecture, as well as compiler representations for accelerating these loop constructs, are discussed. Performance results are presented for a few select examples.An earlier version of this paper was presented at Supercomputing '90. 相似文献
86.
一个改进的单抓钩周期性排序模型及其在自动化学处理线中的应用 总被引:1,自引:0,他引:1
计算机控制的抓钩广泛用于自动化学处理线的工件的运送。抓钩的排序直接影响系统的生产率,抓钩排序的目标是对运送进行排序以极大化生产率。当某工序处理时间非常长时,该工序成为瓶颈。为了去除该瓶颈,系统可以为该工序设计多个处理槽,这称为“多重处理槽”问题。本文提出一个改进的混合整数规划模型以求解有“多重处理槽”的单抓钩周期性排序问题的最优解。实例表明所提出的方法是有效的。 相似文献
87.
88.
Intelligent methods for automatic protection and restoration are critical in optical transport mesh networks. This paper discusses the problem of quality-of-service (QoS)-based protection in terms of the protection-switching time and availability for end-to-end lightpaths in a WDM mesh network. We analyze the backup lightpath-sharing problem in such networks and study the correlation of the working lightpaths and the impact of the correlation on the sharing of the backup lightpaths. We present a multi-protocol-label-switching (MPLS) control-based fully distributed algorithm to solve the protection problem. The proposed algorithm includes intelligent and automatic procedures to set up, take down, activate, restore, and manage backup lightpaths. It greatly reduces the required resources for protection by allowing the sharing of network resources by multiple backup lightpaths. At the same time, it guarantees, if possible, to satisfy the availability requirement even with resource sharing by taking the correlation of working lightpaths into consideration. A simple analysis of the proposed algorithm in terms of computation time and message complexity indicates that the implementation of the algorithm is practical. The illustrative studies that compare the performance of 1:1, unlimited sharing, and QoS-based backup sharing algorithms indicate that QoS-based sharing achieves comparable performance as unlimited sharing, which is much better than the 1:1 backup scheme in terms of connection blocking probability, average number of connections in the network for a given offered load, and network resource utilization. 相似文献
89.
Recently, efficient scheduling algorithms based on Lagrangian relaxation have been proposed for scheduling parallel machine
systems and job shops. In this article, we develop real-world extensions to these scheduling methods. In the first part of
the paper, we consider the problem of scheduling single operation jobs on parallel identical machines and extend the methodology
to handle multiple classes of jobs, taking into account setup times and setup costs. The proposed methodology uses Lagrangian
relaxation and simulated annealing in a hybrid framework. In the second part of the paper, we consider a Lagrangian relaxation
based method for scheduling job shops and extend it to obtain a scheduling methodology for a real-world flexible manufacturing
system with centralized material handling.
This research was supported in part by the Office of Naval Research and the Department of Science and Technology grant N00014-93-1017. 相似文献
90.
碾压混凝土坝施工进度与质量控制的新措施 总被引:1,自引:1,他引:0
碾压混凝土重力坝和拱坝由于连续施工的坝体混凝土体积大,施工期间需要采取较为严格的温度控制措施,而所采取的温控措施是否有效,目前尚没有一个能够用于实际施工过程的快速有效的评估方法和方式,不能根据已施工坝体内的实际情况来控制施工进度和质量。利用分布式光纤温度测量系统来快速地获得坝体混凝土内部的大量温度信息,进而实际标定温度仿真程序并通过标定过程模拟拟施工的连续碾压层,以检验其温控措施的有效性。通过坝体内部的温度、温度变化速率和梯度来达到实时控制坝体碾压上升速度、坝面和仓面养护、以及冷缝灌浆处理等目的。 相似文献