全文获取类型
收费全文 | 67篇 |
免费 | 0篇 |
专业分类
化学工业 | 10篇 |
建筑科学 | 1篇 |
轻工业 | 1篇 |
无线电 | 15篇 |
一般工业技术 | 2篇 |
冶金工业 | 2篇 |
自动化技术 | 36篇 |
出版年
2024年 | 1篇 |
2022年 | 5篇 |
2021年 | 5篇 |
2020年 | 4篇 |
2019年 | 3篇 |
2018年 | 1篇 |
2017年 | 3篇 |
2016年 | 2篇 |
2014年 | 1篇 |
2013年 | 2篇 |
2012年 | 3篇 |
2011年 | 4篇 |
2010年 | 6篇 |
2009年 | 1篇 |
2007年 | 2篇 |
2006年 | 2篇 |
2005年 | 1篇 |
2004年 | 1篇 |
2003年 | 2篇 |
2002年 | 3篇 |
2001年 | 2篇 |
2000年 | 1篇 |
1998年 | 1篇 |
1997年 | 1篇 |
1995年 | 2篇 |
1994年 | 2篇 |
1992年 | 1篇 |
1990年 | 2篇 |
1989年 | 3篇 |
排序方式: 共有67条查询结果,搜索用时 31 毫秒
1.
This paper shows that shared-coin algorithms can be combined to optimize several complexity measures, even in the presence of a strong adversary. By combining shared coins of Bracha and Rachman (1991) [10] and of Aspnes and Waarts (1996) [7], this yields a shared-coin algorithm, and hence, a randomized consensus algorithm, with O(nlog2n) individual work and O(n2logn) total work, using single-writer registers. This improves upon each of the above shared coins (where the former has a high cost for individual work, while the latter reduces it but pays in the total work), and is currently the best for this model. 相似文献
2.
Summary Thesnapshot object is an important tool for constructing wait-free asynchronous algorithms. We relate the snapshot object to thelattice agreement decision problem. It is shown that any algorithm for solving lattice agreement can be transformed into an implementation of a snapshot object. The overhead cost of this transformation is only a linear number of read and write operations on atomic single-writer multi-reader registers. The transformation uses an unbounded amount of shared memory. We present a deterministic algorithm for lattice agreement that usedO (log2
n) operations on 2-processorTest & Set registers, plusO (n) operations on atomic single-writer multi-reader registers. The shared objects are used by the algorithm in adynamic mode, that is, the identity of the processors that access each of the shared objects is determined dynamically during the execution of the algorithm. By a randomized implementation of 2-processorsTest & Set registers from atomic registers, this algorithm implies a randomized algorthm for lattice agreement that uses an expected number ofO (n) operations on (dynamic) atomic single-writer multi-reader registers. Combined with our transformation this yields implementations of atomic snapshots with the same complexity.Cambridge Research Laboratory, Digital Equipment Corporation
Hagit Attiya received the B.Sc. degreeiin Mathematics and Computer Science from the Hebrew University of Jerusalem, in 1981, the M.Sc. and Ph.D. degrees in Computer Science from the Hebrew University of Jerusalem, in 1983 and 1987, respectively. She is presently a senior lecturer at the departtment of Computer Science at the Technion, Israel Institute of Technology. Prior to this, she has been a post-doctoral research associate at the Laboratory for Computer Science at M.I.T. Her general research interests are distributed computation and theoretical computer science. More specific interests include fault-tolerance, timing-based and asynchronous algorithms.
Maurice Herlihy received the A.B. degree in Mathematics from Harvard University, and the M.S. and the Ph.D. degrees in Computer Science from M.I.T. From 1984 to 1989 he was a faculty member in the Computer Science Department at Carnegie Mellon University in Pittsburgh, PA. In 1989 he joined the research staff at the Digital Equipment Corporation's Cambridge Research Laboratory in Cambridge MA. Since 1994, he has been on the faculty at the Computer Science Department at Brown University. Dr. Herlihy's research interests encompass practical and theoretical aspects of distributed and concurrent computation.
Ophir achman received a B.A. in computer science from the Technion, Haifa, Israel in 1989 and M.Sc. in computer science from the Technion, Haifa, Israel, in 1992. He is now studying for a D.Sc. in computer science at the Technion. His currentarea of research is distributed computing, and in particular, asynchronous shared memory systems.This work appeared in preliminary form in proceedings ofthe 6th International Workshop on Distributed Algorithms [12]. This research was partially supported by grant No. 92-0233 from the United States-Israel Binational Science Foundation (BSF), Jerusalem, Technion V.P.R. funds — B. and G. Greenberg Research Fund (Ottawa), and the fund for the promotion of research in the TechnionPart of the work of this author was performed while visiting DEC Cambridge Research Laboratory 相似文献
3.
We study the message complexity of the problem of distributively electing a leader in chordal rings. Such networks consist of a basic ring with additional links, the extreme cases being the oriented ring and the complete graph with a full sense of direction. We present a general election algorithm for these networks, and prove its optimality. As a corollary, we show thatO(logn) chords at each processor suffice to obtain an algorithm that uses at mostO(n) messages; this improves and extends a previous work, where an algorithm, also usingO(n) messages, was suggested for the case where alln-1 chords exist (the oriented complete network). 相似文献
4.
Interference among operations can affect the throughput of concurrent applications. The author explains the difficulties of alleviating this interference, suggests ways to measure it, and outlines future research directions. 相似文献
5.
The use of nanomedicine for targeted drug delivery, though well established, is still a growing and developing field of research with potential benefits to many biomedical problems. There is a plethora of nano-carriers with myriads of designs of shapes, sizes and composition that involves complex, trial and error based preparation protocols. The digital age brought an information revolution with automated data analysis, machine learning and data mining applied to almost every field of research including drug delivery. Indeed, nanomedicine has benefitted from the use of data science and information science to optimize, standardize, and understand the synthesis, characterization, and biological effects of nanomaterials. This short review will describe several concepts and a few examples of nanoinformatics, including Nano-Quantitative Structure-Activity Relationship (Nano-QSAR), the use of computational methods for predicting different properties of nanomedicine in drug delivery and propose an outlook for the future. 相似文献
6.
7.
An actual sampling process can be modeled as a random process, which consists of the regular (uniform) deterministic sampling process plus an error in the sampling times which constitutes a zero-mean noise (the jitter). In this paper we discuss the problem of estimating the jitter process. By assuming that the jitter process is an i.i.d. one, with standard deviation that is small compared to the regular sampling time, we show that the variance of the jitter process can be estimated from thenth order spectrum of the sampled data,n=2, 3, i.e., the jitter variance can be extracted from the 2nd-order spectrum or the 3rd-order spectrum (the bispectrum) of the sampled data, provided the continuous signal spectrum is known. However when the signal skewness exceeds a certain level, the potential performance of the bispectrum-based estimation is better than that of the spectrum-based estimation. Moreover, the former can also provide jitter variance estimates when the continuous signal spectrum is unknown while the latter cannot. This suggests that the bispectrum of the sampled data is potentially better for estimating any parameter of the sampling jitter process, once the signal skewness is sufficiently large. 相似文献
8.
Summary It is shown that an acyclic smoothing network (and hence counting network) with fan-outn cannot be constructed from balancers of fan-outb
1,...,b
k
, if there exists a prime factorp ofn, such thatp does not divideb
i
, for alli, 1ik. This holds regardless of the depth, fan-in or size of the network, as long as they are finite. On the positive side, a simple construction ofcyclic counting networks with fan-outn, for arbitraryn, is presented. An acyclic counting network with fan-in and fan-outp2
k
, for any integerk0, is constructed out of 2-balancers andp-balancers.
Eran Aharonson received the B.A. and M.Sc. degrees in Computer Science from the Technion, Israel Institute of Technology (Haifa, Israel) in 1989 and 1992, respectively. He is currently vice president for research and development at ART-Advanced Recognition Technolgies Ltd., a company dedicated to handwriting and voice recognition. His general research interests are distributed computation, theoretical computer science and pattern recognition.
Hagit Attiya received the B.Sc. degree in Mathematics and Computer Science from the Hebrew University of Jerusalem, in 1981, the M.Sc. and Ph.D. degrees in Computer Science from the Hebrew University of Jerusalem, in 1983 and 1987, respectively. She is presently a senior lecturer at the department of Computer Science at the Technion, Israel Institute of Technology. Prior to this, she has been a post-doctoral research associate at the Laboratory for Computer Science at M.I.T. Her general research interests are distributed computation and theoretical computer science. More specific interests include fault-tolerance, timing-based and asynchronous algorithms.A preliminary version of this paper appears in proceedings of the3rd Annual ACM-SIAM Symposium on Discrete Algorithms, January 1992, pp. 104–113. This research was supported by Technion V.P.R.-B. and G. Greenberg Research Fund (Ottawa)Supported by Rashi Enterprise graduate fellowship 相似文献
9.
Talal Tamer M. Attiya Gamal Metwalli Mohamed R. Abd El-Samie Fathi E. Dessouky Moawad I. 《Multimedia Tools and Applications》2020,79(29-30):21129-21154
Multimedia Tools and Applications - Nowadays, optimization has become a brand methodology for different applications. One of the most promising fields for application of optimization is the image... 相似文献
10.
The design of concurrent data structures is greatly facilitated by the availability of synchronization operations that atomically modify arbitrary items, such as -read–modify–write (). Aiming to increase concurrency in order to exploit the parallelism offered by today’s multi-core and multi-processing architectures, we propose a highly concurrent software implementation of , with only constant space overhead. Our algorithm ensures that two operations delay each other only if they are within distance in the conflict graph, induced by the operations’ data items.The algorithm uses double compare-and-swap (dcas). When dcas is not supported by the architecture, the algorithm of Attiya and Dagan (2001) [3] can be used to replace dcas with (unary) cas, with only a slight increase in the interference among operations. 相似文献