Analysis of Entropy Generation During Mixed Convective Heat Transfer of Nanofluids Past a Rotating Circular Cylinder

The entropy generation due to mixed convective heat transfer of nanofluids past a rotating circular cylinder placed in a uniform cross stream is investigated via streamline upwind Petrov-Galerkin based finite element method. Nanosized copper (Cu) particles suspended in water are used with Prandtl number (Pr)=6.9. The computations are carried out at a representative Reynolds number (Re) of 100. The dimensionless cylinder rotation rate, a, is varied between 0 and 2. The range of nanoparticle volume fractions (phi) considered is 0 <= phi <= 5%. Effect of aiding buoyancy is brought about by considering two fixed values of the Richardson number (Ri) as 0.5 and 1.0. A new model for predicting the effective viscosity and thermal conductivity of dilute suspensions of nanoscale colloidal particles is presented. The model addresses the details of the agglomeration-deagglomeration in tune with the pertinent variations in the effective particulate dimensions, volume fractions, as well as the aggregate structure of the particulate system. The total entropy generation is found to decrease sharply with cylinder rotation rates and nanoparticle volume fractions. Increase in nanoparticle agglomeration shows decrease in heat transfer irreversibility. The Bejan number falls sharply with increase in alpha and phi.

Belief propagation for minimum weight many-to-one matchings in the random complete graph

In a complete bipartite graph with vertex sets of cardinalities n and n', assign random weights from exponential distribution with mean 1, independently to each edge. We show that, as n -> infinity, with n' = n/alpha] for any fixed alpha > 1, the minimum weight of many-to-one matchings converges to a constant (depending on alpha). Many-to-one matching arises as an optimization step in an algorithm for genome sequencing and as a measure of distance between finite sets. We prove that a belief propagation (BP) algorithm converges asymptotically to the optimal solution. We use the objective method of Aldous to prove our results. We build on previous works on minimum weight matching and minimum weight edge cover problems to extend the objective method and to further the applicability of belief propagation to random combinatorial optimization problems.

Renormalized entanglement entropy for BPS black branes

We compute the renormalized entanglement entropy (REE) for BPS black solutions in N = 2, four-dimensional gauged supergravity. We find that this quantity decreases monotonically with the size of the entangling region until it reaches a critical point, then increases and approaches the entropy density of the brane. This behavior can be understood as a consequence of the renormalized entanglement entropy being driven by two competing factors, namely, entanglement and the mixedness of the black brane. In the UV, entanglement dominates, whereas in the IR, the mixedness takes over.

PERCOLATION ON THE INFORMATION-THEORETICALLY SECURE SIGNAL TO INTERFERENCE RATIO GRAPH

We consider a continuum percolation model consisting of two types of nodes, namely legitimate and eavesdropper nodes, distributed according to independent Poisson point processes in R-2 of intensities lambda and lambda(E), respectively. A directed edge from one legitimate node A to another legitimate node B exists provided that the strength of the signal transmitted from node A that is received at node B is higher than that received at any eavesdropper node. The strength of the signal received at a node from a legitimate node depends not only on the distance between these nodes, but also on the location of the other legitimate nodes and an interference suppression parameter gamma. The graph is said to percolate when there exists an infinitely connected component. We show that for any finite intensity lambda(E) of eavesdropper nodes, there exists a critical intensity lambda(c) < infinity such that for all lambda > lambda(c) the graph percolates for sufficiently small values of the interference parameter. Furthermore, for the subcritical regime, we show that there exists a lambda(0) such that for all lambda < lambda(0) <= lambda(c) a suitable graph defined over eavesdropper node connections percolates that precludes percolation in the graphs formed by the legitimate nodes.

A note on D1-D5 entropy and geometric quantization

We quantize the space of 2-charge fuzzballs in IIB supergravity on K3. The resulting entropy precisely matches the D1-D5 black hole entropy, including a specific numerical coefficient. A partial match (ie., a smaller coefficient) was found by Rychkov a decade ago using the Lunin-Mathur subclass of solutions - we use a simple observation to generalize his approach to the full moduli space of K3 fuzzballs, filling a small gap in the literature.

Effect of processing route on phase stability in equiatomic multicomponent Ti20Fe20Ni20Co20Cu20 high entropy alloy

The evolution of microstructure and phase formation in equiatomic Ti20Fe20Ni20Co20Cu20 high entropy alloy synthesised by conventional arc melting followed with suction casting and ball milling with spark plasma sintering route is distinctly different. The cast microstructure exhibits one body centre cubic and two face centre cubic high entropy phases based on titanium, cobalt and copper respectively along with a eutectic containing Ti2Ni type Laves phase. On the contrary, spinodal decomposed microstructure consisting of cobalt and copper solid solution is obtained in the sintered sample. However, long term annealing of cast sample at 950 degrees C reveals a eutectoid transformation with different phases than the cast sample. The aforementioned observations are discussed using CALPHAD thermodynamical approach and available literature.

Conformal perturbation theory and higher spin entanglement entropy on the torus

We study the free fermion theory in 1+1 dimensions deformed by chemical potentials for holomorphic, conserved currents at finite temperature and on a spatial circle. For a spin-three chemical potential mu, the deformation is related at high temperatures to a higher spin black hole in hs0] theory on AdS(3) spacetime. We calculate the order mu(2) corrections to the single interval Renyi and entanglement entropies on the torus using the bosonized formulation. A consistent result, satisfying all checks, emerges upon carefully accounting for both perturbative and winding mode contributions in the bosonized language. The order mu(2) corrections involve integrals that are finite but potentially sensitive to contact term singularities. We propose and apply a prescription for defining such integrals which matches the Hamiltonian picture and passes several non-trivial checks for both thermal corrections and the Renyi entropies at this order. The thermal corrections are given by a weight six quasi-modular form, whilst the Renyi entropies are controlled by quasi-elliptic functions of the interval length with modular weight six. We also point out the well known connection between the perturbative expansion of the partition function in powers of the spin-three chemical potential and the Gross-Taylor genus expansion of large-N Yang-Mills theory on the torus. We note the absence of winding mode contributions in this connection, which suggests qualitatively different entanglement entropies for the two systems.

Prediction of Fatigue Life in Plain Concrete Using Entropy Production

An energy approach within the framework of thermodynamics is used to model the fatigue process in plain concrete. Fatigue crack growth is an irreversible process associated with an irreversible entropy gain. A closed-form expression for entropy generated during fatigue in terms of energy dissipated is derived using principles of dimensional analysis and self-similarity. An increase in compliance is considered as a measure of damage accumulated during fatigue. The entropy at final fatigue failure is shown to be independent of loading and geometry and is proposed as a material property. A relationship between energy dissipated and number of cycles of fatigue loading is obtained. (C) 2015 American Society of Civil Engineers.

Minimization Problems Based on Relative alpha-Entropy I: Forward Projection

Minimization problems with respect to a one-parameter family of generalized relative entropies are studied. These relative entropies, which we term relative alpha-entropies (denoted I-alpha), arise as redundancies under mismatched compression when cumulants of compressed lengths are considered instead of expected compressed lengths. These parametric relative entropies are a generalization of the usual relative entropy (Kullback-Leibler divergence). Just like relative entropy, these relative alpha-entropies behave like squared Euclidean distance and satisfy the Pythagorean property. Minimizers of these relative alpha-entropies on closed and convex sets are shown to exist. Such minimizations generalize the maximum Renyi or Tsallis entropy principle. The minimizing probability distribution (termed forward I-alpha-projection) for a linear family is shown to obey a power-law. Other results in connection with statistical inference, namely subspace transitivity and iterated projections, are also established. In a companion paper, a related minimization problem of interest in robust statistics that leads to a reverse I-alpha-projection is studied.

Minimization Problems Based on Relative alpha-Entropy II: Reverse Projection

In part I of this two-part work, certain minimization problems based on a parametric family of relative entropies (denoted I-alpha) were studied. Such minimizers were called forward I-alpha-projections. Here, a complementary class of minimization problems leading to the so-called reverse I-alpha-projections are studied. Reverse I-alpha-projections, particularly on log-convex or power-law families, are of interest in robust estimation problems (alpha > 1) and in constrained compression settings (alpha < 1). Orthogonality of the power-law family with an associated linear family is first established and is then exploited to turn a reverse I-alpha-projection into a forward I-alpha-projection. The transformed problem is a simpler quasi-convex minimization subject to linear constraints.

Divide and Conquer: Efficient Large-Scale Structure from Motion Using Graph Partitioning

Despite significant advances in recent years, structure-from-motion (SfM) pipelines suffer from two important drawbacks. Apart from requiring significant computational power to solve the large-scale computations involved, such pipelines sometimes fail to correctly reconstruct when the accumulated error in incremental reconstruction is large or when the number of 3D to 2D correspondences are insufficient. In this paper we present a novel approach to mitigate the above-mentioned drawbacks. Using an image match graph based on matching features we partition the image data set into smaller sets or components which are reconstructed independently. Following such reconstructions we utilise the available epipolar relationships that connect images across components to correctly align the individual reconstructions in a global frame of reference. This results in both a significant speed up of at least one order of magnitude and also mitigates the problems of reconstruction failures with a marginal loss in accuracy. The effectiveness of our approach is demonstrated on some large-scale real world data sets.

Graph Modification Problems: A Modern Perspective

We give an overview of recent results and techniques in parameterized algorithms for graph modification problems.

Synthesis and electron microscopy of high entropy alloy nanoparticles

This work provides a methodology for synthesizing isolated multi-component, high entropy alloy nanoparticles. Wet chemical synthesis technique was used to synthesis NiFeCrCuCo nanoparticles. As synthesized nanoparticles were spherical with an average size of 26.7 +/- 3.3 nm. Average composition of the as-synthesized nanoparticle dispersion was 26 +/- 2 at% Cr, 14 +/- 2 at% Fe, 10 +/- 0.6 at% Co, 25 +/- 0.1 at% Ni and 25 +/- 1.1 at% Cu. Compositional analysis of the nanoparticles conducted using the compositional line profile analysis and compositional mapping on a single nanoparticle level revealed a fairly uniform distribution of all the five component elements within the nanoparticle volume. Electron diffraction analysis clearly revealed that the structure of as-synthesized nanoparticles was face centered cubic. (C) 2015 Elsevier B.V. All rights reserved.

Query Click and Text Similarity Graph for Query Suggestions

Query suggestion is an important feature of the search engine with the explosive and diverse growth of web contents. Different kind of suggestions like query, image, movies, music and book etc. are used every day. Various types of data sources are used for the suggestions. If we model the data into various kinds of graphs then we can build a general method for any suggestions. In this paper, we have proposed a general method for query suggestion by combining two graphs: (1) query click graph which captures the relationship between queries frequently clicked on common URLs and (2) query text similarity graph which finds the similarity between two queries using Jaccard similarity. The proposed method provides literally as well as semantically relevant queries for users' need. Simulation results show that the proposed algorithm outperforms heat diffusion method by providing more number of relevant queries. It can be used for recommendation tasks like query, image, and product suggestion.