Employer Demand for Welfare Recipients by Race

This paper uses new survey data on employers in four large metropolitan areas to examine the determinants of employer demand for welfare recipients. The results suggest a high level of demand for welfare recipients, though such demand appears fairly sensitive to business cycle conditions. A broad range of factors, including skill needs and industry, affect the prospective demand for welfare recipients among employers, while other characteristics that affect the relative supply of welfare recipients to these employers (such as location and employer use of local agencies or welfare-to-work programs) influence the extent to which such demand is realized in actual hiring. Moreover, the conditional demand for black (and to a lesser extent Hispanic) welfare recipients lags behind their representation in the welfare population and seems to be more heavily affected by employers’ location and indicators of preferences than by their skill needs or overall hiring activity. Thus, a variety of factors on the demand side of the labor market continue to limit the employment options of welfare recipients, especially those who are minorities.

Learning to Imagine

For the purpose of this discussion, we posit that there are essentially four overarching reasons we educate. They are: preparing students for democratic participation, providing access to knowledge and critical thinking, enabling all students to take advantage of life's opportunities, and enabling students to lead rich and rewarding personal lives. None of these can be achieved fully without attention to the role of imagination. While we acknowledge that not all would agree with our definition of purposes, our comprehensive vision, we believe, can serve our children and our society well

State Complexity of Reversals of Deterministic Finite Automata with Output

We investigate the worst-case state complexity of reversals of deterministic finite automata with output (DFAOs). In these automata, each state is assigned some output value, rather than simply being labelled final or non-final. This directly generalizes the well-studied problem of determining the worst-case state complexity of reversals of ordinary deterministic finite automata. If a DFAO has $n$ states and $k$ possible output values, there is a known upper bound of $k^n$ for the state complexity of reversal. We show this bound can be reached with a ternary input alphabet. We conjecture it cannot be reached with a binary input alphabet except when $k = 2$, and give a lower bound for the case $3 \le k < n$. We prove that the state complexity of reversal depends solely on the transition monoid of the DFAO and the mapping that assigns output values to states.Comment: 18 pages, 3 tables. Added missing affiliation/funding informatio

Are Suburban Firms More Likely to Discriminate Against African Americans?

This paper presents a test of the hypothesis that employers in suburban locations are more likely to discriminate against African Americans than are employers located in central cities. Using a difference-in-difference framework, we compare central-city/suburban differences in racial hiring outcomes for firms where a white person is in charge of hiring (white employers, for short) to similar geographic differences in outcomes for firms where a black person is in charge of hiring (black employers). We find that both suburban black and white employers hire fewer blacks than their central-city counterparts. Moreover, the central-city/suburban hiring gap among black employers is as large as, or larger than, that of white employers. Suburban black employers, however, receive many more applications from blacks and hire more blacks than do white firms in either location.

Arabic Music and Burroughs\u27s The Ticket That Exploded

In his article Arabic Music and Burroughs\u27s The Ticket That Exploded David Holzer discusses how the experience of hearing Arabic music in Tangier and being exposed to the healing music of the Master Musicians of Joujouka, a remote village in the foothills of the Ahl Srif mountain range in Northern Morocco, significantly influenced both the writing of William Burroughs and his multi-media experiments. This essay considers what Arabic music and specifically that of Joujouka meant to Burroughs, with particular reference to The Ticket That Exploded (1962). Drawing on The Ticket, Burroughs’s letters, critical studies and biographical material, it demonstrates that his understanding of what the music was and did was fundamental to his creative mission

Within Cities and Suburbs: Racial Residential Concentration and the Spatial Distribution of Employment Opportunities across Submetropolitan Areas

In this paper, we examine and compare the spatial distributions of jobs and people across submetropolitan areas using data on firms from the Multi-City Study of Urban Inequality and data on people from the U.S. Bureau of the Census. The results indicate that less-educated people and those on public assistance mostly reside in areas with high minority populations. Low-skill jobs are quite scarce in these areas, while the availability of such jobs relative to less-educated people in heavily white suburban areas is high. Large fractions of the low-skill jobs in these metropolitan areas are not accessible by public transit. Furthermore, there is significant variation within both central cities and suburbs in the ethnic composition of residents and in the availability of low-skill jobs. The ability of various minority groups to gain employment in each area depends heavily on the ethnic composition of the particular area.

The Magic Number Problem for Subregular Language Families

We investigate the magic number problem, that is, the question whether there exists a minimal n-state nondeterministic finite automaton (NFA) whose equivalent minimal deterministic finite automaton (DFA) has alpha states, for all n and alpha satisfying n less or equal to alpha less or equal to exp(2,n). A number alpha not satisfying this condition is called a magic number (for n). It was shown in [11] that no magic numbers exist for general regular languages, while in [5] trivial and non-trivial magic numbers for unary regular languages were identified. We obtain similar results for automata accepting subregular languages like, for example, combinational languages, star-free, prefix-, suffix-, and infix-closed languages, and prefix-, suffix-, and infix-free languages, showing that there are only trivial magic numbers, when they exist. For finite languages we obtain some partial results showing that certain numbers are non-magic.Comment: In Proceedings DCFS 2010, arXiv:1008.127