70,321 research outputs found

    Structural graph matching using the EM algorithm and singular value decomposition

    Get PDF
    This paper describes an efficient algorithm for inexact graph matching. The method is purely structural, that is, it uses only the edge or connectivity structure of the graph and does not draw on node or edge attributes. We make two contributions: 1) commencing from a probability distribution for matching errors, we show how the problem of graph matching can be posed as maximum-likelihood estimation using the apparatus of the EM algorithm; and 2) we cast the recovery of correspondence matches between the graph nodes in a matrix framework. This allows one to efficiently recover correspondence matches using the singular value decomposition. We experiment with the method on both real-world and synthetic data. Here, we demonstrate that the method offers comparable performance to more computationally demanding method

    Probing the QCD Critical Point with Higher Moments of Net-proton Multiplicity Distributions

    Full text link
    Higher moments of event-by-event net-proton multiplicity distributions are applied to search for the QCD critical point in the heavy ion collisions. It has been demonstrated that higher moments as well as moment products are sensitive to the correlation length and directly connected to the thermodynamic susceptibilities computed in the Lattice QCD and Hadron Resonance Gas (HRG) model. In this paper, we will present measurements for kurtosis (κ\kappa), skewness (SS) and variance (σ2\sigma^{2}) of net-proton multiplicity distributions at the mid-rapidity (y<0.5|y|<0.5) and 0.4<pT<0.80.4<p_{T}<0.8 GeV/cc for Au+Au collisions at sNN\sqrt{s_{NN}}=19.6, 39, 62.4, 130 and 200 GeV, Cu+Cu collisions at sNN\sqrt{s_{NN}}=22.4, 62.4 and 200 GeV, d+Au collisions at sNN\sqrt{s_{NN}}=200 GeV and p+p collisions at sNN\sqrt{s_{NN}}=62.4 and 200 GeV. The moment products κσ2\kappa \sigma^{2} and SσS \sigma of net-proton distributions, which are related to volume independent baryon number susceptibility ratio, are compared to the Lattice QCD and HRG model calculations. The κσ2\kappa \sigma^{2} and SσS \sigma of net-proton distributions are consistent with Lattice QCD and HRG model calculations at high energy, which support the thermalization of the colliding system. Deviations of κσ2\kappa \sigma^{2} and SσS \sigma for the Au+Au collisions at low energies from HRG model calculations are also observed.Comment: 10 pages, 8 figures, Proceedings of 27th Winter Workshon on Nuclear Dynamics. Feb. 6-13 (2011

    Transmit Power Minimization for Wireless Networks with Energy Harvesting Relays

    Full text link
    Energy harvesting (EH) has recently emerged as a key technology for green communications as it can power wireless networks with renewable energy sources. However, directly replacing the conventional non-EH transmitters by EH nodes will be a challenge. In this paper, we propose to deploy extra EH nodes as relays over an existing non-EH network. Specifically, the considered non-EH network consists of multiple source-destination (S-D) pairs. The deployed EH relays will take turns to assist each S-D pair, and energy diversity can be achieved to combat the low EH rate of each EH relay. To make the best of these EH relays, with the source transmit power minimization as the design objective, we formulate a joint power assignment and relay selection problem, which, however, is NP-hard. We thus propose a general framework to develop efficient sub-optimal algorithms, which is mainly based on a sufficient condition for the feasibility of the optimization problem. This condition yields useful design insights and also reveals an energy hardening effect, which provides the possibility to exempt the requirement of non-causal EH information. Simulation results will show that the proposed cooperation strategy can achieve near-optimal performance and provide significant power savings. Compared to the greedy cooperation method that only optimizes the performance of the current transmission block, the proposed strategy can achieve the same performance with much fewer relays, and the performance gap increases with the number of S-D pairs.Comment: 14 pages, 5 figures, accepted by IEEE Transactions on Communication

    Training Optimization for Energy Harvesting Communication Systems

    Full text link
    Energy harvesting (EH) has recently emerged as an effective way to solve the lifetime challenge of wireless sensor networks, as it can continuously harvest energy from the environment. Unfortunately, it is challenging to guarantee a satisfactory short-term performance in EH communication systems because the harvested energy is sporadic. In this paper, we consider the channel training optimization problem in EH communication systems, i.e., how to obtain accurate channel state information to improve the communication performance. In contrast to conventional communication systems, the optimization of the training power and training period in EH communication systems is a coupled problem, which makes such optimization very challenging. We shall formulate the optimal training design problem for EH communication systems, and propose two solutions that adaptively adjust the training period and power based on either the instantaneous energy profile or the average energy harvesting rate. Numerical and simulation results will show that training optimization is important in EH communication systems. In particular, it will be shown that for short block lengths, training optimization is critical. In contrast, for long block lengths, the optimal training period is not too sensitive to the value of the block length nor to the energy profile. Therefore, a properly selected fixed training period value can be used.Comment: 6 pages, 5 figures, Globecom 201

    The Critical Exponent θ\theta' in Spin Glasses

    Full text link
    Short-time dynamic scaling behavior of the 3D ±J\pm J Ising spin glass is studied by Monte Carlo methods. Starting the replicas with independent initial configurations with a small pseudo magnetization, the dynamic evolution of the overlap q(t) between two replicas is measured. The initial increase of the overlap q(t) is observed and the corresponding exponent θ\theta' is obtained. From the scaling relation λ=d/zθ\lambda =d/z-\theta', the dynamic exponent z is estimated.Comment: to appear in Mod. Phys. Lett.

    Trivial Constraints on Orbital-free Kinetic Energy Density Functionals

    Full text link
    Kinetic energy density functionals (KEDFs) are central to orbital-free density functional theory. Limitations on the spatial derivative dependencies of KEDFs have been claimed from differential virial theorems. We point out a central defect in the argument: the relationships are not true for an arbitrary density but hold only for the minimizing density and corresponding chemical potential. Contrary to the claims therefore, the relationships are not constraints and provide no independent information about the spatial derivative dependencies of approximate KEDFs. A simple argument also shows that validity for arbitrary vv-representable densities is not restored by appeal to the density-potential bijection.Comment: 5 page

    Constricted channel flow with different cross-section shapes

    Get PDF
    Pressure driven steady flow through a uniform circular channel containing a constricted portion is a common problem considering physiological flows such as underlying human speech sound production. The influence of the constriction’s cross-section shape (circle, ellipse, circular sector) on the flow within and downstream from the constriction is experimentally quantified. An analytical boundary layer flow model is proposed which takes into account the hydraulic diameter of the cross-section shape. Comparison of the model outcome with experimental and three-dimensional numerically simulated flow data shows that the pressure distribution within the constriction can be modeled accurately so that the model is of interest for analytical models of fluid–structure interaction without the assumption of two-dimensional flow
    corecore