Tour-based Travel Mode Choice Estimation based on Data Mining and Fuzzy Techniques

This paper extends tour-based mode choice model, which mainly includes individual trip level interactions, to include linked travel modes of consecutive trips of an individual. Travel modes of consecutive trip made by an individual in a household have strong dependency or co-relation because individuals try to maintain their travel modes or use a few combinations of modes for current and subsequent trips. Traditionally, tour based mode choice models involved nested logit models derived from expert knowledge. There are limitations associated with this approach. Logit models assumes i) specific model structure (linear utility model) in advance; and, ii) it holds across an entire historical observations. These assumptions about the predefined model may be representative of reality, however these rules or heuristics for tour based mode choice should ideally be derived from the survey data rather than based on expert knowledge/ judgment. Therefore, in this paper, we propose a novel data-driven methodology to address the issues identified in tour based mode choice. The proposed methodology is tested using the Household Travel Survey (HTS) data of Sydney metropolitan area and its performances are compared with the state-of-the-art approaches in this area

An Agent Based Model for the Simulation of Transport Demand and Land Use

Agent based modelling has emerged as a promising tool to provide planners with insights on social behaviour and the interdependencies characterising urban system, particularly with respect to transport and infrastructure planning. This paper presents an agent based model for the simulation of land use and transport demand of an urban area of Sydney, Australia. Each individual in the model has a travel diary which comprises a sequence of trips the person makes in a representative day as well as trip attributes such as travel mode, trip purpose, and departure time. Individuals are associated with each other by their household relationship, which helps define the interdependencies of their travel diary and constrains their mode choice. This allows the model to not only realistically reproduce how the current population uses existing transport infrastructure but more importantly provide comprehensive insight into future transport demands. The router of the traffic micro-simulator TRANSIMS is incorporated in the model to inform the actual travel time of each trip and changes of traffic density on the road network. Simulation results show very good agreement with survey data in terms of the distribution of trips done by transport modes and by trip purposes, as well as the traffic density along the main road in the study area

Partner orbits and action differences on compact factors of the hyperbolic plane. Part I: Sieber-Richter pairs

Physicists have argued that periodic orbit bunching leads to universal spectral fluctuations for chaotic quantum systems. To establish a more detailed mathematical understanding of this fact, it is first necessary to look more closely at the classical side of the problem and determine orbit pairs consisting of orbits which have similar actions. In this paper we specialize to the geodesic flow on compact factors of the hyperbolic plane as a classical chaotic system. We prove the existence of a periodic partner orbit for a given periodic orbit which has a small-angle self-crossing in configuration space which is a `2-encounter'; such configurations are called `Sieber-Richter pairs' in the physics literature. Furthermore, we derive an estimate for the action difference of the partners. In the second part of this paper [13], an inductive argument is provided to deal with higher-order encounters.Comment: to appear on Nonlinearit

Effects of lattice distortion and Jahn–Teller coupling on the magnetoresistance of La0.7Ca0.3MnO3 and La0.5Ca0.5CoO3 epitaxial films

Studies of La0.7Ca0.3MnO3 epitaxial films on substrates with a range of lattice constants reveal two dominant contributions to the occurrence of colossal negative magnetoresistance (CMR) in these manganites: at high temperatures (T → TC, TC being the Curie temperature), the magnetotransport properties are predominantly determined by the conduction of lattice polarons, while at low temperatures (T ≪ TC/, the residual negative magnetoresistance is correlated with the substrate-induced lattice distortion which incurs excess magnetic domain wall scattering. The importance of lattice polaron conduction associated with the presence of Jahn–Teller coupling in the manganites is further verified by comparing the manganites with epitaxial films of another ferromagnetic perovskite, La0.5Ca0.5CoO3. Regardless of the differences in the substrate-induced lattice distortion, the cobaltite films exhibit much smaller negative magnetoresistance, which may be attributed to the absence of Jahn–Teller coupling and the high electron mobility that prevents the formation of lattice polarons. We therefore suggest that lattice polaron conduction associated with the Jahn–Teller coupling is essential for the occurrence of CMR, and that lattice distortion further enhances the CMR effects in the manganites

Integer Vector Addition Systems with States

This paper studies reachability, coverability and inclusion problems for Integer Vector Addition Systems with States (ZVASS) and extensions and restrictions thereof. A ZVASS comprises a finite-state controller with a finite number of counters ranging over the integers. Although it is folklore that reachability in ZVASS is NP-complete, it turns out that despite their naturalness, from a complexity point of view this class has received little attention in the literature. We fill this gap by providing an in-depth analysis of the computational complexity of the aforementioned decision problems. Most interestingly, it turns out that while the addition of reset operations to ordinary VASS leads to undecidability and Ackermann-hardness of reachability and coverability, respectively, they can be added to ZVASS while retaining NP-completness of both coverability and reachability.Comment: 17 pages, 2 figure

The lowest eigenvalue of Jacobi random matrix ensembles and Painlev\'e VI

We present two complementary methods, each applicable in a different range, to evaluate the distribution of the lowest eigenvalue of random matrices in a Jacobi ensemble. The first method solves an associated Painleve VI nonlinear differential equation numerically, with suitable initial conditions that we determine. The second method proceeds via constructing the power-series expansion of the Painleve VI function. Our results are applied in a forthcoming paper in which we model the distribution of the first zero above the central point of elliptic curve L-function families of finite conductor and of conjecturally orthogonal symmetry.Comment: 30 pages, 2 figure

Radio Galaxy Zoo: Knowledge Transfer Using Rotationally Invariant Self-Organising Maps

With the advent of large scale surveys the manual analysis and classification of individual radio source morphologies is rendered impossible as existing approaches do not scale. The analysis of complex morphological features in the spatial domain is a particularly important task. Here we discuss the challenges of transferring crowdsourced labels obtained from the Radio Galaxy Zoo project and introduce a proper transfer mechanism via quantile random forest regression. By using parallelized rotation and flipping invariant Kohonen-maps, image cubes of Radio Galaxy Zoo selected galaxies formed from the FIRST radio continuum and WISE infrared all sky surveys are first projected down to a two-dimensional embedding in an unsupervised way. This embedding can be seen as a discretised space of shapes with the coordinates reflecting morphological features as expressed by the automatically derived prototypes. We find that these prototypes have reconstructed physically meaningful processes across two channel images at radio and infrared wavelengths in an unsupervised manner. In the second step, images are compared with those prototypes to create a heat-map, which is the morphological fingerprint of each object and the basis for transferring the user generated labels. These heat-maps have reduced the feature space by a factor of 248 and are able to be used as the basis for subsequent ML methods. Using an ensemble of decision trees we achieve upwards of 85.7% and 80.7% accuracy when predicting the number of components and peaks in an image, respectively, using these heat-maps. We also question the currently used discrete classification schema and introduce a continuous scale that better reflects the uncertainty in transition between two classes, caused by sensitivity and resolution limits

High-Order Methods for Computational Fluid Dynamics: A Brief Review of Compact Differential Formulations on Unstructured Grids

Popular high-order schemes with compact stencils for Computational Fluid Dynamics (CFD) include Discontinuous Galerkin (DG), Spectral Difference (SD), and Spectral Volume (SV) methods. The recently proposed Flux Reconstruction (FR) approach or Correction Procedure using Reconstruction (CPR) is based on a differential formulation and provides a unifying framework for these high-order schemes. Here we present a brief review of recent developments for the FR/CPR schemes as well as some pacing items

Unary Pushdown Automata and Straight-Line Programs

We consider decision problems for deterministic pushdown automata over a unary alphabet (udpda, for short). Udpda are a simple computation model that accept exactly the unary regular languages, but can be exponentially more succinct than finite-state automata. We complete the complexity landscape for udpda by showing that emptiness (and thus universality) is P-hard, equivalence and compressed membership problems are P-complete, and inclusion is coNP-complete. Our upper bounds are based on a translation theorem between udpda and straight-line programs over the binary alphabet (SLPs). We show that the characteristic sequence of any udpda can be represented as a pair of SLPs---one for the prefix, one for the lasso---that have size linear in the size of the udpda and can be computed in polynomial time. Hence, decision problems on udpda are reduced to decision problems on SLPs. Conversely, any SLP can be converted in logarithmic space into a udpda, and this forms the basis for our lower bound proofs. We show coNP-hardness of the ordered matching problem for SLPs, from which we derive coNP-hardness for inclusion. In addition, we complete the complexity landscape for unary nondeterministic pushdown automata by showing that the universality problem is $\Pi_2 \mathrm P$-hard, using a new class of integer expressions. Our techniques have applications beyond udpda. We show that our results imply $\Pi_2 \mathrm P$-completeness for a natural fragment of Presburger arithmetic and coNP lower bounds for compressed matching problems with one-character wildcards