The Hardness of Embedding Grids and Walls

The dichotomy conjecture for the parameterized embedding problem states that the problem of deciding whether a given graph $G$ from some class $K$ of "pattern graphs" can be embedded into a given graph $H$ (that is, is isomorphic to a subgraph of $H$) is fixed-parameter tractable if $K$ is a class of graphs of bounded tree width and $W[1]$-complete otherwise. Towards this conjecture, we prove that the embedding problem is $W[1]$-complete if $K$ is the class of all grids or the class of all walls

Interference Mitigation Using Cyclic Autocorrelation and Multi-Objective Optimization

Radio frequency interference on space-to-ground communications links can degrade performance and disrupt the transfer of critical data. These interference events become increasingly likely as more users enter the spectrum, due in part to shared spectrum allocations and scheduling conflicts. If this interference could be detected and mitigated by an automated system, then link performance and reliability in these scenarios could be improved. This report describes the implementation and evaluation of an automated interference mitigation system that provides this functionality. The system uses Cyclic Autocorrelation (CAC) signal processing techniques to monitor the spectrum and detect interfering signals, and it applies a multi-objective optimization approach to mitigate interference by changing link parameters to continuously optimize the link. The implementation was evaluated to characterize its signal detection capabilities for various link qualities and to compare its link management performance to Adaptive Coding and Modulation (ACM) and Constant Coding and Modulation (CCM) when in the presence of randomized interference. In the latter evaluation, the interference mitigation system achieved the highest average throughput in each tested scenario. With these results, the proposed solution provides the groundwork for further automated link management capabilities and continued investigation into interference mitigation approaches

State Predictor of Classification Cognitive Engine Applied to Channel Fading

This study presents the application of machine learning (ML) to a space-to-ground communication link, showing how ML can be used to detect the presence of detrimental channel fading. Using this channel state information, the communication link can be used more efficiently by reducing the amount of lost data during fading. The motivation for this work is based on channel fading observed during on-orbit operations with NASA's Space Communication and Navigation (SCaN) testbed on the International Space Station (ISS). This paper presents the process to extract a target concept (fading and not-fading) from the raw data. The pre-processing and data exploration effort is explained in detail, with a list of assumptions made for parsing and labelling the dataset. The model selection process is explained, specifically emphasizing the benefits of using an ensemble of algorithms with majority voting for binary classification of the channel state. Experimental results are shown, highlighting how an end-to-end communication system can utilize knowledge of the channel fading status to identity fading and take appropriate action. With a laboratory testbed to emulate channel fading, the overall performance is compared to standard adaptive methods without fading knowledge, such as adaptive coding and modulation

An Improved Bound for First-Fit on Posets Without Two Long Incomparable Chains

It is known that the First-Fit algorithm for partitioning a poset P into chains uses relatively few chains when P does not have two incomparable chains each of size k. In particular, if P has width w then Bosek, Krawczyk, and Szczypka (SIAM J. Discrete Math., 23(4):1992--1999, 2010) proved an upper bound of ckw^{2} on the number of chains used by First-Fit for some constant c, while Joret and Milans (Order, 28(3):455--464, 2011) gave one of ck^{2}w. In this paper we prove an upper bound of the form ckw. This is best possible up to the value of c.Comment: v3: referees' comments incorporate

Temperature and moisture dependence of soil H_2 uptake measured in the laboratory

The soil sink of molecular hydrogen is the largest and most uncertain term in the global atmospheric H_2 budget. Lack of information about the mechanisms regulating this sink limits our ability to predict how atmospheric H_2 may respond to future changes in climate or anthropogenic emissions. Here we present the results from a series of laboratory experiments designed to systematically evaluate and describe the temperature and soil moisture dependence of H_2 uptake by soils from boreal forest and desert ecosystems. We observed substantial H2 uptake between −4°C and 0°C, a broad temperature optimum between 20°C and 30°C, a soil moisture optimum at approximately 20% saturation, and inhibition of uptake at both low and high soil moisture. A sigmoidal function described the temperature response of H_2 uptake by soils between −15°C and 40°C. Based on our results, we present a framework for a model of the soil H_2 sink

The zero exemplar distance problem

Given two genomes with duplicate genes, \textsc{Zero Exemplar Distance} is the problem of deciding whether the two genomes can be reduced to the same genome without duplicate genes by deleting all but one copy of each gene in each genome. Blin, Fertin, Sikora, and Vialette recently proved that \textsc{Zero Exemplar Distance} for monochromosomal genomes is NP-hard even if each gene appears at most two times in each genome, thereby settling an important open question on genome rearrangement in the exemplar model. In this paper, we give a very simple alternative proof of this result. We also study the problem \textsc{Zero Exemplar Distance} for multichromosomal genomes without gene order, and prove the analogous result that it is also NP-hard even if each gene appears at most two times in each genome. For the positive direction, we show that both variants of \textsc{Zero Exemplar Distance} admit polynomial-time algorithms if each gene appears exactly once in one genome and at least once in the other genome. In addition, we present a polynomial-time algorithm for the related problem \textsc{Exemplar Longest Common Subsequence} in the special case that each mandatory symbol appears exactly once in one input sequence and at least once in the other input sequence. This answers an open question of Bonizzoni et al. We also show that \textsc{Zero Exemplar Distance} for multichromosomal genomes without gene order is fixed-parameter tractable if the parameter is the maximum number of chromosomes in each genome.Comment: Strengthened and reorganize

Molecular hydrogen uptake by soils in forest, desert, and marsh ecosystems in California

The mechanism and environmental controls on soil hydrogen (H_2) uptake are not well understood but are essential for understanding the atmospheric H_2 budget. Field observations of soil H_2 uptake are limited, and here we present the results from a series of measurements in forest, desert, and marsh ecosystems in southern California. We measured soil H_2 fluxes using flux chambers from September 2004 to July 2005. Mean H2 flux rates and standard deviations were −7.9 + −4.2, −7.6 + −5.3 and −7.5 + −3.4 nmol m^(−2) s^(−1) for the forest, desert, and marsh, respectively (corresponding to deposition velocities of 0.063 + −0.029, 0.051 + −0.036, 0.035 + −0.013 cm s^(−1)). Soil profile measurements showed that H_2 mixing ratios were between 3% and 51% of atmospheric levels at 10 cm and that the penetration of H_2 into deeper soil layers increased with soil drying. Soil removal experiments in the forest demonstrated that the litter layer did not actively consume H_2, the removal of this layer increased uptake by deeper soil layers, and the exposure of subsurface soil layers to ambient atmospheric H_2 levels substantially increased their rate of uptake. Similar soil removal experiments at the desert site showed that extremely dry surface soils did not consume H2 and that fluxes at the surface increased when these inactive layers were removed. We present a model of soil H_2 fluxes and show that the diffusivity of soils, along with the vertical distribution of layers that actively consume H_2 regulate surface fluxes. We found that soil organic matter, CO_2 fluxes, and ecosystem type were not strong controllers of H_2 uptake. Our experiments highlight H_2 diffusion into soils as an important limit on fluxes and that minimum moisture level is needed to initiate microbial uptake

One-Pot Synthesis of 2-Methylfurans from 3- (Trimethylsilyl)propargyl Acetates Promoted by Trimethylsilyl Trifluoromethanesulfonate

In the presence of trimethylsilyl trifluoromethanesulfonate (TMSOTf) and triethylamine, 3-(trimethylsilyl)propargyl carboxylates undergo a one-pot alkylation-cyclization- desilylation reaction with ketones to produce 2-methylfurans. Alkylation at 0 °C in methylene chloride, followed by acid-catalyzed cyclization at room temperature, provides the furans in 52-86% yield. Cyclization and desilylation appear to be promoted by triflic acid generated in situ from the exposure of the reaction mixture to water upon completion of the initial substitution reaction

Upper and Lower Bounds for Weak Backdoor Set Detection

We obtain upper and lower bounds for running times of exponential time algorithms for the detection of weak backdoor sets of 3CNF formulas, considering various base classes. These results include (omitting polynomial factors), (i) a 4.54^k algorithm to detect whether there is a weak backdoor set of at most k variables into the class of Horn formulas; (ii) a 2.27^k algorithm to detect whether there is a weak backdoor set of at most k variables into the class of Krom formulas. These bounds improve an earlier known bound of 6^k. We also prove a 2^k lower bound for these problems, subject to the Strong Exponential Time Hypothesis.Comment: A short version will appear in the proceedings of the 16th International Conference on Theory and Applications of Satisfiability Testin