Sorry, you need to enable JavaScript to visit this website.

This paper presents methods to analyze functional brain networks and signals from graph spectral perspectives. The notion of frequency and filters traditionally defined for signals supported on regular domains such as discrete time and image grids has been recently generalized to irregular graph domains, and defines brain graph frequencies associated with different levels of spatial smoothness across the brain regions. Brain network frequency also enables the decomposition of brain signals into pieces corresponding to smooth or rapid variations.


Electric Network Frequency is the frequency of power distribution networks in power grids that fluctuates about a nominal value with respect to the changing loads.Its ubiquitous nature has made notable contributions to forensic analysis that has substantiated its use as a significant tool in this area. In this paper we have proposed a technique to identify the power grid in which the ENF containing signal was recorded, without the assistance of concurrent power references.


Testing complex digital signal processors (DSPs) requires a development platform with sufficient
signal bandwidth and system performance to fully exercise the DSP. Without a development plat-
form, verification of DSPs would be limited to monitoring test output signals for an indication of
performance and successful operation. In addition, a development platform with high-speed analog
input and output interfaces to the DSP system allows it to be used directly in many sophisticated


In this presentation, the topic of robust beamforming is studied. We devise the minimum dispersion criterion which extends the minimum variance criterion from l2‐norm to lp‐norm. Formulations with different linear and nonlinear constraints are examined. The proposed framework generalizes existing approaches including the Capon and linearly constrained minimum variance beamformers as well as the method based on worst-case performance optimization. Computationally attractive algorithm realizations are also developed.


We consider an oligopoly dynamic pricing problem where the demand model is unknown and the sellers have different marginal costs. We formulate the problem as a repeated game with incomplete information. We develop a dynamic pricing strategy that leads to a Pareto-efficient and subgame-perfect equilibrium and offers a bounded regret over an infinite horizon, where regret is defined as the expected cumulative profit loss as compared to the ideal scenario with a known demand model.