Linguistics

Contains reports on two research projects.National Institute of Mental Health (Grant MH-13390-03

Inference and Optimization of Real Edges on Sparse Graphs - A Statistical Physics Perspective

Inference and optimization of real-value edge variables in sparse graphs are studied using the Bethe approximation and replica method of statistical physics. Equilibrium states of general energy functions involving a large set of real edge-variables that interact at the network nodes are obtained in various cases. When applied to the representative problem of network resource allocation, efficient distributed algorithms are also devised. Scaling properties with respect to the network connectivity and the resource availability are found, and links to probabilistic Bayesian approximation methods are established. Different cost measures are considered and algorithmic solutions in the various cases are devised and examined numerically. Simulation results are in full agreement with the theory.Comment: 21 pages, 10 figures, major changes: Sections IV to VII updated, Figs. 1 to 3 replace

Optimal Resource Allocation in Random Networks with Transportation Bandwidths

We apply statistical physics to study the task of resource allocation in random sparse networks with limited bandwidths for the transportation of resources along the links. Useful algorithms are obtained from recursive relations. Bottlenecks emerge when the bandwidths are small, causing an increase in the fraction of idle links. For a given total bandwidth per node, the efficiency of allocation increases with the network connectivity. In the high connectivity limit, we find a phase transition at a critical bandwidth, above which clusters of balanced nodes appear, characterised by a profile of homogenized resource allocation similar to the Maxwell's construction.Comment: 28 pages, 11 figure

Optimal Location of Sources in Transportation Networks

We consider the problem of optimizing the locations of source nodes in transportation networks. A reduction of the fraction of surplus nodes induces a glassy transition. In contrast to most constraint satisfaction problems involving discrete variables, our problem involves continuous variables which lead to cavity fields in the form of functions. The one-step replica symmetry breaking (1RSB) solution involves solving a stable distribution of functionals, which is in general infeasible. In this paper, we obtain small closed sets of functional cavity fields and demonstrate how functional recursions are converted to simple recursions of probabilities, which make the 1RSB solution feasible. The physical results in the replica symmetric (RS) and the 1RSB frameworks are thus derived and the stability of the RS and 1RSB solutions are examined.Comment: 38 pages, 18 figure

Sources to Seafood: Mercury Pollution in the Marine Environment

In 2010, the Toxic Metals Superfund Research Program at Dartmouth College brought together a group of 50 scientists and policy stakeholders to form C-MERC, the Coastal and Marine Mercury Ecosystem Research Collaborative. The goal was to review current knowledge—and knowledge gaps—relating to a global environmental health problem, mercury contamination of the world’s marine fish. C-MERC participants attended two workshops over a two-year period, and in 2012 C-MERC authors published a series of peer-reviewed papers in the journals Environmental Health Perspectives and Environmental Research that elucidated key processes related to the inputs, cycling, and uptake of mercury in marine ecosystems, effects on human health, and policy implications. This report synthesizes the knowledge from these papers in an effort to summarize the science relevant to policies being considered at regional, national, and global levels. The Dartmouth Toxic Metals Superfund Research Program uses an interdisciplinary approach to investigate the ways that arsenic and mercury in the environment affect ecosystems and human health. Arsenic and mercury are commonly found in Superfund sites around the U.S. as well as other areas that result in exposures to certain communities. The Research Translation Core of the program communicates program science to government partners, non-governmental organizations, health care providers and associations, universities and the lay community, and facilitates the use of its research for the protection of public health. The Research Translation Core organized the C-MERC effort. The Superfund Research Program of the National Institute of Environmental Health Sciences supports a network of university programs that investigate the complex health and environmental issues associated with contaminants found at the nation’s hazardous waste sites. The Program coordinates with the Environmental Protection Agency and the Agency for Toxic Substances and Disease Registry of the Centers for Disease Control and Prevention, federal entities charged with management of environmental and human health hazards associated with toxic substances

SIRT3 and SIRT5 regulate the enzyme activity and cardiolipin binding of very long-chain Acyl-CoA dehydrogenase

SIRT3 and SIRT5 have been shown to regulate mitochondrial fatty acid oxidation but the molecular mechanisms behind the regulation are lacking. Here, we demonstrate that SIRT3 and SIRT5 both target human very long-chain acyl-CoA dehydrogenase (VLCAD), a key fatty acid oxidation enzyme. SIRT3 deacetylates and SIRT5 desuccinylates K299 which serves to stabilize the essential FAD cofactor in the active site. Further, we show that VLCAD binds strongly to cardiolipin and isolated mitochondrial membranes via a domain near the C-terminus containing lysines K482, K492, and K507. Acetylation or succinylation of these residues eliminates binding of VLCAD to cardiolipin. SIRT3 deacetylates K507 while SIRT5 desuccinylates K482, K492, and K507. Sirtuin deacylation of recombinant VLCAD rescues membrane binding. Endogenous VLCAD from SIRT3 and SIRT5 knockout mouse liver shows reduced binding to cardiolipin. Thus, SIRT3 and SIRT5 promote fatty acid oxidation by converging upon VLCAD to promote its activity and membrane localization. Regulation of cardiolipin binding by reversible lysine acylation is a novel mechanism that is predicted to extrapolate to other metabolic proteins that localize to the inner mitochondrial membrane

A computational analysis of lower bounds for big bucket production planning problems

In this paper, we analyze a variety of approaches to obtain lower bounds for multi-level production planning problems with big bucket capacities, i.e., problems in which multiple items compete for the same resources. We give an extensive survey of both known and new methods, and also establish relationships between some of these methods that, to our knowledge, have not been presented before. As will be highlighted, understanding the substructures of difficult problems provide crucial insights on why these problems are hard to solve, and this is addressed by a thorough analysis in the paper. We conclude with computational results on a variety of widely used test sets, and a discussion of future research

A topology control approach for utilizing multiple channels in multi-radio wireless mesh networks

We consider the channel assignment problem in a multi-radio wireless mesh network that involves assigning channels to radio interfaces for achieving efficient channel utilization. We present a graph-theoretic formulation of the channel assignment guided by a novel topology control perspective, and show that the resulting optimization problem is NP-complete. We also present an ILP formulation that is used for obtaining a lower bound for the optimum. We then develop a new greedy heuristic channel assignment algorithm (termed CLICA) for finding connected, low interference topologies by utilizing multiple channels. Our evaluations show that the proposed CLICA algorithm exhibits similar behavior and comparable performance relative to the optimum bound with respect to interference and capacity measures. Moreover, our extensive simulation studies show that it can provide a large reduction in interference even with a small number of radios per node, which in turn leads to significant gains in both link layer and multihop performance in 802.11-based multi-radio mesh networks

Local search heuristics for the multidimensional assignment problem

The Multidimensional Assignment Problem (MAP) (abbreviated s-AP in the case of s dimensions) is an extension of the well-known assignment problem. The most studied case of MAP is 3-AP, though the problems with larger values of s also have a large number of applications. We consider several known neighborhoods, generalize them and propose some new ones. The heuristics are evaluated both theoretically and experimentally and dominating algorithms are selected. We also demonstrate that a combination of two neighborhoods may yield a heuristics which is superior to both of its components