全文获取类型
收费全文 | 6857篇 |
免费 | 1164篇 |
国内免费 | 1036篇 |
专业分类
电工技术 | 201篇 |
综合类 | 701篇 |
化学工业 | 35篇 |
金属工艺 | 3篇 |
机械仪表 | 148篇 |
建筑科学 | 20篇 |
矿业工程 | 32篇 |
能源动力 | 36篇 |
轻工业 | 9篇 |
水利工程 | 155篇 |
石油天然气 | 10篇 |
武器工业 | 27篇 |
无线电 | 2408篇 |
一般工业技术 | 243篇 |
冶金工业 | 25篇 |
原子能技术 | 2篇 |
自动化技术 | 5002篇 |
出版年
2024年 | 23篇 |
2023年 | 86篇 |
2022年 | 112篇 |
2021年 | 127篇 |
2020年 | 198篇 |
2019年 | 133篇 |
2018年 | 160篇 |
2017年 | 230篇 |
2016年 | 278篇 |
2015年 | 393篇 |
2014年 | 487篇 |
2013年 | 555篇 |
2012年 | 633篇 |
2011年 | 670篇 |
2010年 | 582篇 |
2009年 | 635篇 |
2008年 | 645篇 |
2007年 | 655篇 |
2006年 | 508篇 |
2005年 | 442篇 |
2004年 | 368篇 |
2003年 | 287篇 |
2002年 | 208篇 |
2001年 | 194篇 |
2000年 | 117篇 |
1999年 | 70篇 |
1998年 | 58篇 |
1997年 | 39篇 |
1996年 | 32篇 |
1995年 | 26篇 |
1994年 | 23篇 |
1993年 | 20篇 |
1992年 | 16篇 |
1991年 | 13篇 |
1990年 | 4篇 |
1989年 | 3篇 |
1988年 | 1篇 |
1987年 | 7篇 |
1986年 | 7篇 |
1985年 | 3篇 |
1984年 | 4篇 |
1983年 | 2篇 |
1980年 | 3篇 |
排序方式: 共有9057条查询结果,搜索用时 125 毫秒
991.
MENG Jian CAO Zhi-xian CARLING Paul A. 《水动力学研究与进展(B辑)》2006,18(4):379-386
1. INTRODUCTION Over the years refined numerical modelling of river flows has been of increasing concern not only for flood management but for environmental and ecosystem considerations. Built upon the traditional St-Venant equations, one-dimensional mode… 相似文献
992.
The main purposes of this article are to lessen the influence of the fastchanging network topology, rapidly varying bandwidth information, and the increasing size of routing tables onquality of service routing. Based on DSDV (Destination-Sequenced Distance-Vector) routing protocol formaintaining up-to-date routing information, the related research has to update routing tables when networktopology changes; moreover, the routing tables must be updated periodically even though the networktopology has not changed. To put emphasis on QoS routing, they also have to exchange routing tables by thetime of bandwidth information changes. Furthermore, the size of routing tables increases with the numberof mobile nodes; therefore, the precious wireless bandwidth is wasted on transmitting the large-scalerouting tables. In this article, we propose an on-demand-based QoS routing protocol to mitigate theseproblems and to achieve the QoS requirement. The goal of this article is to discover an optimal routewith minimum time delay for transmitting real-time data from a source node hop by hop to adestination node under some predefined constraints. Our contributions are as follows: our researchprovides a rigorous bandwidth definition and bandwidth application, a broad view of bandwidth calculationand reservation, minimizing the size of control packets and the number of control packet transmissions,and an efficient QoS routing protocol. 相似文献
993.
In this paper we consider a multipath extension to the dynamic source routing (DSR) protocol proposed by Johnson and Maltz, an on-demand routing protocol for ad hoc wireless networks. This extension keeps two node-disjoint paths between the source and destination of a routing process without introducing extra overhead. Unlike other multipath extensions where node-disjoint paths are selected at the destination or at the reply phase, our approach generates two node-disjoint paths during the query phase of the route discovery process by restricting the way the query packet is flooded. Several optimization options are also considered. Simulation is conducted to determine the success rate of finding node-disjoint paths. 相似文献
994.
995.
XU Kai JI Hong YUE Guang-xin Telecommunication Engineering School Beijing University of Posts Telecommunications Beijing P.R. China 《中国邮电高校学报(英文版)》2004,11(Z1)
1 Introduction MobileIPv6requirestheMobileNode (MN)toregisterwiththeHomeAgent (HA)andtheCorre spondentNode (CN)whenitchangesitspointofattachmentintheInternet[1~ 3] .Therefore ,thiscauseMobileIPv6toincurlongdelayintheregis tration process,andaddsignalingtraffictothebackbonenetworkespeciallywhentheHAandCNarefarawayfromtheMN .Inordertominimizethisdelay ,andthesignalingoverhead presentinMobileIPv6,literatures[4~7] proposeHierarchicalMobileIPv6(HMIPv6)architectureandafasthan dover… 相似文献
996.
In an era of sub-micron technology, routing is becoming a dominant factor in area, timing, and power consumption. In this paper, we study the problem of selection and chaining of scan flip-flops with the objective of achieving minimum routing area overhead. Most of previous work on partial scan has put emphasis on selecting as few scan flip-flops as possible to break all cycles in S-graph. However, the flip-flops that break more cycles are often the ones that have more fanins and fanouts. The area adjacent to these nodes is often crowded in layout. Such selections will cause layout congestion and increase the number of tracks to chain the scan flip-flops. To take layout information into consideration, we propose a matching-based algorithm to solve the problem. First, an initial placement will be performed before scan flip-flops are selected. Then, iteratively, a matching-based algorithm taking the current layout into account is proposed to select and chain the scan flip-flops. Experimental results show that, on the average, our algorithm can reduce 8.1% area overhead as compared with the previously proposed methods that do not utilize the layout information in flip-flop selection. 相似文献
997.
Robust position-based routing for wireless ad hoc networks 总被引:1,自引:0,他引:1
We consider a wireless ad hoc network composed of a set of wireless nodes distributed in a two dimensional plane. Several routing protocols based on the positions of the mobile hosts have been proposed in the literature. A typical assumption in these protocols is that all wireless nodes have uniform transmission regions modeled by unit disk centered at each wireless node. However, all these protocols are likely to fail if the transmission ranges of the mobile hosts vary due to natural or man-made obstacles or weather conditions. These protocols may fail because either some connections that are used by routing protocols do not exist, which effectively results in disconnecting the network, or the use of some connections causes livelocks. In this paper, we describe a robust routing protocol that tolerates up to roughly 40% of variation in the transmission ranges of the mobile hosts. More precisely, our protocol guarantees message delivery in a connected ad hoc network whenever the ratio of the maximum transmission range to the minimum transmission range is at most . 相似文献
998.
999.
In IP-over-WDM networks, a logical IP network is routed on top of a physical optical fiber network. An important challenge here is to make the routing survivable. We call a routing survivable if the connectivity of the logical network is guaranteed in the case of a failure in the physical network. In this paper we describe FastSurv, a local search algorithm for survivable routing. The algorithm works in an iterative manner: after each iteration it learns more about the structure of the logical graph and in the next iteration it uses this information to improve its solution. The algorithm can take link capacity constraints into account and can be extended to deal with multiple simultaneous link failures and node failures. In a large series of tests we compare FastSurv with current state-of-the-art algorithms for this problem. We show that it can provide better solutions in much shorter time, and that it is more scalable with respect to the number of nodes, both in terms of solution quality and run time. 相似文献
1000.
精确计算n维Mesh网络和n维Torus网络的平均最短路径长度 总被引:5,自引:0,他引:5
n维mesh网张和n维torus网络是分布存储多机系统中最常用的拓扑结构。网络的平均最短路径长度是网张性能的重要指标。 相似文献