Energy and entropy radiated by a black hole embedded in a de Sitter braneworld

We study the Hawking radiation of a (4+n)-dimensional Schwarzschild black hole imbedded in space-time with a positive cosmological constant. The greybody and energy emission rates of scalars, fermions, bosons, and gravitons are calculated in the full range of energy. Valuable information on the dimensions and curvature of space-time is revealed. Furthermore, we investigate the entropy radiated and lost by black holes. We find their ratio near 1 in favor of the Bekenstein's conjecture.

Dynamical horizon entropy and equilibrium thermodynamics of generalized gravity theories

We study the relation between the thermodynamics and field equations of generalized gravity theories on the dynamical trapping horizon with sphere symmetry. We assume the entropy of a dynamical horizon as the Noether charge associated with the Kodama vector and point out that it satisfies the second law when a Gibbs equation holds. We generalize two kinds of Gibbs equations to Gauss-Bonnet gravity on any trapping horizon. Based on the quasilocal gravitational energy found recently for f(R) gravity and scalar-tensor gravity in some special cases, we also build up the Gibbs equations, where the nonequilibrium entropy production, which is usually invoked to balance the energy conservation, is just absorbed into the modified Wald entropy in the Friedmann-Robertson-Walker spacetime with slowly varying horizon. Moreover, the equilibrium thermodynamic identity remains valid for f(R) gravity in a static spacetime. Our work provides an alternative treatment to reinterpret the nonequilibrium correction and supports the idea that the horizon thermodynamics is universal for generalized gravity theories.

Entropy of Kaluza-Klein black hole from Kerr/CFT correspondence

We extend the recently proposed Kerr/CFT correspondence to examine the dual conformal field theory of four-dimensional Kaluza-Klein black hole in Einstein-Maxwell-Dilaton theory. For the extremal Kaluza-Klein black hole, the central charge and temperature of the dual conformal field are calculated following the approach of Guica, Hartman, Song and Strominger. Meanwhile, we show that the microscopic entropy given by the Cardy formula agrees with Bekenstein-Hawking entropy of extremal Kaluza-Klein black hole. For the non-extremal case, by studying the near-region wave equation of a neutral massless scalar field, we investigate the hidden conformal symmetry of Kaluza-Klein black hole, and find the left and right temperatures of the dual conformal field theory. Furthermore, we find that the entropy of non-extremal Kaluza-Klein black hole is reproduced by Cardy formula. (C) 2010 Elsevier B.V. All rights reserved.

Enthalpy/entropy compensation: Influence of DNA flanking sequence on the binding of 7-amino actinomycin D to its primary binding site in short DNA duplexes

The effect of the context of the flanking sequence on ligand binding to DNA oligonucleotides that contain consensus binding sites was investigated for the binding of the intercalator 7-amino actinomycin D. Seven self-complementary DNA oligomers each containing a centrally located primary binding site, 5'-A-G-C-T-3', flanked on either side by the sequences (AT)(n) or (AA)(n) (with n = 2, 3, 4) and AA(AT)(2), were studied. For different flanking sequences, (AA)(n)-series or (AT)(n)-series, differential fluorescence enhancements of the ligand due to binding were observed. Thermodynamic studies indicated that the flanking sequences not only affected DNA stability and secondary structure but also modulated ligand binding to the primary binding site. The magnitude of the ligand binding affinity to the primary site was inversely related to the sequence dependent stability. The enthalpy of ligand binding was directly measured by isothermal titration calorimetry, and this made it possible to parse the binding free energy into its energetic and entropic terms.

Automated Program Recognition by Graph Parsing

Recognizing standard computational structures (cliches) in a program can help an experienced programmer understand the program. We develop a graph parsing approach to automating program recognition in which programs and cliches are represented in an attributed graph grammar formalism and recognition is achieved by graph parsing. In studying this approach, we evaluate our representation's ability to suppress many common forms of variation which hinder recognition. We investigate the expressiveness of our graph grammar formalism for capturing programming cliches. We empirically and analytically study the computational cost of our recognition approach with respect to two medium-sized, real-world simulator programs.

Volumetric consequences of particle loss by grading entropy.

Chemical and biological processes, such as dissolution in gypsiferous sands and biodegradation in waste refuse, result in mass or particle loss, which in turn lead to changes in solid and void phase volumes and grading. Data on phase volume and grading changes have been obtained from oedometric dissolution tests on sand–salt mixtures. Phase volume changes are defined by a (dissolution-induced) void volume change parameter (Λ). Grading changes are interpreted using grading entropy coordinates, which allow a grading curve to be depicted as a single data point and changes in grading as a vector quantity rather than a family of distribution curves. By combining Λ contours with pre- to post-dissolution grading entropy coordinate paths, an innovative interpretation of the volumetric consequences of particle loss is obtained. Paths associated with small soluble particles, the loss of which triggers relatively little settlement but large increase in void ratio, track parallel to the Λ contours. Paths associated with the loss of larger particles, which can destabilise the sand skeleton, tend to track across the Λ contours.

The Use of Graph Grammars for Model-based Reasoning in Diagnostic Expert Systems

Flasinski M. and Lee M.H., The Use of Graph Grammars for Model-based Reasoning in Diagnostic Expert Systems, Prace Informatyczne, Zeszyty Naukowe Uniwersytetu Jagiellonskiego, 9, 1999, pp147-165.

Graph Wavelets for Spatial Traffic Analysis

A number of problems in network operations and engineering call for new methods of traffic analysis. While most existing traffic analysis methods are fundamentally temporal, there is a clear need for the analysis of traffic across multiple network links — that is, for spatial traffic analysis. In this paper we give examples of problems that can be addressed via spatial traffic analysis. We then propose a formal approach to spatial traffic analysis based on the wavelet transform. Our approach (graph wavelets) generalizes the traditional wavelet transform so that it can be applied to data elements connected via an arbitrary graph topology. We explore the necessary and desirable properties of this approach and consider some of its possible realizations. We then apply graph wavelets to measurements from an operating network. Our results show that graph wavelets are very useful for our motivating problems; for example, they can be used to form highly summarized views of an entire network's traffic load, to gain insight into a network's global traffic response to a link failure, and to localize the extent of a failure event within the network.

On the Intrinsic Locality Properties of Web Reference Streams

There has been considerable work done in the study of Web reference streams: sequences of requests for Web objects. In particular, many studies have looked at the locality properties of such streams, because of the impact of locality on the design and performance of caching and prefetching systems. However, a general framework for understanding why reference streams exhibit given locality properties has not yet emerged. In this work we take a first step in this direction, based on viewing the Web as a set of reference streams that are transformed by Web components (clients, servers, and intermediaries). We propose a graph-based framework for describing this collection of streams and components. We identify three basic stream transformations that occur at nodes of the graph: aggregation, disaggregation and filtering, and we show how these transformations can be used to abstract the effects of different Web components on their associated reference streams. This view allows a structured approach to the analysis of why reference streams show given properties at different points in the Web. Applying this approach to the study of locality requires good metrics for locality. These metrics must meet three criteria: 1) they must accurately capture temporal locality; 2) they must be independent of trace artifacts such as trace length; and 3) they must not involve manual procedures or model-based assumptions. We describe two metrics meeting these criteria that each capture a different kind of temporal locality in reference streams. The popularity component of temporal locality is captured by entropy, while the correlation component is captured by interreference coefficient of variation. We argue that these metrics are more natural and more useful than previously proposed metrics for temporal locality. We use this framework to analyze a diverse set of Web reference traces. We find that this framework can shed light on how and why locality properties vary across different locations in the Web topology. For example, we find that filtering and aggregation have opposing effects on the popularity component of the temporal locality, which helps to explain why multilevel caching can be effective in the Web. Furthermore, we find that all transformations tend to diminish the correlation component of temporal locality, which has implications for the utility of different cache replacement policies at different points in the Web.

Entropy Loss is Maximal for Uniform Inputs

A secure sketch (defined by Dodis et al.) is an algorithm that on an input w produces an output s such that w can be reconstructed given its noisy version w' and s. Security is defined in terms of two parameters m and m˜ : if w comes from a distribution of entropy m, then a secure sketch guarantees that the distribution of w conditioned on s has entropy m˜ , where λ = m−m˜ is called the entropy loss. In this note we show that the entropy loss of any secure sketch (or, more generally, any randomized algorithm) on any distribution is no more than it is on the uniform distribution.

Isoperimetric Graph Partitioning for Data Clustering and Image Segmentation

Spectral methods of graph partitioning have been shown to provide a powerful approach to the image segmentation problem. In this paper, we adopt a different approach, based on estimating the isoperimetric constant of an image graph. Our algorithm produces the high quality segmentations and data clustering of spectral methods, but with improved speed and stability.