In a recent paper we introduced a new framework for the study of call by need computations to normal form and root-stable form in term rewriting. Using elementary tree automata techniques and ground tree transducers we obtained simple decidability proofs for classes of rewrite systems that are much larger than earlier classes defined using the complicated sequentiality concept. In this paper we...

We study the computational difficulty of computing the ground state degeneracy and the density of states for local Hamiltonians. We show that the difficulty of both problems is exactly captured by a class which we call #BQP, which is the counting version of the quantum complexity class quantum Merlin Arthur. We show that #BQP is not harder than its classical counting counterpart #P, which in tu...

This study examined the effects of task complexity on written narrative production under different task complexity conditions by EFL learners at different proficiency levels. Task complexity was manipulated along Robinson’s (2001b) proposed task complexity dimension of Here-and-Now (simple) vs. There-and-Then (complex) in. Accordingly, three specific measures of the written narratives were targ...

the aim of this study is to show that the measures derived from electrocardiogram (ecg) signals many a time perform better than the same measures obtained from heart rate (hr) signals. a comparison was made to investigate how far the nonlinear symbolic dynamics approach helps to characterize the nonlinear properties of ecg signals and hr signals, and thereby discriminate between normal and cong...

As air traffic congestion grows, ground-holding (or "gate-holding") of aircraft is becoming increasingly common. Ground-holding is the practice of delaying the departure of a flight due to anticipated congestion at the airport of destination, because it is both less expensive and safer, for aircraft to wait on the ground, prior to take-off, than in the air. The problem of developing strategies ...

First-order Decision-theoretic Planning in Structured Relational Environments Scott Patrick Sanner Doctor of Philosophy Graduate Department of Computer Science University of Toronto 2008 We consider the general framework of first-order decision-theoretic planning in structured relational environments. Most traditional solution approaches to these planning problems ground the relational specific...

We study the computational complexity of estimating the ground state energy and simulating the adiabatic evolution for the transverse field Ising model (TIM). It is shown that the ground state energy problem for TIM on a degree-3 graph is complete for the complexity class StoqMA. This is an extension of the classical class MA where the verifier can accept quantum states as a proof and apply cla...

When conducting image registration in the U.S. state of Alaska, it is very difficult to locate satisfactory ground control points because ice, snow, and lakes cover much of the ground. However, GCPs can be located by seeking stable points from the extracted lake data. This paper defines a process to estimate the deepest points of lakes as the most stable ground control points for registration. ...

We present the vacuum of a two-dimensional conformal field theory as network Wilson lines in $SL(2,\mathbb{R})\ifmmode\times\else\texttimes\fi{}SL(2,\mathbb{R})$ Chern-Simons theory, which is conventionally used to study gravity three-dimensional anti--de Sitter space. The position and shape encode cutoff scale at ground state density operator defined. In framework query complexity, general arg...