21,836 research outputs found

    Emergent Fermi sea in a system of interacting bosons

    Full text link
    An understanding of the possible ways in which interactions can produce fundamentally new emergent many-body states is a central problem of condensed matter physics. We ask if a Fermi sea can arise in a system of bosons subject to contact interaction. Based on exact diagonalization studies and variational wave functions, we predict that such a state is likely to occur when a system of two-component bosons in two dimensions, interacting via a species independent contact interaction, is exposed to a synthetic magnetic field of strength that corresponds to a filling factor of unity. The fermions forming the SU(2) singlet Fermi sea are bound states of bosons and quantized vortices, formed as a result of the repulsive interaction between bosons in the lowest Landau level

    Convergence-Optimal Quantizer Design of Distributed Contraction-based Iterative Algorithms with Quantized Message Passing

    Full text link
    In this paper, we study the convergence behavior of distributed iterative algorithms with quantized message passing. We first introduce general iterative function evaluation algorithms for solving fixed point problems distributively. We then analyze the convergence of the distributed algorithms, e.g. Jacobi scheme and Gauss-Seidel scheme, under the quantized message passing. Based on the closed-form convergence performance derived, we propose two quantizer designs, namely the time invariant convergence-optimal quantizer (TICOQ) and the time varying convergence-optimal quantizer (TVCOQ), to minimize the effect of the quantization error on the convergence. We also study the tradeoff between the convergence error and message passing overhead for both TICOQ and TVCOQ. As an example, we apply the TICOQ and TVCOQ designs to the iterative waterfilling algorithm of MIMO interference game.Comment: 17 pages, 9 figures, Transaction on Signal Processing, accepte

    Distributive Stochastic Learning for Delay-Optimal OFDMA Power and Subband Allocation

    Full text link
    In this paper, we consider the distributive queue-aware power and subband allocation design for a delay-optimal OFDMA uplink system with one base station, KK users and NFN_F independent subbands. Each mobile has an uplink queue with heterogeneous packet arrivals and delay requirements. We model the problem as an infinite horizon average reward Markov Decision Problem (MDP) where the control actions are functions of the instantaneous Channel State Information (CSI) as well as the joint Queue State Information (QSI). To address the distributive requirement and the issue of exponential memory requirement and computational complexity, we approximate the subband allocation Q-factor by the sum of the per-user subband allocation Q-factor and derive a distributive online stochastic learning algorithm to estimate the per-user Q-factor and the Lagrange multipliers (LM) simultaneously and determine the control actions using an auction mechanism. We show that under the proposed auction mechanism, the distributive online learning converges almost surely (with probability 1). For illustration, we apply the proposed distributive stochastic learning framework to an application example with exponential packet size distribution. We show that the delay-optimal power control has the {\em multi-level water-filling} structure where the CSI determines the instantaneous power allocation and the QSI determines the water-level. The proposed algorithm has linear signaling overhead and computational complexity O(KN)\mathcal O(KN), which is desirable from an implementation perspective.Comment: To appear in Transactions on Signal Processin

    EFICAz²: enzyme function inference by a combined approach enhanced by machine learning

    Get PDF
    ©2009 Arakaki et al; licensee BioMed Central Ltd. This is an Open Access article distributed under the terms of the Creative Commons Attribution License (http://creativecommons.org/licenses/by/2.0), which permits unrestricted use, distribution, and reproduction in any medium, provided the original work is properly cited. The electronic version of this article is the complete one and can be found online at: http://www.biomedcentral.com/1471-2105/10/107doi:10.1186/1471-2105-10-107Background: We previously developed EFICAz, an enzyme function inference approach that combines predictions from non-completely overlapping component methods. Two of the four components in the original EFICAz are based on the detection of functionally discriminating residues (FDRs). FDRs distinguish between member of an enzyme family that are homofunctional (classified under the EC number of interest) or heterofunctional (annotated with another EC number or lacking enzymatic activity). Each of the two FDR-based components is associated to one of two specific kinds of enzyme families. EFICAz exhibits high precision performance, except when the maximal test to training sequence identity (MTTSI) is lower than 30%. To improve EFICAz's performance in this regime, we: i) increased the number of predictive components and ii) took advantage of consensual information from the different components to make the final EC number assignment. Results: We have developed two new EFICAz components, analogs to the two FDR-based components, where the discrimination between homo and heterofunctional members is based on the evaluation, via Support Vector Machine models, of all the aligned positions between the query sequence and the multiple sequence alignments associated to the enzyme families. Benchmark results indicate that: i) the new SVM-based components outperform their FDR-based counterparts, and ii) both SVM-based and FDR-based components generate unique predictions. We developed classification tree models to optimally combine the results from the six EFICAz components into a final EC number prediction. The new implementation of our approach, EFICAz², exhibits a highly improved prediction precision at MTTSI < 30% compared to the original EFICAz, with only a slight decrease in prediction recall. A comparative analysis of enzyme function annotation of the human proteome by EFICAz² and KEGG shows that: i) when both sources make EC number assignments for the same protein sequence, the assignments tend to be consistent and ii) EFICAz² generates considerably more unique assignments than KEGG. Conclusion: Performance benchmarks and the comparison with KEGG demonstrate that EFICAz² is a powerful and precise tool for enzyme function annotation, with multiple applications in genome analysis and metabolic pathway reconstruction. The EFICAz² web service is available at: http://cssb.biology.gatech.edu/skolnick/webservice/EFICAz2/index.htm

    Frequency Evolution of Neutron Peaks Below Tc: Commensurate and Incommensurate Structure in LaSrCuO and YBaCuO

    Full text link
    We study the evolution of the neutron cross-section with variable frequency ω\omega and fixed TT below TcT_c in two different cuprate families. Our calculations, which predominantly probe the role of d-wave pairing, lead to generic features, independent of Fermi surface shapes. Among our findings, reasonably consistent with experiment, are (i) for ω\omega near the gap energy Δ\Delta, both optimal {LaSrCuO} and slightly underdoped YBCO exhibit (comparably) incommensurate peaks (ii) peak sharpening below TcT_c is seen in {LaSrCuO}, (iii) quite generically, a frequency evolution from incommensurate to commensurate and then back to incommensurate structure is found with increasing ω\omega. Due to their narrow ω\omega regime of stability, commensurate peaks in {LaSrCuO} should be extremely difficult to observe.Comment: RevTex 5pages, 4figures; Manuscript rewritten, figures revised, and direct comparisons with experiments adde

    A Robust Study of Regression Methods for Crop Yield Data

    Get PDF
    The objective of this study is to evaluate the robust regression method when detrending the crop yield data. Using a Monte Carlo simulation method, the performance of the proposed Time-Varying Beta method is compared with the previous study of OLS, M-estimator and MM-estimator in an application of crop yield modeling. We analyze the properties of these estimators for outlier-contaminated data in both symmetric and skewed distribution case. The application of these estimation methods is illustrated in an agricultural insurance analysis. The consequence of obtaining more accurate detrending method will offer the potential to improve the accuracy of models used in rating crop insurance contracts.Research Methods/ Statistical Methods, Risk and Uncertainty,

    Time-varying Yield Distributions and the U.S. Crop Insurance Program

    Get PDF
    The objective of this study is to evaluate and model the yield risk associated with major agricultural commodities in the U.S. We are particularly concerned with the nonstationary nature of the yield distribution, which primarily arises because of technological progress and changing environmental conditions. Precise risk assessment depends on the accuracy of modeling this distribution. This problem becomes more challenging as the yield distribution changes over time, a condition that holds for nearly all major crops. A common approach to this problem is based on a two-stage method in which the yield is first detrended and then the estimated residuals are treated as observed data and modeled using various parametric or nonparametric methods. We propose an alternative parametric model that allows the moments of the yield distributions to change with time. Several model selection techniques suggest that the proposed time-varying model outperforms more conventional models in terms of in-sample goodness-of-fit, out-of- sample predictive power and the prediction accuracy of insurance premium rates.Risk and Uncertainty,
    • …
    corecore