全文获取类型
收费全文 | 165篇 |
免费 | 19篇 |
国内免费 | 19篇 |
学科分类
工业技术 | 203篇 |
出版年
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条查询结果,搜索用时 15 毫秒
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.
为了节省和平衡网络中簇头的能耗,提出了一种基于多级选举的非均匀簇头选择算法MSEBNECHSA。该算法首先通过空间虚拟网格、簇头和Sink构成的三级选举机制构造网络候选簇头的能量分布图,然后采用基于候选簇头能量和距离的模拟退火算法,使网络中簇头的竞争范围随着到Sink的距离远近而相应从小到大非均匀分布。仿真实验表明,该算法能够以较低的能量成本将网络中的节点有效分簇,并且平衡网络中的能量消耗。 相似文献
4.
目前一些电子选举协议利用可链接环签名或一次性环签名来保护投票者的隐私,并防止重复投票的情况发生,但签名大小随投票人数的增大而增大,而简短可链接环签名大小始终固定不变,但已有简短可链接环签名算法效率较低。针对这些问题,利用累加器和基于知识证明的签名,构造新的高效的简短可链接环签名,结合匿名地址及星际文件系统,提出一种新的智能合约选举方案,分别设计了选举的创建、投票、计票等阶段的操作。对方案的不可伪造性、可链接性、匿名性、隐私性、公开验证性以及运行效率进行了证明和分析。最后进行了实验仿真评估,结果显示,随着投票者人数的增大,该方案选票的签名大小及Gas消耗保持不变且较少,生成时间及验证时间增长缓慢且较少。 相似文献
5.
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”. 相似文献
6.
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. 相似文献
7.
8.
The election problem in asynchronous distributed systems with bounded faulty processes 总被引:1,自引:1,他引:0
Sung Hoon Park 《The Journal of supercomputing》2007,41(1):89-104
Determining the “weakest” failure detectors is a central topic in solving many agreement problems such as Consensus, Non-Blocking
Atomic Commit and Election in asynchronous distributed systems. So far, this has been studied extensively for several such
fundamental problems. It is stated that Perfect Failure Detector P is the weakest failure detector to solve the Election problem with any number of faulty processes. In this paper, we introduce
Modal failure detector M and show that to solve Election, M is the weakest failure detector to solve election when the number of faulty processes is less than ⌈n/2⌉. We also show that it is strictly weaker than P.
相似文献
Sung Hoon ParkEmail: |
9.
We consider the problem of assuring the trustworthiness (i.e. reliability and robustness) and prolonging the lifetime of wireless ad hoc networks, using the OLSR routing protocol, in the presence of selfish nodes. Assuring the trustworthiness of these networks can be achieved by selecting the most trusted paths, while prolonging the lifetime can be achieved by (1) reducing the number of relay nodes (MPR) propagating the topology control (TC) messages and (2) considering the residual energy levels of these relay nodes in the selection process. In this paper, we propose a novel clustering algorithm and a relay node selection algorithm based on the residual energy level and connectivity index of the nodes. This hybrid model is referred to as H-OLSR. The OLSR messages are adapted to handle the cluster heads election and the MPR nodes selection algorithms. These algorithms are designed to cope with selfish nodes that are getting benefits from others without cooperating with them. Hence, we propose an incentive compatible mechanism that motivates nodes to behave truthfully during the selection and election processes. Incentive retributions increase the reputation of the nodes. Since network services are granted according to nodes’ accumulated reputation, the nodes should cooperate. Finally, based on nodes’ reputation, the most trusted forwarding paths are determined. This reputation-based hybrid model is referred to as RH-OLSR. Simulation results show that the novel H-OLSR model based on energy and connectivity can efficiently prolong the network lifetime, while the RH-OLSR model improves the trustworthiness of the network through the selection of the most trusted paths based on nodes’ reputations. These are the two different processes used to define the reputation-based clustering OLSR (RBC-OLSR) routing protocol. 相似文献
10.
程良森 《盐城工业专科学校学报》2006,19(2):5-9
为从根本上改造基层政权,中国共产党领导下的华中抗日根据地广泛开展了一场轰轰烈烈的民主选举运动。根据地颁布了一系列法令、条例,使选举规范化;人民群众在实践中也充分发挥智慧创造了适合自己的选举方式。选举体现了广泛性、平等性、真实性的特点。这一运动使基层政权性质彻底改变,为争取抗战乃至整个新民主主义革命的胜利提供了重要保证。 相似文献