CHIEFTAIN - A New Red-Skinned Potato

A new high-yielding, moderately scab free, red-skinned potato has just been released. Named Chieftain, it is especially suitable to Northern Iowa

Distributed Deterministic Broadcasting in Uniform-Power Ad Hoc Wireless Networks

Development of many futuristic technologies, such as MANET, VANET, iThings, nano-devices, depend on efficient distributed communication protocols in multi-hop ad hoc networks. A vast majority of research in this area focus on design heuristic protocols, and analyze their performance by simulations on networks generated randomly or obtained in practical measurements of some (usually small-size) wireless networks. %some library. Moreover, they often assume access to truly random sources, which is often not reasonable in case of wireless devices. In this work we use a formal framework to study the problem of broadcasting and its time complexity in any two dimensional Euclidean wireless network with uniform transmission powers. For the analysis, we consider two popular models of ad hoc networks based on the Signal-to-Interference-and-Noise Ratio (SINR): one with opportunistic links, and the other with randomly disturbed SINR. In the former model, we show that one of our algorithms accomplishes broadcasting in $O(D\log^2 n)$ rounds, where $n$ is the number of nodes and $D$ is the diameter of the network. If nodes know a priori the granularity $g$ of the network, i.e., the inverse of the maximum transmission range over the minimum distance between any two stations, a modification of this algorithm accomplishes broadcasting in $O(D\log g)$ rounds. Finally, we modify both algorithms to make them efficient in the latter model with randomly disturbed SINR, with only logarithmic growth of performance. Ours are the first provably efficient and well-scalable, under the two models, distributed deterministic solutions for the broadcast task.Comment: arXiv admin note: substantial text overlap with arXiv:1207.673

Localization of Denaturation Bubbles in Random DNA Sequences

We study the thermodynamic and dynamic behaviors of twist-induced denaturation bubbles in a long, stretched random sequence of DNA. The small bubbles associated with weak twist are delocalized. Above a threshold torque, the bubbles of several tens of bases or larger become preferentially localized to \AT-rich segments. In the localized regime, the bubbles exhibit ``aging'' and move around sub-diffusively with continuously varying dynamic exponents. These properties are derived using results of large-deviation theory together with scaling arguments, and are verified by Monte-Carlo simulations.Comment: TeX file with postscript figure

Hamiltonian analysis of SO(4,1) constrained BF theory

In this paper we discuss canonical analysis of SO(4,1) constrained BF theory. The action of this theory contains topological terms appended by a term that breaks the gauge symmetry down to the Lorentz subgroup SO(3,1). The equations of motion of this theory turn out to be the vacuum Einstein equations. By solving the B field equations one finds that the action of this theory contains not only the standard Einstein-Cartan term, but also the Holst term proportional to the inverse of the Immirzi parameter, as well as a combination of topological invariants. We show that the structure of the constraints of a SO(4,1) constrained BF theory is exactly that of gravity in Holst formulation. We also briefly discuss quantization of the theory.Comment: 9 page

Information Gathering in Ad-Hoc Radio Networks with Tree Topology

We study the problem of information gathering in ad-hoc radio networks without collision detection, focussing on the case when the network forms a tree, with edges directed towards the root. Initially, each node has a piece of information that we refer to as a rumor. Our goal is to design protocols that deliver all rumors to the root of the tree as quickly as possible. The protocol must complete this task within its allotted time even though the actual tree topology is unknown when the computation starts. In the deterministic case, assuming that the nodes are labeled with small integers, we give an O(n)-time protocol that uses unbounded messages, and an O(n log n)-time protocol using bounded messages, where any message can include only one rumor. We also consider fire-and-forward protocols, in which a node can only transmit its own rumor or the rumor received in the previous step. We give a deterministic fire-and- forward protocol with running time O(n^1.5), and we show that it is asymptotically optimal. We then study randomized algorithms where the nodes are not labelled. In this model, we give an O(n log n)-time protocol and we prove that this bound is asymptotically optimal

Curvature homogeneous spacelike Jordan Osserman pseudo-Riemannian manifolds

Let s be at least 2. We construct Ricci flat pseudo-Riemannian manifolds of signature (2s,s) which are not locally homogeneous but whose curvature tensors never the less exhibit a number of important symmetry properties. They are curvature homogeneous; their curvature tensor is modeled on that of a local symmetric space. They are spacelike Jordan Osserman with a Jacobi operator which is nilpotent of order 3; they are not timelike Jordan Osserman. They are k-spacelike higher order Jordan Osserman for $2\le k\le s$; they are k-timelike higher order Jordan Osserman for $s+2\le k\le 2s$, and they are not k timelike higher order Jordan Osserman for $2\le s\le s+1$.Comment: Update bibliography, fix minor misprint

Productivity estimation in Halodule wrightii: comparison of leaf-clipping and leaf-marking techniques, and the importance of clip height

We compared estimates of Halodule wrightii leaf growth rates obtained from leaf-clipping and leaf-piercing methods in a south Texas lagoon. Leaf clipping underestimated leaf production from 15 to 37% in winter and 25 to 60% in summer relative to leaf piercing. The underestimation of leaf-clipping derived growth rates were corrected using a linear regression between leaf growth rates determined by leaf-clipping and leaf-piercing methods. To examine the effect of clip height on H. wrightii leaf growth rate estimation, leaves were clipped at 0, 2, 4, 6, and 8 cm above the sediment. Leaves clipped at 2 cm exhibited the fastest leaf growth rate (average = 3.66 mm d–1) while leaves clipped at 8 cm had the slowest rate (average = 2.30 mm d–1). Depressed leaf growth rates for 8 cm clip height were likely due to the slowing of growth rate with increasing leaf age. Reduced growth rate for the 0 cm clip height treatment may be attributable to removal of nearly all photosynthetic tissue and limited below-ground resources. In design of leaf-clipping studies, it is suggested that the selection of clip height and the period of growth after clipping be optimized for each season of a study