ASHMET: A computer code for estimating insolation incident on tilted surfaces

A computer code, ASHMET, was developed by MSFC to estimate the amount of solar insolation incident on the surfaces of solar collectors. Both tracking and fixed-position collectors were included. Climatological data for 248 U. S. locations are built into the code. The basic methodology used by ASHMET is the ASHRAE clear-day insolation relationships modified by a clearness index derived from SOLMET-measured solar radiation data to a horizontal surface

The a-number of hyperelliptic curves

It is known that for a smooth hyperelliptic curve to have a large $a$-number, the genus must be small relative to the characteristic of the field, $p>0$, over which the curve is defined. It was proven by Elkin that for a genus $g$ hyperelliptic curve $C$ to have $a_C=g-1$, the genus is bounded by $g<\frac{3p}{2}$. In this paper, we show that this bound can be lowered to $g <p$. The method of proof is to force the Cartier-Manin matrix to have rank one and examine what restrictions that places on the affine equation defining the hyperelliptic curve. We then use this bound to summarize what is known about the existence of such curves when $p=3,5$ and $7$.Comment: 7 pages. v2: revised and improved the proof of the main theorem based on suggestions from the referee. To appear in the proceedings volume of Women in Numbers Europe-

New Delhi\u27s Indian Ocean Policy

New Delhi\u27s concern for the integrity of its sea lines of comnunication and island possessions gained acceptance in the early 1960s. It was at that time that Indonesia began acquiring significant numbers of naval combatants from the Soviet Union, thereby providing reasonable evidence that Jakarta was interested in becoming a regional maritime power

Mass & secondary structure propensity of amino acids explain their mutability and evolutionary replacements

Why is an amino acid replacement in a protein accepted during evolution? The answer given by bioinformatics relies on the frequency of change of each amino acid by another one and the propensity of each to remain unchanged. We propose that these replacement rules are recoverable from the secondary structural trends of amino acids. A distance measure between high-resolution Ramachandran distributions reveals that structurally similar residues coincide with those found in substitution matrices such as BLOSUM: Asn Asp, Phe Tyr, Lys Arg, Gln Glu, Ile Val, Met → Leu; with Ala, Cys, His, Gly, Ser, Pro, and Thr, as structurally idiosyncratic residues. We also found a high average correlation (\overline{R} R = 0.85) between thirty amino acid mutability scales and the mutational inertia (I X ), which measures the energetic cost weighted by the number of observations at the most probable amino acid conformation. These results indicate that amino acid substitutions follow two optimally-efficient principles: (a) amino acids interchangeability privileges their secondary structural similarity, and (b) the amino acid mutability depends directly on its biosynthetic energy cost, and inversely with its frequency. These two principles are the underlying rules governing the observed amino acid substitutions. © 2017 The Author(s)

Discovery of pulsational line profile variations in the delta Scuti star HD21190 and in the Ap Sr star HD218994

Asteroseismology has the potential to provide new insights into the physics of stellar interiors. We have obtained UVES high time resolution observations of the delta Scuti star HD21190 and of the Ap Sr star HD218994 to search for pulsational line profile variations. We report the discovery of a new roAp star, HD218994, with a pulsation period of 14.2 min. This is one of the most evolved roAp stars. No rapid pulsations have been found in the spectra of the cool Ap star - delta Scuti star HD21190. However, we detect with unprecedented clarity for a delta Sct star moving peaks in the cores of spectral lines that indicate the presence of high degree non-radial pulsations in this star.Comment: 5 pages, 4 figures, 1 table, accepted for publication in MNRA

Fast Distributed Approximation for Max-Cut

Finding a maximum cut is a fundamental task in many computational settings. Surprisingly, it has been insufficiently studied in the classic distributed settings, where vertices communicate by synchronously sending messages to their neighbors according to the underlying graph, known as the $\mathcal{LOCAL}$ or $\mathcal{CONGEST}$ models. We amend this by obtaining almost optimal algorithms for Max-Cut on a wide class of graphs in these models. In particular, for any $\epsilon > 0$, we develop randomized approximation algorithms achieving a ratio of $(1-\epsilon)$ to the optimum for Max-Cut on bipartite graphs in the $\mathcal{CONGEST}$ model, and on general graphs in the $\mathcal{LOCAL}$ model. We further present efficient deterministic algorithms, including a $1/3$-approximation for Max-Dicut in our models, thus improving the best known (randomized) ratio of $1/4$. Our algorithms make non-trivial use of the greedy approach of Buchbinder et al. (SIAM Journal on Computing, 2015) for maximizing an unconstrained (non-monotone) submodular function, which may be of independent interest

Distributed Testing of Excluded Subgraphs

We study property testing in the context of distributed computing, under the classical CONGEST model. It is known that testing whether a graph is triangle-free can be done in a constant number of rounds, where the constant depends on how far the input graph is from being triangle-free. We show that, for every connected 4-node graph H, testing whether a graph is H-free can be done in a constant number of rounds too. The constant also depends on how far the input graph is from being H-free, and the dependence is identical to the one in the case of testing triangles. Hence, in particular, testing whether a graph is K_4-free, and testing whether a graph is C_4-free can be done in a constant number of rounds (where K_k denotes the k-node clique, and C_k denotes the k-node cycle). On the other hand, we show that testing K_k-freeness and C_k-freeness for k>4 appear to be much harder. Specifically, we investigate two natural types of generic algorithms for testing H-freeness, called DFS tester and BFS tester. The latter captures the previously known algorithm to test the presence of triangles, while the former captures our generic algorithm to test the presence of a 4-node graph pattern H. We prove that both DFS and BFS testers fail to test K_k-freeness and C_k-freeness in a constant number of rounds for k>4

The symbiotic star CH Cygni – II. The ejecta from the 1998-2000 active phase

We present Hubble Space Telescope (HST) imaging, a Very Large Array (VLA) radio map (4.74 GHz), optical high-resolution (echelle) spectroscopy and UBV photoelectric photometry of the symbiotic star CH Cyg obtained during its 1998–2000 active phase. The HST imaging, taken during eclipse, shows the central stars are embedded in a nebula extending to 620 ± 150 au for a distance of 270 ± 66 pc. The inner nebula is strongly influenced by the onset of activity and associated outflow in 1998. The surface brightness contours of the contemporaneous radio VLA observation agree well with HST images. Photometric observations of the broad 1999 U-minimum suggest that it is due to the eclipse of the active hot component by the giant on the long-period (14.5 yr) outer orbit. We also find that the onset of the 1998 and the 1992 active periods occur at the same orbital phase of the inner binary. Spectroscopic observations reveal two types of outflow from the active star: a high-velocity (>1200 km s−1) hot star wind sporadically alternating with a more massive outflow indicated by P-Cygni-like profiles. We present evidence connecting the extended nebulosity with the high-velocity shocked outflow, and hence the activity in the central binary