Studies of the acoustic transmission characteristics of coaxial nozzles with inverted velocity profiles, volume 1

The efficiency of internal noise radiation through coannular exhaust nozzle with an inverted velocity profile was studied. A preliminary investigation was first undertaken to: (1) define the test parameters which influence the internal noise radiation; (2) develop a test methodology which could realistically be used to examine the effects of the test parameters; (3) and to validate this methodology. The result was the choice of an acoustic impulse as the internal noise source in the in the jet nozzles. Noise transmission characteristics of a nozzle system were then investigated. In particular, the effects of fan nozzle convergence angle, core extention length to annulus height ratio, and flow Mach number and temperatures were studied. The results are presented as normalized directivity plots

Investigation of hypersonic shock-induced combustion in a hydrogen-air system

A numerical study is conducted to simulate the ballistic range experiments at Mach 5.11 and 6.46. The flow field is found to be unsteady with periodic instabilities originating in the stagnation zone. The unsteadiness of the flow field decreased with increase in the Mach number, thus indicating that it is possible to stabilize such flow fields with a high degree of overdrive. The frequency of periodic instability is determined using Fourier power spectrum and is found to be in good agreement with the experimental data. The physics of the instability is explained by the wave interaction models available in the literature

Negative-weight percolation

We describe a percolation problem on lattices (graphs, networks), with edge weights drawn from disorder distributions that allow for weights (or distances) of either sign, i.e. including negative weights. We are interested whether there are spanning paths or loops of total negative weight. This kind of percolation problem is fundamentally different from conventional percolation problems, e.g. it does not exhibit transitivity, hence no simple definition of clusters, and several spanning paths/loops might coexist in the percolation regime at the same time. Furthermore, to study this percolation problem numerically, one has to perform a non-trivial transformation of the original graph and apply sophisticated matching algorithms. Using this approach, we study the corresponding percolation transitions on large square, hexagonal and cubic lattices for two types of disorder distributions and determine the critical exponents. The results show that negative-weight percolation is in a different universality class compared to conventional bond/site percolation. On the other hand, negative-weight percolation seems to be related to the ferromagnet/spin-glass transition of random-bond Ising systems, at least in two dimensions.Comment: v1: 4 pages, 4 figures; v2: 10 pages, 7 figures, added results, text and reference

Analysis of the loop length distribution for the negative weight percolation problem in dimensions d=2 through 6

We consider the negative weight percolation (NWP) problem on hypercubic lattice graphs with fully periodic boundary conditions in all relevant dimensions from d=2 to the upper critical dimension d=6. The problem exhibits edge weights drawn from disorder distributions that allow for weights of either sign. We are interested in in the full ensemble of loops with negative weight, i.e. non-trivial (system spanning) loops as well as topologically trivial ("small") loops. The NWP phenomenon refers to the disorder driven proliferation of system spanning loops of total negative weight. While previous studies where focused on the latter loops, we here put under scrutiny the ensemble of small loops. Our aim is to characterize -using this extensive and exhaustive numerical study- the loop length distribution of the small loops right at and below the critical point of the hypercubic setups by means of two independent critical exponents. These can further be related to the results of previous finite-size scaling analyses carried out for the system spanning loops. For the numerical simulations we employed a mapping of the NWP model to a combinatorial optimization problem that can be solved exactly by using sophisticated matching algorithms. This allowed us to study here numerically exact very large systems with high statistics.Comment: 7 pages, 4 figures, 2 tables, paper summary available at http://www.papercore.org/Kajantie2000. arXiv admin note: substantial text overlap with arXiv:1003.1591, arXiv:1005.5637, arXiv:1107.174

Phase transitions in diluted negative-weight percolation models

We investigate the geometric properties of loops on two-dimensional lattice graphs, where edge weights are drawn from a distribution that allows for positive and negative weights. We are interested in the appearance of spanning loops of total negative weight. The resulting percolation problem is fundamentally different from conventional percolation, as we have seen in a previous study of this model for the undiluted case. Here, we investigate how the percolation transition is affected by additional dilution. We consider two types of dilution: either a certain fraction of edges exhibit zero weight, or a fraction of edges is even absent. We study these systems numerically using exact combinatorial optimization techniques based on suitable transformations of the graphs and applying matching algorithms. We perform a finite-size scaling analysis to obtain the phase diagram and determine the critical properties of the phase boundary. We find that the first type of dilution does not change the universality class compared to the undiluted case whereas the second type of dilution leads to a change of the universality class.Comment: 8 pages, 7 figure

Resiliently evolving supply-demand networks

Peer reviewedPublisher PD

Analysis of weighted networks

The connections in many networks are not merely binary entities, either present or not, but have associated weights that record their strengths relative to one another. Recent studies of networks have, by and large, steered clear of such weighted networks, which are often perceived as being harder to analyze than their unweighted counterparts. Here we point out that weighted networks can in many cases be analyzed using a simple mapping from a weighted network to an unweighted multigraph, allowing us to apply standard techniques for unweighted graphs to weighted ones as well. We give a number of examples of the method, including an algorithm for detecting community structure in weighted networks and a new and simple proof of the max-flow/min-cut theorem.Comment: 9 pages, 3 figure

Maximum flow and topological structure of complex networks

The problem of sending the maximum amount of flow $q$ between two arbitrary nodes $s$ and $t$ of complex networks along links with unit capacity is studied, which is equivalent to determining the number of link-disjoint paths between $s$ and $t$. The average of $q$ over all node pairs with smaller degree $k_{\rm min}$ is $_{k_{\rm min}} \simeq c k_{\rm min}$ for large $k_{\rm min}$ with $c$ a constant implying that the statistics of $q$ is related to the degree distribution of the network. The disjoint paths between hub nodes are found to be distributed among the links belonging to the same edge-biconnected component, and $q$ can be estimated by the number of pairs of edge-biconnected links incident to the start and terminal node. The relative size of the giant edge-biconnected component of a network approximates to the coefficient $c$. The applicability of our results to real world networks is tested for the Internet at the autonomous system level.Comment: 7 pages, 4 figure

Magnetoresistance behavior of a ferromagnetic shape memory alloy: Ni_1.75Mn_1.25Ga

A negative-positive-negative switching behavior of magnetoresistance (MR) with temperature is observed in a ferromagnetic shape memory alloy Ni_1.75Mn_1.25Ga. In the austenitic phase between 300 and 120 K, MR is negative due to s-d scattering. Curiously, below 120K MR is positive, while at still lower temperatures in the martensitic phase, MR is negative again. The positive MR cannot be explained by Lorentz contribution and is related to a magnetic transition. Evidence for this is obtained from ab initio density functional theory, a decrease in magnetization and resistivity upturn at 120 K. Theory shows that a ferrimagnetic state with anti-ferromagnetic alignment between the local magnetic moments of the Mn atoms is the energetically favoured ground state. In the martensitic phase, there are two competing factors that govern the MR behavior: a dominant negative trend up to the saturation field due to the decrease of electron scattering at twin and domain boundaries; and a weaker positive trend due to the ferrimagnetic nature of the magnetic state. MR exhibits a hysteresis between heating and cooling that is related to the first order nature of the martensitic phase transition.Comment: 17 pages, 5 figures. Accepted in Phys. Rev.

A Secure Image Encryption Algorithm Based on Hill Cipher System

We present a technique of image encryption based on Hill cipher system that provides better security than existing approach of Bibhudendra Acharya et al. by rendering the image content completely scrambled using multiple self-invertible keys, block shuffling and a new developed pel transformation. The Hill cipher algorithm is one of the symmetric key algorithms having several advantages in encryption. However, the inverse of the matrix used for encrypting the plain text in this algorithm may not always exist. Moreover this algorithm is susceptible to known plain text attack. Our proposed algorithm is aimed at better encryption of all types of images even ones with uniform background and makes the image encryption scheme more secure