全文获取类型
收费全文 | 356篇 |
免费 | 1篇 |
国内免费 | 5篇 |
专业分类
化学 | 5篇 |
力学 | 1篇 |
数学 | 330篇 |
物理学 | 26篇 |
出版年
2023年 | 22篇 |
2022年 | 21篇 |
2021年 | 15篇 |
2020年 | 20篇 |
2019年 | 13篇 |
2018年 | 13篇 |
2017年 | 19篇 |
2016年 | 10篇 |
2015年 | 8篇 |
2014年 | 20篇 |
2013年 | 43篇 |
2012年 | 8篇 |
2011年 | 23篇 |
2010年 | 13篇 |
2009年 | 23篇 |
2008年 | 16篇 |
2007年 | 22篇 |
2006年 | 14篇 |
2005年 | 7篇 |
2004年 | 4篇 |
2003年 | 4篇 |
2002年 | 6篇 |
2001年 | 3篇 |
2000年 | 2篇 |
1999年 | 1篇 |
1998年 | 1篇 |
1997年 | 2篇 |
1996年 | 2篇 |
1995年 | 2篇 |
1994年 | 1篇 |
1992年 | 1篇 |
1989年 | 1篇 |
1985年 | 1篇 |
1984年 | 1篇 |
排序方式: 共有362条查询结果,搜索用时 15 毫秒
61.
62.
63.
64.
65.
Automatic detection and classification of short and nonstationary events in noisy signals is widely considered to be a difficult task for traditional frequency domain and even time–frequency domain approaches. A novel method for audio signal classification is introduced. It is based on statistical properties of the temporal fine structure of audio events. Artificially generated random signals and unvoiced stop consonants of speech are used to evaluate the method. The results show improved recognition accuracy in comparison to traditional approaches. 相似文献
66.
An investigation is undertaken of semiclassical time-evolutions and their classical limit with the intent of getting insights into the classical–quantum frontier. We deal with a system that represents the interaction between matter and a given field, and our main research tool is the so-called q-complexity quantifier, for which two different versions are considered. The probability distribution associated with the time-evolution process is determined by recourse to the Bandt–Pompe symbolic technique [C. Bandt, B. Pompe, Permutation entropy: a natural complexity measure for time series, Phys. Rev. Lett. 88 (2002) 174102:1–174102:4]. The most salient details of the quantum–classical transition turn out to be described not only well, but also in a better fashion than that of previous literature. 相似文献
67.
We study the permutation complexity of finite-state stationary stochastic processes based on a duality between values and orderings between values. First, we establish a duality between the set of all words of a fixed length and the set of all permutations of the same length. Second, on this basis, we give an elementary alternative proof of the equality between the permutation entropy rate and the entropy rate for a finite-state stationary stochastic processes first proved in [J.M. Amigó, M.B. Kennel, L. Kocarev, The permutation entropy rate equals the metric entropy rate for ergodic information sources and ergodic dynamical systems, Physica D 210 (2005) 77-95]. Third, we show that further information on the relationship between the structure of values and the structure of orderings for finite-state stationary stochastic processes beyond the entropy rate can be obtained from the established duality. In particular, we prove that the permutation excess entropy is equal to the excess entropy, which is a measure of global correlation present in a stationary stochastic process, for finite-state stationary ergodic Markov processes. 相似文献
68.
Nowadays we are often faced with huge databases resulting from the rapid growth of data storage technologies. This is particularly true when dealing with music databases. In this context, it is essential to have techniques and tools able to discriminate properties from these massive sets. In this work, we report on a statistical analysis of more than ten thousand songs aiming to obtain a complexity hierarchy. Our approach is based on the estimation of the permutation entropy combined with an intensive complexity measure, building up the complexity-entropy causality plane. The results obtained indicate that this representation space is very promising to discriminate songs as well as to allow a relative quantitative comparison among songs. Additionally, we believe that the here-reported method may be applied in practical situations since it is simple, robust and has a fast numerical implementation. 相似文献
69.
PSN is a fast forward permutation if for each m the computational complexity of evaluating Pm(x) is small independently of m and x. Naor and Reingold constructed fast forward pseudorandom cycluses and involutions. By studying the evolution of permutation graphs, we prove that the number of queries needed to distinguish a random cyclus from a random permutation in SN is Θ(N) if one does not use queries of the form Pm(x), but is only Θ(1) if one is allowed to make such queries. We construct fast forward permutations which are indistinguishable from random permutations even when queries of the form Pm(x) are allowed. This is done by introducing an efficient method to sample the cycle structure of a random permutation, which in turn solves an open problem of Naor and Reingold. 相似文献
70.
Dominique de Werra 《Graphs and Combinatorics》2003,19(2):263-278
The theorem of Birkhoff – von Neumann concerns bistochastic matrices (i.e., matrices with nonnegative real entries such that
all row sums and all column sums are equal to one). We consider here real matrices with entries unrestricted in sign and we
extend the notion of permutation matrices (integral bistochastic matrices); some generalizations of the theorem are derived
by using elementary properties of graph theory.
Received: October 10, 2000 Final version received: April 11, 2002 相似文献