text:
George Washington Carver Did Not Invent Peanut Butter -- But He Did Invent 300 Ways to Use Peanuts (and Sweet Potatoes)!
George Washington Carver was a scientist, an accomplished pianist, and a world renowned inventor. Many people think he invented peanut butter, but this is not true! He did, however, use his creative and scientific mind to create hundreds of uses for peanuts that greatly increased farming and contributed to the economy in the South.
In fact, Carver researched and invented 300 different uses for peanuts including:
Food products: peanut lemon punch, chili sauce, caramel, peanut sausage, mayonnaise and coffee.
Cosmetics: face powder, shampoo, shaving cream and hand lotion
Other commercial products: insecticides, glue, charcoal, rubber, nitroglycerine, plastics and axle grease.
He also used peanuts to invent crop rotation. He discovered that peanuts add nutrients to the soil, while other crops like cotton depleted the soil of nutrients. He recommended planting peanuts every other year to add nutrients back into the soil.
In addition, Carver was asked to help Henry Ford in producing a peanut-based replacement for rubber... and he successful did so!
Not just peanuts
He even researched and invented multiple uses for sweet potatoes, including more than 73 dyes, rope, wood fillers, breakfast cereal, synthetic silk, shoe polish and molasses.
In fact, during World War I, he was able to use his research to help the American textile industry by developing more than 30 colors of dye from Alabama soils - at a time when dyes from Europe became difficult to obtain.
A humble man
Oddly enough, all of his inventions, George Washington Carver only patented three of them. He explained why by saying, "It is not the style of clothes one wears, neither the kind of automobile one drives, nor the amount of money one has in the bank that counts. These mean nothing. It is simply service that measures success."


Average rents across the US increased to an average of $1,400. How widespread was the increase? Rents increased in 88% of the largest 250 cities in the US. Average rents decreased in only 2%. That's 5 cities. I would be hard pressed to name 20 of the nation's largest cities--but 250?!
The report goes on to explain that the increase in June was fairly balanced across all housing sizes. Through 2018, most of the increases was due to 2 and 3 bedroom rentals. This is because renting is increasingly popular among small families (likely because owning is still out of reach for many in high demand housing markets).
This is likely related to the point above about home ownership being out of reach for many young families. National Real Estate Investor reports that the demand for single family homes is driven by financially stable young adults who are locked out of the housing market.
The fund is actually managed by Pretium Partners, but the day to day management and operations will be handled by Progress Residential. Progress has already purchased 5,000 new homes using the fund.
Puerto Rico is still suffering from the damages wrought by Hurricane Maria. Not only have home prices dropped 15% after the storm, but there has been a long running trend of decreased home value. Since 2010, median home prices have dropped 48% (today they hover around $117k). Even before the storm, roughly 1/6th of the island's mortgages were facing foreclosure (this is comparable to the US at the height of the mortgage crisis in 2010).
It looks like now is a good time to buy in Puerto Rico, as long as you have a way to handle the renovations and repairs required to bring the home into a rentable state.
The prime renting age group is ages 20-29. This group, not only as a percentage of the overall population, but in terms of overall numbers, is expected to peak in 2018. Yup, that's right now. That means this year's all-time high in rents is entirely expected due to demographic factors alone.
Over the next 10 years, the 30-39 age group is sharply increase, which should spur more home purchases and contribute to a softening rental market. This is just one factor of many, but also suggests Progress Residentials investment in single family homes is a shrewd decision: rental rates may not increase much further, but home purchases are expected to grow in the long term.
Newer PostIndependent Contractors, After-hours Maintenance Calls, Overtime, On-site Managers: Are You Protected?


Send us a question here!
STandUP for Wind is part of the Swedish Goverment's strategic research area STandUP for Energy.
The future expansion of wind power in Sweden faces many challenges. New knowledge and competencies are needed for businesses and government agencies to be able to successfully integrate electricity from wind power into the electrical network in an optimal way, to find suitable areas for building wind power parks and to place the turbines to best utilize wind conditions.
STandUP for Wind is a research centre profiled towards planning and establishing wind energy in the Swedish electrical network. The centre is a collaboration between KTH (Royal Institute of Technology) and Uppsala University as part of the government's strategic STandUP for Energy research area.
According to an Energy Agency initiated review STandUP for Wind is a strong research environment, especially in the areas of project development and grid conditions.
The centre has a turnover of approximately 40 million Swedish crowns for its research, education and communications activities and involves nearly 50 persons.
Grid Integration Week, 15-19 October 2018 at KTH - Royal Institute of Technology in Stockholm.
Nikolaos Simisrigolu will defend his thesis "Wind power wake modelling: Development and application of an actuator disc method for industrial utilization." 10.15 a.m., September 12 in E22 at Uppsala University Campus Gotland, Gotland.
Nina Svensson will defend her thesis "Mesoscale Processes over the Baltic Sea", 10.00 a.m., June 8th in the Hambersal, Geocentrum, Uppsala.
Victor Mendoza will defend his thesis "Aerodynamic Studies of Vertical Axis Wind Turbines using the Actuator Line Model" Tuesday the 5th of June at 9:00.
The Sixth symposium on OpenFOAM® in Wind Energy, June 13-15, 2018!
Ann Hyvärinen wïll defend her licentiate thesis "Wind turbines over a hilly terrain: performance and wake evolution" on Friday the 23/2 10:15.
Morgan Rossander will defend his thesis "Electromechanics of vertical axis wind turbines", at 9.15 a.m., December 8th in Uppsala.
'Wind-Farm optimization' free course at KTH, September 25-28, 2017.
Vindkraftkurs.se: Webinar on Wind Power and Birds 2017-09-11 from 14:00-15:00 (Swedish).
Vindkraftkurs.se: Webinar on Energiöverenskommelsen and wind power's social benefits 2017-06-12 from 14:00-15:00 (Swedish).
Vindkraftkurs.se Sound Webinar 1 is avialable here (Swedish)!
Erik Möllerström will defend his thesis- "Noise, eigenfrequencies and turbulence behavior of a 200 kW H-rotor vertical axis wind turbine", 13:00, April 17, 2017, Uppsala.
Akademiforum III för vindkraft den 28 mars i Uppsala! Programme and registration link as available here.
Yalin Huang will defend her thesis- "Economic Regulation Impact on Electricity Distribution Network Investment Considering Distributed Generation", 10:00, March 17, 2017, KTH.
Stefan Sjökvist will defend his thesis - "Demagnetization and Fault Simulations of Permanent Magnet Generators", 9:15, December 9, 2016, Uppsala University.
Senad Apelfröjd will defend his thesis - "Grid Connection of Permanent Magnet Generator Based Renewable Energy Systems", 9:00, November 25, 2016, Uppsala university.
Sound seminar, December 16, 2016, from 13 to 16 at KTH.
Jon Olauson will defend his thesis, 'Modelling Wind Power for Grid Integration Studies', Friday 2016-11-04 @ 9:15 a.m. (Uppsala).
Stefan Ivanell is also a 'Topic organizer for Aerodynamics and noise' on the Torque 2016 conference.
The challenges of distributed and renewable energy sources, Energiforsk seminar - Thursday 7 July, 08.00-12.00, Almedalspaviljongen, Donnersgatan 2, Visby. Register here (Swedish).
Sanna Mels will defend her doctoral thesis about wind power and local establishment processes on Tuesday the 22/3 at kl. 10.15.
Morgan Rossander will defend his licentiate "Blade force measurements and electrical torque ripple of a vertical axis wind turbine" Wednesday the 10/2 09:15.
Raphael Ebenhoch has recieved a prize from Vattenfall!
STandUP will hold 2 seminars!
Vindkraftsforskning i fokus conference 2015, 6-7 October i Uppsala.
Eduard Dyachuk will defend his thesis, 'Aerodynamics of vertical axis wind turbines. Development of simulation tools and experiments', Fr 2015-10-09 @ 9 a.m. (Uppsala).
Ola Eriksson will defend his licenciate thesis 'Numerical Computations of Wakes Behind Wind Farms' Wednesday 2015-08-25 at 10 a.m. (Visby).
Standup for Wind at Uppsala University and KTH provides one of the two strongest Swedish research environments for wind power according to a new evaluation! Read more here.
Camille Hamon will defend her thesis, 'Probabilistic security management for power system operations with large amounts of wind power', fr 2015-05-29 @ kl 9 (Stockholm).


Do you know Bubble tea? This beverage from Taiwan is very popular in Asia. To everyone's delight, its popularity has spread around the world in recent years. Nicknamed Boba tea, this drink has several variants in terms of flavours, but always contains milk and delicious pearls. These pearls, or bubbles, can be made from tapioca or fruit jellies. The term bubble is also explained by the frothed effect of the milk and tea mixture, which creates small bubbles.
Following the success of a previous article on this original drink, we suggest this time a recipe for a tropical Bubble tea, ideal to try at home. This recipe for the Four O'Clock tropical mango green tea Bubble tea is perfect to end the summer season on a good note. A single sip will be enough for you to have the impression of travelling in the south... When do we leave? Joking aside, without further ado, let's discover this winning recipe together!
Four O'Clock Tropical Mango Green Tea: The Secret Ingredient You Need!
Have you ever noticed that the secret to a good recipe often lies in certain key ingredients? In our tropical Bubble tea recipe, it is certainly the tropical green mango tea from Four O'Clock that steals the show. Made from a blend of fruit and flower petals, the latter provides a fruity, exotic and floral taste. It can be enjoyed iced or hot, depending on your preferences. As part of this homemade recipe, we suggest you opt for a chilled version. You'll be ready to tackle your next hot day with this fruity drink!
We chose to prepare this Bubble tea recipe with coconut milk. Among all milks, coconut milk is perfect to enhance the tropical taste of the drink. If you wish, you could replace coconut milk with another type of milk such as soy milk, almond milk, pea milk or simply cow's milk!
In a saucepan, bring 2 cups (500 ml) water to a boil. Add the tapioca pearls and cook for 25 minutes over medium heat. Remove from heat and let stand 20 min with the lid on. Rinse thoroughly with cold water.
Infuse the Four O'Clock tropical mango green tea in 1/2 cup boiling water for 5 minutes. Remove the tea bag and let cool.
In a cocktail blender, pour the coconut milk, orange juice, cold tea and a tablespoon of honey. Mix vigorously.
In a large glass, add the tapioca pearls and then the liquid. Add 3 ice cubes, a Bubble tea straw and enjoy!
Once your homemade Bubble Tea recipe has been prepared, it's time to enjoy it. This is a great opportunity to surround yourself with the people you appreciate in order to share the fruit of your work. And why not enjoy it all around a picnic? So you can enjoy the beautiful weather with a thirst-quenching tea in hand.
As for its presentation, choosing a pitcher or some transparent glasses will allow you to appreciate your beverage's tapioca pearls. You could also opt for Mason jars with handles to add a touch of style to your presentation. Feel free to publish a photo on social media by identifying us via #MOMENTFOUROCLOCK, since we love discovering your photos! If you feel like it, you can even add a festive touch by using pretty reusable and colourful straws.
Finally, we hope you enjoy this tropical bubble tea recipe as much as we do. Simple to make and delicious to taste, this recipe will surely impress your friends and family.


text:
Catherine Classic is available as digital download PC Steam
The classic action-adventure puzzler is now available for the first time on PC, ahead of the Catherine Full Body release on February 14th in Japan.
The original version of ATLUS' classic action-adventure puzzler is available now for the first time on PC, ahead of the Catherine Full Body release on February 14th on PlayStation 4 and PlayStation Vita in Japan, with a Western Full Body release soon to follow.
Catherine Classic tells a twisting tale of love, betrayal, and the terror of commitment. During the day Vincent has a hard choice to make: marry his long-time girlfriend Katherine or move on to the incredible blonde he just woke up next to — named Catherine. The story can take many paths: make the wrong choice and you could end up dead. At night Vincent's desperation results in terrifying nightmares in which he must climb his way up to survival, with various obstacles hindering his path. LOOK OUT for the sheep!!!
Players can choose either single player, local coop or versus mode for the tower's challenges to determine who is the better climber! Catherine Classic brings to PC the original critically acclaimed action-puzzler, with enhancements for modern PC like 4K resolutions, unlocked frame rate, customisable keyboard and mouse controls and optional Japanese Voice Over included. Players will also receive free digital deluxe content – desktop and mobile wallpapers, avatars and soundtrack samples – when purchasing the game in the first two weeks following release.
Cult-hit Catherine Classic is available now for PC as a digital download for £14.99 $19.99 €19.99 on Steam. Catherine Classic will once more explore the pleasures and horrors of love, offer up heavy moral decisions and challenge its players in devious puzzles, now fully optimised for PC in all its Classic glory.
Labels: PC, trailer

redpajama_set_name: RedPajamaCommonCrawl


text:
#ifndef SkPathRef_DEFINED
#define SkPathRef_DEFINED

#include "SkRefCnt.h"
#include <stddef.h> // ptrdiff_t

// When we're ready to break the picture format. Changes:
// * Write genID.
// * SkPathRef read/write counts (which will change the field order)
// * SkPathRef reads/writes verbs backwards.
#define NEW_PICTURE_FORMAT 0

/**
 * Holds the path verbs and points. It is versioned by a generation ID. None of its public methods
 * modify the contents. To modify or append to the verbs/points wrap the SkPathRef in an
 * SkPathRef::Editor object. Installing the editor resets the generation ID. It also performs
 * copy-on-write if the SkPathRef is shared by multipls SkPaths. The caller passes the Editor's
 * constructor a SkAutoTUnref, which may be updated to point to a new SkPathRef after the editor's
 * constructor returns.
 *
 * The points and verbs are stored in a single allocation. The points are at the begining of the
 * allocation while the verbs are stored at end of the allocation, in reverse order. Thus the points
 * and verbs both grow into the middle of the allocation until the meet. To access verb i in the
 * verb array use ref.verbs()[~i] (because verbs() returns a pointer just beyond the first
 * logical verb or the last verb in memory).
 */
class SkPathRef : public ::SkRefCnt {
public:
    SK_DECLARE_INST_COUNT(SkPathRef);

    class Editor {
    public:
        Editor(SkAutoTUnref<SkPathRef>* pathRef,
               int incReserveVerbs = 0,
               int incReservePoints = 0) {
            if (pathRef->get()->getRefCnt() > 1) {
                SkPathRef* copy = SkNEW(SkPathRef);
                copy->copy(*pathRef->get(), incReserveVerbs, incReservePoints);
                pathRef->reset(copy);
            } else {
                (*pathRef)->incReserve(incReserveVerbs, incReservePoints);
            }
            fPathRef = pathRef->get();
            fPathRef->fGenerationID = 0;
            SkDEBUGCODE(sk_atomic_inc(&fPathRef->fEditorsAttached);)
        }

        ~Editor() { SkDEBUGCODE(sk_atomic_dec(&fPathRef->fEditorsAttached);) }

        /**
         * Returns the array of points.
         */
        SkPoint* points() { return fPathRef->fPoints; }

        /**
         * Gets the ith point. Shortcut for this->points() + i
         */
        SkPoint* atPoint(int i) {
            SkASSERT((unsigned) i < (unsigned) fPathRef->fPointCnt);
            return this->points() + i;
        };

        /**
         * Adds the verb and allocates space for the number of points indicated by the verb. The
         * return value is a pointer to where the points for the verb should be written.
         */
        SkPoint* growForVerb(SkPath::Verb verb) {
            fPathRef->validate();
            return fPathRef->growForVerb(verb);
        }

        /**
         * Allocates space for additional verbs and points and returns pointers to the new verbs and
         * points. verbs will point one beyond the first new verb (index it using [~<i>]). pts points
         * at the first new point (indexed normally [<i>]).
         */
        void grow(int newVerbs, int newPts, uint8_t** verbs, SkPoint** pts) {
            SkASSERT(NULL != verbs);
            SkASSERT(NULL != pts);
            fPathRef->validate();
            int oldVerbCnt = fPathRef->fVerbCnt;
            int oldPointCnt = fPathRef->fPointCnt;
            SkASSERT(verbs && pts);
            fPathRef->grow(newVerbs, newPts);
            *verbs = fPathRef->fVerbs - oldVerbCnt;
            *pts = fPathRef->fPoints + oldPointCnt;
            fPathRef->validate();
        }

        /**
         * Resets the path ref to a new verb and point count. The new verbs and points are
         * uninitialized.
         */
        void resetToSize(int newVerbCnt, int newPointCnt) {
            fPathRef->resetToSize(newVerbCnt, newPointCnt);
        }
        /**
         * Gets the path ref that is wrapped in the Editor.
         */
        SkPathRef* pathRef() { return fPathRef; }

    private:
        SkPathRef* fPathRef;
    };

public:

    /**
     * Gets a path ref with no verbs or points.
     */
    static SkPathRef* CreateEmpty() {
        static SkAutoTUnref<SkPathRef> gEmptyPathRef(SkNEW(SkPathRef));
        gEmptyPathRef.get()->ref();
        return gEmptyPathRef.get();
    }

    /**
     * Transforms a path ref by a matrix, allocating a new one only if necessary.
     */
    static void CreateTransformedCopy(SkAutoTUnref<SkPathRef>* dst,
                                      const SkPathRef& src,
                                      const SkMatrix& matrix) {
        src.validate();
        if (matrix.isIdentity()) {
            if (dst->get() != &src) {
                dst->reset(const_cast<SkPathRef*>(&src));
                (*dst)->validate();
                src.ref();
            }
            return;
        }
        int32_t rcnt = dst->get()->getRefCnt();
        if (&src == dst->get() && 1 == rcnt) {
            matrix.mapPoints((*dst)->fPoints, (*dst)->fPointCnt);
            return;
        } else if (rcnt > 1) {
            dst->reset(SkNEW(SkPathRef));
        }
        (*dst)->resetToSize(src.fVerbCnt, src.fPointCnt);
        memcpy((*dst)->verbsMemWritable(), src.verbsMemBegin(), src.fVerbCnt * sizeof(uint8_t));
        matrix.mapPoints((*dst)->fPoints, src.points(), src.fPointCnt);
        (*dst)->validate();
    }

#if NEW_PICTURE_FORMAT
    static SkPathRef* CreateFromBuffer(SkRBuffer* buffer) {
        SkPathRef* ref = SkNEW(SkPathRef);
        ref->fGenerationID = buffer->readU32();
        int32_t verbCount = buffer->readS32();
        int32_t pointCount = buffer->readS32();
        ref->resetToSize(verbCount, pointCount);

        SkASSERT(verbCount == ref->countVerbs());
        SkASSERT(pointCount == ref->countPoints());
        buffer->read(ref->verbsMemWritable(), verbCount * sizeof(uint8_t));
        buffer->read(ref->fPoints, pointCount * sizeof(SkPoint));
        return ref;
    }
#else
    static SkPathRef* CreateFromBuffer(int verbCount, int pointCount, SkRBuffer* buffer) {
        SkPathRef* ref = SkNEW(SkPathRef);

        ref->resetToSize(verbCount, pointCount);
        SkASSERT(verbCount == ref->countVerbs());
        SkASSERT(pointCount == ref->countPoints());
        buffer->read(ref->fPoints, pointCount * sizeof(SkPoint));
        for (int i = 0; i < verbCount; ++i) {
            ref->fVerbs[~i] = buffer->readU8();
        }
        return ref;
    }
#endif

    /**
     * Rollsback a path ref to zero verbs and points with the assumption that the path ref will be
     * repopulated with approximately the same number of verbs and points. A new path ref is created
     * only if necessary.
     */
    static void Rewind(SkAutoTUnref<SkPathRef>* pathRef) {
        if (1 == (*pathRef)->getRefCnt()) {
            (*pathRef)->validate();
            (*pathRef)->fVerbCnt = 0;
            (*pathRef)->fPointCnt = 0;
            (*pathRef)->fFreeSpace = (*pathRef)->currSize();
            (*pathRef)->fGenerationID = 0;
            (*pathRef)->validate();
        } else {
            int oldVCnt = (*pathRef)->countVerbs();
            int oldPCnt = (*pathRef)->countPoints();
            pathRef->reset(SkNEW(SkPathRef));
            (*pathRef)->resetToSize(0, 0, oldVCnt, oldPCnt);
        }
    }

    virtual ~SkPathRef() {
        this->validate();
        sk_free(fPoints);
    }

    int countPoints() const { this->validate(); return fPointCnt; }
    int countVerbs() const { this->validate(); return fVerbCnt; }

    /**
     * Returns a pointer one beyond the first logical verb (last verb in memory order).
     */
    const uint8_t* verbs() const { this->validate(); return fVerbs; }

    /**
     * Returns a const pointer to the first verb in memory (which is the last logical verb).
     */
    const uint8_t* verbsMemBegin() const { return this->verbs() - fVerbCnt; }

    /**
     * Returns a const pointer to the first point.
     */
    const SkPoint* points() const { this->validate(); return fPoints; }

    /**
     * Shortcut for this->points() + this->countPoints()
     */
    const SkPoint* pointsEnd() const { return this->points() + this->countPoints(); }

    /**
     * Convenience methods for getting to a verb or point by index.
     */
    uint8_t atVerb(int index) {
        SkASSERT((unsigned) index < (unsigned) fVerbCnt);
        return this->verbs()[~index];
    }
    const SkPoint& atPoint(int index) const {
        SkASSERT((unsigned) index < (unsigned) fPointCnt);
        return this->points()[index];
    }

    bool operator== (const SkPathRef& ref) const {
        this->validate();
        ref.validate();
        bool genIDMatch = fGenerationID && fGenerationID == ref.fGenerationID;
#ifdef SK_RELEASE
        if (genIDMatch) {
            return true;
        }
#endif
        if (fPointCnt != ref.fPointCnt ||
            fVerbCnt != ref.fVerbCnt) {
            SkASSERT(!genIDMatch);
            return false;
        }
        if (0 != memcmp(this->verbsMemBegin(),
                        ref.verbsMemBegin(),
                        ref.fVerbCnt * sizeof(uint8_t))) {
            SkASSERT(!genIDMatch);
            return false;
        }
        if (0 != memcmp(this->points(),
                        ref.points(),
                        ref.fPointCnt * sizeof(SkPoint))) {
            SkASSERT(!genIDMatch);
            return false;
        }
        // We've done the work to determine that these are equal. If either has a zero genID, copy
        // the other's. If both are 0 then genID() will compute the next ID.
        if (0 == fGenerationID) {
            fGenerationID = ref.genID();
        } else if (0 == ref.fGenerationID) {
            ref.fGenerationID = this->genID();
        }
        return true;
    }

    /**
     * Writes the path points and verbs to a buffer.
     */
#if NEW_PICTURE_FORMAT
    void writeToBuffer(SkWBuffer* buffer) {
        this->validate();
        SkDEBUGCODE(size_t beforePos = buffer->pos();)

        // TODO: write gen ID here. Problem: We don't know if we're cross process or not from
        // SkWBuffer. Until this is fixed we write 0.
        buffer->write32(0);
        buffer->write32(this->fVerbCnt);
        buffer->write32(this->fPointCnt);
        buffer->write(this->verbsMemBegin(), fVerbCnt * sizeof(uint8_t));
        buffer->write(fPoints, fPointCnt * sizeof(SkPoint));

        SkASSERT(buffer->pos() - beforePos == (size_t) this->writeSize());
    }

    /**
     * Gets the number of bytes that would be written in writeBuffer()
     */
    uint32_t writeSize() {
        return 3 * sizeof(uint32_t) + fVerbCnt * sizeof(uint8_t) + fPointCnt * sizeof(SkPoint);
    }
#else
    void writeToBuffer(SkWBuffer* buffer) {
        this->validate();
        buffer->write(fPoints, fPointCnt * sizeof(SkPoint));
        for (int i = 0; i < fVerbCnt; ++i) {
            buffer->write8(fVerbs[~i]);
        }
    }
#endif

private:
    SkPathRef() {
        fPointCnt = 0;
        fVerbCnt = 0;
        fVerbs = NULL;
        fPoints = NULL;
        fFreeSpace = 0;
        fGenerationID = kEmptyGenID;
        SkDEBUGCODE(fEditorsAttached = 0;)
        this->validate();
    }

    void copy(const SkPathRef& ref, int additionalReserveVerbs, int additionalReservePoints) {
        this->validate();
        this->resetToSize(ref.fVerbCnt, ref.fPointCnt,
                          additionalReserveVerbs, additionalReservePoints);
        memcpy(this->verbsMemWritable(), ref.verbsMemBegin(), ref.fVerbCnt * sizeof(uint8_t));
        memcpy(this->fPoints, ref.fPoints, ref.fPointCnt * sizeof(SkPoint));
        // We could call genID() here to force a real ID (instead of 0). However, if we're making
        // a copy then presumably we intend to make a modification immediately afterwards.
        fGenerationID = ref.fGenerationID;
        this->validate();
    }

    /** Makes additional room but does not change the counts or change the genID */
    void incReserve(int additionalVerbs, int additionalPoints) {
        this->validate();
        size_t space = additionalVerbs * sizeof(uint8_t) + additionalPoints * sizeof (SkPoint);
        this->makeSpace(space);
        this->validate();
    }

    /** Resets the path ref with verbCount verbs and pointCount points, all unitialized. Also
     *  allocates space for reserveVerb additional verbs and reservePoints additional points.*/
    void resetToSize(int verbCount, int pointCount, int reserveVerbs = 0, int reservePoints = 0) {
        this->validate();
        fGenerationID = 0;

        size_t newSize = sizeof(uint8_t) * verbCount + sizeof(SkPoint) * pointCount;
        size_t newReserve = sizeof(uint8_t) * reserveVerbs + sizeof(SkPoint) * reservePoints;
        size_t minSize = newSize + newReserve;

        ptrdiff_t sizeDelta = this->currSize() - minSize;

        if (sizeDelta < 0 || static_cast<size_t>(sizeDelta) >= 3 * minSize) {
            sk_free(fPoints);
            fPoints = NULL;
            fVerbs = NULL;
            fFreeSpace = 0;
            fVerbCnt = 0;
            fPointCnt = 0;
            this->makeSpace(minSize);
            fVerbCnt = verbCount;
            fPointCnt = pointCount;
            fFreeSpace -= newSize;
        } else {
            fPointCnt = pointCount;
            fVerbCnt = verbCount;
            fFreeSpace = this->currSize() - minSize;
        }
        this->validate();
    }

    /**
     * Increases the verb count by newVerbs and the point count be newPoints. New verbs and points
     * are uninitialized.
     */
    void grow(int newVerbs, int newPoints) {
        this->validate();
        size_t space = newVerbs * sizeof(uint8_t) + newPoints * sizeof (SkPoint);
        this->makeSpace(space);
        fVerbCnt += newVerbs;
        fPointCnt += newPoints;
        fFreeSpace -= space;
        this->validate();
    }

    /**
     * Increases the verb count 1, records the new verb, and creates room for the requisite number
     * of additional points. A pointer to the first point is returned. Any new points are
     * uninitialized.
     */
    SkPoint* growForVerb(SkPath::Verb verb) {
        this->validate();
        int pCnt;
        switch (verb) {
            case SkPath::kMove_Verb:
                pCnt = 1;
                break;
            case SkPath::kLine_Verb:
                pCnt = 1;
                break;
            case SkPath::kQuad_Verb:
                pCnt = 2;
                break;
            case SkPath::kCubic_Verb:
                pCnt = 3;
                break;
            default:
                pCnt = 0;
        }
        size_t space = sizeof(uint8_t) + pCnt * sizeof (SkPoint);
        this->makeSpace(space);
        this->fVerbs[~fVerbCnt] = verb;
        SkPoint* ret = fPoints + fPointCnt;
        fVerbCnt += 1;
        fPointCnt += pCnt;
        fFreeSpace -= space;
        this->validate();
        return ret;
    }

    /**
     * Ensures that the free space available in the path ref is >= size. The verb and point counts
     * are not changed.
     */
    void makeSpace(size_t size) {
        this->validate();
        ptrdiff_t growSize = size - fFreeSpace;
        if (growSize <= 0) {
            return;
        }
        size_t oldSize = this->currSize();
        // round to next multiple of 8 bytes
        growSize = (growSize + 7) & ~static_cast<size_t>(7);
        // we always at least double the allocation
        if (static_cast<size_t>(growSize) < oldSize) {
            growSize = oldSize;
        }
        if (growSize < kMinSize) {
            growSize = kMinSize;
        }
        size_t newSize = oldSize + growSize;
        // Note that realloc could memcpy more than we need. It seems to be a win anyway. TODO:
        // encapsulate this.
        fPoints = reinterpret_cast<SkPoint*>(sk_realloc_throw(fPoints, newSize));
        size_t oldVerbSize = fVerbCnt * sizeof(uint8_t);
        void* newVerbsDst = reinterpret_cast<void*>(
                                reinterpret_cast<intptr_t>(fPoints) + newSize - oldVerbSize);
        void* oldVerbsSrc = reinterpret_cast<void*>(
                                reinterpret_cast<intptr_t>(fPoints) + oldSize - oldVerbSize);
        memmove(newVerbsDst, oldVerbsSrc, oldVerbSize);
        fVerbs = reinterpret_cast<uint8_t*>(reinterpret_cast<intptr_t>(fPoints) + newSize);
        fFreeSpace += growSize;
        this->validate();
    }

    /**
     * Private, non-const-ptr version of the public function verbsMemBegin().
     */
    uint8_t* verbsMemWritable() {
        this->validate();
        return fVerbs - fVerbCnt;
    }

    /**
     * Gets the total amount of space allocated for verbs, points, and reserve.
     */
    size_t currSize() const {
        return reinterpret_cast<intptr_t>(fVerbs) - reinterpret_cast<intptr_t>(fPoints);
    }

    /**
     * Gets an ID that uniquely identifies the contents of the path ref. If two path refs have the
     * same ID then they have the same verbs and points. However, two path refs may have the same
     * contents but different genIDs. Zero is reserved and means an ID has not yet been determined
     * for the path ref.
     */
    int32_t genID() const {
        SkDEBUGCODE(SkASSERT(!fEditorsAttached));
        if (!fGenerationID) {
            if (0 == fPointCnt && 0 == fVerbCnt) {
                fGenerationID = kEmptyGenID;
            } else {
                static int32_t  gPathRefGenerationID;
                // do a loop in case our global wraps around, as we never want to return a 0 or the
                // empty ID
                do {
                    fGenerationID = sk_atomic_inc(&gPathRefGenerationID) + 1;
                } while (fGenerationID <= kEmptyGenID);
            }
        }
        return fGenerationID;
    }

    void validate() const {
        SkASSERT(static_cast<ptrdiff_t>(fFreeSpace) >= 0);
        SkASSERT(reinterpret_cast<intptr_t>(fVerbs) - reinterpret_cast<intptr_t>(fPoints) >= 0);
        SkASSERT((NULL == fPoints) == (NULL == fVerbs));
        SkASSERT(!(NULL == fPoints && 0 != fFreeSpace));
        SkASSERT(!(NULL == fPoints && 0 != fFreeSpace));
        SkASSERT(!(NULL == fPoints && fPointCnt));
        SkASSERT(!(NULL == fVerbs && fVerbCnt));
        SkASSERT(this->currSize() ==
                 fFreeSpace + sizeof(SkPoint) * fPointCnt + sizeof(uint8_t) * fVerbCnt);
    }

    enum {
        kMinSize = 256,
    };

    SkPoint*            fPoints; // points to begining of the allocation
    uint8_t*            fVerbs; // points just past the end of the allocation (verbs grow backwards)
    int                 fVerbCnt;
    int                 fPointCnt;
    size_t              fFreeSpace; // redundant but saves computation
    enum {
        kEmptyGenID = 1, // GenID reserved for path ref with zero points and zero verbs.
    };
    mutable int32_t     fGenerationID;
    SkDEBUGCODE(int32_t fEditorsAttached;) // assert that only one editor in use at any time.

    typedef SkRefCnt INHERITED;
};

SK_DEFINE_INST_COUNT(SkPathRef);

#endif

redpajama_set_name: RedPajamaGithub


As a science fiction filmmaker, I'm always freaking out when the dystopian visions from different scifi writers turn from fantasy to reality either slowly or overnight. Having just finished my first time of reading George Orwell's Nineteen Eighty-Four, it's obviously more true than ever. The "Big Brother Is Watching You" –idea of all-seeing, all-controlling government that monitors every aspect of your life is obvious when reading about NSA's operations uncovered by Edward Snowden and more recently, Russia's plan to openly start doing the exact same.
But what sturck me hardest on even more acute basis on reading Orwell's magnificent science fiction book was the term doublethink – which seems to be describing quite accurately the current political toolkit on especially the right wing side.
Doublethink is – and I'm quoting Wikipedia here – the acceptance of or mental capacity to accept contrary opinions or beliefs at the same time, especially as a result of political indoctrination.
In other words it allows you to both accept that certain piece of information is both true and untrue at the same time, and just go about your life with this fact in mind. Looking at the political campaigns of late – the Brexit, Donald Trump's presidential campaign etc. – the one thing in common is that they are based on lies and false accusations and constant flooding of disinformation, which is blatant and obvious. But the most characteristic behaviour is the voters' will to choose to accept these apparent non-truths, simultaneously understanding that they are and can not be anything but lies, but still allowing them to lead their voting behaviour.
And the politicians know this. Nigel Farage, Donald Trump and in Finland Timo Soini are using the people's willing doublethink to push on, overtaking country by country and driving us into an Orwellian nightmare. The people have ceased to care of the truths, and are even defending the politicians for their blatant lies. This is what's new – before, the politicians have lied to us, of course, but they've tried to cover the lies and when uncovered, they've lost the trust of the people. Today, the people say "I understand that this isn't true, but in order for the world to become a place where I'm happy to live in, the lies are justified and I choose to believe they are true." This is, in its' very essence, what Orwell described as doublethink.
In the book, the main character, mr. Smith, begins as a government drone in a cubicle, fabricating the past to fit the needs of the future. One day, he opens up a diary and secretly starts writing his own thoughts – not those fed by government – on the paper. Those words breaks apart the doublethink lifestyle he's been leading, a woman emerges in his life and the proverbial excrement is ready to hit the fan.
In Nineteen Eighty-Four, the world has gone past the tipping point and nothing can be done to the world anymore. In our current, we're not quite there yet, but moving swiftly towards it. If lie-fed cows like Brexit campaigners and Trump are allowed to lead, soon doublethink is not just a word, but a rule and anything contradicting it is thoughtcrime, punishable by not only death, but something even worse.
George Orwell's Nineteen Eighty-Four remains to be even more relevant than before. It's a great read, not exactly easy holiday book (I took it with me as a poolside book to St. Martin, which gave it an interesting twist) but a thought-provoking and scary one. I'm yet to see the Michael Radford's film from 1984, starring stellar John Hurt, which I'm looking forward to very much.


text:
Aurora Cannabis Makes First Commercial Export to the United Kingdom
Aurora Cannabis Inc. has completed its first commercial export of cannabis oil to the United Kingdom (UK) and the product has been successfully dispensed from a pharmacy. Authorities there recently granted the Company approval for its first shipment of medical cannabis into the UK from Canada under its new legal framework that came into effect on November 1, 2018. Under the new UK framework, specialist doctors can legally issue prescriptions for cannabis-based medicines when they agree that their patients could benefit from this treatment.
"Being one of the first Canadian companies to commercially supply cannabis-based medicines into the UK under the new legal framework reflects Aurora's ability to do business in international markets that have complex and evolving regulatory systems," said Neil Belot, Chief Global Business Development Officer. "Aurora continues to grow its international footprint, which now includes the UK, a country with a population of approximately 66 million people. Regardless of the barriers we may be faced with, we are focused on helping patients around the world get access to the medicine they need."
Dr. Shane Morris, Senior Vice President of Product Development and Regulatory Affairs added, "We are thrilled to have successfully navigated the complexities of the UK's new regulatory framework to be able to supply high quality, pharmaceutical grade cannabis-based medicines into the UK from one of our EU-GMP certified facilities in Canada."
The Company is currently enhancing its UK operations to ensure patients there will have access to a range of Aurora cannabis-based medicines when and where needed.
Rubicon Organics Receives Sales Amendment from Health Canada
Highly Dutch Expands Product Lineup, Adds Amsterdam Sativa
Aphria Inc. Announces Record Second Quarter Fiscal Year 2021 Results
Aurora Announces Agreement with Great North Distributors Inc. For Canadian Retail Sales Execution
Indiva Provides Guidance of Record Net Revenue for Fiscal Q4 2020
Truss CBD USA, a HEXO Corp and Molson Coors Joint Venture, Launches Veryvell Sparkling CBD water in Colorado
Namaste Technologies Continues Upward Revenue Trend, Reporting Estimated Q4 Revenue and Fiscal 2020
How Database Integrations Can Improve Every Step in Your Cannabis Supply Chain Labeling
At any step in the cannabis supply chain, your labeling system should allow for full control and traceability, from seed to sale. Implementing lean principles and labeling best practices across the cannabis supply chain can help you streamline your seed-to-sale labeling process and help you gain control.
https://www.teklynx.com/blog/cannabis-supply-chain-labeling?utm_source=cannabis_prospect_magazine&utm_medium=media_relations&utm_campaign=cannabis_labeling
Copyright © 2021 Straight Dope Media Inc. | Contact | Subscribe


text:
SpinDx™: Point-of-Care Diagnostics Using Centrifugal Microfluidics
Researchers at Sandia National Laboratories have developed an innovative technique for conducting simultaneous multiplexed immunoassays and white blood cell counts from a single finger prick of whole blood with less than 15 minutes total sample-to-answer time. The technique is based on centrifugal microfluidics, or "lab-on-a-disk' technology, which uses centrifugal forces to manipulate samples and reagents through microfluidic channels implanted on disks that are of the same size as a standard CD or DVD.
Sandia system engineers are developing a fully-integrated, portable SpinDx™ prototype for user-friendly sample in, answer out functionality. The system uses touchscreen control pad for assay operation and result dissemination. Miniaturized fluorescence optics are used for detection. Samples are self-collected and loaded onto the device using standard capillary collection tubes. Optional wireless data transmission can be added for remote and point-of-care testing applications.
Detection is achieved with a novel bead sedimentation immunoassay scheme. The sample is mixed on-disk with a detection cocktail consisting of a) capture beads coated with antibodies specific for the target(s) of interest, and b) detection antibodies labeled with a fluorescent tag, which will be bound to the capture bead in the presence of the corresponding antigen. Following incubation, the beads are removed from the sample via sedimentation by washing the beads to remove any interferents as the beads stack at the end of the channel. The fluorescent signal of the resulting bead pellet is used to quantify the analyte present. Single channel multiplexing is achieved using beads of different size/density for individual targets.
To obtain blood cell counts, blood samples are mixed on disk with labeling agents (i.e. DNA dyes) to label the leukocytes prior to the centrifugation. The cells then separate along a pre-loaded density media based on their size and density differences. The integrated fluorescent signal of each cell band is used to quantify individual cell population counts.
Hematology: Leukocyte counts/differentials combined with proteomic detection
Multiplexed immunoassays: up to 64 parallel assays from a single sample
Speed: less than 15 minutes sample-to answer
Minimally-invasive: less than 20µL whole blood input (finger puncture)
Disposable: Inexpensive disk fabrication with pre-loaded reagents for off-the-shelf processing
Simple/robust: Based on well-established principles requiring unsophisticated instrumentation
Sandia researchers are currently pursuing additional assay concepts to broaden the diagnostic reach of the SpinDx™ platform, including genomics, viral diagnostics, and metabolomics. The integrated on-disk sample prep and extensive multiplexing capabilities facilitate versatile, "multi-omic" screening at the point-of-care, in the field, or at a centralized laboratory.
SAND 2011-6805 W
YouTube: http://www.youtube.com/watch?v=sXMCqdFj41Q
Sandia Labs News Release: Heat It and Read It: Sandia device update enables mobile testing for viruses, bacteria and active toxins
Sandia Labs News Release: Sandia Seeks Commercial Partners for Revolutionary "SpinDx" Medical Diagnostic Tool
http://www.foxnews.com/tech/2013/04/18/new-tech-to-warn-ricin-attacks/
http://www.hstoday.us/channels/us-national-guard/single-article-page/rapid-mobile-bio-threat-detector-developed-by-sandia-lab.html
http://www.gsnmagazine.com/node/28853
Microfluidic devices, systems, and methods for quantifying particles using centrifugal force 9,186,668 11/17/2015
Devices, systems, and methods for conducting sandwich assays using sedimentation 8,945,914 02/03/2015
Systems, devices, and methods for agglutination assays using sedimentation 9,244,065 01/26/2016
Devices, systems, and methods for conducting assays with improved sensitivity using sedimentation 8,962,346 02/24/2015
System and method for detecting components of a mixture including tooth elements for alignment 9,500,579 11/22/2016
Technology IDSD#11690Development StagePrototype - Sandia estimates this technology at a Technology Readiness Level 6. A prototype has been developed and tested in the laboratory with exogenous animal and human samples.AvailabilityAvailablePublished01/23/2013Last Updated02/15/2019


text:
ASIA2271
The Making of South Asia
An undergraduate course offered by the School of Culture History and Language.
Code ASIA2271
Offered by School of Culture History and Language
ANU College ANU College of Asia and the Pacific
Course subject Asian Studies
Co-taught Course
Offered in Summer Session 2022
The Making of South Asia (ASIA2271)
This course will introduce students to the myriad visions of South Asia that have been expressed through historical, social, economic, political, religious and cultural movements and debates over the past three centuries. It will focus on the crucial question: what is South Asia? In the multiplicity of dynamic and often ephemeral answers, the course will offer glimpses of the many Indias, Pakistans, Sri Lankas, and so on that reside in peoples imaginations.
It will begin during a critical period of the British Raj and survey the complex processes, events and ideologies that went into the shaping of the nations and regions of South Asia. It will follow the progression of colonialism and the emergence of anticolonial and national movements as well as struggles that slipped under the radar of popular national movements. The course will explore the violent moments of Independence and the contending aspirations of the newly minted nation-states.
Apart from opening up the world of South Asia to students, this course will also foray into questions of what it means to study Asia in the contemporary world. It will explore ways to understand the transformations the region has been undergoing.
Demonstrate knowledge of key events, social formations, and conceptual tools used to comprehend South Asian history
Identify the main controversies in South Asian history and the evidence and arguments that are applied to those debates.
Evaluate the changing role of colonialism in contemporary historical debates
Apply critical skills in the identification and use of historical sources
This is a co-taught course. Any cap on enrolments in one course applies to both courses combined.
Contribution to discussion (10) [LO 1]
2 short assignments (to include an article summary and book review, 500 words each) (30) [LO 1,2,3,4]
Written report of 2000-2500 words (30) [LO 1,2,3,4]
Presentation (15) [LO 1,2,3,4]
Q & A (15) [LO 1]
Two hours lectures and one hour tutorial each week.
Readings will be provided on Wattle.
Historical International Security
1556 10 Jan 2022 24 Jan 2022 04 Feb 2022 14 Feb 2022 Online View
3511 20 Feb 2023 27 Feb 2023 31 Mar 2023 26 May 2023 In-Person and Online N/A


text:
Андрей Андреевич Петровский (1786—1867) — генерал-майор, директор Аракчеевского кадетского корпуса, участник Бородинской битвы.

Биография
Происходил из дворян Харьковской губернии, родился в 1786 году.

Поступив на службу юнкером в 1804 году, он 20 мая 1808 года, находясь на службе в Ингерманландском драгунском полку, получил чин прапорщика, в 1811 году был произведён в поручики, 8 мая 1812 года — в штабс-капитаны.

В 1812 году Петровский принимал участие в отражении нашествия Наполеона в Россию, участник Бородинского сражения 1812 г. За отличие 22 сентября получил чин капитана Курляндского драгунского полка. 20 января 1814 года он был награждён орденом св. Георгия 4-й степени (№ 2798 по кавалерскому списку Григоровича — Степанова)

Переведенный 25 апреля 1814 года в лейб-гвардии Конно-Егерский полк, он за отличие в Заграничном походе был произведён в майоры.

За участие в многочисленных сражениях против Наполеона он также был награждён орденами св. Владимира 4-й степени с бантом (19 декабря 1812 года) и св. Анны 2-й степени (13 августа 1813 года), а также прусским орденом Pour le Mérite.

14 октября 1816 года произведён в подполковники с переводом в Лифляндский конно-егерский полк. С 13 марта 1818 года служил в Арзамасском конно-егерском полку.

10 августа 1820 года Петровский получил чин полковника, и 19 ноября 1824 года назначен был командиром Тираспольского конно-егерского полка, но в 1828 году, вследствие перелома ноги, вынужден был временно оставить командование.

В 1831 году Петровский принимал участие в подавлении Польского мятежа и за боевые отличия был награждён орденом св. Владимира 3-й степени (13 июля 1831 года) и императорской короной к ордену св. Анны 2-й степени (26 октября 1831 года) а также польским знаком отличия за военное достоинство (Virtuti Militari) 3-й степени.

В течение службы Петровский совершил 11 кампаний и был в 85 сражениях, если не более. Пред вступлением в бой он имел обычай прочитывать 90-й псалом Давида. Ни разу ни в одном из боев он не был ранен.

С мая 1833 года состоял при штабе 5-го резервного кавалерийского корпуса. Прикомандированный 22 июня 1833 года к Образцовому кавалерийскому полку, Петровский 22 апреля 1834 года был произведён в генерал-майоры с назначением состоять по военно-учебным заведениям, а 22 мая того же года был назначен председателем в образованную по Высочайшему повелению комиссию для разбора вещей, оставшихся по смерти графа Аракчеева.

30 апреля 1837 года Петровский получил место директора Нижегородского графа Аракчеева кадетского корпуса, во главе которого пробыл до 1 октября 1840 года, когда вышел в отставку.

Оставив службу, Петровский поселился в своем небольшом имении близ Задонска, но затем, отдав его двум замужним дочерям своим, поступил в 1858 году в монастырь — в Козельскую Оптину пустынь, где жил в полном уединении и где умер, приняв перед смертью монашество, 23 января 1867 года.

П. П. Карцов, в своём исследовании истории Нижегородского кадетского корпуса оставил следующую характеристику Петровского: «Старый кавалерист, участвовавший в 85 сражениях, это был в полном смысле добряк, никогда не готовившийся стать во главе воспитательного заведения. …, Несмотря на полный недостаток самостоятельности, кадеты любили Петровского за доброту, ласковость и заботливость о их содержании».

Вот что сказано в Оптинском патерике о последних годах жизни Петровского: "…Вне службы церковной никто не видел его праздным: находясь в келлии своей, он постоянно чем-нибудь занимался. Любимое занятие его составляли: внимательное чтение слова Божия, также отеческих и других душеспасительных книг, молитва, богомыслие и переписывание изречений богомудрых отцов. Плодом таких занятий было то, что труженик этот приобрел впоследствии дар, который нелегко и нескоро достается, а именно дар слез. Келейник, входивший в келлию в то время, когда стоял он на молитве, заставал его в слезах. Да и вообще, стоило, бывало, только завести с ним речь о спасении и необходимости достигать этого блага — и слезы неудержимым потоком лились из глаз его…

Вскоре после смерти отца Андрея (на 81 году жизни) келейнику его, послушнику Оптиной Пустыни Пахомию Данилову Тагинцеву, было такое сновидение. «14 февраля 1867 года,— говорил он,— в послеобеденное время прилег я на ложе свое для краткого отдохновения и вижу во сне, будто я нахожусь в каком-то обширном саду, дивная местность которого, благоухание от растущих там деревьев с листьями на ветвях, похожими на роскошные цветы, поражали взоры мои. Чудное пение красивых птиц, сидевших на деревьях, неизъяснимо услаждало слух мой. Далее мне представилось какое-то огромное великолепное здание, возвышавшееся на открытой местности среди сада; наружный вид здания, стройность во всех частях его при богатой обстановке — выше всякого описания; внутренние стены дома, казалось мне, составлены были будто бы из ярко сияющей массы, подобной чистому и прозрачному хрусталю. В одной из трех обширных зал стоял штучный, превосходной работы, стол, с изображением на поверхности птиц; а несколько далее стояли люди, обращенные лицами к той стороне, где находилась божница со святыми иконами. Они одеты были в блестящие белые одежды, покроем своим похожие на подрясники иноческие; подпоясаны ремнями, тоже монашескими; в руках своих держали четки черные; не очень длинные, но кудреватые и красивые локоны волос опускались с голов и покоились по плечам их. Все они, вместе с бывшим посреди их неизвестным мне монахом в мантии и клобуке, общим хором, необыкновенно стройно пели Херувимскую песнь. В это время из крайней комнаты, находящейся на левой стороне, очень ясно слышан был мне голос отца Андрея, обращенный ко мне: "Видишь ли, брат Пахомий, какой милости сподобил меня Господь? Блажен тот человек, который держится Господа". Голос этот был голос Андрея, самого же его в лицо не видел. С этим словом я проснулся».

Источники
 Волков С. В. Генералитет Российской империи. Энциклопедический словарь генералов и адмиралов от Петра I до Николая II. Том II. Л—Я. М., 2009. — С. 301—302. — ISBN 978-5-9524-4167-5
 Карцов П. П. Новгородский кадетский корпус: его открытие и первые годы. // Русская старина. — Т. 41. — С. 541—542

 Список генералам по старшинству. Исправлено по 20 июня. — СПб., 1840. — С. 273
 Международная военно-историческая ассоциация http://www.imha.ru/1144540662-petrovskiy-andrey-andreevich.html
 Оптинский патерик http://www.optina.ru/140914/
 Фрагмент надгробия монаха Андрея http://www.temples.ru/show_picture.php?PictureID=92064

Генерал-майоры (Российская империя)
Участники Наполеоновских и Революционных войн
Участники Бородинского сражения
Участники подавления Польского восстания 1830—1831 годов
Кавалеры ордена Святого Георгия IV класса
Кавалеры ордена Святого Владимира 3-й степени
Кавалеры ордена Святого Владимира 4-й степени
Кавалеры ордена Святой Анны 2-й степени
Кавалеры ордена Pour le Mérite
Кавалеры Польского знака отличия за военное достоинство
Монахи Русской православной церкви
Директора Нижегородского кадетского корпуса

redpajama_set_name: RedPajamaWikipedia


KENTUCKY FRIED FINGERS…. They're Chicken Licking Good!
We all know a good video is hard to resist. Whether it's the VMA awards or just goofey fun stuff, we seem to have a huge appetite for short clips. Check inside for some good "finger eating" videos.
Unlike a lot of sequels, Windows XP SP3 is better than the original. Any day now the official release is due to hit the streets. Rumors of 10% performance increases crowd my Googled results. My mind travels to increased scores for benchmarks. Microsoft's favored son is rising to the position of SUPER HERO. "WINDOWS XP CONQUERS…." Oh, sorry, I'll get back to earth now.
PC Pitstop Research took a look at the display, media (sound card) and network drivers for the PCs that ran our on line tests during the month of October 2007. Based on our observations, these hardware classes include devices that are likely to have the most frequent driver updates. When we compared a PC's installed driver date to the newest driver date for a given device in our database, we were able to determine the percentage of PCs that were not using the newest driver for their hardware component.
This report tracks the month-to-month global install base for leading digital music applications. Several types of applications are covered, including those related to paid downloads, subscriptions, music management, and file-sharing.
PC Pitstop is now 2 years old. Let's all close our eyes, make a wish, and blow out the candles. PC Pitstop has been officially alive for 2 full years. And just like an infant, we have learned and gained a lot of experience in our 2nd year.


text:
Celebrate Social Equity: Ending the War on Drugs
This summer finds America at a crossroads. Already reeling under the global COVID-19 pandemic, an upswelling of popular sentiment against police brutality and justice system overreach has spilled out into the streets. As polls make abundantly clear, Americans support greater inclusion and social equity for people of color.
How did we get here? In large part, the backstory of America's racial disparities is intertwined with a Nixon-era program, the War on Drugs. As we've written before, a cannabis enterprise—1937 Cannabis—is dedicated to helping right the wrongs of the past.
The War on Drugs: Historical Precedents
America's first war on drugs came at the turn of the 20th century when an alarming increase in the use and abuse of prescription and over-the-counter medications caused a public health crisis (not to mention an eerie foreshadowing of the current opioid crisis).
Today, we know that cannabis can actually reduce dependence upon such dangerous medications, but back then it was simply judged to be part of the problem. Though many states had already banned cannabis, 1937 marked the start of federal prohibition, spurred in large part by Harry Anslinger, an ambitious and unscrupulous rising star in the national law-enforcement community. Despite the strong objections of the American Medical Association, the Marijuana Tax Act went into effect on October 1, 1937.
Fast-forward to the 1960s, when another eerie foreshadowing—the conjunction of the Civil Rights and youth counterculture movements—first brought many of our current issues bubbling up to the mainstream. Then just as now, a conservative and polarizing president—Richard Nixon—was determined to squelch any perceived threats to his administration. In July of 1971, having managed to reduce American involvement in the costly and unwinnable war in Vietnam, Nixon unveiled a new war: The War on Drugs.
The War on Drugs: Old Prejudices Dressed Up in a New Suit
The year before, The Controlled Substances Act (CSA) had already laid the groundwork for the War on Drugs by codifying and strengthening federal anti-drug laws. But the War on Drugs represented a significant escalation: In addition to increasing funding for federal anti-drug agencies, a broad swath of mandatory sentences was instituted for drug-related offenses. Shortly thereafter the Drug Enforcement Agency (DEA) would come into being; it currently includes roughly 5,000 agents and an annual budget topping $2 billion.
If the campaign was couched in military terms—a "war" on all drugs, regardless of their objective harmfulness—the enforcement of the War on Drugs was anything but equitable. As Nixon advisor John Ehrlichman later freely admitted in an interview in Harper's Magazine, the program was designed to disrupt Nixon's principal perceived enemies—the antiwar Left and people of color—by associating them with drug use and then unduly targeting them using the full militarized weight of the War on Drugs.
After Nixon resigned in disgrace, the nation's anti-drug zeal cooled somewhat. But under another conservative president—Ronald Reagan—the War on Drugs got another infusion of firepower. Reinforcing and expanding on existing laws, the Anti-Drug Abuse Act of 1986 imposed even stiffer penalties for drug-related offenses. Notably, the racial element was still in full effect. For example, possession of 500 grams of powdered cocaine (more often associated with white users) triggered the same sentence as only 5 grams of crack cocaine (more often associated with Black users). By 2014, nearly half of the almost 200,000 people serving time in federal prisons were there for drug-related offenses.
The War on Drugs: A Turning Point?
Which brings us back to the present. Pressure for meaningful criminal justice reform was at a historic high even before this year's demonstrations against police brutality and overreach. While drug laws aren't the only reason people are unjustly targeted, arrested, and convicted, we know they play an outsize role.
At Green Goods, we support the legalization of cannabis nationwide and the social equity programs that aim to erase the unequal impact the War of Drugs has had on communities.


text:
'Apocalyptic' Fireball To Pass Earth Closer Than The Moon September 1st
dericiousknitty August 10, 2020 NASA, Prophecy
An asteroid will soon come closer to Earth than the moon, and a doomsday preacher is warning it could be an "apocalyptic fireball" prophesied in the Bible.
Asteroid 2011 ES4 is expected to skim past our planet on September 1 at 10:49am EDT (2:49pm UK time), NASA says.
The rocky visitor, measuring between 22m and 49m in diameter, will fly 0.00048 astronomical units away (44,618 miles) from Earth, at a speed of 18,253 miles per hour.
The moon is 238,855 miles from Earth so 2011 ES4 will skim by considerably closer than our lunar neighbour.
It's considered a "Potentially Hazardous Asteroid" (PHA) based on certain NASA criteria.
Asteroid 2011 ES4 will come significantly closer to Earth than the moon (Image: Getty Images/Picture Press RM
"Potentially Hazardous Asteroids (PHAs) are currently defined based on parameters that measure the asteroid's potential to make threatening close approaches to the Earth," NASA has said.
"Specifically, all asteroids with a minimum orbit intersection distance (MOID) of 0.05 au or less and an absolute magnitude (H) of 22.0 or less are considered PHAs."
While 2011 ES4 isn't believed to pose any real danger to life on Earth, Pastor Paul Begley is convinced the asteroid could spell the end of the world.
"It's been confirmed — incoming fireballs, apocalyptic, headed in our direction," he proclaimed in a recent video on his YouTube account, where he has more than 330,000 subscribers.
"Fireballs" raining down on Earth spells the end of the world, Paul Begley insists (Image: Getty Images)
"It is prophesied that apocalyptic fireballs will fall. We're getting confirmation they are coming."
Begley believes both Biblical passages and scientific evidence point to the planet being in danger of destruction by incoming space debris and asteroids in a "September to remember".
"I've been talking about this for a decade because we knew, according to the Bible, we knew it was coming – even without scientific proof," he said.
"Even Stephen Hawking says the Earth will be consumed in fire in 2600. I think it's gonna be way way sooner than that because the Bible says it in second Peter, chapter three."
The Bible speaks of the Earth "melting" in fire, which Begley says could mean asteroids (Image: Getty Images/Science Photo Libra)
Original Article:https://www.dailystar.co.uk/news/weird-news/apocalyptic-fireball-headed-earth-hazardous-22478284
Read More:European Space Agency Lists NEO Earthbound Object As REAL Reason For World-Wide Lockdown
Read More:Understanding The Significance Of September In Revelation
22 and 49 meters in diameter, Asteroid, asteroid 2011 es4, closer to the earth than the moon, doomsday preacher, fireball, Nasa, NEO, paul begley, PHA, potentially hazardous asteroid, september 1, september of revelation, stephen hawking
Previous Christians Hold Church Service In Casino As Restrictions On Worship Become More Strict Than They Are For Gambling
Next Major Explosion Rocks Baltimore, Leaves 1 Dead, Others Trapped


I specialize in teen counseling (12-18) & young/middle-aged adult counseling (18-35). While I work with clients who have a wide range of presenting issues, my particular areas of expertise can be found here. Because therapy is such and individual experience, I have a strong belief in individualizing each client's treatment plan. I believe in treating the person, rather than treating a diagnosis. For example, Instead of treating "depression", I want to know what YOUR depression feels like. I am eclectic in my therapeutic approaches but I do tend to operate from a psychodynamic, cognitive behavioral, and dialectical behavioral therapeutic approach. I help individuals with a wide range of concerns including Asperger's Syndrome,Failure to Launch, ADHD, depression, anxiety, OCD, career counseling, life transitions, bullying, and life/existential issues.
I believe that family counseling is an integral part of working with adolescent aged children and I typically inform parents that family counseling will be part of their child's treatment. I view the family as a system and any problem with one member of the family requires change on some level to the family system as well. I will help parents feel more empowered in the home by creating structure & rules and improve how effectively they communicate with their children. I will also work with their children to understand the underlying reasons for their poor behavior and to help them realize there are better ways to feel heard and understood. Lastly, I will also work with the family to come together and communicate with each other more effectively and to experience each other on a more genuine and loving level.


Would you recommend Bliss to a friend?
Hi peoples of the internet, as of 7am we have 10x the normal signups and we promise to be visible with our PH experience. We have been blogging weekly our metrics and progress since launching about a month ago: see our medium posts - thanks to being hunted we will have a great story this week! We are relentlessly listening to customer feedback - so don't hold back with your thoughts.
Bliss automatically reviews your code in real-time and shows you how much it's worth in dollar values.
I really like the concept and would like to try it out on a real codebase, but there's currently a large barrier to overcome, and I think others are going to run into this as well: it's hard for me to trust a random startup and give access to the source code of my private repos. Plus, I can't try out the product without entering credit card information. There are a few ways this can be improved: - Start by integrating manually with a few good companies and use them as case studies / testimonials to gain credibility. - When granting permissions to my github account, allow me to choose which repos I'm giving permission to (if this is possible with Github API) and improve the language on your site to let the user know that this is possible. - Find other ways to let people easily try out the product. Having a demo for your own codebase is a good start, but since I can't see the source code, I can't evaluate how well it's working. Why not allow me to try it on a public repo or provide demos of some popular open-source projects? Apart from that, this product looks really interesting and the problem it's addressing resonates with a few companies I've been involved with. Great job founders & team!
@miklern thanks for the thoughts. Github can let you restrict at the organization level but not beyond that - I did try this and agree it would be best. Security wise, having less access is so much better. We do have a bounty program for security so invite white hats to point out holes - this has really been good to lock it down. We hope as we gain acceptance we won't be thought of as 'a random startup'. Both Brian and I have a track record so we are naturally starting with our friends in the bay area as customers. Some of them with big names so we hope that will help. There is also a possibility for a hosted version when we get to true enterprise scale (think AWS image you run in your VPC). We were not ready to be hunted just yet - although we totally embrace it. January was customer discovery, February and March were launching and tweaking and we have been customer focused since (paying ones first). So although I agree the credit card is a barrier, for us this is a good thing as we are solving the problems for customers with the most pain first (pain measured by their willingness to pay now). I can also imagine a free tier or more example projects but we are not ready for that yet.
great product for tech companies all size, particularly non-tech founders who are using external resources for development. Could be useful for larger teams as well. Some @UnshackledUs applicants will be using this!


NIU nursing students participated in the Young Hearts for Life (YH4L) EKG screening at Larkin High School in Elgin, Ill. in February. YH4L is the largest heart screening program in the U.S. and offers free heart screenings to detect conditions that could lead to sudden cardiac death later in adults. Students from Karin Glenn's and Alicia Connolly's Population Health classes participated in the event.


text:
Entomobrya assuta är en urinsektsart som beskrevs av Folson 1924. Entomobrya assuta ingår i släktet Entomobrya och familjen brokhoppstjärtar. Inga underarter finns listade i Catalogue of Life.

Källor

Brokhoppstjärtar
assuta


A BACnet Certification to confirm native interoperability and ensure a high level of expertise in the buildings management!
Lyon, France: July 29th, 2013 – ControlMaestro™, the ELUTIONS' Supervisory Control And Data Acquisition solution installed in many monitoring and control applications in the Building Management field, has been recognized as BACnet Advanced operator WorkStation (B-AWS) according to the BACnet 09 version test procedure of the BTL/WSPCert accredited laboratory.
Related to the new ControlMaestro 2013 version released this month, this Certification provides further proof of the software's robustness and strengthens the ELUTIONS' position in the SCADA market for building automation monitoring and control as well as their intelligent and efficient management.
In a constantly changing market more and more driven by standards and safety aspects, the ControlMaestro technological innovations enable it to provide answers in a meaningful way and to keep ahead of its competitors while providing open connectivity and supporting all common communication protocols. ControlMaestro is also compliant with the FDA21 CFR Part 11 standard for information systems security.
"Member of the BACnet Interest Group (BIG-EU), we are closely monitoring developments in the BACnet protocol that include all the features that may be encountered in the BMS space and that are constantly evolving to meet the field's requirements.", explains Didier Pedreno, Technical Manager at ELUTIONS.
Thanks to this interoperable open protocol and to the easy configuration of all devices existing on the network(s) as well as the ability to natively access all the properties of a BACnet object without any additional tools, ControlMaestro 2013 offers maximum flexibility and optimal management of operations by enabling products and various intelligent vendor systems to exchange different data types (temperature, instructions, schedules, alerts, etc.) while increasing equipment performance. SCADA operations are easily accessible. Data sharing, scheduling, alarming and trending services are fully integrated within the SCADA system.
In this context, ControlMaestro provides valuable benefits in terms of productivity, engineering, security, user mobility and integration of third party systems.
Beyond the technical aspects, ControlMaestro also offers many economic benefits allowing Real Estate owners and operators to reduce operating costs and save on maintenance costs with the additional possibility to integrate the complementary solution for the energy management: Maestro™.
ELUTIONS is a premier global provider of Operational Business Intelligence Solutions that significantly improve business processes surrounding energy efficiency, critical asset performance and workforce productivity. ELUTIONS' technological solutions increase efficiency, reduce energy costs and create a positive and sustainable financial impact for its worldwide customers. For more information, visit the website www.elutions.com or contact +33 (0) 4 72 47 98 98.
For more information contact Elutions' Marketing team: .


If you would like to improve the look of your legs by getting rid of visible spider veins, please take the time to read about Sclerotherapy Treatment at Northwest Face in Kirkland.
It's the Gold Standard for eliminating spider veins. It is relatively painless and can be performed on an outpatient basis. It is cheaper than lasers, and leaves no scars. It's Sclerotherapy.
A concentrated saline or specially developed chemical solution is injected into the spider vein with a microfine needle. The solution washes over the tiny cells which line the inner wall of the blood vessel, dries them out, and causes them to shrink. Within a week or two, the blood vessels disappear by a natural cleaning of the body. The work of carrying the blood is shifted to other healthy blood vessels nearby, consequently improving circulation.
Sclerotherapy is far less painful, more effective, and has fewer side effects than laser treatment of spider veins. Lasers are also much more likely to cause scarring, and are considerably more expensive!
What is special about NW Face treatments?
Successful results are very technique dependent and needs to be done often by the performing physician. Dr. Voss' expertise performing Sclerotherapy on spider veins of the legs has led her to improve the results by using microfine needles and polarized light magnification.* Consequently, she is extraordinarily accurate at delivering the solution into the vein. In her consideration for patient comfort, Dr. Voss and Lisa Miner add anesthetic into their solutions, making NW Face and Body's Sclerotherapy a very well tolerated procedure. The vast majority of patients having this procedure are highly satisfied with their results.
The veins that resolve with Sclerotherapy are gone for a long time; some people won't have trouble with their veins again.
During the many years that Dr. Voss has performed Sclerotherapy, she has never had any significant side effects occur. Patients return to their normal activities immediately. Possible side effects are minimal and usually transient. Temporary reactions can include a slight swelling of the leg or foot, minor bruising and itching.


Under the hood you'll find a 6 cylinder engine with more than 270 horsepower, and for added security, dynamic Stability Control supplements the drivetrain. All wheel drive provides for safe passage, regardless of road or weather conditions. Kia prioritized fit and finish as evidenced by: 1-touch window functionality, power front seats, heated and ventilated seats, a power rear cargo door, lane departure warning, an overhead console, and a split folding rear seat. Features such as automatic climate control and leather upholstery prove that economical transportation does not need to be sparsely equipped. Back seat passengers will appreciate the rear audio controls, allowing them to make easy adjustments to the stereo system. Third row seats expand the maximum passenger capacity to 8. For drivers who enjoy the natural environment, a power moon roof allows an infusion of fresh air. Audio features include an AM/FM radio, steering wheel mounted audio controls, and 6 speakers, enhancing the audio experience throughout the interior. Kia ensures the safety and security of its passengers with equipment such as: head curtain airbags, front side impact airbags, traction control, brake assist, a security system, an emergency communication system, and 4 wheel disc brakes with ABS. Adaptive cruise control maintains a pre set distance behind the car ahead of you, simplifying highway driving and enhancing safety. We pride ourselves in consistently exceeding our customer's expectations. Please don't hesitate to give us a call.


text:
Philipp Konrad Marheineke (Hildesheim, 1 de maio de 1780 – Berlim, 31 de maio de 1846) foi um teólogo protestante alemão da Igreja Evangélica na Prússia.

Vida
Nasceu em Hildesheim, e estudou na Universidade de Göttingen. Em 1805 ele foi nomeado professor de filosofia na Universidade de Erlangen, em 1807, ele se mudou para Heidelberg. Em 1811 tornou-se professor na Universidade Humboldt, de Berlim, onde a partir de 1820, ele também foi pastor na Igreja da Trindade e trabalhou com o teólogo e filósofo Schleiermacher. Quando ele morreu, ele era um membro do conselho supremo consistorial.

Obras
Primeiramente influenciado por Schelling, Marheineke encontrou um novo mestre em GWF Hegel, e chegou a ser considerado como o líder da direita hegeliana. Ele procurou defender e explicar todas as doutrinas ortodoxas da Igreja de uma forma ortodoxa, isto é, defendendo a doutrina protestante de acordo com os princípios hegelianos. O sistema dogmático que resultou desse procedimento era inevitavelmente mais hegeliano do que cristão, era na verdade uma forma essencialmente nova do cristianismo.

Os pontos de vista desenvolvidos por Marheineke sobre a dogmática são dados na terceira edição (1847) do seu Die Grundlehren der Wissenschaft als Christlichen Dogmatik. Quando publicou a primeira edição (1819) ele ainda estava sob a influência de Schelling, a segunda edição (1827) marcou a sua mudança de opinião. Suas obras mostram uma erudição profunda, uma visão crítica aguçada, e imparcialidade rara. O Symbolik Christliche (1810-1814) foi considerado a sua obra-prima.

Outros seus trabalhos incluem: Institutiones symbolicae (1812; 3 ed, 1830.), Geschichte der deutschen Reforma (1816; 2 ª ed, 1831 e 1834.); Die Reforma, ihre Entstehung und Verbreitung in Deutschland (1846;  2 ª ed. 1858), e o póstumo Theol. Vorlesungen (1847-1849).

Outras referências:
F. Lichtenberger, History of German Theology (1889);
A. Weber, Le Système dogmatique de Marheineke (1857);
Otto Pfleiderer, Development of Theology in Germany (1890).
Luís Henrique Dreher, Metaphors of light: Philipp K. Marheineke's method and the ongoing program of mediation theology (1997)

Ligações externas
  Marheineke ‹marhàinëkë›, Philipp Konrad artigo na Enciclopedia Italiana, edição online, site treccani.it. URL visitado em 17/02/2012
  Philip Konrad Marheineke artigo na  Encyclopedia Britannica 1911, edição online, site 1911encyclopedia.org. URL visitado em 17/02/2012

Filósofos da Alemanha
!Mais Teoria da História na Wiki (Wikiconcurso de edição)


Ocean Grove Hardware is a locally owned family business that loves to give back to the local community. We are winners of the Home Hardware State and National Store of the Year, and winners of the Hardware Association of Victoria and Tasmania store of the year.
We have an experienced and talented team of employes that can help you find exactly what you need to get your job done.
We stock a huge range of top quality goods. From Weber to Bosch, Shelta to Parker Boyd. We only stock the best quality.
We know our prices are best on the market. We have what you need, and we have it at the best value around.
We have a huge sale on our Shelta Outdoor Living range, Weber BBQs at CRAZY LOW clearance prices and New Prints in stock at introductory prices! Drop in store to set yourself up for the summer!