全文获取类型
收费全文 | 8245篇 |
免费 | 1406篇 |
国内免费 | 1480篇 |
专业分类
电工技术 | 458篇 |
综合类 | 1280篇 |
化学工业 | 115篇 |
金属工艺 | 92篇 |
机械仪表 | 519篇 |
建筑科学 | 152篇 |
矿业工程 | 112篇 |
能源动力 | 66篇 |
轻工业 | 85篇 |
水利工程 | 75篇 |
石油天然气 | 61篇 |
武器工业 | 42篇 |
无线电 | 1231篇 |
一般工业技术 | 389篇 |
冶金工业 | 76篇 |
原子能技术 | 15篇 |
自动化技术 | 6363篇 |
出版年
2024年 | 157篇 |
2023年 | 366篇 |
2022年 | 517篇 |
2021年 | 475篇 |
2020年 | 328篇 |
2019年 | 243篇 |
2018年 | 249篇 |
2017年 | 278篇 |
2016年 | 295篇 |
2015年 | 366篇 |
2014年 | 434篇 |
2013年 | 467篇 |
2012年 | 590篇 |
2011年 | 603篇 |
2010年 | 500篇 |
2009年 | 534篇 |
2008年 | 588篇 |
2007年 | 559篇 |
2006年 | 541篇 |
2005年 | 455篇 |
2004年 | 367篇 |
2003年 | 340篇 |
2002年 | 248篇 |
2001年 | 251篇 |
2000年 | 190篇 |
1999年 | 187篇 |
1998年 | 141篇 |
1997年 | 146篇 |
1996年 | 104篇 |
1995年 | 112篇 |
1994年 | 86篇 |
1993年 | 67篇 |
1992年 | 59篇 |
1991年 | 47篇 |
1990年 | 46篇 |
1989年 | 36篇 |
1988年 | 37篇 |
1987年 | 11篇 |
1986年 | 11篇 |
1985年 | 12篇 |
1984年 | 17篇 |
1983年 | 8篇 |
1982年 | 12篇 |
1981年 | 7篇 |
1980年 | 7篇 |
1979年 | 5篇 |
1978年 | 4篇 |
1977年 | 4篇 |
1976年 | 8篇 |
1975年 | 5篇 |
排序方式: 共有10000条查询结果,搜索用时 15 毫秒
1.
异构分层无线网络中基于逗留时间的动态流量均衡算法研究 总被引:1,自引:1,他引:0
为使异构分层无线网络能服务更多的移动用户,提出了一种基于逗留时间的动态流量均衡算法.该算法首先根据用户移动模型计算其在小区内的逗留时间,然后基于小区呼叫到达率和重叠覆盖小区的流量状态来确定一个周期内呼叫转移的数量,最后依据逗留时间门限值将重负载小区中满足条件的呼叫转移到轻负载的重叠覆盖小区中.为降低切换呼叫掉线率,还对异构网间的呼叫切换策略做了改进.仿真实验结果表明,本算法在新呼叫阻塞率和切换呼叫掉线率等性能指标上比传统方法有显著的提高. 相似文献
2.
Efficient multicast search under delay and bandwidth constraints 总被引:1,自引:0,他引:1
The issue of a multicast search for a group of users is discussed in this study. Given the condition that the search is over
only after all the users in the group are found, this problem is called the Conference Call Search (CCS) problem. The goal
is to design efficient CCS strategies under delay and bandwidth constraints. While the problem of tracking a single user has
been addressed by many studies, to the best of our knowledge, this study is one of the first attempts to reduce the search
cost for multiple users. Moreover, as oppose to the single user tracking, for which one can always reduce the expected search
delay by increasing the expected search cost, for a multicast search the dependency between the delay and the search cost
is more complicated, as demonstrated in this study. We identify the key factors affecting the search efficiency, and the dependency
between them and the search delay. Our analysis shows that under tight bandwidth constraints, the CCS problem is NP-hard.
We therefore propose a search method that is not optimal, but has a low computational complexity. In addition, the proposed
strategy yields a low search delay as well as a low search cost. The performance of the proposed search strategy is superior
to the implementation of an optimal single user search on a group of users.
Amotz Bar-Noy received the B.Sc. degree in 1981 in Mathematics and Computer Science and the Ph.D. degree in 1987 in Computer Science, both
from the Hebrew University, Israel. From October 1987 to September 1989 he was a post-doc fellow in Stanford University, California.
From October 1989 to August 1996 he was a Research Staff Member with IBM T. J. Watson Research Center, New York. From February
1995 to September 2001 he was an associate Professor with the Electrical Engineering-Systems department of Tel Aviv University,
Israel. From September 1999 to December 2001 he was with AT research labs in New Jersey. Since February 2002 he is a Professor
with the Computer and Information Science Department of Brooklyn College - CUNY, Brooklyn New York.
Zohar Naor received the Ph.D. degree in Computer Science from Tel Aviv University, Tel Aviv, Israel, in 2000. Since 2003 he is with
the University of Haifa, Israel. His areas of interests include wireless networks, resource management of computer networks,
mobility, search strategies, and multiple access protocols. 相似文献
3.
本文在分析了双眼立体视觉面临的本质困难之后,提出了用金字塔图法匹配特征基元的三眼立体视觉方法,这种方法由于建筑在透视投影几何原理的稳固基础上,无须任何先验限制,也不以图象相似性为基础,故可较好地解决精度与匹配难度的矛盾,且运用金字塔图法进行匹配传播使在保证精度的基础上,匹配速度大大提高,对计算机人工图象的匹配结果表明,误匹配率几乎为零,且有较高的匹配速度和精度。 相似文献
4.
A system for person-independent classification of hand postures against complex backgrounds in video images is presented. The system employs elastic graph matching, which has already been successfully applied for object and face recognition. We use the bunch graph technique to model variance in hand posture appearance between different subjects and variance in backgrounds. Our system does not need a separate segmentation stage but closely integrates finding the object boundaries with posture classification. 相似文献
5.
本文基于静态相关性分析和动态调整相结合的方法,提出了一种逻辑程序的执行模型,它不仅开发了“与“并行,同进也开发了一定的“或“并行,从而有效地加速了逻辑程序的执行。 相似文献
6.
GIS中矢量图形的结构分析与VC++中的实现 总被引:2,自引:0,他引:2
简要讨论了GIS各类矢量图形元素间的空间拓朴结构及基位置关系 ,并用VC 6 . 0及MFC具体分析了圆弧与多边形区域的相交关系及实现。为利用VC开发专用图形软件提供了有用帮助。 相似文献
7.
A new method for computing the node-pair reliability of network systems modeled by random graphs with nodes arranged in sequence is presented. It is based on a recursive algorithm using the “sliding window” technique, the window being composed of several consecutive nodes. In a single step, the connectivity probabilities for all nodes included in the window are found. Subsequently, the window is moved one node forward. This process is repeated until, in the last step, the window reaches the terminal node. The connectivity probabilities found at that point are used to compute the node-pair reliability of the network system considered. The algorithm is designed especially for graphs with small distances between adjacent nodes, where the distance between two nodes is defined as the absolute value of the difference between the nodes’ numbers. The maximal distance between any two adjacent nodes is denoted by Γ(G), where G symbolizes a random graph. If Γ(G)=2 then the method can be applied for directed as well as undirected graphs whose nodes and edges are subject to failure. This is important in view of the fact that many algorithms computing network reliability are designed for graphs with failure-prone edges and reliable nodes. If Γ(G)=3 then the method's applicability is limited to undirected graphs with reliable nodes. The main asset of the presented algorithms is their low numerical complexity—O(n), where n denotes the number of nodes. 相似文献
8.
9.
在3G(第3代移动通信系统)中,为了给不同类型的业务提供不同级别的端到端QoS,网络资源必须进行合理分配。QoS和资源分配是密不可分的,而无线资源分配显得尤为重要。文中提出了UMTS的QoS结构,分3部分对空中接口部分的QoS(即无线资源分配策略问题)进行了讨论:首先提出了一种RRA算法,接着讨论了W-CDMA和TD-CDMA系统的无线资源分配问题,最后讨论了下行链路及上行链路的呼叫允许控制(CAC)。 相似文献
10.