全文获取类型
收费全文 | 12053篇 |
免费 | 1501篇 |
国内免费 | 1470篇 |
专业分类
电工技术 | 1039篇 |
综合类 | 1018篇 |
化学工业 | 258篇 |
金属工艺 | 128篇 |
机械仪表 | 1091篇 |
建筑科学 | 165篇 |
矿业工程 | 115篇 |
能源动力 | 170篇 |
轻工业 | 57篇 |
水利工程 | 236篇 |
石油天然气 | 94篇 |
武器工业 | 76篇 |
无线电 | 1424篇 |
一般工业技术 | 1356篇 |
冶金工业 | 781篇 |
原子能技术 | 8篇 |
自动化技术 | 7008篇 |
出版年
2024年 | 42篇 |
2023年 | 190篇 |
2022年 | 311篇 |
2021年 | 329篇 |
2020年 | 451篇 |
2019年 | 387篇 |
2018年 | 374篇 |
2017年 | 458篇 |
2016年 | 539篇 |
2015年 | 576篇 |
2014年 | 825篇 |
2013年 | 1297篇 |
2012年 | 928篇 |
2011年 | 910篇 |
2010年 | 711篇 |
2009年 | 832篇 |
2008年 | 865篇 |
2007年 | 880篇 |
2006年 | 753篇 |
2005年 | 678篇 |
2004年 | 541篇 |
2003年 | 409篇 |
2002年 | 348篇 |
2001年 | 274篇 |
2000年 | 173篇 |
1999年 | 163篇 |
1998年 | 114篇 |
1997年 | 100篇 |
1996年 | 65篇 |
1995年 | 67篇 |
1994年 | 53篇 |
1993年 | 38篇 |
1992年 | 40篇 |
1991年 | 28篇 |
1990年 | 17篇 |
1989年 | 16篇 |
1988年 | 9篇 |
1986年 | 14篇 |
1985年 | 11篇 |
1984年 | 15篇 |
1966年 | 15篇 |
1965年 | 9篇 |
1964年 | 13篇 |
1963年 | 12篇 |
1962年 | 8篇 |
1961年 | 9篇 |
1960年 | 8篇 |
1959年 | 12篇 |
1958年 | 9篇 |
1957年 | 12篇 |
排序方式: 共有10000条查询结果,搜索用时 875 毫秒
21.
Erik Jan Marinissen 《Journal of Electronic Testing》2002,18(4-5):435-454
Modular testing is an attractive approach to testing large system ICs, especially if they are built from pre-designed reusable embedded cores. This paper describes an automated modular test development approach. The basis of this approach is that a core or module test is dissected into a test protocol and a test pattern list. A test protocol describes in detail how to apply one test pattern to the core, while abstracting from the specific test pattern stimulus and response values. Subsequent automation tasks, such as the expansion from core-level tests to system-chip-level tests and test scheduling, all work on test protocols, thereby greatly reducing the amount of compute time and data involved. Finally, an SOC-level test is assembled from the expanded and scheduled test protocols and the (so far untouched) test patterns. This paper describes and formalizes the notion of test protocols and the algorithms for test protocol expansion and scheduling. A running example is featured throughout the paper. We also elaborate on the industrial usage of the concepts described. 相似文献
22.
23.
Pai H. Chou Jinfeng Liu Dexin Li Nader Bagherzadeh 《Design Automation for Embedded Systems》2002,7(3):205-232
Power-aware systems are those that must exploit a widerange of power/performance trade-offs in order to adapt to the power availabilityand application requirements. They require the integration of many novel powermanagement techniques, ranging from voltage scaling to subsystem shutdown.However, those techniques do not always compose synergistically with eachother; in fact, they can combine subtractively and often yield counterintuitive,and sometimes incorrect, results in the context of a complete system. Thiscan become a serious problem as more of these power aware systems are beingdeployed in mission critical applications.To address the problem of technique integration for power-aware embedded systems, we propose a new design tool framework called IMPACCT and the associated design methodology. The system modeling methodology includes application model for capturing timing/powerconstraints and mode dependencies at the system level. The tool performs power-awarescheduling and mode selection to ensure that all timing/power constraintsare satisfied and that all overhead is taken into account. IMPACCT then synthesizesthe implementation targeting a symmetric multiprocessor platform. Experimentalresults show that the increased dynamic range of power/performance settingsenabled a Mars rover to achieve significant acceleration while using lessenergy. More importantly, our tool correctly combines the state-of-the-arttechniques at the system level, thereby saving even experienced designersfrom many pitfalls of system-level power management. 相似文献
24.
目前采用的视频流调度算法,没有充分利用补丁流满足服务率高而占用系统资源少的优势,系统效率较低.为了提高效率,提出了一种基于MFQ的补丁优先算法,并给出了该算法的系统流程。通过对实验结果的比较,该算法在用户请求撤销率、节目调度不公平性和用户等待时间方面有明显的优越性. 相似文献
25.
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. 相似文献
26.
27.
A multi-agent architecture for dynamic scheduling of steel hot rolling 总被引:13,自引:0,他引:13
Peter I. Cowling Djamila Ouelhadj Sanja Petrovic 《Journal of Intelligent Manufacturing》2003,14(5):457-470
Steel production is a complex process and finding coherent and effective schedules for the wide variety of production steps, in a dynamic environment, is a challenging task. In this paper, we propose a multi-agent architecture for integrated dynamic scheduling of the hot strip mill (HSM) and the continuous caster. The scheduling systems of these processes have very different objectives and constraints, and operate in an environment where there is a substantial quantity of real-time information concerning production failures and customer requests. Each process is assigned to an agent which independently, seeks an optimal dynamic schedule at a local level taking into account local objectives, real-time information and information received from other agents. Each agent can react to real-time events in order to fix any problems that occur. We focus here, particularly, on the HSM agent which uses a tabu search heuristic to create good predictive–reactive schedules quickly. The other agents simulate the production of the coil orders and the real-time events, which occur during the scheduling process. When real-time events occur on the HSM, the HSM agent might decide whether to repair the current schedule or reschedule from scratch. To address this problem, a range of schedule repair and complete rescheduling strategies are investigated and their performance is assessed with respect to measures of utility, stability and robustness, using an experimental simulation framework. 相似文献
28.
29.
Gouvier W. Drew; Sytsma-Jordan Sara; Mayville Stephen 《Canadian Metallurgical Quarterly》2003,48(3):175
Objective: To evaluate the effects of disability type, job complexity, and public contact on hiring decisions. Design and Participants: An Americans With Disabilities Act (ADA; 1990) fact sheet and matched resumes with vocational and medical histories including chronic mental illness, developmental disability, closed head injury, and back injury were provided to 295 undergraduate business-related majors, who rated the applicants' suitability for 2 job positions and work shifts. Results: Findings indicated disparities in ratings of employability as a function of disability type. Paired comparisons yielded complementary findings, with effects of disability type and Disability Type × Job Complexity, but no effects of public contact. Conclusions: Stereotyping and discrimination in employment decisions apparently persist, more than 10 years after the ADA. (PsycINFO Database Record (c) 2010 APA, all rights reserved) 相似文献
30.
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. 相似文献