Search results for "Generalization"
showing 10 items of 250 documents
Quantum counter automata
2011
The question of whether quantum real-time one-counter automata (rtQ1CAs) can outperform their probabilistic counterparts has been open for more than a decade. We provide an affirmative answer to this question, by demonstrating a non-context-free language that can be recognized with perfect soundness by a rtQ1CA. This is the first demonstration of the superiority of a quantum model to the corresponding classical one in the real-time case with an error bound less than 1. We also introduce a generalization of the rtQ1CA, the quantum one-way one-counter automaton (1Q1CA), and show that they too are superior to the corresponding family of probabilistic machines. For this purpose, we provide gene…
Improved SOM Learning using Simulated Annealing
2007
Self-Organizing Map (SOM) algorithm has been extensively used for analysis and classification problems. For this kind of problems, datasets become more and more large and it is necessary to speed up the SOM learning. In this paper we present an application of the Simulated Annealing (SA) procedure to the SOM learning algorithm. The goal of the algorithm is to obtain fast learning and better performance in terms of matching of input data and regularity of the obtained map. An advantage of the proposed technique is that it preserves the simplicity of the basic algorithm. Several tests, carried out on different large datasets, demonstrate the effectiveness of the proposed algorithm in comparis…
Branch-and-cut algorithms for the vehicle routing problem with trailers and transshipments
2013
This article studies the vehicle routing problem with trailers and transshipments VRPTT, a practically relevant, but challenging, generalization of the classical vehicle routing problem. The article makes three contributions: i Building on a nontrivial network representation, two mixed-integer programming formulations for the VRPTT are proposed. ii Based on these formulations, five different branch-and-cut algorithms are developed and implemented. iii The computational behavior of the algorithms is analyzed in an extensive computational study, using a large number of test instances designed to resemble real-world VRPTTs.Copyright © 2013 Wiley Periodicals, Inc. NETWORKS, Vol. 631, 119-133 20…
Wronskian and Casorati determinant representations for Darboux–Pöschl–Teller potentials and their difference extensions
2009
We consider some special reductions of generic Darboux?Crum dressing formulae and of their difference versions. As a matter of fact, we obtain some new formulae for Darboux?P?schl?Teller (DPT) potentials by means of Wronskian determinants. For their difference deformations (called DDPT-I and DDPT-II potentials) and the related eigenfunctions, we obtain new formulae described by the ratios of Casorati determinants given by the functional difference generalization of the Darboux?Crum dressing formula.
New approach to numerical computation of the eigenfunctions of the continuous spectrum of three-particle Schrödinger operator: I. One-dimensional par…
2009
Basing on analogy between the three-body scattering problem and the diffraction problem of the plane wave (for the case of the short range pair potentials) by the system of six half transparent screens, we presented a new approach to the few-body scattering problem. The numerical results have been obtained for the case of the short range nonnegative pair potentials. The presented method allows a natural generalization to the case of the long range pair potentials.
Cotas inferiores para el QAP-Arbol
1985
The Tree-QAP is a special case of the Quadratic Assignment Problem where the flows not equal zero form a tree. No condition is required for the distance matrix. In this paper we present an integer programming formulation for the Tree-QAP. We use this formulation to construct four Lagrangean relaxations that produce several lower bounds for this problem. To solve one of the relaxed problems we present a Dynamic Programming algorithm which is a generalization of the algorithm of this type that gives a lower bound for the Travelling Salesman Problem. A comparison is given between the lower bounds obtained by each ralaxation for examples with size from 12 to 25.
The multichoice consistent value
2000
We consider multichoice NTU games, i.e., cooperative NTU games in which players can participate in the game with several levels of activity. For these games, we define and characterize axiomatically the multichoice consistent value, which is a generalization of the consistent NTU value for NTU games and of the multichoice value for multichoice TU games. Moreover, we show that this value coincides with the consistent NTU value of a replicated NTU game and we provide a probabilistic interpretation.
Extending conventional priors for testing general hypotheses in linear models
2007
We consider that observations come from a general normal linear model and that it is desirable to test a simplifying null hypothesis about the parameters. We approach this problem from an objective Bayesian, model-selection perspective. Crucial ingredients for this approach are 'proper objective priors' to be used for deriving the Bayes factors. Jeffreys-Zellner-Siow priors have good properties for testing null hypotheses defined by specific values of the parameters in full-rank linear models. We extend these priors to deal with general hypotheses in general linear models, not necessarily of full rank. The resulting priors, which we call 'conventional priors', are expressed as a generalizat…
Haldane Model at finite temperature
2019
We consider the Haldane model, a 2D topological insulator whose phase is defined by the Chern number. We study its phases as temperature varies by means of the Uhlmann number, a finite temperature generalization of the Chern number. Because of the relation between the Uhlmann number and the dynamical transverse conductivity of the system, we evaluate also the conductivity of the model. This analysis does not show any sign of a phase transition induced by the temperature, nonetheless it gives a better understanding of the fate of the topological phase with the increase of the temperature, and it provides another example of the usefulness of the Uhlmann number as a novel tool to study topolog…
Ito and Stratonovich integrals for delta-correlated processes
1993
Abstract In this paper the generalization of the Itd and Stratonovich integrals for the case of non-linear systems excited by parametric delta-correlated processes is presented. This generalization gives a new light on the corrective coefficients in the stochastic differential equations driven by parametric delta-correlated processes. The full significance of these corrective terms is evidenced by means of some examples.