Technology requirements for future Earth-to-geosynchronous orbit transportation systems. Volume 1: Executive summary

Technologies including accelerated technology that are critical to performance and/or provide cost advantages for future space transportation systems are identified. Mission models are scoped and include priority missions, and cargo missions. Summary data, providing primary design concepts and features, are given for the SSTO, HLLV, POTV, and LCOTV vehicles. Significant system costs and total system costs in terms of life cycle costs in both discounted and undiscounted dollars are summarized for each of the vehicles

Technology requirements for future Earth-to-geosynchronous orbit transportation systems. Volume 3: Appendices

Technological requirements and forecasts of rocket engine parameters and launch vehicles for future Earth to geosynchronous orbit transportation systems are presented. The parametric performance, weight, and envelope data for the LOX/CH4, fuel cooled, staged combustion cycle and the hydrogen cooled, expander bleed cycle engine concepts are discussed. The costing methodology and ground rules used to develop the engine study are summarized. The weight estimating methodology for winged launched vehicles is described and summary data, used to evaluate and compare weight data for dedicated and integrated O2/H2 subsystems for the SSTO, HLLV and POTV are presented. Detail weights, comparisons, and weight scaling equations are provided

Seeding for pervasively overlapping communities

In some social and biological networks, the majority of nodes belong to multiple communities. It has recently been shown that a number of the algorithms that are designed to detect overlapping communities do not perform well in such highly overlapping settings. Here, we consider one class of these algorithms, those which optimize a local fitness measure, typically by using a greedy heuristic to expand a seed into a community. We perform synthetic benchmarks which indicate that an appropriate seeding strategy becomes increasingly important as the extent of community overlap increases. We find that distinct cliques provide the best seeds. We find further support for this seeding strategy with benchmarks on a Facebook network and the yeast interactome.Comment: 8 Page

Synthesis and Cell Adhesive Properties of Linear and Cyclic RGD Functionalized Polynorbornene Thin Films

Described herein is the efficient synthesis and evaluation of bioactive arginine-glycine-aspartic acid (RGD) functionalized polynorbornene-based materials for cell adhesion and spreading. Polynorbornenes containing either linear or cyclic RGD peptides were synthesized by ring-opening metathesis polymerization (ROMP) using the well-defined ruthenium initiator [(H_(2)IMes)(pyr)_(2)(Cl)_(2)Ru═CHPh]. The random copolymerization of three separate norbornene monomers allowed for the incorporation of water-soluble polyethylene glycol (PEG) moieties, RGD cell recognition motifs, and primary amines for postpolymerization cross-linking. Following polymer synthesis, thin-film hydrogels were formed by cross-linking with bis(sulfosuccinimidyl) suberate (BS^3), and the ability of these materials to support human umbilical vein endothelial cell (HUVEC) adhesion and spreading was evaluated and quantified. When compared to control polymers containing either no peptide or a scrambled RDG peptide, polymers with linear or cyclic RGD at varying concentrations displayed excellent cell adhesive properties in both serum-supplemented and serum-free media. Polymers with cyclic RGD side chains maintained cell adhesion and exhibited comparable integrin binding at a 100-fold lower concentration than those carrying linear RGD peptides. The precise control of monomer incorporation enabled by ROMP allows for quantification of the impact of RGD structure and concentration on cell adhesion and spreading. The results presented here will serve to guide future efforts for the design of RGD functionalized materials with applications in surgery, tissue engineering, and regenerative medicine

Dynamic Analysis of Executables to Detect and Characterize Malware

It is needed to ensure the integrity of systems that process sensitive information and control many aspects of everyday life. We examine the use of machine learning algorithms to detect malware using the system calls generated by executables-alleviating attempts at obfuscation as the behavior is monitored rather than the bytes of an executable. We examine several machine learning techniques for detecting malware including random forests, deep learning techniques, and liquid state machines. The experiments examine the effects of concept drift on each algorithm to understand how well the algorithms generalize to novel malware samples by testing them on data that was collected after the training data. The results suggest that each of the examined machine learning algorithms is a viable solution to detect malware-achieving between 90% and 95% class-averaged accuracy (CAA). In real-world scenarios, the performance evaluation on an operational network may not match the performance achieved in training. Namely, the CAA may be about the same, but the values for precision and recall over the malware can change significantly. We structure experiments to highlight these caveats and offer insights into expected performance in operational environments. In addition, we use the induced models to gain a better understanding about what differentiates the malware samples from the goodware, which can further be used as a forensics tool to understand what the malware (or goodware) was doing to provide directions for investigation and remediation.Comment: 9 pages, 6 Tables, 4 Figure

Highly-ordered graphene for two dimensional electronics

With expanding interest in graphene-based electronics, it is crucial that high quality graphene films be grown. Sublimation of Si from the 4H-SiC(0001) Si-terminated) surface in ultrahigh vacuum is a demonstrated method to produce epitaxial graphene sheets on a semiconductor. In this paper we show that graphene grown from the SiC$(000\bar{1})$ (C-terminated) surface are of higher quality than those previously grown on SiC(0001). Graphene grown on the C-face can have structural domain sizes more than three times larger than those grown on the Si-face while at the same time reducing SiC substrate disorder from sublimation by an order of magnitude.Comment: Submitted to Appl. Phys. Let

Metal-Poor Stars Observed with the Magellan Telescope. III. New Extremely and Ultra Metal-Poor Stars from SDSS/SEGUE and Insights on the Formation of Ultra Metal-Poor Stars

We report the discovery of one extremely metal-poor (EMP; [Fe/H]<-3) and one ultra metal-poor (UMP; [Fe/H]<-4) star selected from the SDSS/SEGUE survey. These stars were identified as EMP candidates based on their medium-resolution (R~2,000) spectra, and were followed-up with high-resolution (R~35,000) spectroscopy with the Magellan-Clay Telescope. Their derived chemical abundances exhibit good agreement with those of stars with similar metallicities. We also provide new insights on the formation of the UMP stars, based on comparison with a new set of theoretical models of supernovae nucleosynthesis. The models were matched with 20 UMP stars found in the literature, together with one of the program stars (SDSS J1204+1201), with [Fe/H]=-4.34. From fitting their abundances, we find that the supernovae progenitors, for stars where carbon and nitrogen are measured, had masses ranging from 20.5 M_sun to 28 M_sun and explosion energies from 0.3 to 0.9x10^51 erg. These results are highly sensitive to the carbon and nitrogen abundance determinations, which is one of the main drivers for future high-resolution follow-up of UMP candidates. In addition, we are able to reproduce the different CNO abundance patterns found in UMP stars with a single progenitor type, by varying its mass and explosion energy.Comment: 15 pages, 12 figures; accepted for publication in Ap

Relative Riemann-Zariski spaces

In this paper we study relative Riemann-Zariski spaces attached to a morphism of schemes and generalizing the classical Riemann-Zariski space of a field. We prove that similarly to the classical RZ spaces, the relative ones can be described either as projective limits of schemes in the category of locally ringed spaces or as certain spaces of valuations. We apply these spaces to prove the following two new results: a strong version of stable modification theorem for relative curves; a decomposition theorem which asserts that any separated morphism between quasi-compact and quasi-separated schemes factors as a composition of an affine morphism and a proper morphism. (In particular, we obtain a new proof of Nagata's compactification theorem.)Comment: 30 pages, the final version, to appear in Israel J. of Mat