Matched wideband low-noise amplifiers for radio astronomy

Two packaged low noise amplifiers for the 0.3–4 GHz frequency range are described. The amplifiers can be operated at temperatures of 300–4 K and achieve noise temperatures in the 5 K range (<0.1 dB noise figure) at 15 K physical temperature. One amplifier utilizes commercially available, plastic-packaged SiGe transistors for first and second stages; the second amplifier is identical except it utilizes an experimental chip transistor as the first stage. Both amplifiers use resistive feedback to provide input reflection coefficient S11<−10 dB over a decade bandwidth with gain over 30 dB. The amplifiers can be used as rf amplifiers in very low noise radio astronomy systems or as i.f. amplifiers following superconducting mixers operating in the millimeter and submillimeter frequency range

Proving Termination of Graph Transformation Systems using Weighted Type Graphs over Semirings

We introduce techniques for proving uniform termination of graph transformation systems, based on matrix interpretations for string rewriting. We generalize this technique by adapting it to graph rewriting instead of string rewriting and by generalizing to ordered semirings. In this way we obtain a framework which includes the tropical and arctic type graphs introduced in a previous paper and a new variant of arithmetic type graphs. These type graphs can be used to assign weights to graphs and to show that these weights decrease in every rewriting step in order to prove termination. We present an example involving counters and discuss the implementation in the tool Grez

Conditional Reactive Systems

We lift the notion of nested application conditions from graph transformation systems to the general categorical setting of reactive systems as defined by Leifer and Milner. This serves two purposes: first, we enrich the formalism of reactive systems by adding application conditions for rules; second, it turns out that some constructions for graph transformation systems (such as computing weakest preconditions and strongest postconditions and showing local confluence by means of critical pair analysis) can be done very elegantly in the more general setting

First principles calculation of structural and magnetic properties for Fe monolayers and bilayers on W(110)

Structure optimizations were performed for 1 and 2 monolayers (ML) of Fe on a 5 ML W(110) substrate employing the all-electron full-potential linearized augmented plane-wave (FP-LAPW) method. The magnetic moments were also obtained for the converged and optimized structures. We find significant contractions ($\sim$ 10 %) for both the Fe-W and the neighboring Fe-Fe interlayer spacings compared to the corresponding bulk W-W and Fe-Fe interlayer spacings. Compared to the Fe bcc bulk moment of 2.2 $\mu_B$, the magnetic moment for the surface layer of Fe is enhanced (i) by 15% to 2.54 $\mu_B$ for 1 ML Fe/5 ML W(110), and (ii) by 29% to 2.84 $\mu_B$ for 2 ML Fe/5 ML W(110). The inner Fe layer for 2 ML Fe/5 ML W(110) has a bulk-like moment of 2.3 $\mu_B$. These results agree well with previous experimental data

Decidability and Expressiveness of Finitely Representable Recognizable Graph Languages

Recognizable graph languages are a generalization of regular (word) languages to graphs (as well as arbitrary categories). Recently automaton functors were proposed as acceptors of recognizable graph languages. They promise to be a useful tool for the verification of dynamic systems, for example for invariant checking. Since automaton functors may contain an infinite number of finite state sets, one must restrict to finitely representable ones for implementation reasons. In this paper we take into account two such finite representations: primitive recursive automaton functors - in which the automaton functor can be constructed on-the-fly by a primitive recursive function -, and bounded automaton functors - in which the interface size of the graphs (cf. path width) is bounded, so that the automaton functor can be explicitly represented. We show that the language classes of both kinds of automaton functor are closed under boolean operations, and compare the expressiveness of the two paradigms with hyperedge replacement grammars. In addition we show that the emptiness and equivalence problem are decidable for bounded automaton functors, but undecidable for primitive recursive automaton functors

Playing endgame chess with the Tsetlin Machine

Master's thesis in Information- and communication technology (IKT590)The report is about training an Artificial Intelligence(AI) that is able to play out endgames, using the existing solved endgame of chess to train the Tsetlin Machine on. This report describes the methods used to train and test a Tsetlin Ma-chine using both the convolutional and multiclass implementation. We have further tested out different methods to handle the data it trains on to investigate what methods work best. Where these methods are; to split the data for two machines for either white or black starting player, transforming the data to only be from one starting players perspective and one splitting based on results by first having one machine looking at win versus draw and loss, then a second machine for looking at draw versus loss. The results showed that some of the methods used, involving only looking at one players perspective, worked well for predicting if the board would lead to a win with perfect play. Since several om the methods achieved over90% accuracy in the testing, while the best achieves an accuracy of 95%. However the playing off the endgame was lacking, as the games mostly ended in draws even when the Tsetlin Machine should have been able to win. Such as only drawing against each other, and only drawing against Monte Carlo Tree Search

The rapid evolution of the exciting star of the Stingray Nebula

SAO244567, the exciting star of the Stingray nebula, is rapidly evolving. Previous analyses suggested that it has heated up from an effective temperature of about 21kK in 1971 to over 50kK in the 1990s. Canonical post-asymptotic giant branch evolution suggests a relatively high mass while previous analyses indicate a low-mass star. Fitting line profiles from static and expanding non-LTE model atmospheres to the observed UV and optical spectra, taken during 1988-2013, allowed us to study the temporal change of effective temperature, surface gravity, mass-loss rate, and terminal wind velocity. In addition, we determined the chemical composition of the atmosphere. We find that the central star has steadily increased its effective temperature from 38kK in 1988 to a peak value of 60kK in 2002. During the same time, the star was contracting, as concluded from an increase in surface gravity from log g = 4.8 to 6.0 and a drop in luminosity. Simultaneously, the mass-loss rate declined from log (dM/dt/Msun/yr)=-9.0 to -11.6 and the terminal wind velocity increased from 1800km/s to 2800km/s. Since around 2002, the star stopped heating and has cooled down again to 55kK by 2006. It has a largely solar surface composition with the exception of slightly subsolar carbon, phosphorus, and sulfur. By comparison with stellar-evolution calculations, we confirm that SAO244567 must be a low-mass star (M < 0.55 Msun). However, the slow evolution of the respective stellar evolutionary models is in strong contrast to the observed fast evolution and the young planetary nebula with a kinematical age of only about 1000 years. We speculate that the star could be a late He-shell flash object. Alternatively, it could be the outcome of close-binary evolution. Then SAO244567 would be a low-mass (0.354 Msun) helium prewhite dwarf after the common-envelope phase, during which the planetary nebula was ejected.Comment: 16 pages, 13 figures, accepted for publication in A&

Kinetic pinning and biological antifreezes

Biological antifreezes protect cold-water organisms from freezing. An example are the antifreeze proteins (AFPs) that attach to the surface of ice crystals and arrest growth. The mechanism for growth arrest has not been heretofore understood in a quantitative way. We present a complete theory based on a kinetic model. We use the `stones on a pillow' picture. Our theory of the suppression of the freezing point as a function of the concentration of the AFP is quantitatively accurate. It gives a correct description of the dependence of the freezing point suppression on the geometry of the protein, and might lead to advances in design of synthetic AFPs.Comment: 4 pages, 4 figure

Monte Carlo Simulation of Magnetization Reversal in Fe Sesquilayers on W(110)

Iron sesquilayers grown at room temperature on W(110) exhibit a pronounced coercivity maximum near a coverage of 1.5 atomic monolayers. On lattices which faithfully reproduce the morphology of the real films, a kinetic Ising model is utilized to simulate the domain-wall motion. Simulations reveal that the dynamics is dominated by the second-layer islands, which act as pinning centers. The simulated dependencies of the coercivity on the film coverage, as well as on the temperature and the frequency of the applied field, are very similar to those measured in experiments. Unlike previous micromagnetic models, the presented approach provides insight into the dynamics of the domain-wall motion and clearly reveals the role of thermal fluctuations.Comment: Final version to appear in Phys. Rev. B. References to related works added. 7 pages, 5 figures, RevTex, mpeg simulations available at http://www.scri.fsu.edu/~rikvol