text:
using namespace std;
using namespace seal::util;

namespace seal
{
    namespace
    {
        ConstPointer duplicate_uint_if_needed(const BigUInt &uint, int new_uint64_count, bool force, MemoryPool &pool)
        {
            return duplicate_uint_if_needed(uint.pointer(), uint.uint64_count(), new_uint64_count, force, pool);
        }

        ConstPointer duplicate_poly_if_needed(const BigPoly &poly, int new_coeff_count, int new_coeff_uint64_count, bool force, MemoryPool &pool)
        {
            return duplicate_poly_if_needed(poly.pointer(), poly.coeff_count(), poly.coeff_uint64_count(), new_coeff_count, new_coeff_uint64_count, force, pool);
        }

        bool are_poly_coefficients_less_than(const BigPoly &poly, const BigUInt &max_coeff)
        {
            return util::are_poly_coefficients_less_than(poly.pointer(), poly.coeff_count(), poly.coeff_uint64_count(), max_coeff.pointer(), max_coeff.uint64_count());
        }
    }

    BigUInt poly_infty_norm(const BigPoly &poly)
    {
        if (poly.is_zero())
        {
            return BigUInt();
        }

        int coeff_count = poly.coeff_count();
        int coeff_bit_count = poly.coeff_bit_count();
        int coeff_uint64_count = divide_round_up(coeff_bit_count, bits_per_uint64);

        BigUInt result(coeff_bit_count);
        util::poly_infty_norm(poly.pointer(), coeff_count, coeff_uint64_count, result.pointer());

        return result;
    }

    BigUInt poly_infty_norm_coeffmod(const BigPoly &poly, const BigUInt &modulus)
    {
        if (modulus.is_zero())
        {
            throw invalid_argument("modulus cannot be zero");
        }
        if (poly.is_zero())
        {
            return BigUInt();
        }

        int poly_coeff_count = poly.coeff_count();
        int poly_coeff_bit_count = poly.coeff_bit_count();
        int poly_coeff_uint64_count = divide_round_up(poly_coeff_bit_count, bits_per_uint64);

        MemoryPool &pool = *MemoryPool::default_pool();
        Modulus mod(modulus.pointer(), modulus.uint64_count(), pool);
        BigUInt result(modulus.significant_bit_count());
        util::poly_infty_norm_coeffmod(poly.pointer(), poly_coeff_count, poly_coeff_uint64_count, mod, result.pointer(), pool);

        return result;
    }

    BigUInt inherent_noise(const BigPolyArray &encrypted, const BigPoly &plain, const EncryptionParameters &parms, const BigPoly &secret_key)
    {
        int coeff_count = parms.poly_modulus().coeff_count();
        int coeff_bit_count = parms.coeff_modulus().significant_bit_count();
        BigUInt result(coeff_count, coeff_bit_count);
        inherent_noise(encrypted, plain, parms, secret_key, result);
        return result;
    }

    void inherent_noise(const BigPolyArray &encrypted, const BigPoly &plain, const EncryptionParameters &parms, const BigPoly &secret_key, BigUInt &result)
    {
        // Verify encryption parameters are non-zero and non-nullptr.
        if (parms.poly_modulus().is_zero())
        {
            throw invalid_argument("poly_modulus cannot be zero");
        }
        if (parms.coeff_modulus().is_zero())
        {
            throw invalid_argument("coeff_modulus cannot be zero");
        }
        if (parms.plain_modulus().is_zero())
        {
            throw invalid_argument("plain_modulus cannot be zero");
        }
        if (parms.noise_standard_deviation() < 0)
        {
            throw invalid_argument("noise_standard_deviation must be non-negative");
        }
        if (parms.noise_max_deviation() < 0)
        {
            throw invalid_argument("noise_max_deviation must be non-negative");
        }
        if (parms.plain_modulus() >= parms.coeff_modulus())
        {
            throw invalid_argument("plain_modulus must be smaller than coeff_modulus");
        }
        if (!are_poly_coefficients_less_than(parms.poly_modulus(), parms.coeff_modulus()))
        {
            throw invalid_argument("poly_modulus cannot have coefficients larger than coeff_modulus");
        }

        // Extract encryption parameters.
        const BigPoly &poly_modulus = parms.poly_modulus();
        const BigUInt &coeff_modulus = parms.coeff_modulus();
        const BigUInt &plain_modulus = parms.plain_modulus();
        int encrypted_count = encrypted.size();
        int coeff_count = poly_modulus.coeff_count();
        int coeff_bit_count = coeff_modulus.significant_bit_count();
        int coeff_uint64_count = coeff_modulus.uint64_count();

        // Verify parameters.
        if (encrypted.coeff_count() != coeff_count || encrypted.coeff_bit_count() != coeff_bit_count || encrypted_count < 2)
        {
            throw invalid_argument("encrypted is not a valid ciphertext");
        }
#ifdef _DEBUG
        for (int i = 0; i < encrypted.size(); ++i)
        {
            if (encrypted[i].significant_coeff_count() == coeff_count || !are_poly_coefficients_less_than(encrypted[i], coeff_modulus))
            {
                throw invalid_argument("encrypted is not valid for encryption parameters");
            }
        }
        if (plain.significant_coeff_count() >= coeff_count || !are_poly_coefficients_less_than(plain, plain_modulus))
        {
            throw invalid_argument("plain is too large to be represented by encryption parameters");
        }
#endif
        if (secret_key.is_zero())
        {
            throw invalid_argument("secret_key cannot be zero");
        }
        if (secret_key.coeff_count() != coeff_count || secret_key.coeff_bit_count() != coeff_bit_count ||
            secret_key.significant_coeff_count() == coeff_count || !are_poly_coefficients_less_than(secret_key, coeff_modulus))
        {
            throw invalid_argument("secret_key is not valid for encryption parameters");
        }

        // Resize plaintext modulus.
        MemoryPool &pool = *MemoryPool::default_pool();
        ConstPointer plain_modulus_ptr = duplicate_uint_if_needed(plain_modulus, coeff_uint64_count, false, pool);

        // Compute floor of coeff_modulus/plain_modulus.
        Pointer coeff_div_plain_modulus(allocate_uint(coeff_uint64_count, pool));
        Pointer remainder(allocate_uint(coeff_uint64_count, pool));
        divide_uint_uint(coeff_modulus.pointer(), plain_modulus_ptr.get(), coeff_uint64_count, coeff_div_plain_modulus.get(), remainder.get(), pool);

        // Resize plaintext to accommodate coeff_modulus size coefficients and have the full number of coefficients.
        ConstPointer plain_ptr = duplicate_poly_if_needed(plain, coeff_count, coeff_uint64_count, false, pool);

        // Resize poly_modulus to accommodate coeff_modulus size coefficients and have the full number of coefficients.
        ConstPointer poly_modulus_ptr = duplicate_poly_if_needed(poly_modulus, coeff_count, coeff_uint64_count, false, pool);

        BigPoly noise_poly(coeff_count, coeff_bit_count);
        PolyModulus polymod(poly_modulus_ptr.get(), coeff_count, coeff_uint64_count);
        Modulus mod(coeff_modulus.pointer(), coeff_uint64_count, pool);

        // YASHE
        //multiply_poly_poly_polymod_coeffmod(encrypted.pointer(), secret_key.pointer(), polymod, mod, noise_poly.pointer(), pool);

        // FV [see Decryptor::decrypt(...)]
        BigPolyArray secret_key_array(encrypted_count, coeff_count, coeff_bit_count);
        set_poly_poly(secret_key.pointer(), coeff_count, coeff_uint64_count, secret_key_array.pointer(0));
        int poly_ptr_increment = coeff_count * coeff_uint64_count;
        uint64_t *prev_poly_ptr = secret_key_array.pointer(0);
        uint64_t *next_poly_ptr = prev_poly_ptr + poly_ptr_increment;
        for (int i = 1; i < encrypted_count-1; ++i)
        {
            multiply_poly_poly_polymod_coeffmod(prev_poly_ptr, secret_key.pointer(), polymod, mod, next_poly_ptr, pool);
            prev_poly_ptr = next_poly_ptr;
            next_poly_ptr += poly_ptr_increment;
        }
        dot_product_bigpolyarray_polymod_coeffmod(encrypted.pointer(1), secret_key_array.pointer(0), encrypted_count - 1, polymod, mod, noise_poly.pointer(), pool);
        add_poly_poly_coeffmod(noise_poly.pointer(), encrypted[0].pointer(), coeff_count, coeff_modulus.pointer(), coeff_uint64_count, noise_poly.pointer());

        Pointer temp(allocate_uint(coeff_uint64_count, pool));
        const uint64_t *plain_coeff_ptr = plain_ptr.get();
        uint64_t *noise_coeff_ptr = noise_poly.pointer();
        for (int coeff_index = 0; coeff_index < coeff_count; ++coeff_index)
        {
            multiply_uint_uint_mod(coeff_div_plain_modulus.get(), plain_coeff_ptr, mod, temp.get(), pool);
            sub_uint_uint_mod(noise_coeff_ptr, temp.get(), coeff_modulus.pointer(), coeff_uint64_count, noise_coeff_ptr);
            plain_coeff_ptr += coeff_uint64_count;
            noise_coeff_ptr += coeff_uint64_count;
        }
        result = poly_infty_norm_coeffmod(noise_poly, coeff_modulus);
    }

    BigUInt inherent_noise(const BigPolyArray &encrypted, const EncryptionParameters &parms, const BigPoly &secret_key)
    {
        Decryptor decryptor(parms, secret_key);
        BigPoly plain = decryptor.decrypt(encrypted);
        return inherent_noise(encrypted, plain, parms, secret_key);
    }

    BigUInt inherent_noise_max(const EncryptionParameters &parms)
    {
        // Verify encryption parameters are non-zero and non-nullptr.
        if (parms.poly_modulus().is_zero())
        {
            throw invalid_argument("poly_modulus cannot be zero");
        }
        if (parms.coeff_modulus().is_zero())
        {
            throw invalid_argument("coeff_modulus cannot be zero");
        }
        if (parms.plain_modulus().is_zero())
        {
            throw invalid_argument("plain_modulus cannot be zero");
        }
        if (parms.noise_standard_deviation() < 0)
        {
            throw invalid_argument("noise_standard_deviation must be non-negative");
        }
        if (parms.noise_max_deviation() < 0)
        {
            throw invalid_argument("noise_max_deviation must be non-negative");
        }
        if (parms.plain_modulus() >= parms.coeff_modulus())
        {
            throw invalid_argument("plain_modulus must be smaller than coeff_modulus");
        }
        if (!are_poly_coefficients_less_than(parms.poly_modulus(), parms.coeff_modulus()))
        {
            throw invalid_argument("poly_modulus cannot have coefficients larger than coeff_modulus");
        }

        // Extract encryption parameters
        const BigUInt &coeff_modulus = parms.coeff_modulus();
        const BigUInt &plain_modulus = parms.plain_modulus();
        int coeff_bit_count = coeff_modulus.significant_bit_count();
        int coeff_uint64_count = coeff_modulus.uint64_count();

        // Resize plaintext modulus.
        MemoryPool &pool = *MemoryPool::default_pool();
        ConstPointer plain_modulus_ptr = duplicate_uint_if_needed(plain_modulus, coeff_uint64_count, false, pool);

        BigUInt result(coeff_bit_count);

        // Compute floor of coeff_modulus/plain_modulus.
        Pointer coeff_div_plain_modulus(allocate_uint(coeff_uint64_count, pool));
        Pointer remainder(allocate_uint(coeff_uint64_count, pool));
        divide_uint_uint(coeff_modulus.pointer(), plain_modulus_ptr.get(), coeff_uint64_count, coeff_div_plain_modulus.get(), remainder.get(), pool);
        sub_uint_uint(coeff_div_plain_modulus.get(), remainder.get(), coeff_uint64_count, result.pointer());
        right_shift_uint(result.pointer(), 1, coeff_uint64_count, result.pointer());

        return result;
    }

    int estimate_level_max(const EncryptionParameters &parms)
    {
        SimulationEvaluator simulation_evaluator;
        Simulation sim_power(parms);
        int level = 0;
        while (true)
        {
            sim_power = simulation_evaluator.multiply(sim_power, sim_power);
            if (sim_power.decrypts())
            {
                ++level;
            }
            else
            {
                return level;
            }
        }
    }

    void exponentiate_uint_mod(const BigUInt &operand, const BigUInt &exponent,
        const BigUInt &modulus, BigUInt &destination)
    {
        if (operand.significant_bit_count() > modulus.significant_bit_count())
        {
            throw invalid_argument("operand is not reduced");
        }
        if (operand.is_zero() && exponent == 0)
        {
            throw invalid_argument("undefined operation");
        }
        if (operand.is_zero())
        {
            destination.set_zero();
            return;
        }

        if (destination.bit_count() != modulus.significant_bit_count())
        {
            destination.resize(modulus.significant_bit_count());
        }

        MemoryPool &pool = *MemoryPool::default_pool();
        ConstPointer operand_ptr = duplicate_uint_if_needed(operand, modulus.uint64_count(), false, pool);
        util::exponentiate_uint_mod(operand_ptr.get(), exponent.pointer(), exponent.uint64_count(), Modulus(modulus.pointer(), modulus.uint64_count(), pool), destination.pointer(), pool);
    }

    void exponentiate_poly_polymod_coeffmod(const BigPoly &operand, const BigUInt &exponent,
        const BigPoly &poly_modulus, const BigUInt &coeff_modulus, BigPoly &destination)
    {
        if (operand.significant_coeff_count() > poly_modulus.coeff_count() ||
            operand.significant_coeff_bit_count() > coeff_modulus.significant_bit_count())
        {
            throw invalid_argument("operand is not reduced");
        }
        if (exponent < 0)
        {
            throw invalid_argument("exponent must be a non-negative integer");
        }
        if (operand.is_zero() && exponent == 0)
        {
            throw invalid_argument("undefined operation");
        }
        if (operand.is_zero())
        {
            destination.set_zero();
            return;
        }

        if (destination.coeff_bit_count() != coeff_modulus.significant_bit_count() ||
            destination.coeff_count() != poly_modulus.coeff_count())
        {
            destination.resize(poly_modulus.coeff_count(), coeff_modulus.significant_bit_count());
        }

        MemoryPool &pool = *MemoryPool::default_pool();
        ConstPointer operand_ptr = duplicate_poly_if_needed(operand, poly_modulus.coeff_count(), coeff_modulus.uint64_count(), false, pool);
        util::exponentiate_poly_polymod_coeffmod(operand_ptr.get(), exponent.pointer(), exponent.uint64_count(),
            PolyModulus(poly_modulus.pointer(), poly_modulus.coeff_count(), poly_modulus.uint64_count()),
            Modulus(coeff_modulus.pointer(), coeff_modulus.uint64_count(), pool),
            destination.pointer(), pool);
    }

    void poly_eval_poly(const BigPoly &poly_to_evaluate, const BigPoly &poly_to_evaluate_at, BigPoly &destination)
    {
        int poly_to_eval_coeff_uint64_count = divide_round_up(poly_to_evaluate.coeff_bit_count(), bits_per_uint64);
        int value_coeff_uint64_count = divide_round_up(poly_to_evaluate_at.coeff_bit_count(), bits_per_uint64);

        if (poly_to_evaluate.is_zero())
        {
            destination.set_zero();
            return;
        }
        if (poly_to_evaluate_at.is_zero())
        {
            destination.resize(1, poly_to_evaluate.coeff_bit_count());
            set_uint_uint(poly_to_evaluate.pointer(), poly_to_eval_coeff_uint64_count, destination.pointer());
            return;
        }

        int result_coeff_count = (poly_to_evaluate.significant_coeff_count() - 1) * (poly_to_evaluate_at.significant_coeff_count() - 1) + 1;
        int result_coeff_bit_count = poly_to_evaluate.coeff_bit_count() + (poly_to_evaluate.coeff_count() - 1) * poly_to_evaluate_at.coeff_bit_count();
        int result_coeff_uint64_count = divide_round_up(result_coeff_bit_count, bits_per_uint64);
        destination.resize(result_coeff_count, result_coeff_bit_count);

        MemoryPool &pool = *MemoryPool::default_pool();
        poly_eval_poly(poly_to_evaluate.pointer(), poly_to_evaluate.coeff_count(), poly_to_eval_coeff_uint64_count,
            poly_to_evaluate_at.pointer(), poly_to_evaluate_at.coeff_count(), value_coeff_uint64_count,
            result_coeff_count, result_coeff_uint64_count, destination.pointer(), pool);
    }

    BigPoly poly_eval_poly(const BigPoly &poly_to_evaluate, const BigPoly &poly_to_evaluate_at)
    {
        BigPoly result;
        poly_eval_poly(poly_to_evaluate, poly_to_evaluate_at, result);
        return result;
    }

    void poly_eval_poly_polymod_coeffmod(const BigPoly &poly_to_evaluate, const BigPoly &poly_to_evaluate_at,
        const BigPoly &poly_modulus, const BigUInt &coeff_modulus, BigPoly &destination)
    {
        if (poly_to_evaluate.significant_coeff_count() > poly_modulus.coeff_count() ||
            poly_to_evaluate.significant_coeff_bit_count() > coeff_modulus.significant_bit_count())
        {
            throw invalid_argument("poly_to_evaluate is not reduced");
        }
        if (poly_to_evaluate_at.significant_coeff_count() > poly_modulus.coeff_count() ||
            poly_to_evaluate_at.significant_coeff_bit_count() > coeff_modulus.significant_bit_count())
        {
            throw invalid_argument("poly_to_evaluate_at is not reduced");
        }

        int poly_to_eval_coeff_uint64_count = poly_to_evaluate.coeff_uint64_count();
        int coeff_modulus_bit_count = coeff_modulus.significant_bit_count();

        if (poly_to_evaluate.is_zero())
        {
            destination.set_zero();
        }

        MemoryPool &pool = *MemoryPool::default_pool();
        Pointer big_alloc(allocate_uint(3 * poly_to_eval_coeff_uint64_count, pool));

        if (poly_to_evaluate_at.is_zero())
        {
            destination.resize(1, coeff_modulus_bit_count);
            modulo_uint(poly_to_evaluate.pointer(), poly_to_eval_coeff_uint64_count,
                Modulus(coeff_modulus.pointer(), coeff_modulus.uint64_count(), pool),
                destination.pointer(), pool, big_alloc.get());
            return;
        }

        ConstPointer poly_to_eval_ptr = duplicate_poly_if_needed(poly_to_evaluate, poly_modulus.coeff_count(), coeff_modulus.uint64_count(), false, pool);
        ConstPointer poly_to_eval_at_ptr = duplicate_poly_if_needed(poly_to_evaluate_at, poly_modulus.coeff_count(), coeff_modulus.uint64_count(), false, pool);

        destination.resize(poly_modulus.coeff_count(), coeff_modulus_bit_count);

        util::poly_eval_poly_polymod_coeffmod(poly_to_eval_ptr.get(), poly_to_eval_at_ptr.get(),
            PolyModulus(poly_modulus.pointer(), poly_modulus.coeff_count(), poly_modulus.coeff_uint64_count()),
            Modulus(coeff_modulus.pointer(), coeff_modulus.uint64_count(), pool),
            destination.pointer(), pool);
    }

    BigPoly poly_eval_poly_polymod_coeffmod(const BigPoly &poly_to_evaluate, const BigPoly &poly_to_evaluate_at,
        const BigPoly &poly_modulus, const BigUInt &coeff_modulus)
    {
        BigPoly result;
        poly_eval_poly_polymod_coeffmod(poly_to_evaluate, poly_to_evaluate_at, poly_modulus, coeff_modulus, result);
        return result;
    }

    void poly_eval_uint_mod(const BigPoly &poly_to_evaluate, const BigUInt &value, const BigUInt &modulus, BigUInt &destination)
    {
        if (poly_to_evaluate.significant_coeff_bit_count() > modulus.significant_bit_count())
        {
            throw invalid_argument("poly_to_evaluate is not reduced");
        }
        if (value.significant_bit_count() > modulus.significant_bit_count())
        {
            throw invalid_argument("value is not reduced");
        }

        int poly_to_eval_coeff_uint64_count = poly_to_evaluate.coeff_uint64_count();
        int modulus_bit_count = modulus.significant_bit_count();

        if (poly_to_evaluate.is_zero())
        {
            destination.set_zero();
        }

        MemoryPool &pool = *MemoryPool::default_pool();
        Pointer big_alloc(allocate_uint(3 * poly_to_eval_coeff_uint64_count, pool));

        if (value.is_zero())
        {
            destination.resize(modulus_bit_count);
            modulo_uint(poly_to_evaluate.pointer(), poly_to_eval_coeff_uint64_count,
                Modulus(modulus.pointer(), modulus.uint64_count(), pool),
                destination.pointer(), pool, big_alloc.get());
            return;
        }

        ConstPointer value_ptr = duplicate_uint_if_needed(value, modulus.uint64_count(), false, pool);

        destination.resize(modulus_bit_count);

        util::poly_eval_uint_mod(poly_to_evaluate.pointer(), poly_to_eval_coeff_uint64_count, value_ptr.get(),
            Modulus(modulus.pointer(), modulus.uint64_count(), pool), destination.pointer(), pool);
    }

    BigUInt poly_eval_uint_mod(const BigPoly &poly_to_evaluate, const BigUInt &value, const BigUInt &modulus)
    {
        BigUInt result;
        poly_eval_uint_mod(poly_to_evaluate, value, modulus, result);
        return result;
    }

    BigUInt exponentiate_uint_mod(const BigUInt &operand, const BigUInt &exponent, const BigUInt &modulus)
    {
        BigUInt result(modulus.significant_bit_count());
        exponentiate_uint_mod(operand, exponent, modulus, result);
        return result;
    }

    BigPoly exponentiate_poly_polymod_coeffmod(const BigPoly &operand, const BigUInt &exponent,
        const BigPoly &poly_modulus, const BigUInt &coeff_modulus)
    {
        BigPoly result(poly_modulus.coeff_count(), coeff_modulus.significant_bit_count());
        exponentiate_poly_polymod_coeffmod(operand, exponent, poly_modulus, coeff_modulus, result);
        return result;
    }
}


All winner announcements will take place either by Anchors on a LIVE show , Or will run via ticker on homeshop18 TV after 15 days from date of show .
All winners will be called within 24 hours of the announcement and informed of their winnings .
This GC is not applicable on the following categories: 1) mobile handsets and mobile accessories 2) Electronics 3) Cameras & Camcorders 4) Computers & peripherals 5) Gifts/Gifts coupons 6 ) Food .
The GC issued during this promotion is valid for 60days or Two months from the date of issue .


text:
Maurice Pons (* 14. September 1925 in Straßburg, Département Bas-Rhin; † 8. Juni 2016 in Andé, Département Eure) war ein französischer Schriftsteller und Übersetzer.

Leben
Pons war der Sohn von Émile Pons (1885–1964), der an der Universität Straßburg lehrte, und dessen Ehefrau Jeanne Dole (1895–1991). Im Anschluss an seine Schulzeit begann Pons Philosophie zu studieren, brach dieses Studium aber ohne Abschluss ab.

Bereits während seines Studiums verfasste Pons kleine literarische Texte. Durch seine Familie kannte Pons den Verleger René Julliard (1900–1962), der sich von diesen Texten begeistert zeigte und 1951 "Métrobate", eine Erzählung, veröffentlichte. Unter den begeisterten Lesern war auch François Truffaut, der 1957 Pons' Erzählung "Virginales" als Kurzfilm Die Unverschämten verfilmte.

Neben seinen literarischen Werken schrieb Pons als Journalist u. a. für die Zeitschrift Arts des Kunsthändlers Georges Wildenstein und als Filmkritiker arbeitete Pons viel mit dem Filmproduzenten Cino del Duca (1899–1967) zusammen. Im Herbst 1957 war Pons das erste Mal in Mühle von Andé von Suzanne Lepinska. Begonnen hatten diese Treffen privat, bis Lepinska in ihrer Mühle 1962 die Association culturelle du moulin d'Andé gründete. Regelmäßig trafen sich dort Autoren wie René Depestre, Eugène Ionesco, Georges Perec u. a. Auch viele Filmschaffende wie Alain Cavalier, Roberto Enrico und Louis Malle waren hier oft zu Besuch.

Politisch interessiert, sah Pons die Kolonialpolitik seines Landes (→Afrikanisches Jahr) sehr kritisch. Zusammen mit Catherine Sauvage und vielen anderen protestierte Pons gegen die Französische Doktrin (→Algerienkrieg) und unterschrieb im September 1960 das Manifest der 121.

Maurice Pons wohnte bis an sein Lebensende in der Mühle. Er starb am 8. Juni 2016 in Andé und fand dort auch seine letzte Ruhestätte.

Ehrungen
 1989 Grand Prix de la Nouvelle (Académie française) für die Erzählung Virginales

Werke (Auswahl)
 Als Autor
 La mort d'Éros. Paris 1953.
 Deutsch: Gönnt mir den Flug. Ein Schauspielerroman. Argon Verlag, Berlin 1954.
 Patinir ou l'harmonie du monde. Paris 1980.
 Deutsch: Patinir oder die Harmonie der Welt. Dumont, Köln 1981, ISBN 3-770-11318-7.
 Le passager de la nuit. Paris 1991 (Nachdruck d. Ausg. Paris 1960)
 Embuscade à Palestro. Paris 1992 (früher unter dem Titel Le cordonnier Aristote)
 Deutsch: Die Unschuldigen. Erzählungen. Marion von Schröder Verlag, Hamburg 1962.
 Délicieuses frayeurs. Paris 2006.

 Als Übersetzer
 John Arden: La danse du sergent Musgrave (Serjeant Musgrave's Dance).
 Barbara Garson: MacBird (MacBird)
 Jerzy Kosiński: L'oiseau bariolé (The painted bird).
 Robert M. Pirsig: Traité du zen et de l'entretien des motocyclettes (Zen and the art of motocycle maintenance)
 Tennessee Williams: Le boxer manchot. Paris 1993, ISBN 2-264-00404-5.

Literatur
 Jacques Layani: écrivains contemporains. Madeleine Bourdouxhe, Paul Guimard, Maurice Pons, Roger Vailland. L'Harmattan, Paris 1999, ISBN 2-7384-7483-7.
 Maurice Pons. In: La Femelle du Requin, 2006/2007, Heft 28,

Fußnoten

Weblinks

 Julie Psaume: Nachruf in Le Figaro vom 10. Juni 2016.
 Maurice Pons bei Geneanet
 Laurent Philippot: L'âme du Moulin d'Andé, Suzanne Lipinska commandeur des arts et des lettres ... et de la passion bei France Bleu vom 1. September 2018.

Autor
Literatur (Französisch)
Literatur (Frankreich)
Roman, Epik
Erzählung
Übersetzer aus dem Englischen
Übersetzer ins Französische
Franzose
Geboren 1925
Gestorben 2016
Mann

redpajama_set_name: RedPajamaWikipedia


text:
Comparison of GCM- and RCM-simulated precipitation following stochastic postprocessing
Jonathan M. Eden, Martin Widmann, Douglas Maraun, Mathieu Vrac
In order to assess to what extent regional climate models (RCMs) yield better representations of climatic states than general circulation models (GCMs), the output of each is usually directly compared with observations. RCM output is often bias corrected, and in some cases correction methods can also be applied to GCMs. This leads to the question of whether bias-corrected RCMs perform better than bias-corrected GCMs. Here the first results from such a comparison are presented, followed by discussion of the value added by RCMs in this setup. Stochastic postprocessing, based on Model Output Statistics (MOS), is used to estimate daily precipitation at 465 stations across the United Kingdom between 1961 and 2000 using simulated precipitation from two RCMs (RACMO2 and CCLM) and, for the first time, a GCM (ECHAM5) as predictors. The large-scale weather states in each simulation are forced toward observations. The MOS method uses logistic regression to model precipitation occurrence and a Gamma distribution for the wet day distribution, and is cross validated based on Brier and quantile skill scores. A major outcome of the study is that the corrected GCM-simulated precipitation yields consistently higher validation scores than the corrected RCM-simulated precipitation. This seems to suggest that, in a setup with postprocessing, there is no clear added value by RCMs with respect to downscaling individual weather states. However, due to the different ways of controlling the atmospheric circulation in the RCM and the GCM simulations, such a strong conclusion cannot be drawn. Yet the study demonstrates how challenging it is to demonstrate the value added by RCMs in this setup.
Journal of Geophysical Research
https://doi.org/10.1002/2014JD021732
Publisher Statement: This is the peer reviewed version of the following article: Eden, JM, Widmann, M, Maraun, D & Vrac, M 2014, 'Comparison of GCM- and RCM-simulated precipitation following stochastic post processing' Journal of Geophysical Research, vol 119, no. 19, pp. 11040-11053, which has been published in final form at https://dx.doi.org/10.1002/2014JD021732This article may be used for non-commercial purposes in accordance with Wiley Terms and Conditions for Self-Archiving.
Aquatic Science
Water Science and Technology
Geochemistry and Petrology
Earth-Surface Processes
10.1002/2014JD021732
Post-PrintAccepted author manuscript, 1.9 MB
Fingerprint Dive into the research topics of 'Comparison of GCM- and RCM-simulated precipitation following stochastic postprocessing'. Together they form a unique fingerprint.
climate models Physics & Astronomy
General Circulation Models Agriculture & Biology
Climate models Chemical Compounds
regional climate Earth & Environmental Sciences
general circulation model Earth & Environmental Sciences
climate modeling Earth & Environmental Sciences
comparison Earth & Environmental Sciences
value added Agriculture & Biology
Jonathan Eden
Centre for Agroecology, Water and Resilience - Assistant Professor (Research)
Eden, J. M., Widmann, M., Maraun, D., & Vrac, M. (2014). Comparison of GCM- and RCM-simulated precipitation following stochastic postprocessing. Journal of Geophysical Research, 119(19), 11040-11053. https://doi.org/10.1002/2014JD021732
Comparison of GCM- and RCM-simulated precipitation following stochastic postprocessing. / Eden, Jonathan M.; Widmann, Martin; Maraun, Douglas; Vrac, Mathieu.
In: Journal of Geophysical Research, Vol. 119, No. 19, 16.10.2014, p. 11040-11053.
Eden, JM, Widmann, M, Maraun, D & Vrac, M 2014, 'Comparison of GCM- and RCM-simulated precipitation following stochastic postprocessing', Journal of Geophysical Research, vol. 119, no. 19, pp. 11040-11053. https://doi.org/10.1002/2014JD021732
Eden JM, Widmann M, Maraun D, Vrac M. Comparison of GCM- and RCM-simulated precipitation following stochastic postprocessing. Journal of Geophysical Research. 2014 Oct 16;119(19):11040-11053. https://doi.org/10.1002/2014JD021732
Eden, Jonathan M. ; Widmann, Martin ; Maraun, Douglas ; Vrac, Mathieu. / Comparison of GCM- and RCM-simulated precipitation following stochastic postprocessing. In: Journal of Geophysical Research. 2014 ; Vol. 119, No. 19. pp. 11040-11053.
@article{8961c6a27aaf42649753aa6b9c4c0319,
title = "Comparison of GCM- and RCM-simulated precipitation following stochastic postprocessing",
abstract = "In order to assess to what extent regional climate models (RCMs) yield better representations of climatic states than general circulation models (GCMs), the output of each is usually directly compared with observations. RCM output is often bias corrected, and in some cases correction methods can also be applied to GCMs. This leads to the question of whether bias-corrected RCMs perform better than bias-corrected GCMs. Here the first results from such a comparison are presented, followed by discussion of the value added by RCMs in this setup. Stochastic postprocessing, based on Model Output Statistics (MOS), is used to estimate daily precipitation at 465 stations across the United Kingdom between 1961 and 2000 using simulated precipitation from two RCMs (RACMO2 and CCLM) and, for the first time, a GCM (ECHAM5) as predictors. The large-scale weather states in each simulation are forced toward observations. The MOS method uses logistic regression to model precipitation occurrence and a Gamma distribution for the wet day distribution, and is cross validated based on Brier and quantile skill scores. A major outcome of the study is that the corrected GCM-simulated precipitation yields consistently higher validation scores than the corrected RCM-simulated precipitation. This seems to suggest that, in a setup with postprocessing, there is no clear added value by RCMs with respect to downscaling individual weather states. However, due to the different ways of controlling the atmospheric circulation in the RCM and the GCM simulations, such a strong conclusion cannot be drawn. Yet the study demonstrates how challenging it is to demonstrate the value added by RCMs in this setup.",
author = "Eden, {Jonathan M.} and Martin Widmann and Douglas Maraun and Mathieu Vrac",
note = "Publisher Statement: This is the peer reviewed version of the following article: Eden, JM, Widmann, M, Maraun, D & Vrac, M 2014, 'Comparison of GCM- and RCM-simulated precipitation following stochastic post processing' Journal of Geophysical Research, vol 119, no. 19, pp. 11040-11053, which has been published in final form at https://dx.doi.org/10.1002/2014JD021732This article may be used for non-commercial purposes in accordance with Wiley Terms and Conditions for Self-Archiving. ",
doi = "10.1002/2014JD021732",
journal = "Journal of Geophysical Research",
publisher = "American Geophysical Union",
T1 - Comparison of GCM- and RCM-simulated precipitation following stochastic postprocessing
AU - Eden, Jonathan M.
AU - Widmann, Martin
AU - Maraun, Douglas
AU - Vrac, Mathieu
N1 - Publisher Statement: This is the peer reviewed version of the following article: Eden, JM, Widmann, M, Maraun, D & Vrac, M 2014, 'Comparison of GCM- and RCM-simulated precipitation following stochastic post processing' Journal of Geophysical Research, vol 119, no. 19, pp. 11040-11053, which has been published in final form at https://dx.doi.org/10.1002/2014JD021732This article may be used for non-commercial purposes in accordance with Wiley Terms and Conditions for Self-Archiving.
N2 - In order to assess to what extent regional climate models (RCMs) yield better representations of climatic states than general circulation models (GCMs), the output of each is usually directly compared with observations. RCM output is often bias corrected, and in some cases correction methods can also be applied to GCMs. This leads to the question of whether bias-corrected RCMs perform better than bias-corrected GCMs. Here the first results from such a comparison are presented, followed by discussion of the value added by RCMs in this setup. Stochastic postprocessing, based on Model Output Statistics (MOS), is used to estimate daily precipitation at 465 stations across the United Kingdom between 1961 and 2000 using simulated precipitation from two RCMs (RACMO2 and CCLM) and, for the first time, a GCM (ECHAM5) as predictors. The large-scale weather states in each simulation are forced toward observations. The MOS method uses logistic regression to model precipitation occurrence and a Gamma distribution for the wet day distribution, and is cross validated based on Brier and quantile skill scores. A major outcome of the study is that the corrected GCM-simulated precipitation yields consistently higher validation scores than the corrected RCM-simulated precipitation. This seems to suggest that, in a setup with postprocessing, there is no clear added value by RCMs with respect to downscaling individual weather states. However, due to the different ways of controlling the atmospheric circulation in the RCM and the GCM simulations, such a strong conclusion cannot be drawn. Yet the study demonstrates how challenging it is to demonstrate the value added by RCMs in this setup.
AB - In order to assess to what extent regional climate models (RCMs) yield better representations of climatic states than general circulation models (GCMs), the output of each is usually directly compared with observations. RCM output is often bias corrected, and in some cases correction methods can also be applied to GCMs. This leads to the question of whether bias-corrected RCMs perform better than bias-corrected GCMs. Here the first results from such a comparison are presented, followed by discussion of the value added by RCMs in this setup. Stochastic postprocessing, based on Model Output Statistics (MOS), is used to estimate daily precipitation at 465 stations across the United Kingdom between 1961 and 2000 using simulated precipitation from two RCMs (RACMO2 and CCLM) and, for the first time, a GCM (ECHAM5) as predictors. The large-scale weather states in each simulation are forced toward observations. The MOS method uses logistic regression to model precipitation occurrence and a Gamma distribution for the wet day distribution, and is cross validated based on Brier and quantile skill scores. A major outcome of the study is that the corrected GCM-simulated precipitation yields consistently higher validation scores than the corrected RCM-simulated precipitation. This seems to suggest that, in a setup with postprocessing, there is no clear added value by RCMs with respect to downscaling individual weather states. However, due to the different ways of controlling the atmospheric circulation in the RCM and the GCM simulations, such a strong conclusion cannot be drawn. Yet the study demonstrates how challenging it is to demonstrate the value added by RCMs in this setup.
U2 - 10.1002/2014JD021732
DO - 10.1002/2014JD021732
JO - Journal of Geophysical Research
JF - Journal of Geophysical Research

redpajama_set_name: RedPajamaCommonCrawl


text:
Youth, peace and security - Security Council Open VTC
27 Apr 2020 - Maintenance of international peace and security: Youth, peace and security.
Opening remarks by the UN Secretary-General.
Progress has been made in supporting young people in the context of peace and security since the adoption of Security Council resolution 2250 (2015). Young women and men have influenced peace processes and humanitarian response efforts. They have engaged with decision makers on peace and security issues in local- to national-level policy discussions. They have demanded a multilateral system that engages them meaningfully, and they have demonstrated their potential to forge alliances and be partners to count on in sustaining peace and fostering development in a world faced with multiple challenges.
There is a growing recognition of young people's essential role in peace and security. It is encouraging to see many instances in which Governments, United Nations entities, civil society actors and others are stepping up to meet the requirements of resolution 2250 (2015).
Core challenges remain, including structural barriers limiting the participation of young people and their capacity to influence decision-making; violations of their human rights; and insufficient investment in facilitating their inclusion, in particular through education.
First report of the Secretary-General on Youth and peace and security (S/2020/167).
First report of the Secretary-General on Youth and peace and security (S/2020/167)
Maintenance of international peace and security: Climate and security ...
Maintenance of international peace and security: Security sector reform ...
English 6 Jan 2021
Maintenance of international peace and security: Challenges of maintaining...
English 2 Jul 2020
Maintenance of international peace and security: Implications of COVID-19 ...
English 9 Sep 2020
Maintenance of International Peace and Security - Security Council Open VTC
Français 15 Jan 2021
António Guterres (secrétaire général) à l'occasion du passage…
One Planet Summit pour la biodiversité
Français 8 Jan 2020
Français 31 Dec 2020
Elections et paix en République centrafricaine
Message de fin d'année 2020 du Secrétaire général adjoint aux…
2021 - Voeux pour la nouvelle année du Secrétaire général de…
WHO - Press Conference: COVID-19 Update (Geneva, 28 December…


The cost for fun dives is PHP 2000 per dive per person with air and PHP 2500 per dive with nitrox if you're nitrox certified. Night dives are PHP 2500. If you do 5 or more dives I will discount it to PHP 1800 per dive per person and PHP 2300 for nitrox. This includes all gear and everything you will need.
If you have your own gear dives are PHP 1600 each dive and if you do 5 or more the discounted price is PHP 1400 each dive. We provide weights and tanks. Nitrox is PHP 2000.
We completely understand the desire for the best prices for your holiday, however diving is a serious sport and we take great care in providing you with the best equipment and care of that equipment. Diving is much more than just prices it is about your safety and the confidence you have in our team and having this confidence in our ability is very important for you and us, and we take your safety very serious. We have the only AED on the island in my shop and we have O2 on the boats and in the shop not that we expect you will ever need it but per PADI standards we are required to have it and we support all PADI requirements and standards as noted in our agreement with PADI as a 5 Star Resort.


text:
Dietrich IV may refer to:

 Dietrich IV, Count of Cleves (ruled 1188–1198)
 Theodoric IV of Isenburg-Kempenich (ruled until 1329)


text:
Rostlärka (Mirafra rufa) är en fågel i familjen lärkor inom ordningen tättingar. Den hittas i Afrika strax söder om Sahara, från Mali till Sudan. Arten är dåligt känd och beskrivs som fåtalig, men beståndet anses ändå vara livskraftigt.

Utseende och läte
Rostlärkan är en liten till medelstor (13–15 cm) lärka med smalt beigefärgat ögonbrynsstreck och mörkstreckade roströda örontäckare. Nominatformen (se nedan) har rostfärgad hjässa och ovansida med varierad streckning i svart och beige. Stjärten är svartaktig med rostfärgade centrala stjärtpennor och smala beigefärgade kanter på yttre stjärtpennorna. Undersidan är beige, något ljusare på strupen, och bröstet streckat  och fläckat i mörkare brunt och rostbrunt.

Den skiljer sig från andra lärkor i släktet genom något längre stjärt som saknar vita sidor, från mer liknande kanellärkan genom något ljusare ovansida och beige, ej roströd, undersida. De olika underarterna skiljer sig i graden av streckning och färgtonen: lynesi är nästan enfärgad ovan medan nigriticola är mörkare ovan, djupare beige under med kraftigare streckning på bröstet.

Lätena är bristfälligt dokumenterade. Hanens sång som avges i spelflykt beskrivs som "behaglig".

Utbredning och systematik
Rostlärka delas in i tre underarter med följande utbredning:
 Mirafra rufa nigriticola – förekommer från östra Mali till norra Togo och Niger
 Mirafra rufa rufa – förekommer från Tchad till västra Sudan (Darfur)
 Mirafra rufa lynesi – förekommer i centrala Sudan (Kordofan)

BirdLife International och IUCN placerar istället arten i släktet Calendulauda.

Levnadssätt
Rostlärkan hittas i halvtorr savann och öppet skogslandsskap med inslag av Combretum på klippiga bergsryggar. Den ses födosöka på marken, enstaka eller i par, på jakt efter insekter och frön.

Häckning
Rostlärkans häckningsbiologi är dåligt känd. Spelflykt har noterats maj–juli, i Tchad även i september. Vare sig bo eller ägg har dokumenterats.

Status och hot
Arten har ett stort utbredningsområde och en stor population med stabil utveckling och tros inte vara utsatt för något substantiellt hot. Utifrån dessa kriterier kategoriserar internationella naturvårdsunionen IUCN arten som livskraftig (LC). Världspopulationen har inte uppskattats men den beskrivs som generellt fåtalig men vanlig i vissa områden.

Taxonomi och namn
Rostlärkan beskrevs taxonomiskt för första gången 1920 av Hubert Lynes. Dess vetenskapliga artnamn rufa betyder "röd" eller "rödaktig". På svenska har den även kallats rostbusklärka.

Noter

Externa länkar

 Läten på xeno-canto.org

Lärkor
Fåglar i etiopiska regionen


text:
TruScreen's development was led by leading medical academics from Sydney University who sought to establish objective technology that could improve on the conventional Pap test. They believed that it should be possible to distinguish between normal and abnormal tissue by measuring changes in physical properties, such as electrical potential.
TruScreen's development was led by leading medical academics from Sydney University.
Professor Coppleson, an international leader in colposcopy and cervical cancer, sought to establish objective technology that could improve on the conventional Pap test, which has limitations in population-based screening due to its subjective nature and its need of laboratory facilities and qualified personnel. Dr. Reid believed that it should be possible to distinguish between normal and abnormal tissue by measuring changes in physical properties, such as electrical potential.
After extensive and intensive R&D, the TruScreen 'Opto Electrical' Technology for the detection of cancerous cells was developed. The TruScreen Cervical Cancer Screening System is built on this technology and comprises a unique medical device, algorithm technology and processes designed to detect the presence, at the time of screening, of pre-cancerous and cancerous tissue on the cervix.
Following the restructuring of the business, TruScreen Pty Ltd, a subsidiary company of TruScreen Ltd (NZ), was formed in October 2013 to hold all TruScreen assets, including IP, and to act as the operations heart of the TruScreen business. The board and executive team combine experience and commercial ideas and strategies which we believe are both essential to and sufficient for the success of TruScreen globally.
In 2016, the TruScreen2 second-generation device was launched. This encapsulates world-class medical technology and contains many new and unique features including a massively increased processing capacity and faster processing, improved performance and improved user experience.
The TruScreen technology is at the forefront of the development of objective opto-electric tissue differentiation and it enjoys significant intellectual property protection.


If even the National Security Administration (N.S.A.) can have its secrets stolen and exploited, what about private companies that have profit (not data security and intelligence) as their prime directive? According to the New York Times, cybercriminals turned stolen N.S.A. hacking tools into malicious software (malware) called "WannaCry." On May 12, 2017, WannaCry began to wreak havoc on hospitals and rail services in over 150 countries.
The reputational and practical harms to the N.S.A. from this and other recent data breaches are immeasurable, as are the damages by all ongoing data security snafus worldwide. The N.S.A. will likely be cleaning up the mess and shoring up vulnerabilities for some time to come. Are there lessons for private employers in this stranger-than-fiction real story of international cyber-intrigue? Yes — the lessons apply to companies everywhere, and to employees at all levels of every organization.
On the flip side of these best practices, bad employee habits could facilitate the spread of infections, rather than nip them in the bud as recommended. WannaCry spread via email, to infect computers with software that no one had updated or that used older, unsupported systems.
How Much Do You Know About About Cybersecurity Threats?
Take this quiz to test your knowledge on common cybersecurity threats you and your employees face every day.
In fact, many employers don't emphasize data security until it's too late. Verizon recently reported that phishing (using fake emails to bait victims) occurred in 90% of all attacks that exploited human social interactions. Clicking on an attachment or link in a phishing email can install ransomware, a kind of malware that typically encrypts data in order to deny users access unless they pay a ransom. This is how WannaCry did its dirty work.
The WannaCry cyberattack highlights the importance of reining in employee cyber behavior. Insider negligence is the leading cause of data loss or theft, and unauthorized data sharing can undermine your best efforts at data security — even if employees are otherwise trained in cybersafety protocols. Training in cybersecurity awareness is extremely important — but no training can stand alone. Employers need to also shore up cybersecurity policy, balance security with productivity needs, and bolster their security infrastructure to secure data in whatever form it takes and wherever it's stored and used.
The global WannaCry ransomware attack has highlighted that cyberattacks are not the responsibility of the chief information security officer (Ciso) but of the organization and its leaders, who must actively gauge their IT dependence and invest in the risk treatment options that best match their business.
The indiscriminate nature of the WannaCry attack demonstrates that every individual can be a target whatever their sector or organization. Well-publicised breaches of shopping, email, and other providers have given criminals easy access to current email addresses, often the gateway for attacks, including WannaCry.
Execs do need to pay close attention, and not leave thwarting security threats entirely to IT, especially when leadership is part of the problem. According to a recent study, CEOs and business decision-makers are some of the biggest users of so-called "Shadow IT" — personal communication and content sharing of work information that company IT departments don't know about or authorize. The study goes on to show that up to 60% of corporate data is stored on laptops and desktops instead of a centralized server or data center. Although Shadow IT extends beyond the C-Suite, leaders need to set the right tone at the top when it comes to data security. IT's job of preventing and responding to data breaches is made harder when IT doesn't know where all the company's data is stored or how it's being used.
Schneier's scenario is neither far-fetched nor wholly hypothetical. In October of 2016, a targeted cyberattack took down millions of connected devices, including surveillance cameras, webcams, and smart thermostats.
From understanding how data is stored in authorized sources and Shadow IT to potential IoT vulnerabilities, leaders have a lot of data security to keep up with. Fortunately, they don't have to do it alone. While IT does not have all the answers, management and IT professionals can benefit by talking and (especially) listening to one another. And leaders need to lead by example, such as by helping IT account for their own Shadow IT usage (to send a message that every worker should do the same), providing guidelines to balance productivity goals with data security, and building security into systems, policies, and procedures so that security is not done ad hoc (a sure recipe for missing risks and vulnerabilities). Finally, everyone at every level of the organization needs training to raise cybersecurity awareness, and to change any unsafe practices immediately. Cybercriminals won't wait.


Home Caufield & Shook Collection Looking south on Twenty-Fifth Street at Woodland Avenue in Louisville, Kentucky, 1927.
Looking south on Twenty-Fifth Street at Woodland Avenue in Louisville, Kentucky, 1927.
Title Looking south on Twenty-Fifth Street at Woodland Avenue in Louisville, Kentucky, 1927.
Description A survey of a grade crossing at railroad tracks at S. 25th St. and Woodland Ave. in Louisville, Ky. A few houses and industrial buildings line the streets.
Source 3.25 x 4.25 in. b&w glass negative. Item no. ULPA CS 087186 in the Caufield & Shook Collection, University of Louisville Photographic Archives.
Add tags for Looking south on Twenty-Fifth Street at Woodland Avenue in Louisville, Kentucky, 1927.
Post a Comment for Looking south on Twenty-Fifth Street at Woodland Avenue in Louisville, Kentucky, 1927.


text:
The Lockport Powerhouse is a run-of-the-river dam used by the Metropolitan Water Reclamation District of Greater Chicago to control the outflow of the Sanitary and Ship Canal and limit the diversion of water from Lake Michigan into the Des Plaines River.

History
The Chicago Sanitary and Ship Canal reached Lockport, Illinois in the 1890s. As part of this construction, a lock and dam was built in Lockport. Seven waste gates, used to control the level of water in the canal and Des Plaines River, were part of this project. From 1903 to 1907, the canal was extended from Lockport to Joliet. Construction on the Lockport Powerhouse began as part of this extension in 1905. Designed by Frederick L. Barrett, the red-roofed Beaux Arts powerhouse was constructed with concrete blocks coursed to resemble stone. The powerhouse featured four Francis-style turbines to generate electrical power, capable of generating . These turbines have since been replaced with two vertical Kaplan turbines. The powerhouse was also the home of the waste gate controls. The lock and gates were designed to manage a  drop in canal elevation between the two municipalities.

A second phase of construction occurred from 1922 to 1933 to handle differing water loads following the opening of the Ohio River Standard Navigation Lock. First operational in 1907, the powerhouse is now recognized as the oldest hydroelectric plant in Illinois. The Lockport Lock, Dam and Power House Historic District was recognized by the National Park Service with a listing on the National Register of Historic Places on March 10, 2004.

Navigation Lock
The lock next to the dam & powerhouse is largely used for barge traffic and has a 39 foot (11.8 meters) drop. It is the second of eight locks on the Illinois Waterway connecting Lake Michigan to the Mississippi River.

References

External links

 Lockport Powerhouse
 I&M Canal Photo History
 Inventory of Nonutility Electric Power Plants in the United States 2000 (PDF)
 National Register of Historic Places (Will County, Illinois)

Buildings and structures in Will County, Illinois
Dams in Illinois
Hydroelectric power plants in Illinois
Lockport, Illinois
Dams completed in 1907
Dams on the National Register of Historic Places in Illinois
Energy infrastructure completed in 1907
Energy infrastructure on the National Register of Historic Places
Locks on the National Register of Historic Places in Illinois
Historic districts on the National Register of Historic Places in Illinois
National Register of Historic Places in Will County, Illinois


Need plumbing services in Canoga Park? Call Titan Brother's Plumbing and Rooter Services for top-quality service! Our trained and skilled plumbers are backed by over a decade of experience. When you spot slab leaks in your home or business, your sewer lines get sluggish, or your water heater breaks, we'll go above and beyond to fix the issues as quickly as possible.
Our staff members are selectively handpicked after passing a mandatory drug test and background check. On-call 24/7 to service the San Fernando Valley's plumbing needs, our team gets the job done right the first time.
Contact (818) 435-3776 to schedule your service with Titan Brother's Plumbing and Rooter Services!
When You Need Top-Quality Plumbing Assistance,Titan Brother's Plumbing and Rooter Services Will Be There in a Flash!
Schedule a service with our trained and experienced team.
Titan Brother's Plumbing and Rooter Services delivers the 100% guaranteed satisfaction we'd expect for our properties. When you leave your plumbing needs to our team, providing long-term solutions tailored to your plumbing problems becomes our top priority.
To do our parts in preserving and protecting the environment, Titan Brother's Plumbing and Rooter Services provides eco-friendly drain solutions for our customers' homes and businesses. We also offer free camera inspections with our drain cleaning services.
or Email the Titan Brothers!


text:
CHI 118
HOU 115
UTA 123
NZB 90
SYD 98
PERL 95
TWN 62
SOU 74
CAN 98
WUN 3
WSW –
PER –
WSW 3
CHE 0
BUR –
LEI –
LIV –
MUN –
MIL –
UDI –
MAL –
VAL –
HER –
BAY –
R. Nadal[1] -
H. Dellien -
N. Osaka[3] -
M. Bouzkova -
G. Pella[22] -
J. Smith -
A. Rublev[17] -
C. O'Connell -
A. Zverev[7] -
M. Cecchinato -
Desert Classic
S. Scheffler tied on -21
L. Westwood leads by 1
KC –
TEN –
SF –
GB –
PHI 4
DET 1
FLA 4
VGK 4
NSH 2
DAL 0
SJ 1
The UFC's 'Baddest Motherf*cker' wants to fight the Australian bushfires, and then Conor McGregor
Gadiel Notelovitz@gadi_notelovitz
Jorge Masvidal is coming to Australia.Source: AFP
While some of the world's biggest sporting stars have pledged money to assist in combating the bushfires that are terrorising Australia, the UFC's 'Baddest Motherf***er' is ready to get involved with his hands, as well as his wallet.
Jorge Masvidal, BMF titleholder, is coming Down Under next month on a speaking tour of Australia, and is ready to help in more ways than one.
After tweeting his plans "to physically help put out the fires" and donate tour proceeds to the cause, Masvidal spoke to foxsports.com.au and doubled down on his commitment.
Watch Conor McGregor v Donald 'Cowboy' Cerrone at UFC 246 on Main Event. ORDER NOW >
"I'm hoping not, I pray to God not, but if the fires are still going on when I get there, if I can put in some sweat, equity, and help somebody save their house, I'm in," Masvidal said.
I'll be in #Australia in February and would like to help. Proceeds from my visit will go to help but I also want to physically help put out the fires #theresurrection https://t.co/OMuOkfxMcY
— Jorge Masvidal UFC (@GamebredFighter) January 4, 2020
The welterweight rose to stardom after a stellar 2019 in which he downed Darren Till, and Ben Askren – in the knockout of the year – before becoming the first-ever 'Baddest Motherf***er' in the UFC when he stopped Nate Diaz last November.
"2020 is only going to be more violent," Masvidal, a veteran of the fight game, explained.
After scraping his way to the top, the now-35-year-old Masvidal is looking to cash in, and that might just include a fight with Conor McGregor.
McGregor will return to the Octagon after over a year out against Donald 'Cowboy' Cerrone at UFC 246 on December 19 (AEDT).
And while most of McGregor's options seem to be in the 155-pound division, where Khabib Nurmagomedov and co. are waiting, his comeback at welterweight opens the door for a Masvidal showdown that the Irishman has already shown interest in.
"Conor has this idea, too, that if things don't go his way and he [doesn't] get the fight [with Khabib], he'll have had a 170 [pound] fight in his pocket again and [is] considering a Masvidal fight," UFC president, Dana White, told ESPN at the end of 2019.
Jorge Masvidal of the United States is awarded the belt by Dwayne "the Rock" Johnson after his victory by TKO on a medical stoppage against Nate Diaz of the United States in the Welterweight "BMF" championship bout during UFC 244.Source: Getty Images
White added: "Conor wants that belt from Masvidal."
Masvidal, who says there's a "90 percent chance" he'll be in Las Vegas for McGregor's long-awaited return, is more than ready for the match-up if it comes his way.
"I've stated it numerous times, I'm here," Masvidal made clear.
"I'm a f***ing signature away. If he wants to dance with me, he knows what he's got to do."
Masvidal added: "It's not up to me, really. If he wants it, it's cool. If he's going back to 155, I have no business with him.
"I'm not going to keep chasing the fight. Go do your thing, man. Go keep winning championships, make your money. I've got shit to do."
Looking to build on the best year of his career, Masvidal believes he's "too much man" for McGregor, but admits the UFC's biggest star is "super-skilled".
"As a fighter, yeah [I respect him]," Masvidal said. "I don't respect some of his actions outside of the cage, but nobody's perfect."
By the time Masvidal lands in Australia, McGregor will have made his comeback, and if he secures a win against Cerrone, 'Street Jesus' will be waiting.
"2019 was a preview to 2020," Masvidal said. "I mean that with every f***ing ounce of my being. "2020 is going to be one f***ing violent year for those in attendance, and for those watching."
Put simply: "We're here to f***ing take everything that's possible."
You can buy tickets to 'An Evening with Jorge Masvidal' here >


Please be sure to read our sales policy if you have any questions about purchasing, shipping, VAT/duty costs, or returns.
Looking for support for a specific iPad device? Click on the category below to reveal compatibility or click on the shop by device button below.
The LaunchPort Rugged system includes everything you need to hold, charge and protect an iPad in a vehicle or rugged environment.
Surface Mount for iPad Pro 10.5" Now Available to order.


Sensation prevailed across Guwahati after a television journalist was stabbed brutally by a group of miscreants at Ganeshguri on Thursday night.
Chakrapani Parashar, a journalist working for News18 electronic channel was seriously injured during an attack at around 10 pm when he was stabbed at least twice by a restaurant owner along with a few of his employees in the busy Ganeshguri area in the heart of the city right in front of the office of the television channel.
Parashar who was seriously injured in the attack had been rushed to GNRC hospital where his condition is stated to be stable now.
Notably, Parashar had a verbal dual with the restaurant owner over some petty issue. The attack was believed to be a dangerous fallout of that quarrel.
Meanwhile, Dispur police have arrested the restaurant owner and three others involved in the attack. The arrested persons have been identified as Bhabesh Das, Nitin Sarma, Niraz Ahmed and Syed Ali Ahmed.


Erwin Zehentner is a visual artist from Singleton. This is the second exhibition of his works exhibited by the Singleton Public Library.
Venue: Singleton Public Library, Queen St, Singleton.
Open: Monday – Friday: 9am to 7pm, Saturday: 9am to 2pm.
Photo credit: Artwork by Erwin Zehentner. Courtesy of Erwin.


Excellent quality and value for money as always. We could not be more satisfied.
A satin finish for the centre white gold band and a polished finish to the yellow gold edges, together they create this attractive 5mm wide wedding ring. For the matching wider ring see product code R4233. Also available in 18ct for £799.


This book covers the topic of Shopify and discusses its origins, impact on the e-commerce industry, and how it has carved its place in the overall online consumer market. This book will teach you the basics of Shopify and how you can be an online entrepreneur making use of this platform.With e-commerce evolving at a rapid pace, and the global consumer market adapting to online shopping trends faster than anyone expected, Shopify is right at the crux of the movement, providing online retailers and entrepreneurs with an all-in-one solution for their digital business needs. If you have heard about Shopify and would like to know more, or you are interested in becoming a Shopify store owner yourself, this e-book is for you. Whether you already have an offline business and want to incorporate or transition to e-commerce, or this is your first foray into the exciting world of digital retail, Shopify has solutions that will work towards your advantage. 1. Language: English. Narrator: Jack Noble. Audio sample: http://samples.audible.de/bk/acx0/107607/bk_acx0_107607_sample.mp3. Digital audiobook in aax.
Wasserdicht, atmungsaktiv und widerstandsfähig - Farbe: Orange; Gr: 34; Highlights: Kapuze, Wasserdicht; geeignet für Freizeit; Material: Hauptmaterial: 92% Polyester, 8% Baumwolle, Materialbehandlung: getapte Nähte; Weitere Top-Angebote von Elkline im Online-Shop von Bergfreunde.de bestellen!
Two books in a bundle! Book 1: DIY Steps for Beginners to Complete the Process: A tips and tricks book that will help you get started and give you advice on how to set up your woodworking workshop. Woodworking is a sophisticated craft that has been practiced for centuries, and millions of dollars are being made each year by clever enthusiasts. Whether it´s your hobby or your business, you can use some help. Here are some thing you´ll learn: An extensive guide to tools with their pros and cons, and tips to use them the right way Links, knowledge, and shopping strategies for each of those tools Where to find woodworking classes, schools, or courses Simple projects to begin with and where to find supplies Small steps to creating walking sticks, letter holders, toys, or planter boxes Book 2: Do It Yourself Marketing and Crafting in a Woodworking Business: If you are trying to take your woodworking skills and knowledge to the next level, don´t miss out on this valuable guide! You will be surprised by all the things you could learn from some of the experts! In this book, you will hear about: What to do with woodworking jigs, how they work, and the benefits of doing them right How to market your woodworking creations online and offline to make a living or some money on the side Essential knowledge about wooden floors, finding contractors, and negotiations How to make a workbench, what to use and what to look for Tips to ensure safety and learn faster so you can become a pro with an advantage over competitors 1. Language: English. Narrator: Jason Burkhead. Audio sample: http://samples.audible.de/bk/acx0/097176/bk_acx0_097176_sample.mp3. Digital audiobook in aax.
Wasserdicht, atmungsaktiv und widerstandsfähig - Farbe: Beige/Weiß; Gr: 36; Highlights: Kapuze, Wasserdicht; geeignet für Freizeit; Material: Hauptmaterial: 92% Polyester, 8% Baumwolle, Materialbehandlung: getapte Nähte; Weitere Top-Angebote von Elkline im Online-Shop von Bergfreunde.de bestellen!
Marco Polo Pocket Guide Cologne: the Travel Guide with Insider Tips Explore Cologne with this handy, pocket-sized, authoritative guide, packed with Insider Tips. Discover boutique hotels, authentic restaurants, the city´s trendiest places, and get tips on shopping and what to do on a limited budget. There are plenty of ideas for travel with kids, and a summary of all the festivals and events that take place. Let Marco Polo show you all this historic city has to offer... This glorious cathedral city is a metropolis brimming with history and culture, as well as a modern multicultural haven overflowing with creative talent. From historically significant churches, world-renowned museums and architectural masterpieces to modern shopping centres and highly convivial breweries, let Marco Polo show you the best Cologne has to offer. ... This is Cologne! Your Marco Polo Cologne Pocket Guide includes: Insider Tips - we show you the hidden gems and little-known secrets that offer a real insight into the city. Discover the creative heart of Cologne in Ehrenfeld, stay in a Victorian villa or enjoy classic Rhenish cuisine in a historic, wood-panelled building. Best of - find the best things to do for free, the best ´only in´ Cologne experiences, the best things to do if it rains and the best places to relax and spoil yourself. Sightseeing - all of the top sights are organised by areas of the city so you can easily plan your day. Discovery Tours - 4 specially tailored tours will get you to the heart of Cologne. Discover and experience all the delights defining Cologne, from its historic Cathedral to its artistic quarter. Cologne in full-colour - Marco Polo Pocket Guide Cologne includes full-colour photos throughout the guide bringing the city to life offering you a real taste of what you can see and enjoy on your trip. Touring App - download any of the Discovery Tours to your smartphone, complete with the detailed route description and map exactly as featured in the guide, free of charge. The maps can be used offline too, so no roaming charges. The perfect navigational tool with distance indicators and landmarks highlighting the correct direction to travel in as well as GPS coordinates along the way. Enjoy stress-free sightseeing and never get lost again! Street Atlas and pull-out map - we´ve included a detailed street atlas and a handy, pull-out map so you can pop the guide in your bag for a full-on sightseeing day or head out with just the map to enjoy your Discovery Tour. Useful German phrases - the essential words and phrases are included to help you get by. Trust Marco Polo Pocket Guide Cologne to show you around this fascinating city. The comprehensive coverage and unique insights will ensure you experience everything Cologne has to offer and more. The special tips, personal insights and unusual experiences will help you make the most of your trip - just arrive and enjoy.
Marco Polo Pocket Guide Montenegro: the Travel Guide with Insider Tips. Explore Montenegro with this handy, pocket-sized, authoritative guide, packed with Insider Tips. Discover boutique hotels, authentic restaurants, the country´s trendiest places, and get tips on shopping and what to do on a limited budget. There are plenty of ideas for travel with kids, and a summary of all the festivals and events that take place in Montenegro. Let Marco Polo show you all this wonderful country has to offer... Idyllic bays hidden behind rocks and lined with pines, cypresses and olive trees, the flower town of Herceg Novi, the seafaring hamlet of Perast or the picturesque hotel island of Sveti Stefan will take you back to the heyday of European architecture. Countless mountain ranges, panoramic views, raging rivers and spectacular canyons, rarely can you experience so much in such a small area. This is Montenegro! Your Marco Polo Montenegro Pocket Guide includes: Insider Tips - we show you the hidden gems and little known secrets that offer a real insight into the holiday paradise that is Montenegro. Discover where you can enjoy splendid views and unforgettable sunsets, hike the Balkans Trail and taste delicious grilled meat specialities from southern Serbia. Best of - find the best things to do for free, the best ´only in´ Montenegro experiences, the best things to do if it rains and the best places to relax and spoil yourself. Sightseeing - all of the top sights are organised by region so you can easily plan your trip. Discovery Tours - specially tailored tours that will get you to the heart of Montenegro. Here are the best tours that will help you enjoy all of Montenegro´s diverse scenery, culture and cuisine. Montenegro in full-colour - Marco Polo Pocket Guide Montenegro includes full-colour photos throughout the guide bringing the country to life offering you a real taste of what you can see and enjoy on your trip. Touring App - you can download any of the Discovery Tours to your smartphone, complete with the detailed route description and map exactly as featured in the guide, free of charge. The maps can be used offline too, so no roaming charges. The perfect navigational tool with distance indicators and landmarks highlighting the correct direction to travel in as well as GPS coordinates along the way. Enjoy stress-free sightseeing and never get lost again! Road Atlas and pull-out map - we´ve included a detailed road atlas and a handy, pull-out map so you can pop the guide in your bag for a full-on sightseeing day or head out with just the map to enjoy your Discovery Tour. Useful Montenegrin phrases - the essential words and phrases are included to help you get by. Trust Marco Polo Pocket Guide Montenegro to show you around this amazing country. The comprehensive coverage and unique insights will ensure you experience everything Montenegro has to offer and more. The special tips, personal insights and unusual experiences will help you make the most of your trip - just arrive and enjoy.


The European Credit System for Vocational Education and Training (ECVET) is a technical framework for the transfer, recognition and, where appropriate, accumulation of individuals' learning outcomes with a view to achieving a qualification. ECVET aims to give people greater control over their individual learning experiences for career planning and second choices. It also makes it more attractive to move between different vocational sectors, countries and different learning and working environments. The system aims for a greater compatibility between different vocational education and training (VET) systems and their qualifications and training programmes across Europe.
The European Commission is promoting the ECVET users' guide, and has established an ECVET users' group and an ECVET network. EU member States should ensure that all relevant qualifications and related 'Europass' documents issued by national or regional authorities contain clear information related to the use of ECVET. Several projects focusing on the development and promotion of ECVET are being developed in different sectors, funded by the EU's Leonardo da Vinci Programme for vocational training. IC 50+ is one of those projects.


This course enlarges the students' understanding of their heritage through an integrated study of American literature. Through responding to fiction, nonfiction, drama, and poetry, both formally and informally, students examine the literature of the American experience. Although students entering the class should have basic writing skills, further development of composition modes and media are integrated into an extensive reading and language study.
* Scores are based on 140 student ratings out of 5.


text:
KKK Plus 17
What thought comes to your mind when you think of a K or a series of them?
If you are a fan of the Kansas City Royals, you probably think of Kauffman Stadium when you think of a K.
When most people think of KKK, the Ku Klux Klan comes to mind.
The KKK plus 17 may have never entered your mind until today.
The 20-K club is one of the world's most exclusive groups, and it consists of just 4 members. The 4th member was added last night in an amazing performance by Max Scherzer–he struck out 20 Detroit Tigers last night! When Scherzer trotted off the mound last night, he walked into the record books, and his name now appears alongside of Randy Johnson, Kerry Wood and Roger Clemens (who recorded 20 K's twice).
While Scherzer's 20 K performance gained him admission into an exclusive club, it's not the most significant membership in the world. The one of most significance is not entered by performance, but through a person—Jesus Christ:
Whosoever calls on the name of the Lord will be saved. ~Romans 10:13
The K in the case of Romans 10:13 is the Kairos. The ancient Greek's defined the right or opportune moment in which a person could do something or make a change as their Kairos moment. The present is always the Karios moment to join the "whosoever" club:
"Don't boast about tomorrow, for you don't know what a day might bring (Proverbs 27:1)."
A Parade of Champions
November 3, 2015 November 3, 2015 / insightbyseymour / Leave a comment
If you know anything about sports, you know that the Kansas City Royals just won a hard fought and entertaining battle on the baseball fields of Kansas City and New York; and, they have been crowned World Series Champions.
With child-like enthusiasm, baseball fans from near and far are descending on Kansas City today to celebrate with the Royals. They will savor the sweet taste of victory and delight as their team winds its way through the streets of Royals Town USA.
The language of sports has been spoken for thousands of years. Paul used the competition of the Isthmian Games as means to share spiritual truth. He also spoke of a parade of champions that features Jesus as the parade Marshall: "Thanks be to God, who always leads us in triumph in Christ, and through us spreads and makes evident everywhere the sweet fragrance of the knowledge of Him (2 Corinthians 2:14)."
The parade route in Kansas City with be lined with thousands of spectators, and it will be a great time for adoring fans to shout out to their favorite players. The procession that Paul spoke of is one of triumph that calls you to more than a mere spectator. You are to be a participator and speak up for Jesus.
You are the means through which God spreads the sweet fragrance of His love and mercy. Wave your banner, and give thanks for the victory you have in Him.
Dodgers, Mets, and the Beanball
No one ever likes to see a player writhing on the field in extreme pain. That, however, is the picture that will remain in the minds of sports fans following Game 2 between the Mets and the Dodgers. When Chase Utley slid into second base he did more than just break up a double play, he also broke the leg of Ruben Tejada.
I'm not a betting man, but I think the odds are high that the Mets' Pitchers have already painted a target on Utley. He is a marked man who has to know that Game 3 means he has at least one pitch that going to come in hard, fast, high and inside.
The Quotable and Notable Game of Baseball
When I was a kid, many of my Summer days were spent at makeshift ball diamonds at Graham Park, Skelly School or the water tower by Tom's house. The evening hours would find most of us at the ball diamonds by McDonald's Stadium—as in Jim McDonald, not the golden arches.
I have a pretty good understanding about the ins and outs of baseball, but one thing has troubled me for many years: Why does everybody stand up and sing "Take Me Out To The Ballgame" when we're already there?
This is what I do at 4 AM of a morning: I give a lot of profound thought to the perplexing mysteries of the universe. I also try to search and discover the true meaning and purpose of life.
I may have found some answers to secrets of life in the quotes below. Read these and study the stats on today's sports page, and you might stay busy until game time:
There are three types of baseball players: those who make it happen, those who watch it happen, and those who wonder what happens. ~Tommy Lasorda
Bob Gibson is the luckiest pitcher I ever saw. He always pitches when the other team doesn't score any runs. ~ Tim McCarver
Ninety percent of this game is half mental. ~ Yogi Berra
There are two theories on hitting the knuckleball. Unfortunately, neither one of them works. ~Charlie Lau
The way to catch a knuckleball is to wait until the ball stops rolling and then to pick it up. ~ Bob Uecker
I watch a lot of baseball on radio. ~ President Gerald Ford
I can remember a sports writer asking me for a quote and I didn't know what a quote was. I thought it was some kind of soft drink. ~Joe DiMaggio
Here's one final quote to illustrate the lack of sophistication in those who don't love the game: "The baseball mania has run its course. It has no future as a professional endeavor (Cincinnati Gazette editorial, 1879)."
October 9, 2015 October 9, 2015 / insightbyseymour / Leave a comment
Baseball! Some people love the game while others hate it. I've always enjoyed this game played by the boys of Summer; the game known as America's pastime; and, the game that makes front page news each October.
Baseball is more than an umpire calling balls and strikes over a span of 9 innings that consists of 162 games per team for a cumulative total of 2430 games played–plus the Championship Series and World Series games. Throughout the season, the players will use some 16,500 bats and 157,950 baseballs.
But the story of baseball is more than the consumption of bats and baseballs. It is a centuries old legacy of Dads reverting to childhood antics as he takes his kids to ball diamonds to cheer on his favorite team.
And, what's a game without the mustard and ketchup coated and much revered round steak in a bun–the hot dog? In 2014, the National Hot Dog and Sausage Council (NHDSC) estimated that fans would eat a whopping 21,357,316 hot dogs and 5,508,887 sausages during the MLB season. That's enough hot dogs to stretch from Dodger Stadium in Los Angeles to Wrigley Field in Chicago.
I think I just heard the ump shout, "Play ball," so I have to go, but to help you reminisce, I'm sharing a chart below that's a record of the World Series winners.
MLB World Series Winners
SEASON WINNER LOSER SERIES
2014 San Francisco Giants Kansas City Royals 4-3
2013 Boston Red Sox St. Louis Cardinals 4-2
2012 San Francisco Giants Detroit Tigers 4-0
2011 St. Louis Cardinals Texas Rangers 4-3
2010 San Francisco Giants Texas Rangers 4-1
2009 New York Yankees Philadelphia Phillies 4-2
2008 Philadelphia Phillies Tampa Bay Rays 4-1
2007 Boston Red Sox Colorado Rockies 4-0
2006 St. Louis Cardinals Detroit Tigers 4-1
2005 Chicago White Sox Houston Astros 4-0
2003 Florida Marlins New York Yankees 4-2
2002 Anaheim Angels San Francisco Giants 4-3
2001 Arizona Diamondbacks New York Yankees 4-3
2000 New York Yankees New York Mets 4-1
1999 New York Yankees Atlanta Braves 4-0
1998 New York Yankees San Diego Padres 4-0
1997 Florida Marlins Cleveland Indians 4-3
1995 Atlanta Braves Cleveland Indians 4-2
1993 Toronto Blue Jays Philadelphia Phillies 4-2
1992 Toronto Blue Jays Atlanta Braves 4-2
1991 Minnesota Twins Atlanta Braves 4-3
1990 Cincinnati Reds Oakland Athletics 4-0
1989 Oakland Athletics San Francisco Giants 4-0
1988 Los Angeles Dodgers Oakland Athletics 4-1
1987 Minnesota Twins St. Louis Cardinals 4-3
1986 New York Mets Boston Red Sox 4-3
1985 Kansas City Royals St. Louis Cardinals 4-3
1984 Detroit Tigers San Diego Padres 4-1
1983 Baltimore Orioles Philadelphia Phillies 4-1
1982 St. Louis Cardinals Milwaukee Brewers 4-3
1981 Los Angeles Dodgers New York Yankees 4-2
1980 Philadelphia Phillies Kansas City Royals 4-2
1979 Pittsburgh Pirates Baltimore Orioles 4-3
1978 New York Yankees Los Angeles Dodgers 4-2
1976 Cincinnati Reds New York Yankees 4-0
1975 Cincinnati Reds Boston Red Sox 4-3
1974 Oakland Athletics Los Angeles Dodgers 4-1
1973 Oakland Athletics New York Mets 4-3
1972 Oakland Athletics Cincinnati Reds 4-3
1970 Baltimore Orioles Cincinnati Reds 4-1
1969 New York Mets Baltimore Orioles 4-1
1968 Detroit Tigers St. Louis Cardinals 4-3
1967 St. Louis Cardinals Boston Red Sox 4-3
1966 Baltimore Orioles Los Angeles Dodgers 4-0
1965 Los Angeles Dodgers Minnesota Twins 4-3
1964 St. Louis Cardinals New York Yankees 4-3
1962 New York Yankees San Francisco Giants 4-3
1961 New York Yankees Cincinnati Reds 4-1
1960 Pittsburgh Pirates New York Yankees 4-3
1959 Los Angeles Dodgers Chicago White Sox 4-2
1958 New York Yankees Milwaukee Braves 4-3
1957 Milwaukee Braves New York Yankees 4-3
1956 New York Yankees Brooklyn Dodgers 4-3
1955 Brooklyn Dodgers New York Yankees 4-3
1954 New York Giants Cleveland Indians 4-0
1951 New York Yankees New York Giants 4-2
1948 Cleveland Indians Boston Braves 4-2
1945 Detroit Tigers Chicago Cubs 4-3
1944 St. Louis Cardinals St. Louis Browns 4-2
1943 New York Yankees St. Louis Cardinals 4-1
1940 Cincinnati Reds Detroit Tigers 4-3
1938 New York Yankees Chicago Cubs 4-0
1933 New York Giants Washington Senators 4-1
1931 St. Louis Cardinals Philadelphia Athletics 4-3
1930 Philadelphia Athletics St. Louis Cardinals 4-2
1929 Philadelphia Athletics Chicago Cubs 4-1
1927 New York Yankees Pittsburgh Pirates 4-0
1925 Pittsburgh Pirates Washington Senators 4-3
1924 Washington Senators New York Giants 4-3
1922 New York Giants New York Yankees 4-0
1920 Cleveland Indians Brooklyn Robins 5-2
1919 Cincinnati Reds Chicago White Sox 5-3
1918 Boston Red Sox Chicago Cubs 4-2
1917 Chicago White Sox New York Giants 4-2
1916 Boston Red Sox Brooklyn Robins 4-1
1915 Boston Red Sox Philadelphia Phillies 4-1
1914 Boston Braves Philadelphia Athletics 4-0
1913 Philadelphia Athletics New York Giants 4-1
1912 Boston Red Sox New York Giants 4-3
1909 Pittsburgh Pirates Detroit Tigers 4-3
1908 Chicago Cubs Detroit Tigers 4-1
1906 Chicago White Sox Chicago Cubs 4-2
1905 New York Giants Philadelphia Athletics 4-1
1903 Boston Americans Pittsburgh Pirates 5-3
Thanks to ESPN for the chart.
The Courage to Say: I Need Help
October 6, 2015 / insightbyseymour / Leave a comment
When you combine his 6'7" dominating physique with his left arm that chucks a baseball with the heat and intensity of a flamethrower, CC Sabathia can be an intimidating presence. This fierce competitor with the heart of a champion made a public statement yesterday admitting he's been beaten.
Sabathia will not be going on the injured reserve list, he will be going into a treatment program for alcohol rehabilitation. Sabathia said:
"I love baseball and I love my teammates like brothers, and I am also fully aware that I am leaving at a time when we should all be coming together for one last push toward the World Series . . . It hurts me deeply to do this now, but I owe it to myself and to my family to get myself right. I want to take control of my disease, and I want to be a better man, father and player."
Kudos to Sabathia for being honest with himself, so he can be truthful with others. He's not alone in this battle. As many as 1 in every 12 adults, suffer from alcohol abuse or an alcohol related problem.
If you find yourself in a situation similar to the one that CC Sabathia is facing, I encourage you to take three immediate steps:
Resolve to make the necessary changes.
Assess your peer group: Are they good friends who have your best interests at heart or are they just drinking buddies?
It is highly unlikely that you can whip this on your own, so seek professional help.
For those who are on the outside looking in, I remind you of the words of Paul: "Bear one another's burdens, and thereby fulfill the law of Christ (Galatians 6:2)." When your friend or family member asks for help, be willing to listen and to encourage him and he takes the first steps towards sobriety.
Step Up To The Plate and Take A Swing
July 8, 2015 July 8, 2015 / insightbyseymour / Leave a comment
This is the time of year when some guys go into some sort of a sports-like-hibernation. Football season had ended, and they blankly stare at the TV screen yearning for the next kickoff.
Not me, I love the game of baseball, and I watch several games each week. My fondness for Americas' game is due to the many memories of my dad and the times we spent together on a baseball field. He coached, his boys played, and the family rotated from one field to another playing and watching games.
Weather permitting, I played baseball almost 7 days a week. My buddies and I would ride our bikes to a designated field or park and choose up sides and the game was on.
There were usually 3 or 4 of the boys who were the best of the best, and all the other boys wanted to play on their team. You wanted them to pick you because your odds of winning were much better when you were on their team.
While I was reminiscing about this favorite summer pastime, I thought of John 15:6. Jesus said, "You did not choose me, but I chose you and appointed you to go and bear fruit, fruit that remains, so that whatever you ask the Father in my name he will give you."
The greatest All Star of all times has chosen you to play on His team. He promises to equip you and empower you to accomplish His will.
The game has begun, so why not step up into the batter's box and take a swing or two?
Are You Among the 21%?
June 10, 2015 June 11, 2015 / insightbyseymour / Leave a comment
I doubt there are many of us that number ourselves among the elite 1% of the world's wealthiest people. You may, however, find yourself among those who will be changed by the 21%.
What is the significance of 21%? If you add it to your situation, it can make a big difference:
If you are concerned with your IQ, you probably already know that 50% of IQ scores fall between 90 and 110. If you add 21% to a score of 100 you become a person with very superior intelligence. If you subtract 21% from 100, you will find yourself among the ranks of those who are classified as having a "borderline deficiency in intelligence."
The average life expectancy is 71. If you add 21%, you would live to be 86. If you subtracted 21%, you would only live to be 56.
If you are 71 inches tall you might be able to play basketball by adding 21% to your height. At 86 inches tall, you would be taller than LeBron James of the Cleveland Cavaliers If you subtract 21% from 71, you would be about 4 ½ foot tall, but still taller than Eddie Gaedel. At 3 foot 7 inches, Gaedel was the shortest player to ever play in an MLB game; and, he did it in 1951 when he played for the St. Louis Browns.
If you weigh 171 pounds, 21% would be the difference between tipping the scales at 207 pounds and weighing only 135 pounds.
If you are a person who likes to travel on an airplane, 21% means you may have to buy new luggage. The International Air Transport Association has set some new guidelines for carry-on bags. The IATA is recommending that bags should be 21.5 inches tall by 13.5 inches wide and 7.5 inches deep which is 21% smaller than current standards.
What would happen if you made a 21% change in your life? How would your life be different if you followed these old guidelines?
Let us drop every extra weight, every sin that clings to us and slackens our pace, and let us run with endurance the long race set before us, and stay focused on Jesus, who designed and perfected our faith (Hebrews 12:1-2).
Silencing Sound
October 11, 2014 / insightbyseymour / Leave a comment
I'm watching the Royals and the Orioles play game one of the American League Championship Series, and I just reached for the remote. The chants of the crowd that are an invigorating sound to most fans is just nauseating noise to me.
As a result of a head injury in 1972, I have trouble tolerating noise that is prolonged and loud. Whether it is eating in a restaurant or listening to music, what is relaxing to many of you is painful to me. This is why research that focuses on "silencing sound" is interesting to me.
Researchers have discovered that noise cancellation can be achieved by a principle called "subtraction by addition." Unpleasant acoustic waves are neutralized when an opposing wave is produced to counter the original sound wave. This "subtraction by addition" equals digital silence.
We live in a hyper-active world that is filled with noise pollution and a mindset of louder is better. Like Elijah, we think we have to have an earth-shattering grandstand event to meet our needs and to keep us going. Elijah thought God would appear to him in an amazing manner like a powerful wind, an earthquake, or a blazing fire, but God came to him in a still small voice (I Kings 19).
When Elijah subtracted his preconceived notions about God, he began to discover what he had been missing—the presence of God. To know the presence of God, practice the principle of Psalm 46:10: "Be still, and know that I am God."
Turn down the volume, turn off the technology, mute the phone, and focus on God. You may discover that silence is really is golden.
I almost forgot, a little over four hours after I started writing this, the Royals defeated the Orioles in the 10th inning. Hmmm…a Kansas City versus St. Louis would make for a great World Series.


Handmade in Solingen, Germany, by renowned knife maker Otter-Messer, this beautiful pocket knife makes for a wonderful gift.
The Buckhorn knife features simple, straightforward design for everyday use. The blade is made of high carbon C75 steel and the handle from buckhorn shell. The buckhorn handle gives a great grip when cutting. The natural texture and grain of the buckhorn also makes every knife unique.
A trusty companion that will last generations.


text:
You are here: Home / LATINO MARKETING / IS DISH DEBUTING UNIVISIÓN NOVELAS?
IS DISH DEBUTING UNIVISIÓN NOVELAS?
March 1, 2012 by Jessica Marie Gutierrez Leave a Comment
Dish Debuts Univision Novelas on Latino Package Network is First of Quartet of Cable Services DBS Provider will Launch under New Distribution Pact
Dish Network has rolled out Univision Novelas, the first of four new cable networks being launched by the U.S. Hispanic media leader this spring. Featuring a mix of current and library novelas from Univision's vast archives, Univision Novelas is now available to DishLatinos customers. The network will be flanked by an online website at http://www.univisiontlnovelas.com for women to connect on issues and topics explored in the novelas and that are close to their hearts. Fans can also engage with the new network on Univision Novelas' forums , on Twitter via @unitlnovelas and on facebook.com/unitlnovelas.
Novelas' bow is part of a far-reaching affiliation deal Univision struck with the nation's No. 3 distributor in January. As part of the agreement, terms of which were not disclosed, Dish will also become the first distributor to carry dedicated sports and news services, Univision Deportes Univision Noticias. Another network sports service, Univision Deportes Dos will be exclusive to Dish subs during 2012. All three of those networks are slated to bow during the first half of the year, according to a Univision spokeswoman.
"We are thrilled to unveil Univision tlnovelas, a network dedicated to the novela phenomenon which has transcended decades and generations as one of the most watched genres on television and continues to have mass appeal across all age groups," said Jessica Rodriguez, senior vice president of Univision Cable Networks in a statement. "This network will attract the novela fan at all levels, from novela addicts to closet viewers, who for the first time will have access to a replay of the most popular, romantic stories of all time, available at one destination."
In what will be its fist authenticated partnership, Univision is developing "TV Everywhere" applications for Novelas — and the other services– that will be available to verified Dish subscribers at a later juncture.
"We are pleased to have reached a multi-platform, multi-year agreement with Univision for their newest channels, including their award-winning novelas on this new linear channel, Univision tlnovelas," noted Dish senior vice president of Programming Dave Shull. "These novelas and thousands of hours of other Univision content will be available on demand on TVs, PCs and mobile devices for our customers."
Coming out of the gate, the Univision Novela lineup includes:
6:00 p.m. (ET) – "Esmeralda" (Emerald) – Starring Leticia Calderón and novela heart-throb Fernando Colunga, this is a story of switched destinies. Two babies are born, but the obsessive desire for a male heir and a trick of destiny causes their lives to change. The boy who was born in a miserable shack opens his eyes to the opulence of a mansion; and the beautiful little girl who was born to a silken crib takes her first steps inside the corrugated walls of poverty. The little girl, Esmeralda, is born blind, but years later, she meets the boy and they fall in love, but the secrets of the past threaten to keep them apart.
7:00 p.m. – "Palabra de Mujer" (A Woman's Word) – Starring Edith González, Ludwika Paleta, Yadhira Carrilo and Lidia Avila. Vanesa approaches her friend Delia to help her establish a production company to produce quality programming for women with Fernanda, Paulina, Matilde and Irmita supporting the business venture. The television program they seek to create becomes the motivation that Vanesa needs to rebuild her life after Julian, her husband of 22 years, leaves her for a younger woman. The show they produce, Palabra de Mujer, follows the interconnected lives of these four women from varied social backgrounds in Mexico City and how they leverage their professional success to gain control of their personal lives that have spiraled out of control.
8:00 p.m. – "Yo Amo a Juan Querendón" (I Love Irresistible Juan) – Eduardo Santamarina plays the decidedly un-dashing Juan Querendón. This leading man isn't rich, isn't very handsome, and doesn't dress well, but all the ladies love him for his kind heart and "colorful" ways. Juan holds women in very high esteem. He considers them the most beautiful creatures on the face of the Earth, nature's masterpiece, to be respected and worshipped like goddesses. As a result, he falls madly in love with them all, and they with him. One misadventure leads to another, but one thing is clear from the start: viewers find Juan Querendón irresistible, too.
FYI THE WOMAN (ANGELICA RIVERA) IS WIFE OF MEXICAN PRESIDENTIAL CANDIDATE PRI PARTY
9:00 p.m. – "Huracan" (Hurricane) – The late Eduardo Palomo and the beautiful Angélica Rivera star in this story set in the beautiful Mexican port of Mazatlán. Helena and Ulises vowed to love each other forever, carving their names on a rock by the sea. They never suspected that because of a juvenile mistake, destiny would drive them apart and change their lives completely.
10:00 p.m. – "Rosa Salvaje" (Wild Rose) – The classic story of a young girl who goes from rags to riches, twice. Rosa marries into a wealthy family, but leaves her husband when she learns that he only married her to spite his sisters and refuses to accept any alimony. To her surprise, Rosa is reunited with her long-lost mother, an upper-class woman, and becomes extremely wealthy. The novela stars Veronica Castro, Guillermo Capetillo, and Laura Zapata.
11:00 p.m. – "Niña Amada Mía" (My Beloved Little Girl) – Starring Karyme Lozano and the dashing Sergio Goyri. Don Clemente is a rich landowner who has been widowed for some time. When he decides to remarry, the three daughters he has raised since infancy suspect their new stepmother is only after their father's fortune. Soon all three daughters must make life changing decisions of whether to follow their hearts or obey their loving but strict father's wishes.
Read More: on Multichannel News
Filed Under: LATINO MARKETING Tagged With: DISH Network, Eduardo Santamarina, Fernando Colunga, JESSICA MARIE GUTIERREZ, Ludwika Paleta, Spanish language, Univision, Univision Novela
« CAN SOMEONE EXPLAIN ENERGY POLICY?
IN MEMORY OF THE COURAGEOUS ARCHBISHOP OSCAR ARNULFO ROMERO: THE BLOODBATH THAT LED EL SALVADOR TO A CIVIL WAR »