全文获取类型
收费全文 | 164篇 |
免费 | 21篇 |
国内免费 | 18篇 |
专业分类
电工技术 | 6篇 |
综合类 | 25篇 |
化学工业 | 2篇 |
机械仪表 | 1篇 |
建筑科学 | 7篇 |
矿业工程 | 11篇 |
轻工业 | 2篇 |
水利工程 | 2篇 |
石油天然气 | 3篇 |
武器工业 | 1篇 |
无线电 | 23篇 |
一般工业技术 | 6篇 |
冶金工业 | 7篇 |
自动化技术 | 107篇 |
出版年
2024年 | 2篇 |
2023年 | 2篇 |
2022年 | 4篇 |
2021年 | 4篇 |
2020年 | 5篇 |
2019年 | 5篇 |
2018年 | 6篇 |
2017年 | 7篇 |
2016年 | 4篇 |
2015年 | 7篇 |
2014年 | 10篇 |
2013年 | 14篇 |
2012年 | 14篇 |
2011年 | 15篇 |
2010年 | 11篇 |
2009年 | 5篇 |
2008年 | 10篇 |
2007年 | 15篇 |
2006年 | 12篇 |
2005年 | 9篇 |
2004年 | 8篇 |
2003年 | 7篇 |
2002年 | 4篇 |
2001年 | 3篇 |
2000年 | 1篇 |
1998年 | 1篇 |
1997年 | 3篇 |
1996年 | 4篇 |
1995年 | 2篇 |
1994年 | 1篇 |
1993年 | 1篇 |
1992年 | 1篇 |
1989年 | 1篇 |
1988年 | 1篇 |
1982年 | 1篇 |
1974年 | 1篇 |
1955年 | 2篇 |
排序方式: 共有203条查询结果,搜索用时 31 毫秒
1.
Summary Algorithms for mutual exclusion that adapt to the current degree of contention are developed. Afilter and a leader election algorithm form the basic building blocks. The algorithms achieve system response times that are independent of the total number of processes and governed instead by the current degree of contention. The final algorithm achieves a constant amortized system response time.
Manhoi Choy was born in 1967 in Hong Kong. He received his B.Sc. in Electrical and Electronic Engineerings from the University of Hong Kong in 1989, and his M.Sc. in Computer Science from the University of California at Santa Barbara in 1991. Currently, he is working on his Ph.D. in Computer Science at the University of California at Santa Barbara. His research interests are in the areas of parallel and distributed systems, and distributed algorithms.
Ambuj K. Singh is an Assistant Professor in the Department of Computer Science at the University of California, Santa Barbara. He received a Ph.D. in Computer Science from the University of Texas at Austin in 1989, an M.S. in Computer Science from Iowa State University in 1984, and a B.Tech. from the Indian Institute of Technology at Kharagpur in 1982. His research interests are in the areas of adaptive resource allocation, concurrent program development, and distributed shared memory.A preliminary version of the paper appeared in the 12th Annual ACM Symposium on Principles of Distributed ComputingWork supported in part by NSF grants CCR-9008628 and CCR-9223094 相似文献
2.
本文对远距离支援干扰飞机、随队支援干扰飞机、机载自卫电子对抗系统以及最近国外正在大力发展的分布式电子干扰系统等几种航空有源电子干扰装备的作战对象、战术应用、功能、使用局限性等特点进行了比较 ,探讨了综合发展和运用这几型装备的重要意义 相似文献
3.
An improved version of Afek and Gafni's synchronous algorithm for distributed election in complete networks is given and anO(n) expected message complexity is shown.
M.Y. Chan received her Ph.D. in 1988 from the University of Hong Kong, and her M.S. and B.A. degrees in computer science from the University of California, San Diego in 1980 and 1981, respectively. She is currently an Assistant Professor at the University of Texas at Dallas.
Francis Y.L. Chin (S71-M76-SM85) received the B.Sc. degree in engineering science from the University of Toronto, Toronto, Canada, in 1972, and the M.S., M.A., and Ph.D. degrees in electrical engineering and computer science from Princeton University, New Jersey, in 1974, 1975, and 1976, respectively. Since 1975, he has taught at the University of Maryland, Baltimore Country, University of California, San Diego, University of Alberta, and Chinese University of Hong Kong. He is currently Head of the Department of Computer Science, University of Hong Kong. He has served as a program co-chairman of the 1988 International Conference on Computer Processing of Chinese and Oriental Languages (Toronto) and the International Computer Science Conference '88 (Hong Kong). His current research interests include algorithm design and analysis, parallel and distributed computing. 相似文献
4.
5.
为了节省和平衡网络中簇头的能耗,提出了一种基于多级选举的非均匀簇头选择算法MSEBNECHSA。该算法首先通过空间虚拟网格、簇头和Sink构成的三级选举机制构造网络候选簇头的能量分布图,然后采用基于候选簇头能量和距离的模拟退火算法,使网络中簇头的竞争范围随着到Sink的距离远近而相应从小到大非均匀分布。仿真实验表明,该算法能够以较低的能量成本将网络中的节点有效分簇,并且平衡网络中的能量消耗。 相似文献
6.
将单机系统或集中式系统中的死锁避免策略移植到分布式需要面临并发性和冲突问题的解决。本文通过分析二阶段锁的机制,引入了一种应用选举策略来幽雅地解决分布式系统中死锁避免所碰到问题的算法。 相似文献
7.
目前一些电子选举协议利用可链接环签名或一次性环签名来保护投票者的隐私,并防止重复投票的情况发生,但签名大小随投票人数的增大而增大,而简短可链接环签名大小始终固定不变,但已有简短可链接环签名算法效率较低。针对这些问题,利用累加器和基于知识证明的签名,构造新的高效的简短可链接环签名,结合匿名地址及星际文件系统,提出一种新的智能合约选举方案,分别设计了选举的创建、投票、计票等阶段的操作。对方案的不可伪造性、可链接性、匿名性、隐私性、公开验证性以及运行效率进行了证明和分析。最后进行了实验仿真评估,结果显示,随着投票者人数的增大,该方案选票的签名大小及Gas消耗保持不变且较少,生成时间及验证时间增长缓慢且较少。 相似文献
8.
Elections are a central model in a variety of areas. This paper studies parameterized computational complexity of five control problems in the Maximin election. We obtain the following results: constructive control by adding candidates is W[2]-hard with respect to the parameter “number of added candidates”; both constructive and destructive control by adding/deleting voters are W[1]-hard with respect to the parameter “number of added/deleted voters”. 相似文献
9.
Research on fine tuning stabilization properties has received attention for more than a decade. This paper presents probabilistic algorithms for fault containment. We demonstrate two exercises in fault containment in a weakly stabilizing system, which expedite recovery from single failures, and confine the effect of any single fault to the constant-distance neighborhood of the faulty process. The most significant aspect of the algorithms is that the fault gap, defined as the smallest interval after which the system is ready to handle the next single fault with the same efficiency, is independent of the network size. We argue that a small fault gap increases the availability of the fault-free system. 相似文献
10.