On the notions of facets, weak facets, and extreme functions of the Gomory-Johnson infinite group problem

We investigate three competing notions that generalize the notion of a facet of finite-dimensional polyhedra to the infinite-dimensional Gomory-Johnson model. These notions were known to coincide for continuous piecewise linear functions with rational breakpoints. We show that two of the notions, extreme functions and facets, coincide for the case of continuous piecewise linear functions, removing the hypothesis regarding rational breakpoints. We then separate the three notions using discontinuous examples.Comment: 18 pages, 2 figure

Software for cut-generating functions in the Gomory--Johnson model and beyond

We present software for investigations with cut generating functions in the Gomory-Johnson model and extensions, implemented in the computer algebra system SageMath.Comment: 8 pages, 3 figures; to appear in Proc. International Congress on Mathematical Software 201

The Dynamics of Metropolitan Housing Prices

This article is the winner of the Innovative Thinking ‘‘Thinking Out of the Box’’ manuscript prize (sponsored by the Homer Hoyt Advanced Studies Institute) presented at the 2001 American Real Estate Society Annual Meeting. This study examines the dynamics of real housing price appreciation in 130 metropolitan areas across the United States. The study finds that real housing price appreciation is strongly influenced by the growth of population and real changes in income, construction costs and interest rates. The study also finds that stock market appreciation imparts a strong current and lagged wealth effect on housing prices. Housing appreciation rates also are found to vary across areas because of location-specific fixed-effects; these fixed effects represent the residuals of housing price appreciation attributable to location. The magnitudes of the fixed-effects in particular cities are positively correlated with restrictive growth management policies and limitations on land availability.

The structure of the infinite models in integer programming

The infinite models in integer programming can be described as the convex hull of some points or as the intersection of halfspaces derived from valid functions. In this paper we study the relationships between these two descriptions. Our results have implications for corner polyhedra. One consequence is that nonnegative, continuous valid functions suffice to describe corner polyhedra (with or without rational data)

Efficient Enumeration of Induced Subtrees in a K-Degenerate Graph

In this paper, we address the problem of enumerating all induced subtrees in an input k-degenerate graph, where an induced subtree is an acyclic and connected induced subgraph. A graph G = (V, E) is a k-degenerate graph if for any its induced subgraph has a vertex whose degree is less than or equal to k, and many real-world graphs have small degeneracies, or very close to small degeneracies. Although, the studies are on subgraphs enumeration, such as trees, paths, and matchings, but the problem addresses the subgraph enumeration, such as enumeration of subgraphs that are trees. Their induced subgraph versions have not been studied well. One of few example is for chordless paths and cycles. Our motivation is to reduce the time complexity close to O(1) for each solution. This type of optimal algorithms are proposed many subgraph classes such as trees, and spanning trees. Induced subtrees are fundamental object thus it should be studied deeply and there possibly exist some efficient algorithms. Our algorithm utilizes nice properties of k-degeneracy to state an effective amortized analysis. As a result, the time complexity is reduced to O(k) time per induced subtree. The problem is solved in constant time for each in planar graphs, as a corollary

Biodiversity and ecosystem services in the Frome catchment, Purbeck district, United Kingdom

A map for valuing ecosystem services in the 480 km2 Frome catchment, to investigate scenarios of change in land use, was internet crowd-sourced. Scouts mapped deer habitats in 15% of the 30 km2 Arne Parish, while 143 residents volunteered data on deer sightings in the 5-year community survey

Factoring nonnegative matrices with linear programs

This paper describes a new approach, based on linear programming, for computing nonnegative matrix factorizations (NMFs). The key idea is a data-driven model for the factorization where the most salient features in the data are used to express the remaining features. More precisely, given a data matrix X, the algorithm identifies a matrix C such that X approximately equals CX and some linear constraints. The constraints are chosen to ensure that the matrix C selects features; these features can then be used to find a low-rank NMF of X. A theoretical analysis demonstrates that this approach has guarantees similar to those of the recent NMF algorithm of Arora et al. (2012). In contrast with this earlier work, the proposed method extends to more general noise models and leads to efficient, scalable algorithms. Experiments with synthetic and real datasets provide evidence that the new approach is also superior in practice. An optimized C++ implementation can factor a multigigabyte matrix in a matter of minutes.Comment: 17 pages, 10 figures. Modified theorem statement for robust recovery conditions. Revised proof techniques to make arguments more elementary. Results on robustness when rows are duplicated have been superseded by arxiv.org/1211.668

A management architecture for active networks

In this paper we present an architecture for network and applications management, which is based on the Active Networks paradigm and shows the advantages of network programmability. The stimulus to develop this architecture arises from an actual need to manage a cluster of active nodes, where it is often required to redeploy network assets and modify nodes connectivity. In our architecture, a remote front-end of the managing entity allows the operator to design new network topologies, to check the status of the nodes and to configure them. Moreover, the proposed framework allows to explore an active network, to monitor the active applications, to query each node and to install programmable traps. In order to take advantage of the Active Networks technology, we introduce active SNMP-like MIBs and agents, which are dynamic and programmable. The programmable management agents make tracing distributed applications a feasible task. We propose a general framework that can inter-operate with any active execution environment. In this framework, both the manager and the monitor front-ends communicate with an active node (the Active Network Access Point) through the XML language. A gateway service performs the translation of the queries from XML to an active packet language and injects the code in the network. We demonstrate the implementation of an active network gateway for PLAN (Packet Language for Active Networks) in a forty active nodes testbed. Finally, we discuss an application of the active management architecture to detect the causes of network failures by tracing network events in time

BKM Lie superalgebra for the Z_5 orbifolded CHL string

We study the Z_5-orbifolding of the CHL string theory by explicitly constructing the modular form tilde{Phi}_2 generating the degeneracies of the 1/4-BPS states in the theory. Since the additive seed for the sum form is a weak Jacobi form in this case, a mismatch is found between the modular forms generated from the additive lift and the product form derived from threshold corrections. We also construct the BKM Lie superalgebra, tilde{G}_5, corresponding to the modular form tilde{Delta}_1 (Z) = tilde{Phi}_2 (Z)^{1/2} which happens to be a hyperbolic algebra. This is the first occurrence of a hyperbolic BKM Lie superalgebra. We also study the walls of marginal stability of this theory in detail, and extend the arithmetic structure found by Cheng and Dabholkar for the N=1,2,3 orbifoldings to the N=4,5 and 6 models, all of which have an infinite number of walls in the fundamental domain. We find that analogous to the Stern-Brocot tree, which generated the intercepts of the walls on the real line, the intercepts for the N >3 cases are generated by linear recurrence relations. Using the correspondence between the walls of marginal stability and the walls of the Weyl chamber of the corresponding BKM Lie superalgebra, we propose the Cartan matrices for the BKM Lie superalgebras corresponding to the N=5 and 6 models.Comment: 30 pages, 2 figure