Identification of the source of an interferer by comparison with known carriers using a single satellite

We describe a method for identifying the source of a satellite interferer using a single satellite. The technique relies on the fact that the strength of a carrier signal measured at the downlink station varies with time due to a number of factors, and we use a quantum‐inspired algorithm to compute a “signature” for a signal, which captures part of the pattern of variation that is a characteristic of the uplink antenna. We define a distance measure to numerically quantify the degree of similarity between two signatures, and by computing the distances between the signature for an interfering carrier and the signatures of the known carriers being relayed by the same satellite at the same time, we can identify the antenna that the interferer originated from, if a known carrier is being relayed from it. As a proof of concept, we evaluate the performance of the technique using a simple statistical model applied to measured carrier data.     

Finding Induced Paths of Given Parity in Claw-Free Graphs

The Parity Path problem is to decide if a given graph contains both an induced path of odd length and an induced path of even length between two specified vertices. In the related problems Odd Induced Path and Even Induced Path, the goal is to determine whether an induced path of odd, respectively even, length between two specified vertices exists. Although all three problems are NP-complete in general, we show that they can be solved in $\mathcal{O}(n^{5})$ time for the class of claw-free graphs. Two vertices s and t form an even pair in G if every induced path from s to t in G has even length. Our results imply that the problem of deciding if two specified vertices of a claw-free graph form an even pair, as well as the problem of deciding if a given claw-free graph has an even pair, can be solved in $\mathcal{O}(n^{5})$ time and $\mathcal{O}(n^{7})$ time, respectively. We also show that we can decide in $\mathcal{O}(n^{7})$ time whether a claw-free graph has an induced cycle of given parity through a specified vertex. Finally, we show that a shortest induced path of given parity between two specified vertices of a claw-free perfect graph can be found in $\mathcal {O}(n^{7})$ time.     

The Activation of a Pd/γ-alumina Catalyst During Methane Combustion: Investigation of the Phenomenon and of Potential Causes

Activation phenomena of a Pd/γ-Al₂O₃ catalyst under methane combustion reaction conditions were studied. The activation of the catalyst with time-on-stream is not due to Cl removal from the surface but seems to be related to sintering of the palladium particles. This could induce structural changes in the palladium particle, which would favor the activation of O₂ on the surface of PdO.     

Mechanically driven syntheses of carbides and silcides

Most metal carbides or slicides may be synthesized at room temperature, by ball milling mixtures of elemental powders for some tens of hours with a vibratory mill. Both stable and metastable compounds containing a high density of defects can be obtained. In general, phases stable at low temperatures are synthesized. This observation allows us to confirm recent estimations for the maximum temperature (600 K) attained in these powders during mechanical alloying. Exceptions are found for some MSi₂ suicides with M = titanium, iron or molybdenum for which both low- and high-temperature phases are formed.     

Implicit induction in conditional theories

We propose a new procedure for proof by induction in conditional theories where case analysis is simulated by term rewriting. This technique reduces considerably the number of variables of a conjecture to be considered for applying induction schemes. Our procedure is presented as a set of inference rules whose correctness has been formally proved. Moreover, when the axioms are ground convergent and the functions are completely defined, it is possible to apply the system for refuting conjectures. The procedure is even refutationally complete for conditional equations with Boolean preconditions over free constructors. The method is entirely implemented in the proverSPIKE. This system has solved interesting problems in a completely automatic way, that is, without interaction with the user and without ad hoc heuristics. It has also proved the challenging Gilbreath card trick, with only two easy lemmas.Preliminary versions of the results have been presented at the 13th International Joint Conference on Artificial Intelligence, Chambéry (France), 1993 (Bouhoula and Rusinowith, 1993).     

An exploratory study of api changes and usages based on apache and eclipse ecosystems

Frameworks are widely used in modern software development to reduce development costs. They are accessed through their Application Programming Interfaces (APIs), which specify the contracts with client programs. When frameworks evolve, API backward-compatibility cannot always be guaranteed and client programs must upgrade to use the new releases. Because framework upgrades are not cost-free, observing API changes and usages together at fine-grained levels is necessary to help developers understand, assess, and forecast the cost of each framework upgrade. Whereas previous work studied API changes in frameworks and API usages in client programs separately, we analyse and classify API changes and usages together in 22 framework releases from the Apache and Eclipse ecosystems and their client programs. We find that (1) missing classes and methods happen more often in frameworks and affect client programs more often than the other API change types do, (2) missing interfaces occur rarely in frameworks but affect client programs often, (3) framework APIs are used on average in 35 % of client classes and interfaces, (4) most of such usages could be encapsulated locally and reduced in number, and (5) about 11 % of APIs usages could cause ripple effects in client programs when these APIs change. Based on these findings, we provide suggestions for developers and researchers to reduce the impact of API evolution through language mechanisms and design strategies.     

Detecting Fixed Patterns in Chordal Graphs in Polynomial Time

The Contractibility problem takes as input two graphs G and H, and the task is to decide whether H can be obtained from G by a sequence of edge contractions. The Induced Minor and Induced Topological Minor problems are similar, but the first allows both edge contractions and vertex deletions, whereas the latter allows only vertex deletions and vertex dissolutions. All three problems are NP-complete, even for certain fixed graphs H. We show that these problems can be solved in polynomial time for every fixed H when the input graph G is chordal. Our results can be considered tight, since these problems are known to be W[1]-hard on chordal graphs when parameterized by the size of H. To solve Contractibility and Induced Minor, we define and use a generalization of the classic Disjoint Paths problem, where we require the vertices of each of the k paths to be chosen from a specified set. We prove that this variant is NP-complete even when k=2, but that it is polynomial-time solvable on chordal graphs for every fixed k. Our algorithm for Induced Topological Minor is based on another generalization of Disjoint Paths called Induced Disjoint Paths, where the vertices from different paths may no longer be adjacent. We show that this problem, which is known to be NP-complete when k=2, can be solved in polynomial time on chordal graphs even when k is part of the input. Our results fit into the general framework of graph containment problems, where the aim is to decide whether a graph can be modified into another graph by a sequence of specified graph operations. Allowing combinations of the four well-known operations edge deletion, edge contraction, vertex deletion, and vertex dissolution results in the following ten containment relations: (induced) minor, (induced) topological minor, (induced) subgraph, (induced) spanning subgraph, dissolution, and contraction. Our results, combined with existing results, settle the complexity of each of the ten corresponding containment problems on chordal graphs.     

Simultaneous quantitative analysis of metabolites using ion-pair liquid chromatography-electrospray ionization mass spectrometry

We have developed an analytical method, consisting of ion-pair liquid chromatography coupled to electrospray ionization mass spectrometry (IP-LC-ESI-MS), for the simultaneous quantitative analysis of several key classes of polar metabolites, like nucleotides, coenzyme A esters, sugar nucleotides, and sugar bisphosphates. The use of the ion-pair agent hexylamine and optimization of the pH of the mobile phases were critical parameters in obtaining good retention and peak shapes of many of the above-mentioned polar and acidic metabolites that are impossible to analyze using standard reversed-phase LC/MS. Optimum conditions were found when using a gradient from 5 mM hexylamine in water (pH 6.3) to 90% methanol/10% 10 mM ammonium acetate (pH 8.5). The IP-LC-ESI-MS method was extensively validated by determining the linearity (R2 > 0.995), sensitivity (limit of detection 0.1-1 ng), repeatability, and reproducibility (relative standard deviation <10%). The IP-LC-ESI-MS method was shown to be a useful tool for microbial metabolomics, i.e., the comprehensive quantitative analysis of metabolites in extracts of microorganisms, and for the determination of the energy charge, i.e., the cellular energy status, as an overall quality measure for the sample workup and analytical protocols.     

Understanding the differences between how novice and experienced designers approach design tasks

Research was undertaken to understand how to provide the most appropriate support for novice designers in engineering design. However, how designers apply their experience and knowledge is not understood and further research in this area is required. This paper describes an observational study to understand how novice and experienced designers approach design tasks. Electronic Publication