全文获取类型
收费全文 | 9801篇 |
免费 | 1287篇 |
国内免费 | 1101篇 |
专业分类
电工技术 | 220篇 |
综合类 | 853篇 |
化学工业 | 623篇 |
金属工艺 | 130篇 |
机械仪表 | 260篇 |
建筑科学 | 217篇 |
矿业工程 | 99篇 |
能源动力 | 124篇 |
轻工业 | 320篇 |
水利工程 | 180篇 |
石油天然气 | 156篇 |
武器工业 | 42篇 |
无线电 | 2595篇 |
一般工业技术 | 611篇 |
冶金工业 | 79篇 |
原子能技术 | 48篇 |
自动化技术 | 5632篇 |
出版年
2024年 | 26篇 |
2023年 | 119篇 |
2022年 | 156篇 |
2021年 | 202篇 |
2020年 | 299篇 |
2019年 | 203篇 |
2018年 | 236篇 |
2017年 | 306篇 |
2016年 | 360篇 |
2015年 | 509篇 |
2014年 | 681篇 |
2013年 | 746篇 |
2012年 | 832篇 |
2011年 | 879篇 |
2010年 | 734篇 |
2009年 | 790篇 |
2008年 | 786篇 |
2007年 | 807篇 |
2006年 | 641篇 |
2005年 | 589篇 |
2004年 | 485篇 |
2003年 | 407篇 |
2002年 | 295篇 |
2001年 | 252篇 |
2000年 | 184篇 |
1999年 | 130篇 |
1998年 | 108篇 |
1997年 | 78篇 |
1996年 | 70篇 |
1995年 | 64篇 |
1994年 | 44篇 |
1993年 | 37篇 |
1992年 | 31篇 |
1991年 | 20篇 |
1990年 | 13篇 |
1989年 | 9篇 |
1988年 | 8篇 |
1987年 | 9篇 |
1986年 | 10篇 |
1985年 | 4篇 |
1984年 | 9篇 |
1983年 | 10篇 |
1982年 | 2篇 |
1981年 | 3篇 |
1980年 | 5篇 |
1978年 | 1篇 |
排序方式: 共有10000条查询结果,搜索用时 15 毫秒
41.
42.
This survey concerns the role of data structures for compactly storing and representing various types of information in a localized and distributed fashion. Traditional approaches to data representation are based on global data structures, which require access to the entire structure even if the sought information involves only a small and local set of entities. In contrast, localized data representation schemes are based on breaking the information into small local pieces, or labels , selected in a way that allows one to infer information regarding a small set of entities directly from their labels, without using any additional (global) information. The survey concentrates mainly on combinatorial and algorithmic techniques, such as adjacency and distance labeling schemes and interval schemes for routing, and covers complexity results on various applications, focusing on compact localized schemes for message routing in communication networks.Received: August 2001, Accepted: May 2002, Supported in part by a grant from the Israel Science Foundation. 相似文献
43.
H. Capart T. I. Eldho S. Y. Huang D. L. Young Y. Zech 《Canadian Metallurgical Quarterly》2003,129(5):385-393
A method is proposed for the treatment of irregular bathymetry in one-dimensional finite volume computations of open-channel flow. The strategy adopted is based on a reformulation of the Saint-Venant equations. In contrast with the usual treatment of topography effects as source terms, the method accounts for slope and nonprismaticity by modifying the momentum flux. This makes it possible to precisely balance the hydrostatic pressure contributions associated with variations in valley geometry. The characteristic method is applied to the revised equations, yielding topographic corrections to the numerical fluxes of an upwind scheme. Further adaptations endow the scheme with an ability to capture transcritical sections and wetting fronts in channels of abrupt topography. To test the approach, the scheme is first applied to idealized benchmark problems. The method is then used to route a severe flood through a complex river system: the Tanshui in Northern Taiwan. Computational results compare favorably with gauge records. Discrepancies in water stage represent no more than a fraction of the magnitude of typical bathymetry variations. 相似文献
44.
Xiangqing Tian Xiaoqiong Qi Qiongfang Ma Xiaoping Zhang 《Photonic Network Communications》2006,11(3):271-276
A new design scheme for a distributed algorithm for routing and wavelength assignment (RWA) is developed in this paper, and
the communication rules between the nodes to exchange signaling packets are discussed. The Adaptive-Alternate-Routing-Least-Load
(AARLL) algorithm is implemented in the distributed scheme for the first time. Under dynamic traffic circumstances, the influence
of the race condition, which does not exist in centralized scheme, on the network performance is analyzed and the analyzed
results show that the race condition has a major impact on network performance only under light traffic load, while under
medium and heavy traffic load the impact is very small. To analyze the performance loss caused by adopting the distributed
algorithm for RWA, the capacity loss factor (CLF) is introduced and the calculated results show that CLF does not exceed 6%
under medium traffic load. 相似文献
45.
46.
本文介绍一种基于TCP/1P协议的新型水力物理模型试验测控系统,该系统将目前最先进、最流行的工业以太网技术应用到物理模型试验研究的测控系统中,实现多点水位、流速和流量等水力学重要参数的实时采集、处理、储存、显示及打印,并具有在线查询及数据分析功能。 相似文献
47.
Summary We propose hot-potato (or, deflection) packet routing algorithms on the two-dimensional mesh. The algorithms are strongly greedy in the sense that they attempt to send packets in good directions whenever possible. Furthermore, the routing operations are simple and independent of the time that has elapsed. The first algorithm gives the best evacuation time known for delivering all the packets to their destinations. A batch ofk packets with maximal source-to-destination distanced
max is delivered in 2(k-1)+d
max. The second algorithm improves this bound tok+d
max when all packets are destined to the same node. This also implies a new bound for the multitarget case, which is the first to take into account the number of in-edges of a node. The third algorithm is designed for routing permutations with source-to-destination distance at most three, in which case the algorithm terminates in at most seven steps. We also show a lower bound of five steps for this problem.
Ishai Ben-Aroya received the B.A. and M.Sc. in computer science from the Technion (Israel Institute of Technology). He is currently working with Microsoft Israel R&D group. His main interests include Routing Algorithms, Cryptography and Computer Security.
Tamar Eilam received the B.A. degree in Computer Science from the Technion IIL in 1995, and is currently studying towards her M.A. degree.
Assaf Schuster received his B.A., M.A. and Ph.D. degrees in Computer Science from the Hebrew University of Jerusalem (the last one in 1991). He is currently a lecturer at the Technion IIL. His main interests include Networks and Routing Algorithms, Parallel and Distributed Computation, Optical Computation and Communication, Dynamically Reconfiguring Networks, and Greedy Hot Potato Routing.This work was supported in part by the French-Israeli grant for cooperation in Computer Science, and by a grant from the Israeli Ministry of Science. An extended abstract appeared in proc. 2nd European Symposium on Algorithms, September 1994 相似文献
48.
车辆实时监管正面临着不断增长的大规模车辆监测数据的实时处理需求,需要采用分布式的并行计算架构来提升大规模车辆监测数据处理的性能,支撑多样化的车辆监测数据处理任务,应对支撑环境的伸缩性需求。在这种架构下,对系统中不同计算节点间的车辆监测数据处理任务的调度提出了更高的要求。针对这一要求,并结合流式到达及历史积累的车辆监测数据的持续化处理需求以及大规模车辆监测数据实时处理中内存敏感的特征,提出一种基于路由表的并行任务调度算法。该算法基于车辆监测数据时空属性以及各计算节点的内存信息建立路由表,并以路由表的形式来进行任务的并行划分和分配调度,从而使得各计算节点达到负载均衡的状态。实验表明该算法能够使计算节点间的负载差异缩小到12%以内。此外,该算法在某市车辆监管实时系统中的实际应用也证明了其有效性。 相似文献
49.
数据中心基础数据积累通常使用三种手段:1)ETL技术;2)数据联邦技术;3)中间件技术.但三种技术侧重各有不同,不能同时满足数据集成的持久性与可用性.结合技术优势提出数据虚拟整合,为解决数据虚拟异构数据模型间的数据转换问题,通过对数据虚拟的分析,提出了一种基于元数据驱动的数据虚拟系统体系结构.构建了用于描述和存储映射策略的支撑元模型,并建立了相应数据路由策略.提出了对等主键思想,降低了处理阻抗. 相似文献
50.