全文获取类型
收费全文 | 2285篇 |
免费 | 286篇 |
国内免费 | 332篇 |
专业分类
电工技术 | 39篇 |
技术理论 | 1篇 |
综合类 | 207篇 |
化学工业 | 10篇 |
金属工艺 | 2篇 |
机械仪表 | 10篇 |
建筑科学 | 13篇 |
矿业工程 | 11篇 |
能源动力 | 4篇 |
轻工业 | 12篇 |
水利工程 | 2篇 |
石油天然气 | 3篇 |
武器工业 | 11篇 |
无线电 | 1135篇 |
一般工业技术 | 26篇 |
冶金工业 | 15篇 |
原子能技术 | 1篇 |
自动化技术 | 1401篇 |
出版年
2024年 | 10篇 |
2023年 | 25篇 |
2022年 | 17篇 |
2021年 | 19篇 |
2020年 | 27篇 |
2019年 | 27篇 |
2018年 | 38篇 |
2017年 | 65篇 |
2016年 | 52篇 |
2015年 | 77篇 |
2014年 | 109篇 |
2013年 | 122篇 |
2012年 | 155篇 |
2011年 | 203篇 |
2010年 | 231篇 |
2009年 | 225篇 |
2008年 | 281篇 |
2007年 | 335篇 |
2006年 | 266篇 |
2005年 | 254篇 |
2004年 | 157篇 |
2003年 | 83篇 |
2002年 | 69篇 |
2001年 | 35篇 |
2000年 | 4篇 |
1999年 | 6篇 |
1998年 | 1篇 |
1997年 | 1篇 |
1996年 | 2篇 |
1995年 | 1篇 |
1993年 | 2篇 |
1990年 | 1篇 |
1967年 | 1篇 |
1965年 | 2篇 |
排序方式: 共有2903条查询结果,搜索用时 15 毫秒
991.
Equilibria in Topology Control Games for Ad Hoc Networks 总被引:2,自引:0,他引:2
Stephan Eidenbenz V. S. Anil Kumar Sibylle Zust 《Mobile Networks and Applications》2006,11(2):143-159
We study topology control problems in ad hoc networks where network nodes get to choose their power levels in order to ensure
desired connectivity properties. Unlike most other work on this topic, we assume that the network nodes are owned by different
entities, whose only goal is to maximize their own utility that they get out of the network without considering the overall
performance of the network. Game theory is the appropriate tool to study such selfish nodes: we define several topology control
games in which the nodes need to choose power levels in order to connect to other nodes in the network to reach their communication
partners while at the same time minimizing their costs. We study Nash equilibria and show that—among the games we define—these
can only be guaranteed to exist if each network node is required to be connected to all other nodes (we call this the Strong Connectivity Game). For a variation called Connectivity Game, where each node is only required to be connected (possibly via intermediate nodes) to a given set of nodes, we show that
Nash equilibria do not necessarily exist. We further study how to find Nash equilibria with incentive-compatible algorithms and compare the cost of Nash equilibria to the cost of a social optimum, which is a radius assignment that minimizes
the total cost in a network where nodes cooperate. We also study variations of the games; one where nodes not only have to
be connected, but k-connected, and one that we call the Reachability Game, where nodes have to reach as many other nodes as possible, while keeping costs low. We extend our study of the Strong Connectivity Game and the Connectivity Game to wireless networks with directional antennas and wireline networks, where nodes need to choose neighbors to which they
will pay a link. Our work is a first step towards game-theoretic analyses of topology control in wireless and wireline networks.
A preliminary version of this paper appeared in DIALM-POMC ’03 [8].
Stephan Eidenbenz is a technical staff member in Discrete Simulation Sciences (CCS-5) at Los Alamos National Laboraotry. He received his Ph.D.
in Computer Science from the Swiss Federal Institute of Technology, Zurich, Switzerland in 2000. Stephan’s research covers
areas in approximability, algorithms, computational geometry, computational biology, large-scale discrete simulation, selfish
networking, efficient networking, protocol design and optimization.
V. S. Anil Kumar is currently an Assistant Professor in the Dept. of Computer Science and a Senior Research Associate at Virginia Bioinformatics
Institute, Virginia Tech. Prior to this, he was a technical staff member in Los Alamos National Laboratory. He received a
Ph.D. in Computer Science from the Indian Institute of Science in 1999. His research interests include approximation algorithms,
mobile computing, combinatorial optimization and simulation of large socio-technical systems.
Sibylle Zust received her Masters degree in mathematics from ETH Zurich in Switzerland in 2002. She wrote her diploma thesis at the University
of Copenhagen in Denmark. Sibylle Zust spent two and a half years (2002–2005) as a graduate research assistant at the Los
Alamos National Laboratory in New Mexico, USA, where she worked on algorithmic aspects of game theory and scheduling problems.
She now works for an insurance company in Zurich, Switzerland. 相似文献
992.
Ad hoc网络体系结构研究 总被引:55,自引:1,他引:55
Ad hoc网络是一种有特殊用途的对等式网络,具有无中心、自组织、可快速展开、可移动等特点,这些特点使得它在战场、救灾等特殊场合的应用日渐受到人们的重视,本文首先分析了Ad hoc网络的特点和对协议的特殊需求,然后对网络结构和路由协议作了详细分析和讨论,并得出了网络分级化趋势和使用混合式路由协议的建议。 相似文献
993.
由于ADHOC网络是一种特殊的无线网络,其路由安全性显得尤为重要。文中深入研究了ADHOC网络中安全路由协议sead,对其中的哈希链保护机制进行了深入的分析,包括哈希链中链值的传播,哈希链值在节点间的验证机制。在对sead协议哈希链机制深入分析的基础上,发现其重新生成新链后所带来的哈希链过长以及其链值利用率低的问题,并提出了一个解决方案,节省了资源空间,提高了资源利用率。 相似文献
994.
Mobile ad hoc and sensor networks may consist of a mixture of nodes, some of which may be considered selfish due to a lack of cooperativeness in providing network services such as forwarding packets. In the literature, existing trust management protocols for mobile ad hoc networks advocate isolating selfish nodes as soon as they are detected. Further, altruistic behaviors are encouraged with incentive mechanisms. In this paper, we propose and analyze a trust management protocol for group communication systems where selfish nodes exist and system survivability is highly critical to mission execution. Rather than always encouraging altruistic behaviors, we consider the tradeoff between a node’s individual welfare (e.g., saving energy to prolong the node lifetime) vs. global welfare (e.g., achieving a given mission with sufficient service availability) and identify the best design condition of this behavior model to balance selfish vs. altruistic behaviors. With the system lifetime and the mission success probability as our trust-based reliability metric, we show that our behavior model that exploits the tradeoff between selfishness vs. altruism outperforms one that only encourages altruistic behaviors. 相似文献
995.
996.
Compared with unicast, multicast over wireless ad‐hoc networks do not support reliability due to their inability to exchange request‐to‐send/clear‐to‐send (RTS/CTS) and ACK packets with multiple recipients. Although several media access control (MAC) layer protocols have been proposed to provide reliable multicast, these introduce additional overhead, which degrades system performance. A novel MAC protocol for reliable wireless multicast is proposed in this paper. By adapting orthogonal frequency division multiple access characteristics in CTS and ACK packets, the protocol achieves reliability over wireless multicast with minimized overhead. 相似文献
997.
移动Adhoc网络是没有任何固定基础设施的移动无线网络。多跳特性是Adhoc网络区别于一般无线网络的最重要特点。详细分析了TCP性能随跳数变化的原因,并基于空间复用构造了一个简单的多跳Adhoc网络TCP吞吐量模型,用以计算不同跳数下的TCP吞吐量理论值。计算结果表明该模型与文献[1]的仿真结果吻合。 相似文献
998.
The main purposes of this article are to relieve broadcast problem, to immunize to some prerequisites, and to reduce the number of transmitted control packets. Broadcasting control packets network-wide is the most direct and common method for finding the required destination node in ad hoc mobile wireless networks; however, this causes a lot of waste of wireless bandwidth. To remedy the problem, routing protocols demanding some prerequisites are proposed; nonetheless, hardly can they be used if these prerequisites are missed or become stale. To efficiently reduce the number of transmitted control packets, our routing protocol partitions the network into interlaced gray districts and white districts by the aid of GPS and inhibits an intermediate node residing in a white district from re-transmitting the received control packets. However, a mobile node residing in a gray district is responsible for re-transmitting them till they reach the destination node. Our routing protocol does not demand any prerequisite except the use of GPS. Each mobile node can always obtain its own location information; furthermore, the information may neither be missed nor become stale. Our routing protocol is easy to be implemented, saves precious wireless bandwidth, and reduces almost half a number of control packets as compared with pure flooding routing protocols.Ying-Kwei Ho received the B.S. degree and M.S. degree in applied mathematics and in electrical engineering from the Chung-Cheng Institute of Technology in 1987 and 1993 respectively and the Ph.D. degree in computer engineering and science from the Yuan-Ze University, Taiwan, R.O.C. He joined the Army of Taiwan, R.O.C. in 1987 and worked as a software engineer. From 1993 to 1997, he was an instructor in the War Game Center of Armed Forces University, Taiwan, R.O.C. He is currently an assistant professor of the Department of Computer Science at Chung-Cheng Institute of Technology. His research interests include mobile computing, wireless network performance simulation and evaluation, and modeling and simulation.Ru-Sheng Liu received the B.S. degree in electrical engineering from the National Cheng-Kung University, Taiwan, in 1972 and the M.S. and Ph.D. degrees in computer science from the University of Texas at Dallas, Richardson, Texas, in 1981 and1985, respectively. He is currently an associate professor in the Department of Computer Engineering and Science at Yuan-Ze University, Chungli, Taiwan. His research interests are in the areas of mobile computing, internet technology, and computer algorithms. 相似文献
999.
In city environment, the vehicle communi- cation is affected by the around obstacles due to the espe- cial condition of wireless channels. However, most of prior works adopt the fixed radio range value of vehicles to trans- mit packets. In this paper, we design an optimization for- warding range routing protocol for VANET in urban area. It has an optimized and adjustable forwarding range, which changes with different environments based on the path loss and the city model. And the proposed geo-routing protocol has a novel idea in computing the connectivity of roads and the adjustable strategy in a sparse network. Simulation re- suits indicate that the OFRR enjoys desirable performance in the urban area. 相似文献
1000.
车载自组织网中基于蚁群算法的延迟感知路由协议 总被引:1,自引:0,他引:1
针对城市道路环境下车载自组织网( VANETs)中通信性能下降以及数据传输失败的问题,提出了一种基于蚁群算法的延迟感知路由( ACDR)协议。首先,建立双向车道的数学延迟模型;然后,根据提出的端点十字路口( EI)的概念,ACDR利用蚁群优化( ACO)寻找最佳路线,其中前向蚂蚁根据本地路段延迟以及当前十字路口与目的节点的端点十字路口之间的全局时延来选择路径,后向蚂蚁则负责在返回路径时更新信息素,同时,相邻十字路口之间利用贪婪转发算法进行数据包的传递。最后仿真比较了ACDR协议与连通性感知路由( CAR)协议的性能,结果表明提出的ACDR协议的数据包的传输延迟小,丢包率低,通信性能好。 相似文献