Power meter for Highly-Distorted Three-Phase Systems

This paper describes a low-cost, three-phase power meter, which is based on a fast, specially designed acquisition board coupled to a PC via the PC parallel/printer port or by means of an AT card. The power associated with the fundamental and first harmonics is computed by software that operates in the time domain and employs a sample-weighting procedure that makes the uncertainty related to the asynchronous sampling negligible. The low-cost acquisition board features two 8-bit 1 MHz converters and a local RAM, which decouples the PC clock from the measurement requirements. Hall effect transducers are used for the current channels and fast differential amplifiers for the voltage channels. The fast sampling frequency allows simple antialiasing filters to be employed. Digital filtering is used to reduce the sample number while increasing the resolution. The power uncertainty provided by this arrangement is less then 0.1 % with 2.5 measurements per second when a low-cost 486DX33-based PC is use

Cost-based domain filtering for stochastic constraint programming

Cost-based filtering is a novel approach that combines techniques from Operations Research and Constraint Programming to filter from decision variable domains values that do not lead to better solutions [7]. Stochastic Constraint Programming is a framework for modeling combinatorial optimization problems that involve uncertainty [9]. In this work, we show how to perform cost-based filtering for certain classes of stochastic constraint programs. Our approach is based on a set of known inequalities borrowed from Stochastic Programming ¿ a branch of OR concerned with modeling and solving problems involving uncertainty. We discuss bound generation and cost-based domain filtering procedures for a well-known problem in the Stochastic Programming literature, the static stochastic knapsack problem. We also apply our technique to a stochastic sequencing problem. Our results clearly show the value of the proposed approach over a pure scenario-based Stochastic Constraint Programming formulation both in terms of explored nodes and run time

Diffusion-adapted spatial filtering of fMRI data for improved activation mapping in white matter

Brain activation mapping using fMRI data has been mostly focused on finding detections in gray matter. Activations in white matter are harder to detect due to anatomical differences between both tissue types, which are rarely acknowledged in experimental design. However, recent publications have started to show evidence for the possibility of detecting meaningful activations in white matter. The shape of the activations arising from the BOLD signal is fundamentally different between white matter and gray matter, a fact which is not taken into account when applying isotropic Gaussian filtering in the preprocessing of fMRI data. We explore a graph-based description of the white matter developed from diffusion MRI data, which is capable of encoding the anisotropic domain. Based on this representation, two approaches to white matter filtering are tested, and their performance is evaluated on both semi-synthetic phantoms and real fMRI data. The first approach relies on heat kernel filtering in the graph spectral domain, and produced a clear increase in both sensitivity and specificity over isotropic Gaussian filtering. The second approach is based on spectral decomposition for the denosing of the signal, and showed increased specificity at the cost of a lower sensitivity.Novel approach to white matter filtering We introduced new advanced methods for filtering brain scans. Using them, we managed to improve the detection of activity in the white matter of the brain

Automatic Kalman-filter-based wavelet shrinkage denoising of 1D stellar spectra

We propose a non-parametric method to denoise 1D stellar spectra based on wavelet shrinkage followed by adaptive Kalman thresholding. Wavelet shrinkage denoising involves applying the discrete wavelet transform (DWT) to the input signal, 'shrinking' certain frequency components in the transform domain, and then applying inverse DWT to the reduced components. The performance of this procedure is influenced by the choice of base wavelet, the number of decomposition levels, and the thresholding function. Typically, these parameters are chosen by 'trial and error', which can be strongly dependent on the properties of the data being denoised. We here introduce an adaptive Kalman-filter-based thresholding method that eliminates the need for choosing the number of decomposition levels. We use the 'Haar' wavelet basis, which we found to provide excellent filtering for 1D stellar spectra, at a low computational cost. We introduce various levels of Poisson noise into synthetic PHOENIX spectra, and test the performance of several common denoising methods against our own. It proves superior in terms of noise suppression and peak shape preservation. We expect it may also be of use in automatically and accurately filtering low signal-to-noise galaxy and quasar spectra obtained from surveys such as SDSS, Gaia, LSST, PESSTO, VANDELS, LEGA-C, and DESI

Towards low-latency real-time detection of gravitational waves from compact binary coalescences in the era of advanced detectors

Electromagnetic (EM) follow-up observations of gravitational wave (GW) events will help shed light on the nature of the sources, and more can be learned if the EM follow-ups can start as soon as the GW event becomes observable. In this paper, we propose a computationally efficient time-domain algorithm capable of detecting gravitational waves (GWs) from coalescing binaries of compact objects with nearly zero time delay. In case when the signal is strong enough, our algorithm also has the flexibility to trigger EM observation before the merger. The key to the efficiency of our algorithm arises from the use of chains of so-called Infinite Impulse Response (IIR) filters, which filter time-series data recursively. Computational cost is further reduced by a template interpolation technique that requires filtering to be done only for a much coarser template bank than otherwise required to sufficiently recover optimal signal-to-noise ratio. Towards future detectors with sensitivity extending to lower frequencies, our algorithm's computational cost is shown to increase rather insignificantly compared to the conventional time-domain correlation method. Moreover, at latencies of less than hundreds to thousands of seconds, this method is expected to be computationally more efficient than the straightforward frequency-domain method.Comment: 19 pages, 6 figures, for PR

CP-AGCN: Pytorch-based Attention Informed Graph Convolutional Network for Identifying Infants at Risk of Cerebral Palsy

Early prediction is clinically considered one of the essential parts of cerebral palsy (CP) treatment. We propose to implement a low-cost and interpretable classification system for supporting CP prediction based on General Movement Assessment (GMA). We design a Pytorch-based attention-informed graph convolutional network to early identify infants at risk of CP from skeletal data extracted from RGB videos. We also design a frequencybinning module for learning the CP movements in the frequency domain while filtering noise. Our system only requires consumer-grade RGB videos for training to support interactive-time CP prediction by providing an interpretable CP classification result

On Global Warming (Softening Global Constraints)

We describe soft versions of the global cardinality constraint and the regular constraint, with efficient filtering algorithms maintaining domain consistency. For both constraints, the softening is achieved by augmenting the underlying graph. The softened constraints can be used to extend the meta-constraint framework for over-constrained problems proposed by Petit, Regin and Bessiere.Comment: 15 pages, 7 figures. Accepted at the 6th International Workshop on Preferences and Soft Constraint