Thermal instability and the feedback regulation of hot haloes in clusters, groups and galaxies

We present global multidimensional numerical simulations of the plasma that pervades the dark matter haloes of clusters, groups and massive galaxies (the intracluster medium; ICM). Observations of clusters and groups imply that such haloes are roughly in global thermal equilibrium, with heating balancing cooling when averaged over sufficiently long time- and length-scales; the ICM is, however, very likely to be locally thermally unstable. Using simple observationally motivated heating prescriptions, we show that local thermal instability (TI) can produce a multiphase medium with similar to 104 K cold filaments condensing out of the hot ICM only when the ratio of the TI time-scale in the hot plasma (tTI) to the free-fall time-scale (tff) satisfies tTI/tff? 10. This criterion quantitatively explains why cold gas and star formation are preferentially observed in low-entropy clusters and groups. In addition, the interplay among heating, cooling and TI reduces the net cooling rate and the mass accretion rate at small radii by factors of similar to 100 relative to cooling-flow models. This dramatic reduction is in line with observations. The feedback efficiency required to prevent a cooling flow is similar to 10-3 for clusters and decreases for lower mass haloes; supernova heating may be energetically sufficient to balance cooling in galactic haloes. We further argue that the ICM self-adjusts so that tTI/tff? 10 at all radii. When this criterion is not satisfied, cold filaments condense out of the hot phase and reduce the density of the ICM. These cold filaments can power the black hole and/or stellar feedback required for global thermal balance, which drives tTI/tff? 10. In comparison to clusters, groups have central cores with lower densities and larger radii. This can account for the deviations from self-similarity in the X-ray luminositytemperature () relation. The high-velocity clouds observed in the Galactic halo can be due to local TI producing multiphase gas close to the virial radius if the density of the hot plasma in the Galactic halo is >rsim 10-5 cm-3 at large radii.

Geosphere laminations in free groups

We construct for free groups, which are codimension one analogues of geodesic laminations on surfaces. Other analogues that have been constructed by several authors are dimension-one instead of codimension-one. Our main result is that the space of such laminations is compact. This in turn is based on the result that crossing, in the sense of Scott-Swarup, is an open condition. Our construction is based on Hatcher's normal form for spheres in the model manifold.

3-MANIFOLD GROUPS, KÄHLER GROUPS AND COMPLEX SURFACES

Let G be a Kahler group admitting a short exact sequence 1 -> N -> G -> Q -> 1 where N is finitely generated. (i) Then Q cannot be non-nilpotent solvable. (ii) Suppose in addition that Q satisfies one of the following: (a) Q admits a discrete faithful non-elementary action on H-n for some n >= 2. (b) Q admits a discrete faithful non-elementary minimal action on a simplicial tree with more than two ends. (c) Q admits a (strong-stable) cut R such that the intersection of all conjugates of R is trivial. Then G is virtually a surface group. It follows that if Q is infinite, not virtually cyclic, and is the fundamental group of some closed 3-manifold, then Q contains as a finite index subgroup either a finite index subgroup of the three-dimensional Heisenberg group or the fundamental group of the Cartesian product of a closed oriented surface of positive genus and the circle. As a corollary, we obtain a new proof of a theorem of Dimca and Suciu in Which 3-manifold groups are Kahler groups? J. Eur. Math. Soc. 11 (2009) 521-528] by taking N to be the trivial group. If instead, G is the fundamental group of a compact complex surface, and N is finitely presented, then we show that Q must contain the fundamental group of a Seifert-fibered 3-manifold as a finite index subgroup, and G contains as a finite index subgroup the fundamental group of an elliptic fibration. We also give an example showing that the relation of quasi-isometry does not preserve Kahler groups. This gives a negative answer to a question of Gromov which asks whether Kahler groups can be characterized by their asymptotic geometry.

Adsorption on Edge-Functionalized Bilayer Graphene Nanoribbons: Assessing the Role of Functional Groups in Methane Uptake

A combination of ab initio and classical Monte Carlo simulations is used to investigate the effects of functional groups on methane binding. Using Moller-Plesset (MP2) calculations, we obtain the binding energies for benzene functionalized with NH2, OH, CH3, COOH, and H2PO3 and identify the methane binding sites. In all cases, the preferred binding sites are located above the benzene plane in the vicinity of the benzene carbon atom attached to the functional group. Functional groups enhance methane binding relative to benzene (-6.39 kJ/mol), with the largest enhancement observed for H2PO3 (-8.37 kJ/mol) followed by COOH and CH3 (-7.77 kJ/mol). Adsorption isotherms are obtained for edge-functionalized bilayer graphene nanoribbons using grand canonical Monte Carlo simulations with a five-site methane model. Adsorbed excess and heats of adsorption for pressures up to 40 bar and 298 K are obtained with functional group concentrations ranging from 3.125 to 6.25 mol 96 for graphene edges functionalized with OH, NH2, and COOH. The functional groups are found to act as preferred adsorption sites, and in the case of COOH the local methane density in the vicinity of the functional group is found to exceed that of bare graphene. The largest enhancement of 44.5% in the methane excess adsorbed is observed for COOH-functionalized nanoribbons when compared to H terminated ribbons. The corresponding enhancements for OH- and NH2-functionalized ribbons are 10.5% and 3.7%, respectively. The excess adsorption across functional groups reflects the trends observed in the binding energies from MP2 calculations. Our study reveals that specific site functionalization can have a significant effect on the local adsorption characteristics and can be used as a design strategy to tailor materials with enhanced methane storage capacity.

Revisiting Riesz transforms on Heisenberg groups

We characterise higher order Riesz transforms on the Heisenberg group and also show that they satisfy dimension-free bounds under some assumptions on the multipliers. Using transference theorems, we deduce boundedness theorems for Riesz transforms on the reduced Heisenberg group and hence also for the Riesz transforms associated to multiple Hermite and Laguerre expansions.

Pattern clustering using cooperative game theory

In this paper, we approach the classical problem of clustering using solution concepts from cooperative game theory such as Nucleolus and Shapley value. We formulate the problem of clustering as a characteristic form game and develop a novel algorithm DRAC (Density-Restricted Agglomerative Clustering) for clustering. With extensive experimentation on standard data sets, we compare the performance of DRAC with that of well known algorithms. We show an interesting result that four prominent solution concepts, Nucleolus, Shapley value, Gately point and \tau-value coincide for the defined characteristic form game. This vindicates the choice of the characteristic function of the clustering game and also provides strong intuitive foundation for our approach.

Cooperative distributed sequential spectrum sensing

We consider cooperative spectrum sensing for cognitive radios. We develop an energy efficient detector with low detection delay using sequential hypothesis testing. Sequential Probability Ratio Test (SPRT) is used at both the local nodes and the fusion center. We also analyse the performance of this algorithm and compare with the simulations. Modelling uncertainties in the distribution parameters are considered. Slow fading with and without perfect channel state information at the cognitive radios is taken into account.

A novel algorithm for cooperative distributed sequential spectrum sensing in Cognitive Radio

This paper considers cooperative spectrum sensing in Cognitive Radios. In our previous work we have developed DualSPRT, a distributed algorithm for cooperative spectrum sensing using Sequential Probability Ratio Test (SPRT) at the Cognitive Radios as well as at the fusion center. This algorithm works well, but is not optimal. In this paper we propose an improved algorithm- SPRT-CSPRT, which is motivated from Cumulative Sum Procedures (CUSUM). We analyse it theoretically. We also modify this algorithm to handle uncertainties in SNR's and fading.

Cooperative distributed sequential spectrum sensing

We consider cooperative spectrum sensing for cognitive radios. We develop an energy efficient detector with low detection delay using sequential hypothesis testing. Sequential Probability Ratio Test (SPRT) is used at both the local nodes and the fusion center. We also analyse the performance of this algorithm and compare with the simulations. Modelling uncertainties in the distribution parameters are considered. Slow fading with and without perfect channel state information at the cognitive radios is taken into account.

Advances in base- and mobile-station aided cooperative wireless communications : An overview

In recent years, there has been an upsurge of research interest in cooperative wireless communications in both academia and industry. This article presents a simple overview of the pivotal topics in both mobile station (MS)- and base station (BS)- assisted cooperation in the context of cellular radio systems. Owing to the ever-increasing amount of literature in this particular field, this article is by no means exhaustive, but is intended to serve as a roadmap by assembling a representative sample of recent results and to stimulate further research. The emphasis is initially on relay-base cooperation, relying on network coding, followed by the design of cross-layer cooperative protocols conceived for MS cooperation and the concept of coalition network element (CNE)-assisted BS cooperation. Then, a range of complexity and backhaul traffic reduction techniques that have been proposed for BS cooperation are reviewed. A more detailed discussion is provided in the context of MS cooperation concerning the pros and cons of dispensing with high-complexity, power-hungry channel estimation. Finally, generalized design guidelines, conceived for cooperative wireless communications, are presented.

When good neighbors don't need fences: temporal landscape partitioning among baboon social groups

Intraspecific competition is a key factor shaping space-use strategies and movement decisions in many species, yet how and when neighbors utilize shared areas while exhibiting active avoidance of one another is largely unknown. Here, we investigated temporal landscape partitioning in a population of wild baboons (Papio cynocephalus). We used global positioning system (GPS) collars to synchronously record the hourly locations of five baboon social groups for similar to 900 days, and we used behavioral, demographic, and life history data to measure factors affecting use of overlap areas. Annual home ranges of neighboring groups overlapped substantially, as predicted (baboons are considered non-territorial), but home ranges overlapped less when space use was assessed over shorter time scales. Moreover, neighboring groups were in close spatial proximity to one another on fewer days than predicted by a null model, suggesting an avoidance-based spacing pattern. At all time scales examined (monthly, biweekly, and weekly), time spent in overlap areas was greater during time periods when groups fed on evenly dispersed, low-quality foods. The percent of fertile females in social groups was negatively correlated with time spent in overlap areas only during weekly time intervals. This suggests that broad temporal changes in ecological resources are a major predictor of how intensively overlap areas are used, and groups modify these ecologically driven spacing patterns at short time scales based on female reproductive status. Together, these findings offer insight into the economics of territoriality by highlighting the dynamics of spacing patterns at differing time scales.

En Masse relay selection algorithms for multi-source, multi-relay, decode-and-forward cooperative systems

Opportunistic relay selection in a multiple source-destination (MSD) cooperative system requires quickly allocating to each source-destination (SD) pair a suitable relay based on channel gains. Since the channel knowledge is available only locally at a relay and not globally, efficient relay selection algorithms are needed. For an MSD system, in which the SD pairs communicate in a time-orthogonal manner with the help of decode-and-forward relays, we propose three novel relay selection algorithms, namely, contention-free en masse assignment (CFEA), contention-based en masse assignment (CBEA), and a hybrid algorithm that combines the best features of CFEA and CBEA. En masse assignment exploits the fact that a relay can often aid not one but multiple SD pairs, and, therefore, can be assigned to multiple SD pairs. This drastically reduces the average time required to allocate an SD pair when compared to allocating the SD pairs one by one. We show that the algorithms are much faster than other selection schemes proposed in the literature and yield significantly higher net system throughputs. Interestingly, CFEA is as effective as CBEA over a wider range of system parameters than in single SD pair systems.

Cooperative Particle Swarm Optimization Based Receiver for Large-Dimension MIMO-ZPSC Systems

In this paper, we propose a cooperative particle swarm optimization (CPSO) based channel estimation/equalization scheme for multiple-input multiple-output zero-padded single-carrier (MIMO-ZPSC) systems with large dimensions in frequency selective channels. We estimate the channel state information at the receiver in time domain using a PSO based algorithm during training phase. Using the estimated channel, we perform information symbol detection in the frequency domain using FFT based processing. For this detection, we use a low complexity OLA (OverLap Add) likelihood ascent search equalizer which uses minimum mean square (MMSE) equalizer solution as the initial solution. Multiple iterations between channel estimation and data detection are carried out which significantly improves the mean square error and bit error rate performance of the receiver.

A Multicast Authentication Protocol (MAP) for Dynamic Multicast Groups in Wireless Networks

In this paper, we have proposed a centralized multicast authentication protocol (MAP) for dynamic multicast groups in wireless networks. In our protocol, a multicast group is defined only at the time of the multicasting. The authentication server (AS) in the network generates a session key and authenticates it to each of the members of a multicast group using the computationally inexpensive least common multiple (LCM) method. In addition, a pseudo random function (PRF) is used to bind the secret keys of the network members with their identities. By doing this, the AS is relieved from storing per member secrets in its memory, making the scheme completely storage scalable. The protocol minimizes the load on the network members by shifting the computational tasks towards the AS node as far as possible. The protocol possesses a membership revocation mechanism and is protected against replay attack and brute force attack. Analytical and simulation results confirm the effectiveness of the proposed protocol.