the anaesthesia process and in Intensive Care Units.
Mermaid Care was founded in 2006 and is a Medical Technology firm, with the Vision to be Globally recognized amongst Key Opinion Leaders and Commercial Partners, as the most innovative company that provides leading technology, care systems and solutions for optimizing the Ventilation Management within the Intensive Care Unit and Anesthesia segment.
BEACON is an ICU ventilation assist system. BEACON will provide ICU clinicians with on-demand ventilator-dependant open-loop advice for ventilating patients in line with clinical practise guidelines and recommendations.
BEACON uses inputs measured by BEACON, data inputs from the ventilator and manual data entry by the clinician into a computerprogramme that has been designed to assist clinical decisions for changes to the ventilator settings for the individual patient.
from mechanical ventilation sooner, i.e. minimize the Length of Stay in the ICU.
Current technologies for ICU ventilation management on the market today are rule or protocol-based closed- or open-loop systems controlling the ventilator support to the patient.


text:
Q: Running a php code after User clicks a button? Objective: User clicks a button to subscribe to a Tag on the Tag Archive page.
I am using the current code:
            <?php
                $tag_id = get_query_var('tag_id');
                $current_user = wp_get_current_user();
                $user_id = $current_user->ID;
                $currentList = $current_user->subList;
                $tag_id = get_query_var('tag_id');
                $tagStr = " " . $tag_id . ",";
                $update;
                if(strpos($currentList,$tagStr)!== false) {
                    echo 'Already in list';
                }
                else {
                    echo 'Added to list';
                    $update = $currentList . $tagStr;
                    update_user_meta($user_id,'subList',$update);
                }
            ?>

subList is the metakey I am creating in the User_Meta database to store all the tag_ids the user is subscribing to.
The problem is that this code runs when the page loads, so just viewing it will make the user subscribe to it. I want it to execute on the click of a button.

A: You can wrap your code in a function and use a button to activate it. Create a button and assign a function to it's onclick event:
Subscribe

Now, make an AJAX request to your server after clicking the button:
function javaSubscribe() {
    // We need the ID for user and tag. Let's retrieve it from a div we will create later
    var id = getElementById('user-id-div').textContent;
    var tag = getElementById('tag-id-div').textContent;
    // Time for the real fun, let the call to the function begin
    jQuery.ajax({
        type: 'GET',
        url: 'http://example.com/wp-json/some_path_here/v1/my_subscribe?user_id=' + id + '&tag_id=' + tag,
        data: { get_param: 'value' },
        dataType: 'json',
        success: function (data) {
            if (data != null) {
                // Do whatever you want with the response
            }
        }
    });
};

Then register a REST route and wrap your code in it's callback function:
add_action( 'rest_api_init', function () {
    //Path to ajax function
    register_rest_route( 'some_path_here/v1', '/my_subscribe/', array(
            'methods' => 'GET',
            'callback' => 'subscribe_php'
    ) );
});
// The function we set in the callback
function subscribe_php(){
    // Retrieving the data from our AJAX request
    if (isset($_GET['user_id'])) {
        $user_id = $_GET['user_id'];
    }
    if (isset($_GET['tag_id'])) {
        $tag_id = $_GET['tag_id'];
    }
    $currentList = $current_user->subList;
    $tagStr = " " . $tag_id . ",";
    $update;
    if(strpos($currentList,$tagStr)!== false) {
        return 'Already in list';
    }
    else {
        $update = $currentList . $tagStr;
        update_user_meta($user_id,'subList',$update);
        return 'Added to list';
    }
}

But you will someone need to pass the data to the function. I would suggest you output it in a hidden div, and then retrieve it in your PHP function. You can use this in your template, for example:

<?php echo wp_get_current_user()->ID; ?>

<?php echo get_query_var('tag_id'); ?>

Use this method to output all the needed information and pass it to your function.

redpajama_set_name: RedPajamaStackExchange


text:
O Cemitério de Trinitatis () no distrito de Johannstadt, Dresden é juntamente com o Eliasfriedhof  um cemitério originalmente construído para o sepultamento de mortos pela peste. Devido ao seu desenho artístico, é um dos cemitérios mais significativos de Dresden em termos de história e cultural, sendo o quinto maior cemitério da cidade.

História

Após a Batalha de Dresden em agosto de 1813 a cidade parecia um hospital de campanha. Cerca de 21.000 familiares dos militares morreram ao longo do ano, e mais de 5.000 civis foram mortos em decorrência de condições catastróficas na cidade após o fim da guerra. Muitas pessoas morreram de fome, mas sucumbiram muito mais depois do fim da guerra por tifo, que em 1814 ceifou mais de 3000 vidas humanas. Os cemitérios de Dresden - Eliasfriedhof, zweiter Annenfriedhof, Innerer Matthäusfriedhof e o Johannisfriedhof (Dresden) - não podiam mais acomodar os mortos deste tempo e também eram culpados pela disseminação da epidemia de tifo devido à sua superlotação.

Personalidades

Paul Adolph, diretor de teatro
Johann Christoph Arnold (1763–1847), livreiro
Sophie von Baudissin (1817–1894), escritora
Wolf Heinrich Graf von Baudissin (1789–1878), escritor e tradutor
Dietrich Otto von Berlepsch (1823–1896), advogado alemão e político religioso
Georg Berndt (1880–1972), técnico de medição
Heinrich August Blochmann (1787–1851), agricultor e comissário
Rudolf Sigismund Blochmann (1784–1871), pioneiro da iluminação a gás
J. Arthur Bohlig (1879–1975), arquiteto
Franz Magnus Böhme (1827–1898), compositor
Karl Friedrich Emil Bönisch (1832–1894), prefeito de Dresden
Harald Julius von Bosse (1812–1894), arquiteto teuto-russo
Hermann von Broizem (1850–1918), general saxão da cavalaria , comandante militar na Saxônia
Hugo Bürkner (1818–1897), pintor
Carl Gustav Carus (1789–1869), médico e pintor
Lili Elbe (1882–1931), pintora dinamarquesa
Heinrich Albert Erbstein (1840–1890), numismático
Julius Richard Erbstein (1838–1907), numismático
Julius Theodor Erbstein (1803–1882), arquivista e numismático
Ernst Engel (1821–1896), estatístico e economista social
Emil Eule (1843–1887), compositor
Heinrich David August Ficinus (1782–1857), médico e naturalista
Carl Ludwig Alfred Fiedler (1835–1921), médico
Kurt Arnold Findeisen (1883–1963), escritor
Caspar David Friedrich (1774–1840), pintor
Georg Funk (1901–1990), professor de planejamento urbano
Bernhard Gerth (1844–1911), filólogo clássico
Friedrich Gonne (1813–1906), pintor
Alexe Grahl (1844–1903), fotógrafa
August Grahl (1791–1868), pintor de miniaturas
Hugo Grahl (1834–1905), engenheiro agrônomo
Theodor Grosse (1829–1891), pintor
Richard Guhr (1873–1956), escultor
Gustav Adolf Gunkel (1866–1901), compositor
Hermann Joachim Hahn (1679–1726), pregador
Carl Gustav Axel Harnack (1851–1888), matemático
Alfred Moritz Hauschild (1841–1929), arquiteto
Theodor Hell (1775–1856), escritor
Christian Gottlob Höpner, (1799–1859) organista e compositor
Balthasar Hübler (1788–1866), jurista
Karoline Jagemann (1777–1848), atriz e cantora
Carl von Kaskel (1797–1874), banqueiro, co-fundador do antigo "Dresdner Bank"
Johann Friedrich Kind (1768–1843), poeta do "Freischütz"
Christian Gottlieb Kühn (1780–1828), escultor
Carl Robert Kummer (1810–1889), pintor
Günther Landgraf (1928–2006), físico alemão
Karl Laux (1896–1978), musicólogo
Constantin Lipsius (1832–1894), arquiteto
Otto Ludwig (1813–1865), escritor
Ida von Lüttichau (1798–1856), mecenas
Wolf Adolf August von Lüttichau (1786–1863), diretor geral do Sächsisches Hoftheater
Therese Malten (1855–1930), cantora de câmara
Johann Meyer (1800–1887), comerciante atacadista e mecenas (Johann-Meyer-Häuser em Dresden), cidadão honorário de Dresden
Hugo Nauck (1837–1894), arquiteto e engenheiro-chefe na Saxônia
Emil Naumann (1827–1888), compositor
Hermann Nicolai (1811–1881), arquiteto
Gottfried Noth (1905–1971), bispo do estado saxão
Georg von Ompteda (1863–1931), escritor
Martin Wilhelm Oppenheim (1781–1863), banqueiro
Ernst Julius Otto (1804–1877), cantor de música sacra
Paul Gustav Leander Pfund (1849–1923), fundador do "Pfunds Molkerei"
Otto Pilz (1876–1934), escultor de animais
Louis Ferdinand von Rayski (1806–1890), pintor
Alfred Recknagel (1910–1994), físico
Walter Reichardt (1903–1985), acústico
Robert Reinick (1805–1852), poeta e pintor
Carl Gottlieb Reißiger (1798–1859), compositor
Theodor Reuning (1807–1876), funcionário público
Ernst Rietschel (1804–1861), escultor
Julius Rietz (1812–1877), maestro, professor de composição e compositor
Trajan Rittershaus (1843–1899), engenheiro mecânico
Wilhelm Schaffrath  (1814–1893), jurista
Carl Schlüter (1846–1884), escultor
Johann Gottlob Schneider junior (1789–1864), organista da corte
Julius Scholtz (1825–1893), pintor
Friedrich Ernst von Schönfels (1796–1878), político
Wilhelmine Schröder-Devrient (1804–1860), cantora e atriz
Rudolf Sendig (1848–1928), hoteleiro
Friederike Serre (1800–1872), mecenas
Friedrich Anton Serre (1789–1863), major e mecenas
Charlotte Sommer-Landgraf (1928–2006), escultora e designer gráfica
Max von Stephanitz (1864–1936), primeiro padronizador da raça pastor-alemão
Friedrich Adolph August Struve (1781–1840), médico
Hermann Thüme (1858–1914), arquiteto
Christian Leberecht Vogel (1759–1816), pintor
Karl Vollmöller (1848–1922), romanista e anglicista
Theodora Elisabeth Vollmöller (1865–1934), escritora e feminista
Carl von Wagner (1843–1907), engenheiro civil
Ernst von Weber (1830–1902)
Friedrich Wieck (1785–1873), educador musical
Franz Jacob Wigard (1807–1885), professor de taquigrafia
Clemens Winkler (1838–1904), químico e descobridor do germânio
Curt Treitschke (1872–1946), oficial de estado maior e cartógrafo militar

Não preservadas são as sepulturas de:
Christian Friedrich Arnold (1823–1890), arquiteto
Friedrich Baumfelder (1836–1916), compositor, cantor de música sacra, professor de música, pianista
Johann Carl Friedrich Bouché (1850–1933), arquiteto de jardins (Gedenkstele)
Adolph Canzler (1818–1903), arquiteto
Julius Hübner (1806–1882), pintor, Professor an der Kunstakademie, Direktor der Königlichen Gemäldegalerie Dresden
Leon Pohle (1841–1908), pintor
Heinrich Gottlieb Ludwig Reichenbach (1793–1879), Zoologe und Botaniker (Gedenkstele)
Wilhelm Schaffrath (1814–1893), jurista e político
Johannes Schilling (1828–1910), escultor (trasladado para Meißen-Zscheila)
Marie Simon (1824–1877), enfermeira
Karl Eduard Vehse (1802–1870), historiador
Richard Treitschke (1811–1883), escritor alemão e professor particular

O alpinista Oscar Schuster (1873–1917) é lembrado em uma placa na Familiengrabstätte.

Bibliografia
Otto Rudert: Alte Dresdner Friedhöfe. Heinrich, Dresden 1931.
Hansjoachim Kluge: Dresdens Friedhöfe und Grabdenkmäler in der Zeit der Freiheitskriege und der Romantik. Baensch, Dresden 1937.
Klaus Petzoldt: 150 Jahre Trinitatisfriedhof zu Dresden. Leipzig 1976.
Marion Stein: Friedhöfe in Dresden. Verlag der Kunst, Dresden 2000.
Christoph Pötzsch: Schicksale auf Dresdens Trinitatisfriedhof. Tauchaer Verlag, Taucha 2005.
Sigrid Schulz-Beer: Der Trinitatisfriedhof zu Dresden. Ein Rundgang zu ausgewählten Gräbern. 2. Auflage. Saxoprint, Dresden 2007.

Ligações externas

Trinitatiskirche und Trinitatisfriedhof auf dresden-und-sachsen.de
Trinitatisfriedhof auf dresdner-stadtteile.de

Trinitatis
Cemitérios luteranos

redpajama_set_name: RedPajamaWikipedia


On Tuesday, the National Transportation Safety Board is expected to find that Tesla's semi-autonomous driving system, known as Autopilot, should partially be blamed for a 2016 fatal crash involving a Model S that slammed into the side of the truck, according to Bloomberg. The report comes after the family of Joshua Brown, the driver who was killed in the crash, released a statement that chided media coverage of the crash and said the feature isn't to blame for his death.
The decision comes at a precarious time for autonomous vehicle developers. Congress is currently debating legislation to help speed up the development of the technology behind self-driving cars, and automakers are spending billions in a race to deploy the first fully-autonomous vehicles for the public.
The NTSB's staff is going to recommend a finding that Autopilot allowed Brown to "effectively" let the car drive itself, despite Tesla's warnings and insistence that customers aren't allowed, according to Bloomberg.
Earlier Monday, Brown's family issued a statement that essentially found Tesla blameless in the incident.
Brown's death drew worldwide attention, as it was the first known fatal crash to involve a vehicle traveling on its own. A preliminary report released earlier this year by the NTSB found that Brown kept his hands on the wheel of his 2015 Model S70D for only 25 seconds of an extended 37-minute period where his car was in Autopilot at 74 mph. The vehicle gave numerous audio and visual warnings before the crash.
The Brown family took issue with the framing of the warnings Brown received, saying it falsely implied that Brown "continued to ignore these repeated reminders (and keep his hands off the wheel) until he finally struck the truck," the statement said.
It's not inconceivable that on a clear stretch of a freeway, you could operate the car in Autopilot and only be required to touch the wheel to assure the vehicle's system that you're still paying attention.
But there was ultimately some issues with the technology. Tesla CEO Elon Musk said himself that a later update to Autopilot—improving the system's ability to differentiate a truck from a sign—"very likely" would've prevented the crash.
The National Highway Traffic Safety Administration closed out a separate probe into Autopilot earlier this year, finding no defects with the feature. A class-action lawsuit filed earlier this year said Autopilot is "dangerously defective" that results in Tesla cars often "lurching, slamming on the brakes for no reason, and failing to slow or stop when approaching other vehicles." Tesla disputed the allegations and called the suit "disingenuous," "inaccurate" and "sensationalist," and an attempt to extort attorney's fees.
The full Brown family statement is below. If you're interested in following the NTSB hearing tomorrow, a webcast is being hosted here.
This fatal and tragic collision was the first documented crash involving the use of driver assist autopilot technology. It generated worldwide media attention. Unfortunately, while some of the reporting was accurate, many media outlets published or broadcast speculation about the crash which was later proven to be false. Many of those accusations were damaging to our son's reputation and a twist of the knife in the open wound of our family. Since May 7th, 2016, our family has endured reading, listening, and watching as international attention played out on this tragedy. We have intentionally remained silent because we fully believed it was critical to have all the facts before making any public judgments.


Joseph Kellman Corrporate Community School in partnership with the Kellman Family Foundation and the Steans Family Foundation offers a Technology Magnet Program and Early Children's Literacy Program (PK-3). Each students is provided a laptop in Grades 4-8 (shared in K-3). Upon graduation, Kellman students receive a laptop or tablet. Curricular tools for rigorous instruction include Reading Street (K-5), Elements of Literature (6-8) (recommended list), Envision Math (K-5) and the Connected Math Program (6-8), NGSS, FOSS Science (K-5) and "You Be the Chemist" science program for upper grades. Online tools for learning programs include: eScience (6-8), Achieve 3000 (3-8), Think Through Math ( 3-8) and MathXL (2-8). Social studies and the Fine and Performing Arts are integrated across the curriculum. Kellman also partners with I Am Able Counseling Services for SEL support, Illinois Action for Children, Turning the Page Family Center and St. Anthony Hosipital for health and wellness.
This school does not have an attendance boundary. Students must submit a Choice Elementary Schools application between October and December. Available seats, if any, are filled via computerized lottery. Priority is given to applicants with a sibling who is currently enrolled in the school in grade K-7, and who will remain enrolled in the school for the coming school year.


Glass is a form of art that people of all ages can appreciate. We are always on the lookout for glass antiques to feature in our live auction. We are interested in everything from collector's glass to French Art Décor glass. There are a great deal of popular glassmakers, and some of their work would be ideal for our specialised auctions.
Glass items and decorations are a very popular item for our specialised auctions. We welcome sellers of all types, from 19th century French art deco glass from artists such as René Lalique who was known for his glass art, perfume bottles, vases, chandeliers and more, up to local artists such as Jobling who operated on the banks of the river Tyne, where glass factories such as Jobling Glassworks were prolific. Interestingly, Jobling actually approached Lalique in Paris for an offer to collaborate but was denied, and continued to manufacture replicas of his work, being inspired to take these pieces in his own direction.
Murano glass gets its name from the island Murano, which is located in the Venetian Lagoon of northern Italy. Even in modern days, they employee the same techniques which have been refined over centuries of expertise with talented artisans and glass makers. Easily recognised for its bright colours and intricate designs, the Murano glass category covers everything from contemporary art glass to glass figurines and chandeliers made using multi-coloured glass and enamelled glass.
Monart Glass is popular for its use of colour, and usually these are distinctive large pieces made by hand. Unusual for its distinctive iridescent white decoration in the earlier pieces, which was ironically caused by an impurity with the gas supply, which had later been fixed despite its growing in popularity for this notable characteristic. Therefore, Paul Ysart found ways of reproducing this effect after WW2 to resemble Monart's original earlier pieces. Popular for a range of handmade decorative items such as flower holders and fruit bowls (the most common Monart objects) to table lamps and ceiling light bowls.
American glass maker Dale Chihuly, is a contemporary glass sculptor born 1941, known for his unique glass blowing skills, in particular large scale glass sculptures. Commended for using the traditional, yet technically difficult glass blowing techniques, Chihuly has been using these to create modern art installations and large scale environmental artwork.


text:
Home / News / Buhari To Undergo Another Penis Transplant
Buhari To Undergo Another Penis Transplant
Nine-month-old Buhari Muhammad, whose genital was cut off by his step-mother in June 2016, would undergo his next surgery, a penis transplant, when he reaches puberty.
Muhammad had his first corrective surgery at the Federal Medical Centre (FMC), Bida, Niger, in February.
Suleiman Makusidi, the Head of Medical Unit of the state Child Rights Protection Agency, made the discloure on Tuesday.
His words: "When the boy reaches puberty and when blood has started flowing through his penis, a transplant will be carried out; the transplant will be carried out either in Nigeria or abroad.
"The corrective surgery that was done in February was to reopen the hole that was created for the boy to pass urine after it was discovered that the hole was closing back.
"The urinary passage, which was created like that of the female, is a temporary one to enable him pass urine.''
"The state government is making arrangements on how to bring medical experts to examine the boy and see if the transplant can be done in Nigeria. If not, we will look at other options like South Africa or the U.S.
"We are hoping that the transplant will be successful and that it will help his reproductive system because his testicles were cut off alongside his penis; only one testicle was left," he said.
According to Makusidi, Muhammad will use his penis effectively after a successful transplant.
Muhammad's genital was cut off by his 17-year-old step mother, Bara'atu Muhammad, when the boy was barely a month old.
The incident occurred in Dafe community in Shiroro Local Government area of Niger in June 2016.
The step-mother had confessed that she took the action because she was jealous and she also wanted to get back at the victim's mother whom she claimed was always insulting her.
Buhari To Undergo Another Penis Transplant Reviewed by newsrepublique media on March 07, 2017 Rating: 5

redpajama_set_name: RedPajamaCommonCrawl


text:
Symbols of the Republic of Srpska
Public Relations Bureau
Ramiz Salkić
Josip Jerković
Excerpt from the Constitution of the Republic of Srpska
Law on the Senate
Members of the Senate
President of the Republic of Srpska attends presentation of the reconstruction project of the Republic of Srpska Museum of Contemporary Art building
The President of the Republic of Srpska Željka Cvijanović attended today the presentation of the reconstruction project of the Republic of Srpska Museum of Contemporary Art building in Banja Luka.
The President of the Republic of Srpska, who was the Prime Minister of Srpska at the time when the Government agreed to co-finance this project, said it was a major undertaking.
"The Republic of Srpska Government has allocated two-thirds of the fund and the United States allocated one-third of the fund through the Ambassador`s Fund. This is a major undertaking that will help the Museum of Contemporary Art fulfill its purpose and vision in a better way", said the President Cvijanović.
According to the President of Srpska, this project will mean a lot to Banja Luka and will contribute to cultural activities that cover the entire Srpska.
"Last year, we allocated significant funds for the reconstruction of the cultural objects across the Republic. About two million BAM was allocated to Banja Luka and we supported everything that the cultural institutions delegated as projects or needs. We will continue to work, and this makes impetus to other things", said the President Cvijanović.
The President of the Republic of Srpska thanked the US Embassy for the joint venture, stating that culture is the field where you can cooperate in the easiest way.
"I am happy because together we can leave something valuable behind us. This is a way to preserve the link between the past and the future", said the President Cvijanović.
← President of the Republic of Srpska meets with directors of public institutions, companies and funds based in Bijeljina Republic of Srpska President Meets with Delegation of Chinese City of Tianjin →
President of the Republic of Srpska sends a telegram of condolences on the occasion of the death of the Republic of Srpska Army Colonel Mile Beronja
President of the Republic of Srpska extends congratulations on the occasion of the Orthodox New Year
President of the Republic of Srpska extends congratulations on Christmas
President of the Republic of Srpska sends a telegram of condolences to the families of the tragically passed away young people in Posušje
President of the Republic of Srpska extends a congratulatory message on the occasion of Catholic Christmas
Phone: 051 – 248 – 100


text:
Make or Miss Podcast #24: Finals, Love, World Cup (with draft bonus)
Long time, no see, hear or read. Along with everyone else, I took a little time to decompress from the NBA finals, as well as throw myself into the World Cup. But good news, WOH is back with a brand new invention. Or really, just a new podcast with Rob, where we spend 90 minutes, first talking about the rumored Kevin Love deals with Golden State, (I get my Klay Thompson hate ON), break down the Spurs victory in the finals, before finishing up with some World Cup talk. We recorded pre-draft and pre USA NUMBER 1's winning-by-losing effort against Germany, so that's why it might sound dated.
The World is a Smaller Place, & They Care Very Much About Such Things
Make or Miss Podcast #18: 1st Round Wrap; 2nd Round Preview
A day late in getting this out, but Rob and I recorded our 2nd round preview Sunday night (as should be clear when I say foolish things about the Clippers potentially no-showing Game 1. Oops.) This podcast is literally earth-shaking as we unintentionally recap the first round before moving on to the games still to come. Obviously, we recorded before today's news that Mark Jackson is out in Golden State. Audio & download after the jump.
It Was Weak, Now It's Right
Make or Miss Podcast #16: Round 1, Two Games Down
Better late than never, Rob and I recorded a podcast before the start of any Game 3's on Thursday. We look far less silly, as we suggested neither Houston-Portland or Chicago-Washington were close to over. In particular, a possible Nene suspension could be a HUGE swing in that series. Indiana though...at a certain point I'm going to have to accept that Pre-ASB Pacers are dead and gone and not coming back. Audio and download after the jump:
Him Right There? He Got Edge
Make Or Miss Podcast #13 - Award Season
He picked HIM?!?
After giving Rob a week off to talk Jazz with Ben Dowsett, we're back at it for the end of the beginning. By which I mean we hand out our versions of the NBA awards. Well, I hand out versions of them and Rob cheats to fit his favored guys into the mix. He also wrote (!) about some of his picks at PPP. I take some final shots at this seasons' Timberwolves, but it's not my fault, I was goaded into it by what Rob had to say (after the jump) about Kevin Love!
We Used to Have Ourselves a Community
Make or Miss Podcast #11: Matching Up In The West
This week on the pod, Rob and I spend some time on the Pacers (note: this was recorded earlier on Thursday, so before the weekend and especially before Sunday's debacle. I'm losing some faith, but still am far more bullish on them then the general populace who seem worried about a series with either Charlotte or New York. Surprised if it went 6 against either.)
Good Churchman Always Up In Everybody's S***
Make or Miss Podcast #10: Team Scal
As we march towards the playoffs, Rob and I took on the Hot Topics of the week, first with a little bit about the last few playoff spots, including Portland and Atlanta's late season, injury-aided swoons, whether Dallas could hang on to make it or if the Suns could come out on top of that race. We then moved to a discussion of the rather bizarre intra-coaching staff feud in Golden State which saw Brian Scalabrine demoted to the D-League.
Popped Off Too Early, Stepped On Your Shot
Value of the Midrange With Time as the Enemy.
Agreeing wholeheartedly with two seemingly contradictory opinions or theories is always a difficult quandry in which to find one's self. On the one hand, it's hard to dispute Krishna's demonstration that the midrange shot is the least desirable look, especially early in the shot clock. Many of the teams with structural offensive problems (i.e. not just they have bad offensive players but are employing the players they have in silly ways) fall victim to the trap of the early midranger. Cleveland and Golden State are prime examples.
How Do You Think It Ends?
Hidden Roots of a Comeback With Damian Lillard
I've probably written more about Portland on this blog than any other team aside from perhaps the Timberwolves, and I've definitely watched more Blazers games than any other team this season. They not only have for my money the prettiest offense in the league, but also my favorite player (Nic Batum, don't think there isn't a 5,000 word opus on him coming sometime this season). And there games are almost always entertaining. But that entertainment value contains the kernel of their own downfall; Blazer games are fun because no on e can stop them, but they can't stop anyone either.
We Ain't Got The Muscle
Physicality and Late Game Defensive Prowess
As you might have heard, the Minnesota Timberwolves are 1-12 in close games, and are floundering around .500 (currently 23-24) when their Pythagorean Record (what their record "should be" based on season long point differential) is 30-17. Generally speaking, large divergence from expected W-L is mostly down to luck. Very few players and teams have consistently shown an ability to out- or under-perform this measure, though one notable exception is Dirk Nowitzki, whose game translates to late game situations better than any player in recent memory. However in the case of the Timberwolves, there is something more than bad luck at work.


The school is committed to promoting the Health and Welfare of all pupils.
We are required by law to follow procedures laid down by Suffolk Children Safeguarding Board if we see signs which suggest that one of our pupils may have been abused.
Use of the procedures in this way is an obligation placed on the school by legislation and in now way infers that the Parent / Carer is being accused of wrong-doing.
We have two Safeguarding Officers at our school. Please contact one of them if you have any concerns.
It may be helpful to parents to know that Headteachers are required to report any obvious or suspected cases of child abuse – which include non-accidental injury, severe physical neglect, emotional abuse and/or sexual abuse. This procedure is intended to protect children at risk and school are encouraged to take the attitude that where there are grounds for suspicion it is better to be safe than sorry.
This does mean that the Head of School may risk upsetting some parents by reporting a case, which on investigation proves unfounded. In such circumstances, it is hoped that parents, appreciating how difficult it is for Heads to carry out this delicate responsibility, would accept that the Head of School was acting in what were believed to be the child's best interests.
The school would like to reassure parents regarding the sensitivity of photographing children. Children may be photographed from time to time as part of normal school activity including by the local press. Any photographs taken by members of staff on trips etc. will be kept in school. The permission of the school Governors is required for any parents wishing to video school productions.
Occasionally, we may take photographs of the children/young people at our school. We may use these images in our schools prospectus or in other printed publications that we produce, as well as on our website or on project display boards at our school. We may also make video or web cam recordings for school-to-school conferences, monitoring or other educational use. Where a child's photograph is used publicly, we will never use their name alongside the photograph.
From 1 July 2015 all schools are subject to a duty under section 26 of the Counter-Terrorism and Security Act 2015, to have "due regard to the need to prevent people from being drawn into terrorism".
All teaching staff at St. Louis Academy have undertaken Prevent duty awareness training in order to identify children who may be vulnerable to radicalisation, and know what to do when they are identified.


The family-friendly Sheraton Nassau Beach Resort & Casino is offering day passes to cruise passengers. For $99, the room-inclusive day pass grants cruisers access to a standard room for two from 7 a.m. to 7 p.m., the beach, three freshwater pools, non-motorized water sports, towels and on-site restaurants and lounges. A $35 charge will apply for additional room guests. The day pass does not include motorized water sports. Food and beverages are not included for either day pass but can be purchased separately. The room-inclusive day pass includes access to high-speed Internet, LCD flat-screen televisions and the signature Sheraton Sweet Sleeper Bed.
A standard day pass is available for $25 per person, which includes access to the beach, pools, restaurants, towels and non-motorized water sports, but not a day room. Both day passes include access to kayaks, snorkeling equipment, water bikes and rafts.


1. Make a list of all the negative judgments you have towards yourself and clear them.This stuff robs you of true enjoyment of being YOU. Now take each item on your list and resolve to release it and to let it go. You can do this through journalling. You write from a place of self-compassion and self-forgiveness, making a commitment to forgiving yourself and refusing to judge and condemn yourself any longer. For instance: "I release and let go of all the suffering and guilt relating to....... (fill in the blank). I am willing to forgive myself for what happened. I did the best I could. I forgive myself and everyone else involved. I am not going to beat myself up any longer about this."


text:
\section{Introduction}
Graph theoretical models have been  used in the past decade to study the spreads of (a) disease through a population, (b) opinion through a social network, and (c) faults in a distributed computer network \cite{products:triangle, products:brief, products:dreyerroberts, products:tori, products:competition, products:np, products:consensus, products:majority}. In these models, each vertex represents a person/object that is either colored black (\emph{e.g.}, infected, holding a certain opinion, corrupted) or white (\emph{e.g.}, uninfected, not holding a certain opinion, not corrupted),  and each edge represents a relevant interaction between two people/objects.  At discrete time steps, the colors of the vertices are updated under some conversion process.  Many natural questions then arise.  For example, what is the minimum number of initially black vertices in a graph that will eventually cause all vertices to turn black? Or, given an initially black subset of vertices in a graph, how many discrete time steps will it take to turn all of its vertices black? These questions may have relevance in applications to the design of immunization and containment strategies to prevent the spread of a disease, opinion, or fault to all of the vertices in the graph.  While many other related questions can be asked, this paper focuses on the first question under two distinct conversion processes.

In an \emph{irreversible $k$-threshold conversion process}, if a white vertex has at least $k$ black neighbors at time $t-1$, it will be permanently colored black at time $t$. Irreversible $k$-threshold conversion processes have been used to model the spread of disease and opinion through social networks \cite{ products:brief, products:dreyerroberts, products:np}.  A \emph{$k$-conversion set} is a set of vertices that, when colored black at time $t=0$, will eventually cause the graph to turn completely black under an irreversible $k$-threshold conversion process.  In this paper, we consider the fundamental problem of determining exact values or upper bounds for the minimum number of vertices in $k$-conversion sets of a graph $G$. This number is denoted by $min_k(G)$. A $k$-conversion set with exactly $min_k(G)$ vertices will be called \emph{minimum $k$-conversion set}. Previously, exact values of $min_k(G)$ for all possible $k$ have been found when $G$ is a path, cycle, complete multipartite graph, or tree \cite{products:dreyerroberts}. In the same article, some exact values and upper bounds of $min_k(G)$ for certain values of $k$ have also been determined when $G$ is a rectangular, cylindrical, or toroidal square grid.

In an \emph{irreversible majority conversion process}, if at least half of the neighbors of a white vertex are black at time $t-1$, the vertex will be permanently colored black at time $t$. Although irreversible majority conversion processes may be used to model the spread of opinion through a social network, these processes are more often used to model the propagation of computer faults \cite{products:triangle, products:constant, products:monotone, products:tori, products:consensus, products:majority, products:voting, products:bounds}.  For example, in a distributed computer network, nodes communicate with each other to maintain uncorrupted copies of the same variables. These nodes may determine the state of a variable based on a majority vote of their neighbors' states of the same variable. A set of vertices that, when colored black at time $t=0$, will eventually cause the entire graph to be colored black under an irreversible majority conversion process is called a \emph{dynamic monopoly}, or \emph{dynamo} \cite{products:triangle, products:constant, products:lyuu, products:monotone, products:tori, products:bounds}. We are concerned with such sets of minimum number of vertices, called \emph{minimum dynamos}, and we let $min_D(G)$ denote the number of vertices in a minimum dynamo of a graph $G$.  Exact values of $min_D(G)$ have been found when $G$ presents certain toroidal square grid structures \cite{products:tori}, while upper bounds of $min_D(G)$ have been found when $G$ is a planar, cylindrical, or toroidal triangular grid \cite{products:triangle}.

As both of the conversion processes considered in this paper are irreversible, that is, once a white vertex is colored black it will remain permanently black, we will omit the word \emph{irreversible} and we will often use \emph{color(ed)} (resp., \emph{uncolor(ed)}) to mean \emph{color(ed) black} (resp., \emph{color(ed) white}) for brevity.  Let $S$ (resp., $D$) be a $k$-conversion set (resp., dynamo) of a graph $G$ with set of vertices $V(G)$. We will sometimes simply say \emph{initially color} $S$ (resp., $D$) to mean that all the vertices in $S$ (resp., $D$) are initially colored black at time $t=0$ and all the vertices in $V(G)-S$ (resp., $V(G)-D$) are white.  We will also say that $S$ (resp., $D$) \emph{colors} $G$ or, equivalently, that $G$ \emph{is colored by} $S$ (resp., $D$) in $T$ time steps, if when $S$ (resp., $D$) is initially colored, all the vertices in $V(G)$ become colored by time step $T$ under a $k$-threshold (resp., majority) conversion process

In Section~\ref{m}, we determine exact values of $min_k(G)$ and $min_D(G)$ when $G$ is a complete multipartite graph, building on prior work by Dreyer and Roberts \cite{products:dreyerroberts}.  In Section~\ref{cart}, we provide upper bounds of the same graph invariants when $G$ is a Cartesian products of two graphs.  Section \ref{tensor} contains analogous results for the tensor products of two graphs, and in this case, the upper bounds are shown to be tight.  Conclusions and a discussion of future work are included in Section \ref{conclude}.

\section{Exact values of $min_k(G)$ and $min_D(G)$ of complete multipartite graphs $G$}\label{m}
For $m\geq 2$, let us denote by $K_{p_1,p_2, \ldots, p_m}$ the \emph{complete multipartite graph} with $m$ partite sets with $p_1, p_2, \ldots, p_m$ vertices, respectively.  Such graphs may be useful in modeling computer networks wherein most pairs of computers are connected, however certain subsets of computers share no connections. Dreyer and Roberts~\cite{products:dreyerroberts} provided exact values of $min_k(K_{p_1,p_2, \ldots, p_m})$ through a series of related results.   Here, we provide an equivalent unified result with a straight-forward statement and a simpler proof. For the remainder of this paper, we will use the standard notation $|X|$ for the cardinality of a set $X$.

\begin{thm}
Let $G=K_{p_1,p_2,...p_m}$ be a complete multipartite graph  with $p_1+p_2+\ldots+p_m=n $ and $p_1\geq p_2 \geq \ldots \geq p_m$. Let $X$ be the set of all vertices with degree less than $k$.
Then
\[ min_k(G)=\left\{\begin{array}{ll}
max\{|X|, k\} &\textrm{if } n> k\\
n &\textrm{if }n\leq k.\\
\end{array}
\right.\]
\label{thm:kmpartite}
\end{thm}
\begin{proof}
For each $i=1,2,...,m$, let $V_i$ be the partite set of $G$ with $p_i$ vertices. Note that a vertex belongs to $X$ if and only if its entire partite set belongs to $X$. Therefore $X$ is the union of some partite sets in $G$. Since all vertices in $X$ have degree less than $k$, $X$ must be contained in any $k$-conversion set, and therefore $|X| \leq min_k(G)$. If $n\leq k$, then $X=V(G)$ and therefore $min_k(G)=n$. If $k\leq |X|$, then $X$ is a minimum $k$-conversion set since $X$ is a union of whole partite sets and therefore all the vertices in $V(G) - X$ are adjacent to the vertices in $X$ (of which there are $\geq k$), so they would become colored in time step $t=1$ if $X$ is initially colored; hence $min_k(G)=|X|$.

Finally, we examine the case where $n>k>|X|$. To show that $min_k(G)= k$ under these conditions, it suffices to exhibit a $k$-conversion set $S$ with $k$ vertices since the inequality $min_k(G)\geq k$ is obvious. Color all vertices in $X$, and in addition, color a subset of $V(G)-X$ with $k-|X|$ vertices, where this subset is chosen to contain a union of entire partite sets, along with a possibly empty proper subset of some partite set $V_j$. This set $S$ of $k$ initially black vertices is non-empty because $n-|X|>k-|X|>0$. Moreover, $S$ is a union of partite sets, except possibly for the proper subset of $V_j$ because $X$ is the union of partite sets. Every vertex in $V(G)$, except possibly for the vertices in $V_j$, will be colored by time $t=1$ since every white vertex not in $V_j$ is connected to the $|X|$ vertices in $X$ and the $k-|X|$ vertices in $S-X$, giving a total of $k$ vertices. The only possible vertices that could still be white at time $t=1$ would be in $V_j$, but these would be colored at time $t=2$. This is because the vertices in $V_j$ are connected to every vertex outside $V_j$, which are all black by time $t=1$, and since $V_j$ is not part of $X$, its vertices have degree $\geq k$.  Thus, $S$ is a $k$-conversion set of size $k$ as desired.
\end{proof}

We now extend this previous result to a majority conversion process and find $min_D(K_{p_1,p_2, \ldots, p_m})$.

\begin{thm}
 Let $G=K_{p_1,p_2, \ldots, p_m}$ be a complete multipartite graph with $p_1+p_2+\cdots+p_m=n$ and $p_1\geq p_2\geq  \ldots \geq p_m$.  Then,  $min_D(G)=\left\lceil\dfrac{n-p_1}{2}\right\rceil$.
\label{thm:mpartite}
\end{thm}
\begin{proof}
Note that the vertices in the partite set $V_i$ with $p_i$ vertices have degree $n-p_i \geq n-p_1$. So any dynamo of $G$ must have at least $\left\lceil\dfrac{n-p_1}{2}\right\rceil$ vertices, and therefore $min_D(G)\geq\left\lceil\dfrac{n-p_1}{2}\right\rceil$. To show that $min_D(G) = \left\lceil\dfrac{n-p_1}{2}\right\rceil$, it suffices to exhibit a dynamo with $\left\lceil\dfrac{n-p_1}{2}\right\rceil$ vertices. To do this, initially color a subset $D$ of $V(G)-V_1$ with $\left\lceil\dfrac{n-p_1}{2}\right\rceil$ vertices. Since the vertices in $V_1$ have $n-p_1$ neighbors, all vertices in $V_1$ will become colored at time $t=1$. Therefore, at least $p_1+\left\lceil\dfrac{n-p_1}{2}\right\rceil=\left\lceil\dfrac{n+p_1}{2}\right\rceil$ vertices will be colored by time $t=1$. At this point, since any partite set $V_i$ for $i=2,3,\ldots ,m$ has at most $p_i$ black vertices, any vertex in any $V_i$ is adjacent to at least $\left\lceil\dfrac{n+p_1}{2}\right\rceil - p_i$ black vertices; since $\left\lceil\dfrac{n-p_i}{2}\right\rceil$ vertices are required to color any vertex in $V_i$ (because a vertex in $V_i$ has $n-p_i$ neighbors), all uncolored vertices will become colored at time $t=2$ as $\left\lceil\dfrac{n+p_1}{2}\right\rceil - p_i =\left\lceil\dfrac{n+p_1-2p_i}{2}\right\rceil\geq \left\lceil\dfrac{n-p_i}{2}\right\rceil$. Hence, $D$ is a dynamo with $\left\lceil\dfrac{n-p_1}{2}\right\rceil$ vertices as desired.
\end{proof}

\section{Upper bounds of $min_k(G\square H)$ and $min_D(G\square H)$  of the Cartesian product $G\square H$ }\label{cart}
In this section, we will provide general upper bounds of $min_k(G\square H)$ and $min_D(G\square H)$ where $G\square H$ denotes the Cartesian product of two graphs $G$ and $H$. Let us first recall the definition of $G\square H$ and some related concepts.
\begin{defn}
\label{defn:Cartesian}
The \emph{Cartesian product} of two disjoint graphs $G$ and $H$ is the graph $G\square H$ such that $V(G\square H)=V(G)\times V(H)$ and two vertices $(u,u')$ and $(v,v')$ are adjacent if and only if either $u=v$ and $u'$ is adjacent to $v'$ in $H$, or $u'=v'$ and $u$ is adjacent to $v$ in $G$. For a fixed vertex $v$ in $H$, let $G_{v}$ be the subgraph of $G\square H$ induced by the vertices $(u,v)$ for every vertex $u$ in $G$; note that $G_{v}$ is isomorphic to $G$. Similarly, for a fixed vertex $u$ in $G$, let $H_{u}$ be the subgraph of $G\square H$ induced by the vertices $(u,v)$ for every vertex $v$ in $H$; note that $H_{u}$ is isomorphic to $H$.
\end{defn}

We first provide an upper bound of $min_k(G\square H)$.

\begin{thm}
Let $G$ and $H$ be two graphs. Then, $min_k(G \square H)\leq min_k(G)min_k(H)$.
\label{thm:cart_k-conv}
\end{thm}

\begin{proof}
Let $S_G$ and $S_H$ be minimum $k$-conversion sets of $G$ and $H$, respectively. Let $S$ be the set of $min_k(G)min_k(H)$ vertices $(u,v)$ in $G \square H$ where  $u\in{S_G}$ and $v\in{S_H}$. To verify the proposed upper bound, it suffices to show that $S$ is a $k$-conversion set of $G\square H$.

Initially color $S$. For a fixed vertex $u$ in $S_G$, $H_u$ contains vertices $(u,v)$ for all $v$ in $S_H$. Since these vertices are initially colored and $S_H$ is a $k$-conversion set of $H$, then all vertices in $H_u$ will eventually be colored as $H_u$ is isomorphic to $H$ and the coloration of $H$ by $S_H$ induces the coloration of $H_u$ by the set of vertices $(u,v)$ for $v$ in $S_H$.

To conclude the proof, it suffices to show that the union of all $H_u$ for $u$ in $S_G$ is also a $k$-conversion set of $G\square H$. Initially color the vertices in this union. For each $v$ in $H$, $G_v$ contains vertices $(u,v)$ for all $u$ in $S_G$. Since all the vertices in $H_u$ for $u$ in $S_G$ are colored and since $S_G$ is a $k$-conversion set of $G$, then all the vertices in $G_v$ will eventually get colored because $G_v$ is isomorphic to $G$ and the coloration of $G$ by $S_G$ induces the coloration of $G_v$ by the set of vertices $(u,v)$ for $u$ in $S_G$. Therefore, we showed that all vertices in $G\square H$ will get colored and consequently $S$ is a $k$-conversion set of $G\square H$ as desired.
\end{proof}

We will now provide the result analogous to Theorem~\ref{thm:cart_k-conv} under a majority conversion process. In what follows, given a graph $G$ and a non-empty subset $X$ of $V(G)$, we denote by $deg_G(u)$ the degree of a vertex $u$ in $G$, and define $deg_X(u)$ as the number of  neighbors of $u$ in $X$.

\begin{thm}
Let $G$ and $H$ be two graphs. Then,
\[ min_{D}(G \square H) \leq min_{D}(G)|V(H)| + min_{D}(H)|V(G)| - min_{D}(G)min_{D}(H). \]
\label{thm:Cartesian}
\end{thm}

\begin{proof}
Let $D_{G}$ and $D_{H}$ be two minimum dynamos of $G$ and $H$, respectively. Let $D$ be the set of vertices $(u,v)$ in $G\square H$ where either $u$ is in $D_{G}$ or $v$ is in $D_H$, or both. (Refer to Fig. \ref{fig:Cartesianproduct} for a concrete example).  Note that $D$ has $min_{D}(G)\left|V(H)\right| + min_{D}(H)\left|V(G)\right| - min_{D}(G)min_{D}(H)$ vertices:  $\left|V(H)\right|$ vertices $(u,v)$ for each $u$  in $D_{G}$, $\left|V(G)\right|$ vertices $(u,v)$ for each $v$  in $D_{H}$, and we must subtract $min_{D}(G)min_{D}(H)$ to account for double-counting the vertices $(u,v)$ where $u$ and $v$ are in $D_{G}$ and $D_{H}$, respectively. Furthermore, $min_D(G) {\left|V(H)\right|}+min_D(H) {\left|V(G)\right|}-min_D(G)min_D(H)$ $\geq$ $min_D(G)min_D(H)+min_D(H)min_D(G)-min_D(G)min_D(H)=min_D(G)min_D(H)> 0$, and therefore, $D\neq\emptyset$. To verify the proposed bound, it suffices to show that $D$ is a dynamo of $G\square H$.

First, we need to partition the vertices of $G\square H$ based on the coloration of $G$ by $D_G$ as follows. Suppose it takes $T$ time steps to fully color $G$ by $D_G$ and for each $t=0, 1, \ldots, T$, let $H(t)$ be the subgraph of $G\square H$ induced by the vertices $(u,v)$ where $u$ is a vertex that becomes colored at time step $t$ in $G$. Note that each $H(t)$ is the disjoint union of subgraphs $H_{u}$ (recall Definition~\ref{defn:Cartesian}) for $u$ in $H(t)$, and $H(0), H(1), \ldots, H(T)$ partitions the vertices in $G\square H$. (Refer to Fig.~\ref{fig:Gsteps} for the coloration of the individual graphs $G$, $H$, and $G\square H$ in Fig.~\ref{fig:Cartesianproduct}, and to Fig.~\ref{fig:Cartesian3} for the corresponding subgraphs $H(t)$ for $t=0, 1, \ldots, T$.)

\begin{figure}
\begin{center}
\includegraphics[width=120mm]{Cartesian.png}
\end{center}
\caption{Graphs $G$, $H$,  $G\square H$ with dynamos $D_G$, $D_H$, $D$, resp. (dynamos are colored black), where $\left| D\right| = min_D(G) {\left|V(H)\right|}+ min_D(H) {\left|V(G)\right|}- min_D(G)min_D(H)$ as constructed in the proof of Theorem~\ref{thm:Cartesian}.}
\label{fig:Cartesianproduct}
\end{figure}

Initially color $D$. We will show that all vertices in $G \square H$ will eventually be colored by proving that each $H(t)$ for $t=0, 1, \ldots, T$ will eventually become colored. We proceed by induction on $t$. As the base case, note that every vertex in $H(0)$ has its first coordinate in $D_{G}$ and consequently belongs to $D$ which is assumed to be initially colored. Now assume that all of the vertices in $H(0), H(1), \ldots, H(t-1)$ have been colored and let us show that the vertices in $H(t)$ will eventually become colored. Consider an arbitrary uncolored vertex $(u,v)$ in $H(t)$. Note that $(u,v)$ has $deg_{(G\square H)-H_u}(u,v)=deg_G(u)$ neighbors not in $H_u$ and $deg_{ H_u}(u,v)=deg_H(v)$ neighbors in $H_u$ and therefore $deg_{(G\square H)}(u,v)=deg_G(u)+deg_H(v)$. At least half of the neighbors of $(u,v)$ which are not in $H_{u}$ must be in the union of $H(i), i=0,1,\ldots , t-1$ which contains only colored vertices. Moreover, the set $(u,v')$ with $v'$ in $D_{H}$ is a dynamo of the subgraph $H_{u}$ so half of the neighbors of $(u,v)$ in this subgraph will eventually get colored similarly and at least as fast as $H$ is colored by $D_{H}$. Combining these colorations of the neighbors of $(u,v)$ in $H_{u}$ and out of $H_{u}$ we can conclude that half of all the neighbors of $(u,v)$ will eventually be colored, and consequently $(u,v)$ will become colored. Thus every vertex in $H(t)$ will be eventually colored. It now follows by induction that $D$ is a dynamo of $G \square H$  providing the desired upper bound of $min_D(G\square H)$.
\end{proof}

\begin{figure}[ht]
\centerline{\mbox{\includegraphics[width=69mm]{G-steps.png}}
\hspace{10mm}
\mbox{\includegraphics[width=51mm]{H-steps.png}}}
\includegraphics[width=150mm]{GH-steps.png}
\caption{Individual colorations of graphs $G$, $H$, $G\square H$ of Fig.~\ref{fig:Cartesianproduct} by dynamos $D_G$, $D_H$, $D$, resp.}
\label{fig:Gsteps}
\end{figure}

\begin{figure}
\begin{center}
\includegraphics[width=80mm]{Cartesian3.png}
\end{center}
\label{fig:subgraphs}
\caption{$V(G\square H)$ of Fig.~\ref{fig:Cartesianproduct} partitioned into $H(t)$, $t=0, 1, \ldots, T$ as in the proof of Theorem~\ref{thm:Cartesian}.}
\label{fig:Cartesian3}
\end{figure}

There exist graphs $G$ and $H$ so that the upper bound of $min_D(G\square H)$ provided in Theorem~\ref{thm:Cartesian} is tight. For example, if $G$ consists of $n$ isolated vertices and $H$ consists of $m$ isolated vertices, then $G\square H$ consists of $nm$ isolated vertices and the equality for the bound in Theorem~\ref{thm:Cartesian} will follow. If we require that $G$ and $H$ do not contain isolated vertices, Theorem~\ref{thm:Cartesian2} below offers a smaller upper bound of $min_D(G\square H)$. We must first prove Lemma~\ref{lem:comp} and Corollary~\ref{clry:half}.

\begin{lem}
\label{lem:comp}
Let $G$ be a graph without isolated vertices, and let $D$ be a minimal dynamo of $G$ (meaning that removing any vertex from $D$ results in a set that is no longer a dynamo). Then the set of vertices $V(G)-D$ is  a dynamo of $G$. In addition, the dynamo $V(G)-D$ colors all the vertices in $G$ by time step $t=1$.
\end{lem}
\begin{proof}
Initially color $D$. If a vertex $u$ in $D$ has $deg_D(u)\geq\dfrac{1}{2}deg_G(u)>0$ (recall that $G$ does not have isolated vertices), then $D-u$ would be a dynamo of $G$ because if all the vertices in $D-u$ were initially black and $u$ was initially white then its $deg_D(u)$ black neighbors in $D-u$ would cause $u$ to become black in the next time step. This would contradict the minimality of the dynamo $D$. Hence, $deg_D(u)<\dfrac{1}{2}deg_G(u)$ for all vertices $u$ in $D$. Note that this implies $D\neq V(G)$ since otherwise $deg_G(u)=deg_D(u)<\dfrac{1}{2}deg_G(u)$ for any $u$ in $D$, a contradiction.

Now, initially color $V(G)-D \neq \emptyset$ . Previously, we have shown that for each vertex $u$ in $D$, $deg_D(u)<\dfrac{1}{2}deg_G(u)$ which is equivalent to $deg_{V(G)-D}(u)>\dfrac{1}{2}deg_G(u)$, and therefore $u$ will be colored in the next time step. Thus, $V(G)-D$ is a dynamo of $G$ and all the vertices in $G$ become colored by time step $t=1$.
\end{proof}

\begin{clry}
\label{clry:half}
Let $G$ be a graph without isolated vertices.  Then, $min_{D}(G)\leq\dfrac{\left|V(G)\right|}{2}.$
\end{clry}
\begin{proof}
Let $D$ be a   minimum (hence minimal) dynamo of $G$. Suppose for contradiction that $min_D(G)=\left|D\right|>\dfrac{\left|V(G)\right|}{2}$. By Lemma \ref{lem:comp}, $V(G)-D \neq \emptyset$ is a dynamo of $G$ and $\left|V(G)-D\right| = \left|V(G)\right| - \left| D\right| <\left|V(G)\right| - \dfrac{\left|V(G)\right|}{2}=\dfrac{\left|V(G)\right|}{2}<\left|D\right| = min_D(G)$, contradicting the minimality of the dynamo $D$. Therefore, $min_{D}(G)\leq\dfrac{\left|V(G)\right|}{2}.$
\end{proof}

We note that the previous corollary was independently obtained by Chang and Lyuu~\cite{products:lyuu}, and also by Ackerman, Ben-Zwi and Wolfovitz~\cite{products:ack}, however our derivation is much simpler.

We are now prepared to present Theorem~\ref{thm:Cartesian2} which provides a smaller upper bound for $min_{D}(G \square H)$ than Theorem~\ref{thm:Cartesian} when  $G$ and $H$ do not contain isolated vertices.

\begin{thm}
Let $G$ and $H$ be two graphs without isolated vertices. Then,
\[  min_{D}(G \square H) \leq min_{D}(G)\left|V(H)\right| + min_{D}(H)\left|V(G)\right| - 2min_{D}(G)min_{D}(H).\]
\label{thm:Cartesian2}
\end{thm}
\begin{proof}
Let $D_{G}$ and $D_{H}$ be two minimum dynamos of $G$ and $H$, respectively, and let $D$ be the dynamo of $G\square H$ constructed in the proof of Theorem~\ref{thm:Cartesian} with $min_D(G) {\left|V(H)\right|}$+$min_D(H) {\left|V(G)\right|}-min_D(G)min_D(H)$ vertices. Let $D'$ be the set of $min_D(G)min_D(H)$ vertices $(u,v)$ in $D$ where $u$ and $v$ are in $D_{G}$ and $D_{H}$, respectively.  Using Corollary~\ref{clry:half} for $G$ and $H$, we have that
\begin{eqnarray*}
\left|D-D'\right| &=& min_D(G) {\left|V(H)\right|}+min_D(H) {\left|V(G)\right|}-2min_D(G)min_D(H) \\
&\geq& min_D(G)(2min_D(H))+min_D(H)(2min_D(G))-2min_D(G)min_D(H) \\
& =&  2 min_D(G)min_D(H) > 0,
\end{eqnarray*}
and therefore, $D-D'\neq\emptyset$. To verify the proposed bound, we will show that $D-D'$ is a dynamo of $G\square H$. Initially color $D-D'$. It then suffices to show that the vertices in $D'$ will eventually get colored since $D$ is a dynamo of $G \square H$.

Let $(u,v)$ be an arbitrary vertex in $D'$. By the definition of $D'$, we have that $u$ and $v$ are in $D_{G}$ and $D_{H}$, respectively. Note that $(u,v)$ belongs to $H_{u}$ and $G_{v}$ (recall Definition~\ref{defn:Cartesian}) and the vertices in the neighborhood of $(u,v)$ must be in exactly one of these two subgraphs, so $deg_{(G\square H)}(u,v)=deg_G(u)+deg_H(v)$.  From Lemma~\ref{lem:comp}, we have that $V(G)-D_G$ (resp., $V(H)-D_H$) is a dynamo of $G$ (resp.,  $H$)  which colors all the vertices in $G$ (resp., $H$) by time step $t=1$. This means that the vertex $u$ (resp. $v$) has at least half of its neighbors in $V(G)-D_G$ (resp., $V(H)-D_H$). Therefore the vertex $(u,v)$ has at least half of its neighbors in $D-D'$ which was initially colored and we can conclude that $(u,v)$ will become colored in the next time step. This shows that $D-D'$ is also a dynamo of $G\square H$ as desired.
\end{proof}

\section{ Tight upper bounds of $min_k(G\times H)$ and $min_D(G\times H)$  of the tensor product $G\times H$ } \label{tensor}
Recall the definition of the tensor product of two graphs.
\begin{defn}
The  \emph{tensor product} of two disjoint graphs $G$ and $H$ is the graph $G\times H$  such that $V(G\times H)=V(G)\times V(H)$ and two vertices $(u,u')$ and $(v,v')$ are adjacent if and only if $u$ is adjacent to $v$ in $G$ and $u'$ is adjacent to $v'$ in $H$.
\end{defn}
Note that each of the $i_G$ (resp., $i_H$) isolated vertices of $G$ (resp., $H$) generates $|V(H)|$ (resp., $|V(G)|$) isolated vertices in $G\times H$, and these are the only isolated vertices in $G\times H$. Thus, $G\times H$ contains $i_G|V(H)| + i_H|V(G)| - i_G i_H$ isolated vertices which must be all contained in any $k$-conversion set and dynamo of $G\times H$. We can then focus on determining upper bounds of $min_k(G\times H)$ and $min_D(G\times H)$ when $G$ and $H$ are graphs without isolated vertices and later add the number of potential isolated vertices to these bounds. We will first provide an upper bound of $min_k(G\times H)$.

\begin{thm}
Let $G$ and $H$ be two graphs without isolated vertices. Then,
\[ min_k(G \times H) \leq min\{ min_k(G)\left|V(H)\right|, min_k(H)\left|V(G)\right|\}.\]
\label{thm:ktensor}
\end{thm}
\begin{proof}
We may assume without loss of generality that $min_{k}(G)\left|V(H)\right|\leq min_{k}(H)\left|V(G)\right|$ because the tensor product is commutative.  Let $S_{G}$ be a minimum $k$-conversion set of $G$, and let $S$ be the set of $min_{k}(G)\left|V(H)\right|$ vertices $(u,v)$ in $G\times H$ where $u$ is in $S_{G}$.  To verify the proposed upper bound, it suffices to show that $S$ is a $k$-conversion set of $G\times H$.

We will first partition the vertices in $G \times H$ based on the coloration of $G$ by $S_G$. Suppose it takes $T$ time steps to fully color $G$ by $S_G$ and for each $t=0, 1, \ldots, T$, let $H(t)$ be the set of vertices $(u,v)$ where $u$ is a vertex that becomes colored at time step $t$ in $G$. The sets $H(0), H(1), \ldots, H(T)$ partition the vertices in $G\times H$.

Initially color $S$. We will show that all vertices in $G \times H$ will eventually be colored by proving that each $H(t)$ for $t=0, 1, \ldots, T$ will eventually be colored. We proceed by induction on $t$. As the base case, note that every vertex in $H(0)$ has its first coordinate in $S_{G}$ and consequently belongs to $S$ which is assumed to be initially colored. Now suppose that all of the vertices in $H(0), H(1), \ldots, H(t-1)$ have been colored and let us show that the vertices in $H(t)$ will become colored. Consider an arbitrary uncolored vertex $(u,v)$ in $H(t)$.  Note that $deg_{(G\times H)}(u,v)=deg_G(u)deg_H(v)$. Since $u$ is colored in time step $t$ in $G$ by $S_G$, at least $k$ of its $deg_G(u)$ neighbors in $G$ were black by time step $t-1$. Each one of these black neighbors in $G$ will generate $deg_H(v) > 0$ (recall that $H$ does not have isolated vertices) neighbors of $(u,v)$ in $G\times H$ in the union of $H(i)$, $i=0, 1, \ldots, t-1$ which contains only colored vertices. Therefore, at least $k$ of the $deg_G(u)deg_H(v)$ neighbors of $(u,v)$ in $G\times H$ are colored, and hence, $(u,v)$ will become colored. It now follows by induction that $S$ is a $k$-conversion set of $G \times H$ providing the desired upper bound of $min_k(G\times H)$.
\end{proof}

If in the proof of Theorem~\ref{thm:ktensor} we replace each occurrence of $min_k$, $S_G$, $S$, "$k$-conversion set", and "at least $k$" with, respectively, $min_D$, $D_G$, $D$, "dynamo," and "at least half," we obtain a proof for the analogous result under a majority conversion process stated in Theorem~\ref{thm:tensor} below. We omit the details in this proof but provide a concrete example in Fig.~\ref{fig:tensor1} to illustrate the construction of such dynamo $D$ of $G \times H$ where $V(G\times H)$ is partitioned into $H(t)$, $t=0, 1, \ldots, T$.

\begin{thm}
Let $G$ and $H$ be two graphs without isolated vertices. Then,
 \[ min_{D}(G\times H)\leq min\left\{min_{D}(G)\left|V(H)\right|,min_{D}(H)\left|V(G)\right|\right\}.\]
\label{thm:tensor}
\end{thm}

\begin{figure}
\includegraphics[width=80mm]{tensor2.png}
\caption{Graphs $G$, $H$, $G\times H$ with minimum dynamos $D_G$, $D_H$, $D$, resp. (dynamos are colored black), where $\left| D\right| = min_D(G) {\left|V(H)\right|}$ for Theorem \ref{thm:tensor}; $V(G\times H)$ partitioned into $H(t)$, $t=0, 1, \ldots, T.$}
\label{fig:tensor1}
\end{figure}

We will close this section by providing an infinite family of graphs where the upper bounds in Theorems~\ref{thm:ktensor} and \ref{thm:tensor} are tight.  We will use the \emph{bipartite double cover} of a graph $G$ which is defined as the tensor product $G\times K_2$ where $K_2$ is the complete graph on two vertices. We state without proof the following lemma due to Sampathkumar~\cite{products:doublecover} which will be instrumental in our discussion.
\begin{lem} \rm{\cite{products:doublecover}}
The bipartite double cover of any connected bipartite graph $G$ is isomorphic to the graph $2G$, that is, two disjoint copies of $G$.
\label{lem:doublecover}
\end{lem}
Lemma~\ref{lem:doublecover1}, below, easily follows from Lemma~\ref{lem:doublecover}.
\begin{lem}
Let $G$ be a connected bipartite graph. Then $min_{k}(G\times K_{2})=2min_{k}(G)$ and $min_{D}(G\times K_{2})=2min_{D}(G)$.
\label{lem:doublecover1}
\end{lem}

From Lemma~\ref{lem:doublecover1}, one can verify the equalities in Theorems~\ref{thm:ktensor}  and Theorem~\ref{thm:tensor} if  $G$ is any connected bipartite graph with at least two vertices and $H=K_2$. We leave the details to the reader.

\section{Conclusions and Future Work}\label{conclude}

In this work, we have provided exact values of $min_k(G)$ and $min_D(G)$ when $G$ is a complete multipartite graph. We have also found upper bounds of these graph invariants when $G$ is the Cartesian and tensor products of two graphs but these bounds are not always tight. A natural next step is to improve on these general upper bounds for the Cartesian and tensor products within specific families of graphs and ultimately to obtain exact values.  Our forthcoming work concerns the remaining open cases for the Cartesian and tensor products of two cycles, of two paths, and of a path and a cycle.

\section*{Acknowledgements}

The authors would like to thank Harold Jaffe and Paul Booth for their initial work on related problems and S. Luke Zinnen for his careful proof-reading.  The authors also thank the National Science Foundation (NSF) for its support thorough grant EMSW21-MCTP 0636528. Denise Sakai Troxell would also like to thank the Babson Faculty Research Fund for its support.

redpajama_set_name: RedPajamaArXiv


Home Guides	Felucca vs. riverboat: How will you discover the Nile?
Travelling Egypt without spending time on the Nile, would be like going to Italy and not seeing the Colosseum or visiting Peru and not stopping by Machu Picchu.
Having said that deciding how to tackle this mighty beast can throw up all manner of questions. For instance, when's the best time to go? How long should I spend onboard? And, most frequently, do I choose a felucca or riverboat?
To quickly address a couple of those queries, October to April is the best time to travel because it's not too hot (between 25-30°C), making temple pitstops much more pleasant. Also, on an Intrepid trip you can expect to spend a maximum of one night sleeping on a felucca, but three nights if choosing a cruise.
That detail alone should give you some indication of what you'd prefer. But, if you're still befuddled, don't worry, all will soon become clear as we help you to decipher the differences between these two river roving options.
Simply speaking, a felucca is a traditional Egyptian wooden boat with a canvas sail, but they do come in lots of different shapes and sizes. Aswan is the usual boarding point for felucca rides, although you can also hop on at Luxor. Once aboard you'll journey along the river between these two spots, but how far you travel is heavily dependent on the wind and water current.
The felucca offers some welcome shade and protection from the sun (and other elements), but there are no cabins or enclosed areas. Passengers will sleep in the open air on a communal mattress for the night. You'll be provided with a blanket, but you may wish to bring a sleeping bag during the cooler months. It's worth mentioning that these can be rented locally, so you don't need to worry about lugging one all the way from home!
Your Nubian sailing crew, which tends to be made up of two sailors and a chef, will cook all the deliciously hearty meals you'll tuck into on your trip. Get ready to gorge yourself on local delicacies like foul (an Egyptian fava bean stew), falafel, hummus, pitta bread and more.
As well as sharing a sleeping space, which also triples up as your dining and relaxing space, you'll share a bathroom with your fellow passengers. On an Intrepid trip you'll have access to a proper Western-style toilet and a shower, the only felucca on the Nile to have one! Who says travelling this way has to be basic?
1. No shoes are allowed on deck to avoid contact with your sleeping mattress, so they're left in a basket at the front of the boat when boarding.
2. Swimming is safe (and encouraged). The section of water between Aswan and Luxor is clean and taking a dip is a real highlight.
3. You can enjoy a drink onboard, although these need to be ordered in advance. Please mention this to your guide and crew ahead of departure.
4. We've been working with the same felucca provider for 15 years and Captain Jamaica (or JJ to his friends) is a core part of the Intrepid family.
If you'd rather not compromise on creature comforts, then a Nile cruise is absolutely the right route for you. These riverboats could easily be compared to boutique four or five-star floating hotels, housing 50-70 private cabins. Just like the feluccas, these vessels operate between Aswan and Luxor. However, they run on a schedule meaning you'll always spend three nights onboard.
Typically on these trips you'll get up early to explore before the heat of the day and then have the afternoon to spend at your leisure. You'll disembark the boat daily, which will give you plenty of opportunities to check out the abundant ancient sights peppering the shore. From Abu Simbel to Kom Ombo temple, you can look forward to seeing it all!
Given the capacity of these riverboats, you'll be sharing facilities with travellers who are not a part of your Intrepid tour. What a great way to meet even more like-minded people though, right? Facilities include a luxury lounge, sundeck, restaurant, rooftop pool and bar. You'll also enjoy all your meals onboard, the menus for which will feature a wide selection of mouth-watering local dishes. With some boats even able to cater for gluten and lactose-free diets.
We couldn't tie off this section without mentioning the cabins, which come fully airconditioned, beautifully decorated, with a private bathroom, colour TV, minibar and more.
1. The boat will be anchored at port each evening and only on the odd occasion would you be sailing through the night. So, you don't have to worry about missing out on the views.
2. Be sure to bring your bargaining skills, as plenty of small boats will approach trying to sell souvenirs and onshore excursions will have their fair share of local merchants too.
No matter which option you choose, you'll need to bring the following along: swimmers and a towel, sunscreen and insect repellent, a good sense of humour and excellent conversation skills.
Want to experience the best that Egypt has to offer? Check out Intrepid's diverse range of tours today!
felucca is fabulous – son and I found independent Nubian owner in – fabulous trip down river to Luxor!!!


text:
Romanian Miners Go on Strike to Protest Over Sell-Off of Coal Plants
Thousands of miners in southern Romania went on strike to demand the government cancel plans to sell off two coal power plants, fearing a new owner could close them down, officials said Thursday.
But miners' leaders pledged to end the protest later Thursday following talks with finance and economy minister Varujan Vosganian.
The strike began Wednesday, with miners refusing to leave the shafts. The protest stems from government plans to sell off the Turceni and Rovinari power plants, the largest coal-based power plants in Romania and the main buyers of coal from Romanian mines.
Protesters fear new owners of the plants would not be able to spend hundreds of millions of dollars to modernize them and bring them up to EU environmental standards, and would be forced to close them.
The government has criticized the strike as illegitimate and said the miners were being misinformed about the plans and their fears were misplaced.
Prime Minister Calin Popescu Tariceanu, who has been involved in a political battle with President Traian Basescu in recent months, suggested the strike could a political motive.
"It is regrettable that these people are manipulated by people who have other interests," he said.
Posted by Romania News Watch at 1:41 PM


May Suggestion si Senator Trillanes sa Presidente | Para sa bayan tuloy ang laban.
Kahit inaaway niyo si Senator Trillanes, binibigyan niya pa rin kayo ng payo oh.
This is a dangerous proposition that is meant to cover up Duterte's complicity or incompetence in the 11bn shabu controversy. It is also meant to project his supposed seriousness in dealing with the problem but the fact remains that those responsible for letting these shabu shipments pass are not being prosecuted.
Moreover, the AFP is an organization that is trained primarily to deal with national security threats and not to collect customs duties. This will not work. Worse, the endemic corruption at the BoC might even contaminate the AFP.
1. The government should prosecute, to the full extent of the law, the drug lords and customs officials responsible for the 6.4bn and 11bn shabu shipments, to include both Comm. Lapena and Faeldon.
2. Computerize the BoC systems for a mandatory electronic filing with automatic electronic copies furnished to CoA, counter intel units and the Ombudsman.
3. The goverment should revive the private pre-shipment inspection services.
4. The government should have multiple remote xray monitors manned by COA and counter intel units, to avoid collusion and countercheck findings of BoC personnel/xray operators.
5. Reduce customs duties (except protected goods) to discourage smuggling.
6. The government should conduct covert lifestyle checks and prosecute or dismiss erring BoC personnel.
7. Increase incentives for BoC personnel who exceed performance targets.
Ayan ha, dapat makipagbati ka na say kanya. Libre na lang daw ang consultation fee.
Ang tanong, kakasa ka ba?
Previous PostPrevious Bakit Si Atty. Chel Diokno?


Q: The default security settings of the "Default Folder".
(windows 7) I accidentally messed up the security settings in the "Default Folder" (a shortcut?) of the Users folder.
I removed administrators permissions , that caused my pc to be unable to restore to previous restore point correctly. However, I was able to re-add the admin permission and everything now is fine.
Yet I need help here.
1 could anyone post screenshots of the default "default folder" security settings? I need to set it back to the default one even though now it works fine.
2 why the hell does that folder NOT HIDDEN? Are yours not hidden as well? Of course the option to hide all system file is checked on my pc. The only reason I messed with that folder is because I thought it was just a normal folder and not a system folder. Anyway to get it back to be invisible?
Thanks for helps in advanced. And I don't want to go to Microsoft supports because they always give robotic replies with no helps at all.
Malwarebytes does not recommend checking rootkits with its default settings when scanning so I did not. Why would this be recommended or should I check it anyways? I think not. Could it be that it would require much more time to check this pesky malware and the extra time needed would not be worth it?
It should be noted that I also have Microsoft Security Essentials and Webroot Secureanywhere endpoint protectoin (webroot being a closed system managed by Click for Support) whcih may presumably be monitiring rootkits already. I am not sure? Thanks for any help!
Antirootkit technology in Malwarebytes Anti-Malware 2.0 is integrated into the scanner (under Detection Settings) in MBAM v2.0 but it is not enabled by default. If the "Scan for rootkits" setting is enabled, it will increase the length of the average scan time from previous versions which defeats the purpose of routinely using the recommended THREAT Scan to quickly check the most prevalent places for active malware....see Why is scan for rootkit off by default?Scanning for rootkits is only necessary for heavily infected systems or when malware symptoms are present but the THREAT Scan does not detect anthing.
Q: Turn off default settings??
I read in a magazine that I bought yesterday about setting your computer to none default settings. This was mentioned as a way to stop people from being able to boot into safe mood via the F8 function as an admin and gain access to the computer and all files. The article did not mention how to set up a custom setting so this can not happen. I would really like to turn of vista's default setting so this can not happen to my computers. Anybody know how to do this?? I am not sure exactly where to look for this.
Is it possible to set the defaults of the normal.dot document to automatically include a documents filename and path, page number, date, author, person who last saved the document & the details of the last time it was printed?
I think I may have just answered my own question. I just had to find the 'normal.dot' template and make the required additions to that and save. Is this the only way to do this, does anyone know?
Q: Can I change the default settings?
Can I change the default settings in PSP7 (and PS6) to JPG?
Now, I save something I have to stop and scroll down and pick JPG.
I looked in PREFERENCES and in the SAVE box and don't see anything.
I'd rather have it as JPG and if I want to use something else (GIF, or even PSP I can scroll to that). Since I mainly save as JPG.
A:Can I change the default settings?
I have noticed that my default setting in the Add/Remove Program are not staying as what I set them to be, thus I am having problems with the Windows Media Player not playing the downloads from Limewire or Ares. I have tried to rollback the system, nothing changes.
Am using Windows Live Onecare on my system as it is better than what Road Runner was offering for free (it didn't block viruses and had a mess cleaning them all out).
Any ideas, thoughts or suggestions would be greatly appreciated!!!!!
one of my children changed all of my display settings individually,IE:colors,font and size.is there any way to reset windows default display settings?
In Desktop>Properties>Appearance, if you have the XP style selected, switch to a different color scheme, click apply, then go back to the original and apply again. That should set most if not all back to default. A system restore would also work; just pick the most recent date before they changed things.
In the Envelope & Label dialog, I keep changing the default Font & Font Size to my own preference (for envelopes); & it keeps resetting back to the old settings the next time I open the app.
Also...how can I rid myself of the Office Assistant. I hide him (it...whatever) every time it pops up, but the next time I open a blank document & begin typing...here it comes again.
Next time you're in Env & Labels > Font dialog box, hit the Default button in the bottom left corner.
Try right-clicking him, Options, deselect Use the Office Assistant.
Can anyone tell me how to restore the default security settings to my c and d drives? Or maybe just post theirs. I was messing with mine and can't seem to download from any sites.
I'm the sole owner and user of my pc so I would like to be logged in as administrator at all times. Running RC 7100.
I am looking for an instructional as to help me change the color settings in Windows 7 to the default color settings in Windows XP so I can run a tool in Microsoft Excel.
sure if it wil do the trick for you, but have you tried the desktop right click - personalise, and select the Windows Basic theme?
Q: Does windows 8 have default settings?
I bought two new computers today for my business, both had the same hardware and software with windows 8 installed. I noticed that one of them they have some toolbars on the taskbar that the other one doesnt have, on one of the pc's there is an address bar labeled "Address"
A:Does windows 8 have default settings?
If they are truly identical, maybe someone turned one of them on at one point (and didn't turn the other one on).
Most computers are sold with tamper-proof tape holding the box closed - did yours have this?
In most cases, identical computers will have identical software.
The exception here is if the OEM has changed things during manufacture and is using a different image.
Not sure this is the right place for this thread, if not, sorry in advance.
What happens if you just leave it set that way? That is what I usually do on my desktop.
Q: How to Restore to Default settings?
A:How to Restore to Default settings?
I have just installed a new printer however when I go to print it wants to send a fax. So I have to manually change the setting to the printer every time I want to print.
Does anyone know how I change the default printer setting to my printer and not fax option on the printer.
Q: Reset CMD to default settings?
I need to reset my CMD to it's default settings how do I do that?
I am using Windows 7 Ultimate 32 bit..
A:Reset CMD to default settings?
Could you me more specific on what settings for cmd you want to restore to default?
If you mean the default associations for the .cmd file extension, then you can download and merge the CMD option in the tutorial below to do so.
VPU Recover has reset your graphics accelerator as it was no longer responding to graphics driver commands.
Please tell ATI technologies all about this problem.
Either there is no default mail client or the current mail client cannot fulfill the messaging request. Please run Outlook Express and set it as the default mail client.
When I go into Outlook to set the default settings I am denied this as the "Make Default! button is not highlighted.
After all of the above I hope some kind person can see me on the road to recovery!
You actually need to go into Internet Explorer, go to tools > internet options and go to the Programs tab. Select your preferred email client from the dropdown list.
I recently tried out a new .gif viewer for all of my joke email .gif's. It was kind of like a slideshow viewer. I didn't like it so I deleted it.
The problem now is that every time I go to view one of my .gif's in "My Document's" it tells me it cannot locate the program I deleted to open the .gif's. I think it may have taken over as default for my .mpg and other video files too.
I beleive that the way I used to view my .gif's was in a separate Internet Explorer window.
Is there any way I can change my settings back to the original default?
Here at the office, I received a "rolled down" Dell Optiplex 755 from a Chinese programmer. This machine is 2X as fast as my old box. The machine functions great in every way except in the printing process. For whatever reason, it thinks that all the networked and physically connected printers are defaulted to A4 sized paper. So every time I need to print a document, I have to manually change the paper size from A4 to Letter. I have gone through the registry and changed every occurrence of the "A4" to "Letter", to no avail, my system still thinks all the printers are defaulted to paper size A4.
Q: Default clock settings for i7-950?
Hi. I have a PC (5 years old now, I use it as a second machine) which has been working just fine until this week, but when I boot (into Windows 7 (x64) ) the PC soon freezes up completely, or I get a BSOD (the PC rebooted - I have changed the settings so it won't in future and will note down details). I do have one crashdump file (ntoskrnl.exe problem), but what I want to try at the moment is to return the clock settings to default. The M/B is a p6x58d-e. Googling has found lots (of course) on overclocking but all I can find is the default CPU Voltage (1.18).
The P/C has always been overclocked with no problem, giving a stable 3.8GHz. The settings I was using are below. Last week the O/C failed and in the BIOS the CPU Voltage of 1.30000V, which had been OK for years, was in purple, indicating a problem. The highest I could get the BIOS to accept was 1.20000. But I made no other changes to settings in the BIOS - maybe this is where the problem lies, changing the CPU Voltage alone?? I can enter the stock value of 1.18000V for CPU Voltage, but what else to I have to change in the following settings to return the PC to its default clock settings (DRAM Bus Voltage???). As this is not my principal PC any longer, I have no reason to overclock, if that is what is causing the problems now. (Any other suggestions as to the cause, otherwise?).
A:Default clock settings for i7-950?
Does this look like what you have ?
Because of this problem--it keeps cutting me off from OE6 with ERROR messages and I must review and correct my settings. I click DEFAULT and APPLY after I correct my settings--but constantly it goes back to the improper settings. It also disables my MSGTAG program.
How can I get them to stay fixed?
This application is the default mail handler?
If not, click on the Make Default button.
If it does, do you have any other messaging program installed?
If not, download HijackThis version 1.99 and post a log here please.
A little while ago my laptop began to have problems. The computer would turn on but when I entered in my password or did the fingerprint swipe log in, the screen would turn black and start dumping physical memory. The problems began when my battery went completely dead so I bought a new battery with no improvement. I was able to enter my desktop through Safe Mode before and after the battery replacement. I ran system diagnostics and the only problem that showed up was that my disc drive failed to read CDs and DVDs - an issue that I was aware of earlier and that I thought might be related to the power issues with the battery. Anyways, after all that, my boyfriend thought it would be best to "restore to factory settings" when I was sleeping. (he doesn't know anything about computers but for some reason thought this would help) I know I should have asked for help BEFORE all this craziness but unfortunately I didn't! Now, when we turn the computer back on the Dell loading screen appears and the loading bar fills up and the screen goes black. That's it. If I turn it off and back on it'll do the same thing all over again. When the Dell loading screen comes up, I am able to push F2 or F12 but that is it. It won't do anything when I push F8. Please, PLEASE help! How do I reboot my system or reinstall everything with an unworking disc drive?
When my boyfriend chose "return to factory settings" the computerbegan to format the drive for about 1/2 hour. He thought this was taking a bit long so he stopped it. Now I cannot access the Vista Boot Menu anymore by pressing F8.
Hello does anyone know where you can get a pdf of all the default settings for windows 7 home premium SP1.