User-friendly Support for Common Concepts in a Lightweight Verifier

Machine verification of formal arguments can only increase our confidence in the correctness of those arguments, but the costs of employing machine verification still outweigh the benefits for some common kinds of formal reasoning activities. As a result, usability is becoming increasingly important in the design of formal verification tools. We describe the "aartifact" lightweight verification system, designed for processing formal arguments involving basic, ubiquitous mathematical concepts. The system is a prototype for investigating potential techniques for improving the usability of formal verification systems. It leverages techniques drawn both from existing work and from our own efforts. In addition to a parser for a familiar concrete syntax and a mechanism for automated syntax lookup, the system integrates (1) a basic logical inference algorithm, (2) a database of propositions governing common mathematical concepts, and (3) a data structure that computes congruence closures of expressions involving relations found in this database. Together, these components allow the system to better accommodate the expectations of users interested in verifying formal arguments involving algebraic and logical manipulations of numbers, sets, vectors, and related operators and predicates. We demonstrate the reasonable performance of this system on typical formal arguments and briefly discuss how the system's design contributed to its usability in two case studies

Conclusions and implications of automation in space

Space facilities and programs are reviewed. Space program planning is discussed

JigsawNet: Shredded Image Reassembly using Convolutional Neural Network and Loop-based Composition

This paper proposes a novel algorithm to reassemble an arbitrarily shredded image to its original status. Existing reassembly pipelines commonly consist of a local matching stage and a global compositions stage. In the local stage, a key challenge in fragment reassembly is to reliably compute and identify correct pairwise matching, for which most existing algorithms use handcrafted features, and hence, cannot reliably handle complicated puzzles. We build a deep convolutional neural network to detect the compatibility of a pairwise stitching, and use it to prune computed pairwise matches. To improve the network efficiency and accuracy, we transfer the calculation of CNN to the stitching region and apply a boost training strategy. In the global composition stage, we modify the commonly adopted greedy edge selection strategies to two new loop closure based searching algorithms. Extensive experiments show that our algorithm significantly outperforms existing methods on solving various puzzles, especially those challenging ones with many fragment pieces

NASA Automated Rendezvous and Capture Review. Executive summary

In support of the Cargo Transfer Vehicle (CTV) Definition Studies in FY-92, the Advanced Program Development division of the Office of Space Flight at NASA Headquarters conducted an evaluation and review of the United States capabilities and state-of-the-art in Automated Rendezvous and Capture (AR&C). This review was held in Williamsburg, Virginia on 19-21 Nov. 1991 and included over 120 attendees from U.S. government organizations, industries, and universities. One hundred abstracts were submitted to the organizing committee for consideration. Forty-two were selected for presentation. The review was structured to include five technical sessions. Forty-two papers addressed topics in the five categories below: (1) hardware systems and components; (2) software systems; (3) integrated systems; (4) operations; and (5) supporting infrastructure

Modeling the formation of attentive publics in social media: the case of Donald Trump

Previous research has shown the importance of Donald Trump’s Twitter activity, and that of his Twitter following, in spreading his message during the primary and general election campaigns of 2015–2016. However, we know little about how the publics who followed Trump and amplified his messages took shape. We take this case as an opportunity to theorize and test questions about the assembly of what we call “attentive publics” in social media. We situate our study in the context of current discussions of audience formation, attention flow, and hybridity in the United States’ political media system. From this we derive propositions concerning how attentive publics aggregate around a particular object, in this case Trump himself, which we test using time series modeling. We also present an exploration of the possible role of automated accounts in these processes. Our results reiterate the media hybridity described by others, while emphasizing the importance of news media coverage in building social media attentive publics.Accepted manuscrip

A conserved filamentous assembly underlies the structure of the meiotic chromosome axis.

The meiotic chromosome axis plays key roles in meiotic chromosome organization and recombination, yet the underlying protein components of this structure are highly diverged. Here, we show that 'axis core proteins' from budding yeast (Red1), mammals (SYCP2/SYCP3), and plants (ASY3/ASY4) are evolutionarily related and play equivalent roles in chromosome axis assembly. We first identify 'closure motifs' in each complex that recruit meiotic HORMADs, the master regulators of meiotic recombination. We next find that axis core proteins form homotetrameric (Red1) or heterotetrameric (SYCP2:SYCP3 and ASY3:ASY4) coiled-coil assemblies that further oligomerize into micron-length filaments. Thus, the meiotic chromosome axis core in fungi, mammals, and plants shares a common molecular architecture, and likely also plays conserved roles in meiotic chromosome axis assembly and recombination control

Scaffolder - Software for Reproducible Genome Scaffolding.

Background: Assembly of short-read sequencing data can result in a fragmented non-contiguous series of genomic sequences. Therefore a common step in a genome project is to join neighboring sequence regions together and fill gaps in the assembly using additional sequences. This scaffolding step, however, is non-trivial and requires manually editing large blocks of nucleotide sequence. Joining these sequences together also hides the source of each region in the final genome sequence. Taken together, these considerations may make reproducing or editing an existing genome build difficult.

Methods: The software outlined here, “Scaffolder,” is implemented in the Ruby programming language and can be installed via the RubyGems software management system. Genome scaffolds are defined using YAML - a data format, which is both human and machine-readable. Command line binaries and extensive documentation are available.

Results: This software allows a genome build to be defined in terms of the constituent sequences using a relatively simple syntax to define the scaffold. This syntax further allows unknown regions to be defined, and adds additional sequences to fill gaps in the scaffold. Defining the genome construction in a file makes the scaffolding process reproducible and easier to edit compared with FASTA nucleotide sequence.

Conclusions: Scaffolder is easy-to-use genome scaffolding software. This tool promotes reproducibility and continuous development in a genome project. Scaffolder can be found at http://next.gs