全文获取类型
收费全文 | 15601篇 |
免费 | 2378篇 |
国内免费 | 2128篇 |
专业分类
电工技术 | 1313篇 |
技术理论 | 2篇 |
综合类 | 1627篇 |
化学工业 | 350篇 |
金属工艺 | 150篇 |
机械仪表 | 1220篇 |
建筑科学 | 257篇 |
矿业工程 | 132篇 |
能源动力 | 184篇 |
轻工业 | 90篇 |
水利工程 | 261篇 |
石油天然气 | 39篇 |
武器工业 | 171篇 |
无线电 | 3108篇 |
一般工业技术 | 1415篇 |
冶金工业 | 197篇 |
原子能技术 | 4篇 |
自动化技术 | 9587篇 |
出版年
2024年 | 86篇 |
2023年 | 267篇 |
2022年 | 406篇 |
2021年 | 464篇 |
2020年 | 590篇 |
2019年 | 533篇 |
2018年 | 503篇 |
2017年 | 615篇 |
2016年 | 702篇 |
2015年 | 805篇 |
2014年 | 1158篇 |
2013年 | 1576篇 |
2012年 | 1297篇 |
2011年 | 1313篇 |
2010年 | 1021篇 |
2009年 | 1145篇 |
2008年 | 1159篇 |
2007年 | 1189篇 |
2006年 | 978篇 |
2005年 | 934篇 |
2004年 | 746篇 |
2003年 | 583篇 |
2002年 | 439篇 |
2001年 | 365篇 |
2000年 | 261篇 |
1999年 | 220篇 |
1998年 | 148篇 |
1997年 | 121篇 |
1996年 | 90篇 |
1995年 | 76篇 |
1994年 | 67篇 |
1993年 | 44篇 |
1992年 | 49篇 |
1991年 | 33篇 |
1990年 | 18篇 |
1989年 | 17篇 |
1988年 | 7篇 |
1987年 | 3篇 |
1986年 | 11篇 |
1985年 | 12篇 |
1984年 | 15篇 |
1983年 | 7篇 |
1982年 | 3篇 |
1981年 | 3篇 |
1980年 | 4篇 |
1979年 | 3篇 |
1976年 | 3篇 |
1975年 | 3篇 |
1961年 | 2篇 |
1960年 | 2篇 |
排序方式: 共有10000条查询结果,搜索用时 31 毫秒
31.
No authorship indicated 《Canadian Metallurgical Quarterly》2003,58(11):931
Provides the biography of David W. Johnson and announces that he has won the Award for Distinguished Contributions of Applications of Psychology to Education and Training for programmatic research, comprehensive research reviews, and revision of theory over four decades of persistence that have provided the knowledge foundation for cooperative learning, constructive controversy, conflict resolution, and peer mediation training. A selected bibliography is also provided. (PsycINFO Database Record (c) 2010 APA, all rights reserved) 相似文献
32.
In this work, we study dynamic provisioning of multicast sessions in a wavelength-routed sparse splitting capable WDM network
with an arbitrary mesh topology where the network consists of nodes with full, partial, or no wavelength conversion capabilities
and a node can be a tap-and-continue (TaC) node or a splitting and delivery (SaD) node. The objectives are to minimize the
network resources in terms of wavelength-links used by each session and to reduce the multicast session blocking probability.
The problem is to route the multicast session from each source to the members of every multicast session, and to assign an
appropriate wavelength to each link used by the session. We propose an efficient online algorithm for dynamic multicast session
provisioning. To evaluate the proposed algorithm, we apply the integer linear programming (ILP) optimization tool on a per
multicast session basis to solve off-line the optimal routing and wavelength assignment given a multicast session and the
current network topology as well as its residual network resource information. We formulate the per session multicast routing
and wavelength assignment problem as an ILP. With this ILP formulation, the multicast session blocking probability or success
probability can then be estimated based on solving a series of ILPs off-line. We have evaluated the effectiveness of the proposed
online algorithm via simulation in terms of session blocking probability and network resources used by a session. Simulation
results indicate that our proposed computationally efficient online algorithm performs well even when a fraction of the nodes
are SaD nodes. 相似文献
33.
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. 相似文献
34.
可靠组播中的差错检测与恢复技术 总被引:1,自引:0,他引:1
在可靠组播的实现中要解决的关键问题之一是如何进行快速有效的差错检测和恢复,主要有重传和纠错两类机制。文章介绍了这两类机制的研究现状,从模型特点、网络负荷、适用悄况等不同角度进行分析,讨沦了本地重传及其范围策略。 相似文献
35.
36.
Not all Group Support Systems are identical, as is demonstrated by their software implementations. We discuss two existing implementations of group support tools and the process models underlying them. We demonstrate that fundamental to both processes is the merging or integration of individual data. Based on this and other empirical research, the Shared Context Model (SCM) of cooperative work is adopted and we show that it supports existing processes and others. We expect that groups will find merging their work easier with the SCM. This model is presented and embedded in the architecture and implementation of four group tools. Because these tools are destined to be used by dispersed groups, synchronously or asynchronously, an object-based communication and control mechanism is incorporated. Finally, as graphics and multi-tasking have been shown to be increasingly important, the tools are implemented in Microsoft Windows for personal computers attached to local area networks. 相似文献
37.
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. 相似文献
38.
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. 相似文献
39.
Antonio Camurri Paolo Franchi Francesca Gandolfo Renato Zaccaria 《Journal of Intelligent and Robotic Systems》1993,8(1):99-123
In this paper, we propose a class of algorithms for the sub-optimal solution of a particular class of problems of process scheduling, particularly focusing on a case study in the area of flexible manufacturing systems (FMSs). The general class of problems we face in our approach is characterized as follows: there is a set of concurrent processes, each formed by a number of temporally related tasks (segments). Tasks are executable by alternate resource sets, different both in performance and costs. Processes and tasks are characterized by release times, due dates, and deadlines. Time constraints are also present in the availability of each resource in resource sets. It has been proven that such a problem does not admit an algorithm for an optimal solution in polynomial time. Our proposed algorithm finds a sub-optimal schedule according to a set of optimization criteria, based on task and process times (earliness, tardiness), and/or time independent costs of resources. Our approach to process scheduling is based on Timed Coloured Petri Nets. We describe the structure of the coordination and scheduling algorithms, concentrating on (i) the general-purpose component, and (ii) the application-dependent component. In particular, the paper focuses on the following issues: (i) theautomatic synthesis of Petri net models of the coordination subsystem, starting from the problem knowledge base; (ii) the dynamic behavior of the coordination subsystem, whose kernel is a High Level Petri net executor, a coordination process based on an original, general purpose algorithm; (iii) the structure of the real-time scheduling subsystem, based on particular heuristic sub-optimal multi-criteria algorithms. Furthermore, the paper defines the interaction mechanisms between the coordination and scheduling subsystems. Our approach clearly distinguishes the mechanism of the net execution from the decision support system. Two conceptually distinct levels, which correspond to two different, interacting implementation modules in the prototype CASE tool, have been defined: theexecutor and thescheduler levels. One of the outstanding differences between these levels is that the executor is conceived as a fast, efficient coordination process, without special-purpose problem-solving capabilities in case of conflicts. The scheduler, on the other hand, is the adaptive, distributed component, whose behavior may heavily depend on the problem class. If the scheduler fails, the executor is, in any case, able to proceed with a general-purpose conflict resolution strategy. Experimental results on the real-time performance of the kernel of the implemented system are finally shown in the paper. The approach described in this paper is at the basis of a joint project with industrial partners for the development of a CASE tool for the simulation of blast furnaces. 相似文献
40.
ATM局域网仿真体系结构的研究 总被引:4,自引:0,他引:4
本文在简要叙述了基于ATM技术进行局域网仿真的原理后,对局域网仿真体系结构作了一些探讨。考虑的重点是无连接服务和群播功能的实现 相似文献