全文获取类型
收费全文 | 9269篇 |
免费 | 1558篇 |
国内免费 | 1373篇 |
专业分类
电工技术 | 384篇 |
技术理论 | 1篇 |
综合类 | 981篇 |
化学工业 | 74篇 |
金属工艺 | 8篇 |
机械仪表 | 236篇 |
建筑科学 | 44篇 |
矿业工程 | 44篇 |
能源动力 | 51篇 |
轻工业 | 23篇 |
水利工程 | 172篇 |
石油天然气 | 38篇 |
武器工业 | 57篇 |
无线电 | 3659篇 |
一般工业技术 | 348篇 |
冶金工业 | 39篇 |
原子能技术 | 14篇 |
自动化技术 | 6027篇 |
出版年
2024年 | 31篇 |
2023年 | 111篇 |
2022年 | 158篇 |
2021年 | 188篇 |
2020年 | 269篇 |
2019年 | 209篇 |
2018年 | 230篇 |
2017年 | 315篇 |
2016年 | 383篇 |
2015年 | 508篇 |
2014年 | 651篇 |
2013年 | 749篇 |
2012年 | 869篇 |
2011年 | 907篇 |
2010年 | 765篇 |
2009年 | 825篇 |
2008年 | 830篇 |
2007年 | 862篇 |
2006年 | 665篇 |
2005年 | 598篇 |
2004年 | 493篇 |
2003年 | 390篇 |
2002年 | 283篇 |
2001年 | 258篇 |
2000年 | 158篇 |
1999年 | 103篇 |
1998年 | 76篇 |
1997年 | 62篇 |
1996年 | 48篇 |
1995年 | 50篇 |
1994年 | 33篇 |
1993年 | 25篇 |
1992年 | 27篇 |
1991年 | 18篇 |
1990年 | 9篇 |
1989年 | 8篇 |
1988年 | 3篇 |
1987年 | 10篇 |
1986年 | 8篇 |
1985年 | 4篇 |
1984年 | 4篇 |
1983年 | 2篇 |
1980年 | 3篇 |
1977年 | 1篇 |
1959年 | 1篇 |
排序方式: 共有10000条查询结果,搜索用时 31 毫秒
1.
2.
The Vehicle Routing Problem with Simultaneous Pickup and Delivery (VRPSPD) is an extension to the classical Vehicle Routing Problem (VRP), where customers may both receive and send goods simultaneously. The Vehicle Routing Problem with Mixed Pickup and Delivery (VRPMPD) differs from the VRPSPD in that the customers may have either pickup or delivery demand. However, the solution approaches proposed for the VRPSPD can be directly applied to the VRPMPD. In this study, an adaptive local search solution approach is developed for both the VRPSPD and the VRPMPD, which hybridizes a Simulated Annealing inspired algorithm with Variable Neighborhood Descent. The algorithm uses an adaptive threshold function that makes the algorithm self-tuning. The proposed approach is tested on well-known VRPSPD and VRPMPD benchmark instances derived from the literature. The computational results indicate that the proposed algorithm is effective in solving the problems in reasonable computation time. 相似文献
3.
In this article, two novel kinds of focusing elements as reflectors are analyzed and compared. One is the grooved Fresnel zone plate reflector with continuous phase‐correcting. The other called subzone paraboloid reflector, has the profile that consists of a series of paraboloids. Their diffraction efficiencies and bandwidths are described. The two elements still preserve the advantages of Fresnel zone plates, namely, low profile, high efficiency, and simple fabrication. Two dual‐reflector antennas using the proposed focusing elements as the main reflectors are simulated and the results show that these antennas have good radiation performances. © 2014 Wiley Periodicals, Inc. Int J RF and Microwave CAE 25:101–108, 2015. 相似文献
4.
文章介绍了3种宽带数字储频的基本结构,分析了宽带数字储频的一个重要指标——量化噪声,根据输出信号频谱的杂散电平比较了三种结构的优劣。 相似文献
5.
陈国龙 《计算机辅助设计与图形学学报》1994,6(2):136-142
本文介绍了一种在微机上实现的印制板自动布线方法──多级线探索法及其编程方法。这种方法是基于完备布线算法的概念,通过分析李氏算法和传统线探索法的不足之处而得到的。虽然它也是一种线探索法,但有较传统线探索法更强的探索能力,不需要结合李氏算法而能单独完成布线任务,是一种较理想的算法,通过实验获得了较为满意的效果。 相似文献
6.
Bandwidth Adaptation Algorithms for Adaptive Multimedia Services in Mobile Cellular Networks 总被引:3,自引:0,他引:3
The fluctuation of available link bandwidth in mobilecellular networks motivates the study of adaptive multimediaservices, where the bandwidth of an ongoing multimedia call can bedynamically adjusted. We analyze the diverse objectives of theadaptive multimedia framework and propose two bandwidth adaptationalgorithms (BAAs) that can satisfy these objectives. The firstalgorithm, BAA-RA, takes into consideration revenue and``anti-adaptation' where anti-adaptation means that a user feelsuncomfortable whenever the bandwidth of the user's call ischanged. This algorithm achieves near-optimal total revenue withmuch less complexity compared to an optimal BAA. The secondalgorithm, BAA-RF, considers revenue and fairness, and aims at themaximum revenue generation while satisfying the fairnessconstraint defined herein. Comprehensive simulation experimentsshow that the difference of the total revenue of BAA-RA and thatof an optimal BAA is negligible. Also, numerical results revealthat there is a conflicting relationship between anti-adaptationand fairness. 相似文献
7.
一种支持QoS的拓扑自适应动态组播路由算法 总被引:3,自引:0,他引:3
YAM、QoSMIC、DSDMR等一类支持QoS的动态组播路由算法允许组播成员动态地加入和离开,同时为接收方提供多个可选择的组播接入路径,以满足不同应用的QoS需求。但这些算法普遍存在控制信令开销大和结点加入时延长,可扩展性不好等问题。本文在分析这些算法的基础上,提出改进的支持QoS的动态组播路由算法,即拓扑自适应动态组播路由(Topology Adaptive Dynamic Multicast Routing,TADMR)算法。该算法避免了以往算法中大部分盲目的路径搜索,并使结点加入时延不再受限于固定的等待时钟,而与网络拓扑相自适应。性能分析和仿真结果表明,该算法具有较低的控制信令开销和结点加入时延,适用于各种网络规模和群组规模,具有良好的可扩展性。 相似文献
8.
自动交换光网络的概念一经提出即受到业界的广泛关注,运营商尤其对其寄予了厚望。本文首先概要地介绍了ASON的优点,然后重点论述了ASON的信令与路由功能,包括对它们的要求以及标准化工作。 相似文献
9.
CAS-BUS: A Test Access Mechanism and a Toolbox Environment for Core-Based System Chip Testing 总被引:2,自引:0,他引:2
As System on a Chip (SoC) testing faces new challenges, some new test architectures must be developed. This paper describes a Test Access Mechanism (TAM) named CAS-BUS that solves some of the new problems the test industry has to deal with. This TAM is scalable, flexible and dynamically reconfigurable. The CAS-BUS architecture is compatible with the IEEE P1500 standard proposal in its current state of development, and is controlled by Boundary Scan features.This basic CAS-BUS architecture has been extended with two independent variants. The first extension has been designed in order to manage SoC made up with both wrapped cores and non wrapped cores with Boundray Scan features. The second deals with a test pin expansion method in order to solve the I/O bandwidth problem. The proposed solution is based on a new compression/decompression mechanism which provides significant results in case of non correlated test patterns processing. This solution avoids TAM performance degradation.These test architectures are based on the CAS-BUS TAM and allow trade-offs to optimize both test time and area overhead. A tool-box environment is provided, in order to automatically generate the needed component to build the chosen SoC test architecture. 相似文献
10.
We consider the switchbox routing problem of two-terminal nets in the case when all thek nets lie on two adjacent sides of the rectangle. Our routing model is the standard two-layer model. We develop an optimal algorithm that routes all the nets whenever a routing exists. The routing obtained uses the fewest possible number of vias. A more general version of this problem (adjacent staircase) is also optimally solved.This research was supported in part by NSA Contract No. MDA-904-85H-0015, NSF Grant No. DCR-86-00378, and by NSF Engineering Research Centers Program NSFD CDR 88003012. 相似文献