The Career of Vernon Briggs, Jr.: A Liberal Economist’s Struggle to Reduce Immigration

[Excerpt] At the conclusion of Cornell’s spring semester in 2007, Briggs ended his 47 years of college teaching. As he retired, Cornell honored him with emeritus status. Since then, he has occasionally given public talks and written articles on the need for immigration reform. He says his work still draws motivation from a principle he left with his students at the end of the last lecture in each of his classes over his entire career: “The mode through which the impossible comes to pass is effort.” That quote from Justice Oliver Wendell Homes was passed on to Briggs by Michigan State University professor Charles Killingsworth. In his long, remarkable career, Briggs has honored Holmes, Killingsworth, and his profession by passing it on — in word and deed — to countless others

A Data-driven Approach to Robust Control of Multivariable Systems by Convex Optimization

The frequency-domain data of a multivariable system in different operating points is used to design a robust controller with respect to the measurement noise and multimodel uncertainty. The controller is fully parametrized in terms of matrix polynomial functions and can be formulated as a centralized, decentralized or distributed controller. All standard performance specifications like $H_2$, $H_\infty$ and loop shaping are considered in a unified framework for continuous- and discrete-time systems. The control problem is formulated as a convex-concave optimization problem and then convexified by linearization of the concave part around an initial controller. The performance criterion converges monotonically to a local optimal solution in an iterative algorithm. The effectiveness of the method is compared with fixed-structure controllers using non-smooth optimization and with full-order optimal controllers via simulation examples. Finally, the experimental data of a gyroscope is used to design a data-driven controller that is successfully applied on the real system

Space-Efficient Biconnected Components and Recognition of Outerplanar Graphs

We present space-efficient algorithms for computing cut vertices in a given graph with $n$ vertices and $m$ edges in linear time using $O(n+\min\{m,n\log \log n\})$ bits. With the same time and using $O(n+m)$ bits, we can compute the biconnected components of a graph. We use this result to show an algorithm for the recognition of (maximal) outerplanar graphs in $O(n\log \log n)$ time using $O(n)$ bits

On Temporal Graph Exploration

A temporal graph is a graph in which the edge set can change from step to step. The temporal graph exploration problem TEXP is the problem of computing a foremost exploration schedule for a temporal graph, i.e., a temporal walk that starts at a given start node, visits all nodes of the graph, and has the smallest arrival time. In the first part of the paper, we consider only temporal graphs that are connected at each step. For such temporal graphs with $n$ nodes, we show that it is NP-hard to approximate TEXP with ratio $O(n^{1-\epsilon})$ for any $\epsilon>0$. We also provide an explicit construction of temporal graphs that require $\Theta(n^2)$ steps to be explored. We then consider TEXP under the assumption that the underlying graph (i.e. the graph that contains all edges that are present in the temporal graph in at least one step) belongs to a specific class of graphs. Among other results, we show that temporal graphs can be explored in $O(n^{1.5} k^2 \log n)$ steps if the underlying graph has treewidth $k$ and in $O(n \log^3 n)$ steps if the underlying graph is a $2\times n$ grid. In the second part of the paper, we replace the connectedness assumption by a weaker assumption and show that $m$-edge temporal graphs with regularly present edges and with random edges can always be explored in $O(m)$ steps and $O(m \log n)$ steps with high probability, respectively. We finally show that the latter result can be used to obtain a distributed algorithm for the gossiping problem.Comment: This is an extended version of an ICALP 2015 pape

Reach and speed of judgment propagation in the laboratory

In recent years, a large body of research has demonstrated that judgments and behaviors can propagate from person to person. Phenomena as diverse as political mobilization, health practices, altruism, and emotional states exhibit similar dynamics of social contagion. The precise mechanisms of judgment propagation are not well understood, however, because it is difficult to control for confounding factors such as homophily or dynamic network structures. We introduce a novel experimental design that renders possible the stringent study of judgment propagation. In this design, experimental chains of individuals can revise their initial judgment in a visual perception task after observing a predecessor's judgment. The positioning of a very good performer at the top of a chain created a performance gap, which triggered waves of judgment propagation down the chain. We evaluated the dynamics of judgment propagation experimentally. Despite strong social influence within pairs of individuals, the reach of judgment propagation across a chain rarely exceeded a social distance of three to four degrees of separation. Furthermore, computer simulations showed that the speed of judgment propagation decayed exponentially with the social distance from the source. We show that information distortion and the overweighting of other people's errors are two individual-level mechanisms hindering judgment propagation at the scale of the chain. Our results contribute to the understanding of social contagion processes, and our experimental method offers numerous new opportunities to study judgment propagation in the laboratory

Disrupting Illicit Supply Networks: New Applications of Operations Research and Data Analytics to End Modern Slavery

Report from a 2017 National Science Foundation workshop on promising research directions for applications of operations research and data analytics toward the disruption of illicit supply networks like human trafficking. The workshop was funded by the NSF’s Operations Engineering (ENG) and the Law & Social Sciences Program (SBE) under grant # CMMI-1726895. The report addresses the opportunity to apply advances from the fields of operations research, management science, analytics, machine learning, and data science toward the development of disruptive interventions against illicit networks. Such an extension of the current research agenda for trafficking would move understanding of such dynamic systems from descriptive characterization and predictive estimation toward improved dynamic operational control.Bureau of Business Researc

Systems of Natural Logic with Adjectives and Their Completeness

In natural logic, the goal is to create a system of logic that is as sim- ilar to natural language as possible. In order to build a natural logic, simple sentence forms are considered, slowly incorporating more language throughout time. As background, we rst consider the fragments of the form All X are Y and then add No X are Y , where X and Y are nouns. We will look at the rules of logic and completeness of their proof sys- tems. Next, we will introduce the idea of intersecting adjectives which are adjectives with meaning separate from the noun being modifying. For example, the plural noun red cars means the intersection of everything red and everything that is a car. This paper will then present versions of the simple systems that contain intersecting adjectives and will discuss their completeness.NS