An iterative framework for sparse signal reconstruction algorithms

It has been shown that iterative re-weighted strategies will often improve the performance of many sparse reconstruction algorithms. However, these strategies are algorithm dependent and cannot be easily extended for an arbitrary sparse reconstruction algorithm. In this paper, we propose a general iterative framework and a novel algorithm which iteratively enhance the performance of any given arbitrary sparse reconstruction algorithm. We theoretically analyze the proposed method using restricted isometry property and derive sufficient conditions for convergence and performance improvement. We also evaluate the performance of the proposed method using numerical experiments with both synthetic and real-world data. (C) 2014 Elsevier B.V. All rights reserved.

Simultaneous Perturbation Newton Algorithms for Simulation Optimization

We present a new Hessian estimator based on the simultaneous perturbation procedure, that requires three system simulations regardless of the parameter dimension. We then present two Newton-based simulation optimization algorithms that incorporate this Hessian estimator. The two algorithms differ primarily in the manner in which the Hessian estimate is used. Both our algorithms do not compute the inverse Hessian explicitly, thereby saving on computational effort. While our first algorithm directly obtains the product of the inverse Hessian with the gradient of the objective, our second algorithm makes use of the Sherman-Morrison matrix inversion lemma to recursively estimate the inverse Hessian. We provide proofs of convergence for both our algorithms. Next, we consider an interesting application of our algorithms on a problem of road traffic control. Our algorithms are seen to exhibit better performance than two Newton algorithms from a recent prior work.

Large carbon cluster thin film gauges for measuring aerodynamic heat transfer rates in hypersonic shock tunnels

Different types of Large Carbon Cluster (LCC) layers are synthesized by a single-step pyrolysis technique at various ratios of precursor mixture. The aim is to develop a fast responsive and stable thermal gauge based on a LCC layer which has relatively good electrical conduction in order to use it in the hypersonic flow field. The thermoelectric property of the LCC layer has been studied. It is found that these carbon clusters are sensitive to temperature changes. Therefore suitable thermal gauges were developed for blunt cone bodies and were tested in hypersonic shock tunnels at a flow Mach number of 6.8 to measure aerodynamic heating. The LCC layer of this thermal gauge encounters high shear forces and a hostile environment for test duration in the range of a millisecond. The results are favorable to use large carbon clusters as a better sensor than a conventional platinum thin film gauge in view of fast responsiveness and stability.

DEEP WASHINGTON PHOTOMETRY OF INCONSPICUOUS STAR CLUSTER CANDIDATES IN THE LARGE MAGELLANIC CLOUD

We present deep Washington photometry of 45 poorly populated star cluster candidates in the Large Magellanic Cloud (LMC). We have performed a systematic study to estimate the parameters of the cluster candidates by matching theoretical isochrones to the cleaned and dereddened cluster color-magnitude diagrams. We were able to estimate the basic parameters for 33 clusters, out of which 23 are identified as single clusters and 10 are found to be members of double clusters. The other 12 cluster candidates have been classified as possible clusters/asterisms. About 50% of the true clusters are in the 100-300 Myr age range, whereas some are older or younger. We have discussed the distribution of age, location, and reddening with respect to field, as well as the size of true clusters. The sizes and masses of the studied sample are found to be similar to that of open clusters in the Milky Way. Our study adds to the lower end of cluster mass distribution in the LMC, suggesting that the LMC, apart from hosting rich clusters, also has formed small, less massive open clusters in the 100-300 Myr age range.

Timing Recovery Algorithms and Architectures for 2-D Magnetic Recording Systems

We investigate the problem of timing recovery for 2-D magnetic recording (TDMR) channels. We develop a timing error model for TDMR channel considering the phase and frequency offsets with noise. We propose a 2-D data-aided phase-locked loop (PLL) architecture for tracking variations in the position and movement of the read head in the down-track and cross-track directions and analyze the convergence of the algorithm under non-separable timing errors. We further develop a 2-D interpolation-based timing recovery scheme that works in conjunction with the 2-D PLL. We quantify the efficiency of our proposed algorithms by simulations over a 2-D magnetic recording channel with timing errors.

Novel Biobjective Clustering (BiGC) Based on Cooperative Game Theory

We propose a new approach to clustering. Our idea is to map cluster formation to coalition formation in cooperative games, and to use the Shapley value of the patterns to identify clusters and cluster representatives. We show that the underlying game is convex and this leads to an efficient biobjective clustering algorithm that we call BiGC. The algorithm yields high-quality clustering with respect to average point-to-center distance (potential) as well as average intracluster point-to-point distance (scatter). We demonstrate the superiority of BiGC over state-of-the-art clustering algorithms (including the center based and the multiobjective techniques) through a detailed experimentation using standard cluster validity criteria on several benchmark data sets. We also show that BiGC satisfies key clustering properties such as order independence, scale invariance, and richness.

Joint Channel Estimation and Data Detection in MIMO-OFDM Systems: A Sparse Bayesian Learning Approach

The impulse response of wireless channels between the N-t transmit and N-r receive antennas of a MIMO-OFDM system are group approximately sparse (ga-sparse), i.e., NtNt the channels have a small number of significant paths relative to the channel delay spread and the time-lags of the significant paths between transmit and receive antenna pairs coincide. Often, wireless channels are also group approximately cluster-sparse (gac-sparse), i.e., every ga-sparse channel consists of clusters, where a few clusters have all strong components while most clusters have all weak components. In this paper, we cast the problem of estimating the ga-sparse and gac-sparse block-fading and time-varying channels in the sparse Bayesian learning (SBL) framework and propose a bouquet of novel algorithms for pilot-based channel estimation, and joint channel estimation and data detection, in MIMO-OFDM systems. The proposed algorithms are capable of estimating the sparse wireless channels even when the measurement matrix is only partially known. Further, we employ a first-order autoregressive modeling of the temporal variation of the ga-sparse and gac-sparse channels and propose a recursive Kalman filtering and smoothing (KFS) technique for joint channel estimation, tracking, and data detection. We also propose novel, parallel-implementation based, low-complexity techniques for estimating gac-sparse channels. Monte Carlo simulations illustrate the benefit of exploiting the gac-sparse structure in the wireless channel in terms of the mean square error (MSE) and coded bit error rate (BER) performance.

Parameterized Algorithms and Kernels for 3-Hitting Set with Parity Constraints

The 3-Hitting Set problem involves a family of subsets F of size at most three over an universe U. The goal is to find a subset of U of the smallest possible size that intersects every set in F. The version of the problem with parity constraints asks for a subset S of size at most k that, in addition to being a hitting set, also satisfies certain parity constraints on the sizes of the intersections of S with each set in the family F. In particular, an odd (even) set is a hitting set that hits every set at either one or three (two) elements, and a perfect code is a hitting set that intersects every set at exactly one element. These questions are of fundamental interest in many contexts for general set systems. Just as for Hitting Set, we find these questions to be interesting for the case of families consisting of sets of size at most three. In this work, we initiate an algorithmic study of these problems in this special case, focusing on a parameterized analysis. We show, for each problem, efficient fixed-parameter tractable algorithms using search trees that are tailor-made to the constraints in question, and also polynomial kernels using sunflower-like arguments in a manner that accounts for equivalence under the additional parity constraints.

COOL CORE CYCLES: COLD GAS AND AGN JET FEEDBACK IN CLUSTER CORES

Using high-resolution 3D and 2D (axisymmetric) hydrodynamic simulations in spherical geometry, we study the evolution of cool cluster cores heated by feedback-driven bipolar active galactic nuclei (AGNs) jets. Condensation of cold gas, and the consequent enhanced accretion, is required for AGN feedback to balance radiative cooling with reasonable efficiencies, and to match the observed cool core properties. A feedback efficiency (mechanical luminosity approximate to epsilon(M) over dot(acc)c(2); where (M) over dot(acc). is the mass accretion rate at 1 kpc) as small as 6 x 10(-5) is sufficient to reduce the cooling/accretion rate by similar to 10 compared to a pure cooling flow in clusters (with M-200 less than or similar to 7 x 10(14) M-circle dot). This value is much smaller compared to the ones considered earlier, and is consistent with the jet efficiency and the fact that only a small fraction of gas at 1 kpc is accreted onto the supermassive black hole (SMBH). The feedback efficiency in earlier works was so high that the cluster core reached equilibrium in a hot state without much precipitation, unlike what is observed in cool-core clusters. We find hysteresis cycles in all our simulations with cold mode feedback: condensation of cold gas when the ratio of the cooling-time to the free-fall time (t(cool)/t(ff)) is less than or similar to 10 leads to a sudden enhancement in the accretion rate; a large accretion rate causes strong jets and overheating of the hot intracluster medium such that t(cool)/t(ff) > 10; further condensation of cold gas is suppressed and the accretion rate falls, leading to slow cooling of the core and condensation of cold gas, restarting the cycle. Therefore, there is a spread in core properties, such as the jet power, accretion rate, for the same value of core entropy t(cool)/t(ff). A smaller number of cycles is observed for higher efficiencies and for lower mass halos because the core is overheated to a longer cooling time. The 3D simulations show the formation of a few-kpc scale, rotationally supported, massive (similar to 10(11) M-circle dot) cold gas torus. Since the torus gas is not accreted onto the SMBH, it is largely decoupled from the feedback cycle. The radially dominant cold gas (T < 5 x 10(4) K; vertical bar v(r)vertical bar >vertical bar v(phi vertical bar)) consists of fast cold gas uplifted by AGN jets and freely infalling cold gas condensing out of the core. The radially dominant cold gas extends out to 25 kpc for the fiducial run (halo mass 7 x 10(14) M-circle dot and feedback efficiency 6 x 10(-5)), with the average mass inflow rate dominating the outflow rate by a factor of approximate to 2. We compare our simulation results with recent observations.

A Computational Study of the Factors Influencing the PVC-Triggering Ability of a Cluster of Early Afterdepolarization-Capable Myocytes

Premature ventricular complexes (PVCs), which are abnormal impulse propagations in cardiac tissue, can develop because of various reasons including early afterdepolarizations (EADs). We show how a cluster of EAD-generating cells (EAD clump) can lead to PVCs in a model of cardiac tissue, and also investigate the factors that assist such clumps in triggering PVCs. In particular, we study, through computer simulations, the effects of the following factors on the PVC-triggering ability of an EAD clump: (1) the repolarization reserve (RR) of the EAD cells; (2) the size of the EAD clump; (3) the coupling strength between the EAD cells in the clump; and (4) the presence of fibroblasts in the EAD clump. We find that, although a low value of RR is necessary to generate EADs and hence PVCs, a very low value of RR leads to low-amplitude EAD oscillations that decay with time and do not lead to PVCs. We demonstrate that a certain threshold size of the EAD clump, or a reduction in the coupling strength between the EAD cells, in the clump, is required to trigger PVCs. We illustrate how randomly distributed inexcitable obstacles, which we use to model collagen deposits, affect PVC-triggering by an EAD clump. We show that the gap-junctional coupling of fibroblasts with myocytes can either assist or impede the PVC-triggering ability of an EAD clump, depending on the resting membrane potential of the fibroblasts and the coupling strength between the myocyte and fibroblasts. We also find that the triggering of PVCs by an EAD clump depends sensitively on factors like the pacing cycle length and the distribution pattern of the fibroblasts.

DETERMINISTIC ALGORITHMS FOR MATCHING AND PACKING PROBLEMS BASED ON REPRESENTATIVE SETS

In this work, we study the well-known r-DIMENSIONAL k-MATCHING ((r, k)-DM), and r-SET k-PACKING ((r, k)-SP) problems. Given a universe U := U-1 ... U-r and an r-uniform family F subset of U-1 x ... x U-r, the (r, k)-DM problem asks if F admits a collection of k mutually disjoint sets. Given a universe U and an r-uniform family F subset of 2(U), the (r, k)-SP problem asks if F admits a collection of k mutually disjoint sets. We employ techniques based on dynamic programming and representative families. This leads to a deterministic algorithm with running time O(2.851((r-1)k) .vertical bar F vertical bar. n log(2)n . logW) for the weighted version of (r, k)-DM, where W is the maximum weight in the input, and a deterministic algorithm with running time O(2.851((r-0.5501)k).vertical bar F vertical bar.n log(2) n . logW) for the weighted version of (r, k)-SP. Thus, we significantly improve the previous best known deterministic running times for (r, k)-DM and (r, k)-SP and the previous best known running times for their weighted versions. We rely on structural properties of (r, k)-DM and (r, k)-SP to develop algorithms that are faster than those that can be obtained by a standard use of representative sets. Incorporating the principles of iterative expansion, we obtain a better algorithm for (3, k)-DM, running in time O(2.004(3k).vertical bar F vertical bar . n log(2)n). We believe that this algorithm demonstrates an interesting application of representative families in conjunction with more traditional techniques. Furthermore, we present kernels of size O(e(r)r(k-1)(r) logW) for the weighted versions of (r, k)-DM and (r, k)-SP, improving the previous best known kernels of size O(r!r(k-1)(r) logW) for these problems.

Delineation of homogeneous hydrometeorological regions using wavelet-based global fuzzy cluster analysis

Identification of homogeneous hydrometeorological regions (HMRs) is necessary for various applications. Such regions are delineated by various approaches considering rainfall and temperature as two key variables. In conventional approaches, formation of regions is based on principal components (PCs)/statistics/indices determined from time series of the key variables at monthly and seasonal scales. An issue with use of PCs for regionalization is that they have to be extracted from contemporaneous records of hydrometeorological variables. Therefore, delineated regions may not be effective when the available records are limited over contemporaneous time period. A drawback associated with the use of statistics/indices is that they do not provide effective representation of the key variables when the records exhibit non-stationarity. Consequently, the resulting regions may not be effective for the desired purpose. To address these issues, a new approach is proposed in this article. The approach considers information extracted from wavelet transformations of the observed multivariate hydrometeorological time series as the basis for regionalization by global fuzzy c-means clustering procedure. The approach can account for dynamic variability in the time series and its non-stationarity (if any). Effectiveness of the proposed approach in forming HMRs is demonstrated by application to India, as there are no prior attempts to form such regions over the country. Drought severity-area-frequency (SAF) curves are constructed corresponding to each of the newly formed regions for the use in regional drought analysis, by considering standardized precipitation evapotranspiration index (SPEI) as the drought indicator.

Flow Investigation of Linear Cluster Plug Nozzle

Computational and experimental tools have been used to understand the linear cluster plug nozzle flowfield for a range of pressure ratios. The experimental cluster configuration is arrived at from a linear plug nozzle by introducing splitter plates in the primary nozzle, and computational analysis of corresponding geometry is also carried out. The flow development on the plug surface has been analyzed for two different cluster module spacings. The interactions between the cluster module jets is a complex one with a three-dimensional shock structure because of the differential end condition the shock experiences on the plug wall and freejet boundary. A prominent streamwise vorticity resulting from curvature of the shock is also seen along the length of the plug downstream of the module junctions. The out-of-phase wave interactions occurring along the module centerline and the splitter plate centerline, resulting in a wavy surface-limiting streamline pattern, particularly at lower pressure ratios, is explained.

Cold gas in cluster cores: global stability analysis and non-linear simulations of thermal instability

We perform global linear stability analysis and idealized numerical simulations in global thermal balance to understand the condensation of cold gas from hot/virial atmospheres (coronae), in particular the intracluster medium (ICM). We pay particular attention to geometry (e.g. spherical versus plane-parallel) and the nature of the gravitational potential. Global linear analysis gives a similar value for the fastest growing thermal instability modes in spherical and Cartesian geometries. Simulations and observations suggest that cooling in haloes critically depends on the ratio of the cooling time to the free-fall time (t(cool)/t(ff)). Extended cold gas condenses out of the ICM only if this ratio is smaller than a threshold value close to 10. Previous works highlighted the difference between the nature of cold gas condensation in spherical and plane-parallel atmospheres; namely, cold gas condensation appeared easier in spherical atmospheres. This apparent difference due to geometry arises because the previous plane-parallel simulations focused on in situ condensation of multiphase gas but spherical simulations studied condensation anywhere in the box. Unlike previous claims, our non-linear simulations show that there are only minor differences in cold gas condensation, either in situ or anywhere, for different geometries. The amount of cold gas depends on the shape of tcool/tff; gas has more time to condense if gravitational acceleration decreases towards the centre. In our idealized plane-parallel simulations with heating balancing cooling in each layer, there can be significant mass/energy/momentum transfer across layers that can trigger condensation and drive tcool/tff far beyond the critical value close to 10.