The Infona portal uses cookies, i.e. strings of text saved by a browser on the user's device. The portal can access those files and use them to remember the user's data, such as their chosen settings (screen view, interface language, etc.), or their login data. By using the Infona portal the user accepts automatic saving and using this information for portal operation purposes. More information on the subject can be found in the Privacy Policy and Terms of Service. By closing this window the user confirms that they have read the information on cookie usage, and they accept the privacy policy and the way cookies are used by the portal. You can change the cookie settings in your browser.
We consider the problem of estimating the power spectral density of the neural covariates underlying the spiking of a neuronal population. We assume the spiking of the neuronal ensemble to be described by Bernoulli statistics. Furthermore, we consider the conditional intensity function to be the logistic map of a second-order stationary process with sparse frequency content. Using the binary spiking...
This paper presents a new hybrid algorithm for harmonic estimation. The algorithm combines a simple fast population based search algorithm with Least Squares Method. It is based on the structural property of the harmonic estimation problem which implies that the signal model is linear in amplitude and nonlinear in phase. The hybrid algorithm uses the search algorithm for phase estimation and LS for...
This paper improves K-dominated sorting by M2M population decomposition [14] to enhance the population convergence and diversity, and propose a new evolutionary many objective optimization algorithm based on the improved Kdominated sorting. The proposed K-dominated sorting can maintain the population diversity by M2M population decomposition. What's more, we prove that the improved K-dominance can...
IEC standards suggest that a network is compliant if 95% of the sites are compliant. In many cases it is only practical to measure the PQ parameters of some of the sites in a network and to use statistical analysis. The paper examines the minimum number of monitored sites needed to demonstrate compliance with a prescribed degree of confidence - e.g. at the 95% confidence level. Analysis is made of...
Speech enhancement under non-stationary environments is still a challenging problem. This contribution presents a noise reduction system that is capable of tracking and suppressing both time varying harmonic noise and stationary noise. In a first stage, the harmonic noise power is estimated and attenuated using a modified Minimum Statistics approach that performs frequency warping according to the...
In this paper, we present two additions to the SFLC algorithm in order to improve the beat by beat estimation of fiducial points (B and X) and the maximum value of the derivative in impedance cardiography signal: addition of a reference input and scanning each beat more than once. On data synthesized from real ICG which exhibits beat by beat changes and baseline variations, we used statistical measures...
Estimating multiple pitch frequencies of concurrent speech sources from a single-microphone input is essential to speech separation. Nevertheless, pitch cues of individual sources are weakened by each other, making the estimation unreliable. This paper presents a pitch tracking method that incorporated in a model-based separation framework. Multiple pitch estimation is simplified into single pitch...
Nowadays power quality, especially voltage quality becomes more and more important for utilities, manufacturers and customers as well as for the regulatory authorities. Therefore a growing number of voltage quality monitoring campaigns with continuously increasing measurement times, considerably longer than one week, are observed. The assessment of voltage quality according to common standards (e...
Set the date range to filter the displayed results. You can set a starting date, ending date or both. You can enter the dates manually or choose them from the calendar.