Cislunar /or earth/ swingby for interplanetary missions

Cislunar or earth swingby for interplanetary mission

BARD: Better Automated Redistricting

BARD is the first (and at time of writing, only) open source software package for general redistricting and redistricting analysis. BARD provides methods to create, display, compare, edit, automatically refine, evaluate, and profile political districting plans. BARD aims to provide a framework for scientific analysis of redistricting plans and to facilitate wider public participation in the creation of new plans. BARD facilitates map creation and refinement through command-line, graphical user interface, and automatic methods. Since redistricting is a computationally complex partitioning problem not amenable to an exact optimization solution, BARD implements a variety of selectable metaheuristics that can be used to refine existing or randomly-generated redistricting plans based on user-determined criteria. Furthermore, BARD supports automated generation of redistricting plans and profiling of plans by assigning different weights to various criteria, such as district compactness or equality of population. This functionality permits exploration of trade-offs among criteria. The intent of a redistricting authority may be explored by examining these trade-offs and inferring which reasonably observable plans were not adopted. Redistricting is a computationally-intensive problem for even modest-sized states. Performance is thus an important consideration in BARD's design and implementation. The program implements performance enhancements such as evaluation caching, explicit memory management, and distributed computing across snow clusters.

Branching processes, the max-plus algebra and network calculus

Branching processes can describe the dynamics of various queueing systems, peer-to-peer systems, delay tolerant networks, etc. In this paper we study the basic stochastic recursion of multitype branching processes, but in two non-standard contexts. First, we consider this recursion in the max-plus algebra where branching corresponds to finding the maximal offspring of the current generation. Secondly, we consider network-calculus-type deterministic bounds as introduced by Cruz, which we extend to handle branching-type processes. The paper provides both qualitative and quantitative results and introduces various applications of (max-plus) branching processes in queueing theory

accuracy: Tools for Accurate and Reliable Statistical Computing

Most empirical social scientists are surprised that low-level numerical issues in software can have deleterious effects on the estimation process. Statistical analyses that appear to be perfectly successful can be invalidated by concealed numerical problems. We have developed a set of tools, contained in accuracy, a package for R and S-PLUS, to diagnose problems stemming from numerical and measurement error and to improve the accuracy of inferences. The tools included in accuracy include a framework for gauging the computational stability of model results, tools for comparing model results, optimization diagnostics, and tools for collecting entropy for true random numbers generation.

Shape-Based Models for Interactive Segmentation of Medical Images

Accurate image segmentation is one of the key problems in computer vision. In domains such as radiation treatment planning, dosimetrists must manually trace the outlines of a few critical structures on large numbers of images. Considerable similarity can be seen in the shape of these regions, both between adjacent slices in a particular patient and across the spectrum of patients. Consequently we should be able to model this similarity and use it to assist in the process of segmentation. Previous work has demonstrated that a constraint-based 2D radial model can capture generic shape information for certain shape classes, and can reduce user interaction by a factor of three over purely manual segmentation. Additional simulation studies have shown that a probabilistic version of the model has the potential to further reduce user interaction. This paper describes an implementation of both models in a general-purpose imaging and graphics framework and compares the usefulness of the models on several shape classes

Rule 10b-5 and Reasonable Reliance: Why Courts Should Abandon Focus on Non-Reliance Clauses

In a typical privately negotiated merger or acquisition, the parties involved will be engaged in months of negotiations prior to the closing of their deal. Over the course of such, many projections, agreements, documents, oral representations and warranties (hereinafter “information”) will undoubtedly be exchanged by both sides. In the final purchase agreement, a seller typically lists detailed representations and warranties about its business, and includes a proviso that the buyer is not relying on any other information. Inclusion of this “non-reliance clause” (hereinafter “NRC”) is intended to restrict a buyer’s ability to bring a fraud claim under Rule 10b-5

A Study of Non-Neutral Networks with Usage-based Prices

Hahn and Wallsten wrote that network neutrality "usually means that broadband service providers charge consumers only once for Internet access, do not favor one content provider over another, and do not charge content providers for sending information over broadband lines to end users." In this paper we study the implications of non-neutral behaviors under a simple model of linear demand-response to usage-based prices. We take into account advertising revenues and consider both cooperative and non-cooperative scenarios. In particular, we model the impact of side-payments between service and content providers. We also consider the effect of service discrimination by access providers, as well as an extension of our model to non-monopolistic content providers