Overcoming Barriers to Scattered-Site Low-Cost Housing

The effect of most zoning devices which have been used in suburban and non-ghetto city planning in the past few decades has been to erect substantial economic barriers around entire cities. These devices include minimum lot size requirements, density zoning, frontage requirements, single family restrictions, and minimum living space requirements. While such zoning practices may not be exclusionary in purpose, exclusion of minority groups has been the result. Moreover, since most minorities are heavily concentrated in low income groups, economic segregation will bring about a high degree of racial and ethnic segregation. Indeed, it has been suggested that these economic barriers are the easiest and most effective form of such segregation. In any case, a zoning scheme in which large areas of the outlying residential districts are restricted to large lot, single family developments will run counter to the recently articulated federal policy of encouraging the development of low-cost housing outside the center city area. This article will discuss various factors which hinder attempts to revise current zoning plans so as to allow the construction of low-cost housing in non-ghetto areas. It will also suggest ways of surmounting these obstacles and thereby implementing the federal policy

On minimum dominating sets with minimum intersection

AbstractIn the developing theory of polynomial/linear algorithms for various problems on certain classes of graphs, most problems considered have involved either finding a single vertex set with a specified property (such as being a minimum dominating set) or finding a partition of the vertex set into such sets (for example, a partition into the maximum possible number of dominating sets). Alternatively, one might be interested in the cardinality of the set or the partition. In this paper we introduce an intermediate type of problem. Specifically, we ask for two minimum dominating sets with minimum intersection. We present a linear algorithm for finding two minimum dominating sets with minimum possible intersection in a tree T, and we show that simply determining whether or not there exist two disjoint minimum dominating sets is NP-hard for arbitrary bipartile graphs

Maximal-entropy random walk unifies centrality measures

In this paper analogies between different (dis)similarity matrices are derived. These matrices, which are connected to path enumeration and random walks, are used in community detection methods or in computation of centrality measures for complex networks. The focus is on a number of known centrality measures, which inherit the connections established for similarity matrices. These measures are based on the principal eigenvector of the adjacency matrix, path enumeration, as well as on the stationary state, stochastic matrix or mean first-passage times of a random walk. Particular attention is paid to the maximal-entropy random walk, which serves as a very distinct alternative to the ordinary random walk used in network analysis. The various importance measures, defined both with the use of ordinary random walk and the maximal-entropy random walk, are compared numerically on a set of benchmark graphs. It is shown that groups of centrality measures defined with the two random walks cluster into two separate families. In particular, the group of centralities for the maximal-entropy random walk, connected to the eigenvector centrality and path enumeration, is strongly distinct from all the other measures and produces largely equivalent results.Comment: 7 pages, 2 figure

Clinical Support: An Unconventional Request – Providence’s 100 Million Masks Initiative

In early March, Seattle, WA, was the epicenter of the US COVID-19 pandemic. Providence St. Joseph Health had seen the first reported US case of COVID-19 on January 20 [1] and quickly found itself responding to a growing crisis, with little information about how best to care for patients while protecting frontline staff. On March 16, 2020, Providence System Library Services received an email from senior leadership with the subject line: “Urgent – An Unconventional Request.” We were asked to pause all other work to search for viable mask patterns that could be easily and quickly made at home by volunteers and to develop mock-ups of the best patterns

The Distribution of Mixing Times in Markov Chains

The distribution of the "mixing time" or the "time to stationarity" in a discrete time irreducible Markov chain, starting in state i, can be defined as the number of trials to reach a state sampled from the stationary distribution of the Markov chain. Expressions for the probability generating function, and hence the probability distribution of the mixing time starting in state i are derived and special cases explored. This extends the results of the author regarding the expected time to mixing [J.J. Hunter, Mixing times with applications to perturbed Markov chains, Linear Algebra Appl. 417 (2006) 108-123], and the variance of the times to mixing, [J.J. Hunter, Variances of first passage times in a Markov chain with applications to mixing times, Linear Algebra Appl. 429 (2008) 1135-1162]. Some new results for the distribution of recurrence and first passage times in three-state Markov chain are also presented.Comment: 24 page

Flow Property Measurement Using Laser-Induced Fluorescence in the NASA Ames Interaction Heating Facility

The spectroscopic diagnostic technique of two photon absorption laser-induced fluorescence (TALIF) of atomic species has been applied to single-point measurements of velocity and static temperature in the NASA Ames Interaction Heating Facility (IHF) arc jet. Excitation spectra of atomic oxygen and nitrogen were recorded while scanning a tunable dye laser over the absorption feature. Thirty excitation spectra were acquired during 8 arc jet runs at two facility operating conditions; the number of scans per run varied between 2 and 6. Curve fits to the spectra were analyzed to recover their Doppler shifts and widths, from which the flow velocities and static temperatures, respectively, were determined. An increase in the number of independent flow property pairs from each as-measured scan was obtained by extracting multiple lower-resolution scans. The larger population sample size enabled the mean property values and their uncertainties for each run to be characterized with greater confidence. The average plus or minus 2 sigma uncertainties in the mean velocities and temperatures for all 8 runs were plus or minus 1.4% and plus or minus 11%, respectively

The Role of Kemeny's Constant in Properties of Markov Chains

In a finite state irreducible Markov chain with stationary probabilities \pi_i and mean first passage times m_(ij) (mean recurrence time when i = j) it was first shown by Kemeny and Snell (1960) that \sum_j \pi_j m_(ij) is a constant K, not depending on i. This constant has since become known as Kemeny's constant. A variety of techniques for finding expressions and various bounds for K are derived. The main interpretation focuses on its role as the expected time to mixing in a Markov chain. Various applications are considered including perturbation results, mixing on directed graphs and its relation to the Kirchhoff index of regular graphs.Comment: 13 page

Shock Layer Radiation Measurements and Analysis for Mars Entry

NASA's In-Space Propulsion program is supporting the development of shock radiation transport models for aerocapture missions to Mars. A comprehensive test series in the NASA Antes Electric Arc Shock Tube facility at a representative flight condition was recently completed. The facility optical instrumentation enabled spectral measurements of shocked gas radiation from the vacuum ultraviolet to the near infrared. The instrumentation captured the nonequilibrium post-shock excitation and relaxation dynamics of dispersed spectral features. A description of the shock tube facility, optical instrumentation, and examples of the test data are presented. Comparisons of measured spectra with model predictions are also made