Forecast Combinations

We consider combinations of subjective survey forecasts and model-based forecasts from linear and non-linear univariate specifications as well as multivariate factor-augmented models. Empirical results suggest that a simple equal-weighted average of survey forecasts outperform the best model-based forecasts for a majority of macroeconomic variables and forecast horizons. Additional improvements can in some cases be gained by using a simple equal-weighted average of survey and model-based forecasts. We also provide an analysis of the importance of model instability for explaining gains from forecast combination. Analytical and simulation results uncover break scenarios where forecast combinations outperform the best individual forecasting model.Factor Based Forecasts, Non-linear Forecasts, Structural Breaks, Survey Forecasts, Univariate Forecasts.

NATCracker: NAT Combinations Matter

In this paper, we report our experience in working with Network Address Translators (NATs). Traditionally, there were only 4 types of NATs. For each type, the (im)possibility of traversal is well-known. Recently, the NAT community has provided a deeper dissection of NAT behaviors resulting into at least 27 types and documented the (im)possibility of traversal for some types. There are, however, two fundamental issues that were not previously tackled by the community. First, given the more elaborate set of behaviors, it is incorrect to reason about traversing a single NAT, instead combinations must be considered and we have not found any study that comprehensively states, for every possible combination, whether direct connectivity with no relay is feasible. Such a statement is the first outcome of the paper. Second, there is a serious need for some kind of formalism to reason about NATs which is a second outcome of this paper. The results were obtained using our own scheme which is an augmentation of currently-known traversal methods. The scheme is validated by reasoning using our formalism, simulation and implementation in a real P2P network

Quantum Entanglement in Concept Combinations

Research in the application of quantum structures to cognitive science confirms that these structures quite systematically appear in the dynamics of concepts and their combinations and quantum-based models faithfully represent experimental data of situations where classical approaches are problematical. In this paper, we analyze the data we collected in an experiment on a specific conceptual combination, showing that Bell's inequalities are violated in the experiment. We present a new refined entanglement scheme to model these data within standard quantum theory rules, where 'entangled measurements and entangled evolutions' occur, in addition to the expected 'entangled states', and present a full quantum representation in complex Hilbert space of the data. This stronger form of entanglement in measurements and evolutions might have relevant applications in the foundations of quantum theory, as well as in the interpretation of nonlocality tests. It could indeed explain some non-negligible 'anomalies' identified in EPR-Bell experiments.Comment: 16 pages, no figure

Factorized Combinations of Virasoro Characters

We investigate linear combinations of characters for minimal Virasoro models which are representable as a products of several basic blocks. Our analysis is based on consideration of asymptotic behaviour of the characters in the quasi-classical limit. In particular, we introduce a notion of the secondary effective central charge. We find all possible cases for which factorization occurs on the base of the Gauss-Jacobi or the Watson identities. Exploiting these results, we establish various types of identities between different characters. In particular, we present several identities generalizing the Rogers-Ramanujan identities. Applications to quasi-particle representations, modular invariant partition functions, super-conformal theories and conformal models with boundaries are briefly discussed.Comment: 25 pages (LaTex), minor corrections, one reference adde

Linear combinations of graph eigenvalues

Let F(G) be a fixed linear combination of the k extremal eigenvalues of a graph G and of its complement. The problem of finding max{F(G):v(G)=n} generalizes a number of problems raised previously in the literature. We show that the limit max{F(G):v(G)=n}/n exists when n tends to infinity. We also answer a question of Gernert about the sum of the two maximal eigenvalues of a graph.Comment: Some calculation errors from the first version have been correcte

Optimal combinations of imperfect objects

We address the question of how to make best use of imperfect objects, such as defective analog and digital components. We show that perfect, or near-perfect, devices can be constructed by taking combinations of such defects. Any remaining objects can be recycled efficiently. In addition to its practical applications, our `defect combination problem' provides a novel generalization of classical optimization problems.Comment: 4 pages, 3 figures, minor change