Solitary-wave solutions of the Degasperis-Procesi equation by means of the homotopy analysis method

The homotopy analysis method is applied to the Degasperis-Procesi equation in order to find analytic approximations to the known exact solitary-wave solutions for the solitary peakon wave and the family of solitary smooth-hump waves. It is demonstrated that the approximate solutions agree well with the exact solutions. This provides further evidence that the homotopy analysis method is a powerful tool for finding excellent approximations to nonlinear solitary waves

Generalizing Boolean Satisfiability I: Background and Survey of Existing Work

This is the first of three planned papers describing ZAP, a satisfiability engine that substantially generalizes existing tools while retaining the performance characteristics of modern high-performance solvers. The fundamental idea underlying ZAP is that many problems passed to such engines contain rich internal structure that is obscured by the Boolean representation used; our goal is to define a representation in which this structure is apparent and can easily be exploited to improve computational performance. This paper is a survey of the work underlying ZAP, and discusses previous attempts to improve the performance of the Davis-Putnam-Logemann-Loveland algorithm by exploiting the structure of the problem being solved. We examine existing ideas including extensions of the Boolean language to allow cardinality constraints, pseudo-Boolean representations, symmetry, and a limited form of quantification. While this paper is intended as a survey, our research results are contained in the two subsequent articles, with the theoretical structure of ZAP described in the second paper in this series, and ZAP's implementation described in the third

Generalizing Boolean Satisfiability II: Theory

This is the second of three planned papers describing ZAP, a satisfiability engine that substantially generalizes existing tools while retaining the performance characteristics of modern high performance solvers. The fundamental idea underlying ZAP is that many problems passed to such engines contain rich internal structure that is obscured by the Boolean representation used; our goal is to define a representation in which this structure is apparent and can easily be exploited to improve computational performance. This paper presents the theoretical basis for the ideas underlying ZAP, arguing that existing ideas in this area exploit a single, recurring structure in that multiple database axioms can be obtained by operating on a single axiom using a subgroup of the group of permutations on the literals in the problem. We argue that the group structure precisely captures the general structure at which earlier approaches hinted, and give numerous examples of its use. We go on to extend the Davis-Putnam-Logemann-Loveland inference procedure to this broader setting, and show that earlier computational improvements are either subsumed or left intact by the new method. The third paper in this series discusses ZAPs implementation and presents experimental performance results

Multimegawatt MPD thruster design considerations

Performance and lifetime requirements for multimegawatt magnetoplasmadynamic (MPD) thrusters were used to establish a baseline 2.5 MW thruster design. The chamber surface power deposition resulting from current conduction, plasma and surface radiation, and conduction from the hot plasma was then evaluated to establish the feasibility of thruster operation. It was determined that state of the art lithium heat pipes were adequate to cool the anode electrode, and that the liquid hydrogen propellant could be used to cool the applied field magnet, cathode, and backplate. Unresolved issues having an impact of thruster design are discussed to help focus future research

Generalizing Boolean Satisfiability III: Implementation

This is the third of three papers describing ZAP, a satisfiability engine that substantially generalizes existing tools while retaining the performance characteristics of modern high-performance solvers. The fundamental idea underlying ZAP is that many problems passed to such engines contain rich internal structure that is obscured by the Boolean representation used; our goal has been to define a representation in which this structure is apparent and can be exploited to improve computational performance. The first paper surveyed existing work that (knowingly or not) exploited problem structure to improve the performance of satisfiability engines, and the second paper showed that this structure could be understood in terms of groups of permutations acting on individual clauses in any particular Boolean theory. We conclude the series by discussing the techniques needed to implement our ideas, and by reporting on their performance on a variety of problem instances

Genetic variability, stability and heritability for quality and yield characteristics in provitamin A cassava varieties

Open Access Article; Published online: 25 Jan 2020Cassava is widely consumed in many areas of Africa, including Ghana, and is a major part of most household diets. These areas are characterized by rampant malnutrition, because the tuberous roots are low in nutritional value. Provitamin A biofortified cassava varieties have been developed by the International Institute for Tropical Agriculture, but adoption of these varieties in Ghana will largely depend on their agronomic performance, including fresh root yield, dry matter content, resistance to major pests and diseases, mealiness, starch content and the stability of these traits. Eight provitamin A varieties with two white checks were planted in three environments for two seasons to determine stability and variability among the varieties for important traits. There were significant variations in performance between varieties and between environments for cassava mosaic disease, root number, fresh root yield and starch content. High broad-sense heritability and genetic advance were observed in all traits, except for storage root number, and could be exploited through improvement programs. This study identified the best performing enhanced provitamin A varieties for traits that are key drivers of variety adoption in Ghana. In view of this, some varieties can be recommended for varietal release after on-farm testing. The study also showed the possibility of tapping heterosis after careful selection of parents

Test Facility and Preliminary Performance of a 100 kW Class MPD Thruster

A 260 kW magnetoplasmadynamic (MPD) thruster test facility was assembled and used to characterize thrusters at power levels up to 130 kW using argon and helium propellants. Sensitivities of discharge characteristics to arc current, mass flow rate, and applied magnetic field were investigated. A thermal efficiency correlation developed by others for low power MPD thrusters defined parametric guidelines to minimize electrode losses in MPD thrusters. Argon and helium results suggest that a parameter defined as the product of arc voltage and the square root of the mass flow rate must exceed 0.7 V/kg(sup 1/2)/sec(sup 1/2) in order to obtain thermal efficiencies in excess of 60 percent

Truthful Multi-unit Procurements with Budgets

We study procurement games where each seller supplies multiple units of his item, with a cost per unit known only to him. The buyer can purchase any number of units from each seller, values different combinations of the items differently, and has a budget for his total payment. For a special class of procurement games, the {\em bounded knapsack} problem, we show that no universally truthful budget-feasible mechanism can approximate the optimal value of the buyer within $\ln n$, where $n$ is the total number of units of all items available. We then construct a polynomial-time mechanism that gives a $4(1+\ln n)$-approximation for procurement games with {\em concave additive valuations}, which include bounded knapsack as a special case. Our mechanism is thus optimal up to a constant factor. Moreover, for the bounded knapsack problem, given the well-known FPTAS, our results imply there is a provable gap between the optimization domain and the mechanism design domain. Finally, for procurement games with {\em sub-additive valuations}, we construct a universally truthful budget-feasible mechanism that gives an $O(\frac{\log^2 n}{\log \log n})$-approximation in polynomial time with a demand oracle.Comment: To appear at WINE 201