2D MXenes materials have the versatile chemical composition, tunable layer thickness, and facile functionalization nature advantages, which could be used as catalysts for hydrogen evolution reaction (HER). However, tuning the...

No abstract

No abstract

In this letter, we propose a novel receive antenna selection algorithm based on cross entropy optimization to maximize the capacity over spatially correlated channels in multiple-input multiple-output (MIMO) wireless systems. The performance of the proposed algorithm is investigated and compared with the existing schemes. Simulation results show that our low complexity algorithm can achieve near-optimal results that converge to within 99% of the optimal results obtained by exhaustive search. In addition, the proposed algorithm achieves near-optimal results irrespective of the mutual relationship between the number of transmit and receive antennas, the statistical properties of the channel and the operating signal-to-noise ratio.

We discuss Bayesian modelling and computational methods in analysis of indirectly observed spatial point processes. The context involves noisy measurements on an underlying point process that provide indirect and noisy data on locations of point outcomes. We are interested in problems in which the spatial intensity function may be highly heterogenous, and so is modelled via flexible nonparametric Bayesian mixture models. Analysis aims to estimate the underlying intensity function and the abundance of realized but unobserved points. Our motivating applications involve immunological studies of multiple fluorescent intensity images in sections of lymphatic tissue where the point processes represent geographical configurations of cells. We are interested in estimating intensity functions and cell abundance for each of a series of such data sets to facilitate comparisons of outcomes at different times and with respect to differing experimental conditions. The analysis is heavily computational, utilizing recently introduced MCMC approaches for spatial point process mixtures and extending them to the broader new context here of unobserved outcomes. Further, our example applications are problems in which the individual objects of interest are not simply points, but rather small groups of pixels; this implies a need to work at an aggregate pixel region level and we develop the resulting novel methodology for this. Two examples with with immunofluorescence histology data demonstrate the models and computational methodology.

No abstract

Abstract-A low complexity user scheduling algorithm based on a novel adaptive Markov chain Monte Carlo (AMCMC) method is proposed to achieve the maximal sum capacity in an uplink multiple-input multiple-output (MIMO) multiuser system. Compared with the existing scheduling algorithms, our algorithm is not only more efficient but also converges to within 99% of the optimal capacity obtained by exhaustive search. We demonstrate the convergence of the proposed scheduling algorithm and study the tradeoff between its complexity and performance.Index Terms-Adaptive Markov chain Monte Carlo (AM-CMC), multiple-input multiple-output (MIMO), multiuser selection, scheduling, sum capacity.

No abstract