全文获取类型
收费全文 | 14730篇 |
免费 | 2069篇 |
国内免费 | 1891篇 |
专业分类
电工技术 | 1510篇 |
综合类 | 1377篇 |
化学工业 | 314篇 |
金属工艺 | 196篇 |
机械仪表 | 1364篇 |
建筑科学 | 155篇 |
矿业工程 | 196篇 |
能源动力 | 218篇 |
轻工业 | 68篇 |
水利工程 | 259篇 |
石油天然气 | 59篇 |
武器工业 | 109篇 |
无线电 | 2639篇 |
一般工业技术 | 1443篇 |
冶金工业 | 204篇 |
原子能技术 | 14篇 |
自动化技术 | 8565篇 |
出版年
2024年 | 98篇 |
2023年 | 246篇 |
2022年 | 390篇 |
2021年 | 417篇 |
2020年 | 545篇 |
2019年 | 456篇 |
2018年 | 451篇 |
2017年 | 587篇 |
2016年 | 650篇 |
2015年 | 755篇 |
2014年 | 1044篇 |
2013年 | 1511篇 |
2012年 | 1187篇 |
2011年 | 1181篇 |
2010年 | 952篇 |
2009年 | 1055篇 |
2008年 | 1096篇 |
2007年 | 1119篇 |
2006年 | 968篇 |
2005年 | 878篇 |
2004年 | 686篇 |
2003年 | 512篇 |
2002年 | 427篇 |
2001年 | 333篇 |
2000年 | 227篇 |
1999年 | 187篇 |
1998年 | 133篇 |
1997年 | 114篇 |
1996年 | 91篇 |
1995年 | 93篇 |
1994年 | 63篇 |
1993年 | 41篇 |
1992年 | 42篇 |
1991年 | 34篇 |
1990年 | 20篇 |
1989年 | 20篇 |
1988年 | 6篇 |
1987年 | 3篇 |
1986年 | 14篇 |
1985年 | 10篇 |
1984年 | 14篇 |
1983年 | 9篇 |
1982年 | 2篇 |
1981年 | 3篇 |
1980年 | 4篇 |
1979年 | 3篇 |
1978年 | 3篇 |
1976年 | 3篇 |
1975年 | 3篇 |
1971年 | 1篇 |
排序方式: 共有10000条查询结果,搜索用时 0 毫秒
11.
探讨了地震数据经小波包变换压缩后对后续处理过程的影响,以及经过某些处理后的数据会对小波包变换压缩产生什么影响等问题。将小波包变换压缩地震数据的结果与快速傅里叶变换压缩地震数据的结果进行了对比,其结果表明:应用小波包变换压缩地震数据,有效信号的损失非常小,压缩比大于快速傅里叶变换的压缩比。在大批量地震数据处理中可以使用小波包变换压缩地震数据。 相似文献
12.
本文针对调制阶数大于4的MPSK和MQAM调制,在重传中采用非均匀星座图和符号比特重新排序,提出了一种改进的ARQ方案。通过对AWGN信道下ARQ方案进行理论分析和数值仿真,表明基于非均匀星座的新方案在信道条件较差时能有效地提高重要比特的可靠性,若重传中结合符号比特重排和分组合并,则可使接收端解调合并后的比特可靠性趋于均匀且总体得到提高,从而有效地减少重传次数,提高系统的吞吐率。由于本文所提方案并不改变调制解调规则和数据分组长度,故容易实现和控制。 相似文献
13.
The even-flow harvest scheduling problem arises when the forestry agency has evolved into a rigid non-declining even-flow policy. In this paper, we investigate model formulation and solution strategies for the even-flow harvest scheduling problem. A multiple-objective linear programming problem is formulated for even-flow harvest scheduling problems with multiple-site classes and multiple periods. The aim of this problem is to simultaneously maximize a desired harvest-volume per hectare for each period of planning horizon and the total economic return. A block diagonal constraint structure, with many sets of network sub-problems and a set of coupling constraints, is identified in this linear programming problem. A longest path method for each of network sub-problems and a primal-dual steepest-edge algorithm for the entire problem are developed. The developed algorithm has been coded in Borland C++ and implemented on a personal computer. An illustrative example is used to display the detailed procedure for the developed algorithm and a real-world case study is used to show the trade-off between desired even-flow harvest volume policy and total economic return. Results show the potential benefits of this approach. 相似文献
14.
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. 相似文献
15.
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. 相似文献
16.
半导体晶圆制造车间层控制的内容及方法 总被引:2,自引:0,他引:2
半导体晶圆制造企业是资本密集、技术密集型产业,晶圆制造厂也是公认生产最为复杂的工厂之一。产品更新换代快、市场竞争激烈等特点使得投资者对设备产能和设备利用率高度重视。这已不仅仅是技术问题,而是生产制造过程管理的问题。本文介绍了半导体晶圆制造车间层控制的内容及方法。 相似文献
17.
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. 相似文献
18.
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 相似文献
19.
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. 相似文献
20.
In this paper, we study a manufacturing system consisting of two machines separated by two intermediate buffers, and capable of producing two different products. Each product requires a constant processing time on each of the machines. Each machine requires a constant non-negligible setup change time from one product to the other. The demand rate for each product is considered to be piecewise constant. Each machine undergoes failure and repair. The time-to-failure and time-to-repair are exponentially distributed random variables. The setup change and processing operations are resumable. We model our system as a continuous time, continuous flow process. An optimal control problem is formulated for the system to minimize the total expected discounted cost over an infinite horizon. To determine the optimal control policy structure, a discrete version of the problem is solved numerically using a dynamic programming formulation with a piecewise linear penalty function. A real-time control algorithm is then developed with the objective of maintaining low work-in-process inventory and keeping the production close to the demand. The algorithm uses a hierarchical control structure to generate the loading times for each product on each machine in real time and to respond to random disruptions in the system. The system is simulated using this algorithm to study its performance. The performance of the algorithm is also compared to alternative policies. 相似文献