Meromorphic exact solutions of the generalized Bretherton equation

The generalized Bretherton equation is studied. The classification of the meromorphic traveling wave solutions for this equation is presented. All possible exact solutions of the generalized Brethenton equation are given

N=1N=1 supersymmetry and the three loop anomalous dimension for the chiral superfield

We calculate the three loop anomalous dimension for a general $N=1$ supersymmetric gauge theory. The result is used to probe the possible existence of renormalisation invariant relationships between the Yukawa and gauge couplings.Comment: 18 pages. Uses Harvmac. Revised version includes discussion of the special case of the Wess-Zumino mode

An Options-Based Method to Solve the Composability Problem in Sequential Auctions

Current auctions often expose bidding agents to two difficult, yet common, problems. First, bidding agents often have the opportunity to participate in successive auctions selling the same good, with no dominant bidding strategy in any single auction. Second, bidding agents often need to acquire a bundle of goods by bidding in multiple auctions, again with no dominant bidding strategy in any single auction. This paper introduces an options-based infrastructure that respects the autonomy of individual sellers but still enables bidders to utilize a dominant, truthful strategy across multiple auctions.Engineering and Applied Science

Strategyproof Computing: Systems Infrastructures for Self-Interested Parties

The widespread deployment of high-speed internet access is ushering in a new era of distributed computing, in which parties both contribute to a global pool of shared resources and access the pooled resources to support their own computing needs. We argue that system designers must explicitly address the self-interest of individual parties if these next-generation computing systems are to flourish. We propose strategyproof computing, a vision for an open computing infrastructure in which resource allocation and negotiation schemes are incentive-compatible, and individual parties can treat other resources as their own. In this paper we outline key guiding principles for the vision of strategyproof computing, define the strategyproof computing paradigm, and lay out a systems-related research agenda.Engineering and Applied Science

Virtual Worlds: Fast and Strategyproof Auctions for Dynamic Resource Allocation

We consider the problem of designing fast and strategyproof exchanges for dynamic resource allocation problems in distributed systems. The exchange is implemented as a sequence of auctions, with dynamically arriving requests from agents matched with each auction. Each auction is associated with some consignment of the resources from a single seller. We provide a simple Virtual Worlds (VW) construction, that extends a fast and strategyproof mechanism for a single auction to apply to this sequence-of-auctions setting. Rather than match each buyer with a single auction, the VW mechanism allows buyers to be considered for multiple auctions while retaining strategyproofness.Engineering and Applied Science

Enabling Sharing in Auctions for Short-Term Spectrum Licenses

Wireless spectrum is a valuable and scarce resource that currently suffers from under-use because of the dominant paradigm of exclusive-use licensing. We propose the SATYA auction (Sanskrit for truth), which allows short-term leases to be auctioned and supports diverse bidder types, including those willing to share access and those who require exclusive-use access. Thus, unlike unlicensed spectrum such as Wi-Fi, which can be shared by any device, and exclusive-use licensed spectrum, where sharing is precluded, SATYA improves efficiency through supporting sharing alongside quality-of-service protections. The auction is designed to be scalable, and also strategy proof, so that simple bidding protocols are optimal. The primary challenge is to handle the externalities created by allocating shared-use alongside exclusive-use bidders. Using realistic Longley-Rice based propagation modeling and data from the FCC’s CDBS database, we conduct extensive simulations that demonstrate SATYA’s ability to handle heterogeneous bidders involving different transmit powers and spectrum needs.Engineering and Applied Science

Performance of nine cassava (Manihot esculanta Crantz) clones across three environments

The study was carried out to quantify the genotype × environment interaction (G × E) and to estimate the phenotypic stability by genotype genotype × environment (GGE) biplot of nine cassava clones comprising 5 hybrids, 3 parent checks and 1 improved variety. The study was planted across three different environments; Fumesua, Pokuase and Ejura representing forest, coastal savanna and forest transition zones, respectively. Genotype main effect was significant (P < 0.001) for fresh root yield and dry matter content, G × E interaction effect was significant (P < 0.001) for fresh root yield only and environment main effect was significant (P < 0.01) for only fresh root yield. The most stable clone for fresh root yield with above average performance was La02/026 (hybrid). The high genotype and low environment effects, and the relatively low interaction on dry matter content imply that evaluation and selection can be effectively done in fewer environments to select clones with high performance for the trait whiles fresh root yield requires multiple environments to identify clones with broad and specific adaptation

Genetic variability of three cassava traits across three locations in Ghana

A study was conducted to assess the extent of genetic variability, broad-sense heritability and correlations for fresh root weight, root number and top weight of five cassava genotypes across three locations in 2 years. Combined analysis of variance revealed highly significant genotypic effect for all the traits. Genotype x environment interaction was also significant for all the traits studied indicating considerable but, varying response of the genotypes to the environments. High broad-sense heritability and genetic advance as percent of the mean were observed for fresh root weight, suggesting that the trait is primarily under genetic control and that a simple recurrent phenotypic selection scheme would be rewarding. Phenotypic coefficients of variation values were larger than their corresponding genotypic coefficient of variation values for all traits. Correlations between the three traits were highly significant and positive indicating that simultaneous progress for the three traits is feasible

Finite Grand Unified Theories and the Quark Mixing Matrix

In N = 1 super Yang-Mills theories, under certain conditions satisfied by the spectrum and the Yukawa couplings, the beta functions will vanish to all orders in perturbation theory. We address the generation of realistic quark mixing angles and masses in such finite Grand Unified Theories. Working in the context of finite SUSY SU(5), we present several examples with realistic quark mixing matrices. Non-Abelian discrete symmetries are found to be important in satisfying the conditions for finiteness. Our realistic examples are based on permutation symmetries and the tetrahedral symmetry $A_4$. These examples enable us to address questions such as the decay rate of the proton in finite GUTs.Comment: 16 pages, LaTeX, typos correcte