8,779 research outputs found

    Cascades of Dynamical Transitions in an Adaptive Population

    Get PDF
    In an adaptive population which models financial markets and distributed control, we consider how the dynamics depends on the diversity of the agents' initial preferences of strategies. When the diversity decreases, more agents tend to adapt their strategies together. This change in the environment results in dynamical transitions from vanishing to non-vanishing step sizes. When the diversity decreases further, we find a cascade of dynamical transitions for the different signal dimensions, supported by good agreement between simulations and theory. Besides, the signal of the largest step size at the steady state is likely to be the initial signal.Comment: 4 pages, 8 figure

    Finite-Time Disentanglement via Spontaneous Emission

    Full text link
    We show that under the influence of pure vacuum noise two entangled qubits become completely disentangled in a finite time, and in a specific example we find the time to be given by ln(2+22)\ln \Big(\frac{2 +\sqrt 2}{2}\Big) times the usual spontaneous lifetime.Comment: revtex, 4 pages, 2 figure

    Application of design of experiment for modelling of etching of ceramics

    Get PDF
    These instructions give you guidelines for preparing papers for EnCon 2008. Use this document as a template if you are using Microsoft Word 6.0 or later. Otherwise, use this document as an instruction set. Define all symbols used in the abstract. Do not cite references in the abstract. Do not delete the blank line immediately above the abstract; it sets the footnote at the bottom of this column. The abstract text should be formatted using 9 point Times (or Times Roman, or Times New Roman). The abstract follows the addresses and should give readers concise information about the content of the article and indicate the main results obtained and conclusions drawn. It should be self-contained with no reference to figures, tables, equations or bibliographic references and should not normally exceed 200 words

    CSNL: A cost-sensitive non-linear decision tree algorithm

    Get PDF
    This article presents a new decision tree learning algorithm called CSNL that induces Cost-Sensitive Non-Linear decision trees. The algorithm is based on the hypothesis that nonlinear decision nodes provide a better basis than axis-parallel decision nodes and utilizes discriminant analysis to construct nonlinear decision trees that take account of costs of misclassification. The performance of the algorithm is evaluated by applying it to seventeen datasets and the results are compared with those obtained by two well known cost-sensitive algorithms, ICET and MetaCost, which generate multiple trees to obtain some of the best results to date. The results show that CSNL performs at least as well, if not better than these algorithms, in more than twelve of the datasets and is considerably faster. The use of bagging with CSNL further enhances its performance showing the significant benefits of using nonlinear decision nodes. The performance of the algorithm is evaluated by applying it to seventeen data sets and the results are compared with those obtained by two well known cost-sensitive algorithms, ICET and MetaCost, which generate multiple trees to obtain some of the best results to date. The results show that CSNL performs at least as well, if not better than these algorithms, in more than twelve of the data sets and is considerably faster. The use of bagging with CSNL further enhances its performance showing the significant benefits of using non-linear decision nodes

    Evorus: A Crowd-powered Conversational Assistant Built to Automate Itself Over Time

    Full text link
    Crowd-powered conversational assistants have been shown to be more robust than automated systems, but do so at the cost of higher response latency and monetary costs. A promising direction is to combine the two approaches for high quality, low latency, and low cost solutions. In this paper, we introduce Evorus, a crowd-powered conversational assistant built to automate itself over time by (i) allowing new chatbots to be easily integrated to automate more scenarios, (ii) reusing prior crowd answers, and (iii) learning to automatically approve response candidates. Our 5-month-long deployment with 80 participants and 281 conversations shows that Evorus can automate itself without compromising conversation quality. Crowd-AI architectures have long been proposed as a way to reduce cost and latency for crowd-powered systems; Evorus demonstrates how automation can be introduced successfully in a deployed system. Its architecture allows future researchers to make further innovation on the underlying automated components in the context of a deployed open domain dialog system.Comment: 10 pages. To appear in the Proceedings of the Conference on Human Factors in Computing Systems 2018 (CHI'18

    Perturbation Calculation of the Axial Anomaly of a Ginsparg-Wilson lattice Dirac operator

    Full text link
    A recent proposal suggests that even if a Ginsparg-Wilson lattice Dirac operator does not possess any topological zero modes in topologically-nontrivial gauge backgrounds, it can reproduce correct axial anomaly for sufficiently smooth gauge configurations, provided that it is exponentially-local, doublers-free, and has correct continuum behavior. In this paper, we calculate the axial anomaly of this lattice Dirac operator in weak coupling perturbation theory, and show that it recovers the topological charge density in the continuum limit.Comment: 25 pages, v2: calculation up to O(g^4) for nonabelian gauge backgroun
    corecore