Remote Sensing/gis Integration for Site Planning and Resource Management

The development of an interactive/batch gridded information system (array of cells georeferenced to USGS quad sheets) and interfacing application programs (e.g., hydrologic models) is discussed. This system allows non-programer users to request any data set(s) stored in the data base by inputing any random polygon's (watershed, political zone) boundary points. The data base information contained within this polygon can be used to produce maps, statistics, and define model parameters for the area. Present/proposed conditions for the area may be compared by inputing future usage (land cover, soils, slope, etc.). This system, known as the Hydrologic Analysis Program (HAP), is especially effective in the real time analysis of proposed land cover changes on runoff hydrographs and graphics/statistics resource inventories of random study area/watersheds

Site participation in the small community experiment

The Small Community Solar Thermal Experiment, planned to test a small, developmental solar thermal power plant in a small community application, is assessed. The baseline plan is to install a field of parabolic dishes with distributed generation to provide 1 MWe of experimental power. Participation by the site proposer is an integral element of the experiment; the proposer will provide a ten-acre site, a connection to the electrical distributional system serving the small community, and various services. In addition to the primary participant, site study efforts may be pursued at as many as five alternative sites

Parameterizing by the Number of Numbers

The usefulness of parameterized algorithmics has often depended on what Niedermeier has called, "the art of problem parameterization". In this paper we introduce and explore a novel but general form of parameterization: the number of numbers. Several classic numerical problems, such as Subset Sum, Partition, 3-Partition, Numerical 3-Dimensional Matching, and Numerical Matching with Target Sums, have multisets of integers as input. We initiate the study of parameterizing these problems by the number of distinct integers in the input. We rely on an FPT result for ILPF to show that all the above-mentioned problems are fixed-parameter tractable when parameterized in this way. In various applied settings, problem inputs often consist in part of multisets of integers or multisets of weighted objects (such as edges in a graph, or jobs to be scheduled). Such number-of-numbers parameterized problems often reduce to subproblems about transition systems of various kinds, parameterized by the size of the system description. We consider several core problems of this kind relevant to number-of-numbers parameterization. Our main hardness result considers the problem: given a non-deterministic Mealy machine M (a finite state automaton outputting a letter on each transition), an input word x, and a census requirement c for the output word specifying how many times each letter of the output alphabet should be written, decide whether there exists a computation of M reading x that outputs a word y that meets the requirement c. We show that this problem is hard for W[1]. If the question is whether there exists an input word x such that a computation of M on x outputs a word that meets c, the problem becomes fixed-parameter tractable

A simple linear-time algorithm for finding path-decompositions of small width

We described a simple algorithm running in linear time for each fixed constant $k$, that either establishes that the pathwidth of a graph $G$ is greater than $k$, or finds a path-decomposition of $G$ of width at most $O(2^{k})$. This provides a simple proof of the result by Bodlaender that many families of graphs of bounded pathwidth can be recognized in linear time.Comment: 9 page

Obstructions to within a few vertices or edges of acyclic

Finite obstruction sets for lower ideals in the minor order are guaranteed to exist by the Graph Minor Theorem. It has been known for several years that, in principle, obstruction sets can be mechanically computed for most natural lower ideals. In this paper, we describe a general-purpose method for finding obstructions by using a bounded treewidth (or pathwidth) search. We illustrate this approach by characterizing certain families of cycle-cover graphs based on the two well-known problems: $k$-{\sc Feedback Vertex Set} and $k$-{\sc Feedback Edge Set}. Our search is based on a number of algorithmic strategies by which large constants can be mitigated, including a randomized strategy for obtaining proofs of minimality.Comment: 16 page

A New Two-Parameter Family of Potentials with a Tunable Ground State

In a previous paper we solved a countably infinite family of one-dimensional Schr\"odinger equations by showing that they were supersymmetric partner potentials of the standard quantum harmonic oscillator. In this work we extend these results to find the complete set of real partner potentials of the harmonic oscillator, showing that these depend upon two continuous parameters. Their spectra are identical to that of the harmonic oscillator, except that the ground state energy becomes a tunable parameter. We finally use these potentials to analyse the physical problem of Bose-Einstein condensation in an atomic gas trapped in a dimple potential.Comment: 15 pages, 5 figure

Unbinding of giant vortices in states of competing order

Funding: EPSRC (UK) via Grants No. EP/I031014/1 and No. EP/H049584/1.We consider a two-dimensional system with two order parameters, one with O(2) symmetry and one with O(M), near a point in parameter space where they couple to become a single O(2+M) order. While the O(2) sector supports vortex excitations, these vortices must somehow disappear as the high symmetry point is approached. We develop a variational argument which shows that the size of the vortex cores diverges as 1/root Delta and the Berezinskii-Kosterlitz-Thouless transition temperature of the O(2) order vanishes as 1/1n(1/Delta), where Delta denotes the distance from the high-symmetry point. Our physical picture is confirmed by a renormalization group analysis which gives further logarithmic corrections, and demonstrates full symmetry restoration within the cores.Publisher PDFPeer reviewe

The Role of ATP-Sensitive Inward Rectifier Potassium Channels In The Regulation of Reactive Oxygen Species In The Western Honey Bee, APIS Mellifera L.

Colonies of managed honey bees are annually being lost at an unsustainable rate, partly due to reduced immunocompetence that leads to acute viral outbreaks and mortality. To aid in restoring honey bee health despite the myriad of environmental stressors, this thesis focuses on identifying novel physiological pathways that can mitigate virus-mediated mortality through increased immune function. Previous work has demonstrated that a family of potassium ion channels, termed KATP channels, mediate the survival of honey bees during infection from a model virus, suggesting KATP channels may drive antiviral immunity. Interestingly, these channels have been linked to the regulation of reactive oxygen species (ROS), which are known to function as an immune system stimulator during virus infection. Thus, the overarching goal of this thesis study was to validate the linkage between KATP channels, ROS, and bee survivorship. Our findings in this thesis provide evidence that pinacidil, a KATP channel activator, is capable of dramatically reducing antioxidant levels in bees during chemically-induced ROS, suggesting KATP channels play a part in regulating levels of ROS. Further, mortality was significantly reduced in bees from colonies that had heavy mite infestations, which supports the notion that ROS is an intermediate molecule for immune health. While additional investigation is required to fully characterize the relationship between KATP channels, ROS, and antiviral immunity, this study has begun to fill significant gaps in knowledge pertaining to mechanisms honey bees use to regulate their antiviral immune response