8 research outputs found

    Evaluation of Algrow as a Binder in Hydromulch and Preliminary Determination of the Influence of Algrow on Germination and Seedling Growth

    Get PDF
    Introduction: The application of mulch during or immediately following seeding provides the minimum following advantages: energy dissipation of falling raindrops which decreases or eliminates erosion, prevention of surface-soil crusting, decreased water loss, and surface temperature modification. To better hold mulch in place, chemical binders are addd to it during munufacture or just before it is applied to the soil. Sometimes a binder is applied as an oversptray after the mulch is in place. (This overspray is generally referred to as a tackifier.) Algea Produkter A/S, Drammen, Norway, produces a product called ALGROW which may habe utility as a mulch binder and may enhance germination and growth of plants. The Utah Water Research Laboratory contracted to perform preliminary tests using ALGROW both as a binder in hydromulch and as an enhancer for barley seed germination and growth. more definitive tests of ALGROW\u27s growth enhancement capabilities are being performed in the Plant Science Laboratory of Utah State University. These results will be reported separately

    RAQUE S.A. Ralladora de quesos

    Get PDF
    Seminario Desarrollo de Emprendedores. 2014. Docente Lic. Dávila Rueda, Alejandro..RAQUE S.A surgio? a trave?s de la necesidad de aprovechar las mermas de una empresa productora de quesos, LACTEOS S.A. Las mermas de esta empresa incluyen recortes y quesos con poca prensa. Actualmente las mermas se esta?n vendiendo en un precio muy bajo, lo cual presenta perdidas para la empresa productora de quesos, el proyecto RAQUE S.A aspira a transformar dichas mermas en una variedad de queso rayado llamado Queso Morolique (seco)

    On codes, matroids and secure computation from linear secret sharing schemes

    No full text
    Error-correcting codes and matroids have been widely used in the study of ordinary secret sharing schemes. In this paper, the connections between codes, matroids, and a special class of secret sharing schemes, namely, multiplicative linear secret sharing schemes (LSSSs), are studied. Such schemes are known to enable multiparty computation protocols secure against general (nonthreshold) adversaries. Two open problems related to the complexity of multiplicative LSSSs are considered in this paper. The first one deals with strongly multiplicative LSSSs. As opposed to the case of multiplicative LSSSs, it is not known whether there is an efficient method to transform an LSSS into a strongly multiplicative LSSS for the same access structure with a polynomial increase of the complexity. A property of strongly multiplicative LSSSs that could be useful in solving this problem is proved. Namely, using a suitable generalization of the well-known Berlekamp-Welch decoder, it is shown that all strongly multiplicative LSSSs enable efficient reconstruction of a shared secret in the presence of malicious faults. The second one is to characterize the access structures of ideal multiplicative LSSSs. Specifically, the considered open problem is to determine whether all self-dual vector space access structures are in this situation. By the aforementioned connection, this in fact constitutes an open problem about matroid theory, since it can be restated in terms of representability of identically self-dual matroids by self-dual codes. A new concept is introduced, the flat-partition, that provides a useful classification of identically self-dual matroids. Uniform identically self-dual matroids, which are known to be representable by self-dual codes, form one of the classes. It is proved that this property also holds for the family of matroids that, in a natural way, is the next class in the above classification: the identically self-dual bipartite matroids

    On codes, matroids, and secure multiparty computation from linear secret-sharing schemes

    Get PDF
    Error-correcting codes and matroids have been widely used in the study of ordinary secret sharing schemes. In this paper, the connections between codes, matroids, and a special class of secret sharing schemes, namely, multiplicative linear secret sharing schemes (LSSSs), are studied. Such schemes are known to enable multiparty computation protocols secure against general (nonthreshold) adversaries./nTwo open problems related to the complexity of multiplicative LSSSs are considered in this paper. The first one deals with strongly multiplicative LSSSs. As opposed to the case of multiplicative LSSSs, it is not known whether there is an efficient method to transform an LSSS into a strongly multiplicative LSSS for the same access structure with a polynomial increase of the complexity. A property of strongly multiplicative LSSSs that could be useful in solving this problem is proved. Namely, using a suitable generalization of the well-known Berlekamp–Welch decoder, it is shown that all strongly multiplicative LSSSs enable efficient reconstruction of a shared secret in the presence of malicious faults. The second one is to characterize the access structures of ideal multiplicative LSSSs. Specifically, the considered open problem is to determine whether all self-dual vector space access structures are in this situation. By the aforementioned connection, this in fact constitutes an open problem about matroid theory, since it can be restated in terms of representability of identically self-dual matroids by self-dual codes. A new concept is introduced, the flat-partition, that provides a useful classification of identically self-dual matroids. Uniform identically self-dual matroids, which are known to be representable by self-dual codes, form one of the classes. It is proved that this property also holds for the family of matroids that, in a natural way, is the next class in the above classification: the identically self-dual bipartite matroids

    Efficacy, safety, and immunogenicity of a booster regimen of Ad26.COV2.S vaccine against COVID-19 (ENSEMBLE2) : results of a randomised, double-blind, placebo-controlled, phase 3 trial

    No full text
    Background Despite the availability of effective vaccines against COVID-19, booster vaccinations are needed to maintain vaccine-induced protection against variant strains and breakthrough infections. This study aimed to investigate the efficacy, safety, and immunogenicity of the Ad26.COV2.S vaccine (Janssen) as primary vaccination plus a booster dose. Methods ENSEMBLE2 is a randomised, double-blind, placebo-controlled, phase 3 trial including crossover vaccination after emergency authorisation of COVID-19 vaccines. Adults aged at least 18 years without previous COVID-19 vaccination at public and private medical practices and hospitals in Belgium, Brazil, Colombia, France, Germany, the Philippines, South Africa, Spain, the UK, and the USA were randomly assigned 1:1 via a computer algorithm to receive intramuscularly administered Ad26.COV2.S as a primary dose plus a booster dose at 2 months or two placebo injections 2 months apart. The primary endpoint was vaccine efficacy against the first occurrence of molecularly confirmed moderate to severe-critical COVID-19 with onset at least 14 days after booster vaccination, which was assessed in participants who received two doses of vaccine or placebo, were negative for SARS-CoV-2 by PCR at baseline and on serology at baseline and day 71, had no major protocol deviations, and were at risk of COVID-19 (ie, had no PCR-positive result or discontinued the study before day 71). Safety was assessed in all participants; reactogenicity, in terms of solicited local and systemic adverse events, was assessed as a secondary endpoint in a safety subset (approximately 6000 randomly selected participants). The trial is registered with ClinicalTrials.gov, NCT04614948, and is ongoing. Findings Enrolment began on Nov 16, 2020, and the primary analysis data cutoff was June 25, 2021. From 34 571 participants screened, the double-blind phase enrolled 31 300 participants, 14 492 of whom received two doses (7484 in the Ad26.COV2.S group and 7008 in the placebo group) and 11 639 of whom were eligible for inclusion in the assessment of the primary endpoint (6024 in the Ad26.COV2.S group and 5615 in the placebo group). The median (IQR) follow-up post-booster vaccination was 36 center dot 0 (15 center dot 0-62 center dot 0) days. Vaccine efficacy was 75 center dot 2% (adjusted 95% CI 54 center dot 6-87 center dot 3) against moderate to severe-critical COVID-19 (14 cases in the Ad26.COV2.S group and 52 cases in the placebo group). Most cases were due to the variants alpha (B.1.1.7) and mu (B.1.621); endpoints for the primary analysis accrued from Nov 16, 2020, to June 25, 2021, before the global dominance of delta (B.1.617.2) or omicron (B.1.1.529). The booster vaccine exhibited an acceptable safety profile. The overall frequencies of solicited local and systemic adverse events (evaluated in the safety subset, n=6067) were higher among vaccine recipients than placebo recipients after the primary and booster doses. The frequency of solicited adverse events in the Ad26.COV2.S group were similar following the primary and booster vaccinations (local adverse events, 1676 [55 center dot 6%] of 3015 vs 896 [57 center dot 5%] of 1559, respectively; systemic adverse events, 1764 [58 center dot 5%] of 3015 vs 821 [52 center dot 7%] of 1559, respectively). Solicited adverse events were transient and mostly grade 1-2 in severity. Interpretation A homologous Ad26.COV2.S booster administered 2 months after primary single-dose vaccination in adults had an acceptable safety profile and was efficacious against moderate to severe-critical COVID-19. Studies assessing efficacy against newer variants and with longer follow-up are needed. Funding Janssen Research & Development. Copyright (c) 2022 The Author(s). Published by Elsevier Ltd
    corecore