Eclipse radius measurements

Methods for predicting the path edges and reducing observations of total solar eclipses for determining variations of the solar radius are described. Analyzed observations of the 1925 January eclipse show a 0.7 (arc second) decrease in the solar radius during the past fifty years

Improved accuracies for satellite tracking

A charge coupled device (CCD) camera on an optical telescope which follows the stars can be used to provide high accuracy comparisons between the line of sight to a satellite, over a large range of satellite altitudes, and lines of sight to nearby stars. The CCD camera can be rotated so the motion of the satellite is down columns of the CCD chip, and charge can be moved from row to row of the chip at a rate which matches the motion of the optical image of the satellite across the chip. Measurement of satellite and star images, together with accurate timing of charge motion, provides accurate comparisons of lines of sight. Given lines of sight to stars near the satellite, the satellite line of sight may be determined. Initial experiments with this technique, using an 18 cm telescope, have produced TDRS-4 observations which have an rms error of 0.5 arc second, 100 m at synchronous altitude. Use of a mosaic of CCD chips, each having its own rate of charge motion, in the focal place of a telescope would allow point images of a geosynchronous satellite and of stars to be formed simultaneously in the same telescope. The line of sight of such a satellite could be measured relative to nearby star lines of sight with an accuracy of approximately 0.03 arc second. Development of a star catalog with 0.04 arc second rms accuracy and perhaps ten stars per square degree would allow determination of satellite lines of sight with 0.05 arc second rms absolute accuracy, corresponding to 10 m at synchronous altitude. Multiple station time transfers through a communications satellite can provide accurate distances from the satellite to the ground stations. Such observations can, if calibrated for delays, determine satellite orbits to an accuracy approaching 10 m rms

Locally constrained homomorphisms on graphs of bounded treewidth and bounded degree.

A homomorphism from a graph G to a graph H is locally bijective, surjective, or injective if its restriction to the neighborhood of every vertex of G is bijective, surjective, or injective, respectively. We prove that the problems of testing whether a given graph G allows a homomorphism to a given graph H that is locally bijective, surjective, or injective, respectively, are NP-complete, even when G has pathwidth at most 5, 4 or 2, respectively, or when both G and H have maximum degree 3. We complement these hardness results by showing that the three problems are polynomial-time solvable if G has bounded treewidth and in addition G or H has bounded maximum degree

Linear-time algorithms for scattering number and Hamilton-connectivity of interval graphs.

We prove that for all inline image an interval graph is inline image-Hamilton-connected if and only if its scattering number is at most k. This complements a previously known fact that an interval graph has a nonnegative scattering number if and only if it contains a Hamilton cycle, as well as a characterization of interval graphs with positive scattering numbers in terms of the minimum size of a path cover. We also give an inline image time algorithm for computing the scattering number of an interval graph with n vertices and m edges, which improves the previously best-known inline image time bound for solving this problem. As a consequence of our two results, the maximum k for which an interval graph is k-Hamilton-connected can be computed in inline image time

Marker based Thermal-Inertial Localization for Aerial Robots in Obscurant Filled Environments

For robotic inspection tasks in known environments fiducial markers provide a reliable and low-cost solution for robot localization. However, detection of such markers relies on the quality of RGB camera data, which degrades significantly in the presence of visual obscurants such as fog and smoke. The ability to navigate known environments in the presence of obscurants can be critical for inspection tasks especially, in the aftermath of a disaster. Addressing such a scenario, this work proposes a method for the design of fiducial markers to be used with thermal cameras for the pose estimation of aerial robots. Our low cost markers are designed to work in the long wave infrared spectrum, which is not affected by the presence of obscurants, and can be affixed to any object that has measurable temperature difference with respect to its surroundings. Furthermore, the estimated pose from the fiducial markers is fused with inertial measurements in an extended Kalman filter to remove high frequency noise and error present in the fiducial pose estimates. The proposed markers and the pose estimation method are experimentally evaluated in an obscurant filled environment using an aerial robot carrying a thermal camera.Comment: 10 pages, 5 figures, Published in International Symposium on Visual Computing 201

Coupling a model of human thermoregulation with computational fluid dynamics for predicting human-environment interaction

This paper describes the methods developed to couple a commercial CFD program with a multi-segmented model of human thermal comfort and physiology. A CFD model is able to predict detailed temperatures and velocities of airflow around a human body, whilst a thermal comfort model is able to predict the response of a human to the environment surrounding it. By coupling the two models and exchanging information about the heat transfer at the body surface the coupled system can potentially predict the response of a human body to detailed local environmental conditions. This paper presents a method of exchanging data, using shared files, to provide a means of dynamically exchanging simulation data with the IESD-Fiala model during the CFD solution process. Additional code is used to set boundary conditions for the CFD simulation at the body surface as determined by the IESD-Fiala model and to return information about local environmental conditions adjacent to the body surface as determined by the CFD simulation. The coupled system is used to model a human subject in a naturally ventilated environment. The resulting ventilation flow pattern agrees well with other numerical and experimental work

Lower Bounds for the Graph Homomorphism Problem

The graph homomorphism problem (HOM) asks whether the vertices of a given $n$-vertex graph $G$ can be mapped to the vertices of a given $h$-vertex graph $H$ such that each edge of $G$ is mapped to an edge of $H$. The problem generalizes the graph coloring problem and at the same time can be viewed as a special case of the $2$-CSP problem. In this paper, we prove several lower bound for HOM under the Exponential Time Hypothesis (ETH) assumption. The main result is a lower bound $2^{\Omega\left( \frac{n \log h}{\log \log h}\right)}$. This rules out the existence of a single-exponential algorithm and shows that the trivial upper bound $2^{{\mathcal O}(n\log{h})}$ is almost asymptotically tight. We also investigate what properties of graphs $G$ and $H$ make it difficult to solve HOM$(G,H)$. An easy observation is that an ${\mathcal O}(h^n)$ upper bound can be improved to ${\mathcal O}(h^{\operatorname{vc}(G)})$ where $\operatorname{vc}(G)$ is the minimum size of a vertex cover of $G$. The second lower bound $h^{\Omega(\operatorname{vc}(G))}$ shows that the upper bound is asymptotically tight. As to the properties of the "right-hand side" graph $H$, it is known that HOM$(G,H)$ can be solved in time $(f(\Delta(H)))^n$ and $(f(\operatorname{tw}(H)))^n$ where $\Delta(H)$ is the maximum degree of $H$ and $\operatorname{tw}(H)$ is the treewidth of $H$. This gives single-exponential algorithms for graphs of bounded maximum degree or bounded treewidth. Since the chromatic number $\chi(H)$ does not exceed $\operatorname{tw}(H)$ and $\Delta(H)+1$, it is natural to ask whether similar upper bounds with respect to $\chi(H)$ can be obtained. We provide a negative answer to this question by establishing a lower bound $(f(\chi(H)))^n$ for any function $f$. We also observe that similar lower bounds can be obtained for locally injective homomorphisms.Comment: 19 page

Linear-Time Algorithms for Scattering Number and Hamilton-Connectivity of Interval Graphs

We show that for all k ≤ − 1 an interval graph is − (k + 1)-Hamilton-connected if and only if its scattering number is at most k. We also give an O(n + m) time algorithm for computing the scattering number of an interval graph with n vertices and m edges, which improves the O(n 3) time bound of Kratsch, Kloks and Müller. As a consequence of our two results the maximum k for which an interval graph is k-Hamilton-connected can be computed in O(n + m) time

Assessing heat-related health risk in Europe via the Universal Thermal Climate Index (UTCI)

In this work the potential of the Universal Thermal Climate Index (UTCI) as a heat-related health risk indicator in Europe is demonstrated. The UTCI is a bioclimate index that uses a multi-node human heat balance model to represent the heat stress induced by meteorological conditions to the human body. Using 38 years of meteorological reanalysis data, UTCI maps were computed to assess the thermal bioclimate of Europe for the summer season. Patterns of heat stress conditions and non-thermal stress regions are identified across Europe. An increase in heat stress up to 1°C is observed during recent decades. Correlation with mortality data from 17 European countries revealed that the relationship between the UTCI and death counts depends on the bioclimate of the country, and death counts increase in conditions of moderate and strong stress, i.e. when UTCI is above 26°C and 32°C. The UTCI’s ability to represent mortality patterns is demonstrated for the 2003 European heatwave. These findings confirm the importance of UTCI as a bioclimatic index that is able to both capture the thermal bioclimatic variability of Europe, and relate such variability with the effects it has on human health

Synthetic retinal analogues modify the spectral and kinetic characteristics of microbial rhodopsin optogenetic tools

Optogenetic tools have become indispensable in neuroscience to stimulate or inhibit excitable cells by light. Channelrhodopsin-2 (ChR2) variants have been established by mutating the opsin backbone or by mining related algal genomes. As an alternative strategy, we surveyed synthetic retinal analogues combined with microbial rhodopsins for functional and spectral properties, capitalizing on assays in C. elegans, HEK cells and larval Drosophila. Compared with all-trans retinal (ATR), Dimethylamino-retinal (DMAR) shifts the action spectra maxima of ChR2 variants H134R and H134R/T159C from 480 to 520 nm. Moreover, DMAR decelerates the photocycle of ChR2(H134R) and (H134R/T159C), thereby reducing the light intensity required for persistent channel activation. In hyperpolarizing archaerhodopsin-3 and Mac, naphthyl-retinal and thiophene-retinal support activity alike ATR, yet at altered peak wavelengths. Our experiments enable applications of retinal analogues in colour tuning and altering photocycle characteristics of optogenetic tools, thereby increasing the operational light sensitivity of existing cell lines or transgenic animals