Tidally induced upwelling off Yangtze River estuary and in Zhejiang coastal waters in summer

MASNUM wave-tide-circulation coupled numerical model (MASNUM coupled model, hereinafter) is developed based on the Princeton Ocean Model (POM). Both POM and MASNUM coupled model are applied in the numerical simulation of the upwelling off Yangtze River estuary and in Zhejiang coastal waters in summer. The upwelling mechanisms are analyzed from the viewpoint of tide, and a new mechanism is proposed. The study suggests that the tidally inducing mechanism of the upwelling includes two dynamic aspects: the barotropic and the baroclinic process. On the one hand, the residual currents induced by barotropic tides converge near the seabed, and upwelling is generated to maintain mass conservation. The climbing of the residual currents along the sea bottom slope also contributes to the upwelling. On the other hand, tidal mixing plays a very important role in inducing the upwelling in the baroclinic sea circumstances. Strong tidal mixing leads to conspicuous front in the coastal waters. The considerable horizontal density gradient across the front elicits a secondary circulation clinging to the tidal front, and the upwelling branch appears near the frontal zone. Numerical experiments are designed to determine the importance of tide in inducing the upwelling. The results indicate that tide is a key and dominant inducement of the upwelling. Experiments also show that coupling calculation of the four main tidal constituents(M-2, S-2, K-1, and O-1), rather than dealing with the single M-2 constituent, improves the modeling precision of the barotropic tide-induced upwelling.

Robust and Efficient 3D Recognition by Alignment

Alignment is a prevalent approach for recognizing 3D objects in 2D images. A major problem with current implementations is how to robustly handle errors that propagate from uncertainties in the locations of image features. This thesis gives a technique for bounding these errors. The technique makes use of a new solution to the problem of recovering 3D pose from three matching point pairs under weak-perspective projection. Furthermore, the error bounds are used to demonstrate that using line segments for features instead of points significantly reduces the false positive rate, to the extent that alignment can remain reliable even in cluttered scenes.

CO adsorption and correlation between CO surface coverage and activity/selectivity of preferential CO oxidation over supported Ag catalyst: an in situ FTIR study

In situ IR measurements for CO adsorption and preferential CO oxidation in H-2-rich gases over Ag/SiO2 catalysts are presented in this paper. CO adsorbed on the Ag/SiO2 pretreated with oxygen shows a band centered around 2169 cm(-1), which is assigned to CO linearly bonded to Ag+ sites. The amount of adsorbed CO on the silver particles ( manifested by an IR band at 2169 cm(-1)) depends strongly on the CO partial pressure and the temperature. The steady-state coverage on the Ag surface is shown to be significantly below saturation, and the oxidation of CO with surface oxygen species is probably via a non-competitive Langmuir Hinshelwood mechanism on the silver catalyst which occurs in the high-rate branch on a surface covered with CO below saturation. A low reactant concentration on the Ag surface indicates that the reaction order with respect to Pco is positive, and the selectivity towards CO2 decreases with the decrease of Pco. On the other hand, the decrease of the selectivity with the reaction temperature also reflects the higher apparent activation energy for H-2 oxidation than that for CO oxidation.

Peasant and Community in medieval England, 1200-1500

Schofield, Phillipp, Peasant and Community in medieval England, 1200-1500 (New York: Palgrave Macmillan, 2003), pp.vii+279 RAE2008

Quantum Lower Bounds for Fanout

We prove several new lower bounds for constant depth quantum circuits. The main result is that parity (and hence fanout) requires log depth circuits, when the circuits are composed of single qubit and arbitrary size Toffoli gates, and when they use only constantly many ancillae. Under this constraint, this bound is close to optimal. In the case of a non-constant number of ancillae, we give a tradeoff between the number of ancillae and the required depth.

Bounds on the Power of Constant-Depth Quantum Circuits

We show that if a language is recognized within certain error bounds by constant-depth quantum circuits over a finite family of gates, then it is computable in (classical) polynomial time. In particular, our results imply EQNC^0 ⊆ P, where EQNC^0 is the constant-depth analog of the class EQP. On the other hand, we adapt and extend ideas of Terhal and DiVincenzo [?] to show that, for any family

Cache-and-Relay Streaming Media Delivery for Asynchronous Clients

We consider the problem of delivering popular streaming media to a large number of asynchronous clients. We propose and evaluate a cache-and-relay end-system multicast approach, whereby a client joining a multicast session caches the stream, and if needed, relays that stream to neighboring clients which may join the multicast session at some later time. This cache-and-relay approach is fully distributed, scalable, and efficient in terms of network link cost. In this paper we analytically derive bounds on the network link cost of our cache-and-relay approach, and we evaluate its performance under assumptions of limited client bandwidth and limited client cache capacity. When client bandwidth is limited, we show that although finding an optimal solution is NP-hard, a simple greedy algorithm performs surprisingly well in that it incurs network link costs that are very close to a theoretical lower bound. When client cache capacity is limited, we show that our cache-and-relay approach can still significantly reduce network link cost. We have evaluated our cache-and-relay approach using simulations over large, synthetic random networks, power-law degree networks, and small-world networks, as well as over large real router-level Internet maps.

Collocation Games and Their Application to Distributed Resource Management

We introduce Collocation Games as the basis of a general framework for modeling, analyzing, and facilitating the interactions between the various stakeholders in distributed systems in general, and in cloud computing environments in particular. Cloud computing enables fixed-capacity (processing, communication, and storage) resources to be offered by infrastructure providers as commodities for sale at a fixed cost in an open marketplace to independent, rational parties (players) interested in setting up their own applications over the Internet. Virtualization technologies enable the partitioning of such fixed-capacity resources so as to allow each player to dynamically acquire appropriate fractions of the resources for unencumbered use. In such a paradigm, the resource management problem reduces to that of partitioning the entire set of applications (players) into subsets, each of which is assigned to fixed-capacity cloud resources. If the infrastructure and the various applications are under a single administrative domain, this partitioning reduces to an optimization problem whose objective is to minimize the overall deployment cost. In a marketplace, in which the infrastructure provider is interested in maximizing its own profit, and in which each player is interested in minimizing its own cost, it should be evident that a global optimization is precisely the wrong framework. Rather, in this paper we use a game-theoretic framework in which the assignment of players to fixed-capacity resources is the outcome of a strategic "Collocation Game". Although we show that determining the existence of an equilibrium for collocation games in general is NP-hard, we present a number of simplified, practically-motivated variants of the collocation game for which we establish convergence to a Nash Equilibrium, and for which we derive convergence and price of anarchy bounds. In addition to these analytical results, we present an experimental evaluation of implementations of some of these variants for cloud infrastructures consisting of a collection of multidimensional resources of homogeneous or heterogeneous capacities. Experimental results using trace-driven simulations and synthetically generated datasets corroborate our analytical results and also illustrate how collocation games offer a feasible distributed resource management alternative for autonomic/self-organizing systems, in which the adoption of a global optimization approach (centralized or distributed) would be neither practical nor justifiable.

On Finding Sensitivity of Quantum and Classical Gates

We consider a fault model of Boolean gates, both classical and quantum, where some of the inputs may not be connected to the actual gate hardware. This model is somewhat similar to the stuck-at model which is a very popular model in testing Boolean circuits. We consider the problem of detecting such faults; the detection algorithm can query the faulty gate and its complexity is the number of such queries. This problem is related to determining the sensitivity of Boolean functions. We show how quantum parallelism can be used to detect such faults. Specifically, we show that a quantum algorithm can detect such faults more efficiently than a classical algorithm for a Parity gate and an AND gate. We give explicit constructions of quantum detector algorithms and show lower bounds for classical algorithms. We show that the model for detecting such faults is similar to algebraic decision trees and extend some known results from quantum query complexity to prove some of our results.

Amorphous Placement and Retrieval of Sensory Data in Sparse Mobile Ad-Hoc Networks

Abstract—Personal communication devices are increasingly being equipped with sensors that are able to passively collect information from their surroundings – information that could be stored in fairly small local caches. We envision a system in which users of such devices use their collective sensing, storage, and communication resources to query the state of (possibly remote) neighborhoods. The goal of such a system is to achieve the highest query success ratio using the least communication overhead (power). We show that the use of Data Centric Storage (DCS), or directed placement, is a viable approach for achieving this goal, but only when the underlying network is well connected. Alternatively, we propose, amorphous placement, in which sensory samples are cached locally and informed exchanges of cached samples is used to diffuse the sensory data throughout the whole network. In handling queries, the local cache is searched first for potential answers. If unsuccessful, the query is forwarded to one or more direct neighbors for answers. This technique leverages node mobility and caching capabilities to avoid the multi-hop communication overhead of directed placement. Using a simplified mobility model, we provide analytical lower and upper bounds on the ability of amorphous placement to achieve uniform field coverage in one and two dimensions. We show that combining informed shuffling of cached samples upon an encounter between two nodes, with the querying of direct neighbors could lead to significant performance improvements. For instance, under realistic mobility models, our simulation experiments show that amorphous placement achieves 10% to 40% better query answering ratio at a 25% to 35% savings in consumed power over directed placement.

Leaf galls in our native trees and shrubs

Plant galls constitute a branch of study and research which has been to me a subject of much interest for some time. At the start of this work, it was intended to include Plant galls in general, but after some months this was found to be too comprehensive a field and would in fact take a great many years to study fully. Even leaf galls alone, both of herbs and trees provide so large a field of investigation that ultimately I decided to confine my attention to those or our native trees and shrubs. Upon looking up the literature on this subject, it will be found that in nearly all cases, either the gall is described fully and mere mention made or the agent concerned in its production, or vice versa. This state of things is most unsatisfactory, as in studying galls, both the gall-maker and the gall formation must be examined in detail before it is safe to apply nomenclature. This work, therefore, sets out to give accurate and scientific descriptions of both galls and gall-makers. The difficulties encountered are manifold; firstly, our trees are all deciduous, hence, the collecting period is necessarily restricted to that time of the year between the appearance of the buds and the fall of the leaf. Secondly, the rearing of imagines is always difficult, especially in the case or the autumn gall; more will be said on this matter later. Lastly, due to war-time conditions much trouble was experienced in obtaining suitable literature and many invaluable books on this subject were unprocurable. The Plates at the back have all been copied from original material except in the case or the Phytoptid mites which have been sketched with the help of illustrations, the reason for this being the difficulty of making suitable mounts of these minute creatures, Where possible all stages or at least larva and imago have been sketched, together with the host plant and the type of gall-formation produced. Slides have also been made of most larvae and the imagines attached to cards and pinned on to pith or cork in the usual manner.

Sequential anomaly detection in the presence of noise and limited feedback

This paper describes a methodology for detecting anomalies from sequentially observed and potentially noisy data. The proposed approach consists of two main elements: 1) filtering, or assigning a belief or likelihood to each successive measurement based upon our ability to predict it from previous noisy observations and 2) hedging, or flagging potential anomalies by comparing the current belief against a time-varying and data-adaptive threshold. The threshold is adjusted based on the available feedback from an end user. Our algorithms, which combine universal prediction with recent work on online convex programming, do not require computing posterior distributions given all current observations and involve simple primal-dual parameter updates. At the heart of the proposed approach lie exponential-family models which can be used in a wide variety of contexts and applications, and which yield methods that achieve sublinear per-round regret against both static and slowly varying product distributions with marginals drawn from the same exponential family. Moreover, the regret against static distributions coincides with the minimax value of the corresponding online strongly convex game. We also prove bounds on the number of mistakes made during the hedging step relative to the best offline choice of the threshold with access to all estimated beliefs and feedback signals. We validate the theory on synthetic data drawn from a time-varying distribution over binary vectors of high dimensionality, as well as on the Enron email dataset. © 1963-2012 IEEE.

Information relaxations and duality in stochastic dynamic programs

We describe a general technique for determining upper bounds on maximal values (or lower bounds on minimal costs) in stochastic dynamic programs. In this approach, we relax the nonanticipativity constraints that require decisions to depend only on the information available at the time a decision is made and impose a "penalty" that punishes violations of nonanticipativity. In applications, the hope is that this relaxed version of the problem will be simpler to solve than the original dynamic program. The upper bounds provided by this dual approach complement lower bounds on values that may be found by simulating with heuristic policies. We describe the theory underlying this dual approach and establish weak duality, strong duality, and complementary slackness results that are analogous to the duality results of linear programming. We also study properties of good penalties. Finally, we demonstrate the use of this dual approach in an adaptive inventory control problem with an unknown and changing demand distribution and in valuing options with stochastic volatilities and interest rates. These are complex problems of significant practical interest that are quite difficult to solve to optimality. In these examples, our dual approach requires relatively little additional computation and leads to tight bounds on the optimal values. © 2010 INFORMS.

The empirical analysis of cigarette tax avoidance and illicit trade in Vietnam, 1998-2010.

Illicit trade carries the potential to magnify existing tobacco-related health care costs through increased availability of untaxed and inexpensive cigarettes. What is known with respect to the magnitude of illicit trade for Vietnam is produced primarily by the industry, and methodologies are typically opaque. Independent assessment of the illicit cigarette trade in Vietnam is vital to tobacco control policy. This paper measures the magnitude of illicit cigarette trade for Vietnam between 1998 and 2010 using two methods, discrepancies between legitimate domestic cigarette sales and domestic tobacco consumption estimated from surveys, and trade discrepancies as recorded by Vietnam and trade partners. The results indicate that Vietnam likely experienced net smuggling in during the period studied. With the inclusion of adjustments for survey respondent under-reporting, inward illicit trade likely occurred in three of the four years for which surveys were available. Discrepancies in trade records indicate that the value of smuggled cigarettes into Vietnam ranges from $100 million to $300 million between 2000 and 2010 and that these cigarettes primarily originate in Singapore, Hong Kong, Macao, Malaysia, and Australia. Notable differences in trends over time exist between the two methods, but by comparison, the industry estimates consistently place the magnitude of illicit trade at the upper bounds of what this study shows. The unavailability of annual, survey-based estimates of consumption may obscure the true, annual trend over time. Second, as surveys changed over time, estimates relying on them may be inconsistent with one another. Finally, these two methods measure different components of illicit trade, specifically consumption of illicit cigarettes regardless of origin and smuggling of cigarettes into a particular market. However, absent a gold standard, comparisons of different approaches to illicit trade measurement serve efforts to refine and improve measurement approaches and estimates.

The Function and Regulation of Photobodies in Phytochrome Signaling

Light is a critical environmental signal that regulates every phase of the plant life cycle, from germination to floral initiation. Of the many light receptors in the model plant Arabidopsis thaliana, the red- and far-red light-sensing phytochromes (phys) are arguably the best studied, but the earliest events in the phy signaling pathway remain poorly understood. One of the earliest phy signaling events is the translocation of photoactivated phys from the cytoplasm to the nucleus, where they localize to subnuclear foci termed photobodies; in continuous light, photobody localization correlates closely with the light-dependent inhibition of embryonic stem growth. Despite a growing body of evidence supporting the biological significance of photobodies in light signaling, photobodies have also been shown to be dispensable for seedling growth inhibition in continuous light, so their physiological importance remains controversial; additionally, the molecular components that are required for phy localization to photobodies are largely unknown. The overall goal of my dissertation research was to gain insight into the early steps of phy signaling by further defining the role of photobodies in this process and identifying additional intragenic and extragenic requirements for phy localization to photobodies.

Even though the domain structure of phys has been extensively studied, not all of the intramolecular requirements for phy localization to photobodies are known. Previous studies have shown that the entire C-terminus of phys is both necessary and sufficient for their localization to photobodies. However, the importance of the individual subdomains of the C-terminus is still unclear. For example a truncation lacking part of the most C-terminal domain, the histidine kinase-related domain (HKRD), can still localize to small photobodies in the light and behaves like a weak allele. However, a point mutation within the HKRD renders the entire molecule completely inactive. To resolve this discrepancy, I explored the hypothesis that this point mutation might impair the dimerization of the HKRD; dimerization has been shown to occur via the C-terminus of phy and is required for more efficient signaling. I show that this point mutation impairs nuclear localization of phy as well as its subnuclear localization to photobodies. Additionally, yeast-two-hybrid analysis shows that the wild-type HKRD can homodimerize but that the HKRD containing the point mutation fails to dimerize with both itself and with wild-type HKRD. These results demonstrate that dimerization of the HKRD is required for both nuclear and photobody localization of phy.

Studies of seedlings grown in diurnal conditions show that photoactivated phy can persist into darkness to repress seedling growth; a seedling's growth rate is therefore fastest at the end of the night. To test the idea that photobodies could be involved in regulating seedling growth in the dark, I compared the growth of two transgenic Arabidopsis lines, one in which phy can localize to photobodies (PBG), and one in which it cannot (NGB). Despite these differences in photobody morphology, both lines are capable of transducing light signals and inhibiting seedling growth in continuous light. After the transition from red light to darkness, the PBG line was able to repress seedling growth, as well as the accumulation of the growth-promoting, light-labile transcription factor PHYTOCHROME INTERACTING FACTOR 3 (PIF3), for eighteen hours, and this correlated perfectly with the presence of photobodies. Reducing the amount of active phy by either reducing the light intensity or adding a phy-inactivating far-red pulse prior to darkness led to faster accumulation of PIF3 and earlier seedling growth. In contrast, the NGB line accumulated PIF3 even in the light, and seedling growth was only repressed for six hours; this behavior was similar in NGB regardless of the light treatment. These results suggest that photobodies are required for the degradation of PIF3 and for the prolonged stabilization of active phy in darkness. They also support the hypothesis that photobody localization of phys could serve as an instructive cue during the light-to-dark transition, thereby fine-tuning light-dependent responses in darkness.

In addition to determining an intragenic requirement for photobody localization and further exploring the significance of photobodies in phy signaling, I wanted to identify extragenic regulators of photobody localization. A recent study identified one such factor, HEMERA (HMR); hmr mutants do not form large photobodies, and they are tall and albino in the light. To identify other components in the HMR-mediated branch of the phy signaling pathway, I performed a forward genetic screen for suppressors of a weak hmr allele. Surprisingly, the first three mutants isolated from the screen were alleles of the same novel gene, SON OF HEMERA (SOH). The soh mutations rescue all of the phenotypes associated with the weak hmr allele, and they do so in an allele-specific manner, suggesting a direct interaction between SOH and HMR. Null soh alleles, which were isolated in an independent, tall, albino screen, are defective in photobody localization, demonstrating that SOH is an extragenic regulator of phy localization to photobodies that works in the same genetic pathway as HMR.

In this work, I show that dimerization of the HKRD is required for both the nuclear and photobody localization of phy. I also demonstrate a tight correlation between photobody localization and PIF3 degradation, further establishing the significance of photobodies in phy signaling. Finally, I identify a novel gene, SON OF HEMERA, whose product is necessary for phy localization to photobodies in the light, thereby isolating a new extragenic determinant of photobody localization. These results are among the first to focus exclusively on one of the earliest cellular responses to light - photobody localization of phys - and they promise to open up new avenues into the study of a poorly understood facet of the phy signaling pathway.