2,698 research outputs found

    Time Domain Simulations of the CLIC PETS (Power Extraction and Transfer Structure) with GdfidL

    Get PDF
    The Compact Linear Collider (CLIC) PETS is required to produce about 0.5 GW RF power per metre in the 30 GHz CLIC decelerator when driven by the high current beam (~ 270 A). To avoid beam break-up in the decelerator it is necessary to provide strong damping of the transverse deflecting modes. A PETS geometry with a level of damping consistent with stable drive beam operation has been designed, using the frequency domain code HFSS. A verification of the overall performance of this structure has been made recently using the code GdfidL, which permits a very fine mesh analysis of a full-length structure in the time domain. This paper gives the results of this analysis

    Equity-Efficiency Optimizing Resource Allocation: The Role of Time Preferences in a Repeated Irrigation Game

    Get PDF
    We study repeated water allocation decisions among small scale irrigation users in Tanzania. In a treatment replicating water scarcity conditions, convexities in production make that substantial efficiency gains can be obtained by deviating from equal sharing, leading to an equity–efficiency trade-off. In a repeated game setting, it becomes possible to reconcile efficiency with equity by rotating the person who receives the largest share, but such a strategy requires a longer run perspective. Correlating experimental data from an irrigation game with individual time preference data, we find that less patient irrigators are less likely to use a rotation strategy

    Fungi isolated from Miscanthus and sugarcane: biomass conversion, fungal enzymes, and hydrolysis of plant cell wall polymers.

    Get PDF
    BackgroundBiofuel use is one of many means of addressing global change caused by anthropogenic release of fossil fuel carbon dioxide into Earth's atmosphere. To make a meaningful reduction in fossil fuel use, bioethanol must be produced from the entire plant rather than only its starch or sugars. Enzymes produced by fungi constitute a significant percentage of the cost of bioethanol production from non-starch (i.e., lignocellulosic) components of energy crops and agricultural residues. We, and others, have reasoned that fungi that naturally deconstruct plant walls may provide the best enzymes for bioconversion of energy crops.ResultsPreviously, we have reported on the isolation of 106 fungi from decaying leaves of Miscanthus and sugarcane (Appl Environ Microbiol 77:5490-504, 2011). Here, we thoroughly analyze 30 of these fungi including those most often found on decaying leaves and stems of these plants, as well as four fungi chosen because they are well-studied for their plant cell wall deconstructing enzymes, for wood decay, or for genetic regulation of plant cell wall deconstruction. We extend our analysis to assess not only their ability over an 8-week period to bioconvert Miscanthus cell walls but also their ability to secrete total protein, to secrete enzymes with the activities of xylanases, exocellulases, endocellulases, and beta-glucosidases, and to remove specific parts of Miscanthus cell walls, that is, glucan, xylan, arabinan, and lignin.ConclusionThis study of fungi that bioconvert energy crops is significant because 30 fungi were studied, because the fungi were isolated from decaying energy grasses, because enzyme activity and removal of plant cell wall components were recorded in addition to biomass conversion, and because the study period was 2 months. Each of these factors make our study the most thorough to date, and we discovered fungi that are significantly superior on all counts to the most widely used, industrial bioconversion fungus, Trichoderma reesei. Many of the best fungi that we found are in taxonomic groups that have not been exploited for industrial bioconversion and the cultures are available from the Centraalbureau voor Schimmelcultures in Utrecht, Netherlands, for all to use

    The amalgamated duplication of a ring along a multiplicative-canonical ideal

    Full text link
    After recalling briefly the main properties of the amalgamated duplication of a ring RR along an ideal II, denoted by R\JoinI, we restrict our attention to the study of the properties of R\JoinI, when II is a multiplicative canonical ideal of RR \cite{hhp}. In particular, we study when every regular fractional ideal of RIR\Join I is divisorial

    Evidence for Jahn-Teller distortions at the antiferromagnetic transition in LaTiO3_3

    Full text link
    LaTiO3_3 is known as Mott-insulator which orders antiferromagnetically at TN=146T_{\rm N}=146 K. We report on results of thermal expansion and temperature dependent x-ray diffraction together with measurements of the heat capacity, electrical transport measurements, and optical spectroscopy in untwinned single crystals. At TNT_{\rm N} significant structural changes appear, which are volume conserving. Concomitant anomalies are also observed in the dc-resistivity, in bulk modulus, and optical reflectivity spectra. We interpret these experimental observations as evidence of orbital order.Comment: 4 pages, 4 figures; published in Phys. Rev. Lett. 91, 066403 (2003

    Invariants of pseudogroup actions: Homological methods and Finiteness theorem

    Get PDF
    We study the equivalence problem of submanifolds with respect to a transitive pseudogroup action. The corresponding differential invariants are determined via formal theory and lead to the notions of k-variants and k-covariants, even in the case of non-integrable pseudogroup. Their calculation is based on the cohomological machinery: We introduce a complex for covariants, define their cohomology and prove the finiteness theorem. This implies the well-known Lie-Tresse theorem about differential invariants. We also generalize this theorem to the case of pseudogroup action on differential equations.Comment: v2: some remarks and references addee

    Decomposition of semigroup algebras

    Full text link
    Let A \subseteq B be cancellative abelian semigroups, and let R be an integral domain. We show that the semigroup ring R[B] can be decomposed, as an R[A]-module, into a direct sum of R[A]-submodules of the quotient ring of R[A]. In the case of a finite extension of positive affine semigroup rings we obtain an algorithm computing the decomposition. When R[A] is a polynomial ring over a field we explain how to compute many ring-theoretic properties of R[B] in terms of this decomposition. In particular we obtain a fast algorithm to compute the Castelnuovo-Mumford regularity of homogeneous semigroup rings. As an application we confirm the Eisenbud-Goto conjecture in a range of new cases. Our algorithms are implemented in the Macaulay2 package MonomialAlgebras.Comment: 12 pages, 2 figures, minor revisions. Package may be downloaded at http://www.math.uni-sb.de/ag/schreyer/jb/Macaulay2/MonomialAlgebras/html

    A Novel Technique for Mitigating Multipactor by Means of Magnetic Surface Roughness

    Get PDF
    Multipactor phenomena which are closely linked to the SEY (secondary electron yield)can be mitigated by many different methods including groves in the metal surface as well as using electric or magnetic bias fields. However frequently the application of global magnetic or electric bias field is not practicable considering the weight and power limitations on-board satellites. Additionally, surface grooves may degrade the RF performance. Here we present a novel technique which is based on a magnetostatic field pattern on the metallic surface with fast spatial modulation in the order of 30 micron. This field pattern is produced by proper magnetization of an underlying ferromagnetic layer such as nickel. Simulations and preliminary experimental results will be shown and a number of applications, both for particle accelerators and satellite microwave payloads are discussed

    Parametric Polyhedra with at least kk Lattice Points: Their Semigroup Structure and the k-Frobenius Problem

    Full text link
    Given an integral d×nd \times n matrix AA, the well-studied affine semigroup \mbox{ Sg} (A)=\{ b : Ax=b, \ x \in {\mathbb Z}^n, x \geq 0\} can be stratified by the number of lattice points inside the parametric polyhedra PA(b)={x:Ax=b,x0}P_A(b)=\{x: Ax=b, x\geq0\}. Such families of parametric polyhedra appear in many areas of combinatorics, convex geometry, algebra and number theory. The key themes of this paper are: (1) A structure theory that characterizes precisely the subset \mbox{ Sg}_{\geq k}(A) of all vectors b \in \mbox{ Sg}(A) such that PA(b)ZnP_A(b) \cap {\mathbb Z}^n has at least kk solutions. We demonstrate that this set is finitely generated, it is a union of translated copies of a semigroup which can be computed explicitly via Hilbert bases computations. Related results can be derived for those right-hand-side vectors bb for which PA(b)ZnP_A(b) \cap {\mathbb Z}^n has exactly kk solutions or fewer than kk solutions. (2) A computational complexity theory. We show that, when nn, kk are fixed natural numbers, one can compute in polynomial time an encoding of \mbox{ Sg}_{\geq k}(A) as a multivariate generating function, using a short sum of rational functions. As a consequence, one can identify all right-hand-side vectors of bounded norm that have at least kk solutions. (3) Applications and computation for the kk-Frobenius numbers. Using Generating functions we prove that for fixed n,kn,k the kk-Frobenius number can be computed in polynomial time. This generalizes a well-known result for k=1k=1 by R. Kannan. Using some adaptation of dynamic programming we show some practical computations of kk-Frobenius numbers and their relatives
    corecore