Topological spin waves in the atomic-scale magnetic skyrmion crystal

We study the spin waves of the triangular skyrmion crystal that emerges in a two-dimensional spin lattice model as a result of the competition between Heisenberg exchange, Dzyalonshinkii–Moriya interactions, Zeeman coupling and uniaxial anisotropy. The calculated spin wave bands have a finite Berry curvature that, in some cases, leads to non-zero Chern numbers, making this system topologically distinct from conventional magnonic systems. We compute the edge spin-waves, expected from the bulk-boundary correspondence principle, and show that they are chiral, which makes them immune to elastic backscattering. Our results illustrate how topological phases can occur in self-generated emergent superlattices at the mesoscale.

A genetic estimation algorithm for parameters of stochastic ordinary differential equations

A generic method for the estimation of parameters for Stochastic Ordinary Differential Equations (SODEs) is introduced and developed. This algorithm, called the GePERs method, utilises a genetic optimisation algorithm to minimise a stochastic objective function based on the Kolmogorov-Smirnov statistic. Numerical simulations are utilised to form the KS statistic. Further, the examination of some of the factors that improve the precision of the estimates is conducted. This method is used to estimate parameters of diffusion equations and jump-diffusion equations. It is also applied to the problem of model selection for the Queensland electricity market. (C) 2003 Elsevier B.V. All rights reserved.

A modelling approach to estimate the effect of exotic pollinators on exotic weed population dynamics: bumblebees and broom in Australia

The role of mutualisms in contributing to species invasions is rarely considered, inhibiting effective risk analysis and management options. Potential ecological consequences of invasion of non-native pollinators include increased pollination and seed set of invasive plants, with subsequent impacts on population growth rates and rates of spread. We outline a quantitative approach for evaluating the impact of a proposed introduction of an invasive pollinator on existing weed population dynamics and demonstrate the use of this approach on a relatively data-rich case study: the impacts on Cytisus scoparius (Scotch broom) from proposed introduction of Bombus terrestris. Three models have been used to assess population growth (matrix model), spread speed (integrodifference equation), and equilibrium occupancy (lattice model) for C. scoparius. We use available demographic data for an Australian population to parameterize two of these models. Increased seed set due to more efficient pollination resulted in a higher population growth rate in the density-independent matrix model, whereas simulations of enhanced pollination scenarios had a negligible effect on equilibrium weed occupancy in the lattice model. This is attributed to strong microsite limitation of recruitment in invasive C. scoparius populations observed in Australia and incorporated in the lattice model. A lack of information regarding secondary ant dispersal of C. scoparius prevents us from parameterizing the integrodifference equation model for Australia, but studies of invasive populations in California suggest that spread speed will also increase with higher seed set. For microsite-limited C. scoparius populations, increased seed set has minimal effects on equilibrium site occupancy. However, for density-independent rapidly invading populations, increased seed set is likely to lead to higher growth rates and spread speeds. The impacts of introduced pollinators on native flora and fauna and the potential for promoting range expansion in pollinator-limited 'sleeper weeds' also remain substantial risks.

Anomalous Excitation Spectra of Frustrated Quantum Antiferromagnets

We use series expansions to study the excitation spectra of spin-1/2 antiferromagnets on anisotropic triangular lattices. For the isotropic triangular lattice model (TLM), the high-energy spectra show several anomalous features that differ strongly from linear spin-wave theory (LSWT). Even in the Neel phase, the deviations from LSWT increase sharply with frustration, leading to rotonlike minima at special wave vectors. We argue that these results can be interpreted naturally in a spinon language and provide an explanation for the previously observed anomalous finite-temperature properties of the TLM. In the coupled-chains limit, quantum renormalizations strongly enhance the one-dimensionality of the spectra, in agreement with experiments on Cs2CuCl4.

Paradoxical psychometric functions ("swan functions") are explained by dilution masking in four stimulus dimensions

The visual system dissects the retinal image into millions of local analyses along numerous visual dimensions. However, our perceptions of the world are not fragmentary, so further processes must be involved in stitching it all back together. Simply summing up the responses would not work because this would convey an increase in image contrast with an increase in the number of mechanisms stimulated. Here, we consider a generic model of signal combination and counter-suppression designed to address this problem. The model is derived and tested for simple stimulus pairings (e.g. A + B), but is readily extended over multiple analysers. The model can account for nonlinear contrast transduction, dilution masking, and signal combination at threshold and above. It also predicts nonmonotonic psychometric functions where sensitivity to signal A in the presence of pedestal B first declines with increasing signal strength (paradoxically dropping below 50% correct in two-interval forced choice), but then rises back up again, producing a contour that follows the wings and neck of a swan. We looked for and found these "swan" functions in four different stimulus dimensions (ocularity, space, orientation, and time), providing some support for our proposal.

A Differential Game Described by a Hyperbolic System

An antagonistic differential game of hyperbolic type with a separable linear vector pay-off function is considered. The main result is the description of all ε-Slater saddle points consisting of program strategies, program ε-Slater maximins and minimaxes for each ε ∈ R^N > for this game. To this purpose, the considered differential game is reduced to find the optimal program strategies of two multicriterial problems of hyperbolic type. The application of approximation enables us to relate these problems to a problem of optimal program control, described by a system of ordinary differential equations, with a scalar pay-off function. It is found that the result of this problem is not changed, if the players use positional or program strategies. For the considered differential game, it is interesting that the ε-Slater saddle points are not equivalent and there exist two ε-Slater saddle points for which the values of all components of the vector pay-off function at one of them are greater than the respective components of the other ε-saddle point.

Stability of Supporting and Exposing Elements of Convex Sets in Banach Spaces

* This work was supported by the CNR while the author was visiting the University of Milan.

Svájci rendszerű sakk csapatversenyek rangsorolása (Ranking in Swiss system chess team tournaments)

A cikk a páros összehasonlításokon alapuló pontozási eljárásokat alkalmazza svájci rendszerű sakk csapatversenyek eredményének meghatározására. Bemutatjuk a nem körmérkőzéses esetben felmerülő kérdéseket, az egyéni és csapatversenyek jellemzőit, valamint a hivatalos lexikografikus rendezések hibáit. Axiomatikus alapokon rangsorolási problémaként modellezzük a bajnokságokat, definícióinkat összekapcsoljuk a pontszám, az általánosított sorösszeg és a legkisebb négyzetek módszerének tulajdonságaival. A javasolt eljárást két sakkcsapat Európa-bajnokság részletes elemzésével illusztráljuk. A végső rangsorok összehasonlítását távolságfüggvények segítségével végezzük el, majd a sokdimenziós skálázás révén ábrázoljuk azokat. A hivatalos sorrendtől való eltérés okait a legkisebb négyzetek módszerének dekompozíciójával tárjuk fel. A sorrendeket három szempont, az előrejelző képesség, a mintailleszkedés és a robusztusság alapján értékeljük, és a legkisebb négyzetek módszerének alkalmas eredménymátrixszal történő használata mellett érvelünk. ____ The paper uses paired comparison-based scoring procedures in order to determine the result of Swiss system chess team tournaments. We present the main challenges of ranking in these tournaments, the features of individual and team competitions as well as the failures of official lexicographical orders. The tournament is represented as a ranking problem, our model is discussed with respect to the properties of the score, generalised row sum and least squares methods. The proposed method is illustrated with a detailed analysis of the two recent chess team European championships. Final rankings are compared through their distances and visualized by multidimensional scaling (MDS). Differences to official ranking are revealed due to the decomposition of least squares method. Rankings are evaluated by prediction accuracy, retrodictive performance, and stability. The paper argues for the use of least squares method with an appropriate generalised results matrix favouring match points.

Ranking in Swiss system chess team tournaments

The paper uses paired comparison-based scoring procedures for ranking the participants of a Swiss system chess team tournament. We present the main challenges of ranking in Swiss system, the features of individual and team competitions as well as the failures of official lexicographical orders. The tournament is represented as a ranking problem, our model is discussed with respect to the properties of the score, generalized row sum and least squares methods. The proposed procedure is illustrated with a detailed analysis of the two recent chess team European championships. Final rankings are compared by their distances and visualized with multidimensional scaling (MDS). Differences to official ranking are revealed by the decomposition of least squares method. Rankings are evaluated by prediction accuracy, retrodictive performance, and stability. The paper argues for the use of least squares method with a results matrix favoring match points.

Essays on international lending and increasing returns to scale

Standard economic theory suggests that capital should flow from rich countries to poor countries. However, capital has predominantly flowed to rich countries. The three essays in this dissertation attempt to explain this phenomenon. The first two essays suggest theoretical explanations for why capital has not flowed to the poor countries. The third essay empirically tests the theoretical explanations.^ The first essay examines the effects of increasing returns to scale on international lending and borrowing with moral hazard. Introducing increasing returns in a two-country general equilibrium model yields possible multiple equilibria and helps explain the possibility of capital flows from a poor to a rich country. I find that a borrowing country may need to borrow sufficient amounts internationally to reach a minimum investment threshold in order to invest domestically.^ The second essay examines how a poor country may invest in sectors with low productivity because of sovereign risk, and how collateral differences across sectors may exacerbate the problem. I model sovereign borrowing with a two-sector economy: one sector with increasing returns to scale (IRS) and one sector with diminishing returns to scale (DRS). Countries with incomes below a threshold will only invest in the DRS sector, and countries with incomes above a threshold will invest mostly in the IRS sector. The results help explain the existence of a bimodal world income distribution.^ The third essay empirically tests the explanations for why capital has not flowed from the rich to the poor countries, with a focus on institutions and initial capital. I find that institutional variables are a very important factor, but in contrast to other studies, I show that institutions do not account for the Lucas Paradox. Evidence of increasing returns still exists, even when controlling for institutions and other variables. In addition, I find that the determinants of capital flows may depend on whether a country is rich or poor.^

Physics of Hexagonal Limit-Periodic Phases: Thermodynamics, Formation and Vibrational Modes

Limit-periodic (LP) structures exhibit a type of nonperiodic order yet to be found in a natural material. A recent result in tiling theory, however, has shown that LP order can spontaneously emerge in a two-dimensional (2D) lattice model with nearest-and next-nearest-neighbor interactions. In this dissertation, we explore the question of what types of interactions can lead to a LP state and address the issue of whether the formation of a LP structure in experiments is possible. We study emergence of LP order in three-dimensional (3D) tiling models and bring the subject into the physical realm by investigating systems with realistic Hamiltonians and low energy LP states. Finally, we present studies of the vibrational modes of a simple LP ball and spring model whose results indicate that LP materials would exhibit novel physical properties.

A 2D lattice model defined on a triangular lattice with nearest- and next-nearest-neighbor interactions based on the Taylor-Socolar (TS) monotile is known to have a LP ground state. The system reaches that state during a slow quench through an infinite sequence of phase transitions. Surprisingly, even when the strength of the next-nearest-neighbor interactions is zero, in which case there is a large degenerate class of both crystalline and LP ground states, a slow quench yields the LP state. The first study in this dissertation introduces 3D models closely related to the 2D models that exhibit LP phases. The particular 3D models were designed such that next-nearest-neighbor interactions of the TS type are implemented using only nearest-neighbor interactions. For one of the 3D models, we show that the phase transitions are first order, with equilibrium structures that can be more complex than in the 2D case.

In the second study, we investigate systems with physical Hamiltonians based on one of the 2D tiling models with the goal of stimulating attempts to create a LP structure in experiments. We explore physically realizable particle designs while being mindful of particular features that may make the assembly of a LP structure in an experimental system difficult. Through Monte Carlo (MC) simulations, we have found that one particle design in particular is a promising template for a physical particle; a 2D system of identical disks with embedded dipoles is observed to undergo the series of phase transitions which leads to the LP state.

LP structures are well ordered but nonperiodic, and hence have nontrivial vibrational modes. In the third section of this dissertation, we study a ball and spring model with a LP pattern of spring stiffnesses and identify a set of extended modes with arbitrarily low participation ratios, a situation that appears to be unique to LP systems. The balls that oscillate with large amplitude in these modes live on periodic nets with arbitrarily large lattice constants. By studying periodic approximants to the LP structure, we present numerical evidence for the existence of such modes, and we give a heuristic explanation of their structure.

Fermion Mass Generation without Spontaneous Symmetry Breaking

The conventional mechanism of fermion mass generation in the Standard Model involves Spontaneous Symmetry Breaking (SSB). In this thesis, we study an alternate mechanism for the generation of fermion masses that does not require SSB, in the context of lattice field theories. Being inherently strongly coupled, this mechanism requires a non-perturbative approach like the lattice approach.

In order to explore this mechanism, we study a simple lattice model with a four-fermion interaction that has massless fermions at weak couplings and massive fermions at strong couplings, but without any spontaneous symmetry breaking. Prior work on this type of mass generation mechanism in 4D, was done long ago using either mean-field theory or Monte-Carlo calculations on small lattices. In this thesis, we have developed a new computational approach that enables us to perform large scale quantum Monte-Carlo calculations to study the phase structure of this theory. In 4D, our results confirm prior results, but differ in some quantitative details of the phase diagram. In contrast, in 3D, we discover a new second order critical point using calculations on lattices up to size $ 60^3$. Such large scale calculations are unprecedented. The presence of the critical point implies the existence of an alternate mechanism of fermion mass generation without any SSB, that could be of interest in continuum quantum field theory.

Scheduling of track inspection and maintenance activities in railroad networks

The U.S. railroad companies spend billions of dollars every year on railroad track maintenance in order to ensure safety and operational efficiency of their railroad networks. Besides maintenance costs, other costs such as train accident costs, train and shipment delay costs and rolling stock maintenance costs are also closely related to track maintenance activities. Optimizing the track maintenance process on the extensive railroad networks is a very complex problem with major cost implications. Currently, the decision making process for track maintenance planning is largely manual and primarily relies on the knowledge and judgment of experts. There is considerable potential to improve the process by using operations research techniques to develop solutions to the optimization problems on track maintenance. In this dissertation study, we propose a range of mathematical models and solution algorithms for three network-level scheduling problems on track maintenance: track inspection scheduling problem (TISP), production team scheduling problem (PTSP) and job-to-project clustering problem (JTPCP). TISP involves a set of inspection teams which travel over the railroad network to identify track defects. It is a large-scale routing and scheduling problem where thousands of tasks are to be scheduled subject to many difficult side constraints such as periodicity constraints and discrete working time constraints. A vehicle routing problem formulation was proposed for TISP, and a customized heuristic algorithm was developed to solve the model. The algorithm iteratively applies a constructive heuristic and a local search algorithm in an incremental scheduling horizon framework. The proposed model and algorithm have been adopted by a Class I railroad in its decision making process. Real-world case studies show the proposed approach outperforms the manual approach in short-term scheduling and can be used to conduct long-term what-if analyses to yield managerial insights. PTSP schedules capital track maintenance projects, which are the largest track maintenance activities and account for the majority of railroad capital spending. A time-space network model was proposed to formulate PTSP. More than ten types of side constraints were considered in the model, including very complex constraints such as mutual exclusion constraints and consecution constraints. A multiple neighborhood search algorithm, including a decomposition and restriction search and a block-interchange search, was developed to solve the model. Various performance enhancement techniques, such as data reduction, augmented cost function and subproblem prioritization, were developed to improve the algorithm. The proposed approach has been adopted by a Class I railroad for two years. Our numerical results show the model solutions are able to satisfy all hard constraints and most soft constraints. Compared with the existing manual procedure, the proposed approach is able to bring significant cost savings and operational efficiency improvement. JTPCP is an intermediate problem between TISP and PTSP. It focuses on clustering thousands of capital track maintenance jobs (based on the defects identified in track inspection) into projects so that the projects can be scheduled in PTSP. A vehicle routing problem based model and a multiple-step heuristic algorithm were developed to solve this problem. Various side constraints such as mutual exclusion constraints and rounding constraints were considered. The proposed approach has been applied in practice and has shown good performance in both solution quality and efficiency.

Modelo origen destino para estimar el flujo de tráfico usando algoritmos genéticos

En este trabajo se ha desarrollado un nuevo método basado en Inteligencia Artificial para resolver un problema del matriz origen-destino (O-D) aplicado al caso de una red de tráfico vehicular en la ciudad de Ambato. El método implementado, basado en algoritmos genéticos (AG), resuelve el problema de minimización asociado al problema de matriz O-D. Para validar la técnica, se ha utilizado una red vial correspondiente a la zona del Mercado Modelo en la ciudad de Ambato, que es una zona de alta congestión vehicular.

Planar Odometry from a Radial Laser Scanner. A Range Flow-based Approach

In this paper we present a fast and precise method to estimate the planar motion of a lidar from consecutive range scans. For every scanned point we formulate the range flow constraint equation in terms of the sensor velocity, and minimize a robust function of the resulting geometric constraints to obtain the motion estimate. Conversely to traditional approaches, this method does not search for correspondences but performs dense scan alignment based on the scan gradients, in the fashion of dense 3D visual odometry. The minimization problem is solved in a coarse-to-fine scheme to cope with large displacements, and a smooth filter based on the covariance of the estimate is employed to handle uncertainty in unconstraint scenarios (e.g. corridors). Simulated and real experiments have been performed to compare our approach with two prominent scan matchers and with wheel odometry. Quantitative and qualitative results demonstrate the superior performance of our approach which, along with its very low computational cost (0.9 milliseconds on a single CPU core), makes it suitable for those robotic applications that require planar odometry. For this purpose, we also provide the code so that the robotics community can benefit from it.