全文获取类型
收费全文 | 6880篇 |
免费 | 1182篇 |
国内免费 | 1038篇 |
专业分类
电工技术 | 196篇 |
综合类 | 700篇 |
化学工业 | 37篇 |
金属工艺 | 4篇 |
机械仪表 | 148篇 |
建筑科学 | 20篇 |
矿业工程 | 32篇 |
能源动力 | 36篇 |
轻工业 | 9篇 |
水利工程 | 156篇 |
石油天然气 | 36篇 |
武器工业 | 27篇 |
无线电 | 2398篇 |
一般工业技术 | 247篇 |
冶金工业 | 27篇 |
原子能技术 | 2篇 |
自动化技术 | 5025篇 |
出版年
2024年 | 19篇 |
2023年 | 88篇 |
2022年 | 112篇 |
2021年 | 130篇 |
2020年 | 201篇 |
2019年 | 134篇 |
2018年 | 162篇 |
2017年 | 233篇 |
2016年 | 284篇 |
2015年 | 397篇 |
2014年 | 490篇 |
2013年 | 560篇 |
2012年 | 639篇 |
2011年 | 674篇 |
2010年 | 590篇 |
2009年 | 633篇 |
2008年 | 644篇 |
2007年 | 656篇 |
2006年 | 509篇 |
2005年 | 446篇 |
2004年 | 366篇 |
2003年 | 282篇 |
2002年 | 208篇 |
2001年 | 194篇 |
2000年 | 114篇 |
1999年 | 71篇 |
1998年 | 58篇 |
1997年 | 40篇 |
1996年 | 33篇 |
1995年 | 26篇 |
1994年 | 24篇 |
1993年 | 20篇 |
1992年 | 16篇 |
1991年 | 13篇 |
1990年 | 4篇 |
1989年 | 3篇 |
1988年 | 1篇 |
1987年 | 7篇 |
1986年 | 7篇 |
1985年 | 3篇 |
1984年 | 4篇 |
1983年 | 2篇 |
1980年 | 3篇 |
排序方式: 共有9100条查询结果,搜索用时 218 毫秒
31.
In this paper we propose a new protocol called time-space label switching protocol (TSL-SP) in optical burst switching (OBS), and define the terms time-space label (TSL) and time-space routing (TSR). An important concept of response time is introduced in the time label mechanism. The TSL-SP is a new technology that can quickly and efficiently forward data with a label on the optical networks. A two-dimension label switched path (TD-LSP) can be set up, that is maintained and deleted by the TSL-SP. For clearly illuminating the operation principles of the TSL-SP, we propose a new approach of orthogonal time-space coordinates in which the vertical coordinate is the space label and the horizontal coordinate is the time label. The proposed TD-LSP can dramatically reduce the routing failure probability and greatly improve the link network efficiency compared with other signaling protocols. Moreover, we define the time-space label control plane that can achieve the higher efficiency. When the TSL-SP is applied to networks, switching performance can be improved by two orders compared to the switching performance with the conventional OBS signaling protocols. The fundamental goal of TSL-SP is to band the signaling and routing functions together closely. Also, the TSL-SP can reduce the complexity of the network, support automatic service offering, and provide traffic engineering. 相似文献
32.
XU Li~ 《中国邮电高校学报(英文版)》2004,11(4)
MANET(Mobile Ad Hoc Network)is a collection of wireless mobile nodes forming a temporary communica-tion network without the aid of any established infrastructure or centralized administration.The lifetime of a MANETdepends on the battery resources of the mobile nodes.So energy consumption may one of important design criterions forMANET.With changing the idle model to sleep model in the grid environment,this paper proposes a new energy-awarerouting protocol.Performance simulation results show that the proposed strategy can dynamic balance the traffic load in-side the whole network,extend the lifetime of a MANET,and without decreasing the throughput ratio. 相似文献
33.
A routing framework for providing robustness to node failures in mobile ad hoc networks 总被引:2,自引:0,他引:2
Nodes in a mobile ad hoc network are often vulnerable to failures. The failures could be either due to fading effects, battery drainage, or as a result of compromised nodes that do not participate in network operations. Intermittent node failures can disrupt routing functionalities. As such, it is important to provide redundancy in terms of providing multiple node-disjoint paths from a source to a destination. In line with this objective, we first propose a modified version of the widely studied ad hoc on-demand distance vector routing protocol to facilitate the discovery of multiple node-disjoint paths from a source to a destination. We find that very few of such paths can be found. Furthermore, as distances between sources and destinations increase, bottlenecks inevitably occur and thus, the possibility of finding multiple paths is considerably reduced. We conclude that it is necessary to place what we call reliable nodes (in terms of both being robust to failure and being secure) in the network to support efficient routing operations. We propose a deployment strategy that determines the positions and the trajectories of these reliable nodes such that we can achieve a framework for reliably routing information. We define a notion of a reliable path which is made up of multiple segments, each of which either entirely consists of reliable nodes, or contains a preset number of multiple paths between the end points of the segment. We show that the probability of establishing a reliable path between a random source and destination pair increases tremendously even with a small number of reliable nodes when we use our algorithm to appropriately position these reliable nodes. 相似文献
34.
北电网络提供的Contivity解决方案不仅可以使用户建立各种类型的VPN,而且还可以把这些VPN集成到未来的融合话音和数据的网络中。该方案已实现了安全路由选择;可通过多种技术支持鉴权功能,从而实现安全接入;允许用户使用其各自的安全性配置文件设置;其设计中没有“后门”,重点介绍了Contivity 2700网关的主要特征及其优势。 相似文献
35.
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. 相似文献
36.
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. 相似文献
37.
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. 相似文献
38.
39.
40.
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 相似文献