全文获取类型
收费全文 | 25406篇 |
免费 | 3219篇 |
国内免费 | 2528篇 |
专业分类
电工技术 | 4001篇 |
技术理论 | 9篇 |
综合类 | 2534篇 |
化学工业 | 662篇 |
金属工艺 | 388篇 |
机械仪表 | 2461篇 |
建筑科学 | 1139篇 |
矿业工程 | 729篇 |
能源动力 | 370篇 |
轻工业 | 370篇 |
水利工程 | 442篇 |
石油天然气 | 306篇 |
武器工业 | 239篇 |
无线电 | 3516篇 |
一般工业技术 | 1968篇 |
冶金工业 | 453篇 |
原子能技术 | 23篇 |
自动化技术 | 11543篇 |
出版年
2024年 | 184篇 |
2023年 | 506篇 |
2022年 | 954篇 |
2021年 | 1144篇 |
2020年 | 1189篇 |
2019年 | 750篇 |
2018年 | 719篇 |
2017年 | 874篇 |
2016年 | 954篇 |
2015年 | 1073篇 |
2014年 | 1881篇 |
2013年 | 2040篇 |
2012年 | 2141篇 |
2011年 | 1941篇 |
2010年 | 1483篇 |
2009年 | 1504篇 |
2008年 | 1599篇 |
2007年 | 1795篇 |
2006年 | 1445篇 |
2005年 | 1351篇 |
2004年 | 1098篇 |
2003年 | 905篇 |
2002年 | 751篇 |
2001年 | 654篇 |
2000年 | 485篇 |
1999年 | 400篇 |
1998年 | 274篇 |
1997年 | 228篇 |
1996年 | 155篇 |
1995年 | 151篇 |
1994年 | 125篇 |
1993年 | 99篇 |
1992年 | 70篇 |
1991年 | 59篇 |
1990年 | 39篇 |
1989年 | 28篇 |
1988年 | 13篇 |
1987年 | 10篇 |
1986年 | 17篇 |
1985年 | 14篇 |
1984年 | 14篇 |
1983年 | 6篇 |
1981年 | 5篇 |
1980年 | 9篇 |
1979年 | 2篇 |
1978年 | 2篇 |
1976年 | 3篇 |
1975年 | 3篇 |
1966年 | 1篇 |
1965年 | 1篇 |
排序方式: 共有10000条查询结果,搜索用时 31 毫秒
51.
本文给出一种全新的页面描述语言文本,它是一种真正的程序设计语言,而且是一种面向对象的智能语言。本语言已具有绿色软件的品格。 相似文献
52.
本文介绍智能控制在回转窑配料系统中的应用情况,并阐述该控制器设计、构成、软件系统特点及现场运行效果。 相似文献
53.
Sidhartha R. Das Basheer M. Khumawala 《International Journal of Flexible Manufacturing Systems》1991,3(2):121-147
Flexible manufacturing systems (FMSs) are a class of automated systems that can be used to improve productivity in batch manufacturing. Four stages of decision making have been defined for an FMS—the design, planning, scheduling, and control stages. This research focuses on the planning stage, and specifically in the area of scheduling batches of parts through the system.The literature to date on the FMS planning stage has mostly focused on the machine grouping, tool loading, and parttype selection problems. Our research carries the literature a step further by addressing the problem of scheduling batches of parts. Due to the use of serial-access material-handling systems in many FMSs, the batch-scheduling problem is modeled for a flexible flow system (FFS). This model explicitly accounts for setup times between batches that are dependent on their processing sequence.A heuristic procedure is developed for this batch-scheduling problem—the Maximum Savings (MS) heuristic. The MS heuristic is based upon the savings in time associated with a particular sequence and selecting the one with the maximum savings. It uses a two-phase method, with the savings being calculated in phase I, while a branch-and-bound procedure is employed to seek the best heuristic solution in phase II. Extensive computational results are provided for a wide variety of problems. The results show that the MS heuristic provides good-quality solutions. 相似文献
54.
目前,钻井中井下检测信号的传输主要运用泥浆脉冲、电磁波等方式。随着井深的增加、复杂结构井和欠平衡井的增多以及对传输速度要求的提高,电缆信号传输必然是今后智能钻井的发展方向。通过对半个多世纪来各类电缆信号传输的设计进行归类,详细介绍了其设计原理,提出了电缆信号传输设计的基本要求与难点。 相似文献
55.
A Stronger Complexity Result for the Single Machine Multi-Operation Jobs Scheduling Problem to Minimize the Number of Tardy Jobs 总被引:1,自引:0,他引:1
We consider the single machine multi-operation jobs scheduling problem to minimize the number of tardy jobs. Each job consists of several operations that belong to different families. In a schedule, each family of job operations may be processed in batches with each batch incurring a setup time. A job completes when all of its operations have been processed. The objective is to minimize the number of tardy jobs. In the literature, this problem has been proved to be strongly NP-hard for arbitrary due-dates. We show in this paper that the problem remains strongly NP-hard even when the due-dates are common and all jobs have the same processing time. 相似文献
56.
Binoy Ravindran Peng Li Tamir Hegazy 《Journal of Parallel and Distributed Computing》2003,63(12):1219-1242
We present two proactive resource allocation algorithms, RBA*-FT and OBA-FT, for fault-tolerant asynchronous real-time distributed systems. The algorithms consider an application model where task timeliness is specified by Jensen's benefit functions and the anticipated application workload during future time intervals is described by adaptation functions. In addition, we assume that reliability functions of processors are available a priori. Given these models, our objective is to maximize aggregate task benefit and minimize aggregate missed deadline ratio in the presence of processor failures. Since determining the optimal solution is computationally intractable, the algorithms heuristically compute sub-optimal resource allocations, but in polynomial time. Experimental results reveal that RBA*-FT and OBA-FT outperform their non-fault-tolerant counterparts in the presence of processor failures. Furthermore, RBA*-FT performs better than OBA-FT, although OBA-FT incurs better worst-case and amortized computational costs. Finally, we observe that both algorithms robustly withstand errors in the estimation of anticipated failures. 相似文献
57.
半导体晶圆制造车间层控制的内容及方法 总被引:2,自引:0,他引:2
半导体晶圆制造企业是资本密集、技术密集型产业,晶圆制造厂也是公认生产最为复杂的工厂之一。产品更新换代快、市场竞争激烈等特点使得投资者对设备产能和设备利用率高度重视。这已不仅仅是技术问题,而是生产制造过程管理的问题。本文介绍了半导体晶圆制造车间层控制的内容及方法。 相似文献
58.
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. 相似文献
59.
60.
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 相似文献