全文获取类型
收费全文 | 11820篇 |
免费 | 1550篇 |
国内免费 | 1509篇 |
专业分类
电工技术 | 1113篇 |
综合类 | 942篇 |
化学工业 | 293篇 |
金属工艺 | 126篇 |
机械仪表 | 1062篇 |
建筑科学 | 440篇 |
矿业工程 | 174篇 |
能源动力 | 182篇 |
轻工业 | 67篇 |
水利工程 | 301篇 |
石油天然气 | 248篇 |
武器工业 | 77篇 |
无线电 | 1465篇 |
一般工业技术 | 1254篇 |
冶金工业 | 209篇 |
原子能技术 | 10篇 |
自动化技术 | 6916篇 |
出版年
2024年 | 82篇 |
2023年 | 211篇 |
2022年 | 343篇 |
2021年 | 367篇 |
2020年 | 472篇 |
2019年 | 389篇 |
2018年 | 392篇 |
2017年 | 473篇 |
2016年 | 540篇 |
2015年 | 605篇 |
2014年 | 846篇 |
2013年 | 1278篇 |
2012年 | 951篇 |
2011年 | 916篇 |
2010年 | 717篇 |
2009年 | 836篇 |
2008年 | 849篇 |
2007年 | 841篇 |
2006年 | 724篇 |
2005年 | 633篇 |
2004年 | 498篇 |
2003年 | 397篇 |
2002年 | 322篇 |
2001年 | 233篇 |
2000年 | 179篇 |
1999年 | 169篇 |
1998年 | 120篇 |
1997年 | 91篇 |
1996年 | 69篇 |
1995年 | 76篇 |
1994年 | 54篇 |
1993年 | 37篇 |
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篇 |
1958年 | 1篇 |
1957年 | 1篇 |
排序方式: 共有10000条查询结果,搜索用时 15 毫秒
21.
目前采用的视频流调度算法,没有充分利用补丁流满足服务率高而占用系统资源少的优势,系统效率较低.为了提高效率,提出了一种基于MFQ的补丁优先算法,并给出了该算法的系统流程。通过对实验结果的比较,该算法在用户请求撤销率、节目调度不公平性和用户等待时间方面有明显的优越性. 相似文献
22.
In this paper, we describe RanGen, a random network generator for generating activity-on-the-node networks and accompanying data for different classes of project scheduling problems. The objective is to construct random networks which satisfy preset values of the parameters used to control the hardness of a problem instance. Both parameters which are related to the network topology and resource-related parameters are implemented. The network generator meets the shortcomings of former network generators since it employs a wide range of different parameters which have been shown to serve as possible predictors of the hardness of different project scheduling problems. Some of them have been implemented in former network generators while others have not. 相似文献
23.
24.
25.
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. 相似文献
26.
Modeling video sources for real-time scheduling 总被引:1,自引:0,他引:1
What is the impact of the autocorrelation of variable-bit-rate (VBR) sources on real-time scheduling algorithms? Our results show that the impact of long term, or interframe, autocorrelation is negligible, while the impact of short term, or intraframe, autocorrelation can be significant. Such results are essentially independent of the video coding scheme employed. To derive these results, video sequences are modeled as a collection of stationary subsequences called scenes. Within a scene, a statistical model is derived for both the sequence of frames and of slices. The model captures the distribution and the autocorrelation function of real-time video data. In previous work, the pseudoperiodicity of the slice level auto-correlation function made it difficult to develop a simple yet accurate model. We present a generalization of previous methods that can easily capture this pseudoperiodicity and is suited for modeling a greater variety of autocorrelation functions. By simply tuning a few parameters, the model reproduces the statistic behavior of sources with different types and levels of correlation on both the frame and the slice level. 相似文献
27.
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. 相似文献
28.
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. 相似文献
29.
介绍沙角发电C厂2号发电机转子接地检测装置的基本原理和在装置发出报警信号后的分析和判断过程。对该装置出现故障后ALSTOM公司提出的临时检测方案作了分析,指出了该方案的不足之处,提出并实施改进后的临时检测方案。 相似文献
30.
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. 相似文献