全文获取类型
收费全文 | 122篇 |
免费 | 5篇 |
学科分类
工业技术 | 127篇 |
出版年
2020年 | 2篇 |
2019年 | 3篇 |
2018年 | 3篇 |
2017年 | 2篇 |
2016年 | 3篇 |
2015年 | 2篇 |
2014年 | 3篇 |
2013年 | 10篇 |
2012年 | 5篇 |
2011年 | 5篇 |
2010年 | 9篇 |
2009年 | 8篇 |
2008年 | 1篇 |
2007年 | 2篇 |
2006年 | 4篇 |
2003年 | 1篇 |
2002年 | 2篇 |
2001年 | 1篇 |
1999年 | 2篇 |
1998年 | 3篇 |
1997年 | 5篇 |
1996年 | 2篇 |
1995年 | 2篇 |
1994年 | 2篇 |
1993年 | 7篇 |
1992年 | 5篇 |
1991年 | 3篇 |
1990年 | 3篇 |
1989年 | 6篇 |
1988年 | 1篇 |
1987年 | 2篇 |
1986年 | 1篇 |
1985年 | 3篇 |
1984年 | 2篇 |
1983年 | 1篇 |
1982年 | 5篇 |
1980年 | 1篇 |
1978年 | 2篇 |
1973年 | 1篇 |
1970年 | 2篇 |
排序方式: 共有127条查询结果,搜索用时 15 毫秒
1.
The detection of short-duration nonstationary signals, which are commonly referred to as transients, is often performed in the time-frequency-transform domain. An analytical framework within which the performance of different detectors based on linear transforms can be easily compared, for different classes of signals, is developed. A given class of transients is modeled as a signal existing in a linear subspace, plus a mismatch signal. Closed-form expressions are derived for the best and the worst detection performance for all possible transients in a given class. Using this framework, the performance of detectors based on the Gabor transform and on the short-time Fourier transform is evaluated and compared 相似文献
2.
This paper develops a method of error analysis for Fourier transform-based sinusoidal frequency estimation in the presence of nonrandom interferences. A general error formula is derived and then specialized to the cases of additive and multiplicative interferences. Approximate error formulas are derived for the case of additive polynomial-phase interference. Finally, an application to error analysis in estimating the parameters of multiple polynomial-phase signals is discussed in detail 相似文献
3.
4.
5.
6.
We show how to support efficient back traversal in a unidirectional list, using small memory and with essentially no slowdown in forward steps. Using O(lgn) memory for a list of size n, the i’th back-step from the farthest point reached so far takes O(lgi) time in the worst case, while the overhead per forward step is at most ? for arbitrary small constant ?>0. An arbitrary sequence of forward and back steps is allowed. A full trade-off between memory usage and time per back-step is presented: k vs. kn1/k and vice versa. Our algorithms are based on a novel pebbling technique which moves pebbles on a virtual binary, or n1/k-ary, tree that can only be traversed in a pre-order fashion. 相似文献
7.
8.
9.
10.
Connectionist learning models have had considerable empirical success, but it is hard to characterize exactly what they learn. The learning of finite-state languages (FSL) from example strings is a domain which has been extensively studied and might provide an opportunity to help understand connectionist learning. A major problem is that traditional FSL learning assumes the storage of all examples and thus violates connectionist principles. This paper presents a provably correct algorithm for inferring any minimum-state deterministic finite-state automata (FSA) from a complete ordered sample using limited total storage and without storing example strings. The algorithm is an iterative strategy that uses at each stage a current encoding of the data considered so far, and one single sample string. One of the crucial advantages of our algorithm is that the total amount of space used in the course of learning for encoding any finite prefix of the sample is polynomial in the size of the inferred minimum state deterministic FSA. The algorithm is also relatively efficient in time and has been implemented. More importantly, there is a connectionist version of the algorithm that preserves these properties. The connectionist version requires much more structure than the usual models and has been implemented using the Rochester Connectionist Simulator. We also show that no machine with finite working storage can iteratively identify the FSL from arbitrary presentations. 相似文献