全文获取类型
收费全文 | 6936篇 |
免费 | 1152篇 |
国内免费 | 1037篇 |
专业分类
电工技术 | 202篇 |
综合类 | 703篇 |
化学工业 | 35篇 |
金属工艺 | 3篇 |
机械仪表 | 148篇 |
建筑科学 | 21篇 |
矿业工程 | 33篇 |
能源动力 | 36篇 |
轻工业 | 9篇 |
水利工程 | 156篇 |
石油天然气 | 10篇 |
武器工业 | 27篇 |
无线电 | 2430篇 |
一般工业技术 | 243篇 |
冶金工业 | 33篇 |
原子能技术 | 2篇 |
自动化技术 | 5034篇 |
出版年
2024年 | 29篇 |
2023年 | 87篇 |
2022年 | 117篇 |
2021年 | 133篇 |
2020年 | 204篇 |
2019年 | 138篇 |
2018年 | 165篇 |
2017年 | 240篇 |
2016年 | 282篇 |
2015年 | 395篇 |
2014年 | 495篇 |
2013年 | 559篇 |
2012年 | 633篇 |
2011年 | 670篇 |
2010年 | 585篇 |
2009年 | 637篇 |
2008年 | 645篇 |
2007年 | 656篇 |
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篇 |
排序方式: 共有9125条查询结果,搜索用时 15 毫秒
141.
Synchronization of signal packets is required in networks in order to route the packets. Due to changes in the interarrival times of the packets the inputs to the routing circuits may exhibit oscillatory metastability. Oscillatory metastability can be eliminated in optical circuits by the addition of logic signal stretch. This can be done because the propagation time of optics can be precisely controlled. An algorithm for inserting logic signal stretch to eliminate oscillatory metastability is presented herein. 相似文献
142.
143.
HUANG Zhen-jian 《数字社区&智能家居》2008,(17)
利用网络仿真器NS2对路由协议进行仿真是一种既有效又经济的办法。本文介绍了NS2中单播动态路由协议的原理,并实现了任意两点间最快路由协议,仿真实验表明该路由协议是有效的。 相似文献
144.
《数字社区&智能家居》2008,(30)
新落成的江苏广电城将即将投入使用,江苏广电网站搬入大楼全新的IDC机房。与广播、电视并列为江苏广电总台三大宣传阵地的广电网站由于受困于中国南北方网络瓶颈的限制,经常造成网络视音频节目传播不畅,所以同时接入电信和网通成为解决问题的必要手段。此文首先对IDC双线路关键技术进行了概述,然后着重介绍了根据防火墙接口地址制定策略路由、实现双线路的方法。 相似文献
145.
WEI Lin 《数字社区&智能家居》2008,(30)
校园网络中实施VLAN技术可以提高网络管理效率、性能、带宽及灵活性,同时还能控制广播风暴,提高校园网安全性能。该文对VLAN技术在网络构建中的应用作了介绍。 相似文献
146.
The vehicle routing problem with deliveries and pickups is a challenging extension to the vehicle routing problem that lately
attracted growing attention in the literature. This paper investigates the relationship between two versions of this problem,
called “mixed” and “simultaneous”. In particular, we wish to know whether a solution algorithm designed for the simultaneous
case can solve the mixed case. To this end, we implement a metaheuristic based on reactive tabu search. The results suggest
that this approach can yield good results. 相似文献
147.
The simplicity of regular mesh topology Network on Chip (NoC) architecture leads to reductions in design time and manufacturing cost. A weakness of the regular shaped architecture is its inability to efficiently support cores of different sizes. A proposed way in literature to deal with this is to utilize the region concept, which helps to accommodate cores larger than the tile size in mesh topology NoC architectures. Region concept offers many new opportunities for NoC design, as well as provides new design issues and challenges. One of the most important among these is the design of an efficient deadlock free routing algorithm. Available adaptive routing algorithms developed for regular mesh topology cannot ensure freedom from deadlocks. In this paper, we list and discuss many new design issues which need to be handled for designing NoC systems incorporating cores larger than the tile size. We also present and compare two deadlock free routing algorithms for mesh topology NoC with regions. The idea of the first algorithm is borrowed from the area of fault tolerant networks, where a network topology is rendered irregular due to faults in routers or links, and is adapted for the new context. We compare this with an algorithm designed using a methodology for design of application specific routing algorithms for communication networks. The application specific routing algorithm tries to maximize adaptivity by using static and dynamic communication requirements of the application. Our study shows that the application specific routing algorithm not only provides much higher adaptivity, but also superior performance as compared to the other algorithm in all traffic cases. But this higher performance for the second algorithm comes at a higher area cost for implementing network routers. 相似文献
148.
We study the complexity of routing a set of messages with multiple destinations (multicast routing) on an n-node square mesh under the store-and-forward model. A standard argument proves that
time is required to route n messages, where each message is generated by a distinct node and at most c messages are to be delivered to any individual node. The obvious approach of simply replicating each message into the appropriate
number of unicast (single-destination) messages and routing these independently does not yield an optimal algorithm. We provide
both randomized and deterministic algorithms for multicast routing, which use constant-size buffers at each node. The randomized
algorithm attains optimal performance, while the deterministic algorithm is slower by a factor of O( log 2
n). We also describe an optimal deterministic algorithm that, however, requires large buffers of size O(c).
A preliminary version of this paper appeared in Proceedings of the 13th Annual ACM Symposium on Parallel Algorithms and Architectures,
Crete, Greece, 2001. This work was supported, in part, by MIUR under project ALGO-NEXT. 相似文献
149.
Jean-Charles Créput Abderrafiaâ Koukam 《Soft Computing - A Fusion of Foundations, Methodologies and Applications》2008,12(11):1125-1141
The paper presents an extension of the self- organizing map (SOM) by embedding it into an evolutionary algorithm to solve
the Vehicle Routing Problem (VRP). We call it the memetic SOM. The approach is based on the standard SOM algorithm used as
a main operator in a population based search. This operator is combined with other derived operators specifically dedicated
for greedy insertion moves, a fitness evaluation and a selection operator. The main operators have a similar structure based
on the closest point findings and local moves performed in the plane. They can be interpreted as performing parallels and
massive insertions, simulating the behavior of agents which interact continuously, having localized and limited abilities.
This self-organizing process is intended to allow adaptation to noisy data as well as to confer robustness according to demand
fluctuation. Selection is intended to guide the population based search toward useful solution compromises. We show that the
approach performs better, with respect to solution quality and/or computation time, than other neural network applications
to the VRP presented in the literature. As well, it substantially reduces the gap to classical Operations Research heuristics,
specifically on the large VRP instances with time duration constraint. 相似文献
150.
On basic properties of fault-tolerant multi-topology routing 总被引:1,自引:0,他引:1
Multi-topology routing has recently gained popularity as a simple yet efficient traffic engineering concept. Its basic purpose is to separate different classes of network traffic, which are then transported over disjoint logical topologies. Multi-topology routing is used as a basis for implementation of an IP fast reroute scheme called Multiple Routing Configurations (MRC).MRC has a range of attractive properties, but they do come at a cost. In order to guarantee recovery from any single link or node failure in the network, MRC has to maintain several logical topologies and thus an increased amount of routing information. The number of the logical topologies in MRC need not be large; even simple heuristic algorithms often yield good results in practice. However, why this is the case is not fully understood yet.In this paper, we introduce a theoretical framework for fault-tolerant multi-topology routing (FT-MTR). MRC is a practical implementation of FT-MTR in connectionless IP networks. We use FT-MTR to study how the internal topological structure of the communication network relates to two important problems. The first problem is minimizing the number of logical topologies and thus the routing state in FT-MTR. We show how to use the sets of nodes that separate the topology graph to devise an advanced heuristic for “intelligent” construction of the logical topologies. Finding the separating sets in a topology graph is computationally demanding; we present an algorithm that performs well in tested real network topologies. We evaluate the separation-set based heuristic for the logical topology construction and show that it outperforms the known MRC heuristics.The second problem is the FT-MTR load distribution after a failure. We use the separating sets to devise a novel algorithm for failure load distribution. This algorithm does not require knowledge of the traffic demand matrix, still, our tests indicate that it performs as good as, or better than, known MRC load-distribution algorithms that do require the demand matrix as input. 相似文献