Datasets:

ola13

/

small-the_pile

like 8

The money directly spent by consumers to purchase energy. Expenditures equal the amount of energy used by the consumer multiplied by the price per unit paid by the consumer.

Ślipcze Ślipcze is a village in the administrative district of Gmina Hrubieszów, within Hrubieszów County, Lublin Voivodeship, in eastern Poland, close to the border with Ukraine. It lies approximately south-east of Hrubieszów and south-east of the regional capital Lublin. The village has a population of 393. References Category:Villages in Hrubieszów County

This invention relates to a lottery ticket transaction system. More particularly, the present invention relates to a system and a method for selling lottery tickets using point-of-sale ("POS") terminals that generate sales receipts containing both merchandise sales information and lottery ticket information. Many states in the United States, as well as some foreign countries, have government-conducted lottery systems. Government-conducted lotteries offer the public a desirable product (usually the chance to win a large cash prize), and have the benefit of increasing governmental revenues without burdening the public with additional or increased taxes. In many instances, the revenue generated from a governmental lottery is dedicated to a particular purpose or goal, such as improving the education system or reducing property taxes. In a typical government-conducted lottery system, a central lottery computer is used to communicate with dedicated lottery terminals. A player selects numbers on a lottery playslip, and the lottery terminal operator inserts the lottery playslip into, a reader at the lottery terminal, which optically reads the lottery playslip using a known mark-sense process. The dedicated lottery terminal then communicates the player's selected numbers to a central lottery computer which in turn stores them. After the lottery numbers have been stored, the dedicated lottery terminal, under the control of the central lottery computer, prints and issues the lottery ticket. One popular lottery game, known as "lotto," typically requires the player to choose six numbers from one to forty-two. The selected group of numbers are then compared to the winning lottery numbers, which have been randomly selected from the larger pool of numbers, from one to forty-two, at some specified time and date after purchase of the lotto ticket, usually once or twice each week. To win a prize, the lotto ticket numbers must be equal to all or some of the winning lottery numbers. While players may select their own lottery numbers, most lotto games provide the option of having the central lottery computer system select random "quick-pick" lottery numbers instead. This saves the purchaser the time and inconvenience of picking his or her own numbers. These automatic lottery number generation systems are usually known as "quick-pick" systems. A variety of games may be played in a typical lottery. In conventional lottery games, a player purchases a lottery ticket. Inscribed on that lottery ticket are one or more lottery numbers and a serial number. The serial number functions as a simple method of fraud prevention, because it uniquely identifies each lottery ticket sold. The lottery number also allows both the player and the lottery system to identify a winner; specifically, the lottery numbers are compared by the player to a "winning number list", to determine if the player has won a prize. There are also instant lottery games in which the outcome is determined prior to the sale of the lottery ticket. By uncovering concealed indicia inscribed on the lottery ticket, the player can determine if the lottery ticket is a winner - immediately after purchase. Some foreign countries (e.g. Germany) allow a lottery player to purchase fractional lottery tickets. However, these lottery systems only allow the player to purchase fixed fractions of certain high-priced lottery tickets (e.g., a half, or quarter share of a lottery ticket). In these instances, if the lottery ticket is a winner, the purchaser will only receive one-half or one-quarter of the full prize amount. The majority of lottery tickets are sold by grocery, liquor and convenience stores. These retail stores typically place the dedicated lottery terminal away from one or more POS terminals used for merchandise transactions. This physical separation is to ensure that the merchandise transaction line is not slowed-down or blocked by customers wishing to make lottery ticket purchases. In addition, since the lottery terminals have a separate and distinct accounting system, there is no need to co-locate the POS terminals and dedicated lottery terminals. However, some customers may consider it annoying to make two separate transactions, i.e., merchandise and lottery tickets, on two different terminals within the same store. Separate terminals may also force the customers to wait in two separate lines, or may slow down the overall merchandise check-out procedure while a single store clerk performs two separate transactions on two terminals. Besides annoying the merchandise-only customers, these inconveniences also reduce the impulse purchasing of lottery tickets, which in turn leads to loss of revenue for the government and the store. There are other disadvantages with using two separate and distinct terminals for merchandise transactions and lottery ticket transactions. The government usually bears the costs of purchasing, leasing, installing and maintaining the dedicated lottery terminals. There are also the considerable costs of resupplying the lottery ticket paper and ink for each dedicated lottery terminal. Moreover, many retail stores with multiple checkout lines and registers, such as supermarkets, do not have the resources to support dedicated lottery terminals at every check-out register. In addition, a dedicated lottery terminal uses counter space that could otherwise be devoted to revenue-producing merchandise displays. It is also costly to train store personnel in the operation of two distinct types of transaction terminals. These factors reduce the availability of lottery tickets to consumers, and thus reduce governmental revenue, by limiting the number of locations that sell lottery tickets. After many years of steadily increasing profits, many state-run lotteries have seen a downturn in profits. Improving the ease of purchasing lottery tickets and increasing their availability has become a primary concern as many states are modernizing their lottery systems. The current lottery system does not allow for the sale of fractional value lottery tickets at retail point of sale terminals. There is a significant loss of revenue from this lost opportunity to buy fractional value lottery tickets. Accordingly, there is a need for a system that solves the above described problems.

Q: Array expression syntax error i am trying to create an array with 5 data strings in it each comprised of 3 0's and a lowercase letter. When I go to compile my code it gives me an error for that line saying expression syntax is wrong. Is there something I am missing here? the line in the code is exactly as below segment .data my_data db 000a, 000c, 000e, 000f, 000g ;skipped b,d due to use as binary and decimal notation segment .text code edit i have tried using db, dd, dw, dq to state size, none have worked. I tried noting the number of elements in the array. A: Strings are defined between quotes. Below is an array of 7 stings including "b" and "d" my_data db "000a", "000b", "000c", "000d", "000e", "000f", "000g"

100-year-old Linton Falls hydro plant producing electricity once more GRASSINGTON, England 3/26/12 (PennWell) -- A historic hydropower plant near England's Yorkshire Dales is producing electricity for the first time in more than six decades following an eight-year restoration, sources report. The Linton Falls hydropower plant, in the Yorkshire Dales in northern England, now features two Archimedean screws that can produce up to 500,000 kWh of electricity per year. The restoration was executed by JN Bentley Ltd., which says it had an added challenge given the historical nature of the facility. The plant, built in 1909, was constructed to power the village of Grassington but deemed obsolete when England's national grid came into existence in the late 1940s. The facility's disuse hadn't stopped the turbine house from being named a "scheduled monument" -- a monument considered to be of national importance by the government -- by English Heritage. The plant is owned by the Linton Falls Hydroelectric Power Company and will supply energy back to England's national grid.

ENBIS-14 in Linz The 14th Annual Conference of ENBIS took place at the Johannes Kepler Universität in Linz (Austria) from September 21st to 25th, 2014. Welcome to ENBIS-14! Dear colleagues, the 14th Annual Conference of the European Network for Business and Industrial Statistics (ENBIS-14) will take place at the Johannes Kepler Universität in Linz (Austria) from September 21st to 25th, 2014. The abstract submission and the registration are now open. Please note that pre- and post-conference courses and events are to be booked separately from the main event. The list includes:

Es war die größte kirchenkritische Demonstration, die in Deutschland je stattgefunden hat: Rund 15.000 Menschen gingen am 22. September in Berlin auf die Straße, um gegen reaktionäre Dogmen, diskriminierende Sexualpolitik und verfassungswidrige Privilegien der katholischen Kirche zu protestieren. Auch bei den beiden anderen Stationen des Papstbesuches in Erfurt und Freiburg regte sich massiver Widerstand. In den deutschen Leitmedien wurden die lautstarken Proteste jedoch, wenn überhaupt, nur am Rande erwähnt. Stattdessen feierten sie die Papstrede im Bundestag als „intellektuelles Großereignis“, obgleich Benedikt XVI. vor dem Parlament längst widerlegte Positionen aus der philosophischen Mottenkiste herauskramte, die letztlich auf eine Aufhebung säkularer Rechtsnormen hinauslaufen. „Keine Macht den Dogmen!“ lautete das Motto der Berliner Großdemonstration, zu der rund 70 Organisationen, darunter der Lesben-und-Schwulenverband Deutschland, der CSD Berlin, pro Familia und die Giordano-Bruno-Stiftung, aufgerufen hatten. Die fröhliche, bunte Demonstration führte vom Potsdamer Platz, auf der u.a. Uta Ranke-Heinemann sprach, zur Abschlusskundgebung auf dem Bebelplatz, wo David Berger („Der Schein des Heiligen“), gbs-Sprecher Michael Schmidt-Salomon und Mina Ahadi („Zentralrat der Ex-Muslime“) die Forderungen der Protestierenden auf den Punkt brachten. Besonderen Beifall erhielt Michael Schmidt-Salomon, als er die deutschen Politikerinnen und Politiker dazu aufforderte, den „falschen Respekt vor der Amtskirche abzulegen“ und „endlich den Job zu erledigen, für den sie in einer modernen, offenen Gesellschaft bezahlt werden“. Die „duckmäuserische Haltung“, die viele Politiker gegenüber dem Papst an den Tag legten, sei „eines demokratischen Rechtsstaates unwürdig“. „Unwürdig“ war – abgesehen von wenigen Ausnahmen – auch die Berichterstattung in den deutschen Medien. Im Fernsehen, im Radio, in den Printmedien wurden regelrechte Jubelarien auf den Papst angestimmt. Unterschiede zwischen Boulevard-Journalismus und Feuilleton verschwanden zunehmend – nicht nur die BILD feierte „ihren“ Papst, auch die „seriöse“ FAZ stimmte fröhlich in den frommen Jubelchor ein. Dass die FAZ ihren Bericht über die Papstrede im Bundestag mit „Missionar der Vernunft“ betitelte, bezeichnete gbs-Sprecher Michael Schmidt-Salomon als „besonders skandalös, da man davon ausgehen muss, dass die FAZ-Reporter im Unterschied zu anderen Berichterstattern verstanden haben dürften, was der Papst im Bundestag sagte“. Krasse Geschichtsverfälschung Als „krasse Geschichtsverfälschung“ wertete Schmidt-Salomon, dass der Papst vor dem Parlament behauptete, „dass die Idee der Menschenrechte und die Idee der Gleichstellung aller Menschen von der Überzeugung eines Schöpfergottes her entwickelt worden sei. Denn diese Rechte mussten von säkularen Kräften gegen den erbitterten Widerstand der kirchlichen Schöpfungsgläubigen erstritten werden. Über viele Jahrzehnte haben Päpste, Kardinäle, Bischöfe die Menschenrechte als gotteslästerliche Selbstanmaßung verdammt. Dies ist eine ebenso unbestreitbare Tatsache wie der scharfe Protest der katholischen Kirche gegen die Gleichstellung von Mann und Frau im deutschen Grundgesetz. Ich kann mir nicht vorstellen, dass FAZ-Reportern diese historischen Hintergründe völlig unbekannt sind.“ Naturrechtsidee als Basis überholter Moralvorstellungen Seriöse Journalisten sollten, so Schmidt-Salomon, auch wissen, warum Benedikt XVI. ausgerechnet das „Naturrecht“ zum zentralen Thema seiner Bundestagsrede machte: „Das Insistieren auf eine naturrechtliche Begründung von Rechtsnormen hat selbstverständlich nichts mit den Überzeugungen eines ‚grünen Papstes‘ zu tun, wie schlecht informierte Medienleute in die Welt hinausposaunten. Tatsächlich geht es hier um die vermeintliche ‚Natürlichkeit‘ beziehungsweise ‚Widernatürlichkeit‘ menschlicher Verhaltensweisen. Homosexuelle Handlungen beispielsweise gelten aus Sicht der katholischen Naturrechtslehre als ‚widernatürlich‘, da sie angeblich dem ‚göttlichen Heilsplan‘ widersprechen. Als Benedikt XVI. in seiner Rede gegen den Positivismus und für das Naturrecht argumentierte, verteidigte er damit nicht nur eine längst widerlegte philosophische Position. Letztlich rief er dazu auf, die säkularen Rechtsreformen der letzten Jahrzehnte, etwa die Legalisierung von Schwangerschaftsabbrüchen oder die Gleichstellung homosexueller Partnerschaften, rückgängig zu machen. Schließlich beruhte die Aufhebung der alten Sittlichkeitsparagraphen, die ab den 1970er Jahren eine Liberalisierungswelle in Deutschland einleitete, auf der Überwindung eben jener Naturrechtsidee, für die der Papst so energisch im Bundestag eintrat.“ Fazit des gbs-Sprechers: „Dass die überwiegende Mehrheit der Parlamentarier und medialen Berichterstatter den reaktionären, pseudointellektuellen, päpstlichen Unsinn beklatschte, verdient das Prädikat ‚Besonders peinlich!‘. Ich bin sicher, dass nur die wenigsten Parlamentarier und Journalisten die reaktionären Vorstellungen des Papstes wirklich teilen. Die meisten von ihnen dürften einfach nur zu ungebildet sein, um zu begreifen, worauf die päpstliche Verteidigung der Naturrechtsidee hinausläuft. Das wirft kein gutes Licht auf das intellektuelle Niveau der Politik und der Medien in Deutschland. Denn wer nicht einmal die durchsichtige Rhetorik des Vatikans richtig einzuschätzen vermag, dem kann man wohl kaum zutrauen, dass er schwierige politische Aufgaben, etwa die Lösung der Finanzkrise, meistert. Man kann es den Bürgerinnen und Bürgern wahrlich nicht verdenken, dass so viele von ihnen jegliches Vertrauen in die Politik verloren haben.“ Links zu diesem Artikel „Der Papst gehört nicht in den Bundestag“ (gbs-Flugblatt zum Papstbesuch): Download des PDF-Dokuments Keine Macht den Dogmen! (Video von Ricarda Hinz) Michael Schmidt-Salomon auf der Abschlusskundgebung in Berlin Benedikt XVI. am Pranger der Zivilgesellschaft hpd-Artikel zur Demo in Berlin Auch in Erfurt gab es Proteste hpd-Artikel zu den Aktionen in Erfurt "Papst" und "Hitler" in Berlin Kunstaktion zum Reichskonkordat

# Copyright 2020 Google Research. All Rights Reserved. # # Licensed under the Apache License, Version 2.0 (the "License"); # you may not use this file except in compliance with the License. # You may obtain a copy of the License at # # http://www.apache.org/licenses/LICENSE-2.0 # # Unless required by applicable law or agreed to in writing, software # distributed under the License is distributed on an "AS IS" BASIS, # WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied. # See the License for the specific language governing permissions and # limitations under the License. # ============================================================================== """Tests for tensorflow.contrib.graph_editor.""" # pylint: disable=g-direct-tensorflow-import from third_party.graph_edit.tests import match from tensorflow.python.framework import constant_op from tensorflow.python.framework import ops from tensorflow.python.ops import math_ops from tensorflow.python.platform import test class MatchTest(test.TestCase): """Match test.""" def setUp(self): """Set up.""" super().setUp() self.graph = ops.Graph() with self.graph.as_default(): self.a = constant_op.constant([1., 1.], shape=[2], name="a") with ops.name_scope("foo"): self.b = constant_op.constant([2., 2.], shape=[2], name="b") self.c = math_ops.add(self.a, self.b, name="c") self.d = constant_op.constant([3., 3.], shape=[2], name="d") with ops.name_scope("bar"): self.e = math_ops.add(self.c, self.d, name="e") self.f = math_ops.add(self.c, self.d, name="f") self.g = math_ops.add(self.c, self.a, name="g") with ops.control_dependencies([self.c.op]): self.h = math_ops.add(self.f, self.g, name="h") def test_simple_match(self): """Test simple match.""" self.assertTrue(match.OpMatcher("^.*/f$")(self.f.op)) self.assertTrue( match.OpMatcher("^.*/f$").input_ops("^.*/c$", "^.*/d$")(self.f.op)) self.assertTrue( match.OpMatcher("^.*/f$").input_ops(True, "^.*/d$")(self.f.op)) self.assertTrue( match.OpMatcher("^.*/f$").input_ops( match.op_type("Add"), match.op_type("Const"))(self.f.op)) self.assertTrue( match.OpMatcher("^.*/f$").input_ops("^.*/c$", "^.*/d$").output_ops( match.OpMatcher("^.*/h$").control_input_ops("^.*/c$"))(self.f.op)) self.assertTrue( match.OpMatcher("^.*/f$").input_ops("^.*/c$", "^.*/d$").output_ops( match.OpMatcher("^.*/h$").control_input_ops("^.*/c$").output_ops( []))(self.f.op)) if __name__ == "__main__": test.main()

A typical computer network may have a backup and recovery system for purposes of restoring data (data contained in one or multiple files, for example) on the network to a prior state should the data become corrupted, be overwritten, subject to a viral attack, etc. The backup and recovery system typically includes mass storage devices, such as magnetic tape drives and/or hard drives; and the system may include physical and/or virtual removable storage devices. For example, the backup and recovery system may store backup data on magnetic tapes, and after a transfer of backup data to a given magnetic tape, the tape may be removed from its tape drive and stored in a secure location, such as in a fireproof safe. The backup and recovery system may alternatively be a virtual tape library-based system that emulates and replaces the physical magnetic tape drive system. In this manner, with a virtual tape library-based system, virtual cartridges, instead of magnetic tapes, store the backup data.

Q: Hypothetical question of prospective pet owners This question by a prospective puppy owner got put on hold even after being cleaned up and focused on one particular aspect because it is "hypothetical" rather than "a problem the OP actually faces". While this is true, the OP doesn't have a dog, so he doesn't have a problem with it biting, I would love to encourage non-pet owners to come to this site and ask questions that help them make an informed decision about whether and what pet to get. So many problem behaviours can be avoided if people start out with the right knowledge rather than trying to correct them after they manifest. I appreciate that there is a possibility for this site to get flooded with hypothetical questions, but I'd like to believe that we can prevent that from happening by ensuring that questions are of interest to not just the OP but a wider audience. I'm confident we can come up with some requirements/benchmarks as to what constitutes a question from a non-pet owner that is on topic and useful to visitors of this site. As it stands, I don't see why a person thinking about getting a dog, and anxious about its biting behaviour, cannot ask how to teach a puppy bite inhibition. A: I agree with your stance on Hypothetical questions. I think that as long as they are squarely rooted in reality and is a situation that pet owners face, or could realistically face, the question should be allowed.

Germany’s defense minister Annegret Kramp-Karrenbauer wants European nations to contribute combat forces to an international security zone on the Syria-Turkey border, however she can give no guarantee German troops will take part. The proposal comes after Turkish troops and allied Syrian fighters invaded northern Syria earlier this month, after President Donald Trump pulled back American troops who had partnered with Syrian Kurdish forces against the Islamic State group. Annegret Kramp-Karrenbauer told German news agency dpa on Tuesday, “the creation of an internationally controlled security zone with the inclusion of Turkey and Russia” would have the goal of deescalating the situation in northern Syria. Kramp-Karrenbauer said it was outside her remit to commit German troops and the German parliament would need to decide if they could participate in such a zone. She also told broadcaster Deutsche Welle that Chancellor Angela Merkel had been informed of the proposal. Germany’s parliament, the Bundestag, must approve foreign deployments of the Bundeswehr, Germany’s military. The German government considers the Turkey led incursion to be a violation of international law, but so far has only restricted some military exports to Turkey along with other states including Spain, Sweden the United Kingdom and Canada. “We don’t believe that an attack on Kurdish units or Kurdish militia is legitimate under international law,” AFP reported Foreign Minister Heiko Maas as saying on Sunday. “If there is no basis in international law for such an invasion, then it can’t be in accordance with international law.” “Let them have their borders,” Trump said, referring to Turkey, “But I don’t think that our soldiers should be there for the next 50 years guarding a border between Turkey and Syria when we can’t guard our own borders at home.” https://t.co/j98OkNZYx3 — Breitbart News (@BreitbartNews) October 13, 2019 Kramp-Karrenbauer’s proposal could increase tensions within Merkel’s ruling coalition as the co-governing Social Democrats reject outright any direct German military involvement in Syria. Kramp-Karrenbauer defended her idea, saying she could no longer hear German politicians merely saying they were concerned about the violence in Syria without acting. Germany and its ruling parties must do more and help solve international crises, the minister said. One thing that can be assured is that the U.S. will not be joining any military security zone. Speaking last Wednesday to reporters in the Oval Office, President Trump said the conflict between Turkey and Syria is between the two Middle Eastern countries alone, as Britbart News reported. “They have a problem at the border; it’s not our border,” the president said. “If Syria wants to fight for their land, that’s up to Turkey and Syria,” he added. “Syria may have some help with Russia, and that’s fine. It’s a lot of sand. They’ve got a lot of sand over there. So there’s a lot of sand that they can play with.”

Copy a VHD from your post to Azure (and vice versa) [Exclusive Guide] being currently on mission in Azure, you should see several articles on the Microsoft cloud in the coming weeks! 🙂 – In all these articles I’m going to assume that you already have a basic knowledge and that you have already handled the Azure portal ( see the same you know sign in PowerShell ). Today, I propose to see together how connect in PowerShell to Azure then copy the VHD to one of your virtual machines to perform a backup or just to copy to better the re – use and/or duplicate so your virtual machine. We will see 2 cases: copy the VHD in Azure to your local station and vice versa . Step 1 – Connect in PowerShell to your account Azure Login-AzureRmAccount this first command will start a window in which you can identify and access in PowerShell different resources Azure. For a given account, you can have several subscribtions Azure. To see them, use the following command: Get-AzureRmSubscription for each subscribe owned, you will then have the SubscribtionID, the SubscribtionName, State, TenantId and possibly other information. You must now choose the subscription that you want to work . To do this, use the following CmdLet: replace of course with your data. In my case, I will connect to the subscription which depends on my MSDN account. It is easy to recognize because it has a name of the style: Visual Studio Premium with MSDN . Step 2 – Copy a VHD from Azure your your post as a first step, we must identify the VHD to the virtual machine that you want to archive. To do this, since the Azure portal, select your ResourceGroup and virtual machine. Click in the subsections Disks and you should see the drive hard system associated with your virtual machine. If you go a little to the right, then you will see the exact path of the VHD storage corresponding to the virtual machine. Copy-paste this link, we will need to later . Of course, we could recover information from this link with with the CmdLet Get-AzureRMVM and a few well-chosen parameters! 🙂 you can then use the following command ( with keep the same prompt PowerShell in which you are identified and selected the desired… subscribe ): Ceci will have a backup of your VHD to a local path of your workstation to achieve (libre à vous d’adapter vers un disque dur externe ou tout autre chemin de stockage bien entendu) . ” Attention, you must dispose of enough space to store all of the VHD on your workstation if not you will have an error message. After a few moments, and according to the type of Internet connection you have, you find the VHD in your folder ( indicatively fiber optic, it takes me between 10 and 20 minutes for 100 to 150 GB ). You can now open your VHD from within Windows Explorer or open it in Hyper-V to carry out any changes you may need. Step 3 – Copy a local VHD to Azure in this third step, we’re going this time to perform the reverse operation. We have prepared a VHD on our position that we want to transfer it now on Azure . The goal is to transfer it from your desktop to your container on Azure. To do this, always in your ResourceGroup , you must identify your Storage Account as well as the container in which you want to send your VHD . From the portal, proceed as shown on the picture below. Once you have located your Storage Account and container concerned. Click on it and choose top-right Properties to get the link where we will store our VHD ( in my case it is the same but I’ll show you the approach ). He is then to use the following CmdLet to send your local to Azure VHD in this container which we recovered the URL:

{% load admin_tags %} {% with ip_log=item %} <tr> <td>{{ ip_log|details_url:"ip"|safe }}</td> <td>{{ ip_log|details_url:"vm"|safe }}</td> <td>{{ ip_log|details_url:"network"|safe }}</td> <td>{{ ip_log|details_url:"user"|safe }}</td> <td>{{ ip_log.action }}</td> <td>{{ ip_log.action_date }}</td> </tr> {% endwith %}

Q: codeigniter form validation with define CONSTANT i define a constant in /application/config/abc.php define('MINI_LENGTH', 5); then in the /application/controllers/abc.php $config_form = array(array( 'field' => 'name', 'label' => 'First name', 'rules' => 'trim|required|min_length[MINI_LENGTH]'), it is not working and i got an error message : "The xxx field must be at least MINI_LENGTH characters in length." which part did i missed out or done wrongly? thanks. A: Try $config_form = array(array( 'field' => 'name', 'label' => 'First name', 'rules' => 'trim|required|min_length['.MINI_LENGTH.']'), I haven't tested it though

Q: Array editing not working correctly OK so here's my code to edit a specific entry within the array, and the array layout is below. $counter = 0; foreach($_SESSION['cart'] as $listitem){ if ($listitem[0] == $_POST['product']){ if ($listitem[1] <= $_POST['remove']){ $remove = array($listitem[0], 0); $_SESSION['cart'][$counter] = $remove; } else { $result = $listitem[1] - $_POST['remove']; $remove = array($listitem[0], $result); $_SESSION['cart'][$counter] = $remove; } } $counter = $counter++; } Here's my $_SESSION['Cart'] Array layout Array( - [0] => Array ( [0] => 8 [1] => 0 ) - [1] => Array ( [0] => 10 [1] => 0 ) - [2] => Array ( [0] => 8 [1] => 1 ) ) Either my understanding of the array is wrong with this line of code: $_SESSION['cart'][$counter] Or my counter will not count: $counter = $counter++; since the only value it keeps editing the first entry [0] Can anybody see where I've went wrong? A: $counter = $counter++ will do nothing. $counter++ increments the value of $counter, but evaluates to its current value (the one it had before incrementing). That way, you're setting $counter to have the value of itself, and that doesn't usually do much. Simply do $counter++ instead. (Additional info: there's also the pre-increment operator, ++$counter, which increments the variable and returns it new value.)

/* Copyright Oliver Kowalke 2009. Distributed under the Boost Software License, Version 1.0. (See accompanying file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt) */ /****************************************************** * * * ------------------------------------------------- * * | 0 | 1 | 2 | 3 | 4 | 5 | 6 | 7 | * * ------------------------------------------------- * * | 0 | 4 | 8 | 12 | 16 | 20 | 24 | 28 | * * ------------------------------------------------- * * | F14 | F15 | F16 | F17 | * * ------------------------------------------------- * * ------------------------------------------------- * * | 8 | 9 | 10 | 11 | 12 | 13 | 14 | 15 | * * ------------------------------------------------- * * | 32 | 36 | 40 | 44 | 48 | 52 | 56 | 60 | * * ------------------------------------------------- * * | F18 | F19 | F20 | F21 | * * ------------------------------------------------- * * ------------------------------------------------- * * | 16 | 17 | 18 | 19 | 20 | 21 | 22 | 23 | * * ------------------------------------------------- * * | 64 | 68 | 72 | 76 | 80 | 84 | 88 | 92 | * * ------------------------------------------------- * * | F22 | F23 | F24 | F25 | * * ------------------------------------------------- * * ------------------------------------------------- * * | 24 | 25 | 26 | 27 | 28 | 29 | 30 | 31 | * * ------------------------------------------------- * * | 96 | 100 | 104 | 108 | 112 | 116 | 120 | 124 | * * ------------------------------------------------- * * | F26 | F27 | F28 | F29 | * * ------------------------------------------------- * * ------------------------------------------------- * * | 32 | 33 | 34 | 35 | 36 | 37 | 38 | 39 | * * ------------------------------------------------- * * | 128 | 132 | 136 | 140 | 144 | 148 | 152 | 156 | * * ------------------------------------------------- * * | F30 | F31 | fpscr | R13 | R14 | * * ------------------------------------------------- * * ------------------------------------------------- * * | 40 | 41 | 42 | 43 | 44 | 45 | 46 | 47 | * * ------------------------------------------------- * * | 160 | 164 | 168 | 172 | 176 | 180 | 184 | 188 | * * ------------------------------------------------- * * | R15 | R16 | R17 | R18 | R19 | R20 | R21 | R22 | * * ------------------------------------------------- * * ------------------------------------------------- * * | 48 | 49 | 50 | 51 | 52 | 53 | 54 | 55 | * * ------------------------------------------------- * * | 192 | 196 | 200 | 204 | 208 | 212 | 216 | 220 | * * ------------------------------------------------- * * | R23 | R24 | R25 | R26 | R27 | R28 | R29 | R30 | * * ------------------------------------------------- * * ------------------------------------------------- * * | 56 | 57 | 58 | 59 | 60 | 61 | 62 | 63 | * * ------------------------------------------------- * * | 224 | 228 | 232 | 236 | 240 | 244 | 248 | 252 | * * ------------------------------------------------- * * | R31 |hiddn| CR | LR | PC |bchai|linkr| FCTX| * * ------------------------------------------------- * * ------------------------------------------------- * * | 64 | | * * ------------------------------------------------- * * | 256 | | * * ------------------------------------------------- * * | DATA| | * * ------------------------------------------------- * * * *******************************************************/ .text .globl _ontop_fcontext .align 2 _ontop_fcontext: # reserve space on stack subi r1, r1, 244 stfd f14, 0(r1) # save F14 stfd f15, 8(r1) # save F15 stfd f16, 16(r1) # save F16 stfd f17, 24(r1) # save F17 stfd f18, 32(r1) # save F18 stfd f19, 40(r1) # save F19 stfd f20, 48(r1) # save F20 stfd f21, 56(r1) # save F21 stfd f22, 64(r1) # save F22 stfd f23, 72(r1) # save F23 stfd f24, 80(r1) # save F24 stfd f25, 88(r1) # save F25 stfd f26, 96(r1) # save F26 stfd f27, 104(r1) # save F27 stfd f28, 112(r1) # save F28 stfd f29, 120(r1) # save F29 stfd f30, 128(r1) # save F30 stfd f31, 136(r1) # save F31 mffs f0 # load FPSCR stfd f0, 144(r1) # save FPSCR stw r13, 152(r1) # save R13 stw r14, 156(r1) # save R14 stw r15, 160(r1) # save R15 stw r16, 164(r1) # save R16 stw r17, 168(r1) # save R17 stw r18, 172(r1) # save R18 stw r19, 176(r1) # save R19 stw r20, 180(r1) # save R20 stw r21, 184(r1) # save R21 stw r22, 188(r1) # save R22 stw r23, 192(r1) # save R23 stw r24, 196(r1) # save R24 stw r25, 200(r1) # save R25 stw r26, 204(r1) # save R26 stw r27, 208(r1) # save R27 stw r28, 212(r1) # save R28 stw r29, 216(r1) # save R29 stw r30, 220(r1) # save R30 stw r31, 224(r1) # save R31 stw r3, 228(r1) # save hidden # save CR mfcr r0 stw r0, 232(r1) # save LR mflr r0 stw r0, 236(r1) # save LR as PC stw r0, 240(r1) # store RSP (pointing to context-data) in R7 mr r7, r1 # restore RSP (pointing to context-data) from R4 mr r1, r4 lfd f14, 0(r1) # restore F14 lfd f15, 8(r1) # restore F15 lfd f16, 16(r1) # restore F16 lfd f17, 24(r1) # restore F17 lfd f18, 32(r1) # restore F18 lfd f19, 40(r1) # restore F19 lfd f20, 48(r1) # restore F20 lfd f21, 56(r1) # restore F21 lfd f22, 64(r1) # restore F22 lfd f23, 72(r1) # restore F23 lfd f24, 80(r1) # restore F24 lfd f25, 88(r1) # restore F25 lfd f26, 96(r1) # restore F26 lfd f27, 104(r1) # restore F27 lfd f28, 112(r1) # restore F28 lfd f29, 120(r1) # restore F29 lfd f30, 128(r1) # restore F30 lfd f31, 136(r1) # restore F31 lfd f0, 144(r1) # load FPSCR mtfsf 0xff, f0 # restore FPSCR lwz r13, 152(r1) # restore R13 lwz r14, 156(r1) # restore R14 lwz r15, 160(r1) # restore R15 lwz r16, 164(r1) # restore R16 lwz r17, 168(r1) # restore R17 lwz r18, 172(r1) # restore R18 lwz r19, 176(r1) # restore R19 lwz r20, 180(r1) # restore R20 lwz r21, 184(r1) # restore R21 lwz r22, 188(r1) # restore R22 lwz r23, 192(r1) # restore R23 lwz r24, 196(r1) # restore R24 lwz r25, 200(r1) # restore R25 lwz r26, 204(r1) # restore R26 lwz r27, 208(r1) # restore R27 lwz r28, 212(r1) # restore R28 lwz r29, 216(r1) # restore R29 lwz r30, 220(r1) # restore R30 lwz r31, 224(r1) # restore R31 lwz r4, 228(r1) # restore hidden # restore CR lwz r0, 232(r1) mtcr r0 # restore LR lwz r0, 236(r1) mtlr r0 # ignore PC # adjust stack addi r1, r1, 244 # return transfer_t stw r7, 0(r4) stw r5, 4(r4) # restore CTR mtctr r6 # jump to ontop-function bctr

The present invention relates to the control of gene expression. More particularly, this invention relates to the use of synthetic oligonucleotides to down-regulate the expression of a gene in an animal. The potential for the development of an antisense oligonucleotide therapeutic approach was first suggested in three articles published in 1977 and 1978. Paterson et al. (Proc. Natl. Acad. Sci. (USA) (1977) 74:4370-4374) discloses that cell-free translation of mRNA can be inhibited by the binding of an oligonucleotide complementary to the mRNA. Zamecnik et al. (Proc. Natl. Acad. Sci. (USA) (1978) 75:280-284 and 285-288) discloses that a 13 mer synthetic oligonucleotide that is complementary to a part of the Rous sarcoma virus (RSV) genome inhibits RSV replication in infected chicken fibroblasts and inhibits RSV-mediated transformation of primary chick fibroblasts into malignant sarcoma cells. These early indications that synthetic oligonucleotides can be used to inhibit virus propagation and neoplasia have been followed by the use of synthetic oligonucleotides to inhibit a wide variety of viruses, such as HIV (see, e.g., U.S. Pat. No. 4,806,463); influenza (see, e.g., Leiter et al. (1990) (Proc. Natl. Acad. Sci. (USA) 87:3430-3434); vesicular stomatitis virus (see, e.g., Agris et al. (1986) Biochem. 25:6268-6275); herpes simplex (see, e.g., Gao et al. (1990) Antimicrob. Agents Chem. 34:808-812); SV40 (see, e.g., Birg et al. (1990) (Nucleic Acids Res. 18:2901-2908); and human papilloma virus (see, e.g., Storey et al. (1991) (Nucleic Acids Res. 19:4109-4114). The use of synthetic oligonucleotides and their analogs as anti-viral agents has recently been extensively reviewed by Agrawal (Trends in Biotech. (1992) 10:152-158). In addition, synthetic oligonucleotides have been used to inhibit a variety of non-viral pathogens, as well as to selectively inhibit the expression of certain cellular genes. Thus, the utility of synthetic oligonucleotides as agents to inhibit virus propagation, propagation of non-viral, pathogens and selective expression of cellular genes has been well established. Improved oligonucleotides have more recently been developed that have greater efficacy in inhibiting such viruses, pathogens and selective gene expression. Some of these oligonucleotides having modifications in their internucleotide linkages have been shown to be more effective than their unmodified counterparts. For example, Agrawal et al. (Proc. Natl. Acad. Sci. (USA) (1988) 85:7079-7083) teaches that oligonucleotide phosphorothioates and certain oligonucleotide phosphoramidates are more effective at inhibiting HIV-1 than conventional phosphodiester-linked oligodeoxynucleotides. Agrawal et al. (Proc. Natl. Acad. Sci. (USA) (1989) 86:7790-7794) discloses the advantage of oligonucleotide phosphorothioates in inhibiting HIV-1 in early and chronically infected cells. In addition, chimeric oligonucleotides having more than one type of internucleotide linkage within the oligonucleotide have been developed. Pederson et al. (U.S. Pat. Nos. 5,149,797 and 5,220,007 discloses chimeric oligonucleotides having an oligonucleotide phosphodiester or oligonucleotide phosphorothioate core sequence flanked by nucleotide methylphosphonates or phosphoramidates. Furdon et al. (Nucleic Acids Res. (1989) 17:9193-9204) discloses chimeric oligonucleotides having regions of oligonucleotide phosphodiesters in addition to either oligonucleotide phosphorothioate or methylphosphonate regions. Quartin et al. (Nucleic Acids Res. (1989) 17:7523-7562) discloses chimeric oligonucleotides having regions of oligonucleotide phosphodiesters and oligonucleotide methylphosphonates. Inoue et al. (FEBS Lett. (1987) 215:237-250) discloses chimeric oligonucleotides having regions of deoxyribonucleotides and 2'-O-methyl-ribonucleotides. Many of these modified oligonucleotides have contributed to improving the potential efficacy of the antisense oligonucleotide therapeutic approach. However, certain deficiencies remain in the known oligonucleotides, and these deficiencies can limit the effectiveness of such oligonucleotides as therapeutic agents. For example, Wickstrom (J. Biochem. Biophys. Meth. (1986) 13:97-102) teaches that oligonucleotide phosphodiesters are susceptible to nuclease-mediated degradation, thereby limiting their bioavailability in vivo. Agrawal et al. (Proc. Natl. Acad. Sci. (USA) (1990) 87:1401-1405) teaches that oligonucleotide phosphoramidates or methylphosphonates when hybridized to RNA do not activate RNase H, the activation of which can be important to the function of antisense oligonucleotides. Thus, a need for methods of controlling gene expression exists which uses oligonucleotides with improved therapeutic characteristics. Several reports have been published on the development of phosphorothioate-linked oligonucleotides as potential anti-AIDS therapeutic agents. Although extensive studies on chemical and molecular mechanisms of oligonucleotides have demonstrated the potential value of this novel therapeutic strategy, little is known about the pharmacokinetics and metabolism of these compounds in vivo. Recently, several preliminary studies on this topic have been published. Agrawal et al. (Proc. Natl. Acad. Sci. (USA) (1991) 88:7595-7599) describes the intravenously and intraperitoneally administration to mice of a 20-mer phosphorothioate linked-oligonucleotide. In this study, approximately 30% of the administered dose was excreted in the urine over the first 24 hours with accumulation preferentially in the liver and kidney. Plasma half-lives ranged from about 1 hour t.sub.1/2.alpha.) and 40 hours (t.sub.1/2.beta.), respectively. Similar results have been reported in subsequent studies (Iversen (1991) Anti-Cancer Drug Design 6:531-538; Iverson (1994) Antisense Res. Devel. 4:43-52; and Sands (1994) Mol. Pharm. 45:932-943). However, stability problems may exist when oligonucleotides are administered intravenously and intraperitoneally. Thus, there remains a need to develop more effective therapeutic methods of down-regulating the expression of genes which can be easily manipulated to fit the animal and condition to be treated, and the gene to be targeted. Preferably, these methods should be simple, painless, and precise in effecting the target gene.

Fifteen-year survival of anterior all-ceramic cantilever resin-bonded fixed dental prostheses. The aim of this follow-up study was to report the long-term outcome of all-ceramic cantilever resin-bonded fixed dental prostheses (RBFDPs). In 16 patients (mean age of 33.3±17.5years) 22 RBFDPs made from a glass-infiltrated alumina ceramic (In-Ceram) were inserted with a phosphate monomer containing luting agent after air-abrasion of the retainer wings. The abutment preparation included a shallow groove on the cingulum and a small proximal box. The restorations replacing 16 maxillary and 6 mandibular incisors were followed over a mean observation time of 188.7 months. No restoration debonded. Two RBFDPs fractured and were lost 48 and 214 months after insertion, respectively. The 10-year and 15-year survival rates were both 95.4% and dropped to 81.8% after 18 years. Anterior all-ceramic cantilever RBFDPs exhibited an excellent clinical longevity.

Antiproliferative actions of growth hormone-releasing hormone antagonists on MiaPaCa-2 human pancreatic cancer cells involve cAMP independent pathways. We evaluated the effects of GHRH antagonists on the proliferation of MiaPaCa-2 human pancreatic cancer cells and cAMP signaling in vitro. GHRH antagonists inhibited the proliferation of MiaPaCa-2 cells in vitro in a dose-dependent way and caused a significant elevation in cAMP production. In a superfusion system, short-term exposure of the cells to GHRH antagonists evoked an acute, dose-dependent release of cAMP into the medium. Native GHRH, which stimulates cAMP efflux from pituitary at nanomolar doses, did not influence cAMP release from cultured or superfused MiaPaCa-2 cells even at 10-30 microM. VIP, PACAP, secretin and glucagon also did not influence cell proliferation or cAMP production. Adenylate cyclase activator forskolin (FSK) caused a greater cAMP response, but a smaller antiproliferative effect than GHRH antagonists. Combined treatment with FSK and GHRH antagonist JV-1-38 potentiated the cAMP-inducing effect of FSK, but did not produce a greater inhibition of cell proliferation than JV-1-38 alone. A selective accumulation of radiolabeled GHRH antagonist [(125)I]JV-1-42 in vivo in MiaPaCa-2 carcinoma xenografted into nude mice was also observed. In conclusion, second messengers other than cAMP participate in the signal transduction pathways of GHRH analogs mediated by tumoral GHRH receptors.

Die Bitcoin war angedacht, das gesamte etablierte Finanzsystem auszuhebeln und die Menschheit ein Stück weit unabhängig von den Banken und Regierungsapparaten zu machen. Anonym, unreguliert und im Rahmen eines dezentralen peer-to-peer-Systems hat die erfolgreichste Kryptowährung das Potential, die gesamte Finanzindustrie zum Erliegen zu bringen. Denn je stärker sich das Netzwerk durchsetzt, umso redundanter werden Banker und Broker als Mittelspersonen von Transaktionen (" Traditioneller Finanzindustrie droht 'totale Zerstörung' - Bitcoin auf dem Vormarsch "). 2015 war die Bitcoin noch 200 Euro wert, heute kostet sie über 600 Euro. In Zeiten heftiger Börsenturbulenzen erhoffen sich immer mehr Anleger satte Gewinne von der Digitalwährung. Vor allem ein Land ist von der Bitcoin besessen. Und das, obwohl sie dort verboten ist. Umso heftiger dürften ebenjene Akteure zittern, sollte die derzeitige Bitcoin-Hausse nur der Beginn eines aufkeimenden Hypes sein. Wie das "Wall Street Journal" berichtet, stieg der Wert der digitalen Währung allein am letzten Wochenende über 21 Prozent. Mehr als 600 Euro ist eine Münze nun wert, eine Verdreifachung im Vergleich zum Vorjahr. Mit 130.000 Transaktionen pro Tag ist die Bitcoin damit laut "Standard" die erfolgreichste Kryptowährung. Schaltjahr im Bitcoin-Handel Und es könnte sogar noch weiter bergauf gehen. Denn nun steht quasi der Schalttag in der Bitcoin-Community bevor, genauer gesagt, das sogenannte "Halving". Dieses Ereignis findet alle vier Jahre statt, beziehungsweise immer dann, wenn insgesamt 210.000 Bitcoin-Blöcke im Schöpfungsprozess generiert wurden. Für die Erschaffung neuer Bitcoins erhalten die Erzeuger (oder auch "Miner"), die dafür ihre Rechenleistung zur Verfügung stellen, eine Vergütung - ebenfalls in Form von Bitcoins. Damit die maximal festgelegte Geldmenge von 21 Millionen Bitcoins nicht zu schnell erreicht wird, halbiert sich der Mining-Ertrag bei jedem Halving. Zu Beginn, im Jahr 2009, erhielt ein Miner pro Bitcoin-Block noch 50 Bitcoins, aktuell sind es 25. Am 10. Juli wird das nächste Halving erwartet. Für viele Miner, bei denen es sich mittlerweile um professionelle und mehrere Millionen Dollar schwere Unternehmen handelt, steht damit deren gesamte Existenz auf dem Spiel. Erst im Mai musste das in Schweden ansässige Bitcoin-Mining-Unternehmen KnCMiner Konkurs anmelden. Verbotene Versuchung in China Für Anleger könnte die Deckelung der Bitcoin-Menge jedoch einen hübschen Gleichgewichtseffekt von Angebot und Nachfrage mit sich bringen. Und auch die anhaltend hohe Nachfrage aus China könnte den Preis noch weiter in die Höhe katapultieren. Nachdem der Yuan infolge des Börsencrashs zu Beginn des Jahres immer weiter abgewertet wurde, flüchtet sich die Bevölkerung zunehmend in den digitalen Ersatz. Unglaubliche 85 Prozent des gesamten Bitcoin-Handels wurden zuletzt in Yuan abgewickelt, nur 12 Prozent lauteten dagegen auf US-Dollar. Vier der fünf größten Mining-Unternehmen sitzen heute in China. Die Ironie dahinter: Vor zwei Jahren hatte die chinesische Zentralbank den Handel mit der Internetwährung verboten. Der Glaube der Chinesen an die Fähigkeit zur Werterhaltung übersteigt jedoch offenbar die Angst, erwischt zu werden. Teilweise wird die Kryptowährung sogar mit einer Investition in Gold gleichgesetzt. Radoslav Albrecht, Vorstandssprecher vom Bundesverband Bitcoin, mahnt hier jedoch zur Vorsicht. Er glaubt nicht, dass Bitcoin als Ersatz für Gold diene. „Anleger sehen den Bitcoin als Spekulationsobjekt, mit dem sie Gewinne erwirtschaften wollen“, erklärte Albrecht. Ein Fehler, wie er findet. Seiner Meinung nach eignet sich die Kryptowährung aufgrund der Kursschwankungen nicht als Anlageform. Insofern empfinde er die Warnung der chinesischen Zentralbank als gerechtfertigt, so Albrecht. Tatsächlich aber könnte der Kurs der Digitalwährung von der chinesischen Zockerei profitieren.

Some organizations may install database servers in several locations that are geographically diverse from each other. For example, a corporation may set up two database servers in two locations (such as New York City and Los Angeles) so that they operate in an autonomous and load-balanced way in a normal situation, but, in case a disaster (such as earthquakes, hurricanes, or terrorist attacks) causes one server to fail, the other server can quickly take over and keep critical functions and services, some of which might have been previously supported by the failed server, uninterrupted. Typically, under such a multi-location scheme, a database server at a location has its own storage subsystem; direct access to such a storage subsystem is not shared with database servers at other locations; and only logical access to data stored in the storage subsystem is allowed to the database servers at the other locations. To provide logical access to data stored in the storage subsystem, copies of files or tables may be provided by the database server that owns the storage subsystem to the database servers in the other locations using file transfer protocols. In addition to being highly inefficient, these techniques dictate uses of disparate methods to access local and remote data, respectively. As a result, a database server must use disparate calls, APIs and logic flows in handling accesses to the local data and remote data, thereby resulting in much programmatic complexity. Under some other techniques, a local data storage device may be explicitly exported by its hosting operating system to a remote node that hosts a remote database server. For example, a hard disk that is directly attached to a hosting UNIX system may be explicitly exported by the hosting UNIX system. A remote node that has an appropriate communication link with the hosting UNIX system may mount the exported hard disk on the remote node, using an NFS protocol, thereby enabling remote access to the exported hard disk. However, there may be no direct link between a system that hosts local data storage devices and a remote node. For example, where a Network Attached Storage (NAS) system is used, a local database server that controls direct access to the NAS system may not be the same system as the NAS system itself. The NAS system that hosts the data storage devices may not have any communication link with the remote database server that enables the NFS protocol. Or, for any such reasons as site security, the NAS system may not be configured for exporting through external protocols such as the NFS protocol to any other database servers except the one directly attached. Therefore, a better mechanism, which would better support network data transfer in distributed database systems, is needed.

mkdir -p $PREFIX/bin ./configure --disable-debugging make # cmfinder.pl requires env-var CMfinder be set to bin parent dir mv bin/cmfinder.pl bin/_cmfinder.pl echo 'export CMfinder='$PREFIX > bin/cmfinder.pl echo '_cmfinder.pl "$@"' >> bin/cmfinder.pl chmod +x bin/cmfinder.pl cp bin/* $PREFIX/bin/

74 Ophiuchi 74 Ophiuchi is a suspected binary star in the equatorial constellation of Ophiuchus, near the border with Serpens Cauda. It is visible to the naked eye as a faint, yellow-hued point of light with a combined apparent visual magnitude of 4.85. The system is located at a distance of 238 light years from the Sun based on parallax, and is drifting further away with a radial velocity of +4.4 km/s. The primary member, designated component A, is an aging giant star with a stellar classification of G8III and an estimated age of 1.73 billion years. Having exhausted the hydrogen supply at its core, the star has expanded to 10.5 times the Sun's radius. It is a red clump giant, which means it is on the horizontal branch and is generating energy through helium fusion at its core. The star has 2.4 times the mass of the Sun and is radiating 66 times the Sun's luminosity from its swollen photosphere at an effective temperature of around 5,073 K. The magnitude 11.5 secondary, component B, lies at an angular separation of from the primary, as of 2008. A visual companion, component C, is magnitude 12.28 and has a separation of . References Category:G-type giants Category:Horizontal-branch stars Category:Binary stars Category:Ophiuchus (constellation) BD+03 3680 Ophiuchi, 74 168656 089918 6866

Use of a modified fluorescent in situ hybridization procedure to improve the identification of Streptococcus pneumoniae in blood cultures. Streptococcus pneumoniae is an important causative agent for bacteremia. Fluorescent in situ hybridization (FISH) is a helpful molecular technique for the rapid identification of S. pneumoniae in positive blood cultures. There are many reports concerning the application of an enzymatic treatment with lysozyme in the FISH procedure for partial cell wall digestion of S. pneumoniae. However, this study was aimed to test the FISH procedure without enzymatic treatment for the identification of S. pneumoniae in blood culture specimens. Seventy-seven positive blood culture specimens containing Gram-positive cocci were examined by both the conventional laboratory methods and FISH. Detection of S. pneumoniae was performed by two FISH procedures: one procedure was performed with an enzymatic treatment step and the other one was done without enzymatic treatment. In addition, the specimens were tested by the FISH procedure with enzymatic treatment to detect Streptococcus pyogenes and Enterococcus. The specificity of FISH in comparison with conventional culture methods was 100%. The sensitivity of the FISH procedure with enzymatic treatment for the detection of S. pneumoniae was 90%, whereas, the sensitivity of the FISH procedure without enzymatic treatment was 100%. In fact, by omission of enzymatic treatment, detection of S. pneumoniae was improved in 6 specimens. The results of the FISH and culture methods for the detection of S. pyogenes and Enterococcus were compatible. Altogether, FISH procedure without enzymatic treatment step seems to improve the detection of S. pneumoniae in some cases. Thus, for successful detection of S. pneumoniae, we suggest the application of both FISH procedures (the procedure with enzymatic treatment and the procedure without enzymatic treatment) for each blood culture specimen.

This month’s movie is The Muppets Take Manhattan. The movie is rated G and will be shown in the Cynthia Klinck Community Room. Popcorn and snacks will be provided. Participants are welcome to bring bean bag chairs or pillows. This is open to all age groups. For more information, call Amy Allgeier at 937-433-8091, ext. 3. Amazing animals event set for April 26 Full STEAM Ahead: Amazing Animals will be held from 10 to 11 a.m. April 26 at Centerville Library, 111 W. Spring Valley Road. This story time explores sorting and organizing, basic geometry, the scientific method and animal recognition. Animal illustrations and matching games will be available for kids and parents to enjoy together. This program is geared to children 3-5 years old. Registration is required. For more information, call Amy Allgeier at 937-433-8091, ext. 3. KETTERING Mother, son rodeo scheduled A mother/son rodeo roundup will be held from 6-8 p.m. April 29 at the Lathrem Senior Center, 2900 Glengarry Drive. Mothers, grandmothers or a special woman in a little boy’s life are invited to the festivities. The evening will include dinner, a root beer float, and cowboy games and activities. This event is geared toward children ages 5-10 years old. The cost is $15 for residents and $20 for nonresidents. Each additional person is $5. For more information, call 937-296-2587. OAKWOOD Engaging Arts program open all weekend Engaging arts will be available from 6:30 p.m. April 21 to 5 p.m. April 23 at Wright Memorial Public Library, 1776 Far Hills Ave. The Youth Services coloring table will be turned into an art studio one weekend per month. A book and visual thinking strategy guide will be featured. Participants will receive an art packet at the Youth Services desk, and all materials are provided. For more information, call 937-294-7171. Thank you for reading the Dayton Daily News and for supporting local journalism. Subscribers: log in for access to exclusive deals and newsletters. Thank you for supporting in-depth local journalism with your subscription to the Dayton Daily News. Get more news when you want it with email newsletters just for subscribers. Sign up here.

Q: Network configuration: Preventing my computer being used as a proxy? I recently installed an extension for Chrome called Hola (skip to next paragraph if you know it). It calls itself a VPN, but is basically a proxy pool AFAIK. You can choose a country from a list in a per website basis and your connection to that website comes from an IP from the selected country from there onwards. Meanwhile, you serve as a proxy for other users. I tried using it at my uni but it was stuck at "initializing", and after a few tests (different browsers, different computers) I could only conclude that it was being blocked somehow. Which made me wonder: My computer is in a vulnerable position if it can be used by others as a proxy, possibly without my knowledge. So I was wondering which aspect of my network I need to configure in order to avoid this kind of thing. I am currently using this script to generate my firewall rules (iptables): # Flush all rules iptables -F iptables -X # Allow unlimited traffic on localhost (breaks MPI programs otherwise) iptables -A INPUT -i lo -j ACCEPT iptables -A OUTPUT -o lo -j ACCEPT iptables -A FORWARD -o lo -j ACCEPT # Allow SSH traffic iptables -A INPUT -p tcp --dport 22 -m state --state NEW,ESTABLISHED -j ACCEPT # Allow incomming traffic from estabilished and related connections iptables -A INPUT -m state --state ESTABLISHED,RELATED -j ACCEPT # Policy: Allow outgoing, deny incoming and forwarding iptables -P OUTPUT ACCEPT iptables -P INPUT DROP iptables -P FORWARD DROP I imagined the drop policy in "forward" would be enough, but it doesn't seem so. Is there anything I can do at the firewall level to block things like Hola? If not, what should I be doing? A: Your question of why the forward rule doesn't work is essentially a networking question, so I'll explain using an analogy. Imagine there are three people involved in the sending of a letter - Alice, Bob, and you. Alice wants to get a message to Bob, but using you as a middleman (proxy). Alice could use one of two techniques: Method 1: Write a letter containing the message, stick it in an envelope, and address the envelope to Bob. However, instead of giving the envelope directly to Bob, she drops it off on your doorstep. She hopes you'll be kind enough to find it, recognize that the envelope isn't addressed to you, and find Bob to give it to him. Method 2: Write a letter, to you, that says: "Can you find Bob and tell him [message]?" Stick the letter in an envelope, and address the envelope to you. You (or perhaps the Hola app running on your computer) open the envelope, read the letter, and tell Bob the message. Firewalls are rather dumb, in that they can only understand basic information like Source IP, Destination IP, port, and some other bits of metadata. They can't actually understand the contents of the packets. It's analogous to only being able to look at the outside of the envelope, without being able to read the letter inside. So even though both of the above methods would result in the same outcome (in essence, Alice getting a message to Bob using you as a proxy), the forward chain only recognizes the first one as forwarding. As far as the firewall is concerned, in the second case Alice and you are the only parties involved in the conversation. It has no idea of Bob's involvement, as it would need to "read" the letter to know that. As far as blocking Hola, it seems that Hola traffic can be detected, but you'll need a tool that can "read the letter," so to speak, by performing deep packet inspection and application layer filtering. Usually this is accomplished using an intrusion detection system as opposed to a basic firewall, and I suspect it's how your uni is blocking Hola. If you don't want your computer used as a proxy, your best bet would be to just not use Hola.

<?php // +-----------------------------------------------------------------------+ // | This file is part of Piwigo. | // | | // | For copyright and license information, please view the COPYING.txt | // | file that was distributed with this source code. | // +-----------------------------------------------------------------------+ $lang['Database name'] = 'Databasenamn'; $lang['Note you can change your configuration by yourself and restart Piwigo after that.'] = 'Du kan endre konfigurasjonen sjølv og ta omstart på Piwigo etterpå.'; $lang['You may referer to your hosting provider\'s support and see how you could switch to PHP 5 by yourself.'] = 'Du bør sjekke med dei som leverar nett-tenaren om korleis du kan byte til PHP5.2'; $lang['also given by your host provider'] = 'er og levera av den som leverar nett-tenaren'; $lang['database tables names will be prefixed with it (enables you to manage better your tables)'] = 'namna på databasetabellane vil verta prefiksa med dette (gjev deg mogleghet til å handtere databasetabellane betre)'; $lang['enter a login for webmaster'] = 'skriv inn brukarnamn for webmaster'; $lang['please enter your password again'] = 'skriv inn passord ei gong til'; $lang['user login given by your host provider'] = 'brukarnamn du har fått av den som har nett-tenaren'; $lang['user password given by your host provider'] = 'passord du har fått av den som har nett-tenaren'; $lang['verification'] = 'sjekk'; $lang['webmaster login can\'t contain characters \' or "'] = 'brukarnamn for webmaster kan ikkje innehalde tegna \' eller "'; $lang['Don\'t hesitate to consult our forums for any help : %s'] = 'Ikkje vent med å sjå på foruma våre for hjelp: %s'; $lang['PHP 5 is required'] = 'PHP5.2 er påkrevd'; $lang['Password ']['confirm'] = 'Passord [stadfest]'; $lang['Piwigo may try to switch your configuration to PHP 5 by creating or modifying a .htaccess file.'] = 'Piwigo kan prøve å byte din konfigurasjon til PHP5.2 ved å lage eller endre fila .htaccess.'; $lang['Piwigo was not able to configure PHP 5.'] = 'Piwigo greidde ikkje å konfigurere PHP5.2'; $lang['Sorry!'] = 'Orsak!'; $lang['Start Install'] = 'Start installasjon'; $lang['Try to configure PHP 5'] = 'Prøv å konfigurere PHP5.2'; $lang['User'] = 'Brukar'; $lang['Visitors will be able to contact site administrator with this mail'] = 'Dei som vitjar nettsida kan bruke denne e-postadressa for å kontakte administrator for nettsida'; $lang['Welcome to my photo gallery'] = 'Velkomen til mitt biletgalleri'; $lang['Welcome to your new installation of Piwigo!'] = 'Velkomen til din nye installasjon av Piwigo!'; $lang['You can download the config file and upload it to local/config directory of your installation.'] = 'Du kan laste ned konfigurasjonsfila og laste den opp til "local/config" katalogen i din installasjon.'; $lang['Admin configuration'] = 'Administratorkonfigurasjone'; $lang['An alternate solution is to copy the text in the box above and paste it into the file "local/config/database.inc.php" (Warning : database.inc.php must only contain what is in the textarea, no line return or space character)'] = 'Ein alternativ løysing er å kopiere teksten i boksen over og lime den inn i fila "local/config/database.inc.php" (Åtvaring: "database.inc.php" kan bare innehalde det som er i tekstfeltet, ikkje lineskift eller mellomrom)'; $lang['Basic configuration'] = 'Grunnleggande konfigurasjon'; $lang['Can\'t connect to server'] = 'Kan ikkje kople til tenar'; $lang['Congratulations, Piwigo installation is completed'] = 'Gratulere, installasjon av Piwigo er ferdig'; $lang['Connection to server succeed, but it was impossible to connect to database'] = 'Kopling til tenar er vellukka, men tilkopling til databasen var ikkje mogleg.'; $lang['Creation of config file local/config/database.inc.php failed.'] = 'Oppretting av konfigurasjonsfila "local/config/database.inc.php" feila.'; $lang['Database configuration'] = 'Databasekonfigurasjon'; $lang['Database table prefix'] = 'Prefiks for databasetabellar'; $lang['Default gallery language'] = 'Standard språk for galleriet'; $lang['Download the config file'] = 'Last ned konfigurasjonsfil'; $lang['Hope to see you back soon.'] = 'Håpar å sjå deg att snart.'; $lang['Host'] = 'Tenar'; $lang['Installation'] = 'Installasjon'; $lang['It appears your webhost is currently running PHP %s.'] = 'Det verkar som nettenaren køyrer PHP %s.'; $lang['It will be shown to the visitors. It is necessary for website administration'] = 'Den vil bli vist til dei som vitjar galleriet. Den er naudsynt for administrasjon av nettsida'; $lang['Just another Piwigo gallery'] = 'Enda eit Piwigo galleri'; $lang['Keep it confidential, it enables you to access administration panel'] = 'Hald dette hemmeleg, det gjev deg tilgang til administrasjonspanelet'; $lang['Need help ? Ask your question on <a href="%s">Piwigo message board</a>.'] = 'Treng du hjelp? Still spørsmålet ditt på <a href="%s"> Piwigo sitt forum</a>.'; $lang['localhost or other, supplied by your host provider'] = 'localhost eller servernamn gjeve av administrator for server';

--- abstract: 'We develop a quantum circuit model describing unitary interactions between quantum fields and a uniformly accelerated object, and apply it to a semi-transparent mirror which uniformly accelerates in the Minkowski vacuum. The reflection coefficient $R_{\omega}$ of the mirror varies between 0 and 1, representing a generalization of the perfect mirror ($R_{\omega}=1$) discussed extensively in the literature. Our method is non-perturbative, not requiring $R_{\omega} \sim 0$. We use the circuit model to calculate the radiation from an eternally accelerated mirror and obtain a finite particle flux along the past horizon provided an appropriate low frequency regularization is introduced. More importantly, it is straightforward to see from our formalism that the radiation is squeezed. The squeezing is closely related to cutting the correlation across the horizon, which therefore may have important implications to the formation of a black hole firewall.' author: - 'Daiqin Su$^{1}$' - 'C. T. Marco Ho$^{1}$' - 'Robert B. Mann$^{1,2,3}$' - 'Timothy C. Ralph$^{1}$' title: Quantum Circuit Model for a Uniformly Accelerated Mirror --- Introduction ============ It has been well known since the 1970s that a moving mirror can radiate particles [@Moore70; @Fulling76]. A perfect moving mirror acts as a moving boundary and thus changes the states, especially the vacuum, of the quantum fields. For an appropriately chosen accelerated trajectory the radiation flux is thermal, and an analogy [@Davies77; @Walker85; @Carlitz87] can be drawn with Hawking radiation from a collapsing star [@Hawking75] that eventually forms a black hole. Since the thermal fluxes are correlated with the final vacuum fluctuations, some authors [@Wilczek93; @Hotta15] have proposed that the emission of the large amounts of information left in the black hole need not be accompanied by the eventual emission of a large amount of energy, providing a new perspective to the solution of the black hole information paradox [@Hawking76]. The trajectory of a uniformly accelerated mirror is of particular interest. When the mirror is uniformly accelerating, its trajectory is a hyperbola in spacetime, and both the energy flux and particle flux are zero [@Fulling76; @Davies77; @Birrell82; @Grove86]. Particles and energy are only radiated when the acceleration of the mirror changes. In the case that the mirror eternally accelerates, the energy flux along the horizon is divergent [@Frolov79; @Frolov80; @Frolov99]. This divergence is evidently related to the ideal assumption that the mirror accelerates for infinitely long time. One way to get rid of the divergence is to turn on and off the mirror so that effectively it interacts with the fields for a finite time [@Obadia01; @Obadia03; @Parentani03]. In this paper, we develop a quantum circuit model to describe unitary interactions between quantum fields and a uniformly accelerated object (such as a mirror, cavity, squeezer [*etc.*]{}). Our circuit model can be considered a further development of the matrix formalism first proposed by Obadia and Parentani [@Obadia01] to describe a mirror following general trajectories. We concentrate on a uniformly accelerated object because the transformations between Minkowski modes, Rindler modes and Unruh modes are well known [@Unruh76; @Takagi86; @Crispino08] and can be represented by some simple quantum optical elements, like two-mode squeezers, beamsplitters [*etc.*]{} As an application of our circuit model, we revisit the uniformly accelerated mirror problem in $(1+1)$-dimensional Minkowski spacetime. Unlike the self-interaction model proposed by Obadia and Parentani [@Obadia01], which requires a perturbative expansion and is valid only for low reflection coefficients, our circuit model is non-pertubative insofar as it is valid for any value of the reflection coefficient. For the eternally accelerated mirror, the radiation flux in a localized wave packet mode is divergent. We can regularize this infrared divergence by introducing a low-frequency cutoff for the mirror, which means the mirror is transparent for the low-frequency field modes (to some extent, this is physically equivalent to having the mirror interact with the field for a finite period of time). After infrared regularization the particle number in a localized wave packet mode is finite. We further study the properties of the radiation flux and find that the radiation field is squeezed. This squeezing effect has gone unnoticed up to now, but in our circuit model it is a very straightforward result. We show that the generation of squeezing is closely related to cutting the correlations across the horizon. This mechanism of transferring correlations to squeezing may have important implications for black hole firewalls [@AMPS; @Braunstein13], as we shall subsequently discuss. Our paper is organized as follows. In Sec. \[RindlerUnruh\], we briefly review the relations between Rindler modes and Unruh modes. Motivated from these transformations, we introduce our circuit model in Sec. \[circuit\] and calculate the radiation flux from an eternally accelerated mirror in Sec. \[radiation\]. In Sec. \[squeezing\], we show that the radiation field from the accelerated mirror is squeezed and the squeezing is related to the correlations across the horizon. In Sec. \[firewall\], we propose that a Rindler firewall can be generated by a uniformly accelerated mirror and we conjecture that a black hole firewall could be squeezed. We conclude in Sec. \[conclusion\]. In this paper, we take the unit $\hbar = c =1$. Rindler modes and Unruh modes {#RindlerUnruh} ============================= In this section we describe the relations between Rindler modes and Unruh modes, which act as the foundation of our quantum circuit model. We begin with a brief review of the three ways of quantizing a massless scalar field $\hat{\Phi}$ in $(1+1)$-dimensional Minkowski spacetime (for comprehensive reviews, see [@Takagi86; @Crispino08]). A massless scalar field $\hat{\Phi}$ satisfies the Klein-Gordon equation $\Box \hat{\Phi} = 0$, where the d’ Alembertian $\Box \equiv (\sqrt{-g})^{-1} \partial_{\mu} [\sqrt{-g}g^{\mu\nu} \partial_{\nu}]$ and $g_{\mu\nu}$ is the metric of the spacetime [@Birrell82]. In the inertial frame, Minkowski coordinates $(t, x)$ are used and the metric $g_{\mu\nu} = \eta_{\mu\nu} = \text{diag}\{-1, +1\}$. The scalar field $\hat{\Phi}$ can be quantized in the standard way, $$\label{MinkowskiMode} \hat{\Phi} = \int d k \big(\hat{a}_{1k} u_{1k} + \hat{a}_{2k} u_{2k} + \text{h.c.} \big),$$ where h.c. represents Hermitian conjugate, $u_{1k}~(u_{2k})$ are single-frequency left-moving (right-moving) mode functions $$u_{1k}(V) = (4 \pi k)^{-1/2} e^{-i k V}, \,\,\,\,\,\, u_{2k}(U) =(4 \pi k)^{-1/2} e^{-i k U},$$ with $V = t+x, U = t-x$. $\hat{a}_{1k}(\hat{a}_{2k})$, $\hat{a}_{1k}^{\dag} (\hat{a}_{2k}^{\dag} )$ are the corresponding annihilation and creation operators satisfying the bosonic commutation relations $$\begin{aligned} [\hat{a}_{mk}, \hat{a}_{nk'}^{\dag}] = \delta_{mn} \delta({k-k'}), \,\,\, [\hat{a}_{mk}, \hat{a}_{nk'}] = [\hat{a}_{mk}^{\dag}, \hat{a}_{nk'}^{\dag}] = 0, \nonumber\end{aligned}$$ with $m,n = 1,2$. The Minkowski vacuum state $| 0_M \rangle$ is defined as $\hat{a}_{mk} | 0_M \rangle = 0$. ![Four wedges of $(1+1)$-dimensional Minkowski spacetime: $R, L, F$ and $P$. The right Rindler wedge ($R$) is causally disconnected to the left Rindler wedge ($L$). The Rindler coordinates $(\tau, \xi)$ only cover the $R$ wedge and $(\bar{\tau}, \bar{\xi})$ only cover the $L$ wedge. []{data-label="RindlerFrame"}](f1.png){width="8.0cm"} As shown in Fig. \[RindlerFrame\], Minkowski spacetime can be divided into four wedges: $R, L, F$ and $P$. We introduce Rindler coordinates $(\tau, \xi)$ in the $R$ wedge and $(\bar{\tau}, \bar{\xi})$ in the $L$ wedge, $$\begin{aligned} t &=& a^{-1} e^{a \xi} \sinh(a \tau), \,\,\, x = a^{-1} e^{a \xi} \cosh(a \tau), \nonumber \\ t &=& -a^{-1} e^{a \bar{\xi}} \sinh(a \bar{\tau}), \,\,\, x = - a^{-1} e^{a \bar{\xi}} \cosh(a \bar{\tau}),\end{aligned}$$ where $\tau$ is the proper time of the uniformly accelerated observer with proper acceleration $a$ in the $R$ wedge. The metric is $g_{\mu\nu} = e^{2 a \xi} \text{diag}\{- 1, +1 \}$ in $R$ and is $g_{\mu\nu} = e^{2 a \bar{\xi}} \text{diag}\{- 1, +1 \}$ in $L$. It is obvious that the vector field $\partial_{\tau}~(\text{or}~ \partial_{\bar{\tau}})$ is the timelike Killing vector field of the spacetime [@Birrell82]. In the Rindler frame, the scalar field $\hat{\Phi}$ can be quantized as [@Fulling73; @Unruh76] $$\begin{aligned} \hat{\Phi} = \int d \omega (\hat{b}_{1\omega}^R g_{1\omega}^R + \hat{b}_{1\omega}^L g_{1\omega}^L + \hat{b}_{2\omega}^R g_{2\omega}^R + \hat{b}_{2\omega}^L g_{2\omega}^L + \text{h.c.} ) $$ where the superscripts $``R"$ and $``L"$ represent modes and operators in the $R$ and $L$ wedge, respectively. The modes $g_{m\omega}^R~(g_{m\omega}^L)$ only have support in the $R$ ($L$) wedge, $$g^R_{1\omega}(v) = (4 \pi \omega)^{-1/2} e^{-i \omega v}, \,\,\, g^R_{2\omega}(u) = (4 \pi \omega)^{-1/2} e^{-i \omega u},$$ where $v = \tau + \xi$, $u = \tau - \xi$, and by replacing $v, u$ by $\bar{v} = - \bar{\tau} - \bar{\xi}$ and $\bar{u} = - \bar{\tau} + \bar{\xi}$ we obtain modes in the $L$ wedge. Note that we have used the prescription that $\partial_{\bar{\tau}}$ is past-directed. The commutation relations of the operators are $$\begin{aligned} [\hat{b}_{m\omega}^R, \hat{b}_{n\omega'}^{R\dag} ] = \delta_{mn} \delta({\omega-\omega'}), \,\,\,\, [\hat{b}_{m\omega}^L, \hat{b}_{n\omega'}^{L\dag} ] = \delta_{mn} \delta({\omega-\omega'}), \end{aligned}$$ with all others vanishing. The Rindler vacuum state $| 0_R \rangle$ is defined as $\hat{b}_{m\omega}^R | 0_R \rangle = \hat{b}_{m\omega}^L | 0_R \rangle =0$. It proves useful to introduce Unruh modes (instead of Minkowski modes) that cover the whole Minkowski spacetime for two reasons: 1) the Unruh and Minkowski modes share the same vacuum; 2) the transformation between Rindler modes and Unruh modes is a two-mode squeezing transformation. The Unruh modes are defined as $$\begin{aligned} \label{UnruhRindler} \hat{c}_{m\omega} &=& \text{cosh}(r_{\omega}) \hat{b}_{m\omega}^R - \text{sinh}(r_{\omega}) \hat{b}_{m\omega}^{L\dag}, \nonumber \\ \hat{d}_{m\omega} &=& \text{cosh}(r_{\omega}) \hat{b}_{m\omega}^L - \text{sinh}(r_{\omega}) \hat{b}_{m\omega}^{R\dag},\end{aligned}$$ where $r_{\omega}$ satisfies $\text{tanh}(r_{\omega}) = e^{-\pi \omega/a}$. It is easy to find the inverse transformation, $$\begin{aligned} \label{UnruhRindler:inverse} \hat{b}_{m\omega}^R &=& \text{cosh}(r_{\omega}) \hat{c}_{m\omega} + \text{sinh}(r_{\omega}) \hat{d}_{m\omega}^{\dag}, \nonumber\\ \hat{b}_{m\omega}^L &=& \text{cosh}(r_{\omega}) \hat{d}_{m\omega} + \text{sinh}(r_{\omega}) \hat{c}_{m\omega}^{\dag}. \end{aligned}$$ We can see that the Rindler modes $(\hat{b}_{m\omega}^R, \hat{b}_{m\omega}^L)$ and Unruh modes $(\hat{c}_{m\omega}, \hat{d}_{m\omega} )$ are related by a two-mode squeezing operator with a frequency dependent squeezing parameter $r_{\omega}$. In terms of Unruh modes, the scalar field $\hat{\Phi}$ can be expressed as $$\begin{aligned} \label{UnruhMode} \hat{\Phi} &=& \int d \omega (\hat{c}_{1\omega} G_{1\omega} + \hat{d}_{1\omega} \bar{G}_{1\omega} \nonumber \\&&\qquad\qquad + \hat{c}_{2\omega} G_{2\omega} + \hat{d}_{2\omega} \bar{G}_{2\omega} + \text{h.c.} )\end{aligned}$$ where $$\begin{aligned} \label{Unruhmodes} G_{1\omega}(V) &=& F(\omega, a) (aV)^{-i \omega/a}, \nonumber\\ \bar{G}_{1\omega}(V) &=& F(\omega, a) (-aV)^{i \omega/a}, \nonumber\\ G_{2\omega}(U) &=& F(\omega, a) (-aU)^{i \omega/a}, \nonumber\\ \bar{G}_{2\omega}(U) &=& F(\omega, a) (aU)^{-i \omega/a},\end{aligned}$$ with $F(\omega, a) \equiv \frac{e^{\pi \omega/2a}}{\sqrt{4\pi \omega} \sqrt{2\sinh(\pi \omega/a)}}$. $G_{1\omega}(V)$ and $\bar{G}_{2\omega}(U)$ are analytic in the lower-half complex plane while $\bar{G}_{1\omega}(V)$ and $G_{2\omega}(U)$ are analytic in the upper-half complex plane. The Unruh modes annihilate the Minkowski vacuum state $$\begin{aligned} \hat{c}_{m\omega} | 0_M \rangle = \hat{d}_{m\omega} | 0_M \rangle = 0\end{aligned}$$ as noted above. Circuit model {#circuit} ============= General formalism ----------------- How are the states of a quantum field affected by an object (such as a beamsplitter) that is uniformly accelerated in the $R$ wedge? This is the question of central interest in this paper. A straightforward way to study this problem is to work in the accelerated frame in which the object is static. It is obvious that the object only interacts with Rindler modes in the $R$ wedge and the Rindler modes in the $L$ wedge remain unaffected. The interaction between the object and the Rindler modes is unitary and it transforms the Rindler modes as $$\label{generalcoupling} \hat{b}_{mk}^{\prime R} = \int d \omega \bigg( \alpha^{m1}_{k \omega} \hat{b}_{1\omega}^R + \beta^{m1}_{k \omega} \hat{b}_{1\omega}^{R \dagger} + \alpha^{m2}_{k \omega} \hat{b}_{2 \omega}^R + \beta^{m2}_{k \omega} \hat{b}_{2\omega}^{R \dagger} \bigg). \\$$ This is the most general interaction which not only couples the left-moving and right-moving Rindler modes but also Rindler modes with different frequencies. Together with Eqs. (\[UnruhRindler\]) and (\[UnruhRindler:inverse\]), we can construct a quantum circuit model (or input-output formalism) for the uniformly accelerated object. We start from the inertial frame in which Unruh modes are used instead of Minkowski modes. This makes the model simpler although we still have to transform the Minkowski modes to the Unruh modes and vice versa. First, based on Eq. (\[UnruhRindler:inverse\]), the Unruh modes pass through a collection of two-mode squeezers each of which couples a pair of Unruh modes $(\hat{c}_{m\omega}, \hat{d}_{m\omega} )$ with frequency dependent squeezing parameter $r_{\omega}$. Second, the output right Rindler modes $\hat{b}_{m\omega}^R $ interact with the object and are transformed to $\hat{b}_{mk}^{\prime R}$ according to Eq. (\[generalcoupling\]) while the left Rindler modes $\hat{b}_{m\omega}^L$ remain unchanged. Finally, based on Eq. (\[UnruhRindler\]), the Rindler modes pass through a collection of two-mode antisqueezers and are transformed to output Unruh modes $(\hat{c}^{\prime}_{m\omega}, \hat{d}^{\prime}_{m\omega} )$. If we use an inertial detector to detect the radiation field from the accelerated object, we have to transform the Unruh modes $(\hat{c}^{\prime}_{m\omega}, \hat{d}^{\prime}_{m\omega} )$ to Minkowski modes to model the coupling with the detector. In the special case that the interaction does not couple Rindler modes with different frequencies, the input-output formalism is substantially simplified. The coefficients $\alpha^{mn}_{k \omega}$ and $\beta^{mn}_{k \omega}$ are now proportional to $\delta(k - \omega)$ so Eq. (\[generalcoupling\]) becomes $$\label{nomixingfrequency} \hat{b}_{m\omega}^{\prime R} = \alpha^{m1}_{\omega \omega} \hat{b}_{1\omega}^R + \beta^{m1}_{\omega \omega} \hat{b}_{1\omega}^{R \dagger} + \alpha^{m2}_{\omega \omega} \hat{b}_{2 \omega}^R + \beta^{m2}_{\omega \omega} \hat{b}_{2\omega}^{R \dagger}.$$ Since modes with different frequencies are independent, we can propose a quantum circuit model for each single frequency. The quantum circuit is shown in Fig. \[circuit:Fig\]. A pair of left-moving Unruh modes $(\hat{c}_{1\omega}, \hat{d}_{1\omega})$ and a pair of right-moving Unruh modes $(\hat{c}_{2\omega}, \hat{d}_{2\omega})$ pass through the two-mode squeezers $S_{\omega}$, from which emerge left-moving Rindler modes $(\hat{b}_{1\omega}^R, \hat{b}_{1\omega}^L)$ and right-moving Rindler modes $(\hat{b}_{2\omega}^R, \hat{b}_{2\omega}^L)$, respectively. $\hat{b}_{1\omega}^R$ and $\hat{b}_{2\omega}^R$ interact with each other when passing through the object (symbolized by the black dot in Fig. \[circuit:Fig\]) and emerge as $\hat{b}_{1\omega}^{\prime R}$ and $\hat{b}_{2\omega}^{\prime R}$, which can be described by a unitary transformation $U_{\omega}$ according to Eq. (\[nomixingfrequency\]). After that, the Rindler modes are combined by two-mode antisqueezers $S^{-1}_{\omega}$, ending up with Unruh modes again. ![(color online). Unruh modes pass through the squeezers and then become Rindler modes. The Rindler modes in the right Rindler wedge interact with the object ($U_{\omega}$) and then combine with the Rindler modes from the left Rindler wedge in the antisqueezers, going back to Unruh modes again. []{data-label="circuit:Fig"}](f2.png){width="8.0cm"} For computational purposes, we introduce operator vectors $\hat{\bf c}_{\omega}$, $\hat{\bf d}_{\omega}$, $\hat{\bf b}_{\omega}^R$ and $\hat{\bf b}_{\omega}^L$, which are defined as $$\begin{aligned} \hat{\bf c}_{\omega} = {\hat{c}_{\omega} \choose \hat{c}_{\omega}^{\dag}}, \,\,\,\, \hat{\bf d}_{\omega} = {\hat{d}_{\omega} \choose \hat{d}_{\omega}^{\dag}}, \,\,\,\, \hat{\bf b}_{\omega}^R = {\hat{b}_{\omega}^R \choose \hat{b}_{\omega}^{R\dag}},\,\,\,\, \hat{\bf b}_{\omega}^L = {\hat{b}_{\omega}^L \choose \hat{b}_{\omega}^{L\dag}}.\end{aligned}$$ Then Eqs. (\[UnruhRindler\]) and (\[UnruhRindler:inverse\]) can be rewritten as $$\begin{aligned} {\hat{\bf c}_{m\omega} \choose \hat{\bf d}_{m\omega}} = S^{-1}_{\omega} {\hat{\bf b}_{m\omega}^R \choose \hat{\bf b}_{m\omega}^L}, \,\,\,\,\,\, {\hat{\bf b}_{m\omega}^R \choose \hat{\bf b}_{m\omega}^L} =S_{\omega}{\hat{\bf c}_{m\omega} \choose \hat{\bf d}_{m\omega}},\end{aligned}$$ with $$\begin{aligned} S_{\omega} \equiv \left({I \text{cosh}(r_{\omega}) \atop \sigma_x \text{sinh}(r_{\omega})}{ \sigma_x \text{sinh}(r_{\omega}) \atop I \text{cosh}(r_{\omega})}\right)\end{aligned}$$ where $I = \left({1 \atop 0}{0 \atop 1} \right)$ is the identity matrix and $\sigma_x = \left({0 \atop 1}{1 \atop 0} \right)$ is one of the Pauli matrices. The transformation between the input Unruh modes $(\hat{\bf c}_{1\omega}, \hat{\bf d}_{1\omega}, \hat{\bf c}_{2\omega}, \hat{\bf d}_{2\omega})^T$ and the output Unruh modes $(\hat{\bf c}^{\prime}_{1\omega} \hat{\bf d}^{\prime}_{1\omega}, \hat{\bf c}^{\prime}_{2\omega}, \hat{\bf d}^{\prime}_{2\omega})^T$ can be represented as $$\begin{aligned} \label{input-output} \begin{pmatrix} \hat{\bf c}^{\prime}_{1\omega} \\ \hat{\bf d}^{\prime}_{1\omega} \\ \hat{\bf c}^{\prime}_{2\omega} \\ \hat{\bf d}^{\prime}_{2\omega} \end{pmatrix} =\mathcal{S}^{-1}_{\omega} \mathcal{U}_{\omega} \mathcal{S}_{\omega} \begin{pmatrix} \hat{\bf c}_{1\omega} \\ \hat{\bf d}_{1\omega} \\ \hat{\bf c}_{2\omega} \\ \hat{\bf d}_{2\omega} \end{pmatrix}.\end{aligned}$$ $\mathcal{S}_{\omega}$ characterizes the transformation from Unruh modes to Rindler modes $$\begin{aligned} \mathcal{S}_{\omega} = \left({S_{\omega} \atop 0}{ 0 \atop S_{\omega}}\right)\end{aligned}$$ and $\mathcal{U}_{\omega}$ characterizes the action of the object $$\begin{aligned} \mathcal{U}_{\omega} = \begin{pmatrix} U^{11}_{\omega} & 0 & U^{12}_{\omega} & 0 \\ 0 & I & 0 & 0 \\ U^{21}_{\omega} & 0 & U^{22}_{\omega} & 0\\ 0 & 0 & 0 & I \end{pmatrix}\end{aligned}$$ where $$\begin{aligned} U^{mn}_{\omega} = \left({\alpha^{mn}_{\omega \omega} \atop \beta^{mn*}_{\omega \omega}}{ \beta^{mn}_{\omega \omega} \atop \alpha^{mn*}_{\omega \omega}}\right).\end{aligned}$$ We emphasize that the general formalism developed here is valid for a wide class of quantum optical devices (objects), such as beamsplitters, single-mode squeezers, two-mode squeezers, cavities, and even for devices with time-dependent parameters, for example, beamsplitters with time-dependent transmission coefficients. In this paper, we mainly apply the formalism to the simplest case, a beamsplitter. Circuit model for a uniformly accelerated mirror ------------------------------------------------ The perfect moving mirror problem has been extensively studied for several decades. A perfect moving mirror provides a clear boundary for a quantum field, which vanishes along the mirror’s trajectory. The standard method for calculating the radiation from a perfect moving mirror is to find the Bogoliubov transformation between the input and output modes by taking into account the Dirichlet boundary condition. However a realistic mirror is not perfect but usually partially transparent, for which the Dirichlet boundary condition is not satisfied. In this paper, we are interested in a uniformly accelerated imperfect mirror whose motion looks nontrivial for an inertial observer. Rather than use the standard method (which is still valid if appropriate boundary conditions are considered), we shall employ the circuit model developed in the previous section, leading to a much simpler way to attack this problem. The idea is to work in the accelerated frame, in which the mirror is static and can be considered as a beamsplitter. Without loss of generality, we assume that the mirror uniformly accelerates in the $R$ wedge. The beamsplitter transforms the right Rindler modes as $$\begin{aligned} \label{beamsplitter} \hat{b}^{\prime R}_{1\omega} &=&\text{cos}\,\theta_{\omega} \hat{b}^R_{1\omega}- i e^{i \phi_{\omega}} \text{sin}\,\theta_{\omega} \hat{b}^R_{2\omega}, \nonumber\\ \hat{b}^{\prime R}_{2\omega} &=&\text{cos} \,\theta_{\omega} \hat{b}^R_{2\omega}- i e^{-i \phi_{\omega}} \text{sin}\,\theta_{\omega} \hat{b}^R_{1\omega},\end{aligned}$$ where $\theta_{\omega}$ an $\phi_{\omega}$ are frequency dependent. The relative phase shift $i e^{\pm i \phi_{\omega}} $ ensures that the transformation is unitary. The intensity reflection and transmission coefficients of the beamsplitter are $$\begin{aligned} R_{\omega} = \text{sin}^2\,\theta_{\omega}, \,\,\,\,\,\,\,\, T_{\omega} = \text{cos}^2\,\theta_{\omega}. \end{aligned}$$ By comparing Eqs. (\[beamsplitter\]) and (\[nomixingfrequency\]) we have $$\begin{aligned} \alpha^{11}_{\omega \omega} &=& \alpha^{22}_{\omega \omega} = \cos \theta_{\omega}, \nonumber \\ \alpha^{12}_{\omega \omega} &=& - \alpha^{21*}_{\omega \omega} = -i e^{i \phi_{\omega}} \sin \theta_{\omega},\end{aligned}$$ and all $\beta^{mn}_{\omega \omega}$ are zero. We can therefore express the action of the beamsplitter as $$\begin{aligned} \label{mirrortransformation} \mathcal{U}_{\omega} = \begin{pmatrix} I \text{cos}\,\theta_{\omega}& 0 & Z \text{sin}\,\theta_{\omega} & 0 \\ 0 & I & 0 & 0 \\ -Z^* \text{sin}\,\theta_{\omega} & 0 & I \text{cos}\,\theta_{\omega} & 0\\ 0 & 0 & 0 & I \end{pmatrix},\end{aligned}$$ where $I$ is the $2\times 2$ identity matrix and $$Z = \left({-i e^{i \phi_{\omega}} \atop 0}{0 \atop i e^{-i \phi_{\omega}}} \right). $$ The explicit expressions for the transformation Eq. (\[input-output\]) can be calculated straightforwardly and are summarized in Appendix \[appendixA\]. With these transformations, it is easy to calculate the expectation value of the particle number of the output $\hat{c}^{\prime}_{1\omega}$, $$\begin{aligned} \label{ParticleNumber:1} &&\langle 0_M | \hat{c}_{1\omega}^{\prime \dag} \hat{c}_{1\omega^{\prime}}^{\prime} | 0_M \rangle \nonumber \\ &=& 2(1-\text{cos} \,\theta_{\omega})\text{cosh}^2(r_{\omega}) \text{sinh}^2(r_{\omega}) \delta(\omega-\omega^{\prime}) \nonumber \\ &=& 2(1-\text{cos} \,\theta_{\omega})\frac{e^{2\pi \omega/a}}{(e^{2\pi \omega/a}-1)^2} \delta(\omega-\omega^{\prime}) \nonumber \\ &\equiv& n(\omega) \delta(\omega-\omega^{\prime}).\end{aligned}$$ The corresponding expectation values for the other three outputs is the same as Eq. (\[ParticleNumber:1\]). Hence the number of Unruh particles in every output is generally not zero. The particle-number distribution is $$\label{ParticleNumber:2} n(\omega) = 2 (1-\text{cos}\,\theta_{\omega})\frac{e^{2\pi \omega/a}}{(e^{2\pi \omega/a}-1)^2},$$ depending on the transmission coefficient of the uniformly accelerated mirror. Note that $n(\omega) = 0$ only when $\theta_{\omega} = 0$; in other words when the mirror is completely transparent to the field mode with frequency $\omega$. We also note that the distribution of the output Unruh particles is not thermal. Radiation from an eternally accelerated mirror {#radiation} ============================================== ![(color online). A uniformly accelerated mirror on the right Rindler wedge. An inertial detector is placed at an appropriate position to detect left-moving particles coming from the uniformly accelerated mirror. []{data-label="Fig:Mirror"}](f3.png){width="8.0cm"} As an application of the quantum circuit model, we calculate the radiation flux from an eternally accelerated mirror. As shown in Fig. \[Fig:Mirror\], an inertial detector is placed at an appropriate position to detect the left-moving particles radiated by the accelerated mirror. In the previous section, we have shown that the accelerated mirror radiates Unruh particles. However, the inertial detector responds only to Minkowski particles. In order to calculate the response of the inertial detector we need to find the transformation between Unruh modes and Minkowski modes. This can be done by comparing Eqs. (\[MinkowskiMode\]) and (\[UnruhMode\]), and then using the Klein-Gordon inner product [@Birrell82], $$\begin{aligned} \label{MinkowskiUnruh} \hat{a}_k &=& \int d \omega \bigg( \langle u_k, G_{\omega} \rangle\hat{c}^{\prime}_{\omega} + \langle u_k, \bar{G}_{\omega} \rangle\hat{d}^{\prime}_{\omega} \bigg) \nonumber \\ &\equiv& \int d \omega ( A_{k \omega} \hat{c}^{\prime}_{\omega} + B_{k \omega} \hat{d}^{\prime}_{\omega} ),\end{aligned}$$ where $A_{k\omega} = \langle u_k, G_{\omega} \rangle$ and $B_{k\omega} = \langle u_k, \bar{G}_{\omega} \rangle$ are the Bogoliubov transformation coefficients. Since we only consider left-moving modes here, without introducing any confusion, we have omitted the subscript $``1"$. Using the relation between Unruh modes and Rindler modes Eq. (\[UnruhRindler\]) and the relation between Rindler modes and Minkowski modes [@Crispino08], We can find the transformation between Unruh modes and Minkowski modes. A more straightforward way is to directly calculate the Klein-Gordon inner product using the explicit expressions of Unruh modes Eq. (\[Unruhmodes\]). The result is $$\begin{aligned} A_{k\omega} = B^*_{k\omega} = \frac{i \sqrt{2 \sinh(\pi \omega/a)}}{2\pi \sqrt{\omega k}} \Gamma(1-i\omega/a) \bigg(\frac{k}{a}\bigg)^{i\omega/a}, \nonumber \\ $$ where $\Gamma(z)$ is the Gamma function. In realistic quantum optics experiments a detector normally detects localized wave packet modes. In order to take this into account we consider Gaussian wave packet modes defined as $$\label{GaussianMode} \hat{a}(f) = \int_0^{\infty} d k f(k; k_0, \sigma, V_0) \hat{a}_k, $$ where $$f(k; k_0, \sigma, V_0) = \bigg(\frac{1}{2\pi \sigma^2} \bigg)^{1/4} \exp\bigg\{-\frac{(k-k_0)^2}{4\sigma^2} - i k V_0\bigg\}$$ with $k_0$, $\sigma$ and $V_0$ the central frequency, bandwidth and central position, respectively. In the narrow bandwidth limit ($k_0 \gg \sigma$), the integration over $k$ can be approximately calculated to a very good accuracy. When $k_0 \gg \sigma$, the Gaussian wave packet $f(k; k_0, \sigma, V_0)$ is significantly nonzero only for positive $k$, so the range of integration of $k$ can be extended to $(-\infty, \infty)$ without introducing large errors. Secondly, since $f(k; k_0, \sigma, V_0)$ is well localized around $k_0$, those values of $A_{k\omega}$ and $B_{k\omega}$ only near $k_0$ are relevant. Writing [@Downes13] $$\frac{1}{\sqrt{k}}\bigg( \frac{k}{a}\bigg)^{i \omega/a} \approx \frac{1}{\sqrt{k_0}}e^{i\frac{\omega}{k_0}\frac{k}{a}}e^{i\frac{\omega}{a}[\ln(\frac{k_0}{a})-1]}$$ and then expanding $A_{k\omega}$ and $B_{k\omega}$ around $k_0$ yields $$\begin{aligned} \label{A} A_{\omega} \equiv \int_0^{\infty} d k f(k) A_{k \omega} &\approx& i \sqrt{\frac{\sigma}{\pi \omega k_0}} \bigg(\frac{1}{2\pi} \bigg)^{1/4} \sqrt{2\sinh(\pi \omega/a)} \Gamma(1-i\omega/a) e^{i\frac{\omega}{a}\ln(\frac{k_0}{a})} e^{-i k_0 V_0}\exp\bigg\{-\frac{\sigma^2(\omega/a-k_0 V_0)^2}{k_0^2}\bigg\}, \nonumber \\\end{aligned}$$ $$\begin{aligned} \label{B} B_{\omega} \equiv \int_0^{\infty} d k f(k) B_{k \omega} &\approx& -i \sqrt{\frac{\sigma}{\pi \omega k_0}} \bigg(\frac{1}{2\pi} \bigg)^{1/4} \sqrt{2\sinh(\pi \omega/a)} \Gamma(1+i\omega/a) e^{-i\frac{\omega}{a}\ln(\frac{k_0}{a})} e^{-i k_0 V_0}\exp\bigg\{-\frac{\sigma^2(\omega/a+k_0 V_0)^2}{k_0^2}\bigg\} \nonumber \\\end{aligned}$$ up to first order in $k-k_0$. Using Eq. (\[ParticleNumber:1\]) and $$|\Gamma(1-i\omega/a)|^2 = |\Gamma(1+i\omega/a)|^2 = \frac{\pi \omega/a}{\sinh(\pi \omega/a)}$$ the expectation value $N(f) = \langle 0_M | \hat{a}^{\dagger}(f)\hat{a}(f)|0_M \rangle$ of the Gaussian mode particle number is $$\begin{aligned} \label{ParticleNumber} N(f) &=& \int d \omega \int d \omega^{\prime} \langle 0_M |(A^*_{\omega} \hat{c}^{\prime \dagger}_{\omega} +B^*_{\omega}\hat{d}^{\prime \dagger}_{\omega}) (A_{\omega^{\prime}} \hat{c}^{\prime}_{\omega^{\prime}} +B_{\omega'}\hat{d}^{\prime}_{\omega^{\prime}}) |0_M \rangle \nonumber \\ \nonumber \\ &=& 2 \int d \omega (|A_{\omega}|^2+|B_{\omega}|^2)(1-\cos \theta_{\omega})\frac{e^{2\pi \omega/a}}{(e^{2\pi \omega/a}-1)^2}, \nonumber \\ \nonumber \\ &=& \sqrt{\frac{8}{\pi}}\frac{\sigma}{k_0} \int_0^{\infty} d \Omega \bigg\{\exp\bigg[-\frac{2\sigma^2(\Omega-k_0 V_0)^2}{k_0^2}\bigg]+\exp\bigg[-\frac{2\sigma^2(\Omega+k_0 V_0)^2}{k_0^2}\bigg] \bigg\} (1-\cos \theta_{\Omega})\frac{e^{2\pi \Omega}}{(e^{2\pi \Omega}-1)^2}\end{aligned}$$ where $\Omega = \omega/a$ is the dimensionless Rindler frequency. Two special cases are of particular interest. Consider first that the mirror is completely transparent for all modes, that is $\cos^2 \, \theta_{\omega} = 1$. From Eq. (\[ParticleNumber\]), the particle number vanishes, $N(f)=0$. This is not surprising because a completely transparent mirror does nothing to the Minkowski vacuum. The second case is that the mirror is perfect for all modes, that is, $\cos^2 \, \theta_{\omega} = 0$. When $\Omega \rightarrow 0$, $(e^{2\pi \Omega}-1)^{-2} \sim \Omega^{-2} $ and all other factors in the integrand of Eq. (\[ParticleNumber\]) are finite. Therefore, the particle number $N(f)$ is divergent. This infrared divergence occurs because we naively assume that the mirror accelerates for an infinitely long time, which seems physically unreasonable. In the framework of the self-interaction model, the mirror is switched on and off so that one obtains finite particle flux [@Obadia01]. In our circuit model, we could also switch on and off the mirror. However instead we shall use a simpler method of regularization. The idea is to directly introduce a low frequency cutoff for the mirror, that is, the mirror is completely transparent for low-frequency field modes. The mechanism for a physical mirror to reflect electromagnetic waves is that the atoms consisting of the mirror absorb electromagnetic waves and then reemit them again. If the wavelength of the electromagnetic wave is very long, the response time of the mirror is very long. Hence if the mirror accelerates for a finite time, it cannot respond to Rindler modes with characteristic oscillation period longer than the accelerating time. In this sense, introducing a low-frequency cutoff is equivalent to switching on and off the mirror. In higher dimensional spacetime, e.g., $(1+3)$-dimensional spacetime, there is another reason justifying a low-frequency cutoff. A physical mirror with finite size cannot reflect field modes whose wavelengths are much larger than its size. This infrared divergence is not due to the pathological character of a massless scalar field in $(1+1)$-dimensional spacetime [@Coleman73]; it also appears in higher dimensional spacetime [@Frolov99] if the mirror is accelerated for an infinitely long time. ![(color online). Particle number versus central position of the Gaussian wave packet: $k_0/a = 20, a g = 10$. For larger bandwidth (narrower wave packet in time domain), the particle number distribution is narrower, showing that particles are localized around the past event horizon. []{data-label="Fig:pn"}](f4.png){width="8.0cm"} ![(color online). Energy of the wave packets versus the central frequency: $\sigma/a = 1.0, a V_0 =0, a g = 10$. The energy is almost constant in the high central frequency limit. []{data-label="Fig:energy"}](f5.png){width="8.0cm"} If we assume that the reflectivity $R_{\omega}$ of the mirror is a power law of $\omega$ as $\omega \rightarrow 0$ ($R_{\omega} \sim \omega^{\gamma}$) then in order to obtain finite particle number we must have $\gamma > 1$. As a concrete example, we choose $$R_{\omega} = \sin^2 \theta_{\omega} = \frac{g^2\omega^2}{1+g^2\omega^2},$$ where $g$ is a parameter characterizing the low-frequency cutoff. Fig. \[Fig:pn\] shows the particle number $N(f)$ versus the central position of the Gaussian wave packet. We can see that the particle-number distribution is symmetric with respect to $V_0 = 0$. In addition, for larger bandwidth (narrower wave packet in time domain), the distribution is more localized around $V_0 = 0$. These two facts indicate that the particle flux radiated by the uniformly accelerated mirror is well localized around the past horizon $V_0 = 0$. Since the mirror starts to accelerate in the distant past, that means the mirror only radiates particles when it starts accelerating. It radiates no particles when it is uniformly accelerating. Although in Eq. (\[ParticleNumber\]) the integrand explicitly depends on the central frequency $k_0$ of the Gaussian wave packet, in the large $k_0$ limit the integration turns out to be almost independent of $k_0$. That means the particle number $N(f) \sim \frac{1}{k_0}$ in the large central frequency limit (see Appendix \[appendixC\]), yielding the relationship $E(f) \approx k_0 N(f) \sim \mathcal{O}(1)$, for the energy of the wave packet, as shown in Fig. \[Fig:energy\]. Adding up the energy of all wave packets yields a divergent result. This ultraviolet divergence arises as a consequence of the physically unrealistic assumption that the mirror is accelerated eternally, so that it appears to any inertial observers when they cross the past horizon. This ultraviolet divergence can be removed by smoothly switching on the mirror [@Obadia01], or by considering an accelerated mirror whose acceleration was slowly increased from zero. For a switch-on timescale of $\Delta T$, the particle number is suppressed for wave packets with central frequency $k_0 > \frac{1}{\Delta T}$ while it remains the same for wave packets with central frequency $k_0 < \frac{1}{\Delta T}$. Therefore Eq. (\[ParticleNumber\]) is not applicable to wave packets with very high central frequency because it does not take into account physical initial conditions. Squeezing from accelerated mirrors {#squeezing} ================================== A well known mechanism for generating particles from the vacuum is the two-mode squeezing process. Examples include non-degenerate parametric down conversion [@BachorRalph] and the Unruh effect [@Unruh76]. The two output modes are entangled with each other so that the composite state is a pure state. Another important mechanism is the single-mode squeezing process, for example degenerate parametric down conversion [@BachorRalph]. It is possible that a particle generation process is the combination of the two, which we now show is the case for the uniformly accelerated mirror. Using the quantum circuit model for the uniformly accelerated mirror, it is very easy to show that the wavepacket mode is squeezed at some quadrature phase depending on the central frequency and central position of the wave packet. The correlations between various output Unruh modes are summarized in Appendix \[appendixB\]. If we consider left-moving and narrow bandwidth Gaussian wave packet modes, using Eqs. (\[MinkowskiUnruh\]), (\[GaussianMode\]), (\[A\]), (\[B\]) and (\[B1\]), we have $$\begin{aligned} \label{CroCorrelation} &&\langle 0_M |\hat{a}(f) \hat{a}(f) |0_M \rangle = \int dk \int dk^{\prime} f(k) f(k^{\prime}) \int d\omega \int d\omega^{\prime} \big[A_{k\omega} B_{k^{\prime} \omega^{\prime}}\langle 0_M |\hat{c}^{\prime}_{\omega} \hat{d}^{\prime}_{\omega^{\prime}} |0_M \rangle + B_{k\omega} A_{k^{\prime} \omega^{\prime}}\langle 0_M |\hat{d}^{\prime}_{\omega} \hat{c}^{\prime}_{\omega^{\prime}} |0_M \rangle\big] \nonumber \\ \nonumber \\ &=& - \sqrt{\frac{8}{\pi}}\frac{\sigma}{k_0} e^{-2ik_0V_0} \int_0^{\infty} d \Omega \exp\bigg[-\frac{\sigma^2(\Omega-k_0 V_0)^2}{k_0^2}\bigg] \exp\bigg[-\frac{\sigma^2(\Omega+k_0 V_0)^2}{k_0^2}\bigg] (1-\cos \theta_{\Omega})e^{\pi \Omega}\frac{e^{2\pi \Omega}+1}{(e^{2\pi \Omega}-1)^2}. \nonumber \\\end{aligned}$$ The quadrature observable of the localized wave packet mode $\hat{a}(f)$ is defined as $$\hat{X}(\phi) \equiv \hat{a}(f)e^{-i\phi} + \hat{a}^{\dagger}(f)e^{i \phi},$$ where $\phi$ is the quadrature phase. From Eqs. (\[ParticleNumber\]) and (\[CroCorrelation\]), we find that for a narrow bandwidth Gaussian wave packet the variance is $$\begin{aligned} \label{VarianceGaussian} &&\big(\Delta X({\phi})\big)^2 = \langle 0_M | \hat{X}^2({\phi}) |0_M \rangle - \langle 0_M | \hat{X}({\phi}) |0_M \rangle^2 = 1+ 2 \langle 0_M | \hat{a}^{\dagger}(f)\hat{a}(f) |0_M \rangle + 2~ \text{Re} \bigg[\langle 0_M | \hat{a}(f)\hat{a}(f) |0_M \rangle e^{-2i\phi} \bigg] \nonumber \\ &=& 1+ 4\sqrt{\frac{2}{\pi}}\frac{\sigma}{k_0} \int_0^{\infty} d \Omega \bigg\{\exp\bigg[-\frac{2\sigma^2(\Omega-k_0 V_0)^2}{k_0^2}\bigg]+\exp\bigg[-\frac{2\sigma^2(\Omega+k_0 V_0)^2}{k_0^2}\bigg] \bigg\} (1-\cos \theta_{\Omega})\frac{e^{2\pi \Omega}}{(e^{2\pi \Omega}-1)^2}\nonumber \\ &&- 4\sqrt{\frac{2}{\pi}}\frac{\sigma}{k_0} \cos(2\phi+2k_0V_0)\int_0^{\infty} d \Omega \exp\bigg[-\frac{\sigma^2(\Omega-k_0 V_0)^2}{k_0^2}\bigg] \exp\bigg[-\frac{\sigma^2(\Omega+k_0 V_0)^2}{k_0^2}\bigg] (1-\cos \theta_{\Omega})e^{\pi \Omega}\frac{e^{2\pi \Omega}+1}{(e^{2\pi \Omega}-1)^2}, \nonumber \\ \end{aligned}$$ where we have used the fact that in the Minkowski vacuum state, $\langle 0_M | \hat{X}({\phi}) |0_M \rangle = 0$. The variance of the wave packet mode could be smaller than one if the third term of Eq. (\[VarianceGaussian\]) is larger than the second term. In order to show that single-mode squeezing is possible, we consider a Gaussian wave packet centered at $V_0 = 0$. Eq. (\[VarianceGaussian\]) considerably simplifies, yielding $$\begin{aligned} \big(\Delta X^{min}\big)^2 = 1 - 4\sqrt{\frac{2}{\pi}}\frac{\sigma}{k_0} \int_0^{\infty} d \Omega \exp \bigg(-\frac{2\sigma^2\Omega^2}{k_0^2}\bigg) \times (1-\cos \theta_{\Omega})\frac{e^{\pi \Omega}}{(e^{\pi \Omega}+1)^2} <1\end{aligned}$$ for the minimum of $\big(\Delta X({\phi})\big)^2$, which is at $\phi = 0$. The variance of the quadrature beats the quantum shot noise, showing that the Gaussian wave packet mode is squeezed. When the center of the Gaussian wave packet is away from the past horizon $V_0 = 0$, the mode is squeezed at a different quadrature phase angle. According to Eq. (\[VarianceGaussian\]), the minimum of the variance is reached when $\phi_s + k_0 V_0 =0$ is satisfied, that is $$\label{phase} \phi_s = - k_0 V_0.$$ The squeezing phase angle $\phi_s$ depends on both the central frequency and central position of the Gaussian wave packet. Other than the rotation of the squeezing phase angle, the squeezing amplitude decreases when the center of the wave packet is away from the past horizon. Fig. \[Fig:variance\] shows the minimum variance of various wave packet modes (different central position and bandwidth), where the condition (\[phase\]) has been satisfied. From Fig. \[Fig:variance\] we see that the squeezing is stronger for a larger bandwidth Gaussian wave packet, which implies that different single-frequency Minkowski modes are also correlated. This can be verified if we replace $f(k)$ in Eq. (\[CroCorrelation\]) by a Dirac delta function $\delta(k - k_0)$. For a very large bandwidth wave packet mode (such as a broad bandwidth tophat mode), we find that the minimum variance approaches but never exceeds 0.5. We also note that when $\cos(2\phi + 2k_0 V_0) = -1$, the variance is maximal and larger than unity. ![(color online). Minimum variance versus central position of the Gaussian wave packet: $k_0/a = 20, a g = 10$. Maximum squeezing is achieved when the wave packet centers on the past horizon $V_0 = 0$. The squeezing is stronger for larger bandwidth wave packets. []{data-label="Fig:variance"}](f6.png){width="8.0cm"} According to the quantum circuit model, it is easy to understand the origin of the single-mode squeezing. In Fig. \[circuit:Fig\], after passing through the mirror the left-moving Rindler mode $\hat{b}_{\omega}^{\prime R}$ in the $R$ wedge is in thermal state, as well as the left-moving Rindler mode $\hat{b}_{\omega}^{L}$ in the $L$ wedge. The entanglement between $\hat{b}_{\omega}^{\prime R}$ and $\hat{b}_{\omega}^{L}$ depends on the transmission coefficient of the mirror. If the mirror is completely transparent, they are perfectly entangled; while if the mirror is perfect, the entanglement is completely severed. The Rindler modes $\hat{b}_{\omega}^{\prime R}$ and $\hat{b}_{\omega}^{L}$ further pass through a two-mode antisqueezer $S^{-1}_{\omega}$, ending up with two Unruh modes $\hat{c}^{\prime}_{ \omega}$ and $\hat{d}^{\prime}_{ \omega}$, which are also entangled. The amount of entanglement between $\hat{c}^{\prime}_{ \omega}$ and $\hat{d}^{\prime}_{ \omega}$ depends on the amount of entanglement between $\hat{b}_{\omega}^{\prime R}$ and $\hat{b}_{\omega}^{L}$. If $\hat{b}_{\omega}^{\prime R}$ and $\hat{b}_{\omega}^{L}$ are perfectly entangled, there is no entanglement between $\hat{c}^{\prime}_{ \omega}$ and $\hat{d}^{\prime}_{ \omega}$; otherwise, $\hat{c}^{\prime}_{ \omega}$ and $\hat{d}^{\prime}_{ \omega}$ are partially entangled. From Eq. (\[MinkowskiUnruh\]), the Minkowski mode $\hat{a}_k$ is a linear combination of the Unruh modes $\hat{c}^{\prime}_{ \omega}$ and $\hat{d}^{\prime}_{ \omega}$. It is a general result in quantum optics that a linear combination of entangled modes would produce single-mode squeezing, e.g., a $50:50$ beamsplitter transforms a two-mode squeezed state into single-mode squeezed sate in each output mode. Therefore, the Minkowski mode $\hat{a}_k$ is squeezed. It is clear that the single-mode squeezing is closely related to the correlations across the horizon. If the mirror is transparent ($\cos \theta_{\Omega} = 1$), the correlations across the horizon are preserved and there is no single-mode squeezing. When one uses a partially transmitting mirror ($\cos \theta_{\Omega} < 1$) to sever the correlations across the horizon, single-mode squeezing is inevitably produced according to Eq. (\[VarianceGaussian\]). Squeezed Firewall ? {#firewall} =================== Recently three assertions about black hole evaporation were shown to be mutually inconsistent[@AMPS]: (i) Hawking radiation is a unitary process, (ii) low energy effective field theory is valid near the event horizon, and (iii) an infalling observer encounters nothing unusual at the horizon. One of the proposed solutions to this paradox is that the infalling observer burns up at the horizon. A black hole firewall forms at the horizon for an old black hole and the correlations across the horizon are severed. Recently this firewall state was modeled for a Rindler horizon in Minkowski spacetime by severing correlations across the horizon. The response of an Unruh-DeWitt detector was seen to be finite [@Louko14]. The correlations across the horizon are severed by requiring the Wightman function to be zero, disregarding the underlying dynamics. Furthermore, a low-frequency cutoff in the Wightman function was introduced, implying that correlations between high-frequency modes are cut whilst correlations between low-frequency modes are preserved. This is a warm firewall. We propose that a uniformly accelerated mirror is a possible mechanism for generating a Rindler firewall. From the quantum circuit model we can see that the accelerated mirror acts as a pair of scissors cutting the correlations across the past horizon. If the mirror is perfect, the correlations across the horizon are completely severed and the particle flux along the horizon is divergent. This is a hot firewall, destroying everything that crosses it. However, if the mirror is not perfect but transparent for low-frequency modes, the high-frequency correlations are cut while low-frequency correlations are preserved, and the particle flux in a localized wave packet mode along the horizon is finite, similar to the warm firewall proposed by Louko [@Louko14]. In Sec. \[squeezing\], we showed that the radiation field from the accelerated mirror is squeezed, which implies that the Rindler firewall is squeezed. It seems that squeezing is a general property of a Rindler firewall because in order to form a firewall one has to cut the correlations across the horizon, which inevitably generates single-mode squeezing. Is a black hole firewall squeezed? Black hole firewalls are introduced in order to preserve the unitarity of black hole evolution [@AMPS; @Braunstein13]. For an old black hole, the late time Hawking radiation should be correlated with early time Hawking radiation but not with the degrees of freedom inside the event horizon. The correlations across the horizon are severed during the evaporation. According to the arguments for the Rindler firewall, it is reasonable to conjecture that the black hole firewalls are also squeezed. In addition, if the single-mode squeezing is strong enough, black hole firewalls do not have to be entangled with other unknown systems. Conclusions {#conclusion} =========== We have developed a quantum circuit formalism to describe unitary interactions between a uniformly accelerated object and the quantum fields. The key point is to work in the accelerated frame where the object is stationary and couples only to Rindler modes in one of the Rindler wedges. If the initial state of the quantum fields is given in the inertial frame and the response of inertial detectors is considered, we have to transform modes from the inertial frame to the accelerated frame, which turns out to be a two-mode squeezing operation if we consider Unruh modes instead of Minkowski modes in the inertial frame. We thus can construct a quantum circuit using two-mode squeezers and devices depending on the interaction of the object with the Rindler modes. As an example, we studied a uniformly accelerated mirror. In the accelerated frame, the mirror is stationary and is simply a beamsplitter with frequency dependent reflection coefficient. The input-output relation of a beamsplitter is well known and is widely used in quantum optics [@BachorRalph]. The quantum circuit for the uniformly accelerated mirror is shown in Fig. \[circuit:Fig\]. As an application, we calculated the radiation flux from an eternally accelerating mirror in the Minkowksi vacuum. We found that the particles are localized around the horizon and the particle number in a localized wave packet mode is divergent if no low frequency regularization is introduced. Our results are consistent with earlier results obtained using different methods [@Frolov99; @Obadia01]. The infrared divergence occurs due to the ideal assumption that the mirror accelerates for an infinitely long time. We emphasize that the infrared divergence is not due to the particular pathological character of a massless scalar field in $(1+1)$-dimensional spacetime [@Coleman73] because it also appears in higher dimensional spacetime [@Frolov99]. We regularize the radiation flux by introducing a low-frequency cutoff for the mirror, that is, the mirror is completely transparent for low frequency field modes. Physically, this is equivalent to having the mirror interact with the field for a finite time. After regularizing the infrared divergence, the particle number of a localized wave packet mode is finite. However the energy of the wave packet mode does not decay as the central frequency increases, in turn implying that the total energy of the radiation flux is infinite. This ultraviolet divergence arises because of the naive assumption that the mirror is accelerated eternally so that it appears to inertial observers when they cross the past horizon. If the mirror slowly increased its acceleration or was switched on smoothly, the number of high frequency particles would be suppressed, removing this ultraviolet divergence. Using perturbation theory it is straightforward to show that the energy flux is finite if the mirror is smoothly turned on and off [@Obadia01]. A further application of our circuit model would be in the study a uniformly accelerated cavity. Previous work on this topic [@Alsing03; @Downes11; @Bruschi12] studied how the quantum states stored inside a perfect cavity are affected by uniform acceleration. While Unruh-Davies radiation [@Unruh76; @Davies75] cannot affect the field modes inside a perfect cavity, it can affect field modes inside an imperfect one. Because the circuit model is designed to study an imperfect uniformly accelerated mirror, we believe that by generalizing the model from one mirror to two mirrors, one can study the interaction between Unruh-Davies radiation and the field modes inside an imperfect cavity. One limitation of our circuit model is that it is only suitable for studying hyperbolic trajectories in Minkowski spacetime; more general trajectories are not straightforwardly incorporated. One might expect this to severely limit the utility of the circuit model because physically it is not possible to accelerate a mirror for an infinitely long time. However our use of the transparency term shows that we can turn on and off the mirror so that it is transparent in the distant past and distant future. This could be used to model a mirror that initially undergoes inertial motion, accelerates for a finite period of time, and then returns to inertial motion. We will leave this topic for future work. We find that the radiation flux from the uniformly accelerated mirror is squeezed. To the best of our knowledge, the contribution of single-mode squeezing to the generation of particles by a moving mirror has not been discussed previously. The squeezing angle depends on the central frequency and position of the localized detector mode function. Maximum squeezing occurs when the detector mode function centers on the horizon. It is clear from the circuit model that the squeezing is related to the correlations across the horizon. When the mirror is completely transparent, the correlations across the horizon are preserved and there is no squeezing. When the mirror completely reflects a Rindler mode with a particular frequency, it destroys the correlation across the horizon and generates some squeezing in the Minkowski mode. It therefore provides a mechanism for transferring the correlations across the horizon to the squeezing of the radiation flux on the horizon. Recently, Louko [@Louko14] proposed a Rindler firewall state by severing the correlations across the horizon by hand and claimed that the response of a particle detector is finite. It was subsequently shown that entanglement survives this Rindler firewall [@Martinez15]. Our calculation suggests that one way of generating a Rindler firewall is to uniformly accelerate a mirror. We conjecture that if the firewall is formed in an old black hole, the radiation flux at the horizon could be squeezed as the price of severing the entanglement across the event horizon. In addition, the black hole firewall may not need to be highly entangled with other systems [@Susskind14] because the squeezing may be enough to account for the particle flux on the horizon. ACKNOWLEGEMENTS {#acknowlegements .unnumbered} =============== We would like to thank Antony Lee, Shih-Yuin Lin and Yiqiu Ma for useful discussions. This research was supported in part by Australian Research Council Centre of Excellence of Quantum Computation and Communication Technology (Project No. CE110001027), and in part by the Natural Sciences and Engineering Research Council of Canada. Input-output relations\[appendixA\] =================================== We summarize the input-output relations of the quantum circuit Fig. \[circuit:Fig\] with the object a beamsplitter. The action of the beamsplitter is represented by Eq. (\[mirrortransformation\]). Substituting it into Eq. (\[input-output\]), we have $$\begin{aligned} \label{UnruhLeftC} \hat{\bf c}^{\prime}_{1\omega} &=& \hat{\bf c}_{1\omega}[\text{cosh}^2(r_{\omega})\text{cos} \,\theta_{\omega}-\text{sinh}^2(r_{\omega})] - \sigma_x \hat{\bf d}_{1\omega} \text{cosh}(r_{\omega})\text{sinh}(r_{\omega})(1-\text{cos} \,\theta_{\omega}) +Z \hat{\bf c}_{2\omega} \text{cosh}^2(r_{\omega})\text{sin} \,\theta_{\omega} \nonumber \\ &&+Z \sigma_x \hat{\bf d}_{2\omega} \text{cosh}(r_{\omega})\text{sinh}(r_{\omega}) \text{sin} \,\theta_{\omega}. \nonumber \\ &=& [\text{cosh}^2(r_{\omega})\text{cos} \,\theta_{\omega}-\text{sinh}^2(r_{\omega})] {\hat{c}_{1\omega} \choose \hat{c}_{1\omega}^{\dag}} - \text{cosh}(r_{\omega})\text{sinh}(r_{\omega})(1-\text{cos} \,\theta_{\omega}){\hat{d}_{1\omega}^{\dag} \choose \hat{d}_{1\omega}} + \text{cosh}^2(r_{\omega})\text{sin} \,\theta_{\omega} {-i e^{i \phi_{\omega}}\hat{c}_{2\omega} \choose i e^{- i \phi_{\omega}}\hat{c}_{2\omega}^{\dag}} \nonumber \\ &&+ \text{cosh}(r_{\omega})\text{sinh}(r_{\omega}) \text{sin} \,\theta_{\omega} {-i e^{i \phi_{\omega}}\hat{d}_{2\omega}^{\dag} \choose i e^{- i \phi_{\omega}}\hat{d}_{2\omega}}, \end{aligned}$$ $$\begin{aligned} \label{UnruhLeftD} \hat{\bf d}^{\prime}_{1\omega} &=& \sigma_x \hat{\bf c}_{1\omega} \text{cosh}(r_{\omega})\text{sinh}(r_{\omega})(1-\text{cos}\,\theta_{\omega}) + \hat{\bf d}_{1\omega}[\text{cosh}^2(r_{\omega})-\text{sinh}^2(r_{\omega})\text{cos}\,\theta_{\omega}] - \sigma_x Z \hat{\bf c}_{2\omega} \text{cosh}(r_{\omega})\text{sinh}(r_{\omega}) \text{sin}\,\theta_{\omega} \nonumber \\ && - \sigma_x Z \sigma_x \hat{\bf d}_{2\omega} \text{sinh}^2(r_{\omega})\text{sin}\,\theta_{\omega} \nonumber \\ &=& \text{cosh}(r_{\omega})\text{sinh}(r_{\omega})(1-\text{cos}\,\theta_{\omega}){\hat{c}_{1\omega}^{\dag} \choose \hat{c}_{1\omega}} +[\text{cosh}^2(r_{\omega})-\text{sinh}^2(r_{\omega})\text{cos}\,\theta_{\omega}]{\hat{d}_{1\omega} \choose \hat{d}_{1\omega}^{\dag}} \nonumber \\ &&- \text{cosh}(r_{\omega})\text{sinh}(r_{\omega}) \text{sin}\,\theta_{\omega}{i e^{- i \phi_{\omega}}\hat{c}_{2\omega}^{\dag} \choose -i e^{i \phi_{\omega}}\hat{c}_{2\omega}} - \text{sinh}^2(r_{\omega})\text{sin}\,\theta_{\omega}{ i e^{- i \phi_{\omega}}\hat{d}_{2\omega} \choose -i e^{i \phi_{\omega}}\hat{d}_{2\omega}^{\dag} }, \end{aligned}$$ $$\begin{aligned} \label{UnruhRightC} \hat{\bf c}^{\prime}_{2\omega} &=& -Z^* \hat{\bf c}_{1\omega} \text{cosh}^2(r_{\omega})\text{sin}\,\theta_{\omega} -Z^* \sigma_x \hat{\bf d}_{1\omega} \text{cosh}(r_{\omega})\text{sinh}(r_{\omega}) \text{sin}\,\theta_{\omega} + \hat{\bf c}_{2\omega}[\text{cosh}^2(r_{\omega})\text{cos}\,\theta_{\omega}-\text{sinh}^2(r_{\omega})] \nonumber \\ &&-\sigma_x \hat{\bf d}_{2\omega} \text{cosh}(r_{\omega})\text{sinh}(r_{\omega})(1-\text{cos}\,\theta_{\omega}) \nonumber \\ &=&\text{cosh}^2(r_{\omega})\text{sin}\,\theta_{\omega} {-ie^{-i \phi_{\omega}}\hat{c}_{1\omega} \choose ie^{i \phi_{\omega}}\hat{c}_{1\omega}^{\dag}} + \text{cosh}(r_{\omega})\text{sinh}(r_{\omega}) \text{sin}\,\theta_{\omega} {-i e^{-i \phi_{\omega}}\hat{d}_{1\omega}^{\dag} \choose i e^{i \phi_{\omega}}\hat{d}_{1\omega}} +[\text{cosh}^2(r_{\omega})\text{cos}\,\theta_{\omega}-\text{sinh}^2(r_{\omega})] {\hat{c}_{2\omega} \choose \hat{c}_{2\omega}^{\dag}}\nonumber \\ &&- \text{cosh}(r_{\omega})\text{sinh}(r_{\omega})(1-\text{cos}\,\theta_{\omega}){\hat{d}_{2\omega}^{\dag} \choose \hat{d}_{2\omega}}, \end{aligned}$$ $$\begin{aligned} \label{UnruhRightD} \hat{\bf d}^{\prime}_{2\omega} &=& -\sigma_x Z^* \hat{\bf c}_{1\omega} \text{cosh}(r_{\omega})\text{sinh}(r_{\omega}) \text{sin}\,\theta_{\omega} + \sigma_x Z^* \sigma_x \hat{\bf d}_{1\omega} \text{sinh}^2(r_{\omega})\text{sin}\,\theta_{\omega} + \sigma_x \hat{\bf c}_{2\omega} \text{cosh}(r_{\omega})\text{sinh}(r_{\omega})(1-\text{cos}\,\theta_{\omega}) \nonumber \\ &&+ \hat{\bf d}_{2\omega}[\text{cosh}^2(r_{\omega})-\text{sinh}^2(r_{\omega})\text{cos}\,\theta_{\omega}] \nonumber \\ &=&-\text{cosh}(r_{\omega})\text{sinh}(r_{\omega}) \text{sin}\,\theta_{\omega}{i e^{ i \phi_{\omega}}\hat{c}_{1\omega}^{\dag} \choose -i e^{-i \phi_{\omega}}\hat{c}_{1\omega}} - \text{sinh}^2(r_{\omega})\text{sin}\,\theta_{\omega}{ i e^{ i \phi_{\omega}}\hat{d}_{1\omega} \choose -i e^{-i \phi_{\omega}}\hat{d}_{1\omega}^{\dag} } \nonumber \\ &&+\text{cosh}(r_{\omega})\text{sinh}(r_{\omega})(1-\text{cos}\,\theta_{\omega}) {\hat{c}_{2\omega}^{\dag} \choose \hat{c}_{2\omega}} +[\text{cosh}^2(r_{\omega})-\text{sinh}^2(r_{\omega})\text{cos}\,\theta_{\omega}]{\hat{d}_{2\omega} \choose \hat{d}_{2\omega}^{\dag}} \label{UnruhRightD}.\end{aligned}$$ Correlations between output Unruh modes\[appendixB\] ==================================================== Using Eqs. (\[UnruhLeftC\])-(\[UnruhRightD\]), it is straightforward to calculate the correlations between various output Unruh modes in the Minkowski vacuum state. $$\begin{aligned} \label{B1} \langle 0_M | \hat{c}'_{m \omega} \hat{d}'_{m \omega'} |0_M \rangle &=& \langle 0_M | \hat{d}'_{m \omega} \hat{c}'_{m \omega'} |0_M \rangle = \langle 0_M | \hat{c}^{\prime \dag}_{m \omega} \hat{d}^{\prime \dag}_{m \omega'} |0_M \rangle = \langle 0_M | \hat{d}^{\prime \dag}_{m \omega} \hat{c}^{\prime \dag}_{m \omega'} |0_M \rangle \nonumber \\ \nonumber \\ &=& - (1 - \cos \theta_{\omega}) \cosh(r_{\omega}) \sinh(r_{\omega}) \bigg [\sinh^2(r_{\omega}) + \cosh^2(r_{\omega}) \bigg] \delta(\omega - \omega'),\end{aligned}$$ $$\begin{aligned} \label{B2} \langle 0_M | \hat{c}'_{1 \omega} \hat{d}'_{2 \omega'} |0_M \rangle &=& \langle 0_M | \hat{d}'_{2 \omega} \hat{c}'_{1 \omega'} |0_M \rangle = \langle 0_M | \hat{c}^{\prime \dag}_{1 \omega} \hat{d}^{\prime \dag}_{2 \omega'} |0_M \rangle ^* = \langle 0_M | \hat{d}^{\prime \dag}_{2 \omega} \hat{c}^{\prime \dag}_{1 \omega'} |0_M \rangle^* \nonumber \\ \nonumber \\ &=& i e^{i \varphi_{\omega}}\sin \theta_{\omega} \cosh(r_{\omega}) \sinh(r_{\omega}) \delta(\omega - \omega'),\end{aligned}$$ $$\begin{aligned} \label{B3} \langle 0_M | \hat{c}'_{2 \omega} \hat{d}'_{1 \omega'} |0_M \rangle &=& \langle 0_M | \hat{d}'_{1 \omega} \hat{c}'_{2 \omega'} |0_M \rangle = \langle 0_M | \hat{c}^{\prime \dag}_{2 \omega} \hat{d}^{\prime \dag}_{1 \omega'} |0_M \rangle ^* = \langle 0_M | \hat{d}^{\prime \dag}_{1 \omega} \hat{c}^{\prime \dag}_{2 \omega'} |0_M \rangle^* \nonumber \\ \nonumber \\ &=& - i e^{- i \varphi_{\omega}}\sin \theta_{\omega} \cosh(r_{\omega}) \sinh(r_{\omega}) \delta(\omega - \omega'),\end{aligned}$$ with others zero and here $m = 1,2$. High central frequency limit {#appendixC} ============================ We derive an analytically approximate expression for the particle number $N(f)$ in the high central frequency limit. From Eq. (\[ParticleNumber\]), one expects that the term in the braces has two peaks at $k_0 V_0$ and $-k_0 V_0$. If $k_0$ is large then the peaks are far away from the origin. However, the factor $\frac{e^{2\pi \Omega}}{(e^{2\pi \Omega}-1)^2}$ exponentially decays for large $\Omega$ so that it strongly suppresses one of the Gaussian peaks. Therefore, the main contribution to the integration is from the low frequency. We Taylor expand the term in the braces to second order, $$\begin{aligned} \exp\bigg[-\frac{2\sigma^2(\Omega-k_0 V_0)^2}{k_0^2}\bigg]+\exp\bigg[-\frac{2\sigma^2(\Omega+k_0 V_0)^2}{k_0^2}\bigg] \approx 2 e^{-2 \sigma^2 V_0^2} + \frac{4 \sigma^2 \Omega^2}{k_0^2} (4 \sigma^2 V_0^2 -1) e^{-2 \sigma^2 V_0^2}. \end{aligned}$$ In order to get an analytic expression, we introduce sharp low frequency cutoff, $R_{\omega} = 1$ for $\Omega \ge \epsilon$ and zero for $0 < \Omega < \epsilon$. Therefore we have $1-\cos \theta_{\Omega} = 1$ for $\Omega \ge \epsilon$ and zero for $0 < \Omega < \epsilon$. The particle number $N(f)$ can be approximated as $$\begin{aligned} \label{ParticleNumber:2} N(f) &\approx& 4 \sqrt{\frac{2}{\pi}}\frac{\sigma}{k_0} e^{-2 \sigma^2 V_0^2} \bigg[ \int_{\epsilon}^{\infty} d \Omega \frac{e^{2\pi \Omega}}{(e^{2\pi \Omega}-1)^2} + \frac{2 \sigma^2}{k_0^2} (4 \sigma^2 V_0^2 -1) \int_{\epsilon}^{\infty} d \Omega \frac{\Omega^2 e^{2\pi \Omega}}{(e^{2\pi \Omega}-1)^2} \bigg] \nonumber \\ \nonumber \\ &\approx& \bigg(\frac{2}{\pi} \bigg)^{3/2} \bigg(\frac{\sigma}{k_0} \bigg) e^{-2 \sigma^2 V_0^2} \bigg[\frac{1}{e^{2 \pi \epsilon} - 1} + \frac{2 \sigma^2}{k_0^2} (4 \sigma^2 V_0^2 -1)\bigg(\frac{1}{12} - \frac{\epsilon^2}{2 \pi} \bigg) \bigg]. \end{aligned}$$ Comparison with direct numerical calculation shows that Eq. (\[ParticleNumber:2\]) is a very good approximation when $\epsilon$ is small. We can see that the particle number is dependent on the low frequency cutoff $\epsilon$. The first term of Eq. (\[ParticleNumber:2\]) is proportional to $\frac{1}{e^{2 \pi \epsilon} - 1}$ which is divergent when $\epsilon \rightarrow 0$. Furthermore, in the high central frequency limit $k_0 \rightarrow \infty$, the leading order of $N(f)$ is proportional to $\frac{1}{k_0}$. [99]{} G. T. Moore, J. Math. Phys. [**11**]{}, 2679(1970). S. A. Fulling and P. C. W. Davies, Proc. R. Soc. Lond. A. [**348**]{}, 393(1976). P. C. W. Davies and S. A. Fulling, Proc. R. Soc. Lond. A. [**356**]{}, 237(1977). W. R. Walker, Phys. Rev. D [**31**]{}, 767(1985). R. D. Carlitz and R. S. Willey, Phys. Rev. D [**36**]{}, 2327(1987). S. Hawking, Commun. Math. Phys. [**43**]{}, 199(1975). F. Wilczek, arXiv:hep-th/9302096. M. Hotta, R. Schützhold and W. G. Unruh, Phys. Rev. D [**91**]{}, 124060(2015). S. Hawking, Phys. Rev. D [**14**]{}, 2460(1976). N. D. Birrell and P. C. W. Davies, [*Quantum Fields in Curved Space*]{}(Cambridge University Press, Cambridge, England, 1982). P. G. Grove, Class. Quantum Grav. [**3**]{}, 193(1986). V. P. Frolov and E. M. Serebriany, J. Phys. A: Math. Gen. [**12**]{}, 2415(1979). V. P. Frolov and E. M. Serebriany, J. Phys. A: Math. Gen. [**13**]{}, 3205(1980). V. P. Frolov and D. Singh, Class. Quantum Grav. [**16**]{}, 3693(1999). N. Obadia and R. Parentani, Phys. Rev. D [**64**]{}, 044019(2001). N. Obadia and R. Parentani, Phys. Rev. D [**67**]{}, 024021(2003). N. Obadia and R. Parentani, Phys. Rev. D [**67**]{}, 024022(2003). W. G. Unruh, Phys. Rev. D [**14**]{}, 870(1976). S. Takagi, Prog. Theor. Phys. Suppl. [**88**]{}, 1(1986). L. Crispino, A. higuchi and G. Matsas, Rev. Mod. Phys [**80**]{}, 787(2008). A. Almheiri, D. Marolf, J. Polchinski and J. Sully, J. High Energy Phys. 02(2013)062. S. L. Braunstein, S. Pirandola and K. Zyczkowski, Phys. Rev. Lett. [**110**]{}, 101301(2013). S. A. Fulling, Phys. Rev. D [**7**]{}, 2850(1973). T. G. Downes, T. C. Ralph and N. Walk, Phys. Rev. A [**87**]{}, 012327(2013). P. M. Alsing and G. J. Milburn, Phys. Rev. Lett. [**91**]{}, 180404(2003). T. G. Downes, I. Fuentes and T. C. Ralph, Phys. Rev. Lett. [**106**]{}, 210502(2011). D. E. Bruschi, I. Fuentes and J. Louko, Phys. Rev. D [**85**]{}, 061701(R)(2012). P. C. W. Davies, J. Phys. A [**8**]{}, 609(1975). H. -A. Bachor and T. C. Ralph, [*A Guide to Experiments in Quantum Optics*]{}, 2nd ed. (Wiley-VCH, Weinheim, 2004). S. R. Coleman, Commun. Math. Phys. [**31**]{}, 259-264(1973). J. Louko, J. High Energy Phys. 9(2014)142. E. Martín-Martínez and J. Louko, Phys. Rev. Lett. [**115**]{}, 031301(2015). L. Susskind, arXiv:1412.8483

Risks, Rewards, Stress: Early Employees & Founders - eladgil http://blog.eladgil.com/2012/03/early-employees-versus-founders-risks.html ====== autarch I agree that founders take on much more risk and stress than the early employees. I think the source of the discontent that some early employees (like me) express is that the rewards for a founder are worth it, while the rewards for an early employee generally aren't. I wrote about this in more detail in a comment a few months back - <http://news.ycombinator.com/item?id=3490364> (Some day, I will write a blog post that goes into more detail. Really. I swear. I'm totally on it. Any day now.) ~~~ michaelochurch I agree with you. For two other categories of employment, the risks, rewards, and promises are clearly laid out. Founders: take on risk (no salary pre-seed, zero job security) but get a massive payout if it works. Big-company employees: no risk, high job security, guaranteed payout. For startup employees, the bargain is murky and implicit. These employees take some risk and stress (not as much as founders, but probably 30-40% as much) in exchange not for a huge payout, but for the promise of a leadership position when the company gets big. _That_ 's the (implicit) contract. It's not, "Get $100 million when this thing exits" but "Get a VP-level position, that might help you along to something else, when we hit 500 people". The implicit nature of that bargain makes it problematic. A founder with 5% in equity is always going to have those shares of stock. (His percentage can be diluted, but he has legal recourse if it's done improperly.) Even if he's fired, he has whatever equity he has vested. The early employee (whose equity amount is small) who worked his ass off to get a leadership position in the company as it grew can be denied that opportunity at any time for any reason. There isn't an easy solution, because some early employees don't deserve the leadership positions they want, but they usually aren't bad enough to be fired either. My solution would be to give them very small-scale leadership, or even autonomous contributor status (they can work on whatever they want, but can only pull other people to their projects if someone else thinks it's a good idea) as a token of appreciation. Perhaps that's because I think there are few truly incompetent people; some just don;'t grow as fast, for whatever reason. There's another dynamic that hits this whole thing in the side: as startups grow, they start wanting "The Best" hires, which often means that they have to hire people into positions of some status. But if your older employees feel promised leadership positions, and those opportunities are bargained away to new employees in order to make the best hires, you can end up with a conflict. ~~~ autarch Also don't forget employees of small, profitable companies. I work for a small, profitable company right now. It's great. The pay is good, it's low stress, and I have a lot of control over the direction of the product and the work I do. There's no expectation of crazy hours, and we have time to do things well. Yeah, I won't make a bazillion dollars, but I've already worked at two startups, and clearly I'm not a bazillionaire. ~~~ michaelochurch What's the company? That sounds like a great arrangement. I find that both startups and big companies usually fail (not maliciously, but just due to failures of introspection) to deliver on their non-monetary promises. Startups: people associate startups with interesting, creative work reflexively. Not so, or not always. First, 80% of startups aren't doing very interesting things (social semantic coupon aggregators? That's the business plan analogue of OOP's VisitorFactoryObserverFactory pattern!) Even in those other 20%, there's a lot of uninteresting stuff that has to be done in order to meet the rapid client-acquisition or growth targets. Related to this, every startup has deadlines, and that can be managed so it doesn't become a problem, but too-often startups develop Deadline Culture and accumulate technical debt at a rapid pace. (It doesn't take long.) One of those unpublished startup negativities is how quickly and how often this happens. It's not published because, by the time Deadline Culture is having serious negative impacts (in code quality, organizational structure, morale and blame-shifting when things break) the people being affected have double- and triple-digit employee numbers (i.e. they're nobodies). With big companies, the promise is that you can have a career within the company that transcends "jobs". That is, if one job doesn't work out, you can move to another one and still have a 12-year career (possibly moving into another role entirely) with the company. In theory. What happens in practice in BigCos is that manager-as-SPOF is still the law of the land. Large-corporate middle managers often have zero interest in extra- hierarchical collaboration, some actively want to isolate their reports, and are just as liable to take employee's extracurricular interests (or outright desire for transition) personally as startup founders. The problem with the middle managers' emotional outbursts related to people wanting to "leave them" is that they have a lot more power (within their organizations) than "jilted" founders. What I find darkly ironic is how many rapid-growth startups-- mostly managers, engineers aren't this way-- want to become huge corporations (and naively think they won't lose their character in the process). I find that hypocritical. "We're agile and awesome because we're a small startup. We also want to become bigger than Google." What people can't say (because it's impolite) is that they _won't care_ that the thing became a BigCo because they'll be very rich by then-- or at least, rich enough to easily move on. It's a less brazen variant of "build to flip". People tend to fetishize 200%/year growth curves and billion-dollar exits, while ignoring the fact that anything growing that fast is going to get destroyed in the process. Fuck 200%. If my income grows at a "piddling" 10%/year for the next 40, that will give me more money than I could ever need at any stage of life (and more than I could ever deserve toward the end). So I'd rather focus on building real skills and learning how to actually reliably deliver value to the world than chasing some huge acquisition. Out of curiosity, what technologies do you use at your company? I've become a major fan of Scala of late, but I'm also impressed by Clojure and Ocaml. ------ klochner Little bit of a strawman argument here regarding early employees taking on equivalent risk - I don't know anyone who believes that, other than the situation where early employees are unpaid and the 'product' is just a slide deck. As for how hard people work, I would expect people to work in proportion to their expected payout. Founders have the biggest upside, so naturally they work much harder. An early employee paid with salary and little equity doesn't have the same incentives to be working 20 hours/day. ~~~ eladgil Hmm, I am not sure I agree with the second part of your statement for a few reasons. E.g. 1\. Relative utility of the upside. It is not the absolute value of the outcome that matters per person, but rather the relative value. <http://en.wikipedia.org/wiki/Utility> 2\. Other incentives (fun, interesting work, wanting the "startup experience" etc.). These dont always exist, but often they do and people value them. 3\. Passion for making an impact. Some products are really exciting to work on. Not everyone is in it just for the money. I think in general my personal bias would not be to hire people who think purely in economic terms about e.g. their work ethic. Obviously, you want all the people who take the risk to work with you at a startup to do extremely well, but you don't want people whose primary thought is "well, if I make 2X more I will work 2X harder" as there are lots of ups and downs at a startup, and sometimes it is unclear what the outcome will be. ~~~ sid6376 I am interested in knowing what do you mean when you say you do not agree with the second part of the statement. Do you mean, just because I want some of the things that you listed above, say the startup experience, does that mean I should be working as hard as the founders? ~~~ eladgil I mean: When I was working at other people's startups, I never thought "boy, the founders have way more equity then me, I should slack off or not work as hard because of that". I always tried to do my best at whatever job I had, and would want to hire people with the same attitude. ~~~ klochner Yes, you want people who are passionate and want to work hard, but there are sacrifices made to work 18 hour days, and people are much more likely to make those sacrifices when their upside is in the millions rather than the thousands. The difference between a 60 hour week and an 80 hour week is pretty significant in terms of personal sacrifice. No one says "I'm going to slack off", it's just that the founders are inherently (financially) more motivated. If the money _isn't_ a motivation, then the founders should have no problem giving out most of their own equity.

5000km softslide Take a home video like this one (posted January 24, 2007) – 1.1 million views make it more extreme like this (posted August 03, 2009) – 2.7 million views Promote the heck out of it through paid media and traditional PR support (i.e. seed it to every gullible news outlet) and let them put it on the news (for free). And be sure to cover your tracks by turning off “statistics and data” on the YouTube video so people can’t back track where you promoted the video. Unfortunately for Microsoft, no one will ever know if this viral video drove any sales like the JKWeddingDance one did for Chris Brown’s single “Forever” which hit the top of the sales charts on iTunes and Amazon MP3 the same week. Digital Consigliere Dr. Augustine Fou is Digital Consigliere to marketing executives, advising them on digital strategy and Unified Marketing(tm). Dr Fou has over 17 years of in-the-trenches, hands-on experience, which enables him to provide objective, in-depth assessments of their current marketing programs and recommendations for improving business impact and ROI using digital insights.

The Digestive System In A Nutshell- Part One You eat. Food is broken down. Nutrients are absorbed. The rest is waste. Right? While most of us have the basic understanding of our digestive system, the mechanisms and structures that work together to help us survive are a bit more complex. In part one (this one!) of our series we’re going to delve into the five main GI structures and what they do to keep you functioning. The Mouth This is the part we know, it’s where food enters. What we may not know is that the mouth is lined with a mucous membrane to protect it. This membrane contains cells and glands that occasionally secrete mucous. Your salivary glands produce roughly 1.5L of saliva each day (seems like a lot of drool right??). This saliva contains fun enzymes like amylase– responsible for starting off the digestion of starch – and lipase– begins the (long) process of fat breakdown. Once the food is chewed and formed into a ball it is passed along. Hint The more you chew your food, the more time the enzymes have to break it down resulting in better digestion. The Esophagus In simple terms, this is a transporting tube to the stomach. It is roughly 10 inches in length and again, lined with a mucous membrane (we seem to have a few of those!). It ends with the lower esophageal sphincter (LES) which regulates both food entering the stomach and prevents acidic juices coming up. Heartburn is caused by the sphincter opening up more than it should or at the wrong times. Diet alone doesn’t cause this but foods like; chocolate, peppermint, alcohol, caffeine, citrus & fried foods can exacerbate symptoms. Food moves through the esophagus with wave like contractions and the help of gravity. Hint Heartburn symptoms can be reduced by staying upright after eating- this allows gravity to work its magic and reduces the risk of the LES allowing acids back into the esophagus The Stomach The first major stage of digestion. When empty, your stomach is fairly small. However, and depending on the meal, your stomach can enlarge to a volume of nearly 4L (50times what it is empty!!). There are three parts of the stomach (fundus, body, antrum) each playing a slightly different role. On top of those parts, there are four layers. The initial layer (gastric mucosa) is where gastric juices and thus digestive enzymes are secreted. Pepsin, hydrochloric acid and intrinsic factor all aid in the breakdown of the chewed food. Hint Intrinsic Factor (IF) is necessary for B12 absorption. Since levels can vary depending on lifestyle factors, sometimes a B12 injection is needed to bypass the need for IF Minimal absorption actually takes place in the stomach. Only some drugs, water, few vitamins, alcohol and specific short chain fatty acids are able to cross the stomach lining. While the stomach is therefore mainly digestive, it is also protective. During digestion the acidity of our stomach increases. This acidity aids in the breakdown of food, but it also helps destroy most pathogenic bacteria swallowed as well. In total it takes between 1-4 hours for the stomach to empty depending on the meal. Small Intestine This is where absorption actually begins. There are three parts to the small intestine. The second being where most absorption occurs, but it is in the third section where B12, bile salts and any other products of digestion are taken in. Absorption in the small intestine is slow. About 1 cm per minute. So it takes anywhere from 4-8hours for the digested products to pass through. In the first part of the small intestine, juices secreted from the pancreas help neutralize the acidity and further breakdown any food stuff. This is also when bile is released from the gallbladder to aid in the emulsification of fat (helps it become more soluble and ready for absorption). Hint Consume soluble fiber!!! Bile salts are partially re-cycled in the small intestine. Without this re-absorption new bile salt production would be unable to keep up with the digestive process. How does this occur? Soluble dietary fiber can bind to a portion of the bile salts in the small intestine and promote their elimination from the body. Since cholesterol is required for the formation of new bile salts, this causes more cholesterol to be used. Therefore, dietary fiber can lower blood cholesterol Large Intestine The large intestine is (you guessed it!) larger. It is also a slow moving structure. It takes another 12-25 hours for food to be fully passed through the body. Through the large intestine, sodium, potassium, acids, gases and remaining water are absorbed. What is leftover, the semi solid mix, is waste. The large intestine is a complex place. It contains a unique blend of bacteria which makes it the most metabolically active organ in the body. Intestinal bacteria are responsible for the fermentation of fiber, oligosaccharides and sugars that our bodies failed to digest and absorb. This fermentation turns the above listed carbohydrates into short chain fatty acids…and produces strong scented gas in the process. So there you have it. The main structures in your digestive system. Other organs involved (liver/gallbladder /pancreas) will be looked at in depth in the second part of this series. I hope this quick summary helped you begin to understand how much work is involved in everyday functions. Your digestive system works hard to keep your body running optimally, so reward it with real, nutrient dense food! And as always, if you need help contact me to set up a free consultation.

Introduction ============ Central serous chorioretinopathy (CSCR) is characterized by serous detachment of posterior pole retinal sensory layer from the pigment epithelium, which results in the leakage of retinal pigment epithelium, with or without pigment epithelium detachment ([@b1-mmr-17-02-2335]). Fundus angiography is an important method for the diagnosis of CSCR. Previous studies using indocyanine green angiography (ICGA) showed that CSCR is mainly associated with choroid perfusion abnormalities, while the retinal pigment epithelium (RPE) lesions and accumulation of subretinal fluid are secondary changes ([@b2-mmr-17-02-2335]), suggesting that CSCR may be caused by choroid microvascular lesions. It is well known that CSCR is a self-limiting disease, and the majority of patients generally self heal within 3--6 months, but chronic and recurrent occurrence can eventually lead to permanent loss of vision ([@b3-mmr-17-02-2335]). However, the exact pathogenesis of CSCR remains unclear. As a result, it is important to discover a method to determine whether patients with early stage can self heal, and provide guidelines for early intervention to avoid permanent loss of vision caused by CSCR for patients who can not self heal. Optical coherence tomography (OCT) plays a very important role in the diagnosis of CSCR. The fundus image OCT can evaluate the subretinal fluid volume and location of RPE lesion, and provide information for the diagnosis and treatment of CSCR. However, it does not provide clear clues for choroidal and retinal vasculature ([@b4-mmr-17-02-2335]). In recent years, the optical coherence tomography angiography (OCTA) has successfully solved this problem. It is a new noninvasive imaging technique compared with the traditional OCT. The most prominent advantage of OCTA system is the application of the SSADA algorithm ([@b5-mmr-17-02-2335]) and En-face scanning. The SSADA algorithm can reduce the artifacts and noise to a certain extent, and improve the signal to noise ratio. The application of En-face can obtain three-dimensional image data, displaying all aspects of information, such as the retinal nerve fiber layer, RPE, and choroid. In addition, OCTA is not affected over time, since it is a non-invasive method without injection of contrast agent ([@b5-mmr-17-02-2335]). OCTA provides a detailed view of the retinal blood vessels, and can accurately describe retinal microvascular abnormalities and vascular occlusion. It can also help to quantify vascular damage. Combined with previous studies, it has been shown that the pathological changes of CSCR are mainly choroidal microvascular abnormalities, and whether there is a change in the microvessels in the macular region remains unexplored. In this study, OCTA was used to quantify the retinal microvascular density, and to explore the changes of retinal microvascular network in patients with CSCR. Materials and methods ===================== ### Research subjects To ensure the maximum comparability between the experimental group and the control group, we conducted a prospective randomized controlled study. To minimize the effects of non-experimental factors, such as age and course of disease, we recruited 15 CSCR patients (all right eye) with symptoms duration less than 1 months according to the principle of minimum distribution imbalance index from the Affiliated Eye Hospital and First Affiliated Hospital of Nanchang University from 2016 to 2017, and 15 age and gender matched healthy participants (all right eye) as control group. The subjects completed a comprehensive examination of the ocular surface and OCTA. The clinical manifestations of CSCR included decreased visual acuity, blurred vision, visual distortion, light shadow occlusion, dim vision, dark landscape and so on. ### Recruitment criteria For all patients, diagnosis was based on the best-corrected visual acuity (BCVA), routine eye examination, and fundus fluorescein angiography (FFA) examination ([@b6-mmr-17-02-2335]). In accordance with CSCR diagnostic criteria, clinical presentation of the disease included: i) clinical manifestations of visual impairment, floating shadows or central scotoma (blind spot), visual darkening, discoloration, deformation, narrowing; ii) FFA examination showing macular edema or discoid anti-halo, with or without yellow/white punctiform exudation or old exudative spots; iii) FFA examination showing either the typical or atypical punctate pigment epithelial leakage on the posterior pole and smoke-like or ink-like stains on the macular area. ### Exclusion criteria The exclusion criteria were: i) eyelid disease and other ocular surface diseases and intraocular diseases that were not cured; ii) eye surgery within six months; iii) rheumatoid arthritis, systemic lupus erythematosus, Sjogren syndrome and other systemic autoimmune disease; iv) long period administration of anti hypertension and anti depressants drugs; v) pregnant or lactating patients. ### Ethical considerations The present study was conducted in accordance with the principles of the declaration of Helsinki, according to the requirements of the two hospitals\' ethics committee. A detailed explanation of the method and content of the study was given to each patient, and the consent was signed by the patient. ### OCTA OCTA image was taken using the RTVue Avanti XR system (Optovue, Fremont, CA, USA). This device has recently been introduced into clinical practice for simultaneous visualization of retinal cross sections and blood vessels. The instrument scanned at 70000 A-per second, including a super light emitting diode, with a central wavelength of 840 nm and a bandwidth of 45 nm ([@b6-mmr-17-02-2335]). It provided an axial resolution of 5 µm within the tissue, and the retinal plane spot diameter was 22 µm (horizontal resolution). A series of B scans were obtained over a 6×6 mm area focused on the concave obtained choroidal OCTA images ([Fig. 1 A-C](#f1-mmr-17-02-2335){ref-type="fig"}). Each B scan contained 216 A-scans (along the X axis) and five consecutive B scans were captured at each of the 216 locations (along the Y axis). With a speed of 270 frames per second, a total of 1080 B scans (216 y-positions × 5 positions) were obtained. 6×6 mm OCTA image acquisition was created by a set of four volume scans, including a total of two horizontal and a set of two vertical gratings (a total of 933 120 A-scans). Kraus *et al* ([@b7-mmr-17-02-2335]) has shown that it is based on the use of an algorithm for orthogonal scan alignment to correct motion artifacts. The system used RTVue XR to create the OCTA images ([@b8-mmr-17-02-2335]). Simply put, it is an algorithm for computing the correlation of the amplitude of a series of spots from the same pixel at the same location. The correlation in the speckle amplitude can be related to the cardiac cycle from the motion of the blood vessels or the pulsating motion of the whole retina. In contrast to the OCT beam moving toward the vertical moving blood cells, the eye pulsations occur along the axial direction. The resolution of the asymmetric OCT system, in which the axial resolution is typically 3 to 5 times higher than the lateral resolution, results in higher sensitivity to tissue motion than the axial resolution. In order to improve the signal-to-noise ratio of detection, the RTVue XR Avanti system utilizes four different frequency bandwidths of OCT to reduce the noise of the axial motion. This modification creates four voxel data sets with the same resolution (20×20×20 M instead of 20×20×5 M in full spectrum light source). Decorrelation of each pixel is performed at each frequency band to calculate the average increased traffic signal. High-resolution correlation is the value of low correlated speckle amplitude derived from blood flow, tissue motion and background noise. Decorrelation signal reduces the outliers (too high decorrelation) and the zero correlation value of the arbitrarily assigned voxel backscatter amplitude is lower than the threshold value ([@b8-mmr-17-02-2335]). Because of the influence of liquid in the macular area of CSCR patient, the deep layer intra-retinal of OCTA image was not clear. ### Statistical analysis All data were analyzed with a statistical package (Statistica, v7.1; StatSoft, Inc, Tulsa, OK, USA), MedCalc software (v10; MedCalc Software, Mariakerke, Belgium). Continuous variables were presented as mean ± standard deviation (SD). One-way analysis of variance (ANOVA) was used to analyze superficial vessel density in sectors between groups. Least significant difference post hoc tests were used to assess the pairwise difference. P\<0.05 was considered to indicate a statistically significant difference. The G \*Power 3.0.10 software was used for the power calculation, which has statistical power (n=15) in the present study. The receiver operating characteristic (ROC) curve was plotted for the proposed superficial retinal vessel density in differentiating between healthy and diseased subjects. Results ======= ### Patients before treatment Study population statistics are shown in [Table I](#tI-mmr-17-02-2335){ref-type="table"}. CSCR group (n=15) and control group (n=15) were not statistically significant (P\>0.05) in gender, age, axial length, diastolic blood pressure, systolic blood pressure, heart rate, but there was significant difference in macular edema diameter (P\<0.05). ### Macular vascular density Firstly, we compared the density of superficial microvascular (SMIR), superficial macrovascular ring (SMAR) and superficial total microvascular (STMI) in both groups. We found that compared with the control group, the density of SMIR and STMI was significantly decreased in CSCR patients (P\<0.05), while the density of SMAR was not significantly changed ([Fig. 2A](#f2-mmr-17-02-2335){ref-type="fig"}). Secondly, we used the hemispheric partition ([Fig. 1C and F](#f1-mmr-17-02-2335){ref-type="fig"}) and Early Treatment Diabetic Retinopathy Study (ETDRS) method ([Fig. 1B and E](#f1-mmr-17-02-2335){ref-type="fig"}) to compare the density of SMIR, and we found that the two partition methods were not significant different (P\>0.05, [Fig. 2B and C](#f2-mmr-17-02-2335){ref-type="fig"}), indicating there was no quadrant changes in the density of SMIR. Lastly, we used the ring partition method ([Fig. 1A and D](#f1-mmr-17-02-2335){ref-type="fig"}) to compare the microvascular density. The results showed that there was a significant decrease in the density of blood vessels in C1 partition (P\<0.05, [Fig. 2D](#f2-mmr-17-02-2335){ref-type="fig"}). There was also a decreasing trend in other partitions, but not statistically significant (P\>0.05). ### ROC analysis of superficial retinal microvessel density The vessel density of the superficial retina provided by OCTA had the best sensitivity-specificity pairs for differentiating CSCR from controls. The density of SMIR had the highest positive likelihood ratios in the CSCR group, whereas the C1 density of the superficial retina had the lowest negative likelihood ratio by the annular method. The largest area under the ROC curves was 0.77 ([Fig. 3](#f3-mmr-17-02-2335){ref-type="fig"}). ### Correlation between macular blood vessel density, foveal thickness and visual acuity We analyzed the correlation between SMIR, SMAR, STMI and macular thickness ([Fig. 4](#f4-mmr-17-02-2335){ref-type="fig"}). There was no correlation between the density of SMAR, STMI and visual acuity in the superficial retinal layer (P\>0.05, data not shown). The correlation index of the SMIR density and visual acuity in the CSCR group was −0.544 ([Fig. 4A](#f4-mmr-17-02-2335){ref-type="fig"}). These results suggested that reduced SMIR density in the macular area could affect the visual acuity. The correlation index of macular thickness and visual acuity in the CSCR group was −0.644 (P\<0.05) ([Fig. 4B](#f4-mmr-17-02-2335){ref-type="fig"}), indicating that the changes in the macular thickness would have an affect on visual acuity. Discussion ========== CSCR usually affects young and middle-aged people. Most patients can self heal, but chronic CSCR is persistent, prone to recurring, and has long duration. It can also cause irreversible damage to the patient\'s vision ([@b9-mmr-17-02-2335]). The current studies mainly believe that the original CSCR lesions occur in the choroid, leakage of RPE blood retinal barrier of blood vessels, leading to the occurrence of CSCR ([@b10-mmr-17-02-2335]). This is the first study showing reduced retinal superficial microvessel density in the macular regions of the CSCR patients, providing evidence for a more comprehensive understanding of CSCR. In patients with CSCR, there are usually one or a few small areas of serous retinal pigment epithelial detachment in the macular region. Prunte *et al* found that choroidal capillary lobules and their venous blood retention were related to the pigment epithelium detachment and leakage ([@b11-mmr-17-02-2335]). ICGA found that CSC patients had not only changes of RPE leakage, but also delayed perfusion of the choroid, dilation of choroidal capillary and vein, increased choroidal vascular permeability, pigment epithelial detachment (PED) and recessive pigment epithelial detachment ([@b12-mmr-17-02-2335]). According to the pathogenesis of CSCR proposed by Caccavale: Many factors lead to vasoconstriction and capillary congestion, causing decreased vascular bed, increased resistance to blood flow and blood viscosity, and further vascular bed hypoperfusion and increased cavity pressure. These result in increased intraluminal pressure in the stroma of serum and small molecule leakage, further blocking the blood vessels, eventually increasing permeability of the choroid capillary. The exudation by RPE leaks into the subretinal space, causing RPE decompensation and detachment, and finally the formation of CSCR ([@b13-mmr-17-02-2335]). We observed that total macular retinal microvessel density and microvessel density was significantly reduced in CSCR patients compared with the control group, suggesting that CSCR induces changes of choroidal capillary, and may also cause the change of retinal capillaries, but the mechanism needs further study. The present study showed that the density of SMIR in the annular C1 partition was significantly reduced in the CSCR patients, and there was no statistically significance in the C2-C6 partitions, suggesting that the macular retinal vascular density reduction in CSCR patients might be mainly concentrated near central fovea region. However, there was no significant difference in the changes of macular retinal blood vessel density in patients with CSCR, indicating that there was no correlation between macular area and vascular density in patients with CSCR. This might be related to serous detachment caused by CSCR. There are two main retinal blood supply systems. The outer retina is mainly supplied through the choroidal blood circulation, and retinal blood circulation provides supply and nutrition for the inner retina. The blood choriocapillary layer nourishes retinal neuroepithelial layer (layer of retinal neurons to the outer plexiform layer) of the optic nerve, and usually is the only source of nutrition for fovea ([@b14-mmr-17-02-2335]). The retinal blood flow and choroidal blood circulation changes will directly affect the vision of patients. We found that the total macular retinal microvessel density and visual acuity had significant correlation, and reduction of the macular retinal microvascular density did not have effects on visual acuity. That might be because of the difference in disease stage, which needs further investigation with a larger sample size. OCTA plays an important role in the diagnosis of CSCR, because it can not only be used to observe the retinal neuroepithelial layer morphology and the changes of RPE, but also can be used to track the changes of the disease, such as subretinal fluid changes ([@b15-mmr-17-02-2335]). CSCR induces retinal serous detachment, and causes decreased visual acuity, central scotoma, metamorphopsia, dyschromatopsia, decreased visual size and visual contrast sensitivity ([@b9-mmr-17-02-2335],[@b16-mmr-17-02-2335]). And there is a positive correlation between the serous detachment height and vision quality. As a result, OCT tracks disease condition mainly based on observation of changes of retinal thickness and we found that changes of the central macular thickness had a significant influence on visual acuity, which is consistent with previous studies. In this study, OCTA showed accumulation of subretinal fluid, RPE layer defects, and a typical dye leakage from the choroid into the subretinal space in CSCR patients. In most cases, the prognosis was good, with spontaneous regression and good visual acuity. However, some patients might suffer from vision impairment, which might be due to a recurrence of the disease or a secondary angiogenesis ([@b17-mmr-17-02-2335]). Filho *et al* reported that OCTA had higher sensitivity and specificity compared with FAA detection of chronic CSCR in CNV ([@b18-mmr-17-02-2335]). The reduction of retinal vascular network in CSCR patients is regarded as an indicator of the progression of macular degeneration, which is usually manifested as retinal vascular disease. Changes of visual acuity occur in the early onset of macular degeneration. CSCR manifested in OCTA as granular inhomogeneous high reflection with small pieces of dark area at the choriocapillary level, and 70% of the patients with high reflection region matched with the high permeability area as seen with ICGA. RPE CNV could be visualized by OCTA in 21% patients with double signs of CSCR. OCTA can be used in the follow-up of patients with CSCR, and can better show the choroidal ischemia after PDT. The development of OCTA can promote our understanding of the pathogenesis of CSCR ([@b19-mmr-17-02-2335]). Carlo *et al* ([@b20-mmr-17-02-2335]) used OCTA to observe the irregular shedding of RPE in CSCR patients, and found that CSCR patients showed increased possibility of angiogenesis in irregular vascular RPE shedding, which is helpful for the treatment. Shozo *et al* ([@b21-mmr-17-02-2335]) found that inflammation at the high level of choroid reflex in the acute phase of CSCR was associated with edema. The high reflecting area outside the choroid is the expansion of the vascular lumen of the great vessels, regardless of the onset of CSCR. Feucht *et al* ([@b22-mmr-17-02-2335]) found no changes in the blood flow parameters associated with acute CSCR leakage in the OCTA images of the superficial and deep retinal nerve plexus, the outer retina, and the choroidal capillaries. But the changes of intraocular choroidal blood flow could be quantified. Studies ([@b23-mmr-17-02-2335]) have shown that retinal abnormalities, especially lattice degeneration, are often seen in patients with CSCR. Therefore, the authors suggested that CSCR patients should be regularly examined for the retinal health, including the assessment of the peripheral retina. There are some inadequacies in the present study. For example, we only observed the density of SMIR, SMAR and SC1 changes in the macular of patients with CSCR. Whether it is consistent with choroidal microvascular changes, or happens before or after the choroidal microvascular changes, and whether it can be used as an early indicator of self-healing remain to be further explored. This work was supported by grants from the National Natural Science Foundation of China \[NSFC no. 81160118 (Yi Sh), 81460092 (Yi Sh) and 81660152 (Yi Sh)\]. {#f1-mmr-17-02-2335} {#f2-mmr-17-02-2335} {#f3-mmr-17-02-2335} {#f4-mmr-17-02-2335} ###### Baseline characteristics of patients in the study. Variables HCs CSCR ------------------------ ----------- ----------- Age (range, years) 49±6 48±8 Sex ratio, male:female 5:10 7:8 RE (range, diopters) 1.00±0.90 5.00±1.00 0\~-2.75 −3\~-5.75 AL (mm) 23.54 24.01 SBP (mmHg) 119±8 117±12 DBP (mmHg) 78±9 80±11 HR 78±12 76±14 Macular volume 0 1.18±0.31 Results are presented as the mean ± standard deviation. AL, axial length; CSCR, central serous chorioretinopathy; DBP, diastolic blood pressure; HR, heart rate; RE, refraction diopter; SBP, Systolic blood pressure; and SD, Standard deviation. \*P\<0.05 HCs vs. CSCR.

To nab your preferred makeup artist and hair stylist, schedule at least five months out. Just keep in mind that if your wedding is on a Saturday during peak wedding season (late spring through early fall), you should probably plan even farther ahead. You’ll also want to set up consultations/trials – your style preferences may change as you get closer to the big day, so shoot for four to six weeks out. If you’ve opted for trials, Gina Ludwig, owner of Hair Comes the Bride, which sells bridal accessories, and beauty services, recommends bringing images from magazines to illustrate design ideas you like (or don’t like). It also can be helpful to bring pictures of your dress. For the makeup trial, wear a white T-shirt to simulate what your face will look like with your gown, or asking the artist to wrap a white towel around your neck. Arrive with a clean, well-hydrated and exfoliated face to ensure that the makeup sits more evenly on the skin. For the hair trial, Ludwig also likes brides to show up with clean, dry hair. “It’s easy for the stylist to ‘dirty up’ hair with product, but if hair is too dirty or oily, it’s very hard to style,” Ludwig says. The best look for you depends on your coloring, facial features, haircut and personality, but right now we love shimmery peach/bronze shadows (especially on blue eyes or for summer soirées), paired with bronzed skin, peachy cheeks and glossy lips, and also retro looks. For hair, Ludwig is a fan of the classic styles of the ’20s, ’40s and even ’50s, as well as softer, easy, deconstructed styles, which she feels are more flattering on most brides. “I think it’s important for guests to notice how gorgeous a bride looks, not how gorgeous her hair and makeup looks.”

from __future__ import division, print_function, absolute_import import numpy as np from numpy.testing import assert_equal, assert_allclose, assert_ from scipy.sparse.linalg.isolve import minres import pytest from pytest import raises as assert_raises from .test_iterative import assert_normclose def get_sample_problem(): # A random 10 x 10 symmetric matrix np.random.seed(1234) matrix = np.random.rand(10, 10) matrix = matrix + matrix.T # A random vector of length 10 vector = np.random.rand(10) return matrix, vector def test_singular(): A, b = get_sample_problem() A[0, ] = 0 b[0] = 0 xp, info = minres(A, b) assert_equal(info, 0) assert_normclose(A.dot(xp), b, tol=1e-5) @pytest.mark.skip(reason="Skip Until gh #6843 is fixed") def test_gh_6843(): """check if x0 is being used by tracing iterates""" A, b = get_sample_problem() # Random x0 to feed minres np.random.seed(12345) x0 = np.random.rand(10) trace = [] def trace_iterates(xk): trace.append(xk) minres(A, b, x0=x0, callback=trace_iterates) trace_with_x0 = trace trace = [] minres(A, b, callback=trace_iterates) assert_(not np.array_equal(trace_with_x0[0], trace[0])) def test_shift(): A, b = get_sample_problem() shift = 0.5 shifted_A = A - shift * np.eye(10) x1, info1 = minres(A, b, shift=shift) x2, info2 = minres(shifted_A, b) assert_equal(info1, 0) assert_allclose(x1, x2, rtol=1e-5) def test_asymmetric_fail(): """Asymmetric matrix should raise `ValueError` when check=True""" A, b = get_sample_problem() A[1, 2] = 1 A[2, 1] = 2 with assert_raises(ValueError): xp, info = minres(A, b, check=True)

Development and testing of a new measure of case mix for use in office practice. Case mix has been shown to be of critical importance in studies of effectiveness and quality of care using health outcomes. How these variables are defined, combined, and used to adjust or increase precision in tests for differences in health outcomes has been a source of controversy. Because existing measures were developed to adjust mortality and have marginal relevance for the adjustment of functional status outcomes, especially in ambulatory settings, the authors developed a measure of case (or patient) mix that is specifically designed to adjust functional status outcomes measured in office practice or out-of-hospital settings. This measure, developed as part of Type II Diabetes Patient Outcomes Research Team project, uses patients' reports of symptoms and conditions, as well as patients' ratings of symptom intensity to characterize total disease burden. It differs from other measures of case mix in lack of dependence on diagnoses. Separate measures were developed for each of 15 different disease categories (e.g., chronic lung disease) grouped by body system affected. Within each measure, questionnaire items were combined to rate the severity of that disease on a 1 to 4 scale, according to definitions provided by clinicians. A single, global measure was developed by aggregating the 15 measures, weighted according to the expected impact of each disease category on functional outcomes and disability. In a sample of 1,738 patients, significant relationships were observed between the global case mix measure and functional status, disability days, and service utilization.(ABSTRACT TRUNCATED AT 250 WORDS)

Troponin elevation in subarachnoid hemorrhage does not impact in-hospital mortality. Cardiac dysfunction is a well-known complication of subarachnoid hemorrhage (SAH). Our objective was to determine the frequency of troponin abnormalities in SAH and determine its impact on in-hospital mortality. With IRB approval, we retrospectively reviewed 225 consecutive SAH patients admitted to our institution from August 1, 2006 to June 1, 2009. Traumatic SAH patients were excluded. Data were collected on demographics, Hunt and Hess score (HH), in-hospital mortality, and peak troponin values on admission. CT images were independently reviewed and graded by the study neurologist for Fisher grade (FG) and the presence of intraventricular hemorrhage (IVH). Among the 225 SAH patients, the mean age was 57.3 years (range, 21-90). The majority of patients were female (67%), FG 3 (75%), and had IVH (62%). Among the 201 patients with troponin I values, the mean troponin level was 0.93 (range, 0.01-25.8 ng/mL) and 47 (23%) had elevated troponin I levels. In unadjusted analysis, elevated troponin I level was significantly associated with in-hospital mortality. With multivariable logistic regression adjusting for age, HH, FG, and IVH, elevated troponin I level was no longer associated with in-hospital mortality (p. 0.34). In multivariate analysis, the independent predictors of in-mortality were age and severe grade HH (4-5). Troponin I elevation after SAH is not an independent predictor of in-hospital mortality.

# $Id$ # Authority: shuff # Upstream: Khemir Nadim ibn Hamouda <nadim$khemir,net> %define perl_vendorlib %(eval "`%{__perl} -V:installvendorlib`"; echo $installvendorlib) %define perl_vendorarch %(eval "`%{__perl} -V:installvendorarch`"; echo $installvendorarch) %define real_name Data-TreeDumper-Renderer-GTK Summary: Gtk2::TreeView renderer for Data::TreeDumper Name: perl-%{real_name} Version: 0.02 Release: 1%{?dist} License: Artistic/GPL Group: Applications/CPAN URL: http://search.cpan.org/dist/Data-TreeDumper-Renderer-GTK/ Source: http://search.cpan.org/CPAN/authors/id/N/NK/NKH/Data-TreeDumper-Renderer-GTK-%{version}.tar.gz BuildRoot: %{_tmppath}/%{name}-%{version}-%{release}-root BuildArch: noarch BuildRequires: perl BuildRequires: perl(Cairo) BuildRequires: perl(Data::TreeDumper) >= 0.33 BuildRequires: perl(ExtUtils::MakeMaker) BuildRequires: perl(Glib) BuildRequires: perl(Gtk2) BuildRequires: rpm-macros-rpmforge Requires: perl Requires: perl(Cairo) Requires: perl(Data::TreeDumper) >= 0.33 Requires: perl(Glib) Requires: perl(Gtk2) ### remove autoreq Perl dependencies %filter_from_requires /^perl.*/d %filter_setup %description This widget is the gui equivalent of Data::TreeDumper; it will display a perl data structure in a TreeView, allowing you to fold and unfold child data structures and get a quick feel for what's where. Right-clicking anywhere in the view brings up a context menu, from which the user can choose to expand or collapse all items. %prep %setup -n %{real_name}-%{version} %build %{__perl} Makefile.PL INSTALLDIRS="vendor" PREFIX="%{buildroot}%{_prefix}" %{__make} %{?_smp_mflags} %install %{__rm} -rf %{buildroot} %{__make} pure_install ### Clean up buildroot find %{buildroot} -name .packlist -exec %{__rm} {} \; %clean %{__rm} -rf %{buildroot} %files %defattr(-, root, root, 0755) %doc Changes MANIFEST README Todo %doc %{_mandir}/man?/* %dir %{perl_vendorlib}/Data/TreeDumper/Renderer/ %{perl_vendorlib}/Data/TreeDumper/Renderer/* %{perl_vendorlib}/auto/Data/TreeDumper/Renderer/* %changelog * Thu Mar 18 2010 Steve Huff <[email protected]> - 0.02-1 - Initial version.

# Test Upgrade from old version 5727 # Stop DB server which was created by MTR default # Copy and unzip old version data directory. List all files before upgrade ----------------------------- table_part_1#p#p0.ibd table_part_1#p#p1.ibd table_part_1#p#p2.ibd table_part_1#p#p3.ibd table_part_1#p#p4.ibd table_part_1.frm table_part_2#p#p0.ibd table_part_2#p#p1.ibd table_part_2#p#p2.ibd table_part_2#p#p3.ibd table_part_2#p#p4.ibd table_part_2.frm table_part_@005c_special_@002f_sub_@003f_3#p#part_@002f_3#sp#sub_@003f@002f_5.ibd table_part_@005c_special_@002f_sub_@003f_3#p#part_@002f_3#sp#sub_@005c@002f@003f_6.ibd table_part_@005c_special_@002f_sub_@003f_3#p#part_@003f_1#sp#sub_@002f_2.ibd table_part_@005c_special_@002f_sub_@003f_3#p#part_@003f_1#sp#sub_@003f_1.ibd table_part_@005c_special_@002f_sub_@003f_3#p#part_@005c_2#sp#sub_@003f@005c_4.ibd table_part_@005c_special_@002f_sub_@003f_3#p#part_@005c_2#sp#sub_@005c_3.ibd table_part_@005c_special_@002f_sub_@003f_3.frm table_part_cap_6#p#p0.ibd table_part_cap_6#p#p1.ibd table_part_cap_6#p#p2.ibd table_part_cap_6#p#p3.ibd table_part_cap_6#p#p4.ibd table_part_cap_6.frm table_part_nopart_cap_7.frm table_part_sub_1#p#part_1#sp#part_1sp0.ibd table_part_sub_1#p#part_1#sp#part_1sp1.ibd table_part_sub_1#p#part_2#sp#part_2sp0.ibd table_part_sub_1#p#part_2#sp#part_2sp1.ibd table_part_sub_1#p#part_3#sp#part_3sp0.ibd table_part_sub_1#p#part_3#sp#part_3sp1.ibd table_part_sub_1#p#part_4#sp#part_4sp0.ibd table_part_sub_1#p#part_4#sp#part_4sp1.ibd table_part_sub_1.frm table_part_sub_2#p#part_1#sp#sub_1.ibd table_part_sub_2#p#part_1#sp#sub_2.ibd table_part_sub_2#p#part_2#sp#sub_3.ibd table_part_sub_2#p#part_2#sp#sub_4.ibd table_part_sub_2#p#part_3#sp#sub_5.ibd table_part_sub_2#p#part_3#sp#sub_6.ibd table_part_sub_2.frm # Upgrade to latest mysql version List all files of upgraded data ------------------------------- table_part_1#p#p0.ibd table_part_1#p#p1.ibd table_part_1#p#p2.ibd table_part_1#p#p3.ibd table_part_1#p#p4.ibd table_part_2#p#p0.ibd table_part_2#p#p1.ibd table_part_2#p#p2.ibd table_part_2#p#p3.ibd table_part_2#p#p4.ibd table_part_@005c_special_@002f_sub_@003f_3#p#part_@002f_3#sp#sub_@003f@002f_5.ibd table_part_@005c_special_@002f_sub_@003f_3#p#part_@002f_3#sp#sub_@005c@002f@003f_6.ibd table_part_@005c_special_@002f_sub_@003f_3#p#part_@003f_1#sp#sub_@002f_2.ibd table_part_@005c_special_@002f_sub_@003f_3#p#part_@003f_1#sp#sub_@003f_1.ibd table_part_@005c_special_@002f_sub_@003f_3#p#part_@005c_2#sp#sub_@003f@005c_4.ibd table_part_@005c_special_@002f_sub_@003f_3#p#part_@005c_2#sp#sub_@005c_3.ibd table_part_cap_6#p#p0.ibd table_part_cap_6#p#p1.ibd table_part_cap_6#p#p2.ibd table_part_cap_6#p#p3.ibd table_part_cap_6#p#p4.ibd table_part_sub_1#p#part_1#sp#part_1sp0.ibd table_part_sub_1#p#part_1#sp#part_1sp1.ibd table_part_sub_1#p#part_2#sp#part_2sp0.ibd table_part_sub_1#p#part_2#sp#part_2sp1.ibd table_part_sub_1#p#part_3#sp#part_3sp0.ibd table_part_sub_1#p#part_3#sp#part_3sp1.ibd table_part_sub_1#p#part_4#sp#part_4sp0.ibd table_part_sub_1#p#part_4#sp#part_4sp1.ibd table_part_sub_2#p#part_1#sp#sub_1.ibd table_part_sub_2#p#part_1#sp#sub_2.ibd table_part_sub_2#p#part_2#sp#sub_3.ibd table_part_sub_2#p#part_2#sp#sub_4.ibd table_part_sub_2#p#part_3#sp#sub_5.ibd table_part_sub_2#p#part_3#sp#sub_6.ibd # A. Validate upgraded tables and data # 1. Check table metadata and data Checking partitioned tables --------------------------- SET NAMES utf8mb4 COLLATE utf8mb4_0900_as_cs; CHECK TABLE table_part_1; Table Op Msg_type Msg_text test.table_part_1 check status OK SHOW CREATE TABLE table_part_1; Table Create Table table_part_1 CREATE TABLE `table_part_1` ( `id` int NOT NULL, `value` int DEFAULT NULL, `name` varchar(32) DEFAULT NULL, `data` blob, PRIMARY KEY (`id`), KEY `k1` (`value`) ) ENGINE=InnoDB DEFAULT CHARSET=latin1 /*!50100 PARTITION BY HASH (`id`) PARTITIONS 5 */ SELECT id, value, name, SUBSTRING(data, 1024, 32) FROM table_part_1 order by id; id value name SUBSTRING(data, 1024, 32) 0 55 Row - 0 ta - 0Large Column Data - 0Large 1 155 Row - 1 ta - 1Large Column Data - 1Large 2 255 Row - 2 ta - 2Large Column Data - 2Large 3 355 Row - 3 ta - 3Large Column Data - 3Large 4 455 Row - 4 ta - 4Large Column Data - 4Large 5 555 Row - 5 ta - 5Large Column Data - 5Large 6 655 Row - 6 ta - 6Large Column Data - 6Large 7 755 Row - 7 ta - 7Large Column Data - 7Large 8 855 Row - 8 ta - 8Large Column Data - 8Large 9 955 Row - 9 ta - 9Large Column Data - 9Large CHECK TABLE table_part_sub_1; Table Op Msg_type Msg_text test.table_part_sub_1 check status OK SHOW CREATE TABLE table_part_sub_1; Table Create Table table_part_sub_1 CREATE TABLE `table_part_sub_1` ( `id` int NOT NULL, `value` int NOT NULL, `name` varchar(32) DEFAULT NULL, `data` blob, PRIMARY KEY (`id`,`value`), KEY `k1` (`value`) ) ENGINE=InnoDB DEFAULT CHARSET=latin1 /*!50100 PARTITION BY RANGE (`value`) SUBPARTITION BY HASH (`id`) SUBPARTITIONS 2 (PARTITION Part_1 VALUES LESS THAN (101) ENGINE = InnoDB, PARTITION pArt_2 VALUES LESS THAN (401) ENGINE = InnoDB, PARTITION part_3 VALUES LESS THAN (701) ENGINE = InnoDB, PARTITION PART_4 VALUES LESS THAN MAXVALUE ENGINE = InnoDB) */ SELECT id, value, name, SUBSTRING(data, 1024, 32) FROM table_part_sub_1 order by id; id value name SUBSTRING(data, 1024, 32) 0 55 Row - 0 ta - 0Large Column Data - 0Large 1 155 Row - 1 ta - 1Large Column Data - 1Large 2 255 Row - 2 ta - 2Large Column Data - 2Large 3 355 Row - 3 ta - 3Large Column Data - 3Large 4 455 Row - 4 ta - 4Large Column Data - 4Large 5 555 Row - 5 ta - 5Large Column Data - 5Large 6 655 Row - 6 ta - 6Large Column Data - 6Large 7 755 Row - 7 ta - 7Large Column Data - 7Large 8 855 Row - 8 ta - 8Large Column Data - 8Large 9 955 Row - 9 ta - 9Large Column Data - 9Large CHECK TABLE table_part_sub_2; Table Op Msg_type Msg_text test.table_part_sub_2 check status OK SHOW CREATE TABLE table_part_sub_2; Table Create Table table_part_sub_2 CREATE TABLE `table_part_sub_2` ( `id` int NOT NULL, `value` int NOT NULL, `name` varchar(32) DEFAULT NULL, `data` blob, PRIMARY KEY (`id`,`value`), KEY `k1` (`value`) ) ENGINE=InnoDB DEFAULT CHARSET=latin1 /*!50100 PARTITION BY RANGE (`value`) SUBPARTITION BY HASH (`id`) (PARTITION Part_1 VALUES LESS THAN (101) (SUBPARTITION Sub_1 ENGINE = InnoDB, SUBPARTITION sUb_2 ENGINE = InnoDB), PARTITION pArt_2 VALUES LESS THAN (501) (SUBPARTITION suB_3 ENGINE = InnoDB, SUBPARTITION SUB_4 ENGINE = InnoDB), PARTITION PART_3 VALUES LESS THAN MAXVALUE (SUBPARTITION SUB_5 ENGINE = InnoDB, SUBPARTITION sub_6 ENGINE = InnoDB)) */ SELECT id, value, name, SUBSTRING(data, 1024, 32) FROM table_part_sub_2 order by id; id value name SUBSTRING(data, 1024, 32) 0 55 Row - 0 ta - 0Large Column Data - 0Large 1 155 Row - 1 ta - 1Large Column Data - 1Large 2 255 Row - 2 ta - 2Large Column Data - 2Large 3 355 Row - 3 ta - 3Large Column Data - 3Large 4 455 Row - 4 ta - 4Large Column Data - 4Large 5 555 Row - 5 ta - 5Large Column Data - 5Large 6 655 Row - 6 ta - 6Large Column Data - 6Large 7 755 Row - 7 ta - 7Large Column Data - 7Large 8 855 Row - 8 ta - 8Large Column Data - 8Large 9 955 Row - 9 ta - 9Large Column Data - 9Large CHECK TABLE `table_part_\_special_/_sub_?_3`; Table Op Msg_type Msg_text test.table_part_\_special_/_sub_?_3 check status OK SHOW CREATE TABLE `table_part_\_special_/_sub_?_3`; Table Create Table table_part_\_special_/_sub_?_3 CREATE TABLE `table_part_\_special_/_sub_?_3` ( `id` int NOT NULL, `value` int NOT NULL, `name` varchar(32) DEFAULT NULL, `data` blob, PRIMARY KEY (`id`,`value`), KEY `k1` (`value`) ) ENGINE=InnoDB DEFAULT CHARSET=latin1 /*!50100 PARTITION BY RANGE (`value`) SUBPARTITION BY HASH (`id`) (PARTITION `Part_?_1` VALUES LESS THAN (201) (SUBPARTITION `Sub_?_1` ENGINE = InnoDB, SUBPARTITION `sUb_/_2` ENGINE = InnoDB), PARTITION `pArt_\_2` VALUES LESS THAN (501) (SUBPARTITION `suB_\_3` ENGINE = InnoDB, SUBPARTITION `SUB_?\_4` ENGINE = InnoDB), PARTITION `PART_/_3` VALUES LESS THAN MAXVALUE (SUBPARTITION `SUB_?/_5` ENGINE = InnoDB, SUBPARTITION `sub_\/?_6` ENGINE = InnoDB)) */ SELECT id, value, name, SUBSTRING(data, 1024, 32) FROM `table_part_\_special_/_sub_?_3` order by id; id value name SUBSTRING(data, 1024, 32) 0 55 Row - 0 ta - 0Large Column Data - 0Large 1 155 Row - 1 ta - 1Large Column Data - 1Large 2 255 Row - 2 ta - 2Large Column Data - 2Large 3 355 Row - 3 ta - 3Large Column Data - 3Large 4 455 Row - 4 ta - 4Large Column Data - 4Large 5 555 Row - 5 ta - 5Large Column Data - 5Large 6 655 Row - 6 ta - 6Large Column Data - 6Large 7 755 Row - 7 ta - 7Large Column Data - 7Large 8 855 Row - 8 ta - 8Large Column Data - 8Large 9 955 Row - 9 ta - 9Large Column Data - 9Large CHECK TABLE table_part_2; Table Op Msg_type Msg_text test.table_part_2 check status OK SHOW CREATE TABLE table_part_2; Table Create Table table_part_2 CREATE TABLE `table_part_2` ( `id` int NOT NULL, `value` int DEFAULT NULL, `name` varchar(32) DEFAULT NULL, `data` blob, PRIMARY KEY (`id`), KEY `k1` (`value`) ) ENGINE=InnoDB DEFAULT CHARSET=latin1 /*!50100 PARTITION BY HASH (`id`) PARTITIONS 5 */ SELECT id, value, name, SUBSTRING(data, 1024, 32) FROM table_part_2 order by id; id value name SUBSTRING(data, 1024, 32) 0 55 Row - 0 ta - 0Large Column Data - 0Large 1 155 Row - 1 ta - 1Large Column Data - 1Large 2 255 Row - 2 ta - 2Large Column Data - 2Large 3 355 Row - 3 ta - 3Large Column Data - 3Large 4 455 Row - 4 ta - 4Large Column Data - 4Large 5 555 Row - 5 ta - 5Large Column Data - 5Large 6 655 Row - 6 ta - 6Large Column Data - 6Large 7 755 Row - 7 ta - 7Large Column Data - 7Large 8 855 Row - 8 ta - 8Large Column Data - 8Large 9 955 Row - 9 ta - 9Large Column Data - 9Large Checking IFS views ------------------ select table_schema, table_name from information_schema.tables where table_name LIKE '%table_part%' order by table_schema, table_name; TABLE_SCHEMA TABLE_NAME test table_part_1 test table_part_2 test table_part_\_special_/_sub_?_3 test table_part_cap_6 test table_part_nopart_cap_7 test table_part_sub_1 test table_part_sub_2 select name, space_type from information_schema.innodb_tables where name LIKE '%table_part%' order by name, space_type; name space_type test/table_part_1#p#p0 Single test/table_part_1#p#p1 Single test/table_part_1#p#p2 Single test/table_part_1#p#p3 Single test/table_part_1#p#p4 Single test/table_part_2#p#p0 Single test/table_part_2#p#p1 Single test/table_part_2#p#p2 Single test/table_part_2#p#p3 Single test/table_part_2#p#p4 Single test/table_part_@005c_special_@002f_sub_@003f_3#p#part_@002f_3#sp#sub_@003f@002f_5 Single test/table_part_@005c_special_@002f_sub_@003f_3#p#part_@002f_3#sp#sub_@005c@002f@003f_6 Single test/table_part_@005c_special_@002f_sub_@003f_3#p#part_@003f_1#sp#sub_@002f_2 Single test/table_part_@005c_special_@002f_sub_@003f_3#p#part_@003f_1#sp#sub_@003f_1 Single test/table_part_@005c_special_@002f_sub_@003f_3#p#part_@005c_2#sp#sub_@003f@005c_4 Single test/table_part_@005c_special_@002f_sub_@003f_3#p#part_@005c_2#sp#sub_@005c_3 Single test/table_part_cap_6#p#p0 Single test/table_part_cap_6#p#p1 Single test/table_part_cap_6#p#p2 Single test/table_part_cap_6#p#p3 Single test/table_part_cap_6#p#p4 Single test/table_part_nopart_cap_7 General test/table_part_sub_1#p#part_1#sp#part_1sp0 Single test/table_part_sub_1#p#part_1#sp#part_1sp1 Single test/table_part_sub_1#p#part_2#sp#part_2sp0 Single test/table_part_sub_1#p#part_2#sp#part_2sp1 Single test/table_part_sub_1#p#part_3#sp#part_3sp0 Single test/table_part_sub_1#p#part_3#sp#part_3sp1 Single test/table_part_sub_1#p#part_4#sp#part_4sp0 Single test/table_part_sub_1#p#part_4#sp#part_4sp1 Single test/table_part_sub_2#p#part_1#sp#sub_1 Single test/table_part_sub_2#p#part_1#sp#sub_2 Single test/table_part_sub_2#p#part_2#sp#sub_3 Single test/table_part_sub_2#p#part_2#sp#sub_4 Single test/table_part_sub_2#p#part_3#sp#sub_5 Single test/table_part_sub_2#p#part_3#sp#sub_6 Single select table_schema, table_name, partition_name, subpartition_name from information_schema.partitions where table_name LIKE '%table_part%' order by table_schema, table_name, partition_name, subpartition_name; TABLE_SCHEMA TABLE_NAME PARTITION_NAME SUBPARTITION_NAME test table_part_1 p0 NULL test table_part_1 p1 NULL test table_part_1 p2 NULL test table_part_1 p3 NULL test table_part_1 p4 NULL test table_part_2 p0 NULL test table_part_2 p1 NULL test table_part_2 p2 NULL test table_part_2 p3 NULL test table_part_2 p4 NULL test table_part_\_special_/_sub_?_3 PART_/_3 SUB_?/_5 test table_part_\_special_/_sub_?_3 PART_/_3 sub_\/?_6 test table_part_\_special_/_sub_?_3 Part_?_1 sUb_/_2 test table_part_\_special_/_sub_?_3 Part_?_1 Sub_?_1 test table_part_\_special_/_sub_?_3 pArt_\_2 SUB_?\_4 test table_part_\_special_/_sub_?_3 pArt_\_2 suB_\_3 test table_part_cap_6 p0 NULL test table_part_cap_6 p1 NULL test table_part_cap_6 p2 NULL test table_part_cap_6 p3 NULL test table_part_cap_6 p4 NULL test table_part_nopart_cap_7 NULL NULL test table_part_sub_1 Part_1 Part_1sp0 test table_part_sub_1 Part_1 Part_1sp1 test table_part_sub_1 pArt_2 pArt_2sp0 test table_part_sub_1 pArt_2 pArt_2sp1 test table_part_sub_1 part_3 part_3sp0 test table_part_sub_1 part_3 part_3sp1 test table_part_sub_1 PART_4 PART_4sp0 test table_part_sub_1 PART_4 PART_4sp1 test table_part_sub_2 Part_1 Sub_1 test table_part_sub_2 Part_1 sUb_2 test table_part_sub_2 pArt_2 suB_3 test table_part_sub_2 pArt_2 SUB_4 test table_part_sub_2 PART_3 SUB_5 test table_part_sub_2 PART_3 sub_6 select name from information_schema.innodb_tablespaces where name LIKE '%table_part%' order by name; name test/table_part_1#p#p0 test/table_part_1#p#p1 test/table_part_1#p#p2 test/table_part_1#p#p3 test/table_part_1#p#p4 test/table_part_2#p#p0 test/table_part_2#p#p1 test/table_part_2#p#p2 test/table_part_2#p#p3 test/table_part_2#p#p4 test/table_part_cap_6#p#p0 test/table_part_cap_6#p#p1 test/table_part_cap_6#p#p2 test/table_part_cap_6#p#p3 test/table_part_cap_6#p#p4 test/table_part_sub_1#p#part_1#sp#part_1sp0 test/table_part_sub_1#p#part_1#sp#part_1sp1 test/table_part_sub_1#p#part_2#sp#part_2sp0 test/table_part_sub_1#p#part_2#sp#part_2sp1 test/table_part_sub_1#p#part_3#sp#part_3sp0 test/table_part_sub_1#p#part_3#sp#part_3sp1 test/table_part_sub_1#p#part_4#sp#part_4sp0 test/table_part_sub_1#p#part_4#sp#part_4sp1 test/table_part_sub_2#p#part_1#sp#sub_1 test/table_part_sub_2#p#part_1#sp#sub_2 test/table_part_sub_2#p#part_2#sp#sub_3 test/table_part_sub_2#p#part_2#sp#sub_4 test/table_part_sub_2#p#part_3#sp#sub_5 test/table_part_sub_2#p#part_3#sp#sub_6 test/table_part_\_special_/_sub_?_3#p#part_/_3#sp#sub_?/_5 test/table_part_\_special_/_sub_?_3#p#part_/_3#sp#sub_\/?_6 test/table_part_\_special_/_sub_?_3#p#part_?_1#sp#sub_/_2 test/table_part_\_special_/_sub_?_3#p#part_?_1#sp#sub_?_1 test/table_part_\_special_/_sub_?_3#p#part_\_2#sp#sub_?\_4 test/table_part_\_special_/_sub_?_3#p#part_\_2#sp#sub_\_3 select file_type, status, file_name, tablespace_name from information_schema.files where file_name LIKE '%table_part%' order by file_type, status, file_name, tablespace_name; FILE_TYPE STATUS FILE_NAME TABLESPACE_NAME TABLESPACE NORMAL ./test/table_part_1#p#p0.ibd test/table_part_1#p#p0 TABLESPACE NORMAL ./test/table_part_1#p#p1.ibd test/table_part_1#p#p1 TABLESPACE NORMAL ./test/table_part_1#p#p2.ibd test/table_part_1#p#p2 TABLESPACE NORMAL ./test/table_part_1#p#p3.ibd test/table_part_1#p#p3 TABLESPACE NORMAL ./test/table_part_1#p#p4.ibd test/table_part_1#p#p4 TABLESPACE NORMAL ./test/table_part_2#p#p0.ibd test/table_part_2#p#p0 TABLESPACE NORMAL ./test/table_part_2#p#p1.ibd test/table_part_2#p#p1 TABLESPACE NORMAL ./test/table_part_2#p#p2.ibd test/table_part_2#p#p2 TABLESPACE NORMAL ./test/table_part_2#p#p3.ibd test/table_part_2#p#p3 TABLESPACE NORMAL ./test/table_part_2#p#p4.ibd test/table_part_2#p#p4 TABLESPACE NORMAL ./test/table_part_@005c_special_@002f_sub_@003f_3#p#part_@002f_3#sp#sub_@003f@002f_5.ibd test/table_part_\_special_/_sub_?_3#p#part_/_3#sp#sub_?/_5 TABLESPACE NORMAL ./test/table_part_@005c_special_@002f_sub_@003f_3#p#part_@002f_3#sp#sub_@005c@002f@003f_6.ibd test/table_part_\_special_/_sub_?_3#p#part_/_3#sp#sub_\/?_6 TABLESPACE NORMAL ./test/table_part_@005c_special_@002f_sub_@003f_3#p#part_@003f_1#sp#sub_@002f_2.ibd test/table_part_\_special_/_sub_?_3#p#part_?_1#sp#sub_/_2 TABLESPACE NORMAL ./test/table_part_@005c_special_@002f_sub_@003f_3#p#part_@003f_1#sp#sub_@003f_1.ibd test/table_part_\_special_/_sub_?_3#p#part_?_1#sp#sub_?_1 TABLESPACE NORMAL ./test/table_part_@005c_special_@002f_sub_@003f_3#p#part_@005c_2#sp#sub_@003f@005c_4.ibd test/table_part_\_special_/_sub_?_3#p#part_\_2#sp#sub_?\_4 TABLESPACE NORMAL ./test/table_part_@005c_special_@002f_sub_@003f_3#p#part_@005c_2#sp#sub_@005c_3.ibd test/table_part_\_special_/_sub_?_3#p#part_\_2#sp#sub_\_3 TABLESPACE NORMAL ./test/table_part_cap_6#p#p0.ibd test/table_part_cap_6#p#p0 TABLESPACE NORMAL ./test/table_part_cap_6#p#p1.ibd test/table_part_cap_6#p#p1 TABLESPACE NORMAL ./test/table_part_cap_6#p#p2.ibd test/table_part_cap_6#p#p2 TABLESPACE NORMAL ./test/table_part_cap_6#p#p3.ibd test/table_part_cap_6#p#p3 TABLESPACE NORMAL ./test/table_part_cap_6#p#p4.ibd test/table_part_cap_6#p#p4 TABLESPACE NORMAL ./test/table_part_sub_1#p#part_1#sp#part_1sp0.ibd test/table_part_sub_1#p#part_1#sp#part_1sp0 TABLESPACE NORMAL ./test/table_part_sub_1#p#part_1#sp#part_1sp1.ibd test/table_part_sub_1#p#part_1#sp#part_1sp1 TABLESPACE NORMAL ./test/table_part_sub_1#p#part_2#sp#part_2sp0.ibd test/table_part_sub_1#p#part_2#sp#part_2sp0 TABLESPACE NORMAL ./test/table_part_sub_1#p#part_2#sp#part_2sp1.ibd test/table_part_sub_1#p#part_2#sp#part_2sp1 TABLESPACE NORMAL ./test/table_part_sub_1#p#part_3#sp#part_3sp0.ibd test/table_part_sub_1#p#part_3#sp#part_3sp0 TABLESPACE NORMAL ./test/table_part_sub_1#p#part_3#sp#part_3sp1.ibd test/table_part_sub_1#p#part_3#sp#part_3sp1 TABLESPACE NORMAL ./test/table_part_sub_1#p#part_4#sp#part_4sp0.ibd test/table_part_sub_1#p#part_4#sp#part_4sp0 TABLESPACE NORMAL ./test/table_part_sub_1#p#part_4#sp#part_4sp1.ibd test/table_part_sub_1#p#part_4#sp#part_4sp1 TABLESPACE NORMAL ./test/table_part_sub_2#p#part_1#sp#sub_1.ibd test/table_part_sub_2#p#part_1#sp#sub_1 TABLESPACE NORMAL ./test/table_part_sub_2#p#part_1#sp#sub_2.ibd test/table_part_sub_2#p#part_1#sp#sub_2 TABLESPACE NORMAL ./test/table_part_sub_2#p#part_2#sp#sub_3.ibd test/table_part_sub_2#p#part_2#sp#sub_3 TABLESPACE NORMAL ./test/table_part_sub_2#p#part_2#sp#sub_4.ibd test/table_part_sub_2#p#part_2#sp#sub_4 TABLESPACE NORMAL ./test/table_part_sub_2#p#part_3#sp#sub_5.ibd test/table_part_sub_2#p#part_3#sp#sub_5 TABLESPACE NORMAL ./test/table_part_sub_2#p#part_3#sp#sub_6.ibd test/table_part_sub_2#p#part_3#sp#sub_6 Checking Innodb stat tables --------------------------- select database_name, table_name from mysql.innodb_table_stats where table_name like '%table_part%' order by database_name, table_name; database_name table_name test table_part_1#p#p0 test table_part_1#p#p1 test table_part_1#p#p2 test table_part_1#p#p3 test table_part_1#p#p4 test table_part_2#p#p0 test table_part_2#p#p1 test table_part_2#p#p2 test table_part_2#p#p3 test table_part_2#p#p4 test table_part_\_special_/_sub_?_3#p#part_/_3#sp#sub_?/_5 test table_part_\_special_/_sub_?_3#p#part_/_3#sp#sub_\/?_6 test table_part_\_special_/_sub_?_3#p#part_?_1#sp#sub_/_2 test table_part_\_special_/_sub_?_3#p#part_?_1#sp#sub_?_1 test table_part_\_special_/_sub_?_3#p#part_\_2#sp#sub_?\_4 test table_part_\_special_/_sub_?_3#p#part_\_2#sp#sub_\_3 test table_part_cap_6#p#p0 test table_part_cap_6#p#p1 test table_part_cap_6#p#p2 test table_part_cap_6#p#p3 test table_part_cap_6#p#p4 test table_part_nopart_cap_7 test table_part_sub_1#p#part_1#sp#part_1sp0 test table_part_sub_1#p#part_1#sp#part_1sp1 test table_part_sub_1#p#part_2#sp#part_2sp0 test table_part_sub_1#p#part_2#sp#part_2sp1 test table_part_sub_1#p#part_3#sp#part_3sp0 test table_part_sub_1#p#part_3#sp#part_3sp1 test table_part_sub_1#p#part_4#sp#part_4sp0 test table_part_sub_1#p#part_4#sp#part_4sp1 test table_part_sub_2#p#part_1#sp#sub_1 test table_part_sub_2#p#part_1#sp#sub_2 test table_part_sub_2#p#part_2#sp#sub_3 test table_part_sub_2#p#part_2#sp#sub_4 test table_part_sub_2#p#part_3#sp#sub_5 test table_part_sub_2#p#part_3#sp#sub_6 select database_name, table_name, index_name, stat_name from mysql.innodb_index_stats where table_name like '%table_part%' order by database_name, table_name, index_name, stat_name; database_name table_name index_name stat_name test table_part_1#p#p0 PRIMARY n_diff_pfx01 test table_part_1#p#p0 PRIMARY n_leaf_pages test table_part_1#p#p0 PRIMARY size test table_part_1#p#p0 k1 n_diff_pfx01 test table_part_1#p#p0 k1 n_diff_pfx02 test table_part_1#p#p0 k1 n_leaf_pages test table_part_1#p#p0 k1 size test table_part_1#p#p1 PRIMARY n_diff_pfx01 test table_part_1#p#p1 PRIMARY n_leaf_pages test table_part_1#p#p1 PRIMARY size test table_part_1#p#p1 k1 n_diff_pfx01 test table_part_1#p#p1 k1 n_diff_pfx02 test table_part_1#p#p1 k1 n_leaf_pages test table_part_1#p#p1 k1 size test table_part_1#p#p2 PRIMARY n_diff_pfx01 test table_part_1#p#p2 PRIMARY n_leaf_pages test table_part_1#p#p2 PRIMARY size test table_part_1#p#p2 k1 n_diff_pfx01 test table_part_1#p#p2 k1 n_diff_pfx02 test table_part_1#p#p2 k1 n_leaf_pages test table_part_1#p#p2 k1 size test table_part_1#p#p3 PRIMARY n_diff_pfx01 test table_part_1#p#p3 PRIMARY n_leaf_pages test table_part_1#p#p3 PRIMARY size test table_part_1#p#p3 k1 n_diff_pfx01 test table_part_1#p#p3 k1 n_diff_pfx02 test table_part_1#p#p3 k1 n_leaf_pages test table_part_1#p#p3 k1 size test table_part_1#p#p4 PRIMARY n_diff_pfx01 test table_part_1#p#p4 PRIMARY n_leaf_pages test table_part_1#p#p4 PRIMARY size test table_part_1#p#p4 k1 n_diff_pfx01 test table_part_1#p#p4 k1 n_diff_pfx02 test table_part_1#p#p4 k1 n_leaf_pages test table_part_1#p#p4 k1 size test table_part_2#p#p0 PRIMARY n_diff_pfx01 test table_part_2#p#p0 PRIMARY n_leaf_pages test table_part_2#p#p0 PRIMARY size test table_part_2#p#p0 k1 n_diff_pfx01 test table_part_2#p#p0 k1 n_diff_pfx02 test table_part_2#p#p0 k1 n_leaf_pages test table_part_2#p#p0 k1 size test table_part_2#p#p1 PRIMARY n_diff_pfx01 test table_part_2#p#p1 PRIMARY n_leaf_pages test table_part_2#p#p1 PRIMARY size test table_part_2#p#p1 k1 n_diff_pfx01 test table_part_2#p#p1 k1 n_diff_pfx02 test table_part_2#p#p1 k1 n_leaf_pages test table_part_2#p#p1 k1 size test table_part_2#p#p2 PRIMARY n_diff_pfx01 test table_part_2#p#p2 PRIMARY n_leaf_pages test table_part_2#p#p2 PRIMARY size test table_part_2#p#p2 k1 n_diff_pfx01 test table_part_2#p#p2 k1 n_diff_pfx02 test table_part_2#p#p2 k1 n_leaf_pages test table_part_2#p#p2 k1 size test table_part_2#p#p3 PRIMARY n_diff_pfx01 test table_part_2#p#p3 PRIMARY n_leaf_pages test table_part_2#p#p3 PRIMARY size test table_part_2#p#p3 k1 n_diff_pfx01 test table_part_2#p#p3 k1 n_diff_pfx02 test table_part_2#p#p3 k1 n_leaf_pages test table_part_2#p#p3 k1 size test table_part_2#p#p4 PRIMARY n_diff_pfx01 test table_part_2#p#p4 PRIMARY n_leaf_pages test table_part_2#p#p4 PRIMARY size test table_part_2#p#p4 k1 n_diff_pfx01 test table_part_2#p#p4 k1 n_diff_pfx02 test table_part_2#p#p4 k1 n_leaf_pages test table_part_2#p#p4 k1 size test table_part_\_special_/_sub_?_3#p#part_/_3#sp#sub_?/_5 PRIMARY n_diff_pfx01 test table_part_\_special_/_sub_?_3#p#part_/_3#sp#sub_?/_5 PRIMARY n_diff_pfx02 test table_part_\_special_/_sub_?_3#p#part_/_3#sp#sub_?/_5 PRIMARY n_leaf_pages test table_part_\_special_/_sub_?_3#p#part_/_3#sp#sub_?/_5 PRIMARY size test table_part_\_special_/_sub_?_3#p#part_/_3#sp#sub_?/_5 k1 n_diff_pfx01 test table_part_\_special_/_sub_?_3#p#part_/_3#sp#sub_?/_5 k1 n_diff_pfx02 test table_part_\_special_/_sub_?_3#p#part_/_3#sp#sub_?/_5 k1 n_leaf_pages test table_part_\_special_/_sub_?_3#p#part_/_3#sp#sub_?/_5 k1 size test table_part_\_special_/_sub_?_3#p#part_/_3#sp#sub_\/?_6 PRIMARY n_diff_pfx01 test table_part_\_special_/_sub_?_3#p#part_/_3#sp#sub_\/?_6 PRIMARY n_diff_pfx02 test table_part_\_special_/_sub_?_3#p#part_/_3#sp#sub_\/?_6 PRIMARY n_leaf_pages test table_part_\_special_/_sub_?_3#p#part_/_3#sp#sub_\/?_6 PRIMARY size test table_part_\_special_/_sub_?_3#p#part_/_3#sp#sub_\/?_6 k1 n_diff_pfx01 test table_part_\_special_/_sub_?_3#p#part_/_3#sp#sub_\/?_6 k1 n_diff_pfx02 test table_part_\_special_/_sub_?_3#p#part_/_3#sp#sub_\/?_6 k1 n_leaf_pages test table_part_\_special_/_sub_?_3#p#part_/_3#sp#sub_\/?_6 k1 size test table_part_\_special_/_sub_?_3#p#part_?_1#sp#sub_/_2 PRIMARY n_diff_pfx01 test table_part_\_special_/_sub_?_3#p#part_?_1#sp#sub_/_2 PRIMARY n_diff_pfx02 test table_part_\_special_/_sub_?_3#p#part_?_1#sp#sub_/_2 PRIMARY n_leaf_pages test table_part_\_special_/_sub_?_3#p#part_?_1#sp#sub_/_2 PRIMARY size test table_part_\_special_/_sub_?_3#p#part_?_1#sp#sub_/_2 k1 n_diff_pfx01 test table_part_\_special_/_sub_?_3#p#part_?_1#sp#sub_/_2 k1 n_diff_pfx02 test table_part_\_special_/_sub_?_3#p#part_?_1#sp#sub_/_2 k1 n_leaf_pages test table_part_\_special_/_sub_?_3#p#part_?_1#sp#sub_/_2 k1 size test table_part_\_special_/_sub_?_3#p#part_?_1#sp#sub_?_1 PRIMARY n_diff_pfx01 test table_part_\_special_/_sub_?_3#p#part_?_1#sp#sub_?_1 PRIMARY n_diff_pfx02 test table_part_\_special_/_sub_?_3#p#part_?_1#sp#sub_?_1 PRIMARY n_leaf_pages test table_part_\_special_/_sub_?_3#p#part_?_1#sp#sub_?_1 PRIMARY size test table_part_\_special_/_sub_?_3#p#part_?_1#sp#sub_?_1 k1 n_diff_pfx01 test table_part_\_special_/_sub_?_3#p#part_?_1#sp#sub_?_1 k1 n_diff_pfx02 test table_part_\_special_/_sub_?_3#p#part_?_1#sp#sub_?_1 k1 n_leaf_pages test table_part_\_special_/_sub_?_3#p#part_?_1#sp#sub_?_1 k1 size test table_part_\_special_/_sub_?_3#p#part_\_2#sp#sub_?\_4 PRIMARY n_diff_pfx01 test table_part_\_special_/_sub_?_3#p#part_\_2#sp#sub_?\_4 PRIMARY n_diff_pfx02 test table_part_\_special_/_sub_?_3#p#part_\_2#sp#sub_?\_4 PRIMARY n_leaf_pages test table_part_\_special_/_sub_?_3#p#part_\_2#sp#sub_?\_4 PRIMARY size test table_part_\_special_/_sub_?_3#p#part_\_2#sp#sub_?\_4 k1 n_diff_pfx01 test table_part_\_special_/_sub_?_3#p#part_\_2#sp#sub_?\_4 k1 n_diff_pfx02 test table_part_\_special_/_sub_?_3#p#part_\_2#sp#sub_?\_4 k1 n_leaf_pages test table_part_\_special_/_sub_?_3#p#part_\_2#sp#sub_?\_4 k1 size test table_part_\_special_/_sub_?_3#p#part_\_2#sp#sub_\_3 PRIMARY n_diff_pfx01 test table_part_\_special_/_sub_?_3#p#part_\_2#sp#sub_\_3 PRIMARY n_diff_pfx02 test table_part_\_special_/_sub_?_3#p#part_\_2#sp#sub_\_3 PRIMARY n_leaf_pages test table_part_\_special_/_sub_?_3#p#part_\_2#sp#sub_\_3 PRIMARY size test table_part_\_special_/_sub_?_3#p#part_\_2#sp#sub_\_3 k1 n_diff_pfx01 test table_part_\_special_/_sub_?_3#p#part_\_2#sp#sub_\_3 k1 n_diff_pfx02 test table_part_\_special_/_sub_?_3#p#part_\_2#sp#sub_\_3 k1 n_leaf_pages test table_part_\_special_/_sub_?_3#p#part_\_2#sp#sub_\_3 k1 size test table_part_cap_6#p#p0 PRIMARY n_diff_pfx01 test table_part_cap_6#p#p0 PRIMARY n_leaf_pages test table_part_cap_6#p#p0 PRIMARY size test table_part_cap_6#p#p0 k1 n_diff_pfx01 test table_part_cap_6#p#p0 k1 n_diff_pfx02 test table_part_cap_6#p#p0 k1 n_leaf_pages test table_part_cap_6#p#p0 k1 size test table_part_cap_6#p#p1 PRIMARY n_diff_pfx01 test table_part_cap_6#p#p1 PRIMARY n_leaf_pages test table_part_cap_6#p#p1 PRIMARY size test table_part_cap_6#p#p1 k1 n_diff_pfx01 test table_part_cap_6#p#p1 k1 n_diff_pfx02 test table_part_cap_6#p#p1 k1 n_leaf_pages test table_part_cap_6#p#p1 k1 size test table_part_cap_6#p#p2 PRIMARY n_diff_pfx01 test table_part_cap_6#p#p2 PRIMARY n_leaf_pages test table_part_cap_6#p#p2 PRIMARY size test table_part_cap_6#p#p2 k1 n_diff_pfx01 test table_part_cap_6#p#p2 k1 n_diff_pfx02 test table_part_cap_6#p#p2 k1 n_leaf_pages test table_part_cap_6#p#p2 k1 size test table_part_cap_6#p#p3 PRIMARY n_diff_pfx01 test table_part_cap_6#p#p3 PRIMARY n_leaf_pages test table_part_cap_6#p#p3 PRIMARY size test table_part_cap_6#p#p3 k1 n_diff_pfx01 test table_part_cap_6#p#p3 k1 n_diff_pfx02 test table_part_cap_6#p#p3 k1 n_leaf_pages test table_part_cap_6#p#p3 k1 size test table_part_cap_6#p#p4 PRIMARY n_diff_pfx01 test table_part_cap_6#p#p4 PRIMARY n_leaf_pages test table_part_cap_6#p#p4 PRIMARY size test table_part_cap_6#p#p4 k1 n_diff_pfx01 test table_part_cap_6#p#p4 k1 n_diff_pfx02 test table_part_cap_6#p#p4 k1 n_leaf_pages test table_part_cap_6#p#p4 k1 size test table_part_nopart_cap_7 PRIMARY n_diff_pfx01 test table_part_nopart_cap_7 PRIMARY n_leaf_pages test table_part_nopart_cap_7 PRIMARY size test table_part_nopart_cap_7 k1 n_diff_pfx01 test table_part_nopart_cap_7 k1 n_diff_pfx02 test table_part_nopart_cap_7 k1 n_leaf_pages test table_part_nopart_cap_7 k1 size test table_part_sub_1#p#part_1#sp#part_1sp0 PRIMARY n_diff_pfx01 test table_part_sub_1#p#part_1#sp#part_1sp0 PRIMARY n_diff_pfx02 test table_part_sub_1#p#part_1#sp#part_1sp0 PRIMARY n_leaf_pages test table_part_sub_1#p#part_1#sp#part_1sp0 PRIMARY size test table_part_sub_1#p#part_1#sp#part_1sp0 k1 n_diff_pfx01 test table_part_sub_1#p#part_1#sp#part_1sp0 k1 n_diff_pfx02 test table_part_sub_1#p#part_1#sp#part_1sp0 k1 n_leaf_pages test table_part_sub_1#p#part_1#sp#part_1sp0 k1 size test table_part_sub_1#p#part_1#sp#part_1sp1 PRIMARY n_diff_pfx01 test table_part_sub_1#p#part_1#sp#part_1sp1 PRIMARY n_diff_pfx02 test table_part_sub_1#p#part_1#sp#part_1sp1 PRIMARY n_leaf_pages test table_part_sub_1#p#part_1#sp#part_1sp1 PRIMARY size test table_part_sub_1#p#part_1#sp#part_1sp1 k1 n_diff_pfx01 test table_part_sub_1#p#part_1#sp#part_1sp1 k1 n_diff_pfx02 test table_part_sub_1#p#part_1#sp#part_1sp1 k1 n_leaf_pages test table_part_sub_1#p#part_1#sp#part_1sp1 k1 size test table_part_sub_1#p#part_2#sp#part_2sp0 PRIMARY n_diff_pfx01 test table_part_sub_1#p#part_2#sp#part_2sp0 PRIMARY n_diff_pfx02 test table_part_sub_1#p#part_2#sp#part_2sp0 PRIMARY n_leaf_pages test table_part_sub_1#p#part_2#sp#part_2sp0 PRIMARY size test table_part_sub_1#p#part_2#sp#part_2sp0 k1 n_diff_pfx01 test table_part_sub_1#p#part_2#sp#part_2sp0 k1 n_diff_pfx02 test table_part_sub_1#p#part_2#sp#part_2sp0 k1 n_leaf_pages test table_part_sub_1#p#part_2#sp#part_2sp0 k1 size test table_part_sub_1#p#part_2#sp#part_2sp1 PRIMARY n_diff_pfx01 test table_part_sub_1#p#part_2#sp#part_2sp1 PRIMARY n_diff_pfx02 test table_part_sub_1#p#part_2#sp#part_2sp1 PRIMARY n_leaf_pages test table_part_sub_1#p#part_2#sp#part_2sp1 PRIMARY size test table_part_sub_1#p#part_2#sp#part_2sp1 k1 n_diff_pfx01 test table_part_sub_1#p#part_2#sp#part_2sp1 k1 n_diff_pfx02 test table_part_sub_1#p#part_2#sp#part_2sp1 k1 n_leaf_pages test table_part_sub_1#p#part_2#sp#part_2sp1 k1 size test table_part_sub_1#p#part_3#sp#part_3sp0 PRIMARY n_diff_pfx01 test table_part_sub_1#p#part_3#sp#part_3sp0 PRIMARY n_diff_pfx02 test table_part_sub_1#p#part_3#sp#part_3sp0 PRIMARY n_leaf_pages test table_part_sub_1#p#part_3#sp#part_3sp0 PRIMARY size test table_part_sub_1#p#part_3#sp#part_3sp0 k1 n_diff_pfx01 test table_part_sub_1#p#part_3#sp#part_3sp0 k1 n_diff_pfx02 test table_part_sub_1#p#part_3#sp#part_3sp0 k1 n_leaf_pages test table_part_sub_1#p#part_3#sp#part_3sp0 k1 size test table_part_sub_1#p#part_3#sp#part_3sp1 PRIMARY n_diff_pfx01 test table_part_sub_1#p#part_3#sp#part_3sp1 PRIMARY n_diff_pfx02 test table_part_sub_1#p#part_3#sp#part_3sp1 PRIMARY n_leaf_pages test table_part_sub_1#p#part_3#sp#part_3sp1 PRIMARY size test table_part_sub_1#p#part_3#sp#part_3sp1 k1 n_diff_pfx01 test table_part_sub_1#p#part_3#sp#part_3sp1 k1 n_diff_pfx02 test table_part_sub_1#p#part_3#sp#part_3sp1 k1 n_leaf_pages test table_part_sub_1#p#part_3#sp#part_3sp1 k1 size test table_part_sub_1#p#part_4#sp#part_4sp0 PRIMARY n_diff_pfx01 test table_part_sub_1#p#part_4#sp#part_4sp0 PRIMARY n_diff_pfx02 test table_part_sub_1#p#part_4#sp#part_4sp0 PRIMARY n_leaf_pages test table_part_sub_1#p#part_4#sp#part_4sp0 PRIMARY size test table_part_sub_1#p#part_4#sp#part_4sp0 k1 n_diff_pfx01 test table_part_sub_1#p#part_4#sp#part_4sp0 k1 n_diff_pfx02 test table_part_sub_1#p#part_4#sp#part_4sp0 k1 n_leaf_pages test table_part_sub_1#p#part_4#sp#part_4sp0 k1 size test table_part_sub_1#p#part_4#sp#part_4sp1 PRIMARY n_diff_pfx01 test table_part_sub_1#p#part_4#sp#part_4sp1 PRIMARY n_diff_pfx02 test table_part_sub_1#p#part_4#sp#part_4sp1 PRIMARY n_leaf_pages test table_part_sub_1#p#part_4#sp#part_4sp1 PRIMARY size test table_part_sub_1#p#part_4#sp#part_4sp1 k1 n_diff_pfx01 test table_part_sub_1#p#part_4#sp#part_4sp1 k1 n_diff_pfx02 test table_part_sub_1#p#part_4#sp#part_4sp1 k1 n_leaf_pages test table_part_sub_1#p#part_4#sp#part_4sp1 k1 size test table_part_sub_2#p#part_1#sp#sub_1 PRIMARY n_diff_pfx01 test table_part_sub_2#p#part_1#sp#sub_1 PRIMARY n_diff_pfx02 test table_part_sub_2#p#part_1#sp#sub_1 PRIMARY n_leaf_pages test table_part_sub_2#p#part_1#sp#sub_1 PRIMARY size test table_part_sub_2#p#part_1#sp#sub_1 k1 n_diff_pfx01 test table_part_sub_2#p#part_1#sp#sub_1 k1 n_diff_pfx02 test table_part_sub_2#p#part_1#sp#sub_1 k1 n_leaf_pages test table_part_sub_2#p#part_1#sp#sub_1 k1 size test table_part_sub_2#p#part_1#sp#sub_2 PRIMARY n_diff_pfx01 test table_part_sub_2#p#part_1#sp#sub_2 PRIMARY n_diff_pfx02 test table_part_sub_2#p#part_1#sp#sub_2 PRIMARY n_leaf_pages test table_part_sub_2#p#part_1#sp#sub_2 PRIMARY size test table_part_sub_2#p#part_1#sp#sub_2 k1 n_diff_pfx01 test table_part_sub_2#p#part_1#sp#sub_2 k1 n_diff_pfx02 test table_part_sub_2#p#part_1#sp#sub_2 k1 n_leaf_pages test table_part_sub_2#p#part_1#sp#sub_2 k1 size test table_part_sub_2#p#part_2#sp#sub_3 PRIMARY n_diff_pfx01 test table_part_sub_2#p#part_2#sp#sub_3 PRIMARY n_diff_pfx02 test table_part_sub_2#p#part_2#sp#sub_3 PRIMARY n_leaf_pages test table_part_sub_2#p#part_2#sp#sub_3 PRIMARY size test table_part_sub_2#p#part_2#sp#sub_3 k1 n_diff_pfx01 test table_part_sub_2#p#part_2#sp#sub_3 k1 n_diff_pfx02 test table_part_sub_2#p#part_2#sp#sub_3 k1 n_leaf_pages test table_part_sub_2#p#part_2#sp#sub_3 k1 size test table_part_sub_2#p#part_2#sp#sub_4 PRIMARY n_diff_pfx01 test table_part_sub_2#p#part_2#sp#sub_4 PRIMARY n_diff_pfx02 test table_part_sub_2#p#part_2#sp#sub_4 PRIMARY n_leaf_pages test table_part_sub_2#p#part_2#sp#sub_4 PRIMARY size test table_part_sub_2#p#part_2#sp#sub_4 k1 n_diff_pfx01 test table_part_sub_2#p#part_2#sp#sub_4 k1 n_diff_pfx02 test table_part_sub_2#p#part_2#sp#sub_4 k1 n_leaf_pages test table_part_sub_2#p#part_2#sp#sub_4 k1 size test table_part_sub_2#p#part_3#sp#sub_5 PRIMARY n_diff_pfx01 test table_part_sub_2#p#part_3#sp#sub_5 PRIMARY n_diff_pfx02 test table_part_sub_2#p#part_3#sp#sub_5 PRIMARY n_leaf_pages test table_part_sub_2#p#part_3#sp#sub_5 PRIMARY size test table_part_sub_2#p#part_3#sp#sub_5 k1 n_diff_pfx01 test table_part_sub_2#p#part_3#sp#sub_5 k1 n_diff_pfx02 test table_part_sub_2#p#part_3#sp#sub_5 k1 n_leaf_pages test table_part_sub_2#p#part_3#sp#sub_5 k1 size test table_part_sub_2#p#part_3#sp#sub_6 PRIMARY n_diff_pfx01 test table_part_sub_2#p#part_3#sp#sub_6 PRIMARY n_diff_pfx02 test table_part_sub_2#p#part_3#sp#sub_6 PRIMARY n_leaf_pages test table_part_sub_2#p#part_3#sp#sub_6 PRIMARY size test table_part_sub_2#p#part_3#sp#sub_6 k1 n_diff_pfx01 test table_part_sub_2#p#part_3#sp#sub_6 k1 n_diff_pfx02 test table_part_sub_2#p#part_3#sp#sub_6 k1 n_leaf_pages test table_part_sub_2#p#part_3#sp#sub_6 k1 size Checking DD tables ------------------ SET DEBUG='+d,skip_dd_table_access_check'; select t.name as "table", p.name as "partition", p.number from mysql.tables t, mysql.table_partitions p where p.table_id = t.id order by t.name, p.name, p.number; table partition number table_part_1 p0 0 table_part_1 p1 1 table_part_1 p2 2 table_part_1 p3 3 table_part_1 p4 4 table_part_2 p0 0 table_part_2 p1 1 table_part_2 p2 2 table_part_2 p3 3 table_part_2 p4 4 table_part_\_special_/_sub_?_3 PART_/_3 2 table_part_\_special_/_sub_?_3 Part_?_1 0 table_part_\_special_/_sub_?_3 pArt_\_2 1 table_part_\_special_/_sub_?_3 sUb_/_2 1 table_part_\_special_/_sub_?_3 SUB_?/_5 0 table_part_\_special_/_sub_?_3 SUB_?\_4 1 table_part_\_special_/_sub_?_3 Sub_?_1 0 table_part_\_special_/_sub_?_3 sub_\/?_6 1 table_part_\_special_/_sub_?_3 suB_\_3 0 table_part_cap_6 p0 0 table_part_cap_6 p1 1 table_part_cap_6 p2 2 table_part_cap_6 p3 3 table_part_cap_6 p4 4 table_part_sub_1 Part_1 0 table_part_sub_1 Part_1sp0 0 table_part_sub_1 Part_1sp1 1 table_part_sub_1 pArt_2 1 table_part_sub_1 pArt_2sp0 0 table_part_sub_1 pArt_2sp1 1 table_part_sub_1 part_3 2 table_part_sub_1 part_3sp0 0 table_part_sub_1 part_3sp1 1 table_part_sub_1 PART_4 3 table_part_sub_1 PART_4sp0 0 table_part_sub_1 PART_4sp1 1 table_part_sub_2 Part_1 0 table_part_sub_2 pArt_2 1 table_part_sub_2 PART_3 2 table_part_sub_2 Sub_1 0 table_part_sub_2 sUb_2 1 table_part_sub_2 suB_3 0 table_part_sub_2 SUB_4 1 table_part_sub_2 SUB_5 0 table_part_sub_2 sub_6 1 select name from mysql.tablespaces where name like '%table_part%' order by name; name test/table_part_1#p#p0 test/table_part_1#p#p1 test/table_part_1#p#p2 test/table_part_1#p#p3 test/table_part_1#p#p4 test/table_part_2#p#p0 test/table_part_2#p#p1 test/table_part_2#p#p2 test/table_part_2#p#p3 test/table_part_2#p#p4 test/table_part_\_special_/_sub_?_3#p#part_/_3#sp#sub_?/_5 test/table_part_\_special_/_sub_?_3#p#part_/_3#sp#sub_\/?_6 test/table_part_\_special_/_sub_?_3#p#part_?_1#sp#sub_/_2 test/table_part_\_special_/_sub_?_3#p#part_?_1#sp#sub_?_1 test/table_part_\_special_/_sub_?_3#p#part_\_2#sp#sub_?\_4 test/table_part_\_special_/_sub_?_3#p#part_\_2#sp#sub_\_3 test/table_part_cap_6#p#p0 test/table_part_cap_6#p#p1 test/table_part_cap_6#p#p2 test/table_part_cap_6#p#p3 test/table_part_cap_6#p#p4 test/table_part_sub_1#p#part_1#sp#part_1sp0 test/table_part_sub_1#p#part_1#sp#part_1sp1 test/table_part_sub_1#p#part_2#sp#part_2sp0 test/table_part_sub_1#p#part_2#sp#part_2sp1 test/table_part_sub_1#p#part_3#sp#part_3sp0 test/table_part_sub_1#p#part_3#sp#part_3sp1 test/table_part_sub_1#p#part_4#sp#part_4sp0 test/table_part_sub_1#p#part_4#sp#part_4sp1 test/table_part_sub_2#p#part_1#sp#sub_1 test/table_part_sub_2#p#part_1#sp#sub_2 test/table_part_sub_2#p#part_2#sp#sub_3 test/table_part_sub_2#p#part_2#sp#sub_4 test/table_part_sub_2#p#part_3#sp#sub_5 test/table_part_sub_2#p#part_3#sp#sub_6 select file_name from mysql.tablespace_files where file_name like '%table_part%' order by file_name; file_name ./test/table_part_1#p#p0.ibd ./test/table_part_1#p#p1.ibd ./test/table_part_1#p#p2.ibd ./test/table_part_1#p#p3.ibd ./test/table_part_1#p#p4.ibd ./test/table_part_2#p#p0.ibd ./test/table_part_2#p#p1.ibd ./test/table_part_2#p#p2.ibd ./test/table_part_2#p#p3.ibd ./test/table_part_2#p#p4.ibd ./test/table_part_@005c_special_@002f_sub_@003f_3#p#part_@002f_3#sp#sub_@003f@002f_5.ibd ./test/table_part_@005c_special_@002f_sub_@003f_3#p#part_@002f_3#sp#sub_@005c@002f@003f_6.ibd ./test/table_part_@005c_special_@002f_sub_@003f_3#p#part_@003f_1#sp#sub_@002f_2.ibd ./test/table_part_@005c_special_@002f_sub_@003f_3#p#part_@003f_1#sp#sub_@003f_1.ibd ./test/table_part_@005c_special_@002f_sub_@003f_3#p#part_@005c_2#sp#sub_@003f@005c_4.ibd ./test/table_part_@005c_special_@002f_sub_@003f_3#p#part_@005c_2#sp#sub_@005c_3.ibd ./test/table_part_cap_6#p#p0.ibd ./test/table_part_cap_6#p#p1.ibd ./test/table_part_cap_6#p#p2.ibd ./test/table_part_cap_6#p#p3.ibd ./test/table_part_cap_6#p#p4.ibd ./test/table_part_sub_1#p#part_1#sp#part_1sp0.ibd ./test/table_part_sub_1#p#part_1#sp#part_1sp1.ibd ./test/table_part_sub_1#p#part_2#sp#part_2sp0.ibd ./test/table_part_sub_1#p#part_2#sp#part_2sp1.ibd ./test/table_part_sub_1#p#part_3#sp#part_3sp0.ibd ./test/table_part_sub_1#p#part_3#sp#part_3sp1.ibd ./test/table_part_sub_1#p#part_4#sp#part_4sp0.ibd ./test/table_part_sub_1#p#part_4#sp#part_4sp1.ibd ./test/table_part_sub_2#p#part_1#sp#sub_1.ibd ./test/table_part_sub_2#p#part_1#sp#sub_2.ibd ./test/table_part_sub_2#p#part_2#sp#sub_3.ibd ./test/table_part_sub_2#p#part_2#sp#sub_4.ibd ./test/table_part_sub_2#p#part_3#sp#sub_5.ibd ./test/table_part_sub_2#p#part_3#sp#sub_6.ibd SET DEBUG='-d,skip_dd_table_access_check'; SET NAMES DEFAULT; # 2. Do DML insert/update/delete on upgraded tables DML on partitioned tables ------------------------- insert into table_part_1 values(15, 1555, "Row - 15", REPEAT('Large Column Data - 15' , 256)); update table_part_1 set name = 'Row - updated' where value > 500; delete from table_part_1 where id = 7; insert into table_part_sub_1 values(15, 1555, "Row - 15", REPEAT('Large Column Data - 15' , 256)); update table_part_sub_1 set name = 'Row - updated' where value > 500; delete from table_part_sub_1 where id = 7; insert into table_part_sub_2 values(15, 1555, "Row - 15", REPEAT('Large Column Data - 15' , 256)); update table_part_sub_2 set name = 'Row - updated' where value > 500; delete from table_part_sub_2 where id = 7; insert into `table_part_\_special_/_sub_?_3` values(15, 1555, "Row - 15", REPEAT('Large Column Data - 15' , 256)); update `table_part_\_special_/_sub_?_3` set name = 'Row - updated' where value > 500; delete from `table_part_\_special_/_sub_?_3` where id = 7; insert into table_part_2 values(15, 1555, "Row - 15", REPEAT('Large Column Data - 15' , 256)); update table_part_2 set name = 'Row - updated' where value > 500; delete from table_part_2 where id = 7; # 3. Do DDL ALTER/DROP on upgraded tables DDL on partitioned tables ------------------------- ALTER TABLE table_part_1 TRUNCATE PARTITION p0; ALTER TABLE table_part_1 COALESCE PARTITION 2; SHOW CREATE TABLE table_part_1; Table Create Table table_part_1 CREATE TABLE `table_part_1` ( `id` int NOT NULL, `value` int DEFAULT NULL, `name` varchar(32) DEFAULT NULL, `data` blob, PRIMARY KEY (`id`), KEY `k1` (`value`) ) ENGINE=InnoDB DEFAULT CHARSET=latin1 /*!50100 PARTITION BY HASH (`id`) PARTITIONS 3 */ ALTER TABLE table_part_sub_1 TRUNCATE PARTITION part_1; ALTER TABLE table_part_sub_2 TRUNCATE PARTITION part_3; CREATE TABLE test_table LIKE table_part_sub_2; ALTER TABLE test_table REMOVE PARTITIONING; insert into test_table values(2, 265, "Row - 2", REPEAT('Large Column Data - 2' , 256)); SELECT id, value, name FROM table_part_sub_2 PARTITION (sub_3) order by id; id value name 2 255 Row - 2 4 455 Row - 4 SELECT id, value, name FROM test_table order by id; id value name 2 265 Row - 2 ALTER TABLE table_part_sub_2 EXCHANGE PARTITION sub_3 WITH TABLE test_table; SELECT id, value, name FROM table_part_sub_2 PARTITION (sub_3) order by id; id value name 2 265 Row - 2 SELECT id, value, name FROM test_table order by id; id value name 2 255 Row - 2 4 455 Row - 4 DROP TABLE test_table; ALTER TABLE table_part_sub_2 RENAME renamed_table;; SHOW CREATE TABLE renamed_table; Table Create Table renamed_table CREATE TABLE `renamed_table` ( `id` int NOT NULL, `value` int NOT NULL, `name` varchar(32) DEFAULT NULL, `data` blob, PRIMARY KEY (`id`,`value`), KEY `k1` (`value`) ) ENGINE=InnoDB DEFAULT CHARSET=latin1 /*!50100 PARTITION BY RANGE (`value`) SUBPARTITION BY HASH (`id`) (PARTITION Part_1 VALUES LESS THAN (101) (SUBPARTITION Sub_1 ENGINE = InnoDB, SUBPARTITION sUb_2 ENGINE = InnoDB), PARTITION pArt_2 VALUES LESS THAN (501) (SUBPARTITION suB_3 ENGINE = InnoDB, SUBPARTITION SUB_4 ENGINE = InnoDB), PARTITION PART_3 VALUES LESS THAN MAXVALUE (SUBPARTITION SUB_5 ENGINE = InnoDB, SUBPARTITION sub_6 ENGINE = InnoDB)) */ ALTER TABLE renamed_table RENAME table_part_sub_2;; ALTER TABLE table_part_1 ENGINE = InnoDB;; ALTER TABLE table_part_1 ADD COLUMN new_id int AFTER id; ALTER TABLE table_part_1 REMOVE PARTITIONING; ALTER TABLE table_part_sub_1 ENGINE = InnoDB;; ALTER TABLE table_part_sub_1 ADD COLUMN new_id int AFTER id; ALTER TABLE table_part_sub_1 REMOVE PARTITIONING; ALTER TABLE table_part_sub_2 ENGINE = InnoDB;; ALTER TABLE table_part_sub_2 ADD COLUMN new_id int AFTER id; ALTER TABLE table_part_sub_2 REMOVE PARTITIONING; ALTER TABLE `table_part_\_special_/_sub_?_3` ENGINE = InnoDB;; ALTER TABLE `table_part_\_special_/_sub_?_3` ADD COLUMN new_id int AFTER id; ALTER TABLE `table_part_\_special_/_sub_?_3` REMOVE PARTITIONING; ALTER TABLE table_part_2 ENGINE = InnoDB;; ALTER TABLE table_part_2 ADD COLUMN new_id int AFTER id; ALTER TABLE table_part_2 REMOVE PARTITIONING; # B. Create all the tables again and validate Dropping partitioned tables --------------------------- DROP TABLE table_part_1; DROP TABLE table_part_sub_1; DROP TABLE table_part_sub_2; DROP TABLE `table_part_\_special_/_sub_?_3`; DROP TABLE table_part_2; Creating partitioned tables --------------------------- CREATE TABLE table_part_1( id int primary key, value int, name varchar(32), data BLOB, key k1(value)) partition by hash (id) partitions 5; CREATE TABLE table_part_2( id int primary key, value int, name varchar(32), data BLOB, key k1(value)) partition by hash (id) partitions 5; CREATE TABLE table_part_sub_1( id int, value int, name varchar(32), data BLOB, primary key pk(id, value), key k1(value)) partition by range (value) subpartition by hash (id) subpartitions 2 ( partition Part_1 values less than (101), partition pArt_2 values less than (401), partition part_3 values less than (701), partition PART_4 values less than MAXVALUE); CREATE TABLE table_part_sub_2( id int, value int, name varchar(32), data BLOB, primary key pk(id, value), key k1(value)) partition by range (value) subpartition by hash (id) ( partition Part_1 values less than (101)( subpartition Sub_1, subpartition sUb_2), partition pArt_2 values less than (501)( subpartition suB_3 , subpartition SUB_4), partition PART_3 values less than MAXVALUE( subpartition SUB_5, subpartition sub_6)); CREATE TABLE `table_part_\_special_/_sub_?_3`( id int, value int, name varchar(32), data BLOB, primary key pk(id, value), key k1(value)) partition by range (value) subpartition by hash (id) ( partition `Part_?_1` values less than (201)( subpartition `Sub_?_1`, subpartition `sUb_/_2`), partition `pArt_\_2` values less than (501)( subpartition `suB_\_3`, subpartition `SUB_?\_4`), partition `PART_/_3` values less than MAXVALUE( subpartition `SUB_?/_5`, subpartition `sub_\/?_6`)); Inserting 10 rows to table_part_1 --------------------------------------- insert into table_part_1 VALUES(0, 55, "Row - 0", REPEAT('Large Column Data - 0' , 256)); insert into table_part_1 VALUES(1, 155, "Row - 1", REPEAT('Large Column Data - 1' , 256)); insert into table_part_1 VALUES(2, 255, "Row - 2", REPEAT('Large Column Data - 2' , 256)); insert into table_part_1 VALUES(3, 355, "Row - 3", REPEAT('Large Column Data - 3' , 256)); insert into table_part_1 VALUES(4, 455, "Row - 4", REPEAT('Large Column Data - 4' , 256)); insert into table_part_1 VALUES(5, 555, "Row - 5", REPEAT('Large Column Data - 5' , 256)); insert into table_part_1 VALUES(6, 655, "Row - 6", REPEAT('Large Column Data - 6' , 256)); insert into table_part_1 VALUES(7, 755, "Row - 7", REPEAT('Large Column Data - 7' , 256)); insert into table_part_1 VALUES(8, 855, "Row - 8", REPEAT('Large Column Data - 8' , 256)); insert into table_part_1 VALUES(9, 955, "Row - 9", REPEAT('Large Column Data - 9' , 256)); Inserting 10 rows to table_part_sub_1 --------------------------------------- insert into table_part_sub_1 VALUES(0, 55, "Row - 0", REPEAT('Large Column Data - 0' , 256)); insert into table_part_sub_1 VALUES(1, 155, "Row - 1", REPEAT('Large Column Data - 1' , 256)); insert into table_part_sub_1 VALUES(2, 255, "Row - 2", REPEAT('Large Column Data - 2' , 256)); insert into table_part_sub_1 VALUES(3, 355, "Row - 3", REPEAT('Large Column Data - 3' , 256)); insert into table_part_sub_1 VALUES(4, 455, "Row - 4", REPEAT('Large Column Data - 4' , 256)); insert into table_part_sub_1 VALUES(5, 555, "Row - 5", REPEAT('Large Column Data - 5' , 256)); insert into table_part_sub_1 VALUES(6, 655, "Row - 6", REPEAT('Large Column Data - 6' , 256)); insert into table_part_sub_1 VALUES(7, 755, "Row - 7", REPEAT('Large Column Data - 7' , 256)); insert into table_part_sub_1 VALUES(8, 855, "Row - 8", REPEAT('Large Column Data - 8' , 256)); insert into table_part_sub_1 VALUES(9, 955, "Row - 9", REPEAT('Large Column Data - 9' , 256)); Inserting 10 rows to table_part_sub_2 --------------------------------------- insert into table_part_sub_2 VALUES(0, 55, "Row - 0", REPEAT('Large Column Data - 0' , 256)); insert into table_part_sub_2 VALUES(1, 155, "Row - 1", REPEAT('Large Column Data - 1' , 256)); insert into table_part_sub_2 VALUES(2, 255, "Row - 2", REPEAT('Large Column Data - 2' , 256)); insert into table_part_sub_2 VALUES(3, 355, "Row - 3", REPEAT('Large Column Data - 3' , 256)); insert into table_part_sub_2 VALUES(4, 455, "Row - 4", REPEAT('Large Column Data - 4' , 256)); insert into table_part_sub_2 VALUES(5, 555, "Row - 5", REPEAT('Large Column Data - 5' , 256)); insert into table_part_sub_2 VALUES(6, 655, "Row - 6", REPEAT('Large Column Data - 6' , 256)); insert into table_part_sub_2 VALUES(7, 755, "Row - 7", REPEAT('Large Column Data - 7' , 256)); insert into table_part_sub_2 VALUES(8, 855, "Row - 8", REPEAT('Large Column Data - 8' , 256)); insert into table_part_sub_2 VALUES(9, 955, "Row - 9", REPEAT('Large Column Data - 9' , 256)); Inserting 10 rows to `table_part_\_special_/_sub_?_3` --------------------------------------- insert into `table_part_\_special_/_sub_?_3` VALUES(0, 55, "Row - 0", REPEAT('Large Column Data - 0' , 256)); insert into `table_part_\_special_/_sub_?_3` VALUES(1, 155, "Row - 1", REPEAT('Large Column Data - 1' , 256)); insert into `table_part_\_special_/_sub_?_3` VALUES(2, 255, "Row - 2", REPEAT('Large Column Data - 2' , 256)); insert into `table_part_\_special_/_sub_?_3` VALUES(3, 355, "Row - 3", REPEAT('Large Column Data - 3' , 256)); insert into `table_part_\_special_/_sub_?_3` VALUES(4, 455, "Row - 4", REPEAT('Large Column Data - 4' , 256)); insert into `table_part_\_special_/_sub_?_3` VALUES(5, 555, "Row - 5", REPEAT('Large Column Data - 5' , 256)); insert into `table_part_\_special_/_sub_?_3` VALUES(6, 655, "Row - 6", REPEAT('Large Column Data - 6' , 256)); insert into `table_part_\_special_/_sub_?_3` VALUES(7, 755, "Row - 7", REPEAT('Large Column Data - 7' , 256)); insert into `table_part_\_special_/_sub_?_3` VALUES(8, 855, "Row - 8", REPEAT('Large Column Data - 8' , 256)); insert into `table_part_\_special_/_sub_?_3` VALUES(9, 955, "Row - 9", REPEAT('Large Column Data - 9' , 256)); Inserting 10 rows to table_part_2 --------------------------------------- insert into table_part_2 VALUES(0, 55, "Row - 0", REPEAT('Large Column Data - 0' , 256)); insert into table_part_2 VALUES(1, 155, "Row - 1", REPEAT('Large Column Data - 1' , 256)); insert into table_part_2 VALUES(2, 255, "Row - 2", REPEAT('Large Column Data - 2' , 256)); insert into table_part_2 VALUES(3, 355, "Row - 3", REPEAT('Large Column Data - 3' , 256)); insert into table_part_2 VALUES(4, 455, "Row - 4", REPEAT('Large Column Data - 4' , 256)); insert into table_part_2 VALUES(5, 555, "Row - 5", REPEAT('Large Column Data - 5' , 256)); insert into table_part_2 VALUES(6, 655, "Row - 6", REPEAT('Large Column Data - 6' , 256)); insert into table_part_2 VALUES(7, 755, "Row - 7", REPEAT('Large Column Data - 7' , 256)); insert into table_part_2 VALUES(8, 855, "Row - 8", REPEAT('Large Column Data - 8' , 256)); insert into table_part_2 VALUES(9, 955, "Row - 9", REPEAT('Large Column Data - 9' , 256)); select id, value, name from table_part_sub_2 partition (sub_1) order by id; id value name 0 55 Row - 0 select id, value, name from table_part_sub_2 partition (sub_2) order by id; id value name select id, value, name from table_part_sub_2 partition (sub_3) order by id; id value name 2 255 Row - 2 4 455 Row - 4 select id, value, name from table_part_sub_2 partition (sub_4) order by id; id value name 1 155 Row - 1 3 355 Row - 3 select id, value, name from table_part_sub_2 partition (sub_5) order by id; id value name 6 655 Row - 6 8 855 Row - 8 select id, value, name from table_part_sub_2 partition (sub_6) order by id; id value name 5 555 Row - 5 7 755 Row - 7 9 955 Row - 9 # 1. Check table metadata and data Checking partitioned tables --------------------------- SET NAMES utf8mb4 COLLATE utf8mb4_0900_as_cs; CHECK TABLE table_part_1; Table Op Msg_type Msg_text test.table_part_1 check status OK SHOW CREATE TABLE table_part_1; Table Create Table table_part_1 CREATE TABLE `table_part_1` ( `id` int NOT NULL, `value` int DEFAULT NULL, `name` varchar(32) DEFAULT NULL, `data` blob, PRIMARY KEY (`id`), KEY `k1` (`value`) ) ENGINE=InnoDB DEFAULT CHARSET=utf8mb4 COLLATE=utf8mb4_0900_ai_ci /*!50100 PARTITION BY HASH (`id`) PARTITIONS 5 */ SELECT id, value, name, SUBSTRING(data, 1024, 32) FROM table_part_1 order by id; id value name SUBSTRING(data, 1024, 32) 0 55 Row - 0 ta - 0Large Column Data - 0Large 1 155 Row - 1 ta - 1Large Column Data - 1Large 2 255 Row - 2 ta - 2Large Column Data - 2Large 3 355 Row - 3 ta - 3Large Column Data - 3Large 4 455 Row - 4 ta - 4Large Column Data - 4Large 5 555 Row - 5 ta - 5Large Column Data - 5Large 6 655 Row - 6 ta - 6Large Column Data - 6Large 7 755 Row - 7 ta - 7Large Column Data - 7Large 8 855 Row - 8 ta - 8Large Column Data - 8Large 9 955 Row - 9 ta - 9Large Column Data - 9Large CHECK TABLE table_part_sub_1; Table Op Msg_type Msg_text test.table_part_sub_1 check status OK SHOW CREATE TABLE table_part_sub_1; Table Create Table table_part_sub_1 CREATE TABLE `table_part_sub_1` ( `id` int NOT NULL, `value` int NOT NULL, `name` varchar(32) DEFAULT NULL, `data` blob, PRIMARY KEY (`id`,`value`), KEY `k1` (`value`) ) ENGINE=InnoDB DEFAULT CHARSET=utf8mb4 COLLATE=utf8mb4_0900_ai_ci /*!50100 PARTITION BY RANGE (`value`) SUBPARTITION BY HASH (`id`) SUBPARTITIONS 2 (PARTITION Part_1 VALUES LESS THAN (101) ENGINE = InnoDB, PARTITION pArt_2 VALUES LESS THAN (401) ENGINE = InnoDB, PARTITION part_3 VALUES LESS THAN (701) ENGINE = InnoDB, PARTITION PART_4 VALUES LESS THAN MAXVALUE ENGINE = InnoDB) */ SELECT id, value, name, SUBSTRING(data, 1024, 32) FROM table_part_sub_1 order by id; id value name SUBSTRING(data, 1024, 32) 0 55 Row - 0 ta - 0Large Column Data - 0Large 1 155 Row - 1 ta - 1Large Column Data - 1Large 2 255 Row - 2 ta - 2Large Column Data - 2Large 3 355 Row - 3 ta - 3Large Column Data - 3Large 4 455 Row - 4 ta - 4Large Column Data - 4Large 5 555 Row - 5 ta - 5Large Column Data - 5Large 6 655 Row - 6 ta - 6Large Column Data - 6Large 7 755 Row - 7 ta - 7Large Column Data - 7Large 8 855 Row - 8 ta - 8Large Column Data - 8Large 9 955 Row - 9 ta - 9Large Column Data - 9Large CHECK TABLE table_part_sub_2; Table Op Msg_type Msg_text test.table_part_sub_2 check status OK SHOW CREATE TABLE table_part_sub_2; Table Create Table table_part_sub_2 CREATE TABLE `table_part_sub_2` ( `id` int NOT NULL, `value` int NOT NULL, `name` varchar(32) DEFAULT NULL, `data` blob, PRIMARY KEY (`id`,`value`), KEY `k1` (`value`) ) ENGINE=InnoDB DEFAULT CHARSET=utf8mb4 COLLATE=utf8mb4_0900_ai_ci /*!50100 PARTITION BY RANGE (`value`) SUBPARTITION BY HASH (`id`) (PARTITION Part_1 VALUES LESS THAN (101) (SUBPARTITION Sub_1 ENGINE = InnoDB, SUBPARTITION sUb_2 ENGINE = InnoDB), PARTITION pArt_2 VALUES LESS THAN (501) (SUBPARTITION suB_3 ENGINE = InnoDB, SUBPARTITION SUB_4 ENGINE = InnoDB), PARTITION PART_3 VALUES LESS THAN MAXVALUE (SUBPARTITION SUB_5 ENGINE = InnoDB, SUBPARTITION sub_6 ENGINE = InnoDB)) */ SELECT id, value, name, SUBSTRING(data, 1024, 32) FROM table_part_sub_2 order by id; id value name SUBSTRING(data, 1024, 32) 0 55 Row - 0 ta - 0Large Column Data - 0Large 1 155 Row - 1 ta - 1Large Column Data - 1Large 2 255 Row - 2 ta - 2Large Column Data - 2Large 3 355 Row - 3 ta - 3Large Column Data - 3Large 4 455 Row - 4 ta - 4Large Column Data - 4Large 5 555 Row - 5 ta - 5Large Column Data - 5Large 6 655 Row - 6 ta - 6Large Column Data - 6Large 7 755 Row - 7 ta - 7Large Column Data - 7Large 8 855 Row - 8 ta - 8Large Column Data - 8Large 9 955 Row - 9 ta - 9Large Column Data - 9Large CHECK TABLE `table_part_\_special_/_sub_?_3`; Table Op Msg_type Msg_text test.table_part_\_special_/_sub_?_3 check status OK SHOW CREATE TABLE `table_part_\_special_/_sub_?_3`; Table Create Table table_part_\_special_/_sub_?_3 CREATE TABLE `table_part_\_special_/_sub_?_3` ( `id` int NOT NULL, `value` int NOT NULL, `name` varchar(32) DEFAULT NULL, `data` blob, PRIMARY KEY (`id`,`value`), KEY `k1` (`value`) ) ENGINE=InnoDB DEFAULT CHARSET=utf8mb4 COLLATE=utf8mb4_0900_ai_ci /*!50100 PARTITION BY RANGE (`value`) SUBPARTITION BY HASH (`id`) (PARTITION `Part_?_1` VALUES LESS THAN (201) (SUBPARTITION `Sub_?_1` ENGINE = InnoDB, SUBPARTITION `sUb_/_2` ENGINE = InnoDB), PARTITION `pArt_\_2` VALUES LESS THAN (501) (SUBPARTITION `suB_\_3` ENGINE = InnoDB, SUBPARTITION `SUB_?\_4` ENGINE = InnoDB), PARTITION `PART_/_3` VALUES LESS THAN MAXVALUE (SUBPARTITION `SUB_?/_5` ENGINE = InnoDB, SUBPARTITION `sub_\/?_6` ENGINE = InnoDB)) */ SELECT id, value, name, SUBSTRING(data, 1024, 32) FROM `table_part_\_special_/_sub_?_3` order by id; id value name SUBSTRING(data, 1024, 32) 0 55 Row - 0 ta - 0Large Column Data - 0Large 1 155 Row - 1 ta - 1Large Column Data - 1Large 2 255 Row - 2 ta - 2Large Column Data - 2Large 3 355 Row - 3 ta - 3Large Column Data - 3Large 4 455 Row - 4 ta - 4Large Column Data - 4Large 5 555 Row - 5 ta - 5Large Column Data - 5Large 6 655 Row - 6 ta - 6Large Column Data - 6Large 7 755 Row - 7 ta - 7Large Column Data - 7Large 8 855 Row - 8 ta - 8Large Column Data - 8Large 9 955 Row - 9 ta - 9Large Column Data - 9Large CHECK TABLE table_part_2; Table Op Msg_type Msg_text test.table_part_2 check status OK SHOW CREATE TABLE table_part_2; Table Create Table table_part_2 CREATE TABLE `table_part_2` ( `id` int NOT NULL, `value` int DEFAULT NULL, `name` varchar(32) DEFAULT NULL, `data` blob, PRIMARY KEY (`id`), KEY `k1` (`value`) ) ENGINE=InnoDB DEFAULT CHARSET=utf8mb4 COLLATE=utf8mb4_0900_ai_ci /*!50100 PARTITION BY HASH (`id`) PARTITIONS 5 */ SELECT id, value, name, SUBSTRING(data, 1024, 32) FROM table_part_2 order by id; id value name SUBSTRING(data, 1024, 32) 0 55 Row - 0 ta - 0Large Column Data - 0Large 1 155 Row - 1 ta - 1Large Column Data - 1Large 2 255 Row - 2 ta - 2Large Column Data - 2Large 3 355 Row - 3 ta - 3Large Column Data - 3Large 4 455 Row - 4 ta - 4Large Column Data - 4Large 5 555 Row - 5 ta - 5Large Column Data - 5Large 6 655 Row - 6 ta - 6Large Column Data - 6Large 7 755 Row - 7 ta - 7Large Column Data - 7Large 8 855 Row - 8 ta - 8Large Column Data - 8Large 9 955 Row - 9 ta - 9Large Column Data - 9Large Checking IFS views ------------------ select table_schema, table_name from information_schema.tables where table_name LIKE '%table_part%' order by table_schema, table_name; TABLE_SCHEMA TABLE_NAME test table_part_1 test table_part_2 test table_part_\_special_/_sub_?_3 test table_part_cap_6 test table_part_nopart_cap_7 test table_part_sub_1 test table_part_sub_2 select name, space_type from information_schema.innodb_tables where name LIKE '%table_part%' order by name, space_type; name space_type test/table_part_1#p#p0 Single test/table_part_1#p#p1 Single test/table_part_1#p#p2 Single test/table_part_1#p#p3 Single test/table_part_1#p#p4 Single test/table_part_2#p#p0 Single test/table_part_2#p#p1 Single test/table_part_2#p#p2 Single test/table_part_2#p#p3 Single test/table_part_2#p#p4 Single test/table_part_@005c_special_@002f_sub_@003f_3#p#part_@002f_3#sp#sub_@003f@002f_5 Single test/table_part_@005c_special_@002f_sub_@003f_3#p#part_@002f_3#sp#sub_@005c@002f@003f_6 Single test/table_part_@005c_special_@002f_sub_@003f_3#p#part_@003f_1#sp#sub_@002f_2 Single test/table_part_@005c_special_@002f_sub_@003f_3#p#part_@003f_1#sp#sub_@003f_1 Single test/table_part_@005c_special_@002f_sub_@003f_3#p#part_@005c_2#sp#sub_@003f@005c_4 Single test/table_part_@005c_special_@002f_sub_@003f_3#p#part_@005c_2#sp#sub_@005c_3 Single test/table_part_cap_6#p#p0 Single test/table_part_cap_6#p#p1 Single test/table_part_cap_6#p#p2 Single test/table_part_cap_6#p#p3 Single test/table_part_cap_6#p#p4 Single test/table_part_nopart_cap_7 General test/table_part_sub_1#p#part_1#sp#part_1sp0 Single test/table_part_sub_1#p#part_1#sp#part_1sp1 Single test/table_part_sub_1#p#part_2#sp#part_2sp0 Single test/table_part_sub_1#p#part_2#sp#part_2sp1 Single test/table_part_sub_1#p#part_3#sp#part_3sp0 Single test/table_part_sub_1#p#part_3#sp#part_3sp1 Single test/table_part_sub_1#p#part_4#sp#part_4sp0 Single test/table_part_sub_1#p#part_4#sp#part_4sp1 Single test/table_part_sub_2#p#part_1#sp#sub_1 Single test/table_part_sub_2#p#part_1#sp#sub_2 Single test/table_part_sub_2#p#part_2#sp#sub_3 Single test/table_part_sub_2#p#part_2#sp#sub_4 Single test/table_part_sub_2#p#part_3#sp#sub_5 Single test/table_part_sub_2#p#part_3#sp#sub_6 Single select table_schema, table_name, partition_name, subpartition_name from information_schema.partitions where table_name LIKE '%table_part%' order by table_schema, table_name, partition_name, subpartition_name; TABLE_SCHEMA TABLE_NAME PARTITION_NAME SUBPARTITION_NAME test table_part_1 p0 NULL test table_part_1 p1 NULL test table_part_1 p2 NULL test table_part_1 p3 NULL test table_part_1 p4 NULL test table_part_2 p0 NULL test table_part_2 p1 NULL test table_part_2 p2 NULL test table_part_2 p3 NULL test table_part_2 p4 NULL test table_part_\_special_/_sub_?_3 PART_/_3 SUB_?/_5 test table_part_\_special_/_sub_?_3 PART_/_3 sub_\/?_6 test table_part_\_special_/_sub_?_3 Part_?_1 sUb_/_2 test table_part_\_special_/_sub_?_3 Part_?_1 Sub_?_1 test table_part_\_special_/_sub_?_3 pArt_\_2 SUB_?\_4 test table_part_\_special_/_sub_?_3 pArt_\_2 suB_\_3 test table_part_cap_6 p0 NULL test table_part_cap_6 p1 NULL test table_part_cap_6 p2 NULL test table_part_cap_6 p3 NULL test table_part_cap_6 p4 NULL test table_part_nopart_cap_7 NULL NULL test table_part_sub_1 Part_1 Part_1sp0 test table_part_sub_1 Part_1 Part_1sp1 test table_part_sub_1 pArt_2 pArt_2sp0 test table_part_sub_1 pArt_2 pArt_2sp1 test table_part_sub_1 part_3 part_3sp0 test table_part_sub_1 part_3 part_3sp1 test table_part_sub_1 PART_4 PART_4sp0 test table_part_sub_1 PART_4 PART_4sp1 test table_part_sub_2 Part_1 Sub_1 test table_part_sub_2 Part_1 sUb_2 test table_part_sub_2 pArt_2 suB_3 test table_part_sub_2 pArt_2 SUB_4 test table_part_sub_2 PART_3 SUB_5 test table_part_sub_2 PART_3 sub_6 select name from information_schema.innodb_tablespaces where name LIKE '%table_part%' order by name; name test/table_part_1#p#p0 test/table_part_1#p#p1 test/table_part_1#p#p2 test/table_part_1#p#p3 test/table_part_1#p#p4 test/table_part_2#p#p0 test/table_part_2#p#p1 test/table_part_2#p#p2 test/table_part_2#p#p3 test/table_part_2#p#p4 test/table_part_cap_6#p#p0 test/table_part_cap_6#p#p1 test/table_part_cap_6#p#p2 test/table_part_cap_6#p#p3 test/table_part_cap_6#p#p4 test/table_part_sub_1#p#part_1#sp#part_1sp0 test/table_part_sub_1#p#part_1#sp#part_1sp1 test/table_part_sub_1#p#part_2#sp#part_2sp0 test/table_part_sub_1#p#part_2#sp#part_2sp1 test/table_part_sub_1#p#part_3#sp#part_3sp0 test/table_part_sub_1#p#part_3#sp#part_3sp1 test/table_part_sub_1#p#part_4#sp#part_4sp0 test/table_part_sub_1#p#part_4#sp#part_4sp1 test/table_part_sub_2#p#part_1#sp#sub_1 test/table_part_sub_2#p#part_1#sp#sub_2 test/table_part_sub_2#p#part_2#sp#sub_3 test/table_part_sub_2#p#part_2#sp#sub_4 test/table_part_sub_2#p#part_3#sp#sub_5 test/table_part_sub_2#p#part_3#sp#sub_6 test/table_part_\_special_/_sub_?_3#p#part_/_3#sp#sub_?/_5 test/table_part_\_special_/_sub_?_3#p#part_/_3#sp#sub_\/?_6 test/table_part_\_special_/_sub_?_3#p#part_?_1#sp#sub_/_2 test/table_part_\_special_/_sub_?_3#p#part_?_1#sp#sub_?_1 test/table_part_\_special_/_sub_?_3#p#part_\_2#sp#sub_?\_4 test/table_part_\_special_/_sub_?_3#p#part_\_2#sp#sub_\_3 select file_type, status, file_name, tablespace_name from information_schema.files where file_name LIKE '%table_part%' order by file_type, status, file_name, tablespace_name; FILE_TYPE STATUS FILE_NAME TABLESPACE_NAME TABLESPACE NORMAL ./test/table_part_1#p#p0.ibd test/table_part_1#p#p0 TABLESPACE NORMAL ./test/table_part_1#p#p1.ibd test/table_part_1#p#p1 TABLESPACE NORMAL ./test/table_part_1#p#p2.ibd test/table_part_1#p#p2 TABLESPACE NORMAL ./test/table_part_1#p#p3.ibd test/table_part_1#p#p3 TABLESPACE NORMAL ./test/table_part_1#p#p4.ibd test/table_part_1#p#p4 TABLESPACE NORMAL ./test/table_part_2#p#p0.ibd test/table_part_2#p#p0 TABLESPACE NORMAL ./test/table_part_2#p#p1.ibd test/table_part_2#p#p1 TABLESPACE NORMAL ./test/table_part_2#p#p2.ibd test/table_part_2#p#p2 TABLESPACE NORMAL ./test/table_part_2#p#p3.ibd test/table_part_2#p#p3 TABLESPACE NORMAL ./test/table_part_2#p#p4.ibd test/table_part_2#p#p4 TABLESPACE NORMAL ./test/table_part_@005c_special_@002f_sub_@003f_3#p#part_@002f_3#sp#sub_@003f@002f_5.ibd test/table_part_\_special_/_sub_?_3#p#part_/_3#sp#sub_?/_5 TABLESPACE NORMAL ./test/table_part_@005c_special_@002f_sub_@003f_3#p#part_@002f_3#sp#sub_@005c@002f@003f_6.ibd test/table_part_\_special_/_sub_?_3#p#part_/_3#sp#sub_\/?_6 TABLESPACE NORMAL ./test/table_part_@005c_special_@002f_sub_@003f_3#p#part_@003f_1#sp#sub_@002f_2.ibd test/table_part_\_special_/_sub_?_3#p#part_?_1#sp#sub_/_2 TABLESPACE NORMAL ./test/table_part_@005c_special_@002f_sub_@003f_3#p#part_@003f_1#sp#sub_@003f_1.ibd test/table_part_\_special_/_sub_?_3#p#part_?_1#sp#sub_?_1 TABLESPACE NORMAL ./test/table_part_@005c_special_@002f_sub_@003f_3#p#part_@005c_2#sp#sub_@003f@005c_4.ibd test/table_part_\_special_/_sub_?_3#p#part_\_2#sp#sub_?\_4 TABLESPACE NORMAL ./test/table_part_@005c_special_@002f_sub_@003f_3#p#part_@005c_2#sp#sub_@005c_3.ibd test/table_part_\_special_/_sub_?_3#p#part_\_2#sp#sub_\_3 TABLESPACE NORMAL ./test/table_part_cap_6#p#p0.ibd test/table_part_cap_6#p#p0 TABLESPACE NORMAL ./test/table_part_cap_6#p#p1.ibd test/table_part_cap_6#p#p1 TABLESPACE NORMAL ./test/table_part_cap_6#p#p2.ibd test/table_part_cap_6#p#p2 TABLESPACE NORMAL ./test/table_part_cap_6#p#p3.ibd test/table_part_cap_6#p#p3 TABLESPACE NORMAL ./test/table_part_cap_6#p#p4.ibd test/table_part_cap_6#p#p4 TABLESPACE NORMAL ./test/table_part_sub_1#p#part_1#sp#part_1sp0.ibd test/table_part_sub_1#p#part_1#sp#part_1sp0 TABLESPACE NORMAL ./test/table_part_sub_1#p#part_1#sp#part_1sp1.ibd test/table_part_sub_1#p#part_1#sp#part_1sp1 TABLESPACE NORMAL ./test/table_part_sub_1#p#part_2#sp#part_2sp0.ibd test/table_part_sub_1#p#part_2#sp#part_2sp0 TABLESPACE NORMAL ./test/table_part_sub_1#p#part_2#sp#part_2sp1.ibd test/table_part_sub_1#p#part_2#sp#part_2sp1 TABLESPACE NORMAL ./test/table_part_sub_1#p#part_3#sp#part_3sp0.ibd test/table_part_sub_1#p#part_3#sp#part_3sp0 TABLESPACE NORMAL ./test/table_part_sub_1#p#part_3#sp#part_3sp1.ibd test/table_part_sub_1#p#part_3#sp#part_3sp1 TABLESPACE NORMAL ./test/table_part_sub_1#p#part_4#sp#part_4sp0.ibd test/table_part_sub_1#p#part_4#sp#part_4sp0 TABLESPACE NORMAL ./test/table_part_sub_1#p#part_4#sp#part_4sp1.ibd test/table_part_sub_1#p#part_4#sp#part_4sp1 TABLESPACE NORMAL ./test/table_part_sub_2#p#part_1#sp#sub_1.ibd test/table_part_sub_2#p#part_1#sp#sub_1 TABLESPACE NORMAL ./test/table_part_sub_2#p#part_1#sp#sub_2.ibd test/table_part_sub_2#p#part_1#sp#sub_2 TABLESPACE NORMAL ./test/table_part_sub_2#p#part_2#sp#sub_3.ibd test/table_part_sub_2#p#part_2#sp#sub_3 TABLESPACE NORMAL ./test/table_part_sub_2#p#part_2#sp#sub_4.ibd test/table_part_sub_2#p#part_2#sp#sub_4 TABLESPACE NORMAL ./test/table_part_sub_2#p#part_3#sp#sub_5.ibd test/table_part_sub_2#p#part_3#sp#sub_5 TABLESPACE NORMAL ./test/table_part_sub_2#p#part_3#sp#sub_6.ibd test/table_part_sub_2#p#part_3#sp#sub_6 Checking Innodb stat tables --------------------------- select database_name, table_name from mysql.innodb_table_stats where table_name like '%table_part%' order by database_name, table_name; database_name table_name test table_part_1#p#p0 test table_part_1#p#p1 test table_part_1#p#p2 test table_part_1#p#p3 test table_part_1#p#p4 test table_part_2#p#p0 test table_part_2#p#p1 test table_part_2#p#p2 test table_part_2#p#p3 test table_part_2#p#p4 test table_part_\_special_/_sub_?_3#p#part_/_3#sp#sub_?/_5 test table_part_\_special_/_sub_?_3#p#part_/_3#sp#sub_\/?_6 test table_part_\_special_/_sub_?_3#p#part_?_1#sp#sub_/_2 test table_part_\_special_/_sub_?_3#p#part_?_1#sp#sub_?_1 test table_part_\_special_/_sub_?_3#p#part_\_2#sp#sub_?\_4 test table_part_\_special_/_sub_?_3#p#part_\_2#sp#sub_\_3 test table_part_cap_6#p#p0 test table_part_cap_6#p#p1 test table_part_cap_6#p#p2 test table_part_cap_6#p#p3 test table_part_cap_6#p#p4 test table_part_nopart_cap_7 test table_part_sub_1#p#part_1#sp#part_1sp0 test table_part_sub_1#p#part_1#sp#part_1sp1 test table_part_sub_1#p#part_2#sp#part_2sp0 test table_part_sub_1#p#part_2#sp#part_2sp1 test table_part_sub_1#p#part_3#sp#part_3sp0 test table_part_sub_1#p#part_3#sp#part_3sp1 test table_part_sub_1#p#part_4#sp#part_4sp0 test table_part_sub_1#p#part_4#sp#part_4sp1 test table_part_sub_2#p#part_1#sp#sub_1 test table_part_sub_2#p#part_1#sp#sub_2 test table_part_sub_2#p#part_2#sp#sub_3 test table_part_sub_2#p#part_2#sp#sub_4 test table_part_sub_2#p#part_3#sp#sub_5 test table_part_sub_2#p#part_3#sp#sub_6 select database_name, table_name, index_name, stat_name from mysql.innodb_index_stats where table_name like '%table_part%' order by database_name, table_name, index_name, stat_name; database_name table_name index_name stat_name test table_part_1#p#p0 PRIMARY n_diff_pfx01 test table_part_1#p#p0 PRIMARY n_leaf_pages test table_part_1#p#p0 PRIMARY size test table_part_1#p#p0 k1 n_diff_pfx01 test table_part_1#p#p0 k1 n_diff_pfx02 test table_part_1#p#p0 k1 n_leaf_pages test table_part_1#p#p0 k1 size test table_part_1#p#p1 PRIMARY n_diff_pfx01 test table_part_1#p#p1 PRIMARY n_leaf_pages test table_part_1#p#p1 PRIMARY size test table_part_1#p#p1 k1 n_diff_pfx01 test table_part_1#p#p1 k1 n_diff_pfx02 test table_part_1#p#p1 k1 n_leaf_pages test table_part_1#p#p1 k1 size test table_part_1#p#p2 PRIMARY n_diff_pfx01 test table_part_1#p#p2 PRIMARY n_leaf_pages test table_part_1#p#p2 PRIMARY size test table_part_1#p#p2 k1 n_diff_pfx01 test table_part_1#p#p2 k1 n_diff_pfx02 test table_part_1#p#p2 k1 n_leaf_pages test table_part_1#p#p2 k1 size test table_part_1#p#p3 PRIMARY n_diff_pfx01 test table_part_1#p#p3 PRIMARY n_leaf_pages test table_part_1#p#p3 PRIMARY size test table_part_1#p#p3 k1 n_diff_pfx01 test table_part_1#p#p3 k1 n_diff_pfx02 test table_part_1#p#p3 k1 n_leaf_pages test table_part_1#p#p3 k1 size test table_part_1#p#p4 PRIMARY n_diff_pfx01 test table_part_1#p#p4 PRIMARY n_leaf_pages test table_part_1#p#p4 PRIMARY size test table_part_1#p#p4 k1 n_diff_pfx01 test table_part_1#p#p4 k1 n_diff_pfx02 test table_part_1#p#p4 k1 n_leaf_pages test table_part_1#p#p4 k1 size test table_part_2#p#p0 PRIMARY n_diff_pfx01 test table_part_2#p#p0 PRIMARY n_leaf_pages test table_part_2#p#p0 PRIMARY size test table_part_2#p#p0 k1 n_diff_pfx01 test table_part_2#p#p0 k1 n_diff_pfx02 test table_part_2#p#p0 k1 n_leaf_pages test table_part_2#p#p0 k1 size test table_part_2#p#p1 PRIMARY n_diff_pfx01 test table_part_2#p#p1 PRIMARY n_leaf_pages test table_part_2#p#p1 PRIMARY size test table_part_2#p#p1 k1 n_diff_pfx01 test table_part_2#p#p1 k1 n_diff_pfx02 test table_part_2#p#p1 k1 n_leaf_pages test table_part_2#p#p1 k1 size test table_part_2#p#p2 PRIMARY n_diff_pfx01 test table_part_2#p#p2 PRIMARY n_leaf_pages test table_part_2#p#p2 PRIMARY size test table_part_2#p#p2 k1 n_diff_pfx01 test table_part_2#p#p2 k1 n_diff_pfx02 test table_part_2#p#p2 k1 n_leaf_pages test table_part_2#p#p2 k1 size test table_part_2#p#p3 PRIMARY n_diff_pfx01 test table_part_2#p#p3 PRIMARY n_leaf_pages test table_part_2#p#p3 PRIMARY size test table_part_2#p#p3 k1 n_diff_pfx01 test table_part_2#p#p3 k1 n_diff_pfx02 test table_part_2#p#p3 k1 n_leaf_pages test table_part_2#p#p3 k1 size test table_part_2#p#p4 PRIMARY n_diff_pfx01 test table_part_2#p#p4 PRIMARY n_leaf_pages test table_part_2#p#p4 PRIMARY size test table_part_2#p#p4 k1 n_diff_pfx01 test table_part_2#p#p4 k1 n_diff_pfx02 test table_part_2#p#p4 k1 n_leaf_pages test table_part_2#p#p4 k1 size test table_part_\_special_/_sub_?_3#p#part_/_3#sp#sub_?/_5 PRIMARY n_diff_pfx01 test table_part_\_special_/_sub_?_3#p#part_/_3#sp#sub_?/_5 PRIMARY n_diff_pfx02 test table_part_\_special_/_sub_?_3#p#part_/_3#sp#sub_?/_5 PRIMARY n_leaf_pages test table_part_\_special_/_sub_?_3#p#part_/_3#sp#sub_?/_5 PRIMARY size test table_part_\_special_/_sub_?_3#p#part_/_3#sp#sub_?/_5 k1 n_diff_pfx01 test table_part_\_special_/_sub_?_3#p#part_/_3#sp#sub_?/_5 k1 n_diff_pfx02 test table_part_\_special_/_sub_?_3#p#part_/_3#sp#sub_?/_5 k1 n_leaf_pages test table_part_\_special_/_sub_?_3#p#part_/_3#sp#sub_?/_5 k1 size test table_part_\_special_/_sub_?_3#p#part_/_3#sp#sub_\/?_6 PRIMARY n_diff_pfx01 test table_part_\_special_/_sub_?_3#p#part_/_3#sp#sub_\/?_6 PRIMARY n_diff_pfx02 test table_part_\_special_/_sub_?_3#p#part_/_3#sp#sub_\/?_6 PRIMARY n_leaf_pages test table_part_\_special_/_sub_?_3#p#part_/_3#sp#sub_\/?_6 PRIMARY size test table_part_\_special_/_sub_?_3#p#part_/_3#sp#sub_\/?_6 k1 n_diff_pfx01 test table_part_\_special_/_sub_?_3#p#part_/_3#sp#sub_\/?_6 k1 n_diff_pfx02 test table_part_\_special_/_sub_?_3#p#part_/_3#sp#sub_\/?_6 k1 n_leaf_pages test table_part_\_special_/_sub_?_3#p#part_/_3#sp#sub_\/?_6 k1 size test table_part_\_special_/_sub_?_3#p#part_?_1#sp#sub_/_2 PRIMARY n_diff_pfx01 test table_part_\_special_/_sub_?_3#p#part_?_1#sp#sub_/_2 PRIMARY n_diff_pfx02 test table_part_\_special_/_sub_?_3#p#part_?_1#sp#sub_/_2 PRIMARY n_leaf_pages test table_part_\_special_/_sub_?_3#p#part_?_1#sp#sub_/_2 PRIMARY size test table_part_\_special_/_sub_?_3#p#part_?_1#sp#sub_/_2 k1 n_diff_pfx01 test table_part_\_special_/_sub_?_3#p#part_?_1#sp#sub_/_2 k1 n_diff_pfx02 test table_part_\_special_/_sub_?_3#p#part_?_1#sp#sub_/_2 k1 n_leaf_pages test table_part_\_special_/_sub_?_3#p#part_?_1#sp#sub_/_2 k1 size test table_part_\_special_/_sub_?_3#p#part_?_1#sp#sub_?_1 PRIMARY n_diff_pfx01 test table_part_\_special_/_sub_?_3#p#part_?_1#sp#sub_?_1 PRIMARY n_diff_pfx02 test table_part_\_special_/_sub_?_3#p#part_?_1#sp#sub_?_1 PRIMARY n_leaf_pages test table_part_\_special_/_sub_?_3#p#part_?_1#sp#sub_?_1 PRIMARY size test table_part_\_special_/_sub_?_3#p#part_?_1#sp#sub_?_1 k1 n_diff_pfx01 test table_part_\_special_/_sub_?_3#p#part_?_1#sp#sub_?_1 k1 n_diff_pfx02 test table_part_\_special_/_sub_?_3#p#part_?_1#sp#sub_?_1 k1 n_leaf_pages test table_part_\_special_/_sub_?_3#p#part_?_1#sp#sub_?_1 k1 size test table_part_\_special_/_sub_?_3#p#part_\_2#sp#sub_?\_4 PRIMARY n_diff_pfx01 test table_part_\_special_/_sub_?_3#p#part_\_2#sp#sub_?\_4 PRIMARY n_diff_pfx02 test table_part_\_special_/_sub_?_3#p#part_\_2#sp#sub_?\_4 PRIMARY n_leaf_pages test table_part_\_special_/_sub_?_3#p#part_\_2#sp#sub_?\_4 PRIMARY size test table_part_\_special_/_sub_?_3#p#part_\_2#sp#sub_?\_4 k1 n_diff_pfx01 test table_part_\_special_/_sub_?_3#p#part_\_2#sp#sub_?\_4 k1 n_diff_pfx02 test table_part_\_special_/_sub_?_3#p#part_\_2#sp#sub_?\_4 k1 n_leaf_pages test table_part_\_special_/_sub_?_3#p#part_\_2#sp#sub_?\_4 k1 size test table_part_\_special_/_sub_?_3#p#part_\_2#sp#sub_\_3 PRIMARY n_diff_pfx01 test table_part_\_special_/_sub_?_3#p#part_\_2#sp#sub_\_3 PRIMARY n_diff_pfx02 test table_part_\_special_/_sub_?_3#p#part_\_2#sp#sub_\_3 PRIMARY n_leaf_pages test table_part_\_special_/_sub_?_3#p#part_\_2#sp#sub_\_3 PRIMARY size test table_part_\_special_/_sub_?_3#p#part_\_2#sp#sub_\_3 k1 n_diff_pfx01 test table_part_\_special_/_sub_?_3#p#part_\_2#sp#sub_\_3 k1 n_diff_pfx02 test table_part_\_special_/_sub_?_3#p#part_\_2#sp#sub_\_3 k1 n_leaf_pages test table_part_\_special_/_sub_?_3#p#part_\_2#sp#sub_\_3 k1 size test table_part_cap_6#p#p0 PRIMARY n_diff_pfx01 test table_part_cap_6#p#p0 PRIMARY n_leaf_pages test table_part_cap_6#p#p0 PRIMARY size test table_part_cap_6#p#p0 k1 n_diff_pfx01 test table_part_cap_6#p#p0 k1 n_diff_pfx02 test table_part_cap_6#p#p0 k1 n_leaf_pages test table_part_cap_6#p#p0 k1 size test table_part_cap_6#p#p1 PRIMARY n_diff_pfx01 test table_part_cap_6#p#p1 PRIMARY n_leaf_pages test table_part_cap_6#p#p1 PRIMARY size test table_part_cap_6#p#p1 k1 n_diff_pfx01 test table_part_cap_6#p#p1 k1 n_diff_pfx02 test table_part_cap_6#p#p1 k1 n_leaf_pages test table_part_cap_6#p#p1 k1 size test table_part_cap_6#p#p2 PRIMARY n_diff_pfx01 test table_part_cap_6#p#p2 PRIMARY n_leaf_pages test table_part_cap_6#p#p2 PRIMARY size test table_part_cap_6#p#p2 k1 n_diff_pfx01 test table_part_cap_6#p#p2 k1 n_diff_pfx02 test table_part_cap_6#p#p2 k1 n_leaf_pages test table_part_cap_6#p#p2 k1 size test table_part_cap_6#p#p3 PRIMARY n_diff_pfx01 test table_part_cap_6#p#p3 PRIMARY n_leaf_pages test table_part_cap_6#p#p3 PRIMARY size test table_part_cap_6#p#p3 k1 n_diff_pfx01 test table_part_cap_6#p#p3 k1 n_diff_pfx02 test table_part_cap_6#p#p3 k1 n_leaf_pages test table_part_cap_6#p#p3 k1 size test table_part_cap_6#p#p4 PRIMARY n_diff_pfx01 test table_part_cap_6#p#p4 PRIMARY n_leaf_pages test table_part_cap_6#p#p4 PRIMARY size test table_part_cap_6#p#p4 k1 n_diff_pfx01 test table_part_cap_6#p#p4 k1 n_diff_pfx02 test table_part_cap_6#p#p4 k1 n_leaf_pages test table_part_cap_6#p#p4 k1 size test table_part_nopart_cap_7 PRIMARY n_diff_pfx01 test table_part_nopart_cap_7 PRIMARY n_leaf_pages test table_part_nopart_cap_7 PRIMARY size test table_part_nopart_cap_7 k1 n_diff_pfx01 test table_part_nopart_cap_7 k1 n_diff_pfx02 test table_part_nopart_cap_7 k1 n_leaf_pages test table_part_nopart_cap_7 k1 size test table_part_sub_1#p#part_1#sp#part_1sp0 PRIMARY n_diff_pfx01 test table_part_sub_1#p#part_1#sp#part_1sp0 PRIMARY n_diff_pfx02 test table_part_sub_1#p#part_1#sp#part_1sp0 PRIMARY n_leaf_pages test table_part_sub_1#p#part_1#sp#part_1sp0 PRIMARY size test table_part_sub_1#p#part_1#sp#part_1sp0 k1 n_diff_pfx01 test table_part_sub_1#p#part_1#sp#part_1sp0 k1 n_diff_pfx02 test table_part_sub_1#p#part_1#sp#part_1sp0 k1 n_leaf_pages test table_part_sub_1#p#part_1#sp#part_1sp0 k1 size test table_part_sub_1#p#part_1#sp#part_1sp1 PRIMARY n_diff_pfx01 test table_part_sub_1#p#part_1#sp#part_1sp1 PRIMARY n_diff_pfx02 test table_part_sub_1#p#part_1#sp#part_1sp1 PRIMARY n_leaf_pages test table_part_sub_1#p#part_1#sp#part_1sp1 PRIMARY size test table_part_sub_1#p#part_1#sp#part_1sp1 k1 n_diff_pfx01 test table_part_sub_1#p#part_1#sp#part_1sp1 k1 n_diff_pfx02 test table_part_sub_1#p#part_1#sp#part_1sp1 k1 n_leaf_pages test table_part_sub_1#p#part_1#sp#part_1sp1 k1 size test table_part_sub_1#p#part_2#sp#part_2sp0 PRIMARY n_diff_pfx01 test table_part_sub_1#p#part_2#sp#part_2sp0 PRIMARY n_diff_pfx02 test table_part_sub_1#p#part_2#sp#part_2sp0 PRIMARY n_leaf_pages test table_part_sub_1#p#part_2#sp#part_2sp0 PRIMARY size test table_part_sub_1#p#part_2#sp#part_2sp0 k1 n_diff_pfx01 test table_part_sub_1#p#part_2#sp#part_2sp0 k1 n_diff_pfx02 test table_part_sub_1#p#part_2#sp#part_2sp0 k1 n_leaf_pages test table_part_sub_1#p#part_2#sp#part_2sp0 k1 size test table_part_sub_1#p#part_2#sp#part_2sp1 PRIMARY n_diff_pfx01 test table_part_sub_1#p#part_2#sp#part_2sp1 PRIMARY n_diff_pfx02 test table_part_sub_1#p#part_2#sp#part_2sp1 PRIMARY n_leaf_pages test table_part_sub_1#p#part_2#sp#part_2sp1 PRIMARY size test table_part_sub_1#p#part_2#sp#part_2sp1 k1 n_diff_pfx01 test table_part_sub_1#p#part_2#sp#part_2sp1 k1 n_diff_pfx02 test table_part_sub_1#p#part_2#sp#part_2sp1 k1 n_leaf_pages test table_part_sub_1#p#part_2#sp#part_2sp1 k1 size test table_part_sub_1#p#part_3#sp#part_3sp0 PRIMARY n_diff_pfx01 test table_part_sub_1#p#part_3#sp#part_3sp0 PRIMARY n_diff_pfx02 test table_part_sub_1#p#part_3#sp#part_3sp0 PRIMARY n_leaf_pages test table_part_sub_1#p#part_3#sp#part_3sp0 PRIMARY size test table_part_sub_1#p#part_3#sp#part_3sp0 k1 n_diff_pfx01 test table_part_sub_1#p#part_3#sp#part_3sp0 k1 n_diff_pfx02 test table_part_sub_1#p#part_3#sp#part_3sp0 k1 n_leaf_pages test table_part_sub_1#p#part_3#sp#part_3sp0 k1 size test table_part_sub_1#p#part_3#sp#part_3sp1 PRIMARY n_diff_pfx01 test table_part_sub_1#p#part_3#sp#part_3sp1 PRIMARY n_diff_pfx02 test table_part_sub_1#p#part_3#sp#part_3sp1 PRIMARY n_leaf_pages test table_part_sub_1#p#part_3#sp#part_3sp1 PRIMARY size test table_part_sub_1#p#part_3#sp#part_3sp1 k1 n_diff_pfx01 test table_part_sub_1#p#part_3#sp#part_3sp1 k1 n_diff_pfx02 test table_part_sub_1#p#part_3#sp#part_3sp1 k1 n_leaf_pages test table_part_sub_1#p#part_3#sp#part_3sp1 k1 size test table_part_sub_1#p#part_4#sp#part_4sp0 PRIMARY n_diff_pfx01 test table_part_sub_1#p#part_4#sp#part_4sp0 PRIMARY n_diff_pfx02 test table_part_sub_1#p#part_4#sp#part_4sp0 PRIMARY n_leaf_pages test table_part_sub_1#p#part_4#sp#part_4sp0 PRIMARY size test table_part_sub_1#p#part_4#sp#part_4sp0 k1 n_diff_pfx01 test table_part_sub_1#p#part_4#sp#part_4sp0 k1 n_diff_pfx02 test table_part_sub_1#p#part_4#sp#part_4sp0 k1 n_leaf_pages test table_part_sub_1#p#part_4#sp#part_4sp0 k1 size test table_part_sub_1#p#part_4#sp#part_4sp1 PRIMARY n_diff_pfx01 test table_part_sub_1#p#part_4#sp#part_4sp1 PRIMARY n_diff_pfx02 test table_part_sub_1#p#part_4#sp#part_4sp1 PRIMARY n_leaf_pages test table_part_sub_1#p#part_4#sp#part_4sp1 PRIMARY size test table_part_sub_1#p#part_4#sp#part_4sp1 k1 n_diff_pfx01 test table_part_sub_1#p#part_4#sp#part_4sp1 k1 n_diff_pfx02 test table_part_sub_1#p#part_4#sp#part_4sp1 k1 n_leaf_pages test table_part_sub_1#p#part_4#sp#part_4sp1 k1 size test table_part_sub_2#p#part_1#sp#sub_1 PRIMARY n_diff_pfx01 test table_part_sub_2#p#part_1#sp#sub_1 PRIMARY n_diff_pfx02 test table_part_sub_2#p#part_1#sp#sub_1 PRIMARY n_leaf_pages test table_part_sub_2#p#part_1#sp#sub_1 PRIMARY size test table_part_sub_2#p#part_1#sp#sub_1 k1 n_diff_pfx01 test table_part_sub_2#p#part_1#sp#sub_1 k1 n_diff_pfx02 test table_part_sub_2#p#part_1#sp#sub_1 k1 n_leaf_pages test table_part_sub_2#p#part_1#sp#sub_1 k1 size test table_part_sub_2#p#part_1#sp#sub_2 PRIMARY n_diff_pfx01 test table_part_sub_2#p#part_1#sp#sub_2 PRIMARY n_diff_pfx02 test table_part_sub_2#p#part_1#sp#sub_2 PRIMARY n_leaf_pages test table_part_sub_2#p#part_1#sp#sub_2 PRIMARY size test table_part_sub_2#p#part_1#sp#sub_2 k1 n_diff_pfx01 test table_part_sub_2#p#part_1#sp#sub_2 k1 n_diff_pfx02 test table_part_sub_2#p#part_1#sp#sub_2 k1 n_leaf_pages test table_part_sub_2#p#part_1#sp#sub_2 k1 size test table_part_sub_2#p#part_2#sp#sub_3 PRIMARY n_diff_pfx01 test table_part_sub_2#p#part_2#sp#sub_3 PRIMARY n_diff_pfx02 test table_part_sub_2#p#part_2#sp#sub_3 PRIMARY n_leaf_pages test table_part_sub_2#p#part_2#sp#sub_3 PRIMARY size test table_part_sub_2#p#part_2#sp#sub_3 k1 n_diff_pfx01 test table_part_sub_2#p#part_2#sp#sub_3 k1 n_diff_pfx02 test table_part_sub_2#p#part_2#sp#sub_3 k1 n_leaf_pages test table_part_sub_2#p#part_2#sp#sub_3 k1 size test table_part_sub_2#p#part_2#sp#sub_4 PRIMARY n_diff_pfx01 test table_part_sub_2#p#part_2#sp#sub_4 PRIMARY n_diff_pfx02 test table_part_sub_2#p#part_2#sp#sub_4 PRIMARY n_leaf_pages test table_part_sub_2#p#part_2#sp#sub_4 PRIMARY size test table_part_sub_2#p#part_2#sp#sub_4 k1 n_diff_pfx01 test table_part_sub_2#p#part_2#sp#sub_4 k1 n_diff_pfx02 test table_part_sub_2#p#part_2#sp#sub_4 k1 n_leaf_pages test table_part_sub_2#p#part_2#sp#sub_4 k1 size test table_part_sub_2#p#part_3#sp#sub_5 PRIMARY n_diff_pfx01 test table_part_sub_2#p#part_3#sp#sub_5 PRIMARY n_diff_pfx02 test table_part_sub_2#p#part_3#sp#sub_5 PRIMARY n_leaf_pages test table_part_sub_2#p#part_3#sp#sub_5 PRIMARY size test table_part_sub_2#p#part_3#sp#sub_5 k1 n_diff_pfx01 test table_part_sub_2#p#part_3#sp#sub_5 k1 n_diff_pfx02 test table_part_sub_2#p#part_3#sp#sub_5 k1 n_leaf_pages test table_part_sub_2#p#part_3#sp#sub_5 k1 size test table_part_sub_2#p#part_3#sp#sub_6 PRIMARY n_diff_pfx01 test table_part_sub_2#p#part_3#sp#sub_6 PRIMARY n_diff_pfx02 test table_part_sub_2#p#part_3#sp#sub_6 PRIMARY n_leaf_pages test table_part_sub_2#p#part_3#sp#sub_6 PRIMARY size test table_part_sub_2#p#part_3#sp#sub_6 k1 n_diff_pfx01 test table_part_sub_2#p#part_3#sp#sub_6 k1 n_diff_pfx02 test table_part_sub_2#p#part_3#sp#sub_6 k1 n_leaf_pages test table_part_sub_2#p#part_3#sp#sub_6 k1 size Checking DD tables ------------------ SET DEBUG='+d,skip_dd_table_access_check'; select t.name as "table", p.name as "partition", p.number from mysql.tables t, mysql.table_partitions p where p.table_id = t.id order by t.name, p.name, p.number; table partition number table_part_1 p0 0 table_part_1 p1 1 table_part_1 p2 2 table_part_1 p3 3 table_part_1 p4 4 table_part_2 p0 0 table_part_2 p1 1 table_part_2 p2 2 table_part_2 p3 3 table_part_2 p4 4 table_part_\_special_/_sub_?_3 PART_/_3 2 table_part_\_special_/_sub_?_3 Part_?_1 0 table_part_\_special_/_sub_?_3 pArt_\_2 1 table_part_\_special_/_sub_?_3 sUb_/_2 1 table_part_\_special_/_sub_?_3 SUB_?/_5 0 table_part_\_special_/_sub_?_3 SUB_?\_4 1 table_part_\_special_/_sub_?_3 Sub_?_1 0 table_part_\_special_/_sub_?_3 sub_\/?_6 1 table_part_\_special_/_sub_?_3 suB_\_3 0 table_part_cap_6 p0 0 table_part_cap_6 p1 1 table_part_cap_6 p2 2 table_part_cap_6 p3 3 table_part_cap_6 p4 4 table_part_sub_1 Part_1 0 table_part_sub_1 Part_1sp0 0 table_part_sub_1 Part_1sp1 1 table_part_sub_1 pArt_2 1 table_part_sub_1 pArt_2sp0 0 table_part_sub_1 pArt_2sp1 1 table_part_sub_1 part_3 2 table_part_sub_1 part_3sp0 0 table_part_sub_1 part_3sp1 1 table_part_sub_1 PART_4 3 table_part_sub_1 PART_4sp0 0 table_part_sub_1 PART_4sp1 1 table_part_sub_2 Part_1 0 table_part_sub_2 pArt_2 1 table_part_sub_2 PART_3 2 table_part_sub_2 Sub_1 0 table_part_sub_2 sUb_2 1 table_part_sub_2 suB_3 0 table_part_sub_2 SUB_4 1 table_part_sub_2 SUB_5 0 table_part_sub_2 sub_6 1 select name from mysql.tablespaces where name like '%table_part%' order by name; name test/table_part_1#p#p0 test/table_part_1#p#p1 test/table_part_1#p#p2 test/table_part_1#p#p3 test/table_part_1#p#p4 test/table_part_2#p#p0 test/table_part_2#p#p1 test/table_part_2#p#p2 test/table_part_2#p#p3 test/table_part_2#p#p4 test/table_part_\_special_/_sub_?_3#p#part_/_3#sp#sub_?/_5 test/table_part_\_special_/_sub_?_3#p#part_/_3#sp#sub_\/?_6 test/table_part_\_special_/_sub_?_3#p#part_?_1#sp#sub_/_2 test/table_part_\_special_/_sub_?_3#p#part_?_1#sp#sub_?_1 test/table_part_\_special_/_sub_?_3#p#part_\_2#sp#sub_?\_4 test/table_part_\_special_/_sub_?_3#p#part_\_2#sp#sub_\_3 test/table_part_cap_6#p#p0 test/table_part_cap_6#p#p1 test/table_part_cap_6#p#p2 test/table_part_cap_6#p#p3 test/table_part_cap_6#p#p4 test/table_part_sub_1#p#part_1#sp#part_1sp0 test/table_part_sub_1#p#part_1#sp#part_1sp1 test/table_part_sub_1#p#part_2#sp#part_2sp0 test/table_part_sub_1#p#part_2#sp#part_2sp1 test/table_part_sub_1#p#part_3#sp#part_3sp0 test/table_part_sub_1#p#part_3#sp#part_3sp1 test/table_part_sub_1#p#part_4#sp#part_4sp0 test/table_part_sub_1#p#part_4#sp#part_4sp1 test/table_part_sub_2#p#part_1#sp#sub_1 test/table_part_sub_2#p#part_1#sp#sub_2 test/table_part_sub_2#p#part_2#sp#sub_3 test/table_part_sub_2#p#part_2#sp#sub_4 test/table_part_sub_2#p#part_3#sp#sub_5 test/table_part_sub_2#p#part_3#sp#sub_6 select file_name from mysql.tablespace_files where file_name like '%table_part%' order by file_name; file_name ./test/table_part_1#p#p0.ibd ./test/table_part_1#p#p1.ibd ./test/table_part_1#p#p2.ibd ./test/table_part_1#p#p3.ibd ./test/table_part_1#p#p4.ibd ./test/table_part_2#p#p0.ibd ./test/table_part_2#p#p1.ibd ./test/table_part_2#p#p2.ibd ./test/table_part_2#p#p3.ibd ./test/table_part_2#p#p4.ibd ./test/table_part_@005c_special_@002f_sub_@003f_3#p#part_@002f_3#sp#sub_@003f@002f_5.ibd ./test/table_part_@005c_special_@002f_sub_@003f_3#p#part_@002f_3#sp#sub_@005c@002f@003f_6.ibd ./test/table_part_@005c_special_@002f_sub_@003f_3#p#part_@003f_1#sp#sub_@002f_2.ibd ./test/table_part_@005c_special_@002f_sub_@003f_3#p#part_@003f_1#sp#sub_@003f_1.ibd ./test/table_part_@005c_special_@002f_sub_@003f_3#p#part_@005c_2#sp#sub_@003f@005c_4.ibd ./test/table_part_@005c_special_@002f_sub_@003f_3#p#part_@005c_2#sp#sub_@005c_3.ibd ./test/table_part_cap_6#p#p0.ibd ./test/table_part_cap_6#p#p1.ibd ./test/table_part_cap_6#p#p2.ibd ./test/table_part_cap_6#p#p3.ibd ./test/table_part_cap_6#p#p4.ibd ./test/table_part_sub_1#p#part_1#sp#part_1sp0.ibd ./test/table_part_sub_1#p#part_1#sp#part_1sp1.ibd ./test/table_part_sub_1#p#part_2#sp#part_2sp0.ibd ./test/table_part_sub_1#p#part_2#sp#part_2sp1.ibd ./test/table_part_sub_1#p#part_3#sp#part_3sp0.ibd ./test/table_part_sub_1#p#part_3#sp#part_3sp1.ibd ./test/table_part_sub_1#p#part_4#sp#part_4sp0.ibd ./test/table_part_sub_1#p#part_4#sp#part_4sp1.ibd ./test/table_part_sub_2#p#part_1#sp#sub_1.ibd ./test/table_part_sub_2#p#part_1#sp#sub_2.ibd ./test/table_part_sub_2#p#part_2#sp#sub_3.ibd ./test/table_part_sub_2#p#part_2#sp#sub_4.ibd ./test/table_part_sub_2#p#part_3#sp#sub_5.ibd ./test/table_part_sub_2#p#part_3#sp#sub_6.ibd SET DEBUG='-d,skip_dd_table_access_check'; SET NAMES DEFAULT; # 2. Do DML insert/update/delete on upgraded tables DML on partitioned tables ------------------------- insert into table_part_1 values(15, 1555, "Row - 15", REPEAT('Large Column Data - 15' , 256)); update table_part_1 set name = 'Row - updated' where value > 500; delete from table_part_1 where id = 7; insert into table_part_sub_1 values(15, 1555, "Row - 15", REPEAT('Large Column Data - 15' , 256)); update table_part_sub_1 set name = 'Row - updated' where value > 500; delete from table_part_sub_1 where id = 7; insert into table_part_sub_2 values(15, 1555, "Row - 15", REPEAT('Large Column Data - 15' , 256)); update table_part_sub_2 set name = 'Row - updated' where value > 500; delete from table_part_sub_2 where id = 7; insert into `table_part_\_special_/_sub_?_3` values(15, 1555, "Row - 15", REPEAT('Large Column Data - 15' , 256)); update `table_part_\_special_/_sub_?_3` set name = 'Row - updated' where value > 500; delete from `table_part_\_special_/_sub_?_3` where id = 7; insert into table_part_2 values(15, 1555, "Row - 15", REPEAT('Large Column Data - 15' , 256)); update table_part_2 set name = 'Row - updated' where value > 500; delete from table_part_2 where id = 7; # 3. Do DDL ALTER/DROP on upgraded tables DDL on partitioned tables ------------------------- ALTER TABLE table_part_1 TRUNCATE PARTITION p0; ALTER TABLE table_part_1 COALESCE PARTITION 2; SHOW CREATE TABLE table_part_1; Table Create Table table_part_1 CREATE TABLE `table_part_1` ( `id` int NOT NULL, `value` int DEFAULT NULL, `name` varchar(32) DEFAULT NULL, `data` blob, PRIMARY KEY (`id`), KEY `k1` (`value`) ) ENGINE=InnoDB DEFAULT CHARSET=utf8mb4 COLLATE=utf8mb4_0900_ai_ci /*!50100 PARTITION BY HASH (`id`) PARTITIONS 3 */ ALTER TABLE table_part_sub_1 TRUNCATE PARTITION part_1; ALTER TABLE table_part_sub_2 TRUNCATE PARTITION part_3; CREATE TABLE test_table LIKE table_part_sub_2; ALTER TABLE test_table REMOVE PARTITIONING; insert into test_table values(2, 265, "Row - 2", REPEAT('Large Column Data - 2' , 256)); SELECT id, value, name FROM table_part_sub_2 PARTITION (sub_3) order by id; id value name 2 255 Row - 2 4 455 Row - 4 SELECT id, value, name FROM test_table order by id; id value name 2 265 Row - 2 ALTER TABLE table_part_sub_2 EXCHANGE PARTITION sub_3 WITH TABLE test_table; SELECT id, value, name FROM table_part_sub_2 PARTITION (sub_3) order by id; id value name 2 265 Row - 2 SELECT id, value, name FROM test_table order by id; id value name 2 255 Row - 2 4 455 Row - 4 DROP TABLE test_table; ALTER TABLE table_part_sub_2 RENAME renamed_table;; SHOW CREATE TABLE renamed_table; Table Create Table renamed_table CREATE TABLE `renamed_table` ( `id` int NOT NULL, `value` int NOT NULL, `name` varchar(32) DEFAULT NULL, `data` blob, PRIMARY KEY (`id`,`value`), KEY `k1` (`value`) ) ENGINE=InnoDB DEFAULT CHARSET=utf8mb4 COLLATE=utf8mb4_0900_ai_ci /*!50100 PARTITION BY RANGE (`value`) SUBPARTITION BY HASH (`id`) (PARTITION Part_1 VALUES LESS THAN (101) (SUBPARTITION Sub_1 ENGINE = InnoDB, SUBPARTITION sUb_2 ENGINE = InnoDB), PARTITION pArt_2 VALUES LESS THAN (501) (SUBPARTITION suB_3 ENGINE = InnoDB, SUBPARTITION SUB_4 ENGINE = InnoDB), PARTITION PART_3 VALUES LESS THAN MAXVALUE (SUBPARTITION SUB_5 ENGINE = InnoDB, SUBPARTITION sub_6 ENGINE = InnoDB)) */ ALTER TABLE renamed_table RENAME table_part_sub_2;; ALTER TABLE table_part_1 ENGINE = InnoDB;; ALTER TABLE table_part_1 ADD COLUMN new_id int AFTER id; ALTER TABLE table_part_1 REMOVE PARTITIONING; ALTER TABLE table_part_sub_1 ENGINE = InnoDB;; ALTER TABLE table_part_sub_1 ADD COLUMN new_id int AFTER id; ALTER TABLE table_part_sub_1 REMOVE PARTITIONING; ALTER TABLE table_part_sub_2 ENGINE = InnoDB;; ALTER TABLE table_part_sub_2 ADD COLUMN new_id int AFTER id; ALTER TABLE table_part_sub_2 REMOVE PARTITIONING; ALTER TABLE `table_part_\_special_/_sub_?_3` ENGINE = InnoDB;; ALTER TABLE `table_part_\_special_/_sub_?_3` ADD COLUMN new_id int AFTER id; ALTER TABLE `table_part_\_special_/_sub_?_3` REMOVE PARTITIONING; ALTER TABLE table_part_2 ENGINE = InnoDB;; ALTER TABLE table_part_2 ADD COLUMN new_id int AFTER id; ALTER TABLE table_part_2 REMOVE PARTITIONING; # Shutdown server # Remove upgraded data directory. # Cleanup: Restart with default options. # restart

/* * Copyright (C) 2018 Team Kodi * This file is part of Kodi - https://kodi.tv * * SPDX-License-Identifier: GPL-2.0-or-later * See LICENSES/README.md for more information. */ #include "MusicUtils.h" #include "Application.h" #include "PlayListPlayer.h" #include "ServiceBroker.h" #include "dialogs/GUIDialogSelect.h" #include "guilib/GUIComponent.h" #include "guilib/GUIKeyboardFactory.h" #include "guilib/GUIWindowManager.h" #include "guilib/LocalizeStrings.h" #include "music/MusicDatabase.h" #include "music/tags/MusicInfoTag.h" #include "playlists/PlayList.h" #include "settings/AdvancedSettings.h" #include "settings/Settings.h" #include "settings/SettingsComponent.h" #include "utils/JobManager.h" using namespace MUSIC_INFO; using namespace XFILE; using namespace PLAYLIST; namespace MUSIC_UTILS { class CSetArtJob : public CJob { CFileItemPtr pItem; std::string m_artType; std::string m_newArt; public: CSetArtJob(const CFileItemPtr item, const std::string& type, const std::string& newArt) : pItem(item), m_artType(type), m_newArt(newArt) { } ~CSetArtJob(void) override = default; bool HasSongExtraArtChanged(const CFileItemPtr pSongItem, const std::string& type, const int itemID, CMusicDatabase& db) { if (!pSongItem->HasMusicInfoTag()) return false; int idSong = pSongItem->GetMusicInfoTag()->GetDatabaseId(); if (idSong <= 0) return false; bool result = false; if (type == MediaTypeAlbum) // Update art when song is from album result = (itemID == pSongItem->GetMusicInfoTag()->GetAlbumId()); else if (type == MediaTypeArtist) { // Update art when artist is song or album artist of the song if (pSongItem->HasProperty("artistid")) { // Check artistid property when we have it for (CVariant::const_iterator_array varid = pSongItem->GetProperty("artistid").begin_array(); varid != pSongItem->GetProperty("artistid").end_array(); varid++) { int idArtist = varid->asInteger(); result = (itemID == idArtist); if (result) break; } } else { // Check song artists in database result = db.IsSongArtist(idSong, itemID); } if (!result) { // Check song album artists result = db.IsSongAlbumArtist(idSong, itemID); } } return result; } // Asynchronously update song, album or artist art in library // and trigger update to album & artist art of the currently playing song // and songs queued in the current playlist bool DoWork(void) override { int itemID = pItem->GetMusicInfoTag()->GetDatabaseId(); if (itemID <= 0) return false; std::string type = pItem->GetMusicInfoTag()->GetType(); CMusicDatabase db; if (!db.Open()) return false; if (!m_newArt.empty()) db.SetArtForItem(itemID, type, m_artType, m_newArt); else db.RemoveArtForItem(itemID, type, m_artType); /* Update the art of the songs of the current music playlist. Song thumb is often a fallback from the album and fanart is from the artist(s). Clear the art if it is a song from the album or by the artist (as song or album artist) that has modified artwork. The new artwork gets loaded when the playlist is shown. */ bool clearcache(false); CPlayList& playlist = CServiceBroker::GetPlaylistPlayer().GetPlaylist(PLAYLIST_MUSIC); for (int i = 0; i < playlist.size(); ++i) { CFileItemPtr songitem = playlist[i]; if (HasSongExtraArtChanged(songitem, type, itemID, db)) { songitem->ClearArt(); // Art gets reloaded when the current playist is shown clearcache = true; } } if (clearcache) { // Clear the music playlist from cache CFileItemList items("playlistmusic://"); items.RemoveDiscCache(WINDOW_MUSIC_PLAYLIST); } // Similarly update the art of the currently playing song so it shows on OSD if (g_application.GetAppPlayer().IsPlayingAudio() && g_application.CurrentFileItem().HasMusicInfoTag()) { CFileItemPtr songitem = CFileItemPtr(new CFileItem(g_application.CurrentFileItem())); if (HasSongExtraArtChanged(songitem, type, itemID, db)) g_application.UpdateCurrentPlayArt(); } db.Close(); return true; } }; class CSetSongRatingJob : public CJob { std::string strPath; int idSong; int iUserrating; public: CSetSongRatingJob(const std::string& filePath, int userrating) : strPath(filePath), idSong(-1), iUserrating(userrating) { } CSetSongRatingJob(int songId, int userrating) : strPath(), idSong(songId), iUserrating(userrating) { } ~CSetSongRatingJob(void) override = default; bool DoWork(void) override { // Asynchronously update song userrating in library CMusicDatabase db; if (db.Open()) { if (idSong > 0) db.SetSongUserrating(idSong, iUserrating); else db.SetSongUserrating(strPath, iUserrating); db.Close(); } return true; } }; void UpdateArtJob(const CFileItemPtr pItem, const std::string& strType, const std::string& strArt) { // Asynchronously update that type of art in the database CSetArtJob *job = new CSetArtJob(pItem, strType, strArt); CJobManager::GetInstance().AddJob(job, NULL); } // Add art types required in Kodi void AddHardCodedArtTypes(std::vector<std::string>& artTypes, const CMusicInfoTag& tag) { artTypes.emplace_back("thumb"); if (tag.GetType() == MediaTypeArtist) { artTypes.emplace_back("fanart"); } } // Add art types configured by the user void AddExtendedArtTypes(std::vector<std::string>& artTypes, const CMusicInfoTag& tag) { for (const auto& artType : GetArtTypesToScan(tag.GetType())) { if (find(artTypes.begin(), artTypes.end(), artType) == artTypes.end()) artTypes.push_back(artType); } } // Add art types currently assigned to to the media item void AddCurrentArtTypes(std::vector<std::string>& artTypes, const CMusicInfoTag& tag, CMusicDatabase& db) { std::map<std::string, std::string> currentArt; db.GetArtForItem(tag.GetDatabaseId(), tag.GetType(), currentArt); for (const auto& art : currentArt) { if (!art.second.empty() && find(artTypes.begin(), artTypes.end(), art.first) == artTypes.end()) artTypes.push_back(art.first); } } // Add art types that exist for other media items of the same type void AddMediaTypeArtTypes(std::vector<std::string>& artTypes, const CMusicInfoTag& tag, CMusicDatabase& db) { std::vector<std::string> dbArtTypes; db.GetArtTypes(tag.GetType(), dbArtTypes); for (const auto& artType : dbArtTypes) { if (find(artTypes.begin(), artTypes.end(), artType) == artTypes.end()) artTypes.push_back(artType); } } // Add art types from available but unassigned artwork for this media item void AddAvailableArtTypes(std::vector<std::string>& artTypes, const CMusicInfoTag& tag, CMusicDatabase& db) { for (const auto& artType : db.GetAvailableArtTypesForItem(tag.GetDatabaseId(), tag.GetType())) { if (find(artTypes.begin(), artTypes.end(), artType) == artTypes.end()) artTypes.push_back(artType); } } bool FillArtTypesList(CFileItem& musicitem, CFileItemList& artlist) { CMusicInfoTag &tag = *musicitem.GetMusicInfoTag(); if (tag.GetDatabaseId() < 1 || tag.GetType().empty()) return false; if (tag.GetType() != MediaTypeArtist && tag.GetType() != MediaTypeAlbum && tag.GetType() != MediaTypeSong) return false; artlist.Clear(); CMusicDatabase db; db.Open(); std::vector<std::string> artTypes; AddHardCodedArtTypes(artTypes, tag); AddExtendedArtTypes(artTypes, tag); AddCurrentArtTypes(artTypes, tag, db); AddMediaTypeArtTypes(artTypes, tag, db); AddAvailableArtTypes(artTypes, tag, db); db.Close(); for (const auto type : artTypes) { CFileItemPtr artitem(new CFileItem(type, false)); // Localise the names of common types of art if (type == "banner") artitem->SetLabel(g_localizeStrings.Get(20020)); else if (type == "fanart") artitem->SetLabel(g_localizeStrings.Get(20445)); else if (type == "poster") artitem->SetLabel(g_localizeStrings.Get(20021)); else if (type == "thumb") artitem->SetLabel(g_localizeStrings.Get(21371)); else artitem->SetLabel(type); // Set art type as art item property artitem->SetProperty("arttype", type); // Set current art as art item thumb if (musicitem.HasArt(type)) artitem->SetArt("thumb", musicitem.GetArt(type)); artlist.Add(artitem); } return !artlist.IsEmpty(); } std::string ShowSelectArtTypeDialog(CFileItemList& artitems) { // Prompt for choice CGUIDialogSelect *dialog = CServiceBroker::GetGUI()->GetWindowManager().GetWindow<CGUIDialogSelect>(WINDOW_DIALOG_SELECT); if (!dialog) return ""; dialog->SetHeading(CVariant{ 13521 }); dialog->Reset(); dialog->SetUseDetails(true); dialog->EnableButton(true, 13516); dialog->SetItems(artitems); dialog->Open(); if (dialog->IsButtonPressed()) { // Get the new art type name std::string strArtTypeName; if (!CGUIKeyboardFactory::ShowAndGetInput(strArtTypeName, CVariant{ g_localizeStrings.Get(13516) }, false)) return ""; // Add new type to the list of art types CFileItemPtr artitem(new CFileItem(strArtTypeName, false)); artitem->SetLabel(strArtTypeName); artitem->SetProperty("arttype", strArtTypeName); artitems.Add(artitem); return strArtTypeName; } return dialog->GetSelectedFileItem()->GetProperty("arttype").asString(); } int ShowSelectRatingDialog(int iSelected) { CGUIDialogSelect *dialog = CServiceBroker::GetGUI()->GetWindowManager().GetWindow<CGUIDialogSelect>(WINDOW_DIALOG_SELECT); if (dialog) { dialog->SetHeading(CVariant{ 38023 }); dialog->Add(g_localizeStrings.Get(38022)); for (int i = 1; i <= 10; i++) dialog->Add(StringUtils::Format("%s: %i", g_localizeStrings.Get(563).c_str(), i)); dialog->SetSelected(iSelected); dialog->Open(); int userrating = dialog->GetSelectedItem(); userrating = std::max(userrating, -1); userrating = std::min(userrating, 10); return userrating; } return -1; } void UpdateSongRatingJob(const CFileItemPtr pItem, int userrating) { // Asynchronously update the song user rating in music library const CMusicInfoTag *tag = pItem->GetMusicInfoTag(); CSetSongRatingJob *job; if (tag && tag->GetType() == MediaTypeSong && tag->GetDatabaseId() > 0) // Use song ID when known job = new CSetSongRatingJob(tag->GetDatabaseId(), userrating); else job = new CSetSongRatingJob(pItem->GetPath(), userrating); CJobManager::GetInstance().AddJob(job, NULL); } std::vector<std::string> GetArtTypesToScan(const MediaType& mediaType) { std::vector<std::string> arttypes; // Get default types of art that are to be automatically fetched during scanning if (mediaType == MediaTypeArtist) { arttypes = CServiceBroker::GetSettingsComponent()->GetAdvancedSettings()->m_musicArtistExtraArt; arttypes.emplace_back("thumb"); arttypes.emplace_back("fanart"); } else if (mediaType == MediaTypeAlbum) { arttypes = CServiceBroker::GetSettingsComponent()->GetAdvancedSettings()->m_musicAlbumExtraArt; arttypes.emplace_back("thumb"); } return arttypes; } }

Share Features: * show or hide faces of people in the box; * set width and height; * display or not the header of the plugin; * list the wall stream and last posts; * select language; * turn on/off auto language detecting; Ease of use Some better explanation could have for the set up, but it is not that difficult to figure out what is where. The only issue I found is slow response, it takes some time after the site has been loaded to see the box there. But this may be something from Facebook as well, since I've seen people complaining these last few days on FB being slow... So easy to install and with great options for streaming and showing people who like from Facebook site. Options for the size of the box etc ... but simple as... and all for free. Thanks so much to the developers ITP Social Buttons Free | Social Share | Todor Iliev 3 Score: 99 67 reviews It is a simple solution for adding social buttons on your web page. You can choose from 30+ kinds of social media icons. Features: positions - on the top, on the bottom or both positions in article. show or hide each one of buttons; interactive icons packages ( 30+ ); you can choose where to be rendered - on articles, categories, sections or front page ( fields for custom code and additional buttons; you can exclude sections, categories and articles; Works with these components: Content(com_content) K2(com_k2) VirtueMart(com_virtuemart) JEvents (com_jevents) EasyBlog (com_easyblog) VipPortfolio (com_vipportfolio) VipQuotes (com_vipquotes) UserIdeas (com_userideas) HikaShop (com_hikashop) JoomShopping (com_jshopping) ZOO (com_zoo) Shortener URL Services * goo.gl * bitly.com * bit.ly * j.mp * tiny.cc mp ITPMeta Free | SEO & Metadata | Todor Iliev 3 Score: 95 9 reviews This extension puts META tags into the header of the pages. You can select from Facebook, OpenGraph, Google, Twitter Car, Dublin Core, SEO tags and more. You are able to use that semantic data to describe objects on your pages. These meta data are used by Facebook, Twitter and Google to collect better information by your products and blog posts. cp User Ideas Free | Testimonials & Suggestions | Todor Iliev 3 Score: 95 9 reviews This is an extension that provides functionality for creating and managing user feedbacks, ideas pools, user suggestions,etc. These things can be grouped in multiple categories. Users are able to comment the items. It is suitable for developers because votes are managed by triggers - onBeforeVote, onVote, onAfterVote. Developers can do their plugins which make managing votes easily. CrowdFunding Free | Donations | Todor Iliev 3 Score: 94 13 reviews The extension provides many standard features of a website for collective fundraising. The users will use a Wizard, which will lead them step-by-step through the process of completing the campaign details. In addition, they can post comments and information about the status of their projects (updates). The bakers will send amounts to the owners of the projects. They will do it in three steps using Wizard again. There are extensions that are used for gamifying the platform. This increases the engagement of the users and makes their stay more exciting. Integrated with EasySocial, JomSocial, Kunena, Gravatar and Social Community. cmp Vip Portfolio Free | Portfolio | Todor Iliev 3 Score: 93 24 reviews Use this component to build your portfolio or gallery. There are a lot of layouts that you can use to create interactive presentation. You are able to group your projects in categories. The categories are SEO optimized and you can write own meta description, title, keywords and canonical link. It is developer friendly and provides API that you can use to upload media resources or to load and manage galleries. You are able to upload unlimited images for any project. You can choose from several kinds of lightboxes - Nivo, FancyBox, Magnific. There are many parameters you can use to adjust the projects. Features Several interactive layouts. Resize images during upload to the server. Generate thumbnails automatically. Upload unlimited additional images. Ability to preview images in modal gallery. SEO optimization. Slideshow gallery modules. cm Gamification Platform Free | Credits & Point Systems | Todor Iliev 3 Score: 93 2 reviews This extension provides popular game mechanics and resources that will be used in gamifying websites powered by Joomla. The platform provides gamification API that can be used from developers who wants to gamify their applications. cmp Social Community Free | Communities | Todor Iliev 3 Score: 73 1 review This is an extension that adds social features on the website. The extension provides a social SDK that can be used from developers for easy integration with other Joomla! components. The main goal of Social Community is to provide an easy way for integration, easy for use and better user experience. cp Virtual Currency Free | Credits & Point Systems | Todor Iliev 3 Score: 52 5 reviews This platform provides functionality for creating and managing virtual goods and money. The extension also provides a library ( SDK ) that can be used from developers to integrate the units to their Joomla extensions. You can use Virtual Currency to add gamification elements on your website. It is good way for increasing the engagement of your customers. cmp Proof of Identity Free | User Management | Todor Iliev 3 Score: 52 1 review This is an extension that provides functionality to administrators to verify their customers. The users can send files to the website owner whom has to validate their accounts. All personal data will be encrypted. There are options that you can use to manage additional features. Features Possibility to change the folder where the encrypted files will be stored. Automatic redirect to secure version of a page (HTTPS). Notification when a user is on insecure page (HTTP). Automatic removing privacy data after certain days. cp ITP Transifex Free | Language Edition | Todor Iliev 3 Score: 0 0 reviews This extension provides an easy way for creating and managing language packages, which are outsourced for translating to Transifex. The component uses Transifex API to download translated files. It provides an ability for creating predefined packages, which will be able to be used for generating language packs with one click. c ITP Comments Free | Social Comments | Todor Iliev 3 Score: 0 0 reviews Joomla extension that integrates Disqus and Facebook comments systems to a website. There are many options which people can use to customize the view of these social plugins. It is possible to be selected color schema, width or number of post, which will be displayed on the page. The plugin works for CrowdFunding (comcrowdfunding), User Ideas (comuserideas) and Joomla! Content (com_content).

Celtic fans react to tweet from legendary figure after Aberdeen win Scott Brown marshalled Celtic into the Scottish Cup Final with a 3-0 win over Aberdeen at Hampden Park. Goals from James Forrest, Odsonne Edouard and Tom Rogic sealed a place in the final for the Hoops. It was a miserable day for the Dons who finished the game with nine-men and saw boss Derek McInnes sent to the stands too. It kept alive dreams of a triple treble and Brown has proved instrumental to his team of late. The central midfielder has played 46 times in all competitions this season, despite being 33-years-old. (Photo by Mark Runnacles/Getty Images) Brown is worshipped by Celtic fans and winning trophies clearly means as much to him now as ever. Following yesterday’s game, he took to Twitter to celebrate and praise his team-mates. The tweet had a link to his Instagram post which showed a picture of Brown celebrating Forrest’s stunning opener. The caption on the post read: “Great result today from all the lads and now a final to look forward to.” (Photo by Ian MacNicol/Getty Images) Naturally, the Hoops ardent supporters are buzzing with Brown and his team-mates and they were quick to praise the performance of their influential skipper. We looked at the best responses to Brown’s social media update following yesterday’s brilliant semi-final victory. You my son, are a machine. You are making history which will Hail you in the eyes of the support for the rest of your days. Brooooooony!🥇 Awesome performance from our Captain & team! Aberdeen were today a national disgrace! Our discipline against this kind of thuggish approach was clear for all too see! All the pre talk coming from Aberdeen? Pointless if you cannot carry it thru when it matters most! Hail! Hail! I am delighted today the team performance was first class from the first minute , jamsey Forrest was first class some finish and big rogic back where he belongs scottbrown8 ♧♧once again first class all over the pitch # our captain our leader💚💚👌😎

An affidavit said that the victim came home and found his wife intoxicated. The victim attempted to lie down and rest, but Frith continued to harass him about wanting to use his phone, police said. ...

i currently own 2 flashes that work wireless a minolta and a sony, and since what i like to take pictures isnt a pro-like way, i always take short cuts of easy way more like simple portraits, sometimes i use a white foam board to reflect light or both flashes at a certain power and such, not to mention that i saw some DIY umbrella for flashes and some softboxes, also the use of natural light. so my question is, will that be fine for me? i would like to know the pros and cons as well if there is any that would be most helpful! In Britain, interior decoration can be very dark and unpredictable - studio flash with its modelling lights helps overcome problems with judging and controlling light. I would guess that many Saudi interiors are fairly light and that shutters allow control of window light, but that in some situations you would hardly see the effct of the modelling light even at full power. Even here, to do perfect work with my studio flash I must close the solid wooden shutters of the studio room; only with real darkness can I preview the result. Test shots are the answer when I can not get rid of ambient light. It's a bit easier to work with wireless off-camera flash in very light interiors because you have many natural bounce relfectors and also plenty of general bounce to reduce unwanted contrast. The main benefit of the studio flash would be more power, for groups or large subjects, and more control - along with far greater 'stamina', work all day and no worry about batteries. Also, camera flash tends to be at maximum power with umbrellas etc, so you end up waiting 10 seconds for recycling. Studio flash takes less than 1 second normally which allows expressions to be captured and not lost. and yes most of the houses here including ours is light interior, plus shiny (works well to soft & reflect light)some houses use beige. so basically i can get in a room that have all 4 walls bright white floor is made of beige marble, ceiling is normal tiles which they don't bounce good. i did before some tests in my apartment which have dark porcelain (brown) colored walls and the results were not interesting most of the pictures looks dim or somewhat dark background, but in my parents house its a different story the flash bounce very good, i guess i will give it a shot and do more tests to see the results this week! something else came into my mind just now...what about continues light source? like fluorescent light, or even strong LED light, i can get a strong one here too bright that it can reach over 2 kilo meters (i think im trying to blind people by hitting them with too strong lights ) Last edited by Mr_Alpha_2011 on Sun Feb 20, 2011 4:24 pm, edited 1 time in total. Video lights - 126 LED or similar - are very useful. Also, if you get two video lights, you can get a twin bracket to mount a video light next to your flash. This makes the combination a bit like studio flash, with a modelling light to help judge the effect. Jessop and Lastolite (UK) make twin brackets. Lastolite has a triple bracket, you can hold two flash guns and one modelling light, with an umbrella socket. I would like to show you two pictures by our son, Richard. He has been VERY unsure of his abilities because he interviews top professionals all the time, and sees nothing but pro work. This year I made sure he was went on Photo Training Overseas, to Egypt, for a full week, because I know he just needs to be exposed to working methods. After returning, here are two of his latest shots (himself and his girlfriend, with iPad software for music, and with instruments). This is what you can do with studio flash - total control. Time exposure for the iPad screen in a blacked out studio, flash exposure with huge depth of field and loads of power to wipe the background out to pure white. Lots of pp. Not Sony, probably Nikon, he uses D3S and also Phase One medium format but he has no wide angle for that yet:

Ends tomorrow The Lower Mainland’s newest online marketplace will open on Monday, April 28, when LikeItBuyItVancouver.com begins previewing a limited-time sale of everything from household goods to consumer electronics to cruises, travel, cars, gift cards and personal services. Trade Talk: Sisters find calling in cider business Left Field Cider: Beverage made at Rey Creek Ranch The 106-year-old Empress hotel will receive a $40-million refurbishment over the next four years. BUSINESS LUNCH: Sisters Kate Garthwaite and Theresa Pedersen expected to lunch Monday at Bestie. The Chinatown eatery serves the Little Dry and Big Dry ciders their Left Field Co. produces alongside 1,200-head of cattle at the family’s 4,850-hectare Rey Creek Ranch between Merrit and Logan Lake. Instead, the two crossed Pender Street for New Town’s steam buns and hot-and-sour soup. That classic broth is the opposite of the 30,000 litres of cider their 2,600-square-foot will output in 2014. “We didn’t expect to grow as quickly as we did,” said Kate, predicting 50,000 litres next year. With a UBC degree in global resource systems, Garthwaite was a fundraiser at the BC Children’s Hospital Foundation. UVic commerce grad and varsity-squad volleyball centre Pedersen became a Calgary stockbroker and, in 2007, moved to Nassau, Bahamas, with husband and investment banker Leith. Always fond of cider, Garthwaite took courses with U of Washington’s Peter Mitchell, got rancher-parents Gord and Deb to buy an apple press, quit her job, moved to Ross on Wye, England, and learned the game at Mike Johnson’s Broome Farm firm. Vacationing there in fall, 2010, her parents and sister caught the cider bug, formed a private limited partnership, got a manufacturer’s licence a year later “and started pressing apples the next day,” Kate said. Eager to see more grafts of English and French cider apples, Kate and Theresa are full-time cider makers who undertake all the production, selling and delivery of 500-ml bottles that fetch $8 to $9 in private stores. Maybe they’ll join a craft-beverage trend and distill Calvados-style apple brandy. Meanwhile, with Left Field’s market expanding, Kate is pleased to have parental approval: “My Dad is a farmer, an entrepreneur. He was happy that I wasn’t staying in non-profit.” TWIST OF FATE: Jack Senior’s first entrepreneurial investment entailed a three-speed bike. Seven decades later, it resulted in the VGH and UBC Hospital Foundation receiving $6,014,000. As for the bike, Senior (whose father died when Senior was seven) took newspaper, butcher and other delivery routes to help the family’s $20 monthly rent for an Ash-at-20th house. He got $1.50 from hospital patients for 76-cents-worth of Vancouver Suns. When the Province vendor’s faster bike reduced his take, “I bought a three-speed and got there first.” When another after-school job as the Park theatre’s doorman taught him the value of pre-popped popcorn, he joined Seattle-based Harland Fairbanks, built a provincewide market and, during a cash-flow crunch, took shares instead of salary. When another buyer planned to oust him, he quietly pointed out that he was the business and would open up the next day, whereupon their corn would be well and truly popped. Engaged to Elly Rosemeyer, he paid $15,500 for a westside house that sold for $1.2 million in 2012. In 1955, he paid $49,5000 for “a little wooden box” on the Point Grey Road waterfront off Larch Street. Don Mattrick and Nanon Gaspe de Beaubien’s neighbouring house on a slightly narrower lot reportedly fetched over $14 million recently. “Some of the best money I’ve ever spent is on legal and accounting,” Senior said. He meant Lyall Knott and Mark Elliott, whose father Gordon was his pal at Edith Cavell elementary. They’ve seen him develop a 50-per-cent stake in Speedy Gourmet Ltd. into 49 other restaurants, of which he retains 14 Dairy Queen-Orange Julius Treat Centres, two straight Orange Julius outlets and one DQ Express. His Senior Enterprises Inc, now a trust, owns several commercial properties in Vancouver, plus interests in warehouses retained when he sold Harland Fairbanks to Premium Brands. He, Andre Molnar and various limited partners have condo-property interests in Washington state, and continue to develop rental projects in Nanaimo. He sold 275 feet of West Fourth Avenue frontage to Cressey Development Groups for $6 million. Senior took a $3-million bath on his L’Arena restaurant in the Vancouver Public Library main branch and sensed another after buying a Rolls-Royce: “The staff wanted raises, the suppliers put their prices up. So I phoned [the dealer] and said: ‘I want my Volvo back.’” No such contretemps, apparently, with the seven yachts he’s owned, including the present Meridian 540 Pilot House. “My wife loved that boat,” he said wistfully of Elly, who died recently after they’d cruised the Atlantic coast, Caribbean and the Pacific to Alaska. Given his own two heart attacks and the conviction that seven-years-younger Elly would long outlive him, he assigned a life-insurance policy on her, which is why the VGH and UBC Hospital Foundation is suddenly the richer and Senior suddenly the poorer. CLEAR TO GO: Nat and Flora Bosa’s purchase of Victoria’s Empress hotel June 27 came out of left field, too. Unknown is vendor Ivanhoé Cambridge’s price for the 106-year-old landmark that GSE Holdings head Graham Lee reportedly passed on last year. However, the Bosas will spend another $40 million renovating its entrance, lobby, public spaces and many of the 477 guest rooms. Not mentioned is a grappa bar, although Nat Bosa’s birth on Christmas Day, 1944 (thus the name Natale) warrants one. Congested lungs promised the baby’s imminent death. But a boozy neighbour put his grappa-dipped pinky in Nat’s mouth, and the subsequent violent coughing cleared the obstruction and kept the future development mogul alive. We encourage all readers to share their views on our articles and blog posts. We are committed to maintaining a lively but civil forum for discussion, so we ask you to avoid personal attacks, and please keep your comments relevant and respectful. If you encounter a comment that is abusive, click the "X" in the upper right corner of the comment box to report spam or abuse. We are using Facebook commenting. Visit our FAQ page for more information.

[Optical and hydrodynamic properties of DNA complexes with histones H1 from the calf thymus and sea urchin sperm]. A comparative study of the complexes between DNA and H1 histones from calf thymus (H1-T) and sea urchin sperm (H1-S) has been performed using methods of flow birefringence, viscometry and circular dichroism (CD). Both nucleohistone complexes undergo a conformational transition with the increase of protein content. A two-fold drop of intrinsic viscosity was observed when the histone content in the complex increased up to 9-12%. The transition is not accompanied by essential changes in the nucleohistone anisotropy, the latter coincides with the anisotropy of DNA in H1-T containing complexes and is close to that in H1-S containing complexes. CD spectra of the two types of complexes are not the same. For the H1-S containing complexes the decrease of the amplitude of the CD positive band and the shift of its maximum to the longwave region are observed while the spectrum of H1-T containing complex coincides with that of DNA. The spectral changes are partly due to slight aggregation of the H1-S containing complexes. It is also possible that changes in the local structure of DNA within the H1-S containing nucleohistone complexes take place.

Branch Back Brook Branch Back Brook is a small tributary of Back Brook in Hunterdon County, New Jersey, in the United States. Course Branch Back Brook starts at , near the intersection of Route 202 and Route 179 by Lake Enterprises. It flows northeast and crosses Route 31 before joining Back Brook at . See also List of rivers of New Jersey External links USGS Coordinates for Google Maps References Category:Tributaries of the Raritan River Category:Rivers of New Jersey Category:Rivers of Hunterdon County, New Jersey

10 Top Tools for Novelists The software featured in this article is designed to meet the specialised needs of a budding novelist. There's the finest open source distraction-free tools, software designed to create visual novels, and tools to help capture and visualise ideas. Openbravo is an ERP business solution for small and medium sized companies. Its database structure is originally based on Compiere. Openbravo uses a fully Web based client/server architecture, and can be used from any Web browser. It has support for PostgreSQL and Oracle database back-ends. It is currently available in Spanish, English, Italian, Portuguese, and Russian. Read more

--- author: - 'Hua-Xing <span style="font-variant:small-caps;">Chen</span>$^{1,2,}$[^1], Atsushi <span style="font-variant:small-caps;">Hosaka</span>$^{1,}$[^2] and Shi-Lin <span style="font-variant:small-caps;">Zhu</span>$^{2,}$[^3]' title: Light Scalar Mesons in the QCD Sum Rule --- Introduction ============ The nature of light scalar mesons of $up$, $down$ and $strange$ quarks is not fully understood [@scalar; @Yao:2006px]. The expected members are $\sigma(600)$, $\kappa(800)$, $f_0(980)$ and $a_0(980)$ forming a nonet of flavor SU(3). Because they have the same spin and parity as the vacuum, $J^P = 0^+$, they reflect the bulk properties of the non-perturbative QCD vacuum. So far, several different pictures for the scalar mesons have been proposed. In the conventional quark model, they have a $\bar q q$ configuration of $^3P_0$ whose masses are expected to be larger than 1 GeV due to the $p$-wave orbital excitation. Furthermore, the mass ordering in a naive quark mass counting of $m_u \sim m_d < m_s$ implies $m_\sigma \sim m_{a_0} < m_\kappa < m_{f_0}$. In chiral models, they are regarded as chiral partners of the Nambu-Goldstone bosons ($\pi, K, \eta, \eta^\prime)$ [@Hatsuda:1994pi]. Due to the collective nature, their masses are expected to be lower than those of the quark model. Yet another interesting picture is that they are tetraquark states [@Jaffe:1976ig; @Lee:2006vk; @Brito:2004tv; @Zhang:2006xp]. In contrast with the $\bar q q$ states, their masses are expected to be around 0.6 – 1 GeV with the ordering of $m_\sigma < m_\kappa < m_{f_0, a_0}$, consistent with the recent experimental observation  [@scalar; @Yao:2006px; @experiment]. If such tetraquarks survive, they may be added to members of exotic multiquark states. In this contribution, we would like to report the results of a systematic study of the masses of the tetraquark scalar mesons in the QCD sum rule. We find that the QCD sum rule analysis with tetraquark currents implies the masses of scalar mesons in the region of 600 – 1000 MeV with the ordering, $m_\sigma < m_\kappa < m_{f_0, a_0}$, while the conventional $\bar q q$ currents imply masses around 1.5 GeV. Independent Currents ==================== Let us start with currents for the scalar tetraquark, which we consider only local currents. Using the antisymmetric combination for diquark flavor structure, we arrive at the following five independent currents [@Chen:2006hy] $$\begin{aligned} \nonumber\label{define_udud_current} S^\sigma_3 &=& (u_a^T C \gamma_5 d_b)(\bar{u}_a \gamma_5 C \bar{d}_b^T - \bar{u}_b \gamma_5 C \bar{d}_a^T)\, , \\ \nonumber V^\sigma_3 &=& (u_a^T C \gamma_{\mu} \gamma_5 d_b)(\bar{u}_a \gamma^{\mu}\gamma_5 C \bar{d}_b^T - \bar{u}_b \gamma^{\mu}\gamma_5 C \bar{d}_a^T)\, , \\ T^\sigma_6 &=& (u_a^T C \sigma_{\mu\nu} d_b)(\bar{u}_a \sigma^{\mu\nu} C \bar{d}_b^T + \bar{u}_b \sigma^{\mu\nu} C \bar{d}_a^T)\, , \\ \nonumber A^\sigma_6 &=& (u_a^T C \gamma_{\mu} d_b)(\bar{u}_a \gamma^{\mu} C \bar{d}_b^T + \bar{u}_b \gamma^{\mu} C \bar{d}_a^T)\, , \\ \nonumber P^\sigma_3 &=& (u_a^T C d_b)(\bar{u}_a C \bar{d}_b^T - \bar{u}_b C \bar{d}_a^T)\, ,\end{aligned}$$ where the sum over repeated indices ($\mu$, $\nu, \cdots$ for Dirac, and $a, b, \cdots$ for color indices) is taken. Either plus or minus sign in the second parentheses ensures that the diquarks form the antisymmetric combination in the flavor space. The currents $S$, $V$, $T$, $A$ and $P$ are constructed by scalar, vector, tensor, axial-vector, pseudoscalar diquark and antidiquark fields, respectively. The subscripts $3$ and $6$ show that the diquarks (antidiquark) are combined into the color representation $\mathbf{\bar 3_c}$ and $\mathbf{6_c}$ ($\mathbf{3_c}$ or $\mathbf{\bar 6_c}$), respectively. The currents for other members are formed similarly. We can also use a symmetric combination for diquark flavor structure. However, they are related to the antisymmetric ones by the axial U(1) transformation [@Umekawa:2004js]. QCD Sum Rule Analysis ===================== For the past decades QCD sum rule has proven to be a very powerful and successful non-perturbative method [@Shifman:1978bx; @Reinders:1984sr]. In sum rule analyses, we consider two-point correlation functions: $$\Pi(q^2)\,\equiv\,i\int d^4x e^{iqx} \langle0|T\eta(x){\eta^\dagger}(0)|0\rangle \, , \label{eq_pidefine}$$ where $\eta$ is an interpolating current for the tetraquark. We compute $\Pi(q^2)$ in the operator product expansion (OPE) of QCD up to certain order in the expansion, which is then matched with a hadronic parametrization to extract information of hadron properties. At the hadron level, we express the correlation function in the form of the dispersion relation with a spectral function: $$\Pi(p)=\int^\infty_0\frac{\rho(s)}{s-p^2-i\varepsilon}ds \, , \label{eq_disper}$$ where $$\begin{aligned} \rho(s) & \equiv & \sum_n\delta(s-M^2_n)\langle 0|\eta|n\rangle\langle n|{\eta^\dagger}|0\rangle \ \nonumber\\ &=& f^2_X\delta(s-M^2_X)+ \rm{higher\,\,states}\, . \label{eq_rho}\end{aligned}$$ For the second equation, as usual, we adopt a parametrization of one pole dominance for the ground state $X$ and a continuum contribution. The mass of the state $X$ can be obtained $$M^2_X=\frac{\int^{s_0}_0 e^{-s/M_B^2}s\rho(s)ds}{\int^{s_0}_0 e^{-s/M_B^2}\rho(s)ds}\, . \label{eq_LSR}$$ We performed the sum rule analysis using all currents and their various linear combinations, and found a good sum rule by a linear combination of $A_6^\sigma$ and $V_3^\sigma$ $$\begin{aligned} \eta^\sigma_1 = \cos\theta A^\sigma_6 + \sin\theta V^\sigma_3\, ,\end{aligned}$$ where the best choice of the mixing angle turns out to be $\cot\theta = 1 / \sqrt{2}$. For $\kappa$, $f_0$ and $a_0$, we have also found that similar linear combinations give better sum rules. The results of OPE can be found in Ref. [@Chen:2006zh] Numerical Analysis ================== For numerical calculations, we use the following values of condensates [@Yang:1993bp; @Ioffe:2002be; @Gimenez:2005nt]: $\langle\bar qq \rangle=-(0.240 \mbox{ GeV})^3$, $\langle\bar ss\rangle=-(0.8\pm 0.1)\times(0.240 \mbox{ GeV})^3$,$\langle g_s^2GG\rangle =(0.48\pm 0.14) \mbox{ GeV}^4$, $ m_u = 5.3 \mbox{ MeV}$, $m_d = 9.4 \mbox{ MeV}$, $m_s(1\mbox{ GeV})=125 \pm 20 \mbox{ MeV}$, $\langle g_s\bar q\sigma G q\rangle=-M_0^2\times\langle\bar qq\rangle$, $M_0^2=(0.8\pm0.2)\mbox{ GeV}^2$. The sum rules are written as power series of the Borel mass $M_B$. Since the Borel transformation suppresses the contributions from $s > M_B$, smaller values are preferred to suppress the continuum contributions also. However, for smaller $M_B$ convergence of the OPE becomes worse. Therefore, we should find an optimal $M_B$ preferably in a small value region. We have found that the minima of such a region are 0.4 GeV for $\sigma$, 0.5 GeV for $\kappa$ and 0.8 GeV for $f_0$ and $a_0$, where the pole contributions reach around 50 % for all cases [@Chen:2006zh]. As $M_B$ is increased, the pole contributions decrease, but the resulting tetraquark masses are stable as shown in Fig. \[pic\_tetra\]. After careful test of the sum rule for a wide range of parameter values of $M_B$ and $s_0$, we have found reliable sum rules, with which we find the masses $ m_\sigma = (0.6 \pm 0.1) \; {\rm GeV}$, $ m_\kappa = (0.8 \pm 0.1) \; {\rm GeV}$, $m_{f_0,a_0} = (1 \pm 0.1) \; {\rm GeV}\; ,$ which are consistent with the experimental results [@Yao:2006px]. For comparison, we have also performed the QCD sum rule analysis using the $\bar q q$ current within the present framework. The stable (weak $M_B$) behavior is obtained with the masses of all four mesons around 1.5 GeV. Here again we have tested various values of $M_B$ and $s_0$, and confirmed that the result shown is optimal. Conclusions =========== We have performed the QCD sum rule analysis with tetraquark currents, which implies the masses of scalar mesons in the region of 600 – 1000 MeV with the ordering, $m_\sigma < m_\kappa < m_{f_0, a_0}$. We have also performed the QCD sum rule analysis with the conventional $\bar q q$ currents, which implies masses around 1.5 GeV. We have tested all possible independent tetraquark currents as well as their linear combinations. Our observation supports a tetraquark structure for low-lying scalar mesons. To test the validity of the tetraquark structure, it is also important to study decay properties, which is often sensitive to the structure of wave functions. Such a tetraquark structure will open an alternative path toward the understanding exotic multiquark dynamics which one does not experience in the conventional hadrons. Acknowledgements {#acknowledgements .unnumbered} ================ H. X. C and A. H. thank the Yukawa Institute for Theoretical Physics at Kyoto University for hospitality during the YKIS2006 on “New Frontiers on QCD”. H.X.C. is grateful to the Monkasho fellowship for supporting his stay at RCNP, Osaka University. A.H. is supported in part by the Grant for Scientific Research ((C) No.16540252) from the Ministry of Education, Culture, Science and Technology, Japan. S.L.Z. was supported by the National Natural Science Foundation of China under Grants 10375003 and 10421503, Ministry of Education of China, FANEDD, Key Grant Project of Chinese Ministry of Education (NO 305001) and SRF for ROCS, SEM. [10]{} E. M. Aitala et al., Phys. Rev. Lett. 86, 770 (2001); M. Ablikim et al., Phys. Lett. B 598, 149 (2004). W. M. Yao [*et al.*]{} \[Particle Data Group\], J. Phys. G [**33**]{}, 1 (2006). T. Hatsuda and T. Kunihiro, Phys. Rept.  [**247**]{}, 221 (1994). R. L. Jaffe, Phys. Rev. D [**15**]{}, 267 (1977). H. J. Lee and N. I. Kochelev, Phys. Lett.  B [**642**]{}, 358 (2006). T. V. Brito, F. S. Navarra, M. Nielsen and M. E. Bracco, Phys. Lett. B [**608**]{}, 69 (2005). A. Zhang, T. Huang and T. G. Steele, arXiv:hep-ph/0612146. E. M. Aitala et al., Phys. Rev. Lett. 89, 121801 (2002); M. Ablikim et al., Phys. Lett. B 633, 681 (2006). H. X. Chen, A. Hosaka and S. L. Zhu, Phys. Rev. D 74, 054001 (2006). T. Umekawa, K. Naito, M. Oka and M. Takizawa, Phys. Rev.  C [**70**]{}, 055205 (2004). M. A. Shifman, A. I. Vainshtein and V. I. Zakharov, Nucl. Phys. B [**147**]{}, 385 (1979). L. J. Reinders, H. Rubinstein and S. Yazaki, Phys. Rept.  [**127**]{}, 1 (1985). K. C. Yang, W. Y. P. Hwang, E. M. Henley and L. S. Kisslinger, Phys. Rev. D [**47**]{}, 3001 (1993). B. L. Ioffe and K. N. Zyablyuk, Eur. Phys. J. C [**27**]{}, 229 (2003). V. Gimenez, V. Lubicz, F. Mescia, V. Porretti and J. Reyes, Eur. Phys. J. C [**41**]{}, 535 (2005). H. X. Chen, A. Hosaka and S. L. Zhu, arXiv:hep-ph/0609163. [^1]: e-mail address: [email protected] [^2]: e-mail address: [email protected] [^3]: e-mail address: [email protected]

Presents The Volkyland Collection! One of the largest VW collections in the world!! 60 years of collecting! Cars are located in Yauco Puerto Rico (a U.S. Territory) Visit the Oldbug Homepage HERE Updated 6/1/19 @ NOTICE!!! The sale of the Volkyland Collection has been completed. Thank you to all who have made a purchase and have inquired. This was a legendary event with incredible response. We are forever grateful for being involved. Visit the Oldbug Sales page HERE

Agorarcha Agorarcha is a genus of moths belonging to the family Tineidae. References Category:Tineidae

{#sp1 .354} {#sp2 .355}

"MOBILE PHONE RINGS" "Oi, mister." "Are you a cockney?" "I'm talking to you." "Are you a cockney?" "Are you a cockney?" "(IMITATES COCKNEY ACCENT) We got ourselves a cockney." "He ain't fuckin' talking!" "What's the matter?" "A fucking London boy." "What the fuck's wrong with him?" "Welcome, stranger, to our city!" "Why not stop off for a relaxing drink or a dance at Duke's?" "Got any spare change, please, mate?" "Thou saIIow remnant of my poisoned love." "My study's ornament." "Thou shell of death." "Once the bright face of my betrothed lady." "When life and beauty naturally fill'd out these ragged imperfections." "Then 'twas a face so far beyond the artificial shine of any woman's bought complexion." "She, when she was dressed in flesh, the old Duke poison'd, because she would not consent unto his lust." "No!" "It's true." "old bones don't lie." "They do when they're in the grave." "When they're at peace they do but these old bones will have no peace until they have... revenge!" "Revenge!" "Revenge!" "Revenge!" "Revenge!" "Men, come." "carlo, do you know a fellow?" " What fellow?" " Any fellow." "I know thee." "Any fellow so he be, a strange, disgested fellow, of iII-contented nature, as it might be, disgraced in former times - a pimp?" "A pimp?" "I need a man who can help me in the business of my heart." "Boy!" "Boy!" "A pimp!" "AII right, boy?" "'Tis but a glamour. 'Tis fake." "It's rubbish." "It's ridiculous." "CROWD CHANTING" " What's that?" " Lord Antonio." "'Tonio!" "'Tonio!" "'Tonio!" "And his lady." "That one is mine." "That virtuous lady?" "fool." "Everyone loves sport, especially in times of difficulty." " I'II have 20 on that." " We rally round our sporting heroes!" "'Tonio!" "'Tonio!" "'Tonio!" "'Tonio!" "'Tonio!" " Those cheers?" " Lord Antonio." "The game?" "The teams yet stand upon the Duke's arrival." "The Duke's Boy and Antonio's Lad locked in anticipation of mortal combat!" "Everyone loves sport, no matter how it's played!" "The Duke!" "That he should do such wicked deeds and yet be Duke." "Go, sister." "Hide your pretty face." "Beware an old man, hot and vicious." "'Age, as in gold, in lust is covetous.'" "CROWD BOOING" "Open 'em up!" "Move it!" "Get back!" "Keep them back!" "Get back!" "It's the Duke and Duchess!" "Keep back the rabble!" "Keep them back!" "Use your tasers!" "Go royal Iecher!" "Go, grey hair'd adultery!" "And thou his Duchess." "Oh, that God would stuff infernal fire into your brittle bones!" "Do I know you, friend?" "Do you know me... more than friend?" "Brother?" " AII right, mate?" " Ah, you fuckin' cunt." "Tension mounts!" "And they're off!" "The Lad shoots, the Boy saves!" "The Lad shoots again!" "Goal!" "It's a thrilling scene." "Brother, you must needs find me a place at court." "I must be near the Duke." "This is strange." "This very e'en, the Duke's first born and heir, Lussurioso, asked me find out for him a strange composed and iII-digested fellow." "This e'en you say?" "Why, brother, this is fate." "It is." "But whose?" "His fate or yours?" "I set my fate at naught, so that I have revenge." "Goal!" "A stunning victory for the Lord Antonio and his lovely wife!" "Your boy disgraces us." "He is a good boy." "He has two left wrists." "Ow!" "And just look at the smile on the Lad's face!" "It says it all!" "Goal!" " Leave me be, sirrah." " I have no like to." "SCREAM" "Men, stand by my person!" "Maybe some assassin threatens the Duke, my Father's head, then the Dukedom will want a head." " Which must be mine!" " Mine!" "Mine!" "For God's sake, somebody help me!" "help!" "hello, what's this?" "A sweet for when I've eaten up my meat?" "Come here." "Go, now!" "Here's danger!" " This lady has need of me" " This is the Duke's son!" "Another blow then, for his Father's sake." "Our plan's dependent on his family's trust." " He did assault my brother?" " He is newly come to the port" "I would have killed him too." "I was prevented." "I Iike him." "Thou hast fucked us royally, brother." "Go and get Daddy!" "It's not fair!" "What hast been?" "Of what profession?" " A bone-setter." " A bone-setter?" "A bawd, my sweet musk cat." "One that sets bones together." "Wondrous knave!" "familiar as an ague!" "I can forget myself in private, but elsewhere, I pray do you remember me." "I am not Duke yet, but will be by and by." "Thou hast been an agent to much knavery then?" "I've witnessed the surrender of 1000 virgins." "I've seen patrimonies wash'd a' pieces!" "Then thou know'st i' th' world strange lust." "Oh, fuIsome lust!" "Drunken procreation, which begets so many drunkards!" "Some fathers dread not, gone to bed in wine, to slide from the mother and cling to the daughter-in-Iaw." "Some uncles are adulterous with their nieces, brothers with brothers' wives." "Oh, hour of incest!" "Any kin now next to the rim a' th' sister is man's meat in these days." "In the morning, when they are up and dress'd and their mask is on, who can perceive this save that eternal eye that sees through flesh and all?" "It is our blood to err, tho' hell gap'd loud:" "Ladies know Lucifer fell, yet still are proud." "Now, sir, I am beyond my depth in lust and I must swim or drown." "AII my desires are level'd toward a virgin not far from hamilton Square, to whom I have convey'd by messenger many wax'd lines full of my neatest spirit and jewels that were able to ravish her without the help of man." "AII this and more, she, fooIish-chaste, sent back." "possible?" "'Tis a rare phoenix, who e'er she be." "If your desires be such, she so resistant." "In troth, my Lord, I'd be reveng'd and marry her." "Push, the dowry of her blood and of her fortunes are both too mean, good enough to be bad withal." "Good enough to provoke any badness, poor enough to be a fit target for my lust." "I'm one of those who can defend." "Marriage is good, yet rather keep a friend." "A very fine religion!" "I will entrust thee with the business of my heart, for I see thou art experienc'd." "You have given it the tang, i' faith, my Lord." "Make known the lady to me and my brain will swell with strange invention." "I'II work it till I expire with speaking." "We thank thee and now receive her name." "It is Castiza." "That's her, out there." "Look." " My sister, oh my sister!" " Dost know her then?" "By sight only." "Her brother did prefer thee to us." "I knew I had seen him before." "We can laugh at that he is dim and easy guIIed." "himself being made the instrument to entice and work his own sister." "'Twas finely manag'd." "Go thou and with a smooth, enchanting tongue bewitch her ears and cheat her of all grace." "Enter upon her chastity." "Give it her thus and say she must expect an invoice for my love." "Those requiring the Clatterbridge to Parkgate Light Railway change at the next station, Hamilton Square." "How if money will not tempt her from her virtue?" "Why, then venture upon the mother and with gifts as I will furnish thee, begin with her." "Fie, Iar, that's wrong!" "'Tis mere impossible that a mother by any gifts should become a madam to her own daughter!" "Nay, then I see thou 'rt but a puny in the subtle mysteries of a woman." "Why, the name of madam is so in league with age," "nowadays it does eclipse three-quarters of a mother." "Now then, swear to be true in all." "Swear?" "I hope your honour little doubts my faith." "Yet for my humour's sake, 'cause I Iove swearing." "'Cause you love swearing, 'sIud, I will." "Oh, daughter, daughter." "I know he smiled at thee." "He, the Duke's son." "He smiled and my angel guardian wept." "Maids and their honours are like poor beginners." "Were sin not rich there would be fewer sinners." "Oh, why had not virtue a revenue?" "I know the cause, 'twouId have impoverish'd hell." "Nice one, girl." "For your brother and for all poor souls at sea." "Who are you?" "Is this my mother's jewel?" "Then give it back." "I came not to steal but to give..." "this for you." " Whence comes it?" " From a mighty friend!" "From whom?" " The Duke's son!" " Receive that!" "Take care, lest I bite you back." "I swore I'd put anger in my hand and pass the virgin limits of myself to him who next appear'd in that base office to be the agent of his sin." "tell him my honour shall have a rich name while several harIots share his with shame." "farewell." "Commend me to him... in my hate!" "I know your face." " I think not." " Yet I have seen it before." "When last we met you stood not higher than the altitude of a heeled shoe." " You knew me not then and not now." " Yet I do know you." "For something of myself I do discern in thee." "I have two legs and you have two and Christ loves both of us alike..." "I hope." "I think..." "Dare I think this?" "You are my brother." "You are my sister and I'm home." "And I welcome you with a slap!" "It was the sweetest slap that e'er my nose came nigh." "I'II love this blow forever and this cheek shall still hence forward be my favourite." "It is not kind for kin to put each other to the test." "I was employed to do it but you were constant and thou hast right honourable shown." "Thou art approved forever in my thoughts." "I knew my honour already..." "without your test." "DOOR CREAKS" "It was not kind." "My mother?" " I must test her too." " What?" "No!" "I'm employed to do it." "Castiza?" "What a coil is here?" "Who's here?" "Our mighty expectation, Lussurioso, son of the Duke, commends himself to your affection." " I am his servant and so yours." " The Duke's?" "His son's, who shall be Duke." "An honour just the same, sir." "I'm much honour'd to find that he is pleased to rank me in his thoughts." "Mother, I think you know this man." "Hush, child." "I'm beginning to know him." "Go on, sir." "My master will be Duke hereafter." "The crown gapes for him every tide." "The old Duke's days are numbered." "How bless'd were they now that could pleasure Lussurioso." " E'en with anything." " Save with honour." "Oh, save with their honour, clearly." "As for honour, I'd let a bit of that go too, and never be seen in't." " I'd wink and let it go." " But we would not." "'Tis so, Mama?" "No, we would not." "Not for a ruby." "It is not well done to use her thus" "To keep my promise, I must lay siege unto my mother." "What of 't?" "A siren's tongue could not bewitch her, not in such a case surely." "The old Duke's days are numbered." "After him, my master will be Duke." "Now, that same man, my master, has long desir'd your daughter." "What of it?" "'Tis naught." "Not so, Mama?" "Now he desires that will command hereafter." "That's true." "He will command hereafter." "Do not proceed." "Madam, ' 'tis no shame to be bad, because 'tis common.'" " Ay, that is a comfort." " A comfort!" "Can these persuade you to forget heaven?" "Mother, in the name of Christ, tell this man you want none of his dishonourable act." "Think upon the palace's pleasures." "Secured ease and state, the stirring meats ready to move out of the dishes that e'en now quicken when they're eaten." "Banquets abroad by torchlight, music, sports, nine coaches waiting." " Hurry, hurry, hurry!" " Ay, to the devil." "Hey, girl." "Who'd sit at home in a neglected room, dealing her short-Iiv'd beauty to the waII-hangings, when those poorer in face and fortune than herself carry 100 acres on their back?" "I cry you mercy." "Lady, I mistook you." "Pray, did you see my mother?" "Which way went she?" "Pray God I have not lost her." "UngratefuI!" "Sir, would you address your mother so?" "alas, I too have lost my mother." "Aahhh..." "Peevish!" "Coy!" "foolish!" "Sir!" "Sir." "Return my answer to your future Duke, my Lord shall be most welcome when his pleasure conducts him this way." "I will sway mine own." "Women with women can work best alone." "Indeed, I'II tell him so." "Sir!" "Sir!" "Do I know thee?" "My daughter says I know thee." "From some other time or some other place before?" "Madam, if you know me not - you know me not." "Sir..." "Sir!" "The jewel, sir." "The jewel." "Oh, more uncivil, more unnatural, than those base-titIed creatures that look downward!" "Why does not heaven turn black or with a frown undo the world?" "Why does not earth strike at the sins that tread on it?" "Oh, wer't not for gold and women, there would be no damnation!" "But 'twas decree'd before the world began, that they shall be the hooks to catch a man." "Her mother took the jewel?" "She should be damn'd before the daughter." "That's good manners, my Lord." "The mother for her age goes foremost, you know." "She took the jewel, that's good." "gold, tho' it be dumb, does utter the best thanks." "The mother has proved herself a whore, therefore the sons and daughters were born whores, which is what we want." "I have mentioned that I am to be Duke after my father." "Once or twice." "It pricks my brothers' hearts to envy, that I am considered great whilst they are but my brothers." " Get off my shoe!" " Watch." "tell me how they look at me." "Give me back my shoe!" "Get off, fuck off!" "Get off, you fuck!" "Why have they locked me here?" "Hush." "One of the Duke, my husband's words, will set you free, from death or durance." "You will walk with bold feet upon the thorny law." "His withered Grace don't love me like the others, Mother." "Hush, hush, you are our dearest child." "Fear not." "CHAIN RATTLES" "Oh, Junior." " Hush now." " I Iove you, Mummy." " She should not be here." " She is safe here with her brothers." "Beauty is nowhere safe." "That virtuous lady." "A fair comeIy building newly fallen, being falsely undermin'd." "Duchess, it is your youngest son." "Our youngest." "We're sorry his violent act hath e'en draw blood of honour and stained our honours." "Your Grace hath spoke like to your silver years, full of confirmed gravity, for what is it to have a flattering false inscuIption on a tomb" "and in men's hearts reproach?" " I leave him to your sentence." " Rise." "Doom him, Lords, while I sit by and sigh." "My gracious Lord, I pray be merciful." "although his trespass far exceed his years, he is your own, as I am yours, call him not stepson." "Temper his faults with pity." "I beseech your Grace, be soft and mild." "Let not relentless law" "look with an iron forehead on our brother." " Let the offender stand forth." " No pity yet?" "Must I rise fruitless then?" "Are my knees of such low mettIe that without mercy..." "'Tis the Duke's pleasure that impartial doom take fast hold of his unclean attempt." "A rape!" "Why 'tis the very core of lust and which was worse, committed on the Lord Antonio's wife," "that chaste and upright lady." "Confess, my Lord, what moved you to 't?" "Why, flesh and blood." "What should move man to woman else?" "Do not jest thy doom, play not with death." "The law is a wise serpent and quickly can beguile thee of thy life." "That lady's name has spread such a fair wing that if our tongues were sparing toward the fact, judgement itself would be condemned." "well, hmm, 'tis done." "And 'twould please me to do it again." "What?" "Sure, she's a goddess, for I'd no power to see her and to live." "It faIIs out true in this for I must die." "No!" "Her beauty was ordained to be my scaffold and yet methinks I might be easier ceased." "My fault being sport," "let me but die in jest." "This be the doom irrevocable." "Oh, keep't upon your tongue," "let it not slip, death too soon steals out of a lawyer's lip." "Now, now he dies!" "Rid 'im away." " Tomorrow early." " Pray, stay abed, my Lord!" " Let that offender be..." " Live and be in health." "Be on a scaffold." " No!" " hold!" "hold!" "Pox on't." "What makes my dad speak now?" "We do defer judgement until next sitting." "In the meantime, Iet him be kept prisoner." "What, prisoner?" "No!" "Mother!" "Mother!" "delayed, deferred and if judgement have cold blood, then flattery and bribes will kill it quite." "will he live then?" "He will, my Lady." "'My Lord,' she said, 'shaII be most welcome, 'when next his pleasure brings him forth this way.'" "That shall be soon." "I have no way to cross it now but to kill him." "kill Lussurioso?" "What of the Duke?" "I'II murder both." "You will be busy, brother." "'Tis true an old man is twice the child." "Mine cannot speak, yet one single word from him would quite save my son!" "Hush, Mother, he will be free by and by." "The Gods protect our sister." "Here's a plan as neat as apples from the bough how I may speed away the old Duke and his son." " What?" " Watch." "carlo, leave us, Laughing Boy." "A third man's dangerous, especially her brother." "'Tonio!" "'Tonio!" "'Tonio!" "'Tonio!" "Every day another thousand voices raised to his account." "There's one bastard envies me my Dukedom." "There's more than one, my Lord." "Your brother, Spurio." "Spurio?" " I can bring forth proof that..." " Hush." "Not here." "Come." "Here we are in th' intestines of my father's palace." "'Tis the deepest art to study man." "I'm well practised at it." "I find you are a fellow of discourse, weII-mingIed, whose brain time hath season'd, suitable both to my service and my company." "Your estate should be more fellow to your mind." "Trust me with thy preferment." "Thanks, my loved Lord." "Now tell me of my brother's plots." "Who's in with him?" "'Tonio who the mob loves so?" "Sir, your mother." "The Duke your father is worthily abus'd." "My brother and my mother - entangled?" "This night, this hour, this minute, now." "MOANING" "What?" "What?" "Oh, sin foul and deep, great faults are wink'd at when the Duke's asleep!" "horrible." "I am mad!" "I will confound them." "But what proofs?" "What need of proofs when you may take 'em... twisted?" " Where is that villain?" " softly, my Lord." "BED SQUEAKS" " This room?" " My mother's." "Ah!" "I cannot." "Then Spurio will stab you, as he stabs your Mother." "I'II kill 'em doubled, while they're heap'd!" "Soft, my Lord." "villain, strumpet!" "SIapper!" "Treason, treason!" "Right, you upper guards defend us!" "Oh no, take me not in sleep." "No, I have great sins." "I must have days, nay, months, dear son with penitential sighs to lift 'em out and not to die in sin!" "Thou wilt kill me both in heaven and hell!" "I'm amaz'd to death." "Nay!" "villain, traitor worse than the foulest epithet, now I'II gripe thee e'en with the nerves of wrath, and throw thy head among the lawyers!" "Guard!" "How comes our dad disturb'd?" "This boy, who should be myself after me would be myself before me, and in the heat of this ambition bIoodiIy rush'd in intending to depose me in my bed." "Dad." "Duty and natural loyalty forfend!" "He call'd his father villain and me sIapper, a word I abhor to 'file my lips with." "That was not so well done, brother." "I know there's no excuse can do me good." "Shh." "His vicious purpose to our sister's honour's cross'd beyond our thought." "Is the Duke dead?" "would he had kill'd him, 'twouId have eas'd our swords." "Be comforted, he will die." "To prison with the villain!" "Death shall not long lag after him." "Oh, be comforted, our Duchess, he shall die." "Then the truth of my intent shall out." "Lord and Father..." "My best release lies upon your tongues, pray persuade for me." "We'II sweat in pleading." "And I may live to thank thee." "His death shall thank me better." "Now, brothers, Iet our hate and love be woven so subtly together, that in speaking one word for his life, we may make three for his death." "The craftiest pIeader gets the most gold for breath." "Mother." "Is't possible a son should be disobedient as far as the sword?" "It is the highest, he can go no further." " My gracious Lord, take pity..." " Pity?" "We'd be loath to move your Grace." "The trespass is unpardonable..." "black, wicked and unnatural." "In a son, oh, monstrous!" "Yet, my Lord, a Duke's soft hand strokes the rough head of law and makes it lie smooth." "But this hand shall ne'er do 't." "That as you please, my Lord." "We must needs confess." "Some fathers would have seen the execution sound without corrupted favour." "But your Grace may live the wonder of all times in pardoning that offence which never yet had face to beg a pardon." " What's this?" " Forgive him." "Good my Lord, he is your own son and I needs must say 'twas the viIdIier done." "He's the next heir, yet this truth gathers - there's none can possess that dispossess their fathers." "Be merciful." "You have prevail'd." "My wrath like flaming wax hath spent itself." "I know 'twas but some peevish moon in him." "Go, Iet him be releas'd." "'Sfoot." "How now, brother?" "Your Grace doth please to speak beside your spleen." " I would it were so happy." " Go, release him." "Oh, my good Lord," "I know the fault's too weighty and full of general loathing, too inhuman, rather by all men's voices worthy..." "Death." "Death." "'Tis true too." "Right, then." "Take this." "Doom shall pass." "Direct this to the judges." "He shall be dead 'ere many days." " Make haste!" " AII speed that may be." "We could have wish'd his burden not so sore." "We know your Grace did but delay before." "It well becomes that judge to nod at crimes that does commit greater himself... and lives." "Many a beauty have I turn'd to poison for rejecting me... covetous of all." "Age hot is like a monster to be seen." "My hairs are white, but yet my sins are green." "Brother, Iet my opinion sway you once," "I speak it for the best, to have him die." "Surest and soonest." "If the signature come unto the judges' hands, why, then his doom will be deferr'd till sittings and court days, juries and further." "Faiths are bought and sold." "Oaths in these days are but the skin of gold." "In troth, 'tis true too!" "Then straight to the officers and let the judges wait." "'Tis but mistaking our father's meaning, and where he nam'd, 'Ere many days'." "'Tis but forgetting that and have him die... now." "CREAKING" "SCREW FALLS TO FLOOR" "Brothers?" "Are you there?" "You!" "You lied to me!" "You brought me to this pass." "If I'd lied to you, would I now try to deliver you?" "You've been deceived but not by me." "If you'd as life stay here, then do." "I'II close the breach." "Oh, you commanded me to keep watch upon your envious brothers." "Know that they intend to speed your execution" "lest your father makes alteration of his edict." "They want me killed?" "In a word." "I'm much indebted to your love for this." "O Liberty!" "Thou sweet and heavenly dame." "But hell for prison is too mild a name." "Officers, here is the Duke's signature." "We are sorry that we are so unnaturally employ'd in such an unkind office." "Fitter far for enemies than brothers." "But you know, the Duke's command must be obey'd." " This morning then." "So suddenly?" " Ay, alas, poor good soul." "The executioner stands ready to put forth his cowardly vaIour." "Ready?" "Ready?" "already, i'faith." "We'II take our leaves." "Our office shall be sound." "We'II not delay the third part of a minute." "Therein you show yourselves good men and upright officers." "Pray, Iet him die as private as he may." "Do that for him, for the gaping people will but trouble him at his prayers." "It shall be done." "Why, we do thank you and if we live to be... you shall have a better office." "Commend us to the scaffold - in our tears." "We'II do your commendations." "Destruction hies." "Fine fools in office!" " Things fall out so fit." " So happily!" "'Ere next clock, his head will be made serve a bigger block." "excellent!" "Now I am heir, Duke in a minute." "The falling of one head lifts up another." "The Duke's son was in here." "There is another one, two cells down." " But his death's not commanded." " Let's have a look." "'My son', no name, save only that, 'my son'." "well, he is his son, though his neck's somewhat thicker." "Keeper?" "My Lord." "No news lately from our brothers?" "Are they unmindfuI of us?" "My Lord, they left a message while you slept." "What was it?" "They said, be of good cheer, you will not be long a prisoner." "That brings me no comfort!" "I should've look'd for my release had they been worth their oaths." "How now!" "What news?" "Bad news, my Lord." "I am discharg'd of you." "slave, call'st thou that bad news?" "I thank you, my brothers!" "'TwiII prove so - this is the officer into whose hands I must commit you." "Pardon us, my Lord." "Our office must be sound." "Here is our warrant, signed by the Duke." "You must prepare to die." " Sure 'tis not so." " It is too true." "I tell you 'tis not, for the Duke," "my father, has deferr'd me till the next sitting and I Iook e'en every minute, threescore times an hour, for a release." "A trick wrought by my big brothers." "A trick, my Lord?" "Your hopes are as fruitless as a barren woman." "Your brothers brought this powerful token for your death." "My brothers?" "Desire 'em hither!" "call 'em up, they shall deny it to your faces." "They're long gone." "The command they left, when grief swum in their eyes." "They were like brothers, full of heavy sorrow but the Duke must..." "have his pleasure." "The hour beckons, my Lord." "Lift your eyes up to heaven." "Thank you, faith, good, pretty wholesome counsel." "I should, er, look up to the, er, heavens, as you said, whilst he behind me cheats me of my head!" "Ey, ah?" "That's the trick." "You delay too long, my Lord." "Stay, good authority's bastards." "If I must die through my brothers' perjury," "let me venom their souls with curses!" "'Tis no time to curse." "But my fault was sweet sport, which the world approves!" "I die for that which every woman loves." "No!" "Is our conspiracy discover'd?" "Drive over them." " My long grief..." " Hush, brother." "Listen." "I will cut into short words." "Last reveIIing night, when fIoodIight made an artificial noon at Aintree, some courtiers at the match..." "Oh, Christ." "She's dead." "As cold in lust as she is now in death," "which that step-duchess' monster knew too well." "Then, with a face more impudent than his vizard," "he harried her amidst a throng of panders and fed the ravenous vulture of his lust!" "Oh, death, to think on't!" "She her honour forc'd, deem'd it a greater dowry to her name." "To die with poison than to live with shame." "behold, my Lords." "A sight that strikes man out of me." "I had not mark'd that before - a prayer book," "with a page turn'd up, pointing to these words," "'MeIius virtute mori quam per dedicus vivere.'" "'Better to die virtuous than to live dishonoured.'" "'Tonio!" "'Tonio!" "'Tonio!" "'Tonio!" "'Tonio!" "Look!" "Look!" "The bullet went in there." "Back of the head." "Not at point blank range." "She'd need to be a doubIe-jointed octopus." "She did not top herself." "And, and, and, I heard someone say there were two different bullets." "So, er, what are you saying?" "I'm saying the Duke's lot saw her off." "Yeah, or Antonio's?" " The noble Lord Antonio's!" " Yeah, why not?" "Stitch that!" " Was it suicide, then?" " Sure it was." "I would do the same if he should come near me." " No, you wouldn't." " I would." " You wouldn't commit suicide." " I would." "Are you a cockney?" "What about you?" "Of course I am, you three cornered hats." "He's a fuckin' cockney!" "Sister." "Here he is!" "Fuckin' 'ell!" "Passengers are reminded that smoking is no longer permitted on Merseyrail trains or underground stations." "There is no safety here." "Here I am safest, here with my brothers." "Was not this execution rarely plotted?" "I am the Duke's heir now." "You may thank my policy for that." "Your policy for what?" "Was it not my invention, brother to slip the judges, and in lesser compass, advising you to sudden execution?" "Heart, 'twas a thing I thought on too." "You thought on't too!" "slander not your thoughts with glorious untruth!" "'Twas not so." "Sir, I say 'twas in my head." "Like your brains, ne'er to make their presence felt as long as you liv'd." "You'd have the honour on't, that your wit led him to the scaffold?" "Since it is my due, I'II publish 't, but I'II have it in spite of you." "Methinks y'are too bold, you should little remember us, next to be honest Duke." "should be as easy for you to be Duke as to be honest, and that's never in faith." "well, cold he is by this time, because we're both ambitious." "Be it our amity, and let the glory be shared equally." "I am content to that." "Here's where our older brother's corse lies in state." "excellent!" "Now brother, all's sure our own." "Canst weep, think'st thou?" "'TwouId grace our flattery much." "Think of some dame." "I'II try." "Now for yourself." "Our sorrows are so fluent." "Our eyes o'erfIow our tongues." "Words spoke in tears are like the murmurs of the waters." "The sound is loudly heard, but cannot be distinguish'd." "How died he, pray?" "full of rage and spleen!" "He died most valiantly then." "We're glad to hear it." " We could not woo him once to pray." " He show'd himself a gentleman." "But instead of prayer, he, he drew forth oaths." "Then did he pray, dear, dear heart, although you knew it not." "My Lords, e'en at his last, with pardon be it spoke, he curs'd you both." "He curs'd us?" "'Las, good soul!" "It was not in our power, but the Duke's pleasure!" "Now, my Lords." " Sweet heaven, defend us!" " Sweet heaven, defend us!" "Why do you shun me, brothers?" "The saviour of the prison has forsook me." "I thank such sweet Lords as yourselves I'm free." " In health!" " ReIeas'd!" "We are both e'en amaz'd with, with joy to, to see it." "We are much to thank thee." "Faith, we spar'd no tongue unto my Lord the Duke." "Your delivery had not been half so sudden but for us." "God, how we pleaded!" " My deserving brothers..." " No!" "In my best dreams I will think on it." "Saw you not their guilt, crawling like maggots on the faces of dead men?" "Be sure I did." "Oh, death and vengeance!" "hell and torments!" "slave, cam'st thou to delude us?" "DeIude you, my Lords?" "villain, whose is this corse now?" "Why your brother and the Duke's son." "plagues!" "Confusions!" " Darkness!" " devils!" "Our younger brother." "There's no advantage in the killing of a younger brother!" "villain, I'II kill thee!" "Fuck off, you cheap pair of bastards." "The devil overtake thee!" "Oh, fatal!" "Oh, most prodigious to our bloods!" "Did we dissembIe?" "Did we make our tears women for thee?" "Laugh and rejoice for thee?" "You had a wile, you had a trick, forsooth!" "The clap eat them!" "There's none of these wiles ever come to any good." "There's nothing sure in mortality but mortality." "Whose fault is this catastrophe?" "We know not, sir." " The fates." " Not us, sir." "We'II leave you to your grief, good sir." "shall I kill him th' wrong side now?" "No." "Sword, thou wast never a back-biter yet." "I'II pierce him to his face, he shall die looking upon me." "My veins are swell'd with lust." "This shall unfiII 'em." "Great men were gods if beggars couldn't kill 'em." "Sirrah, I know thee." "Come..." "Are you not a pandar, or a pimp?" "Did you not provide a lady for my son?" " I was commanded" " Yeah, good, good." "Can you do likewise for me?" "could you not meet me with a lady in some fair place, veil'd from the eyes of th' court, some darkened bIushIess angle?" "My Lord, I couId." "An unsunn'd lodge wherein 'tis night at noon." "And a lady." "You know a lady?" "One with two heaven pointed diamonds set for eyes in a face." "Far far beyond the artificial shine of any woman's bought complexion." "I had such a one before." "She would not consent unto my lust." "I had to have her killed." "I had my way with her, thereafter." "Sir..." "I will collect you." "Soon, soon." "You will rest easy." " Where's the lady?" " You shall be witness." "Be ready." "Stand with your hats off." "Ah!" "Art thou beguiI'd now?" "Have I not fitted the old surfeiter with a quaint piece of beauty?" "Age and bare bone are e'er allied in action." "Here's an eye able to tempt a great man to serve God." "A pretty, hanging lip that has forgot now how to dissemble." "This mouth should make a swearer tremble, a drunkard clasp his teeth and not undo 'em." "To suffer wet damnation." "Is this the form that living shone so bright?" "Oh fuckin' 'ell, mate." "What are you gonna do with her?" "He had me once and now he shall again!" "Does every proud and seIf-affecting dame camphor her face for this and grieve her maker with sinful baths of milk, when many an infant starves, for her superfluous outside, all for this?" "Who now bids ¡Ì20 a night, prepares music, perfumes and sweetmeats?" "AII are hush'd." "Thou mayst lie chaste now!" "It were fine to have thee seen at revels, forgetful feasts and unclean brothels!" "Sure, 'twould fright the sinner and make him a good coward." "Put a reveller out of his antic ambIe and cIoy an epicure with empty dishes." "Here, might a scornful and ambitious woman" "look through and through herself." "See, ladies, with false forms you deceive men but you cannot deceive worms!" "Up and down, up and down, till they're clean and sparkly." "What is it?" "Poison." "You'II help me in my deadly enterprise?" "Thanks." "Thank you." "You have leave to leave me." "If I'm missed by the Duchess, say I am privately rid forth." "What, here?" "GIRL SCREAMING" "(SOFTLY) Someone's near." "Another pair of lovers." "This is a most excellent place in which to score." "MOANING" "Who's that?" " 'Tis her." " What?" "'Tis yours." "What lady is't?" "A country lady, a little bashful at first, but after the first kiss, the worst is past with them." "You know now what you have to do." " She's a somewhat grave look." " No, I Iove that best." "In gravest looks the greatest faults seem less." "Give me that sin that's rob'd in holiness." "Take this, 'twiII stiffen your resolve." "Cover your eyes, lest her beauty blind you." "Madam, his Grace will not be absent long." "Is all truly secret?" "I heard another pair of lovers." "Is that her?" "Her voice is sweet." "Secret?" "Never doubt us, madam." "'TwiII be worth three velvet gowns to your ladyship." "How sweet can a Duke breathe?" "pleasure dwells within a perfumed mist." "Oh, lady, sweetly encount'red." "Sir, be bold with me, kiss my lips." "Madam, I will." " What's this?" " royal villain, white devil!" "Brother, give us light!" "That his affrighted eyeballs may start unto those hollows." "Duke dost see yon dreadful vizard?" "View it well." "'Tis GIoriana's skull, whom thou poisoned'st last." " It has poisoned me!" " Didst not know that till now?" "call treason!" "Yes, my good Lord." "Treason, treason, treason!" "Oh, then I'm betray'd!" "Poor Iecher in the hands of knaves." "A slavish Duke is baser than his slaves." "My teeth are eaten out!" "Hadst any left?" "Then those that did eat are eaten." "My tongue!" "'TwiII teach you to kiss closer." " You have eyes still?" " They hurt." "The pill was a potion to prevent blinking." "I gave it that thou'd miss not one blinking moment of all this." "'Tis but early yet." "Now I'II begin to stick thy soul with ulcers." "I will make thy spirit grievous sore." "It shall not rest but like some pestiIent man toss in thy breast." "Mark me, Duke, thou'rt a renowned, high, and mighty cuckold." "Had not that kiss a taste of sin?" "Why, there's no pleasure but 'tis sinful." "Nay, to afflict thee more, here in this lodge, they meet for damned clips." "Those eyes shall see the incest of their lips." "carlo!" "Sweet Christ!" "Brother, I do applaud thy constant vengeance, the quaintness of thy malice above thought." "CASTIZA LAUGHING" "The fIy-fIop of vengeance beat 'em to pieces!" "This was the sweetest occasion, the fittest hour, to make my revenge." "Oh, my heart wears feathers that before wore lead." "The Duke is dead, dead, dead, dead!" "Over whose roof hangs this prodigious comet In deadly fire?" " A blessing on our enterprise." " Sweet angel of revenge." "HUMMING" "Who has seen the Duke my Father?" "You saw you my Lord and Father?" "And you?" "And you?" "Or you?" "What of you?" "well, well, he's sure from court, but where, which way his pleasure took, we know not, nor can hear on't." "I heard he privately rode forth." "'Twas wondrous private." "No-one in court has any knowledge of it." "My husband is old and sudden." "'Tis not treason to say he has a humour or such a toy about him." "I think he's privately rid forth from shame, from infamy, from this house of incestuous scheming." "Yo..." "Brother..." "Is that not... oh." "It's him!" "I say, it is." "Very nice, brother." "When the Duke sees this, you are..." "The Duke is fled from shame, and so the Duke is here, in my person." " Never the Duke!" " until he is returned!" "until he does return!" "until he is returned!" "So..." "Guards!" " Let her be kept close prisoner." " I am not going to be kept" " Guards, take both of them." " Don't you touch my little spud!" " Spud, go home!" " Bye, brother!" "Are you so barbarous to set iron nipples upon these breasts that gave you suck?" "Yes." "Oh, am I not your mother?" "Thou dost usurp that title now by fraud, for in that shell of mother is a bawd." "Come on, Duchess." "Brother and Lords, what's for breakfast?" " Piss off." " Oh, sorry, Iar..." "Shocking news broke today, as the Duchess and her son, Spurio were found in a compromising position." "Our own dam was the worser." "The Duchess made a whore out of herself, our ma a whore out of her daughter." "The Duke's son's great concubine!" "A drab of state, a cIoth-a'-silver slut." "To have her train borne up and her soul trail I' th' dirt." "Great!" "Never just the Duke's son." "First begins with one hen after, to 1000 proves a whore." "'Break ice in one place, it will crack in more.'" "Oh, thou for whom no name is bad enough!" "Son?" "Is this my son come back?" "And do you know me now?" "Wicked unnatural parent!" "Fiend of women!" "Did not the Duke's son direct a fellow of the world's condition hither, that did corrupt thee, made thee unciviIIy forget thyself and work our sister to his lust?" "Who, I?" "That had been monstrous!" "I defy that man for any such intent, ain't none lives so pure but shall be soil'd with slander." " Good son, believe it not." " He was that man!" "You?" "My own son, tricked me?" "In that disguise, I was sent by the Duke's son." "He tried you and found you base metal as any villain might have done." "A rich man tricked a beggar." "This is news, is it?" "It's good?" "nimble in damnation, quick in tune." "There's no devil could strike fire so soon!" "Sons!" "Forgive me." "To my own self I'II prove true." "You that should honour me, I kneel to you." "Nay." "Brother, it rains, 'twiII harm your dagger." "House it." "'Tis done." "I'faith, 'tis a sweet shower, it does much good." "Rise, mother, troth, this shower has made you higher." "To weep is to our sex naturally given, but to weep truly, that's a gift from heaven." "Nay, I'II kiss you now." "Kiss her, brother." "Let's marry her to our souls, wherein's no lust and honourably love her." "Let it be." "I'II give you this, that one I never knew." "plead better for and against the devil than you." "Thou make me proud on't." " Thy name, I have forgot it." " Vindici, my Lord." " 'Tis a good name." " Yeah, a revenger." "It does betoken courage, thou shouldst be valiant and kill thine enemies." "That's my hope, my Lord." "CHUCKLES" "tell me, what has made thee so melancholy?" "Why?" "To think how a great, rich man lies a-dying and a poor cobbler tolls the bell for him" "or how a usuring father boils in hell and his son-and-heir, with a whore, dances over him." "There is hope in you for discontent and want is the best clay to mould a villain of." "You know I might advance you and build fair your fortunes for it might be in me to rear up towers from cottages." "I will unbrace such a close, private villain unto your vengeful sword, the like ne'er heard of." "What's his sin?" "He is a royal Iecher." "royal... and a lecher and royally a lecher." "More than once when one would not consent unto his lust, he had them poisoned." "What's his name?" "You know him." "Oh, thou almighty patience, 'tis my wonder that such a fellow, impudent and wicked, should not be cloven as he stood or with some secret wind burst open!" "Is there no thunder left, or is't kept up in stock for some heavier vengeance?" "THUNDER RUMBLES" "There it goes!" " What?" " Nothing." "Thunder." " I have imprison'd my own mother." " I know." "If the Duke returns then 'tis treason." "Oh, yeah." "If?" "If... he comes not back..." "Who shall be Duke then?" "Me!" "I shall." "Did I not say so?" "I think you did." "So swear!" " You still love swearing." " Swear!" "My Lord, it shall be so." "SCREAMING" "Thus much by wit a deep revenger can pull off." "When murder's known to be the fardest off." "Oh, villain!" "Oh, rogue!" "Oh, slave!" "Oh, rascal!" "Reverend majesty." "My father the Duke murdered." " old Dad dead." " His lips are gnawn with poison." "Where was that slave that did affirm to us?" "My Lord, the Duke was privately rid forth?" "Oh, pardon me, my Lord, he gave that charge upon my Iife to answer thus if he was miss'd at court." "In fact, he was with a lady." "Heavens, that false charge was his death!" "No." "Impudent beggar, durst you to our face maintain such a false story?" "Bear him straight to execution!" "It's not right." "You've sentenced bollocks..." "Urge me no more." "In this the excuse may be call'd half the murther." "Away, Iet it be done." "My Lord, we're something bold to know our duty." "Your father's accidentally departed." "The titles that were due to him meet you." "Meet me?" "I am not at leisure, my good Lord." "I've many griefs to dispatch." "welcome, sweet tities." "Lords, talk to me of sepuIchers and mighty emperors' bones, that's thought for me." "My Lord, it is your shine must comfort us." "alas, I shine in tears like the april sun." "You are now my Lord's Grace." "I perceive you'II have it so." "'Tis, but your own." "Hooray for our brother the Duke." "Hooray!" "Hooray!" "Hooray!" "Then heavens give me grace to be so." "Hooray!" "In the mean season, Iet us bethink the latest funeral honours due to the dead Duke's cold body, and withal, calling to memory our new happiness spread in his royal son." "gentlemen, Lords... prepare for revels." "Time hath several falls." "Griefs lift up joys and feasts put down funerals." "ReveIs, revels..." "Yes!" "Leave me... to my grief." "One thing." "That girl." "Castiza." "The one I tried but failed to woo." "Now that you're Duke, you'II have no need of her." " You can have any that you choose." " I choose her." "Now I have no need to woo." "Now I command." "Echo!" "Echo!" "Echo!" " Is she here?" " She comes, my Lord." "She will come, certainly." "I'II see to that." "I'm not pleas'd by that iII-knotted fire, that bushing, flaring star." " Am not I Duke?" " Yes, yes, you are, yes." "They say, whom art and learning weds, when stars wear locks, they threaten great men's heads." "So, please your Grace, it shows great anger." "That does not please my Grace." "Yet here's the comfort, my Lord." "Many times when it seems most, it threatens fardest off." "Faith... and I think so too." "Here, take this." "I'II start my Dukedom with my mother's banishment." "Hooray!" "Castiza, a virgin's honour is a crystal tower which being weak is closely guarded with good spirits until she baseIy yields no ill inherits." "HippoIito, shut up." "'Know that I am now at last come to be the Duke." "Let it be known that you no Ionger hold the title 'Mother' for crimes of incest and for crimes of intriguing against this state." "I, the Duke, banish thee, woman, to withdraw yourself beyond the bounds of the gracious state of our great city!" "Know that I am now at last come to be the Duke...'" "Shut up!" "'..and with the titles and grace that descends upon me, Iet it be known that you no Ionger hold the title, 'Mother'!" "'" "Is that fiery thing still there?" "'When beggars die, there are no comets seen!" "'" "You're gracefully establish'd with the loves of your subjects and for natural death, I hope it be threescore year a-coming." "True." "No more but threescore year?" " Fourscore I hope, my Lord." " And fivescore." "I hope, my Lord, that you should never die." "Give me thy hand." "These others I rebuke." "He that hopes so, is fittest for a Duke." "Thou shalt sit next to me." "Take thy places, Lords." "We are ready for sports." "Let 'em set on." "You thing, we shall forget you quite anon!" "Our brother shall not live." "His hair shall not grow much longer." "Saws't thou yon new moon?" "It shall out-Iive the new Duke by much." "This hand shall dispossess him then we are mighty!" "Is't so?" "'Twas very good." "Do you think to be Duke then, kind brother?" "I'II see fair play drop one and there lies t'other." "'Tis well." "Brothers and bastard, you dance next in hell." " A volunteer." " Me!" "Pick me!" "Me!" "Me!" "Who'II be our volunteer?" "Pick me." "Me." "No, don't pick him." "pistols!" "Treason!" "Guards!" "help!" " My Lord, the Duke, is murder'd!" " No, I'm not." "Surgeons!" " Surgeons!" "Surgeons!" " How now?" " Murdered?" " Murdered!" "How fares, my Lord?" "farewell to all." "He that climbs highest has the greatest fall." " My tongue is out of office." " Air, gentlemen!" "Thou'It not prate on't, 'twas Vindici murdered thee." " Which one is he?" " Me!" " Thee?" " tell nobody." "Whose groan was that?" "That's thee and thy Father to my account." "Great heavens, the Duke's departed!" "Here's a labour sav'd." "I thought to have sped him." "How came this?" "Then I proclaim myself now I am Duke." "Thou Duke?" "Reverend majesty!" "Brother, thou liest." "slave, so dost thou!" "Base villain, has thou slain my Lord and master?" "A piteous tragedy... able to make an old man's eyes bloodshot." "Oh, unhand her there." "Most fitting revels." "This one killed all these." "None but Spurio, I and maybe Supervacuo." "It was a girl who killed the Duke." "A deadly hand wounded him." "The rest, ambitious who should rule and sway after his death were quickly made away." "'Tonio!" "'Tonio!" "'Tonio!" "'Tonio!" "AII our hope lies in you." "Your hair will make the silver age again." "When there was fewer but more honest men." "The burden's weighty and will press age down." "May I so rule that heaven may keep the crown." "The rapes of your lady and of mine, have been quitted with death on death - my work is done." "Here's the payment." "God speed." "will you not stay?" "Aye... um, stay a minute longer, huh?" "Of all things, it puts me most to wonder, how the old Duke came murd'red." "'Twas all done for the best." "AII for your Grace's good." "We may be so bold to speak it now." "'Twas somewhat wittiIy carried, tho' I say it." "I murd'red him." " You?" " well, we, two." "None else, twas I alone." "If you look into his ribs, you'II find my knife." "Thanks." "I have sorely missed it." " Lay hands on those villains!" " These others knew nothing." " Bear them to execution." " That's my son!" "Heart, my Lord, was't not for thy good?" " My good?" " You should be offering us titles." "Away with 'em!" "An old man such as he." "You that would murder him would murder me." " Look to the Duke!" " Get back!" "Get back!" "Is't come about?" "'Sfoot, brother, you began!" "May not we set as well as the Duke's son?" "Thou hast no conscience." "Are we not reveng'd?" "Is there one enemy left amongst those?" "'Tis time to die when we ourselves our foes." "When murderers shut deeds close, this curse does seal 'em;" "If none disclose 'em, we ourselves reveal 'em!" "This murder might have slept in tongueIess brass but not for ourselves, and the world died an ass." "Now, my Lord..." "Since we are in forever, this work was ours which else might have been sIipp'd." "If we list, we might have nobles cIipp'd and go for less than beggars, but we hate to bleed so cowardly." "We have enough, i'faith." "We're well our mother turn'd, our sister true." "We die... after a nest of Dukes." "Shit!" "Adieu." "Adieu." "Revenge!" "Revenge!" "Revenge!" "Revenge!" "Revenge!" "Revenge!" "Revenge!" "Revenge!" "VlNDlCl:" "Why, brother, this is fate." "CARLO:" "It is, but whose?" "VlNDlCl:" "I set my fate at naught so that I have revenge, revenge..."

New Delhi: After an Economic Times reported on August 1 claimed that the Pranab Mukherjee Foundation and the former president appeared “keen” to “extend a relationship” with the Rashtriya Swayamsevak Sangh, Pranab Mukherjee issued a statement to deny the story. “It is categorically clarified that there is neither any existing collaboration, nor is there any such move in the offing,” the statement reads. The former president is due visit Gurgaon on September 2 and visit some villages with Haryana chief minister Manohar Lal Khattar to inaugurate a few projects. The statement clarifies that while Mukherjee was the president of India, he had adopted several villages under the Smartgram Project started in Haryana in 2018. In its story, Economic Times says that it spoke to a member of the RSS and confirmed that Mukherjee “has invited over 15 senior and junior level RSS workers for the event” and that “this group had met the former president at his residence a few days ago, when he talked to them about his foundation’s efforts to provide clean drinking water in Haryana villages it has adopted”. “The RSS members assured him of all grassroots help and presented him a coffee table book on the history and struggles of the RSS,” reads the Economic Times report. The story goes on to say that an associate of the former president confirmed that such a meeting took places but “nothing had been formalised about the RSS and Mukherjee working together on any project”. “He has always been a proponent of inclusiveness. And for the work he is doing, he would want to include everyone,” the source reportedly said. In response to the news report, Mukherjee states that he is visiting Gurgaon on September 2 “at the invitation of the government of Haryana”. Just a couple of months ago, Mukherjee’s decision to accept an invitation by the RSS to address its new recruits at an event in Nagpur on June 7 had caused an uproar. At the time, many claimed that the RSS had managed to “appropriate” the former president. Mukherjee, once on the dais, gave a speech that expounded on the many facets of Indian nationalism after watching the freshly trained members of the organisation in action. “We know what we are. And we are moving towards our goal with all conviction. We invite everyone to come and form their own opinion about RSS,” he had said, in a speech that was telecast live on most news channels.

Licensed Kindergartens If a child comes to enroll in a public school kindergarten, the first grade, or the second grade, the age requirements for public school is set in Subsection 6 of the Nevada Revised Statutes (NRS) 392.040. The law states that for kindergarten the child must be 5 by September 30th and for the first grade the child must be 6 by September 30th. For a child to enroll in the second grade within the public schools of Nevada the child must be 7 years old by September 30th of the school year and the child must have completed kindergarten and first grade. There are no exceptions to the age requirement except for students who became residents of Nevada after they have completed kindergarten or first grade in another state that allows an earlier attendance age than Nevada. It is noted that the NRS only defines minimum age requirements for kindergarten, first grade and second grade. (The entire law is available on the Nevada State Legislature website.) Notice of Non-Discrimination and Web-Accessibility The District prohibits bullying, cyber-bullying, harassment, sexual harassment, discrimination and/or retaliation in any of its educational programs/activities, employment, and employment opportunities. For the District's full Notice of Non-Discrimination statement as well as methods to address questions and concerns please visit our Notice of Non-Discrimination and Web Accessibility page.

This invention relates to a movable toy. More particularly, the invention relates to a movable toy which is provided with an automatic gear disengaging mechanism and a gear changing mechanism. When the rotation of wheels is abruptly stopped, the rotatory power transmitted from the driving section such as an electric motor, a spring or a fly-wheel, is automatically released by the gear disengaging mechanism. In the prior art devices of this kind, for example, in the mechanism as disclosed in Japanese Utility Model Publication No. Sho. 42-21216 (1967), the engagement and disengagement of gears are attained by moving up or down the machine frame of a toy car. More particularly, a wheel driving shaft is inserted through a pair of vertical slots of a gear box. The gear attached to the wheel driving shaft is utilized as the rotatory power source for a fly-wheel when the machine frame suspended by springs is pushed down. Accordingly, if the machine frame is raised up, the toy car can not be driven. When the compression to the springs is released, the machine frame is lifted by the springs and the transmission between the wheels and the fly-wheel is disengaged. Therefore, as the measure to connect the rotation of fly-wheel to the outer wheels when the car is allowed to run, a laterally movable intermediate shaft is interposed between the fly-wheel in the driving section and the wheels in the driven section. Accordingly, even when the wheels are pressed to and rubbed with the floor so as to energize the fly-wheel and to prepare the running, the toy car is not driven. In order to start the running of the toy car, the second operation to slide the intermediate shaft into the space between the wheel shaft and the fly-wheel shaft is required. Further, when the running toy car is forcibly stopped by pressing it to the floor, another disadvantage is caused to occur in that the teeth of gears in the driving transmission system are often broken by the rotatory power of the fly-wheel.

Various kinds of sealing devices such as a gasket and a packing have been conventionally known as devices for sealing a clearance defined between two members. They have been formed into various shapes. Moreover, there have been a variety of sealing structures in which the sealing devices are used. Patent Document 1, for example, discloses a sealing structure, in which a bottom side of a gasket is suppressed from sliding sideways of a installation groove by curving a bottom of the installation groove, so as to prevent the gasket from falling down, and further, the gasket can be installed irrespective of the obverse and reverse thereof by forming the gasket into a symmetric shape in cross section. Otherwise, Patent Document 2 discloses a packing for an injector, in which projections are formed on both sides in an axial direction on an inner circumferential surface and an outer peripheral surface, and further, portions with and without a squeeze margin are formed at the outer peripheral surface of the injector and the inner circumferential surface of a housing. In this manner, sealability can be exhibited irrespective of the magnitude of a pressure to be exerted on the packing, and further, an increase in filling ratio of the packing to an installation space is suppressed, so that the packing can be prevented from extending into a clearance. Alternatively, Patent Document 3 discloses a gasket interposed between a cylinder head and a head cover in an engine, in which a clearance is formed between a bottom of a gasket containing groove and the gasket before the gasket is tightened, whereas a part of the gasket is deformed in such a manner as to fill the clearance defined between the groove bottom of the containing groove and the same during tightening, thereby suppressing an exposed portion of the gasket from extending into the clearance defined between the cylinder head and the head cover. Patent Document 1: Japanese Patent Application Laid-Open No. 2006-200649 Patent Document 2: Japanese Patent Application Laid-Open No. 2002-340191 Patent Document 3: Japanese Utility Model Application Laid-Open No. 2-124371

A rapid and accurate single-drop modification of the acid-elution technique for detecting fetomaternal hemorrhage. A single-drop modification of the acid-elution technique (Kleihauer-Betke) for quantitating fetomaternal hemorrhage is described. It obviates the need for the tedious and time-consuming manual counting of background adult cells. Rather, this is achieved by automated red-blood cell counting of the initial specimen and delivery of a standard volume (1 microliter) of a standard dilution (1:1,000) in the form of a droplet to a microscope slide. The droplet is left to dry undisturbed at room temperature and then stained. The fetal cells are manually counted while the total number of cells is calculated from the initial red-blood cell count, standard volume, and standard dilution. Determinations on 4 different concentrations of fetal/adult red cell mixtures are performed. Results indicate improved accuracy and precision relative to the standard technique in significantly less time for volumes of fetomaternal hemorrhage requiring more than the standard dose of Rho(D)-immune globulin.

Q: React-router with tabs, how to set up routes I have the following tabs set up in the AdministratorComponent component of my app. I am struggling with routes. I would like the route https://example.com/xyz/publish/create_news_item to go to the Publish tab below, and and show the <CreateNewsItem /> component. And the https://example.com/xyz/publish/index should go to the Publish tab below, and show the <PublishIndex /> component. <div className="container"> <ul className="nav nav-tabs"> <li className="active"><a data-toggle="tab" href="#menu1">Menu1</a></li> <li><a data-toggle="tab" href="#publish">Publish</a></li> <li><a data-toggle="tab" href="#analytics">Analytics</a></li> </ul> <div className="tab-content"> <div id="menu1" className="tab-pane fade"> <h3>Menu 1</h3> <p>Ut enim ad minim veniam, quis nostrud exercitation ullamco laboris nisi ut aliquip ex ea commodo consequat.</p> </div> <div id="publish" className="tab-pane fade"> </div> <div id="analytics" className="tab-pane fade"> <Analytics /> </div> </div> </div> <div> {this.props.children} </div> </div> Here are the routes I have so far: export default ( <Route path=“/xyz/index" component={AdministratorComponent} > <Route path=“/xyz/create_news_publication" component={AdministratorComponent} /> </Route> ); This does not work. I thought maybe I would put code into the AdministratorComponent which would look at the window.location.href, activate the Publish tab, and put in either <PublishIndex /> or <CreateNewsItem /> depending on the path. But I can’t get started as the above path in the url just causes a bunch of 404s. What is the correct way to do this? A: <Route path="/"> <Route path="/index" component={AdministratorComponent}/> <Route path="/create_news_publication" component={AdministratorComponent}/> </Route> would be in routes.js for exemple. The component Route come from react-router To switch route, you would need to use the component Link from react-router To have a text (for exemple) linking to another page it would be like this : <Link to={`/create_news_publication`}>click to go to create_news_publication!</Link>

Q: STL vector containing vector causing segfault The following code causes a segfault when I try to issue my push_back call. What am I doing wrong? #include <iostream> #include <vector> #include <string> using namespace std; int main() { std::string * foo = new std::string("hello world"); cout << *foo << endl; std::vector<std::vector<std::string *> > my_vecs; my_vecs[0].push_back(foo); // segfaults cout << "trying to print my_vecs size of " << my_vecs.size() << " but we never reach that point due to segfault " << endl; return 0; } I'm pretty sure I'm violating one of the contracts for using vector, as the problem is surely not with the STL implementation. A: The outer vector must first be explicitly grown, before one can push to its elements. This may be a little surprising since STL map's automatically insert their keys. But, it's certainly the way it is. #include <iostream> #include <vector> #include <string> using namespace std; int main() { const int DESIRED_VECTOR_SIZE = 1; std::string * foo = new std::string("hello world"); cout << *foo << endl; std::vector<std::vector<std::string *> > my_vecs; for (int i = 0; i < DESIRED_VECTOR_SIZE; ++i) { std::vector<std::string *> tmp; my_vecs.push_back(tmp); // will invoke copy constructor, which seems unfortunate but meh } my_vecs[0].push_back(foo); // segfaults cout << "now able to print my_vecs size of " << my_vecs.size() << endl; return 0; }

Q: Configuration of Jobs getting updated by System user on Jenkins We are using Jenkins enterprise version. Whenever we update job configs there are cases where the config is again updated with the System user to what it was earlier. We are unable to understand what process is doing that. Thank you for the help in advance. I'm unable to attach a screenshot to give an idea of what is happening as my reputation is not high enough. A: Most likely, the reason is in the fact, that your job includes "Parameterized Jenkins Pipeline" stage (thanks to @rjohnston for the "Jenkinsfile" comment above, which is related to this). And in this case, once the parameters code "is included at the top level of the pipeline script, any pipeline execution resets the job’s parameters to the specified values" (as it is pointed out in this article: Parameterized Jenkins Pipelines). So, you need to change config parameters not in the job configuration page itself, but in the pipeline script, relative link to which you can find in the "Script Path" field of the "Pipeline" part of the "Config" page.

--- abstract: | We report on the discovery of a very narrow-line star forming object beyond redshift of 5. Using the prime-focus camera, Suprime-Cam, on the 8.2 m Subaru telescope together with a narrow-passband filter centered at $\lambda_{\rm c}$ = 8150 Å with passband of $\Delta\lambda$ = 120 Å, we have obtained a very deep image of the field surrounding the quasar SDSSp J104433.04$-$012502.2 at a redshift of 5.74. Comparing this image with optical broad-band images, we have found an object with a very strong emission line. Our follow-up optical spectroscopy has revealed that this source is at a redshift of $z=5.655\pm0.002$, forming stars at a rate $\sim 13 ~ h_{0.7}^{-2} ~ M_\odot$ yr$^{-1}$. Remarkably, the velocity dispersion of Ly$\alpha$-emitting gas is only 22 km s$^{-1}$. Since a blue half of the Ly$\alpha$ emission could be absorbed by neutral hydrogen gas, perhaps in the system, a modest estimate of the velocity dispersion may be $\gtrsim$ 44 km s$^{-1}$. Together with a linear size of 7.7 $h_{0.7}^{-1}$ kpc, we estimate a lower limit of the dynamical mass of this object to be $\sim 2 \times 10^9 M_\odot$. It is thus suggested that LAE J1044$-$0123 is a star-forming dwarf galaxy (i.e., a subgalactic object or a building block) beyond redshift 5 although we cannot exclude a possibility that most Ly$\alpha$ emission is absorbed by the red damping wing of neutral intergalactic matter. author: - 'Yoshiaki Taniguchi , Masaru Ajiki , Takashi Murayama , Tohru Nagao , Sylvain Veilleux , David B. Sanders , Yutaka Komiyama , Yasuhiro Shioya , Shinobu S. Fujita , Yuko Kakazu , Sadanori Okamura , Hiroyasu Ando , Tetsuo Nishimura , Masahiko Hayashi , Ryusuke Ogasawara , & Shin-ichi Ichikawa' title: 'THE DISCOVERY OF A VERY NARROW-LINE STAR FORMING OBJECT AT A REDSHIFT OF 5.66' --- INTRODUCTION ============ Searches for Ly$\alpha$ emitters (hereafter LAEs) at high redshift are very useful in investigating the early star formation history of galaxies (Partridge & Peebles 1967). Recent progress in the observational capability of 10-m class optical telescopes has enabled us to discover more than a dozen of Ly$\alpha$ emitting galaxies beyond redshift 5 (Dey et al. 1998; Weymann et al. 1998; Hu et al. 1999, 2001, 2002; Dawson et al. 2001, 2002; Ellis et al. 2001; Ajiki et al. 2002; see also Spinrad et al. 1998; Rhoads & Malhotra 2001). The most distant object known to date is HCM-6A at $z=6.56$ (Hu et al. 2002). These high-$z$ Ly$\alpha$ emitters can be also utilized to investigate physical properties of the intergalactic medium (IGM) because the epoch of cosmic reionization ($z_{\rm r}$) is considered to be close to the redshifts of high-$z$ Ly$\alpha$ emitters; i.e., $z_{\rm r} \sim 6$ – 7 (Djorgovski et al. 2001; Becker et al. 2001; Fan et al. 2002). In other words, emission-line fluxes of the Ly$\alpha$ emission from such high-$z$ galaxies could be absorbed by neutral hydrogen in the IGM if neutral gas clouds are located between the source and us (Gunn & Peterson 1965; Miralda-Escudé 1998; Miralda-Escudé & Rees 1998; Haiman 2002 and references therein). Therefore, careful investigations of Ly$\alpha$ emission-line properties of galaxies with $z > 5$ provides very important clues simultaneously both on the early star formation history of galaxies and on the physical status of IGM at high redshift. The first step is to look for a large number of Ly$\alpha$ emitter candidates at high redshift through direct imaging surveys. The detectability of high-redshift objects is significantly increased if they are hosts to recent bursts of star formation which ionize the surrounding gas and result in strong emission lines like the hydrogen recombination line Ly$\alpha$. These emission-line objects can be found in principle through deep optical imaging with narrow-passband filters customized to the appropriate redshift. Indeed, recent attempts with the Keck 10 m telescope have revealed the presence of Ly$\alpha$ emitters in blank fields at high redshift (e.g., Cowie & Hu 1998; Hu et al. 2002). These recent successes have shown the great potential of narrow-band imaging surveys with 8-10 m telescopes in the search for high-$z$ Ly$\alpha$ emitters. It is also worthwhile noting that subgalactic populations at high redshift have been recently found thanks to the gravitational lensing (Ellis et al. 2001; Hu et al. 2002). In an attempt to find star-forming objects at $z \approx 5.7$, we have carried out a very deep optical imaging survey in the field surrounding the quasar SDSSp J104433.04$-$012502.2 at redshift of 5.74[^1] (Fan et al. 2000; Djorgovski et al. 2001; Goodrich et al. 2001), using Suprime-Cam (Miyazaki et al. 1998), the wide-field ($34^\prime \times 27^\prime$ with a 0.2 arcsec/pixel resolution) prime-focus camera on the 8.2 m Subaru telescope (Kaifu 1998). In this Letter, we report on our discovery of a very narrow-line star-forming system at $z \approx 5.7$. OBSERVATIONS ============ Optical Imaging --------------- In this survey, we used the narrow-passband filter, NB816, centered on 8150 Å with a passband of $\Delta\lambda$(FWHM) = 120 Å; the central wavelength corresponds to a redshift of 5.70 for Ly$\alpha$ emission. We also used broad-passband filters, $B$, $R_{\rm C}$, $I_{\rm C}$, and $z^\prime$. A summary of the imaging observations is given in Table 1. All of the observations were done under photometric condition and the seeing size was between 0.7 arcsec and 1.3 arcsec during the run. Note that we analyzed only two CCD chips, in which quasar SDSSp J104433.04$-$012502.2 is present, to avoid delays for follow-up spectroscopy. The CCD data were reduced and combined using $IRAF$ and the mosaic-CCD data reduction software developed by Yagi et al. (2002). Photometric and spectrophotometric standard stars used in the flux calibration are SA101 for the $B$, $R_{\rm C}$, and $I_{\rm C}$ data, and GD 108, GD 58 (Oke 1990), and PG 1034+001 (Massey et al. 1988) for the NB816 data. The $z^\prime$ data were calibrated by using the magnitude of SDSSp J104433.04$-$012502.2 (Fan et al. 2000). The total size of the field is 1167 by 1167, corresponding to a solid angle of $\approx$ 136 arcmin$^{2}$. The volume probed by the NB816 imaging has (co–moving) transverse dimensions of 27.56 $h_{0.7}^{-1}\times 27.56 h_{0.7}^{-1}$ Mpc$^2$, and the half–power points of the filter correspond to a co–moving depth along the line of sight of 44.34 $h_{0.7}^{-1}$ Mpc ($z_{\rm min} \approx 5.653$ and $z_{\rm max} \approx 5.752$; note that the transmission curve of our NB816 filter has a Gaussian-like shape). Therefore, a total volume of $3.4 \times 10^4 h_{0.7}^{-3}$ Mpc$^{3}$ is probed in our NB816 image. Here, we adopt a flat universe with $\Omega_{\rm matter} = 0.3$, $\Omega_{\Lambda} = 0.7$, and $h=0.7$ where $h = H_0/($100 km s$^{-1}$ Mpc$^{-1}$). Source detection and photometry were performed using SExtractor version 2.2.1 (Bertin, & Arnouts 1996). Our detection limit (a 3$\sigma$ detection within a $2^{\prime\prime}$.8 diameter aperture) for each band is listed in Table 1. As for the source detection in the NB816 image, we used a criterion that a source must be a 13-pixel connection above 5$\sigma$ noise level. Adopting the criterion for the NB816 excess, $I_{\rm C} - NB816 > 1.0$ mag, we have found two strong emission-line sources. Our follow-up optical spectroscopy of these sources reveals that one source found at $\alpha$(J2000)=10$^{\rm h}$ 44$^{\rm m}$ 27$^{\rm s}$ and $\delta$(J2000)=$-01^\circ$ 23$^\prime$ 45$^{\prime\prime}$ (hereafter LAE J1044$-$0123) is a good candidate to be a subgalactic object at high redshift[^2]. Its AB magnitude in the $NB816$ band is 24.73. The optical thumb-nail images of LAE J1044$-$0123 are given in Fig. 1. As shown in this figure, LAE J1044$-$0123 is seen clearly only in the NB816 image. Although it is seen in the $I_{\rm C}$ image, its flux is below the $3\sigma$ noise level. The observed equivalent width is $EW_{\rm obs} > 238$ Å. The NB816 image reveals that LAE J1044$-$0123 is spatially extended; its angular diameter is 1.6 arcsec (above the 2$\sigma$ noise level). The size of the point spread function in the NB816 image is 0.90 arcsec. Correcting for this spread, we obtain an angular diameter of 1.3 arcsec. Optical Spectroscopy -------------------- Our optical spectroscopy was made by using the Keck II Echelle Spectrograph and Imager (ESI: Sheinis et al. 2000) on 2002 March 15 (UT). We used the Echelle mode with the slit width of 1 arcsec, resulting in a spectral resolution $R \simeq 3400$ at 8000 Å. The integration time was 1800 seconds. The spectrum of LAE J1044$-$0123, shown in Fig. 2, presents a narrow emission line at $\lambda = 8090$ Å. This is the only emission line that was detected within the ESI wavelength range (from 4000 Å to 9500 Å). This line may be either Ly$\alpha$ or \[O [ii]{}\]$\lambda$3727. The emission-line profile appears to show a sharper cutoff at wavelengths shortward of the line peak, providing some evidence that this line is Ly$\alpha$. A stronger argument in favor of this line identification comes from the lack of structure in the profile. If this line were \[O [ii]{}\] emission, the redshift would be $z \approx 1.17$. Since the \[O [ii\]]{} feature is a doublet line of \[O [ii]{}\]$\lambda$3726.0 and \[O [ii]{}\]$\lambda$3728.8, the line separation would be larger than 6.1 Å and the lines would be resolved in the ESI observations. Further, if the line were H$\beta$, \[O [iii]{}\]$\lambda$4959, \[O [iii]{}\]$\lambda$5007, or H$\alpha$ line, we would detect some other emission lines in our spectrum. Therefore, we conclude that the emission line at 8090 Å is Ly$\alpha$, giving a redshift of 5.655$\pm$0.002. RESULTS AND DISCUSSION ====================== Star Formation Activity in LAE J1044$-$0123 ------------------------------------------- The rest-frame equivalent width of Ly$\alpha$ emission becomes $EW_0 > 36$ Å. Our Keck/ESI spectrum gives the observed Ly$\alpha$ flux of $f$(Ly$\alpha$) = $(1.3 \pm 0.1) \times 10^{-17}$ ergs cm$^{-2}$ s$^{-1}$ and the rest-frame equivalent width of Ly$\alpha$ emission $EW_0 > 36$ Å. On the other hand, our NB816 magnitude of LAE J1044$-$0123 gives $f$(Ly$\alpha$) $\simeq 4.1 \times 10^{-17}$ ergs cm$^{-2}$ s$^{-1}$, being higher than by a factor of 3 than the Keck/ESI flux. Since the Keck/ESI spectrum was calibrated by a single measurement of a spectroscopic standard star, HZ 44, the photometric accuracy may not be good. Further, our slit width may not cover the entire Ly$\alpha$ nebula of LAE J1044$-$0123. Therefore, we use the NB816-based flux to estimate the star formation rate. The NB816 flux gives the Ly$\alpha$ luminosity $L$(Ly$\alpha$) $\simeq 1.4 \times 10^{43} ~ h_{0.7}^{-2}$ ergs s$^{-1}$. Using the relation $SFR = 9.1 \times 10^{-43} L({\rm Ly}\alpha) ~ M_\odot {\rm yr}^{-1}$ (Kennicutt 1998; Brocklehurst 1971), we obtain $\sim 13 ~h_{0.7}^{-2} ~ M_\odot$ yr$^{-1}$. This is a lower limit because no correction was made for possible internal extinction by dust grains in the system. The lack of UV continuum from this object prevents us from determining the importance of this effect. The most intriguing property of LAE J1044$-$0123 is that the observed emission-line width (full width at half maximum; FWHM) of redshifted Ly$\alpha$ is only 2.2 $\pm$ 0.3 Å. Since the instrumental spectral resolution is 1.7 $\pm$ 0.1 Å, the intrinsic width is only 1.4 $\pm$ 0.5 Å; note that this gives a upper limit because the line is barely resolved. It corresponds to $FWHM_{\rm obs} \simeq$ 52 $\pm$ 19 km s$^{-1}$ or a velocity dispersion $\sigma_{\rm obs} = FWHM_{\rm obs}/(2 \sqrt{2 {\rm ln} 2}) \simeq$ 22 km s$^{-1}$. This value is comparable to those of luminous globular clusters (Djorgovski 1995). It is interesting to compare the observational properties of LAE J1044$-$0123 with similar LAEs at $z \gtrsim 5$. For this comparison, we choose Abell 2218 a (Ellis et al. 2001), LAE J1044$-$0130 (Ajiki et al. 2002), and J123649.2+621539 (Dawson et al. 2002) because these objects were also observed using KecK/ESI. A summary is given in Table 2. This comparison shows that LAE J1044$-$0123 has the narrowest line width that may be roughly comparable to that of Abell 2218 a although the mass of Abell 2218, $\sim 10^6 M_\odot$, is much smaller than that of LAE J1044$-$0123 (see next subsection). Another important point appears that the line profile of LAE J1044$-$0123 does not show intense red wing emission which is evidently seen in those of the other three LAEs. The diversity of the observational properties of these LAEs suggest that the H [i]{} absorptions affect significantly the visibility of the Ly$\alpha$ emission line. Further, the contribution of superwinds may be different from LAE to LAE. What is LAE J1044$-$0123 ? -------------------------- Now a question arises as; \`\`What is LAE J1044$-$0123 ?". There are two alternative ideas: (1) LAE J1044$-$0123 is a part of a giant system and we observe only the bright star-forming clump, or (2) LAE J1044$-$0123 is a single star-forming system. Solely from our observations, we cannot judge which is the case. If this is the first case, LAE J1044$-$0123 may be similar to Abell 2218 a found by Ellis et al. (2001). One problem in this interpretation seems that the spatial extension, $\sim$ 7.7 kpc, of LAE J1044$-$0123 is fairly large for such a less-massive system. Therefore, adopting the second case, it seems important to investigate possible dynamical status of LAE J1044$-$0123 for future consideration. If a source is surrounded by neutral hydrogen, Ly$\alpha$ photons emitted from the source are heavily scattered. Furthermore, the red damping wing of the Gunn-Peterson trough could also suppress the Ly$\alpha$ emission line (Gunn & Peterson 1965; Miralda-Escudé 1998; Miralda-Escudé & Rees 1998; Haiman 2002 and references therein). If this is the case for LAE J1044$-$0123, we may see only a part of the Ly$\alpha$ emission. Haiman (2002) estimated that only 8% of the Ly$\alpha$ emission is detected in the case of HCM-6A at $z=6.56$ found by Hu et al. (2002). However, the observed Ly$\alpha$ emission-line profile of LAE J1044$-$0123 shows the sharp cutoff at wavelengths shortward of the line peak. This property suggests that the H [i]{} absorption is dominated by H [i]{} gas in the system rather than that in the IGM Therefore, it seems reasonable to adopt that blue half of the Ly$\alpha$ emission could be absorbed in the case of LAE J1044$-$0123. Then we estimate a modest estimate of the velocity dispersion, $\sigma_0 \sim 2 \sigma_{\rm obs} \sim$ 44 km s$^{-1}$. Given the diameter of this object probed by the Ly$\alpha$ emission, $D \simeq 7.7 h_{0.7}^{-1}$ kpc, we obtain the dynamical timescale of $\tau_{\rm dyn} \sim D/\sigma_0 \sim 1.7 \times 10^8$ yr. This would give a upper limit of the star formation timescale in the system; i.e., $\tau_{\rm SF} \lesssim \tau_{\rm dyn}$. However, if the observed diameter is determined by the so-called Strömgren sphere photoionized by a central star cluster, it is not necessary to adopt $\tau_{\rm SF} \sim \tau_{\rm dyn}$. It seems more appropriate to adopt a shorter timescale for such a high-$z$ star-forming galaxies, e.g., $\tau_{\rm SF} \sim 10^7$ yr, as adopted for HCM-6A at $z \approx 6.56$ (Hu et al. 2002) by Haiman (2002). One may also derive a dynamical mass $M_{\rm dyn} = (D/2) \sigma_0 ^2 G^{-1} \sim 2 \times 10^9 M_\odot$ (neglecting possible inclination effects). At the source redshift, $z=5.655$, the mass of a dark matter halo which could collapse is estimated as $M_{\rm vir} \sim 9 \times 10^6 r_{\rm vir, 1}^3 h_{0.7}^{-1} ~ M_\odot$ where $r_{\rm vir, 1}$ is the Virial radius in units of 1 kpc \[see equation (24) in Barkana & Loeb (2001)\]. If we adopt $r_{\rm vir} = D/2$ = 3.85 kpc, we would obtain $M_{\rm vir} \sim 5 \times 10^8 ~ M_\odot$. However, the radius of dark matter halo could be ten times as long as $D/2$. If this is the case, we obtain $M_{\rm vir} \sim 5 \times 10^{10} ~ M_\odot$ and $\sigma_0 \sim 75$ km s$^{-1}$. Comparing this velocity dispersion with the observed one, we estimate that the majority of Ly$\alpha$ emission would be absorbed by neutral hydrogen. The most important issue related to LAE J1044$-$0123 seems how massive this source is; i.e., $\sim 10^9 M_\odot$ or more massive than $10^{10} M_\odot$. If the star formation timescale is as long as the dynamical one, the stellar mass assembled in LAE J1044$-$0123 at $z=5.655$ exceeds $10^9 ~ M_\odot$, being comparable to the nominal dynamical mass, $M_{\rm dyn} \sim 2 \times 10^9 ~ M_\odot$. Since it is quite unlikely that most mass is assembled to form stars in the system, the dark matter halo around LAE J1044$-$0123 would be more massive by one order of magnitude at least than the above stellar mass. If this is the case, we could miss the majority of the Ly$\alpha$ emission and the absorption cloud be attributed to the red damping wing of neutral hydrogen in the IGM. Since the redshift of LAE J1044$-$0123 ($z=5.655$) is close to that of SDSSp J104433.04$-$012502.2 ($z=5.74$), it is possible that these two objects are located at nearly the same cosmological distance. The angular separation between LAE J1044$-$0123 and SDSSp J104433.04$-$012502.2, 113 arcsec, corresponds to the linear separation of 4.45 $h_{0.7}^{-1}$ Mpc. The Strömgren radius of SDSSp J104433.04$-$012502.2 can be estimated to be $r_{\rm S} \sim 6.3 (t_{\rm Q}/2\times 10^7 ~ {\rm yr})^{1/3}$ Mpc using equation (1) in Haiman & Cen (2002) where $t_{\rm Q}$ is the lifetime of the quasar (see also Cen & Haiman 2000). Even if this quasar is amplified by a factor of 2 by the gravitational lensing (Shioya et al. 2002), we obtain $r_{\rm S} \sim 4.9$ Mpc. Therefore, it seems likely that the IGM around LAE J1044$-$0123 may be ionized completely. If this is the case, we cannot expect that the Ly$\alpha$ emission of LAE J1044$-$0123 is severely absorbed by the red damping wing emission. In order to examine which is the case, $L$-band spectroscopy is strongly recommended because the redshifted \[O [iii]{}\]$\lambda$5007 emission will be detected at 3.33 $\mu$m. However, we need the James Webb Space Telescope to complete it. [lcccc]{} $B$ & 2002 February 17 & 1680 & 26.6 & 1.2\ $R_{\rm C}$ & 2002 February 15, 16 & 4800 & 26.2 & 1.4\ $I_{\rm C}$ & 2002 February 15, 16 & 3360 & 25.9 & 1.2\ $NB816$ & 2002 February 15 - 17 & 36000 & 26.0 & 0.9\ $z'$ & 2002 February 15, 16 & 5160 & 25.3 & 1.2\ [lcccc]{} LAE J1044$-$0123 & 5.655 & 4.1 & 52 & This paper\ Abell 2218 a & 5.576 & 6.2 & $\sim$70 & 1\ LAE J1044$-$0130 & 5.687 & 1.5 & 340 & 2\ J123649.2+621539 & 5.190 & 3.0 & 280 & 3\ We would like to thank T. Hayashino and the staff at both the Subaru and Keck Telescopes for their invaluable help. We would like to thank Paul Shapiro and Renyue Cen for their encouraging discussion on high-$z$ Ly$\alpha$ emitters. We would also like to thank Zoltan Haiman and an anonymous referee for their useful comments. [^1]: The discovery redshift was $z=5.8$ (Fan et al. 2000). Since, however, the subsequent optical spectroscopic observations suggested a bit lower redshift; $z=5.73$ (Djorgovski et al. 2001) and $z=5.745$ (Goodrich et al. 2001), we adopt $z=5.74$ in this Letter. [^2]: Another source has been identified as a Ly$\alpha$ emitter at $z=5.687$ (Ajiki et al. 2002)

Tissue perfusion and distribution of cardiac output during ketamine anesthesia in normovolemic rats. Based on previous clinical experience, an anesthetic technique for the rat, using ketamine, has been evaluated. The method comprised an i.v. bolus injection of 30 mg/kg for induction and an i.v. continuous infusion of 1.5 mg/kg/min for maintenance of anesthesia. Minor differences in ketamine metabolism between man and the rat are discussed. It appears that a higher ketamine concentration at the receptor site was required in the rat as compared to man. During ketamine anesthesia in the rat, fractional distribution of cardiac output and regional tissue perfusion were determined with the aid of the microsphere method. The study showed increased fractions to the heart, brain and tongue. The carcass fraction was elevated shortly after induction but reduced during steady-state anesthesia. Stomach, bowel and kidneys received reduced fractions early, but after these fractions returned to their initial levels. As a consequence of the increased cardiac output, regional tissue perfusion was increased in practically all organs.

Uptown (Machinations album) Uptown is the third and final studio album from Australian synthpop band Machinations. The album was released in October 1988 and peaked at number 50 on the ARIA Charts. Track listing Charts References Category:1988 albums Category:Machinations (band) albums Category:Mushroom Records albums

The present invention relates in general to substrate manufacturing technologies and in particular to apparatus for the removal of a metal oxide from a substrate and methods therefor. In the processing of a substrate, e.g., a semiconductor substrate or a glass panel such as one used in flat panel display manufacturing, plasma is often employed. As part of the processing of a substrate for example, the substrate is divided into a plurality of dies, or rectangular areas, each of which will become an integrated circuit. The substrate is then processed in a. series of steps in which materials are selectively removed (etching) and deposited. Control of the transistor gate critical dimension (CD) on the order of a few nanometers is a top priority, as each nanometer deviation from the target gate length may translate directly into the operational speed of these devices. Areas of the hardened emulsion are then selectively removed, causing components of the underlying layer to become exposed. The substrate is then placed in a plasma processing chamber on a substrate support structure comprising a mono-polar or bi-polar electrode, called a chuck or pedestal. Appropriate etchant source are then flowed into the chamber and struck to form a plasma to etch exposed areas of the substrate. Copper (Cu) is commonly used as to interconnect microelectronic circuits on the substrate. However, before bulk Cu deposition, some type of copper sputtering deposition process is generally required to deposit a thin seed layer (about 500 Å to about 2000 Å). A Cu seed layer generally provides the nucleation sites for the bulk Cu grain and film formation. That is, first a barrier layer may be deposited using a PVD (plasma vapor deposition) process, the Cu seed may then be deposited also using a PVD process, and finally the remaining bulk Cu may be deposited using electrochemical plating (ECP). In general, ECP involves placing the substrate (with a Cu seed) on a plastic substrate holder. A cathode then holds the substrate with a conducting steel ring and immerses it in a plating solution containing sulfuric acid (H2SO4), copper sulfate (Cu(SO4)) and other additives. An electrical current flows form the anode, which is a copper plate to the cathode. In the solution, the Cu(SO4) disassociates to a copper ion, Cu2+, and a sulfate ion SO22−. When the copper ions are attracted to the substrate surface, where they become absorbed on the copper seed layer. However, new approaches to Cu interconnect integration are emerging to overcome short falls of current integrations schemes. For example, one emerging technology is the use of electroless Cu plating that can replace the Copper seed and/or Cu fill. In general, an underlying barrier layer (e.g., Ti, Tin, Ta, TaN, W, WN, Ru, etc.) is catalyzed by a Pd/Sn colloid, which serves as an activator for electroless copper deposition. After activation, electroless deposition of Cu occurs on the catalytic surface. In general, the coverage of the Cu deposit reaches 100% and the adsorptive amount of Pd is greatly increased by the conditioning process. However, in order to insure uniformity, the barrier layer must substantially be free of any metal oxide they may have formed prior to the electroless Cu plating process. A commonly known, relatively simple, and low-cost method of metal oxide removal may be the use of an atmospheric (or high pressure) plasma jet (APPJ), which generally allows a plasma to be focused on a particular location on the substrate, thus minimizing potential damage to dies on the substrate. An APPJ device generally mixes a large amount of an inert gas (e.g., He, etc.) with a small amount of a reactive gas (e.g., H2, O2, etc.) in an annular volume (e.g., tube, cylinder, etc.) formed between an rf-powered electrode (along the longitudinal axis of the source) and a grounded electrode. The generated plasma may then be forced out one end of the annular volume (plasma effluent) by pressure caused by the influx of gases (gas influent). The shape and size of the plasma effluent may be controlled by adjusting the gas influent pressure, as well as the shape and size of the discharge orifice on the APPJ device. In addition, an APPJ may also be combined with a reactive ion etch (RIE) in order to remove the metal oxide. In general, RIE combines both chemical and ion processes in order to remove material from the substrate. Generally ions in the plasma enhance a chemical process by striking the surface of the substrate, and breaking the chemical bonds of the atoms on the surface in order to make them more susceptible, to reacting with the molecules of the chemical process. Operating at ambient pressure conditions, atmospheric plasmas tend to relatively inexpensive in comparison to low-pressure plasmas that require sophisticated pumping systems to operate at near vacuum conditions. However, APPJ devices also tend to be susceptible to arcing. An arc is generally a high power density short circuit which has the effect of a miniature explosion. When arcs occur on or near the surfaces of the target material or chamber fixtures, substantial damage can occur, such as local melting. Plasma arcs are generally caused by low plasma impedance which results in a steadily increasing current flow. If the resistance is low enough, the current will increase indefinitely (limited only by the power supply and impedance), creating a short circuit in which all energy transfer takes place. This may result in damage to the substrate as well as the plasma chamber. In order to inhibit arcing, relatively high plasma impedance generally must be maintained. A common solution may be to limit the rate of ionization in the plasma by using a large volume of inert gas at a relatively high flow rate. Another solution may be to position slots along the longitudinal axis of the powered electrode with the same electrical potential, in order to reduce the likelihood of arcing. For example, in a common atmospheric plasma configuration, rf power creates an electrical discharge between a power electrode and a set of grounded electrodes that causes a process gas such as O2 to ionize. However, as the density of electrically charged species (i.e., ions, etc.) in the plasma increases (typically above 2%), the likelihood of destructive arcing at the exposed electrode also increases. Hence, most atmospheric plasma processes typically also comprise mostly non-electrically charged (inert) gas, such as He, which limit ionization. In a metal oxide byproduct removal application, however, the large volume (high flow) of inert gas may make the use of atmospheric plasma economically impractical. For example, the substantial removal of a metal oxide from just a 5 mm2 surface area on the substrate may require over 10 slm (standard liters per minute) of an inert gas. This may correspond to the consumption of over 100 liters of the inert gas for a single typical 300 mm substrate. Aside from the cost of obtaining a large volume of a semi-conductor grade inert gas, the storage of such a volume in a substrate fabrication facility may be unworkable. Additionally, because of equipment cost, cleaning and recycling the inert gas may be economically impractical. Referring now to FIG. 1, a simplified diagram of an atmospheric plasma jet device, in which both the powered electrode and the ground electrode are each configured on a cavity wall, is shown. Generally, an inert gas 118 (e.g., He, etc.) and a process gas 116 (e.g., H2, CF4, etc.) are flowed into sealed box 114 for pressurizing. The gases are, in turn, feed into a discharge chamber cavity 110 through gas influent 115, at which point a plasma is struck with an rf power source 108 and creates plasma effluent 104 from discharge orifice 117 at one end of cavity 110 to clean substrate 102. In general, the shape and diameter of discharge orifice 117 may affect the corresponding shape of plasma effluent 104 along both the lateral and longitudinal axis (e.g., laterally narrow and longitudinally deep, laterally wide and longitudinally shallow, etc.). However, as previously stated, a large volume of inert gas may be required to prevent the generation of arc 105 between powered electrode 106 to grounded electrode 112. Referring now to FIG. 2, a simplified diagram of an atmospheric plasma jet device, in which a powered electrode is configured as a center rod and a grounded electrode(s) is configured on a cavity inner surface, is shown. As before, generally, an inert gas 118 (e.g., He, etc.) and a process gas 116 (e.g., CF4, H2, etc.) are flowed into sealed box 114 for pressurizing. The gases are, in turn, feed into a discharge chamber cavity 110 through gas influent 115, at which point a plasma may be struck with an rf power source 108 and creates plasma effluent 104 from discharge orifice 117 at one end of cavity 110 to clean substrate 102. In general, the shape and diameter of discharge orifice 117 may affect the corresponding shape of plasma effluent 104 along both the lateral and longitudinal axis (e.g., laterally narrow and longitudinally deep, laterally wide and longitudinally shallow, etc.). However, as previously stated, a large volume of inert gas may be required to prevent the generation of arc 105 between powered electrode 106 to grounded electrode 112. In view of the foregoing, there are desired apparatus for the removal of a metal oxide from a substrate and methods therefor.

[faster-signatures] ed25519ll [signatures] keyring keyrings.alt [signatures:sys_platform!="win32"] pyxdg [test] pytest>=3.0.0 pytest-cov

View this post on Instagram Thank you @pete.buttigieg for inviting me to be your guest at the CBC Dinner. The last time I was invited to the dinner by a presidential candidate was @barackobama. You know what happened after that! We also caught up with @elizabethwarren at the dinner. Fun times with @mrflip410!

Q: Validating Close method and Windows Close button C# I am having a method like MainPage_FormClosing(object sender, FormClosingEventArgs e) and I am using Close method to close the form. This this.Close() method also triggers the MainPage_FormClosing method. I just want to perform some function specifically when the user click on Form Windows Close Button. I have seen some other questions here, they used some way like String.Equals((sender as Button).Name, @"CloseButton") to validate. The sender is always null for me How can I validate this ? A: If you can't use e.CloseReason, the simplest solution would be to use a flag - Have a form level boolean variable that will only change it's state if you are closing the form in code and in the form closing event handler. Something like this will do: private bool _isClosedFromCode = false; ... private void CloseForm() { _isClosedFromCode = true; Close(); } ... private void MainPage_FormClosing(object sender, FormClosingEventArgs e) { if(_isClosedFromCode) { // do your stuff here } _isClosedFromCode = false; }

Rick Rubin: Once You Release Your Work, You Can’t Go Back Legendary music producer Rick Rubin has worked with everyone from Johnny Cash to Kayne West and has been the force behind many #1 albums. In a must-read interview, The Daily Beast dives deep on Rubin’s creative process. One choice excerpt flies in the face of our modern “ship it and iterate” culture: Usually young people are in a rush. Why did you feel like you could take so much time? From the beginning, all I’ve ever cared about is things being great. I never cared about when they were done. Because I also feel like I want the music to last forever. And once you release it, you can’t go back and fix it, so you really have to get it right. And that takes time.

1. Field of the Invention The present invention relates to an aircraft engine handling assembly. 2. Description of the Related Art Aircraft engines are firstly manufactured in separate modules, which are then assembled with one another. The manufactured modules are transported to the place of assembly, and then removed from their conditioning and moved precisely to the position in which they are docked with the adjacent module. The movements are essentially accomplished by handling, although plant such as hoists to raise the modules, and carriages to move them, are available. This handling operation is long and difficult since aircraft engine modules are bulky and heavy items, whilst also being fragile. A particular difficulty derives from the fact that they are generally assembled with their rotational axis horizontal, whereas they are often positioned with the rotational axis vertical during shipment in their crate, in order that they are resting on a surface with a flat end, and in order that stability during shipment is improved: they must therefore be overturned when they have been removed from the crate, normally before being positioned on the carriage, but this operation is delicate and therefore requires many precautions. Placing the module on the carriage is also a delicate operation, and special brackets must be added to the module, called “lugs”, to enable it to rest on it in stable fashion and with sufficient area, which would otherwise be impossible due to its generally conical and irregular rotational shape. It must be added that it is also necessary to use tools called “strongbacks”, which are assembled at the ends of the module, in order to strengthen it whilst stopping the movements between the rotor and the stator before it is assembled with the other modules. The invention relates to an assembly for handling an aircraft engine module which avoids the mentioned disadvantages, and allows the assembly of the module with an adjacent module to be prepared under optimum working conditions, more rapidly and with much fewer manual interventions, requiring fewer precautions. DE-A-34 27 042 describes an aircraft engine handling assembly in which a moving carriage is fitted with means for attaching the module, and means for adjusting the position of the module, without reproducing other characteristics of the invention, and notably without creating an attachment through a tool secured to an end of the module, and providing the possibility of tipping the module completely. Other carriages or supporting devices are the subjects of U.S. Pat. Nos. 1,481,503, 1,600,835, US-A-2009/020 934 and U.S. Pat. No. 5,863,034.

National Humanities Institute The National Humanities Institute is a nonprofit interdisciplinary educational organization founded in 1984. It is known to be affiliated with traditionalist conservatism. It publishes Humanitas (journal) and the Epistulae Occasional Papers. The National Humanities Institute operates the Irving Babbitt Project and the Center for Constitutional Studies. Claes G. Ryn is the institute's chairman. Joseph Baldacchino is the institute's president. Robert F. Ellsworth and Anthony Harrigan serve on its board of trustees. Among its academic board are George W. Carey, Jude P. Dougherty, David C. Jordan, Ralph Ketcham, Forrest McDonald, Walter A. McDougall, Jacob Neusner, James Seaton, Peter J. Stanlis, and Michael A. Weinstein. References External links National Humanities Institute Humanitas Epistulae Category:Political organizations based in the United States

Get over 50 fonts, text formatting, optional watermarks and NO adverts! Get your free account now! "Guys can't complain about the friendzone, i'm not obligated to date anyone" - "you won't fuck me?! the bro code is stupid and unfair" Check out all our blank memes

Next Episode of The Citadel (1983) is Take your countdown whenever you go About EpisoDate.com is your TV show guide to Countdown The Citadel (1983) Episode Air Dates and to stay in touch with The Citadel (1983) next episode Air Date and your others favorite TV Shows. Add the shows you like to a "Watchlist" and let the site take it from there.

/* * Copyright (C) 2002 Sistina Software (UK) Limited. * Copyright (C) 2006 Red Hat GmbH * * This file is released under the GPL. * * Kcopyd provides a simple interface for copying an area of one * block-device to one or more other block-devices, with an asynchronous * completion notification. */ #include <linux/types.h> #include <asm/atomic.h> #include <linux/blkdev.h> #include <linux/fs.h> #include <linux/init.h> #include <linux/list.h> #include <linux/mempool.h> #include <linux/module.h> #include <linux/pagemap.h> #include <linux/slab.h> #include <linux/vmalloc.h> #include <linux/workqueue.h> #include <linux/mutex.h> #include <linux/device-mapper.h> #include <linux/dm-kcopyd.h> #include "dm.h" /*----------------------------------------------------------------- * Each kcopyd client has its own little pool of preallocated * pages for kcopyd io. *---------------------------------------------------------------*/ struct dm_kcopyd_client { spinlock_t lock; struct page_list *pages; unsigned int nr_pages; unsigned int nr_free_pages; struct dm_io_client *io_client; wait_queue_head_t destroyq; atomic_t nr_jobs; mempool_t *job_pool; struct workqueue_struct *kcopyd_wq; struct work_struct kcopyd_work; /* * We maintain three lists of jobs: * * i) jobs waiting for pages * ii) jobs that have pages, and are waiting for the io to be issued. * iii) jobs that have completed. * * All three of these are protected by job_lock. */ spinlock_t job_lock; struct list_head complete_jobs; struct list_head io_jobs; struct list_head pages_jobs; }; static void wake(struct dm_kcopyd_client *kc) { queue_work(kc->kcopyd_wq, &kc->kcopyd_work); } static struct page_list *alloc_pl(void) { struct page_list *pl; pl = kmalloc(sizeof(*pl), GFP_KERNEL); if (!pl) return NULL; pl->page = alloc_page(GFP_KERNEL); if (!pl->page) { kfree(pl); return NULL; } return pl; } static void free_pl(struct page_list *pl) { __free_page(pl->page); kfree(pl); } static int kcopyd_get_pages(struct dm_kcopyd_client *kc, unsigned int nr, struct page_list **pages) { struct page_list *pl; spin_lock(&kc->lock); if (kc->nr_free_pages < nr) { spin_unlock(&kc->lock); return -ENOMEM; } kc->nr_free_pages -= nr; for (*pages = pl = kc->pages; --nr; pl = pl->next) ; kc->pages = pl->next; pl->next = NULL; spin_unlock(&kc->lock); return 0; } static void kcopyd_put_pages(struct dm_kcopyd_client *kc, struct page_list *pl) { struct page_list *cursor; spin_lock(&kc->lock); for (cursor = pl; cursor->next; cursor = cursor->next) kc->nr_free_pages++; kc->nr_free_pages++; cursor->next = kc->pages; kc->pages = pl; spin_unlock(&kc->lock); } /* * These three functions resize the page pool. */ static void drop_pages(struct page_list *pl) { struct page_list *next; while (pl) { next = pl->next; free_pl(pl); pl = next; } } static int client_alloc_pages(struct dm_kcopyd_client *kc, unsigned int nr) { unsigned int i; struct page_list *pl = NULL, *next; for (i = 0; i < nr; i++) { next = alloc_pl(); if (!next) { if (pl) drop_pages(pl); return -ENOMEM; } next->next = pl; pl = next; } kcopyd_put_pages(kc, pl); kc->nr_pages += nr; return 0; } static void client_free_pages(struct dm_kcopyd_client *kc) { BUG_ON(kc->nr_free_pages != kc->nr_pages); drop_pages(kc->pages); kc->pages = NULL; kc->nr_free_pages = kc->nr_pages = 0; } /*----------------------------------------------------------------- * kcopyd_jobs need to be allocated by the *clients* of kcopyd, * for this reason we use a mempool to prevent the client from * ever having to do io (which could cause a deadlock). *---------------------------------------------------------------*/ struct kcopyd_job { struct dm_kcopyd_client *kc; struct list_head list; unsigned long flags; /* * Error state of the job. */ int read_err; unsigned long write_err; /* * Either READ or WRITE */ int rw; struct dm_io_region source; /* * The destinations for the transfer. */ unsigned int num_dests; struct dm_io_region dests[DM_KCOPYD_MAX_REGIONS]; sector_t offset; unsigned int nr_pages; struct page_list *pages; /* * Set this to ensure you are notified when the job has * completed. 'context' is for callback to use. */ dm_kcopyd_notify_fn fn; void *context; /* * These fields are only used if the job has been split * into more manageable parts. */ struct mutex lock; atomic_t sub_jobs; sector_t progress; }; /* FIXME: this should scale with the number of pages */ #define MIN_JOBS 512 static struct kmem_cache *_job_cache; int __init dm_kcopyd_init(void) { _job_cache = KMEM_CACHE(kcopyd_job, 0); if (!_job_cache) return -ENOMEM; return 0; } void dm_kcopyd_exit(void) { kmem_cache_destroy(_job_cache); _job_cache = NULL; } /* * Functions to push and pop a job onto the head of a given job * list. */ static struct kcopyd_job *pop(struct list_head *jobs, struct dm_kcopyd_client *kc) { struct kcopyd_job *job = NULL; unsigned long flags; spin_lock_irqsave(&kc->job_lock, flags); if (!list_empty(jobs)) { job = list_entry(jobs->next, struct kcopyd_job, list); list_del(&job->list); } spin_unlock_irqrestore(&kc->job_lock, flags); return job; } static void push(struct list_head *jobs, struct kcopyd_job *job) { unsigned long flags; struct dm_kcopyd_client *kc = job->kc; spin_lock_irqsave(&kc->job_lock, flags); list_add_tail(&job->list, jobs); spin_unlock_irqrestore(&kc->job_lock, flags); } static void push_head(struct list_head *jobs, struct kcopyd_job *job) { unsigned long flags; struct dm_kcopyd_client *kc = job->kc; spin_lock_irqsave(&kc->job_lock, flags); list_add(&job->list, jobs); spin_unlock_irqrestore(&kc->job_lock, flags); } /* * These three functions process 1 item from the corresponding * job list. * * They return: * < 0: error * 0: success * > 0: can't process yet. */ static int run_complete_job(struct kcopyd_job *job) { void *context = job->context; int read_err = job->read_err; unsigned long write_err = job->write_err; dm_kcopyd_notify_fn fn = job->fn; struct dm_kcopyd_client *kc = job->kc; if (job->pages) kcopyd_put_pages(kc, job->pages); mempool_free(job, kc->job_pool); fn(read_err, write_err, context); if (atomic_dec_and_test(&kc->nr_jobs)) wake_up(&kc->destroyq); return 0; } static void complete_io(unsigned long error, void *context) { struct kcopyd_job *job = (struct kcopyd_job *) context; struct dm_kcopyd_client *kc = job->kc; if (error) { if (job->rw == WRITE) job->write_err |= error; else job->read_err = 1; if (!test_bit(DM_KCOPYD_IGNORE_ERROR, &job->flags)) { push(&kc->complete_jobs, job); wake(kc); return; } } if (job->rw == WRITE) push(&kc->complete_jobs, job); else { job->rw = WRITE; push(&kc->io_jobs, job); } wake(kc); } /* * Request io on as many buffer heads as we can currently get for * a particular job. */ static int run_io_job(struct kcopyd_job *job) { int r; struct dm_io_request io_req = { .bi_rw = job->rw | (1 << BIO_RW_SYNCIO) | (1 << BIO_RW_UNPLUG), .mem.type = DM_IO_PAGE_LIST, .mem.ptr.pl = job->pages, .mem.offset = job->offset, .notify.fn = complete_io, .notify.context = job, .client = job->kc->io_client, }; if (job->rw == READ) r = dm_io(&io_req, 1, &job->source, NULL); else r = dm_io(&io_req, job->num_dests, job->dests, NULL); return r; } static int run_pages_job(struct kcopyd_job *job) { int r; job->nr_pages = dm_div_up(job->dests[0].count + job->offset, PAGE_SIZE >> 9); r = kcopyd_get_pages(job->kc, job->nr_pages, &job->pages); if (!r) { /* this job is ready for io */ push(&job->kc->io_jobs, job); return 0; } if (r == -ENOMEM) /* can't complete now */ return 1; return r; } /* * Run through a list for as long as possible. Returns the count * of successful jobs. */ static int process_jobs(struct list_head *jobs, struct dm_kcopyd_client *kc, int (*fn) (struct kcopyd_job *)) { struct kcopyd_job *job; int r, count = 0; while ((job = pop(jobs, kc))) { r = fn(job); if (r < 0) { /* error this rogue job */ if (job->rw == WRITE) job->write_err = (unsigned long) -1L; else job->read_err = 1; push(&kc->complete_jobs, job); break; } if (r > 0) { /* * We couldn't service this job ATM, so * push this job back onto the list. */ push_head(jobs, job); break; } count++; } return count; } /* * kcopyd does this every time it's woken up. */ static void do_work(struct work_struct *work) { struct dm_kcopyd_client *kc = container_of(work, struct dm_kcopyd_client, kcopyd_work); /* * The order that these are called is *very* important. * complete jobs can free some pages for pages jobs. * Pages jobs when successful will jump onto the io jobs * list. io jobs call wake when they complete and it all * starts again. */ process_jobs(&kc->complete_jobs, kc, run_complete_job); process_jobs(&kc->pages_jobs, kc, run_pages_job); process_jobs(&kc->io_jobs, kc, run_io_job); } /* * If we are copying a small region we just dispatch a single job * to do the copy, otherwise the io has to be split up into many * jobs. */ static void dispatch_job(struct kcopyd_job *job) { struct dm_kcopyd_client *kc = job->kc; atomic_inc(&kc->nr_jobs); if (unlikely(!job->source.count)) push(&kc->complete_jobs, job); else push(&kc->pages_jobs, job); wake(kc); } #define SUB_JOB_SIZE 128 static void segment_complete(int read_err, unsigned long write_err, void *context) { /* FIXME: tidy this function */ sector_t progress = 0; sector_t count = 0; struct kcopyd_job *job = (struct kcopyd_job *) context; struct dm_kcopyd_client *kc = job->kc; mutex_lock(&job->lock); /* update the error */ if (read_err) job->read_err = 1; if (write_err) job->write_err |= write_err; /* * Only dispatch more work if there hasn't been an error. */ if ((!job->read_err && !job->write_err) || test_bit(DM_KCOPYD_IGNORE_ERROR, &job->flags)) { /* get the next chunk of work */ progress = job->progress; count = job->source.count - progress; if (count) { if (count > SUB_JOB_SIZE) count = SUB_JOB_SIZE; job->progress += count; } } mutex_unlock(&job->lock); if (count) { int i; struct kcopyd_job *sub_job = mempool_alloc(kc->job_pool, GFP_NOIO); *sub_job = *job; sub_job->source.sector += progress; sub_job->source.count = count; for (i = 0; i < job->num_dests; i++) { sub_job->dests[i].sector += progress; sub_job->dests[i].count = count; } sub_job->fn = segment_complete; sub_job->context = job; dispatch_job(sub_job); } else if (atomic_dec_and_test(&job->sub_jobs)) { /* * Queue the completion callback to the kcopyd thread. * * Some callers assume that all the completions are called * from a single thread and don't race with each other. * * We must not call the callback directly here because this * code may not be executing in the thread. */ push(&kc->complete_jobs, job); wake(kc); } } /* * Create some little jobs that will do the move between * them. */ #define SPLIT_COUNT 8 static void split_job(struct kcopyd_job *job) { int i; atomic_inc(&job->kc->nr_jobs); atomic_set(&job->sub_jobs, SPLIT_COUNT); for (i = 0; i < SPLIT_COUNT; i++) segment_complete(0, 0u, job); } int dm_kcopyd_copy(struct dm_kcopyd_client *kc, struct dm_io_region *from, unsigned int num_dests, struct dm_io_region *dests, unsigned int flags, dm_kcopyd_notify_fn fn, void *context) { struct kcopyd_job *job; /* * Allocate a new job. */ job = mempool_alloc(kc->job_pool, GFP_NOIO); /* * set up for the read. */ job->kc = kc; job->flags = flags; job->read_err = 0; job->write_err = 0; job->rw = READ; job->source = *from; job->num_dests = num_dests; memcpy(&job->dests, dests, sizeof(*dests) * num_dests); job->offset = 0; job->nr_pages = 0; job->pages = NULL; job->fn = fn; job->context = context; if (job->source.count < SUB_JOB_SIZE) dispatch_job(job); else { mutex_init(&job->lock); job->progress = 0; split_job(job); } return 0; } EXPORT_SYMBOL(dm_kcopyd_copy); /* * Cancels a kcopyd job, eg. someone might be deactivating a * mirror. */ #if 0 int kcopyd_cancel(struct kcopyd_job *job, int block) { /* FIXME: finish */ return -1; } #endif /* 0 */ /*----------------------------------------------------------------- * Client setup *---------------------------------------------------------------*/ int dm_kcopyd_client_create(unsigned int nr_pages, struct dm_kcopyd_client **result) { int r = -ENOMEM; struct dm_kcopyd_client *kc; kc = kmalloc(sizeof(*kc), GFP_KERNEL); if (!kc) return -ENOMEM; spin_lock_init(&kc->lock); spin_lock_init(&kc->job_lock); INIT_LIST_HEAD(&kc->complete_jobs); INIT_LIST_HEAD(&kc->io_jobs); INIT_LIST_HEAD(&kc->pages_jobs); kc->job_pool = mempool_create_slab_pool(MIN_JOBS, _job_cache); if (!kc->job_pool) goto bad_slab; INIT_WORK(&kc->kcopyd_work, do_work); kc->kcopyd_wq = create_singlethread_workqueue("kcopyd"); if (!kc->kcopyd_wq) goto bad_workqueue; kc->pages = NULL; kc->nr_pages = kc->nr_free_pages = 0; r = client_alloc_pages(kc, nr_pages); if (r) goto bad_client_pages; kc->io_client = dm_io_client_create(nr_pages); if (IS_ERR(kc->io_client)) { r = PTR_ERR(kc->io_client); goto bad_io_client; } init_waitqueue_head(&kc->destroyq); atomic_set(&kc->nr_jobs, 0); *result = kc; return 0; bad_io_client: client_free_pages(kc); bad_client_pages: destroy_workqueue(kc->kcopyd_wq); bad_workqueue: mempool_destroy(kc->job_pool); bad_slab: kfree(kc); return r; } EXPORT_SYMBOL(dm_kcopyd_client_create); void dm_kcopyd_client_destroy(struct dm_kcopyd_client *kc) { /* Wait for completion of all jobs submitted by this client. */ wait_event(kc->destroyq, !atomic_read(&kc->nr_jobs)); BUG_ON(!list_empty(&kc->complete_jobs)); BUG_ON(!list_empty(&kc->io_jobs)); BUG_ON(!list_empty(&kc->pages_jobs)); destroy_workqueue(kc->kcopyd_wq); dm_io_client_destroy(kc->io_client); client_free_pages(kc); mempool_destroy(kc->job_pool); kfree(kc); } EXPORT_SYMBOL(dm_kcopyd_client_destroy);

Q: Using jQuery to assign an active class to an area tag (image map) Is there a way, through jQuery, to assign an active class to an area tag within an a map? I have a bunch of areas defined like this: <map name="mappy"> <area shape="rect" coords="162,105,179,136" href="#" title="Unique Title 1" alt="Unique Title 1" /> <area shape="rect" coords="205,72,222,101" href="#" title="Unique Title 2" alt="Unique Title 2" /> </map> What I need to figure out is if it is possible to add a some jQuery that sniffs out the title or alt tag and applies an active class to the area if there is a match. Something like... if title="Unique Title 1" then add class="active" to area. Is this possible? A: You can use the attribute-equals selector to find it and .addClass() to do the actual adding, like this: $("area[title='Unique Title 1']").addClass("active");

MIC president Datuk Seri G Palanivel has agreed to a moratorium to allow for discussions with Datuk Seri Najib Tun Razak to resolve the party crisis. "I agree to a moratorium to allow both sides to discuss with the Prime Minister as Chairman of Barisan Nasional to find the best way forward to resolve the crisis," Palanivel said in a statement on Thursday. He said he and his deputy, Datuk Seri Dr S Subramaniam, will "stand down" as they did not want the party crisis to get worse. "We will have a moratorium. I do not want the party crisis to escalate," Palanivel said. He said the moratorium will give both he and Dr Subramaniam "a period of non-crisis to resolve the issues that have come up." "We will meet and decide on the next course of action that will satisfy all quarters as soon as possible," he added. Wednesday, January 28, 2015 PAS secretary-general Datuk Mustafa Ali has challenged Penang Chief Minister Lim Guan Eng to a debate over the party and DAP’s dispute concerning local council elections. Accusing Lim of spewing “half-truths, Mustafa said, contrary to Lim’s allegations, PAS was never consulted on local council elections in Penang before it was tabled in the state assembly in May 2012. “It was wrong for him to say that we agreed to their proposal. This goes to show that he is 'celupar' (a loose cannon),” he told a press conference at PAS’ headquarters, Wednesday. Lim is reported to have said he had called both PAS president Datuk Seri Abdul Hadi Awang and Mustafa before Penang pushed for the implementation of council elections. Denying this, Mustafa said PAS was only consulted after the enactment was tabled via a phone call from Lim. “He then asked me to give positive comments to the press because he said DAP has been pressured by NGOs to fulfil their election promises by pushing for the third vote. “All I said was, ‘God willing’. But this did not mean that PAS supported their proposal,” he said. Mustafa said it was not fair for Lim to have labelled him dishonest and warned him to be mindful of his words. He added that PAS had consulted DAP on the proposed implementation of hudud in Kelantan before the party joined a special committee to study the implementation of the syariah criminal law. “Is it fair for me to say that Lim or DAP had agreed to hudud because they had no problem with us joining the committee? Of course not. Mustafa added that it was better for both he and Lim to face each other in an open debate “to find out the truth”.“Let’s determine who is telling the truth, who isn’t. As for me, I am responsible for my statement,” he said. Tuesday, January 27, 2015 Lizard Squad, the hacker group which claimed responsibility for hacking into Malaysia Airlines’ (MAS) website, has indicated that it was also responsible for Tuesday’s worldwide Facebook and Instagram outages. Lizard Squad, the hacker group which claimed responsibility for taking down Malaysia Airlines' (MAS) website on Monday, has also claimed credit in the past for the hacking of Microsoft's Xbox Live and the Sony's PlayStation Network. According to online technology news portal TechCrunch, users of Xbox Live and PlayStation Network on Christmas day last year reported suffering service disruptions and difficulty logging into the networks. Lizard Squad also claimed to be the “Official Cyber Caliphate”, a hacker group allegedly associated with the Islamic State terror group and which earlier this month took control of the Twitter and YouTube accounts of the United States’ central military command. It was reported that the message also included links to supposedly confidential US Army files, although there is indication that some of the files may have previously been made public or aren’t highly confidential. In the MAS website hack, the group claimed to have taken information from the airline’s servers. It later shared a screenshot of an inbox with passenger itineraries. MAS confirmed that their Domain Name System (DNS) had been compromised and that users were re-directed to a hacker website when accessing their website. “At this stage, Malaysia Airlines’ web servers are intact. The airline has resolved the issue with its service provider and the system is expected to be fully recovered within 22 hours,” said MAS in a press statement, Monday.MAS has reported the issue to CyberSecurity Malaysia and the Transport Ministry. They also assured customers and clients that the temporary glitch did not affect bookings and that user data is secure. Monday, January 26, 2015 PKR de-facto leader Datuk Seri Anwar Ibrahim will know the verdict of his appeal against his sodomy conviction on Feb 10. This was announced in a tweet on Monday by Federal Court communications and international relations chief Mohd Aizuddin Zolkeply, who said "Decision of DSAI v PP at Federal Court fixed on February 10, 2015 at 9.00 am" on the Malaysian Judiciary's official Twitter account, @MYJudiciary. If Anwar is found guilty, he would be disqualified as the member of parliament (MP) for Permatang Pauh as per Article 48(1)(e) of the Federal Constitution which states that an MP would be disqualified if he or she is sentenced to a jail term of more than a year, or fined more than RM2,000. In the appeal. Anwar, 67, is asking the Federal court to set aside the conviction and sentence imposed by the Court of Appeal on March 7 this year after it had overturned a High Court decision to acquit him. The hearings ran for eight days from Oct 28 to Nov 7 2014. The Court of Appeal found Anwar guilty of having sodomised his former aide, Mohd Saiful Bukhari Azlan, 27, at Unit 11-5-1 of the Desa Damansara Condominium in Jalan Setiakasih, Bukit Damansara, between 3.10pm and 4.30pm on June 26, 2008. The charge under Section 377B of the Penal Code carries a jail sentence of up to 20 years and whipping, upon conviction. On Jan 9, 2012, the High Court acquitted and discharged Anwar of having sodomised Mohd Saiful on the grounds that the court could not be 100 per cent certain on the integrity of samples taken for DNA testing from the alleged victim. The number of dengue cases in Malaysia is on the rise, with nearly 3,000 new cases recorded in the past week. With more than 1,000 cases, Selangor grabbed the lion’s share of the attention of the Government. “The Health Ministry has urged Selangor and its local councils to pay close attention to the rise in dengue cases,” said Deputy Health Minister Datuk Seri Dr Hilmi Yahaya, who added that dengue in Petaling Jaya had worsened. “Local councils must keep a close watch on proper waste management and other related problems which may lead to the increase in dengue cases,” he told a press conference after presenting 1Malaysia People’s Aid (BR1M) 2015 here yesterday. Friday, January 23, 2015 Prime Minister Datuk Seri Najib Tun Razak cancelled all his programmes at the World Economic Forum (WEF) here to attend the funeral of King Abdullah Abdulaziz in Saudi Arabia. Najib and his wife, Datin Seri Rosmah Mansor, are scheduled to leave Davos at 9.30am (4.30pm in Malaysia) and fly to Riyadh at about noon from Zurich, said the prime minister's press secretary, Datuk Akmar Hisham Mokhles. Najib's working visit to the United Kingdom remains as scheduled, from Jan 24 to 26. King Abdullah died early Friday at the age of 90. His brother, Prince Salman bin Abdulaziz, has been named the new king. Prime Minister Datuk Seri Najib Tun Razak will kick off his first day at the 45th World Economic Forum with a message to investors that Malaysia is ready for business. In his second appearance at one of the world’s important gatherings of great minds, with this year’s theme “The New Global Context”, he will send a message that Malaysia is at the heart of the world’s potential growth area, which is Asean. As Asean chairman, Najib is expected to deliver a strong message as well as lay the right foundation towards the realisation of the Asean Economic Community in line with Malaysia’s chairmanship of the regional grouping this year. Global companies that are attending include General Electric, Barclays, Bata, Huawei, Lippo Group, Hyatt Hotel and Ernst and Young. Najib, who is also Finance Minister, is expected to explain the current economic situa­tion and pre-emptive measures announced on Tuesday to sustain Malaysia’s economic stabi­lity and retain the flow of foreign investments into the country. Later in the afternoon, Najib will hold a 20-minute bilateral talk with Netherlands Prime Minister Mark Rutte at Panorama Hotel, the venue for the WEF, and meet Andhra Pradesh Chief Minister Chandra Babu Naidu. Najib will meet heads of five ­foreign companies, possibly for talks on new investment ventures as well as to expand existing investments in Malaysia. The first day will end with bilateral talks with Turkish Prime Minister Ahmet Davutoglu. Najib is also scheduled to hold bilateral meetings with his Kazakhstan counterpart Karim Massimov and US Secretary of State John Kerry. Najib arrived here on Wednesday night and was received by Malaysian Ambassador to Switzerland Datuk Mohd Zulkephli Mohd Noor. Besides Najib, other heads of states or govern­ment that have confirmed their participation include King Abdullah II of Jordan and Italian Prime Minister Matteo Renzi. The WEF will see the congregation of more than 40 world leaders, as well as 2,500 participants from 140 countries. Thursday, January 22, 2015 The public should not hesitate to approach the police when assistance is needed, said Malaysian Anti Corruption Commission representative Tan Sri Robert Phang. "They often have a perception that their reports will be ignored or that they will need to wait for a long time before any action is taken. "In addition to that, it is a common stereotype that police officers often speak in a rough manner by addressing the public with ' apa kamu mahu? '( what do you want?)" he said. He added that the training for police officers should henceforth include public relations and human relations. "The public should be able to feel that the Police department and its officers are there for them, to help them when needed," he said during the Safer Malaysia Conference at the National University of Defence (UNPM). Robert added that the Police department is under a lot of strain and stress as the expectations on them varies, but it is important for all issues to be addressed by them. Deputy Public Prosecutor Wan Shaharuddin Wan Ladin said the legal department also often has trouble in receiving cooperation from the public, especially as witnesses. "First things first, we need to change their mindset and let them know that they are under no risk and will be protected. Giving the Prevention of Crime Act ( PCA) as an example, he said that the people fear it as they feel it is a varation of the Internal Security Act ( ISA). "Unlike ISA, rhe public prosecutor has a say in the PCA and whether or not a person should be arrested under the act. We look into all the related evidence and evaluate it under section 9.3 of the Act to see what can be done next," he added. Wan said that identified witnesses are often hesitant to come forward in fear of their life and explained that things are handled differently now. "When the witnesses do not turn up, we put the case on hold and call in the witness on a private basis. "They will then be placed under the witness protection program and given the opportunity to testify without a counsel present, after explaining why they did not turn up in court to testify," he said adding that lack of cooperation would interrupt the investigation and delay the conclusion. Clerk Jill Ireland’s CDs were seized on May 11, 2008, at the then low cost carrier terminal (LCCT) in Sepang, when she returned from Indonesia. The Home Ministry had held then, under the Printing Presses and Publications Act 1984 (PPPA), that the CDs were in breach of the guidelines of the Islamic Development Department of Malaysia (Jakim).In July last year, High Court (Appellate and Special Powers) judge Zaleha Yusof had ordered for the items to be returned to the owner. “Doctors have done their best and my father is stable but he’s unconscious,” Nik Abduh told reporters after visiting the PAS spiritual adviser at Universiti Sains Malaysia Hospital (HUSM) Kubang Kerian on Tuesday. Nik Abduh added that is father was warded due to prostate cancer and that Nik Aziz, 83, had undergone chemotherapy in 2012. “He is on a breathing support machine and I did not talk to him because he was unconscious,” he said. Nik Abduh, a PAS central committee member, also highlighted that his father’s health had begun to deteriorate in December last year. * Projects such as the MRT Line 2, LRT 3, Kuala Lumpur-Singapore High-Speed Rail will be continued. Najib also said that the Government has revised the fiscal deficit forecast to 3.2% for this year from 3% projected earlier. He said the notion that declining oil prices and a subsequent contraction in export revenue would result in a deficit current account was not true. With the reduction in the retail price of petrol and diesel by 35 sen and 30 sen, respectively, Najib said the rakyat's gross disposal income now stands around RM7.5bil. Najib said the current account balance is expected to remain in surplus, adding that although the ringgit has depreciated, it is expected to stabilise over time to reflect the strong economic fundamentals. He noted that the development expenditure of RM48.5bil for this year will be maintained and spent, with operating expenditure expected to be reduced by RM5.5bil. Najib is adjusting Budget 2015, with both proactive and pre-emptive measures, in bid to ensure sustainable development and the resilience of the economy. His announcement at a special function, Tuesday, focuses on actions and policy interventions to handle the changing economic scenario caused by the oil price slump. When Najib, who is also Finance Minister, tabled Budget 2015 last year with an expected expenditure of RM273.9bil against an expected revenue of RM235.2bil, oil price averaged around US$90 (RM355) per barrel. But the price has been falling and is expected to drop to as low as US$40 (RM140) in the first six months of this year. Friday, January 16, 2015 Malaysia will not allow religious provocation or any threatening act or insults of any religion to take place even in the name of freedom of expression, said Datuk Seri Najib Tun Razak. The Prime Minister reiterated that freedom had its limitation and that authorities would continue to take action against those attempting to stir religious conflict in the country. "Mutual respect among the various races is a basic principle that we need to practise to ensure national harmony is maintained," he said in his message aired over local radio, Friday. Najib said Malaysia strongly condemned the terrorist attacks in several locations around the world such as in Paris and Sydney recently. "In the 'Charlie Hebdo' context, we completely avoid such attacks, nevertheless at the same time, it is pointless to accept such actions of provocation against other religions," Najib said, referring to last week's incident which saw an attack on the office of the French satirical newspaper in Paris that resulted in the deaths of 12 people. The newspaper had published provocative cartoons that were seen as insulting to Muslims.Drawing attention to the White Paper on terror, tabled in Parliament in November last year, Najib added that the Government was committed to safeguarding Malaysia from militant threats. A new Centre of Excellence for Research on disaster management will be set up, said Deputy Prime Minister Tan Sri Muhyiddin Yassin. He said RM20mil in special grants will also be offered for research into disaster management and flood mitigation, through the Long Term Research Grant Scheme and Fundamental Reserach Grant Scheme. "Landslides, haze and floods often occur in our country, and there needs to be a comprehensive and effective approach to disaster management. "This includes the aspects of environmental management, disaster preparedness, public awareness programmes, relief coordination, communications and the rebuilding of disaster-hit areas," he said in his New Year's address to Education Ministry staff here on Friday. Muhyiddin, who is also the Education Minister, said that estimated cost of damage to schools and tertiary institutions in the recent floods was around RM500mil. "I hope schools and institutions located in flood-prone areas will prepare for the possibility of floods. "Students, teachers and parents should also be given disaster awareness education so that they will be physically and mentally prepared for such disasters, and are able to look after their families' safety," he said. On another matter, Muhyiddin said that the Malaysia Education Development Plan (Higher Education) 2015-2025 will be launched in the first quarter of this year. "This plan will produce innovative and creative talent in line with the 'new academia' agenda of the 11th Malaysia Plan," he said. Muhyiddin also announced the setting up of the Malaysian Inclusivity, Development and Advancement Institute (Minda) at Universiti Kebangsaan Malaysia, which will carry out research on "social and economic inequality in society with a focus on economic development that is inclusive and narrows the wage gap". Thursday, January 15, 2015 There has been no directive by the Education Ministry to stop non-Muslims students from wearing baju kurung to school said Deputy Prime Minister Tan Sri Muhyiddin Yassin. Muhyiddin said on Thursday that the regulation was probably issued by the school itself and added that the ruling was not right. "We will speak to the school authorities and correct this ruling so that it is in accordance to the regulations set by the ministry," he said. Muhyiddin, who is also Education Minister, said that schools should not set their own regulations as they wished. It was previously reported that a secondary student who was non-Muslim was barred from entering class as she wore a baju kurung. Tuesday, January 13, 2015 The following points are general guidelines for Muslims on how to initially deal with and immediately react to the depiction of Prophet Muhammad ﷺ in magazines due to be published tomorrow (WEDNESDAY). 1. For every Muslim, Love of the Prophet ﷺ is a NECESSARY part of his/her FAITH. He is dearer to us than our mothers, fathers, sons & daughters. We prefer him to our own self. 2. The publishing of cartoons will hurt the sentiments of 1.8 billion Muslims around the world, as well as millions of non-Muslims who respect the great personality of Prophet Muhammad (peace be upon him). 3. Muslims do believe in freedom of speech. And they do respect the right for people to say what they believe to be correct. However, we all know that there is no such thing as absolute free speech. There are laws to protect the dignity and properties of people. We urge all decent minded Governments and individuals to respect these sensitivities, as we should respect all races and religions. 4. As it is clear that the cartoons are to be published again, Muslims will inevitably be hurt and angered, but our reaction must be a reflection of the teachings of the one we love & are angered for, ﷺ. Enduring patience, tolerance, gentleness and mercy as was the character of our beloved Prophet (peace and Blessings be upon him) is the best and immediate way to respond. With dignified nobility we must be restrained, as the Quran says “And when the ignorant speak with them, they say Peace.” Our aim is to not, inadvertently, give the cartoons more prominence through our attention. Muslims must remain calm and peaceful in their speech and actions. Repel harm with goodness is the Qur’anic imperative and by which the Prophet Muhammad lived. Legal action, civil protest, letter writing & other legal avenues can then be considered,insha Allah. 5. Muslims have to remember that by depicting the Prophet ﷺ, no one can ever tarnish his image, as he is way beyond what is depicted, as Allah says, ‘We have elevated your remembrance’. We should spend such regrettable moments in reading lots of Durood, sending salawaat and blessings to his beloved personality. May Allah's mercy, peace & blessing be upon his soul. 6. Engage with others about your feelings. Speak of your love for the Prophet ﷺ and do not be shy to let your non-Muslims friends know your justified anger at the mockery that is made of our faith. People need to know HOW MUCH WE LOVE OUR NABI ﷺ. 7. Learn more & share more about the great Prophet Muhammed ﷺ. Here is a piece I wrote about al-Mustafa, the Chosen One that will help you along that path. From a distance you notice his eyes – piercing, brilliant and engaging. The choicest Praise and Mercy of Allah be upon him. Muhammed, the Praised one is Ahmed, the greatest in Praise of Allah; sublimely appropriate. Al-Mustapha, the Divinely Chosen, is real. He was flesh and blood. Human. I love him, O Allah, I love him sal Allahu alayhi wa sallam. In a world of distortion, where truth is overcome by fiction, the full moon rises. Although obscured by shadows or an overcast sky, the moon remains. Such is the fame and honour of Muhammed, sal Allahu alayhi wa sallam. Of average height, he towers above the elite of history. He would stand fully erect without a lazy slump. He was powerful, sal Allahu alayhi wa sallam. His chest was broad with a dusting of hair that extended vertically in a thin line down to his flat stomach, sal Allahu alayhi wa sallam. Any kind of hardships you can envision and pray to never face was shouldered by him, sal Allahu alayhi wa sallam, simultaneously. He experienced in his 63 years of blessed life more tribulation than a cohort. He, sal Allahu alayhi wa sallam, was an orphan, a widower, battle scarred, and unjustly outcast. He outlived many of his children and buried some of his grandchildren. His uncle, the Mercy of Allah be upon him, was martyred and his body desecrated. He, sal Allahu alayhi wa sallam, was defamed, mocked, lied to and lied about. He was poisoned, stoned, and had to witness his companions tortured on account of their faith in his Message, sal Allahu alayhi wa sallam., Sabraan, remain steadfast in patience, O Family of Yasser; your destination is Paradise. His teaching was simple. Allah, the All Mighty, is the only One deserving of worship and devotion. All that we encounter is by His Command. No harm can befall without His Permission. His hair, sal Allahu alayhi wa sallam, was black and wavy. He liked to keep it longer in length, usually not past his earlobes. It contained a few gray strands, about 23 in number. With dark irises he could, by Divine Permission, view a world that was unseen. He had long, dark eyelashes that from a distance could be mistaken for kohl. He, sal Allahu alayhi wa sallam, would not avert his attention from a petitioner until their voice fell silent. His eyes would sleep but his heart was awake. His eyes never betrayed or invited treachery, sal Allahu alayhi wa sallam. The weakest, poorest and socially downtrodden would access him, sal Allahu alayhi wa sallam, as readily as the chieftains. He sheltered the needy, fed the hungry, protected the vulnerable, guarded the secrets and instructed the uninformed. He, sal Allahu alayhi wa sallam, was calm when others were agitated, loving when others were filled with hate, and polite when shown contempt. He, sal Allahu alayhi wa sallam, is the highest standard of character and the spring of Divinely ordained etiquette. His skin, sal Allahu alayhi wa sallam, was soft and naturally fragrant. His blessed hands were softer than silk and gave off the scent of aromatic musk. He was reddish in colour. He was not dark, nor was he pale. His skin was blemished with the seal of prophethood between his shoulder blades. He was proportional in all respects, sal Allahu alayhi wa sallam. In his prayer, he found comfort and pleasure. His voice quivered in awe of the All Mighty. When leading others, he would, for the most part, recite from al-Qisar (the short chapters). If he heard a child crying, he would cut the recitation short to relieve the parent of any distress. His, sal Allahu alayhi wa sallam, grandchildren would ride atop his back during his prostration, and he would not move until they felt content. His voice was measured, and he paused at the end of every verse. He would recite the Qur'an in various accents to accommodate all the dialects of his companions. When alone at night, he would pray. He would remain vigilant for half the night, sometimes more, sometimes less. When he recited a passage addressing Allah's Divine Mercy, he would stop and ask for it. If one of torment, he would seek protection from it, sal Allahu alayhi wa sallam. His face, sal Allahu alayhi wa sallam, was manifest beauty. His eyes were well set apart and covered by full brows. They were not sunk into his face or overtly protruding. His mouth smelled sweet, and his teeth were always clean and white. His saliva was a medicine and blessing, sal Allahu alayhi wa sallam. By the Grace of Allah, it was a cure to the blind, increase in food to the poor, and an ointment to the disfigured. He had a full, dark beard that obscured his slender long neck from a distance. His smile was radiant, sal Allahu alayhi wa sallam. He was soft spoken except when he sermonised on Friday. His voice was melodious and captivating. He spoke only when necessary and refrained from idle chit-chat. His, sal Allahu alayhi wa sallam, tongue was true. He loved to listen and would ask questions of those whom he instructed. He was modest and sensitive to the needs and feelings of others. He smiled and laughed often, seldom loudly. When he, sal Allahu alayhi wa sallam, was displeased, it could be read from his face. He never raised his hand against another living creature except during Divinely ordained battle. He, sal Allahu alayhi wa sallam, was courageous and led from the forefront. He stood in the ranks of his soldiers and faced the hardship they endured. He ate what they ate, slept where they slept and dressed as they dressed. He, sal Allahu alayhi wa sallam, was a man unlike the world has ever seen. He, sal Allahu alayhi wa sallam, dressed similar to his compatriots. He never owned a throne or regal markings to distinguish himself, sal Allahu alayhi wa sallam, from others. He would walk without an escort and disliked sentries being placed to guard him. He preferred neutral shades of white, green and black to clothe himself with. When he ate, it was never to his fill, and he always ate while sharing his food with others. He loved milk, dates and honey. His favourite dish was tharrid – roasted mutton on buttered bread and broth. He, sal Allahu alayhi wa sallam, cared for the earth and despised wastefulness and corruption. He was a tree hugger LITERALLY. He loved animals and instructed his companions to show kindness to them. When a camel wept, he would stroke it and speak to it in hushed tones. When the tree whimpered, he paused his sermon and embraced its trunk, whispering to it soothing words of comfort. Animals took comfort in him, sal Allahu alayhi wa sallam. Today, his modality of life and tradition remain intact, preserved not only in print, but in conscious spirit. He loved us so much, sal Allahu alayhi wa sallam. He would think of those who would believe in him many generations after his generation and weep in longing and hope. He loved us more than some care to consider. Every Messenger of God was allowed a request that would be answered by Allah. All the Messengers utilised their invocation in the worldly life except for Muhammed, sal Allahu alayhi wa sallam. He, sal Allahu alayhi wa sallam, preserved his invocation to be intercession on the Day of Judgement for those who accept his message! None can truly claim faith until Muhammed, sal Allahu alayhi wa sallam is more beloved to them than their parents, spouse and children. To know him is to love him. To love him is to obey him. If he, sal Allahu alayhi wa sallam, was to walk into your life now, what would he think? O you who believe, send your greetings to Muhammed, sal Allahu alayhi wa sallam. The newest edition of Charlie Hebdo will include cartoons of the Muslim prophet Muhammad, as the French satirical magazine continues to stand defiantly against Islamic extremism following an attack on its Paris offices that left 12 people dead. The magazine’s first issue since the attack will have a print run of 1 million copies, compared with its usual 60,000 a week, and will be half its usual length at eight pages long. It’s set to publish Wednesday and will be translated into 16 languages. So they think they can create more angers among Muslims. We hope the world won't react if the angry Muslims reacts. Monday, January 12, 2015 Event organisers have been told to abide by entertainment guidelines issued by the Malaysian Islamic Development Department (Jakim), after public outcry over a viral video of South Korean K-pop band B1A4 members hugging and kissing tudung-clad female fans during a recent concert. Its director-general Datuk Othman Mustapha said the incident had "shamed Malaysia and the Muslim community" and urged concert organisers to weigh both the positive and negative implications before organising an event. Jakim had issued an Islamic guideline on entertainment in 2007 to be referenced by event organisers and agencies before conducting their programmes. Othman said Jakim had not been informed of this concert and had no knowledge of it. He also questioned if the organisers were diligent in following these guidelines. "The concert organiser must bear responsibility and not indemnify themselves. "Any event that contravenes Islamic morals and the cultural decencies of Malaysi ans should not be allowed to take place," Othman said in a statement on Monday. He said the Federal Territory Religious Department (Jawi) had been instructed to take necessary action as the concert was held in Kuala Lumpur. He said that Jakim was ready to cooperate with the Foreign Artists' Film Screening and Performance central agency (Puspal) when it summons the concert organiser to explain the incident. Othman also advised the younger generation preserve their self-respect and not allow themselves to be taken advantage of by their idols. "There is no such thing as personal right or freedom in doing something that violates Islamic principles. They should have a sense of shame, and covering themselves with the proper attire is a way to hide that shame," he added. A three-minute video clip of the South Korean band's members hugging and kissing female Malay fans on stage went viral on social media on Sunday, prompting criticism from Internet users. The concert organiser, TGM events, has since apologised for the incident and said in a statement that the female fans had gone on stage willingly. The company also said it had never nor would it ever condone any form of sexual harassment or molestation during its events. Indonesian navy divers on Monday retrieved the black box flight data recorder from an AirAsia airliner that crashed two weeks ago, killing all 162 people on board, a government official said. Flight QZ8501 lost contact with air traffic control in bad weather on Dec. 28, less than halfway into a two-hour flight from Indonesia's second-biggest city of Surabaya to Singapore. "At 7:11, we succeeded in lifting the part of the black box known as the flight data recorder," Fransiskus Bambang Soelistyo, the head of the National Search and Rescue Agency, told reporters at a news conference. The second black box with the cockpit voice recorder has been located, based on pings from its emergency transmitter, but not yet retrieved, Madjono Siswosuwarno, the main investigator at the National Transportation Safety Committee, told Reuters. Officials hope the black boxes, found near the wrecked wing of the plane, will reveal the cause of the crash. The national weather bureau has said seasonal storms were likely a factor. The recorders are expected to be taken to the capital, Jakarta, for analysis and it could take up to a month to get a complete reading of the data. Officials did not provide details of the condition of the black boxes. "The download is easy, probably one day. But the reading is more difficult ... could take two weeks to one month," Siswosuwarno said. Over the weekend, three vessels detected "pings" that were believed to be from the black boxes, but strong winds, powerful currents and high waves hampered search efforts. Dozens of Indonesian navy divers took advantage of calmer weather in the Java Sea on Monday to retrieve the flight recorder and search for the fuselage of the Airbus A320-200. Forty-eight bodies have been retrieved from the Java Sea and searchers believe more will be found in the plane's fuselage. Relatives of the victims have urged authorities to make finding the remains of their loved ones the priority. "All the ships, including the ships from our friends, will be deployed with the main task of searching for bodies that are still or suspected to still be trapped underwater," Soelistyo said, referring the multinational force helping with the search and recovery effort. Indonesia AirAsia, 49 percent owned by the Malaysia-based AirAsia budget group, has come under pressure from authorities in Jakarta since the crash. The transport ministry has suspended the carrier's Surabaya-Singapore licence for flying on a Sunday, for which it did not have permission. However, the ministry has said this had no bearing on the crash of Flight QZ8501. President Joko Widodo said the crash exposed widespread problems in the management of air travel in Indonesia. Separately on Sunday, a DHC-6 Twin Otter operated by Indonesia's Trigana Air crashed on landing at Enarotali Airport in Paniai, Papua. Strong winds caused the aircraft to roll over, domestic news website Detik.com reported, with no injuries to the three crew members on board. The plane was not carrying any passengers. Friday, January 9, 2015 Bill Donohue knows who is responsible for the massacre at Charlie Hebdo — the cartoonists themselves. The outspoken Catholic League president put a post on his group’s website called “Muslims are Right to be Angry,” in which he blasted the French paper for “the vulgar manner in which Mohammed has been portrayed.” Donohue said he abhors the violence, but blasted Stephane Charbonnier, the slain editor of the paper, where 12 people were shot dead by terrorists Wednesday. “It is too bad that he didn’t understand the role he played in his tragic death . . . Had he not been so narcissistic, he may still be alive,” Donohue said. The New York-based Catholic activist — whose group is not part of the official church — also complained that Charlie Hebdo mocked Catholics. “[The paper has] a long and disgusting rec­ord of going way beyond the mere lampooning of public figures and this is especially true of their depictions of religious figures,” he said. “For example, they have shown nuns masturbating and popes wearing condoms.” Thursday, January 8, 2015 Malaysia's approach, themed 'Peace and Security through Moderation' which brought success to the country in securing the non-permanent member seat in the United Nations Security Council (UNSC), was a relevant concept for the international community to combat extremism, noted envoys. Malaysia, which won the seat in October last year, assumes the post from Jan 1, this year until 2016. French Ambassador to Malaysia, Christophe Penot said the approach, which he described as a "meaningful one", could help the world tackle issues and resolve conflicts. With such a specific approach, Malaysia could project itself as a leading example of a tolerant and progressive Islamic nation as it urged the nation to respect democracy and the rule of law, emphasising on education and mediation to resolve conflicts, he told BERNAMA. "Moderation could thus, be the cornerstone of a 'diplomacy of equilibrium'," he said, noting that the successful election was not a surprise as Malaysia was a very good candidate. Penot said as France - a permanent member of the UNSC - attached great importance to the Security Council and its central responsibility in maintaining global peace and international security, the two countries would work closely in eliminating threats that could lead to global destabilisation. He said Malaysia was already contributing to France's collective efforts by participating in the UN peacekeeping operation and by facilitating the Mindanao Peace Process between the Philippines and the Moro Islamic Liberation Front (MILF). "Therefore, collective efforts are necessary for these solutions to be effectively implemented on the ground," he said. Apart from France, the other UNSC permanent members are China, the United Kingdom, Russia and the US. China's envoy to Malaysia, Dr Huang Huikang said China greatly appreciated Malaysia's responsible attitude and relentless efforts to push for peace and moderation in the world. Malaysia's election to the UNSC epitomised that the country's principle-based foreign policy had been endorsed by the international community, and its role in the international arena was greatly expected. Huang said, as both countries embarked on its 'Diamond Age' of bilateral relations, he hoped the two nations would continue to support each other through mutual trust and sincere friendship as had been the case for the past four decades. United States Ambassador to Malaysia, Joseph Y. Yun said the UN Charter made it clear that candidates for membership on the Security Council should be contributors to the maintenance of international peace and security. It should support the UN's other purposes, including promoting universal respect for human rights, he said, adding that the US looked forward to future collaborations. "Our two countries share a history of collaboration on global issues and we look forward to working together in this arena to uphold these responsibilities and tackle the many global challenges we face," Yun told BERNAMA. A special aid of RM500 each will be given out to households badly affected by floods, said Tan Sri Muhyiddin Yassin. The Deputy Prime Minister said an estimated 82,000 households would benefit from the one-off aid payment, which would be given out as soon as possible. Muhyiddin said all affected victims had to first register with the authorities within a one-week timeframe. "The Cabinet has agreed to give out this special aid after taking into account the magnitude of the floods this year to lessen the people's burden. "The next-of-kin of 23 people who have lost their lives during the floods will also receive a payment of RM5,000 each," he said after chairing the Pahang floods co-ordination meeting at the district office here. Muhyiddin said other forms of aid include three-day food rations for those who have returned to their homes, cost of living allowances for those who lost their homes and seeking shelter with relatives and other assistance such as gas stoves, pillows and mattresses. Friday, January 2, 2015 Police will work with the Malaysian Communications and Multimedia Commission (MCMC) to find those responsible for spreading false information on the floods. Inspector-General of Police Tan Sri Khalid Abu Bakar said these people, whom he described as irresponsible, would be brought to justice. "They have caused anxiety in the people affected by the floods. I hope the people will not listen to these rumours but get authentic information from the relevant authorities," he said when visiting SK Peramu Jaya near here. One of the rumours spread over the social media was allegedly about the collapse of a flood relief centre. KLSE Crude Oil Save The Turtles PLEASE DONATE BLOOD We Are With You BE AN ORGAN DONOR Tegas, Adil dan Berhemah CYBER POLICE CERTIFIED Freedom with responsibility PLANT A TREE One big tree is the equivalent to 10 air conditioners Tolerating intolerance Intolerance is rampant at every level and in all age groups of the society, but it is more visible amongst the younger generation as our youth can be seen losing their altitude of patience over petty issues. We seriously need to think over it as what we are going to inculcate in them, which may help them seek success in future. Will it be tolerance or intolerance? By Samra Arshad International Conference "Expose War Crimes – Criminalise War" “Wars increasingly involve the killings of innocent people and are therefore, abhorrent and criminal. Killings in war are as criminal as the killings within societies in times of peace. Since killings in peace time are subject to the domestic law of crime, killings in war must likewise be subject to the international law of crimes. This should be so irrespective of whether these killings in war are authorised or permitted by domestic laws.”

Q: How to know which key a song is written in with the same key signature? How to know which key a song is written in with the same key signature ? For example, the C Lydian scale has the same key signature as G major (G Ionian) AND E (natural) minor (E Aeolian) which makes it pretty difficult. Sometimes you can tell if in the bass staff, there are chords in a specific key, for example C major: CEG - CEG. But this isn't always the case. So how do you do it? A: With no key sig, the piece could be in one of several keys. C maj., and A minor being the most likely. What clues are there? In Am, there will likely be some G# notes. However, it may also be using D Dorian, E Phrygian, F Lydian, G Mixolydian, or, unlikely, B Locrian. The melody would centre around the appropriate note, and would feel at rest on that note. For example if it was D Dorian, the last chord may well be D minor, and last note D. That apart, there's no way of telling - unless it's announced at the top! The accompanying chords will all come from the same set, with perhaps the additional E in Am, which is where the G# came from. Otherwise, it's usually academic.

Unique photo exhibition of ruined Polish and Ukrainian church opens near Lviv 2017/4/5 18:46:15 “The photos on exhibition are intended to raise the issue of destruction of sacred objects, according to Muzeynyy prostir.” LVIV, April 3, 2017 (UBO*) - On April 2, the Vynnyk Historical Regional Museum opened an exhibition of photographs by Polish writer, journalist and photo artist Piotr Durak, “On both sides of the Bug.” The exhibition includes about 60 photographs of destroyed churches in Poland and the Roman Catholic churches in Ukraine. The photos on exhibition are intended to raise the issue of destruction of sacred objects, according to Muzeynyy prostir. The exhibition is the result of numerous trips across Poland and Ukraine, during which the photographer managed to find to 58 neglected and abandoned churches in Poland and several dozen churches in Ukraine. They are divided by a symbolic border – the river Bug, along which Durak traveled by boat in 2012 from the source to the mouth. Piotr Durak is a Polish studies graduate and doctoral literary associate of Rzeszow University. He published two collections of poetry “Find oneself” (2006), Wind-breaking” (2008), as well as two novels, “Last Year” (2007, 2009), “Bicycle Diaries” (2011). He is also the author of the literary blog “Report from the fog.” In 2007, he received an honorary award of Andrzej and Brutus Strumski for the most interesting poetry debut of Subcarpathians. Now he is editor of the regional weekly “Korso” and teaches at the Graduate School of trading in Radom (branch in Mielec). He has enjoyed photography since 2008. Despite numerous proposals, he refuses to take part in photographic competitions. Among the others, he received a nomination for the award of the Local Press Association for the best picture in the media in 2014. He is fascinated by the complexity of drawing with light – he takes picture of abandoned mines, bunkers and dungeons in Europe. ### *The article above appears through courtesy of the Religious Information Service of Ukraine. Access RISU at http://risu.org.ua/en/index

This is terrible but I really wish mr.b. would get an away job for a while. He's been working or not working home more than a year now and I really want some serious solo time so I can for example spend two hours listening to music he doesn't like without him feeling ignored or distressed.

Q: How do I make an array of only Strings from a txt file with Strings and doubles? Heres the txt file: http://txt.do/5w3em I just need the Strings (EXCLUDING THE COMMENTED OUT ONES), the M's and B's, all on separate lines from the text file and none of the doubles. How do I make an array list to store them all? I tried this List<String> trainingDatasetStrings = new ArrayList<String>(); while(inFile.hasNextLine()){ String line = inFile.nextLine(); String[] words = line.split(","); for(int i = 11; i < words.length; i++) trainingDatasetStrings.add(words[i]); } But it wont help. A: Try this. List<String> result = Files.readAllLines(Paths.get(fileName)).stream() .filter(s -> !s.startsWith("//")) .flatMap(s -> Stream.of(s.split(","))) .filter(s -> !s.matches("\\d+(\\.\\d*)?")) .collect(Collectors.toList()); System.out.println(result);

Q: Why sifr text's swf takes more width than actual text? I think if we can match swf size with original text width's then rendering will be fast. A: The font-replacement flash generated by sIFR takes the same space as the replaced HTML element. So if for example the text you are replacing is inside of an h1 tag, sIFR will take up the whole space of that h1 element and not the space of the text inside of it. I guess the element that you are replacing has a width of 100%. You can set a border on it (style="border: solid 1px black;") so you can see the bounds of the element.

Arizona Rep. Gabrielle Giffords. Related Content TUCSON, Ariz. (AP) -- Rep. Gabrielle Giffords of Arizona was shot in the head Saturday, an aide was killed, and an unknown number of others were wounded when an assailant opened fire outside a grocery store as the Democratic lawmaker met with constituents, officials said. C.J. Karamargin, a spokesman for Giffords, said the congresswoman was in surgery as of 1 p.m. local time and that an unspecified number of Giffords staff members were injured in the shooting. Karamargin said he had no other information on the conditions of the injured or on the circumstances of the shooting. Congressional officials said an aide to the Democrat was killed, and unknown number of others were injured, including staffers to the lawmaker. Little was known about the shooter in the chaos after the rampage; one official said the attack was carried out with an automatic weapon. The officials who described the events did so on condition of anonymity, saying they were not permitted to comment publicly. "I am horrified by the senseless attack on Congresswoman Gabrielle Giffords and members of her staff," newly elected House Speaker John Boehner said. "An attack on one who serves is an attack on all who serve. Acts and threats of violence against public officials have no place in our society. Our prayers are with Congresswoman Giffords, her staff, all who were injured, and their families. This is a sad day for our country." Three hours after the shooting, the L-shaped shopping center in Tucson was blocked off by police and had fire trucks and other vehicles in its parking lot that blocked the view of the store's front door. No shell casing could be seen from the area 500 yards from the store where reporters and photographers were kept. Giffords, 40, was re-elected to her third term last November. She was a member of the Arizona House and Senate before coming to Washington. Giffords was first elected to Congress amid a wave of Democratic victories in the 2006 election, and she won a narrow victory against a tea party favorite in the 2010 election. The shooting comes amid a highly charged political environment that has seen several dangerous threats against lawmakers but nothing that reached the point of actual violence. A San Francisco man upset with House Speaker Nancy Pelosi's support of health care reform pleaded guilty to threatening the Democratic congresswoman and her family, calling her directly on March 25 and threatening to destroy her Northern California home if she voted for health care reform. In July, a California man known for his anger over left-leaning politics engaged in a shootout with highway patrol officers after planning an attack on the ACLU and another nonprofit group. The man said he wanted to "start a revolution" by killing people at the ACLU and the Tides Foundation. Giffords herself has drawn the ire of the right, especially for her support of the health care bill from politicians like Sarah Palin. Her Tucson office was vandalized a few hours after the House vote to approve the health care law in March, with someone either kicking or shooting out a glass door and window. Despite the animosity she has generated from the right, Giffords describes herself as a former Republican and current Blue Dog Democrat. "You know, actually as a former Republican, you know, I consider myself someone who is pretty in the middle, I'm a blue dog Democrat, and one that is interested in making sure that our country maintains our prosperity and frankly, our superiority over other countries and that's where we look at these threat, obviously our defense budget, our level of education," she said in an interview with Fox this week. --- AP Special Correspondent David Espo contributed to this report from Washington.

A number of substituted imidazo[4,5-b]quinolin-2-ones are known from BE-904,671; DE-A-3,717,291; U.S. Pat. No. 4,701,459 and U.S. Pat. No. 4,943,573 as phosphodiesterase and blood platelet aggregation inhibitors which are useful as inotropic cardiotonics and antithrombotics. In U.S. Pat. No. 5,043,327 which corresponds to EP-A-0,406,958, published Jan. 9, 1991, there are described positive inotropic and lusitropic 3,5-dihydro-imidazo[2,1-b]-quinazolin-2(1H)-one derivatives.

Q: Is Kylo Ren more force capable than Snoke? Kylo Ren used force to remotely turn and activate Luke's lightsaber and cut Snoke in halves. It has been stated over and over again, Snoke can read others' mind and feelings, how could Snoke not see Kylo's move? Is Kylo so force-capable that he could hide his true feelings from Snoke? A: Kylo Ren is a very strong force user. Luke says something to the effect to Rey: I wasn't frightened enough when I came across such power the first time We also see him perform other 'tricks' that have never been seen in Star Wars before, like stopping a blaster bolt in mid air for more than a minute. However I don't think we've seen what the powers of Snoke are, so cannot judge whether he or Kylo Ren are more capable. The key thing we see is that Kylo Ren disguises his feelings about what he is about to do. You can see Snoke (apparently) reading Kylo's mind - repeating out loud that he is turning the lightsabre and is about to kill his target. Kylo does this acting out turning the lightsabre in his hands as he stands in front of Rey, while turning the sabre to the side of Snoke with the Force. He is gambling that Snoke's attention is on what he is seeing in front of him. He is gambling that Snoke will assume the feelings he is reading relate to Rey's imminent death, and overlooks the possibility that his apprentice is planning to kill him. So its not that Kylo is so strong with the Force that he can disguise his thoughts completely. He uses his powers and misdirection to achieve his aims.

Q: How do I open some nice looking UberChests? Just started playing the game and I found some nice looking UberChests(tm). The problem is that I cannot open them, any idea? A: To open UberChests you have to find a lever somewhere in the dungeon, which would open the chest for you.

Hypoxia/reoxygenation stimulates intracellular calcium oscillations in human aortic endothelial cells. We have previously shown that hydrogen peroxide stimulates endothelial [Ca(2+)](i) oscillations. This study was performed to determine whether posthypoxic reoxygenation stimulates [Ca(2+)](i) oscillations in vascular endothelial cells. Hypoxia (glucose-free 95% N(2)/5% CO(2) bicarbonate buffer for 60 minutes) stimulated an increase in [Ca(2+)](i) from 111.9+/-7. 9 to 161.7+/-17.7 nmol/L (n=12, P:<0.01) in indo 1-loaded human aortic endothelial cells. On reoxygenation (glucose-containing 95% air/5% CO(2) bicarbonate buffer), 13 of 16 cells responded with repetitive [Ca(2+)](i) oscillations with an average amplitude of 570. 6+/-59.3 nmol/L, occurring at a mean interval of 0.28+/-0.04/min and persisting for >/=60 minutes. [Ca(2+)](i) oscillations were still observed in 4 of 7 cells studied in Ca(2+)-free buffer but did not occur when the intracellular Ca(2+) store was first depleted during hypoxia by either 1 micromol/L thapsigargin or by 10 mmol/L caffeine (n=6 for each). Reoxygenation-induced [Ca(2+)](i) oscillations were abolished by 10 micromol/L diphenyleneiodonium, an inhibitor of NAD(P)H oxidase (n=7), and by polyethylene glycol (PEG)-catalase (5000 U/mL, n=4) but were not prevented by inhibitors of xanthine oxidase (n=5), cyclooxygenase (n=4), nitric oxide synthase (n=5), the mitochondrial electron transport chain (n=4), or by PEG-superoxide dismutase (n=5). Posthypoxic reoxygenation stimulates repetitive [Ca(2+)](i) oscillations that are dependent on Ca(2+) release from an intracellular pool and require extracellular Ca(2+) to be maintained. These oscillations may be initiated by NAD(P)H oxidase-derived hydrogen peroxide and may play a role in signal transduction during ischemia/reperfusion in vivo.

/* Generated by RuntimeBrowser Image: /System/Library/PrivateFrameworks/AnnotationKit.framework/AnnotationKit */ @interface AKAnnotationImageHelper : NSObject + (void)_drawFilledShapeImageForAnnotation:(id)arg1 inRect:(struct CGRect { struct CGPoint { double x_1_1_1; double x_1_1_2; } x1; struct CGSize { double x_2_1_1; double x_2_1_2; } x2; })arg2 inContext:(struct CGContext { }*)arg3; + (void)_drawImageForPath:(id)arg1 inRect:(struct CGRect { struct CGPoint { double x_1_1_1; double x_1_1_2; } x1; struct CGSize { double x_2_1_1; double x_2_1_2; } x2; })arg2 inContext:(struct CGContext { }*)arg3; + (void)_drawImageForSignature:(id)arg1 withFillColor:(id)arg2 scale:(double)arg3 pathOffset:(struct CGPoint { double x1; double x2; })arg4 inContext:(struct CGContext { }*)arg5; + (struct CGImage { }*)createImageOfAnnotation:(id)arg1 withScale:(double)arg2; + (id)imageForShapeTag:(long long)arg1; + (id)imageOfSize:(struct CGSize { double x1; double x2; })arg1 forAnnotation:(id)arg2; + (id)imageOfSize:(struct CGSize { double x1; double x2; })arg1 forPath:(id)arg2; + (id)imageOfSize:(struct CGSize { double x1; double x2; })arg1 withFillColor:(id)arg2 forSignature:(id)arg3; @end

Finger Wrigglers Finger Wigglers is an album by bassist Michael Bisio and multi-instrumentalist and composer Joe McPhee recorded in 1996 and first released on the CIMP label. Reception Allmusic reviewer Scott Yanow states "This set will not convert listeners strictly into straight-ahead jazz, but it is a fine all-round outing for McPhee and the supportive bassist Bisio". Track listing All compositions by Joe McPhee except as indicated "Lonely Woman" (Ornette Coleman) - 11:00 "Blue Monk" (Thelonious Monk) - 6:53 "Here's That Rainy Day" (Jimmy Van Heusen, Johnny Burke) - 8:38 "Running Out of Time" - 4:17 "Malachi" - 5:46 "Going Home" (Traditional) - 6:20 "Walking Out" (Michael Bisio) - 8:44 "Lonely Woman" [Take 2] (Coleman) - 8:34 Personnel Joe McPhee - tenor saxophone Michael Bisio - bass References Category:Joe McPhee albums Category:Michael Bisio albums Category:1997 albums Category:CIMP albums

(i) Technical Field The present invention relates to an image processing apparatus, an image processing method, an image processing system, and a non-transitory computer readable medium. (ii) Related Art In image processing, users segment designated regions that they designate as regions to be subjected to image processing.

Q: Не создается папка при первом запуске в мобильном приложении Всем привет! Такая проблема, при первом запуски приложения не создается фолдер, если его перезапустить - фолдер создаётся. Если до первого запуска дать разрешение на хранилище - папке создается. Для получения разрешения юзаю TedPermission (стандартным методом тоже пробовал) Мой код: ... private static String FOLDER = "NewFolder"; protected void onCreate(Bundle savedInstanceState) { super.onCreate(savedInstanceState); setContentView(R.layout.activity_main); PermissionListener permissionlistener = new PermissionListener() { @Override public void onPermissionGranted() {} @Override public void onPermissionDenied(List<String> deniedPermissions) {} }; TedPermission.with(this) .setPermissionListener(permissionlistener) .setPermissions(Manifest.permission.READ_EXTERNAL_STORAGE, Manifest.permission.WRITE_EXTERNAL_STORAGE) .check(); createFolder(); // создаем папку ... } private File createFolder() { File folder = new File(Environment.getExternalStorageDirectory(), FOLDER); if (folder.exists()) return folder; if (folder.isFile()) folder.delete(); if (folder.mkdirs()) return folder; Environment.getExternalStorageDirectory(); return folder;} Разрешения на хранилище он получает, но папку создает только после 2 запуска. Пробовал еще такие варианты как: File nfile=new File(Environment.getExternalStorageDirectory()+"/NewFolder"); nfile.mkdir(); и if (!Environment.getExternalStorageState().equals(Environment.MEDIA_MOUNTED)){ Log.d("MyApp", "No SDCARD"); } else { File directory = new File(Environment.getExternalStorageDirectory()+File.separator+"NewFolder"); directory.mkdirs(); } В манифесте тоже все объявлено <?xml version="1.0" encoding="utf-8"?> <manifest xmlns:android="http://schemas.android.com/apk/res/android" xmlns:tools="http://schemas.android.com/tools" package="ru.asd.dsa"> <uses-permission android:name="android.permission.READ_EXTERNAL_STORAGE" /> <uses-permission android:name="android.permission.WRITE_EXTERNAL_STORAGE" /> A: Ну все правильно. Запрос на предоставление разрешения на запись он не блокирующий (асинхронный), то есть вы вешаете запрос на предоставление разрешения и сразу же "проваливаетесь" в createFolder(), который естественно благополучно проваливается, поскольку разрешение еще не granted Вам надо "посадить" createFolder() на ветку PermissionListener.onPermissionGranted()

1. Field of the Invention The invention relates generally to pomegranate extracts and methods of using thereof, and specifically to methods of using pomegranate extracts for causing regression in lesions due to arteriosclerosis in humans. 2. Description of the Related Art Throughout this application, various references are referred to within parentheses. Disclosures of these publications in their entireties are hereby incorporated by reference into this application to more fully describe the state of the art to which this invention pertains. Full bibliographic citation for these references may be found at the end of this application, preceding the claims. Oxidative stress, a major contributor to cardiovascular diseases (1), is associated with lipid peroxidation in arterial macrophages and in lipoproteins (1-3). Oxidized low-density lipoprotein (Ox-LDL) was shown to be atherogenic (2-4), thus, interventions to inhibit LDL oxidation by dietary antioxidants (4, 5) is of major importance to attenuate atherosclerosis. It was recently shown that vitamin E supplementation to patients with carotid artery stenosis inhibited LDL accumulation in arterial macrophages (6). Protection of lipids from oxidation can be also achieved by serum paraoxonase (PON1), an HDL-associated esterase that can hydrolyze and reduce specific lipid peroxides in arterial cells and lipoproteins in coronary and carotid lesions (7-10). The pomegranate was recently chosen as the logo for the Millennium Festival of Medicine, mainly because of its medicinal properties as described by all major religions and by folk medicine (11). Pomegranate juice (PJ) possesses impressive antioxidative properties due to its high flavonoids content, mainly the water soluble tannins and proanthocyanins (12). We have recently shown the antioxidative and antiatherogenic characteristics of PJ consumption in atherosclerotic apolipoprotein E deficient (E°) mice (13). In healthy humans, PJ consumption also demonstrated potent antioxidative capabilities against lipoprotein oxidation, and also increased PON1 activity and improved serum total antioxidant status (13). A need exists, however, to study whether the above beneficial effects of PJ can be manifested in patients with atherosclerosis such as carotid artery stenosis.

/*******************************************************************\ Module: Author: Daniel Kroening, [email protected] \*******************************************************************/ #include "c_preprocess.h" #include <util/c_types.h> #include <util/config.h> #include <util/prefix.h> #include <util/run.h> #include <util/suffix.h> #include <util/tempfile.h> #include <util/unicode.h> #include <fstream> /// quote a string for bash and CMD static std::string shell_quote(const std::string &src) { #ifdef _WIN32 // first check if quoting is needed at all if(src.find(' ')==std::string::npos && src.find('"')==std::string::npos && src.find('&')==std::string::npos && src.find('|')==std::string::npos && src.find('(')==std::string::npos && src.find(')')==std::string::npos && src.find('<')==std::string::npos && src.find('>')==std::string::npos && src.find('^')==std::string::npos) { // seems fine -- return as is return src; } std::string result; result+='"'; for(const char ch : src) { if(ch=='"') result+='"'; // quotes are doubled result+=ch; } result+='"'; return result; #else // first check if quoting is needed at all if(src.find(' ')==std::string::npos && src.find('"')==std::string::npos && src.find('*')==std::string::npos && src.find('$')==std::string::npos && src.find('\\')==std::string::npos && src.find('?')==std::string::npos && src.find('&')==std::string::npos && src.find('|')==std::string::npos && src.find('>')==std::string::npos && src.find('<')==std::string::npos && src.find('^')==std::string::npos && src.find('\'')==std::string::npos) { // seems fine -- return as is return src; } std::string result; // the single quotes catch everything but themselves! result+='\''; for(const char ch : src) { if(ch=='\'') result+="'\\''"; result+=ch; } result+='\''; return result; #endif } static void error_parse_line( const std::string &line, bool warning_only, messaget &message) { std::string error_msg=line; source_locationt saved_error_location; if(has_prefix(line, "file ")) { const char *tptr=line.c_str(); int state=0; std::string file, line_no, column, _error_msg, function; tptr+=5; char previous=0; while(*tptr!=0) { if(has_prefix(tptr, " line ") && state != 4) { state=1; tptr+=6; continue; } else if(has_prefix(tptr, " column ") && state != 4) { state=2; tptr+=8; continue; } else if(has_prefix(tptr, " function ") && state != 4) { state=3; tptr+=10; continue; } else if(*tptr==':' && state!=4) { if(tptr[1]==' ' && previous!=':') { state=4; tptr++; while(*tptr==' ') tptr++; continue; } } if(state==0) // file file+=*tptr; else if(state==1) // line number line_no+=*tptr; else if(state==2) // column column+=*tptr; else if(state==3) // function function+=*tptr; else if(state==4) // error message _error_msg+=*tptr; previous=*tptr; tptr++; } if(state==4) { saved_error_location.set_file(file); saved_error_location.set_function(function); saved_error_location.set_line(line_no); saved_error_location.set_column(column); error_msg=_error_msg; } } else if(has_prefix(line, "In file included from ")) { } else { const char *tptr=line.c_str(); int state=0; std::string file, line_no; while(*tptr!=0) { if(state==0) { if(*tptr==':') state++; else file+=*tptr; } else if(state==1) { if(*tptr==':') state++; else if(isdigit(*tptr)) line_no+=*tptr; else state=3; } tptr++; } if(state==2) { saved_error_location.set_file(file); saved_error_location.set_function(irep_idt()); saved_error_location.set_line(line_no); saved_error_location.set_column(irep_idt()); } } messaget::mstreamt &m= warning_only ? message.warning() : message.error(); m.source_location=saved_error_location; m << error_msg << messaget::eom; } static void error_parse( std::istream &errors, bool warning_only, messaget &message) { std::string line; while(std::getline(errors, line)) error_parse_line(line, warning_only, message); } /// ANSI-C preprocessing bool c_preprocess( std::istream &instream, std::ostream &outstream, message_handlert &message_handler) { temporary_filet tmp_file("tmp.stdin", ".c"); std::ofstream tmp(tmp_file()); if(!tmp) { messaget message(message_handler); message.error() << "failed to open temporary file" << messaget::eom; return true; // error } tmp << instream.rdbuf(); // copy tmp.close(); // flush bool result=c_preprocess(tmp_file(), outstream, message_handler); return result; } /// ANSI-C preprocessing static bool is_dot_i_file(const std::string &path) { return has_suffix(path, ".i") || has_suffix(path, ".ii"); } /// ANSI-C preprocessing bool c_preprocess_codewarrior( const std::string &, std::ostream &, message_handlert &); bool c_preprocess_arm( const std::string &, std::ostream &, message_handlert &); bool c_preprocess_gcc_clang( const std::string &, std::ostream &, message_handlert &, configt::ansi_ct::preprocessort); bool c_preprocess_none( const std::string &, std::ostream &, message_handlert &); bool c_preprocess_visual_studio( const std::string &, std::ostream &, message_handlert &); bool c_preprocess( const std::string &path, std::ostream &outstream, message_handlert &message_handler) { switch(config.ansi_c.preprocessor) { case configt::ansi_ct::preprocessort::CODEWARRIOR: return c_preprocess_codewarrior(path, outstream, message_handler); case configt::ansi_ct::preprocessort::GCC: return c_preprocess_gcc_clang( path, outstream, message_handler, config.ansi_c.preprocessor); case configt::ansi_ct::preprocessort::CLANG: return c_preprocess_gcc_clang( path, outstream, message_handler, config.ansi_c.preprocessor); case configt::ansi_ct::preprocessort::VISUAL_STUDIO: return c_preprocess_visual_studio(path, outstream, message_handler); case configt::ansi_ct::preprocessort::ARM: return c_preprocess_arm(path, outstream, message_handler); case configt::ansi_ct::preprocessort::NONE: return c_preprocess_none(path, outstream, message_handler); } // not reached return true; } /// ANSI-C preprocessing bool c_preprocess_visual_studio( const std::string &file, std::ostream &outstream, message_handlert &message_handler) { // check extension if(is_dot_i_file(file)) return c_preprocess_none(file, outstream, message_handler); messaget message(message_handler); // use Visual Studio's CL temporary_filet stderr_file("tmp.stderr", ""); temporary_filet command_file_name("tmp.cl-cmd", ""); { std::ofstream command_file(command_file_name()); // This marks the command file as UTF-8, which Visual Studio // understands. command_file << char(0xef) << char(0xbb) << char(0xbf); command_file << "/nologo" << '\n'; command_file << "/E" << '\n'; // This option will make CL produce utf-8 output, as // opposed to 8-bit with some code page. // It only works on Visual Studio 2015 or newer. command_file << "/source-charset:utf-8" << '\n'; command_file << "/D__CPROVER__" << "\n"; command_file << "/D__WORDSIZE=" << config.ansi_c.pointer_width << "\n"; if(pointer_diff_type()==signed_long_long_int_type()) { command_file << "\"/D__PTRDIFF_TYPE__=long long int\"" << "\n"; // yes, both _WIN32 and _WIN64 get defined command_file << "/D_WIN64" << "\n"; } else if(config.ansi_c.int_width == 16 && config.ansi_c.pointer_width == 32) { // 16-bit LP32 is an artificial architecture we simulate when using --16 DATA_INVARIANT( pointer_diff_type() == signed_long_int_type(), "Pointer difference expected to be long int typed"); command_file << "/D__PTRDIFF_TYPE__=long" << '\n'; } else { DATA_INVARIANT( pointer_diff_type()==signed_int_type(), "Pointer difference expected to be int typed"); command_file << "/D__PTRDIFF_TYPE__=int" << "\n"; } if(config.ansi_c.char_is_unsigned) command_file << "/J" << "\n"; // This causes _CHAR_UNSIGNED to be defined for(const auto &define : config.ansi_c.defines) command_file << "/D" << shell_quote(define) << "\n"; for(const auto &include_path : config.ansi_c.include_paths) command_file << "/I" << shell_quote(include_path) << "\n"; for(const auto &include_file : config.ansi_c.include_files) command_file << "/FI" << shell_quote(include_file) << "\n"; // Finally, the file to be preprocessed // (this is already in UTF-8). command_file << shell_quote(file) << "\n"; } temporary_filet tmpi("tmp.cl", ""); std::string command = "CL @\"" + command_file_name() + "\""; command += " 2> \"" + stderr_file() + "\""; // _popen isn't very reliable on WIN32 // that's why we use run() int result = run("cl", {"cl", "@" + command_file_name()}, "", outstream, stderr_file()); // errors/warnings std::ifstream stderr_stream(stderr_file()); error_parse(stderr_stream, result==0, message); if(result!=0) { message.error() << "CL Preprocessing failed" << messaget::eom; return true; } return false; } /// post-processing specifically for CodeWarrior void postprocess_codewarrior( std::istream &instream, std::ostream &outstream) { // CodeWarrior prepends some header to the file, // marked with '#' signs. // We skip over it. // // CodeWarrior has an ugly way of marking lines, e.g.: // // /* #line 1 "__ppc_eabi_init.cpp" /* stack depth 0 */ // // We remove the initial '/* ' prefix std::string line; while(instream) { std::getline(instream, line); if(line.size()>=2 && line[0]=='#' && (line[1]=='#' || line[1]==' ' || line[1]=='\t')) { // skip the line! } else if(line.size()>=3 && line[0]=='/' && line[1]=='*' && line[2]==' ') { outstream << line.c_str()+3 << "\n"; // strip the '/* ' } else outstream << line << "\n"; } } /// ANSI-C preprocessing bool c_preprocess_codewarrior( const std::string &file, std::ostream &outstream, message_handlert &message_handler) { // check extension if(is_dot_i_file(file)) return c_preprocess_none(file, outstream, message_handler); // preprocessing messaget message(message_handler); temporary_filet stderr_file("tmp.stderr", ""); std::vector<std::string> command = { "mwcceppc", "-E", "-P", "-D__CPROVER__", "-ppopt", "line", "-ppopt full"}; for(const auto &define : config.ansi_c.defines) command.push_back(" -D" + define); for(const auto &include_path : config.ansi_c.include_paths) command.push_back(" -I" + include_path); for(const auto &include_file : config.ansi_c.include_files) { command.push_back(" -include"); command.push_back(include_file); } for(const auto &opt : config.ansi_c.preprocessor_options) command.push_back(opt); temporary_filet tmpi("tmp.cl", ""); command.push_back(file); command.push_back("-o"); command.push_back(tmpi()); int result = run(command[0], command, "", "", stderr_file()); std::ifstream stream_i(tmpi()); if(stream_i) { postprocess_codewarrior(stream_i, outstream); stream_i.close(); } else { message.error() << "Preprocessing failed (fopen failed)" << messaget::eom; return true; } // errors/warnings std::ifstream stderr_stream(stderr_file()); error_parse(stderr_stream, result==0, message); if(result!=0) { message.error() << "Preprocessing failed" << messaget::eom; return true; } return false; } /// ANSI-C preprocessing bool c_preprocess_gcc_clang( const std::string &file, std::ostream &outstream, message_handlert &message_handler, configt::ansi_ct::preprocessort preprocessor) { // check extension if(is_dot_i_file(file)) return c_preprocess_none(file, outstream, message_handler); // preprocessing messaget message(message_handler); temporary_filet stderr_file("tmp.stderr", ""); std::vector<std::string> argv; if(preprocessor==configt::ansi_ct::preprocessort::CLANG) argv.push_back("clang"); else argv.push_back("gcc"); argv.push_back("-E"); argv.push_back("-D__CPROVER__"); const irep_idt &arch = config.ansi_c.arch; if(config.ansi_c.pointer_width == 16) { if(arch == "i386" || arch == "x86_64" || arch == "x32") argv.push_back("-m16"); else if(has_prefix(id2string(arch), "mips")) argv.push_back("-mips16"); } else if(config.ansi_c.pointer_width == 32) { if(arch == "i386" || arch == "x86_64") argv.push_back("-m32"); else if(arch == "x32") argv.push_back("-mx32"); else if(has_prefix(id2string(arch), "mips")) argv.push_back("-mabi=32"); else if(arch == "powerpc" || arch == "ppc64" || arch == "ppc64le") argv.push_back("-m32"); else if(arch == "s390" || arch == "s390x") argv.push_back("-m31"); // yes, 31, not 32! else if(arch == "sparc" || arch == "sparc64") argv.push_back("-m32"); } else if(config.ansi_c.pointer_width == 64) { if(arch == "i386" || arch == "x86_64" || arch == "x32") argv.push_back("-m64"); else if(has_prefix(id2string(arch), "mips")) argv.push_back("-mabi=64"); else if(arch == "powerpc" || arch == "ppc64" || arch == "ppc64le") argv.push_back("-m64"); else if(arch == "s390" || arch == "s390x") argv.push_back("-m64"); else if(arch == "sparc" || arch == "sparc64") argv.push_back("-m64"); } // The width of wchar_t depends on the OS! if(config.ansi_c.wchar_t_width == config.ansi_c.short_int_width) argv.push_back("-fshort-wchar"); if(config.ansi_c.char_is_unsigned) argv.push_back("-funsigned-char"); if(config.ansi_c.os == configt::ansi_ct::ost::NO_OS) argv.push_back("-nostdinc"); // Set the standard if( has_suffix(file, ".cpp") || has_suffix(file, ".CPP") || #ifndef _WIN32 has_suffix(file, ".C") || #endif has_suffix(file, ".c++") || has_suffix(file, ".C++") || has_suffix(file, ".cp") || has_suffix(file, ".CP") || has_suffix(file, ".cc") || has_suffix(file, ".cxx")) { switch(config.cpp.cpp_standard) { case configt::cppt::cpp_standardt::CPP98: #if defined(__OpenBSD__) if(preprocessor == configt::ansi_ct::preprocessort::CLANG) argv.push_back("-std=c++98"); else #endif argv.push_back("-std=gnu++98"); break; case configt::cppt::cpp_standardt::CPP03: #if defined(__OpenBSD__) if(preprocessor == configt::ansi_ct::preprocessort::CLANG) argv.push_back("-std=c++03"); else #endif argv.push_back("-std=gnu++03"); break; case configt::cppt::cpp_standardt::CPP11: #if defined(__OpenBSD__) if(preprocessor == configt::ansi_ct::preprocessort::CLANG) argv.push_back("-std=c++11"); else #endif argv.push_back("-std=gnu++11"); break; case configt::cppt::cpp_standardt::CPP14: #if defined(__OpenBSD__) if(preprocessor == configt::ansi_ct::preprocessort::CLANG) argv.push_back("-std=c++14"); else #endif argv.push_back("-std=gnu++14"); break; } } else { switch(config.ansi_c.c_standard) { case configt::ansi_ct::c_standardt::C89: #if defined(__OpenBSD__) if(preprocessor == configt::ansi_ct::preprocessort::CLANG) argv.push_back("-std=c89"); else #endif argv.push_back("-std=gnu89"); break; case configt::ansi_ct::c_standardt::C99: #if defined(__OpenBSD__) if(preprocessor == configt::ansi_ct::preprocessort::CLANG) argv.push_back("-std=c99"); else #endif argv.push_back("-std=gnu99"); break; case configt::ansi_ct::c_standardt::C11: #if defined(__OpenBSD__) if(preprocessor == configt::ansi_ct::preprocessort::CLANG) argv.push_back("-std=c11"); else #endif argv.push_back("-std=gnu11"); break; } } for(const auto &define : config.ansi_c.defines) argv.push_back("-D" + define); for(const auto &include_path : config.ansi_c.include_paths) argv.push_back("-I" + include_path); for(const auto &include_file : config.ansi_c.include_files) { argv.push_back("-include"); argv.push_back(include_file); } for(const auto &opt : config.ansi_c.preprocessor_options) argv.push_back(opt); int result; #if 0 // the following forces the mode switch(config.ansi_c.mode) { case configt::ansi_ct::flavourt::GCC_C: command+=" -x c"; break; case configt::ansi_ct::flavourt::GCC_CPP: command+=" -x c++"; break; default: { } } #endif // the file that is to be preprocessed argv.push_back(file); // execute clang or gcc result = run(argv[0], argv, "", outstream, stderr_file()); // errors/warnings std::ifstream stderr_stream(stderr_file()); error_parse(stderr_stream, result==0, message); if(result!=0) { message.error() << "GCC preprocessing failed" << messaget::eom; return true; } return false; } /// ANSI-C preprocessing bool c_preprocess_arm( const std::string &file, std::ostream &outstream, message_handlert &message_handler) { // check extension if(is_dot_i_file(file)) return c_preprocess_none(file, outstream, message_handler); // preprocessing using armcc messaget message(message_handler); temporary_filet stderr_file("tmp.stderr", ""); std::vector<std::string> argv; argv.push_back("armcc"); argv.push_back("-E"); argv.push_back("-D__CPROVER__"); if(config.ansi_c.endianness == configt::ansi_ct::endiannesst::IS_BIG_ENDIAN) argv.push_back("--bigend"); else argv.push_back("--littleend"); if(config.ansi_c.char_is_unsigned) argv.push_back("--unsigned_chars"); else argv.push_back("--signed_chars"); // Set the standard switch(config.ansi_c.c_standard) { case configt::ansi_ct::c_standardt::C89: argv.push_back("--c90"); break; case configt::ansi_ct::c_standardt::C99: case configt::ansi_ct::c_standardt::C11: argv.push_back("--c99"); break; } for(const auto &define : config.ansi_c.defines) argv.push_back("-D" + define); for(const auto &include_path : config.ansi_c.include_paths) argv.push_back("-I" + include_path); // the file that is to be preprocessed argv.push_back(file); int result; // execute armcc result = run(argv[0], argv, "", outstream, stderr_file()); // errors/warnings std::ifstream stderr_stream(stderr_file()); error_parse(stderr_stream, result==0, message); if(result!=0) { message.error() << "ARMCC preprocessing failed" << messaget::eom; return true; } return false; } /// ANSI-C preprocessing bool c_preprocess_none( const std::string &file, std::ostream &outstream, message_handlert &message_handler) { #ifdef _MSC_VER std::ifstream infile(widen(file)); #else std::ifstream infile(file); #endif if(!infile) { messaget message(message_handler); message.error() << "failed to open '" << file << "'" << messaget::eom; return true; } if(config.ansi_c.mode==configt::ansi_ct::flavourt::CODEWARRIOR) { // special treatment for "/* #line" postprocess_codewarrior(infile, outstream); } else { char ch; while(infile.read(&ch, 1)) outstream << ch; } return false; } /// tests ANSI-C preprocessing const char c_test_program[]= "#include <stdlib.h>\n" "\n" "int main() { }\n"; bool test_c_preprocessor(message_handlert &message_handler) { std::ostringstream out; std::istringstream in(c_test_program); return c_preprocess(in, out, message_handler); }

Q: HTML Button in iFrame does not work properly on iPad I have a web application in which I have a div element with an onclick javascript action. This web application works fine on iPads and desktops alike. When it is launched within an iFrame on an iPad, however, all of the sudden, my clicks/taps are rarely and inconsistently acted upon. When running in an iFrame on a desktop browser, I do not see this behavior. Has anyone seen this type of behavior before? A: I'm not sure about your exact situation, but I was having a similar problem when my botton had a "mouseenter" event trigger binded to it. The mouse enter would be called on the first "tap" and the button would be called on the "second". Because of the way ipad uses those two events. My solution was to use the browser detection tool from http://detectmobilebrowsers.com/ and set a var ismolible = to true or false, depending on whether the browser was mobile or not, then I used an if statement to unbind my mouseenter immediately if the browser was mobile. You do have to modify the http://detectmobilebrowsers.com/ code for ipad. Hope this helps!

# Warning flags for C and C++: COMMON_FLAGS += -Wall -Wextra -pedantic -Werror COMMON_FLAGS += -Wmissing-declarations -g #COMMON_FLAGS += -Weverything CFLAGS += ${COMMON_FLAGS} CPPFLAGS += ${COMMON_FLAGS} # These warnings are not valid for C++: CFLAGS += -Wmissing-prototypes CFLAGS += -Wstrict-prototypes PROGRAMS_C= example example_no_suite example_no_runner \ example_shuffle example_trunc PROGRAMS_CPP= example_cpp # Uncomment to demo c99 parametric testing. #CFLAGS += -std=c99 # Uncomment to disable setjmp()/longjmp(). #CFLAGS += -DGREATEST_USE_LONGJMP=0 # Uncomment to disable clock() / time.h. #CFLAGS += -DGREATEST_USE_TIME=0 all: all_c all_c: ${PROGRAMS_C} all_cpp: ${PROGRAMS_CPP} example: example.o example_suite.o example_no_suite: example_no_suite.o example_no_runner: example_no_runner.o example_shuffle: example_shuffle.o example_cpp: example_cpp.cpp ${CXX} -o $@ example_cpp.cpp ${CPPFLAGS} ${LDFLAGS} %.o: %.c ${CC} -c -o $@ ${CFLAGS} $< %: %.o ${CC} -o $@ ${LDFLAGS} $^ *.o: Makefile *.o: greatest.h clean: rm -f ${PROGRAMS_C} ${PROGRAMS_CPP} *.o *.core

Nigel Forman Francis Nigel Forman (25 March 1943 – 11 May 2017), known as Nigel Forman, was a British Conservative politician. After working in the Conservative Research Department from 1968 to 1976 he was elected as an MP. He became a prominent backbench MP and was appointed to the position of Minister of Higher Education in April 1992. In December 1992 he resigned from this post "for personal reasons". He lost his seat in Parliament in the 1997 general election and subsequently worked as a lecturer, writer and instructor. He was married to Susan Forman in 1971 and the couple had no children. Early career Forman was born in Simla, India where his father served as a brigadier in the Indian Army. Forman was educated at the Dragon School and Shrewsbury School, then afterwards went to New College, Oxford, College of Europe (Bruges), Harvard University and Sussex University. He obtained various degrees from these institutions including a Master of Public Administration from Harvard, a Certificate of Advanced European Studies (equivalent to a master's degree) from the College of Europe (class of 1965-1966) and a Ph.D from Sussex University. In his Times obituary he was described as "something of a perpetual student". His first significant job was from 1967 to 1968 as an information officer at the Confederation of British Industry. In 1968 he joined the Conservative Research Department ('CRD' - the research operation of the Conservative Party) and began the quest to find himself a seat in Parliament. He progressed rapidly in the CRD, acting as ‘external affairs adviser’ to Edward Heath while the latter was leader of the opposition. He served Margaret Thatcher in the same capacity from 1975 to 1976. He achieved the rank of assistant director with special responsibility for European affairs, He contested the Coventry North East constituency for the Conservatives in the February 1974 general election but was not elected. After the elevation of Robert Carr MP to the peerage in 1976, Forman was adopted as the Conservative candidate for the parliamentary seat (Carshalton) that Carr was vacating. Backbench MP, 1976 to 1992 Forman was elected to the House of Commons as Member of Parliament (MP) for Sutton, Carshalton at a by-election on 11 March 1976. He took the seat with a 10,000 majority over Labour, compared with Carr’s 4,000 majority in October 1974. When constituency boundaries were revised for the 1983 election, his seat was renamed Carshalton and Wallington. His Carshalton parliamentary seat was part of the London Borough of Sutton and was very mixed in character. It contained large estates of Council housing and areas with expensive detached houses. All three major parties (Conservative, Labour and Liberal) had significant support in the seat and Forman’s position was therefore always potentially vulnerable to tactical voting. His constituency Conservative party and the Conservative leaders of Sutton Borough Council soon showed themselves to be resistant to concepts of modernisation that Forman sought to promote. Sutton was one of the few remaining councils in the UK that had retained selective education and council meetings were unusual in that Conservative councillors wore ceremonial robes in order to "give dignity" to the proceedings. Forman soon established himself as a bright and enthusiastic MP. During his first three months in the House he asked 64 formal questions of Ministers in the Labour government. His particular areas of interest were nuclear power, incomes policy, education policy and ministerial patronage. After the Conservatives returned to government in 1979, it was widely expected that Forman would soon obtain ministerial office. He served as Parliamentary Private Secretary (PPS) first to Lord Carrington in the Foreign Office and later to Douglas Hurd in the Home Office. However, promotion beyond that was slow in coming. Forman soon became known as a left-wing Conservative MP who differed with the policy of the Thatcher government on a number of key issues. In 1980 he spoke in favour of substantially increasing child benefits, he opposed reduction in the time limit for abortions, opposed capital punishment and spoke in favour of James Prior’s attempt to secure compulsory ballots in trade union votes through voluntary agreement with unions. He also expressed alarm at the manner in which unemployment was spiralling upwards as a result of the government’s economic policies. He frequently used the code word "one nation" in his speeches and writings – indicating disapproval of government policies which were perceived to be divisive. He favoured closer integration of Britain with the European Union. In February 1981, Labour MPs cheered him in the House when he asked Chancellor Howe to act in order to halt the rise in unemployment. Forman advocated employment and economic policies which were broadly consistent with those pursued by the previous Labour government. He acquired the image of being a Conservative opponent of Thatcherism. All this raised his profile in the House but it did not enhance his promotion prospects. In a 1983 Times article, the senior Labour MP Gerald Kaufman noted that Forman had been overlooked for promotion and that his obvious abilities were not being used. In 1984 Forman stood for the Chairmanship of the Conservative backbench finance committee as a left-wing "one nation" Tory – against incumbent right-winger Sir William Clark. Forman lost but had become clearly identified with "wets" and the one-nation group of Conservative MPs. In 1985, Forman published a pamphlet titled “Work to be done : employment policy for 1985 and beyond”. This was deeply critical of current government policy and advocated a package of measures to stimulate employment. Forman’s progressive views did not endear him to the leadership of his constituency Conservatives in Carshalton. Many of them regarded him as disloyal to Margaret Thatcher and a traitor. There were repeated attempts to deselect him. Matters came to a head in 1986 after the Liberal SDP Alliance took control of Sutton Borough Council from the Conservatives. Forman publicly attributed this to the shortcomings of the local Conservative leadership. The matter is described in the following extract from an article in the Times dated 21 May 1987:“The Carshalton Conservative Association suffers from bigots and zealots who indulge in internecine warfare. Not Labour smear tactics, nor Alliance innuendo, but the words of its Conservative MP, Mr Nigel Forman. Several attempts to deselect Mr Forman failed. But when the election was called last week, five of the seven senior officers took their revenge on the beleaguered MP by resigning.” – The Times, May 1987. However, Forman comfortably held his seat in the 1987 general election. His radical image tended to prevent Labour and Liberal supporters indulging in tactical voting (that is, jointly backing his strongest opponent) in order to turn him out. Forman appeared to be more popular in Carshalton than was the local Conservative party and his political fortunes seemed to be in the ascendant.“Has Chancellor Nigel Lawson gone soft? Yesterday he appointed as his PPS a Tory so wet he drips. As recently as last year, Nigel Forman, vice-chairman of the party's backbench finance committee, was publicly calling on the Chancellor to 'give top priority to the unemployment challenge'. The year before, in Mastering British Politics, he wrote: 'Occasionally, in the course of its long history, the Conservative party has been swept along on the wave of some particular ideology, but such periods have not usually lasted or brought enduring political success'.” – "Rising Damp", The Times, June 1987. The ideology Forman referred to was the then fashionable combination of supply side economics, monetarism, deregulation and privatisation known in the 1980s as Thatcherism. After Mrs Thatcher was forced from office in late 1990 it was considered only a matter of time before Forman would be promoted. Minister of Higher Education, April 1992 to December 1992 “The omission of Nigel Forman, from successive ministerial reshuffles over the past few years has surprised many at Westminster when several apparently less talented politicians have secured top posts. But after 16 years in the Commons, he has become an under-secretary at the education department” Immediately after the general election in April 1992 Forman was appointed Under Secretary of State for Education (with the job title Minister of Higher and Further Education) under Education Secretary John Patten. During his tenure of office, Forman dealt with high-profile issues such as the financing of student unions, student loans and the quality assurance of degrees issued by the new universities. Forman unexpectedly resigned from his ministerial post on 11 December 1992 for "personal reasons". The nature of those personal reasons was never disclosed. Colleagues commented that Forman was "a very private man" and nobody claimed to know why he had resigned. Thereafter, Forman’s political career went into decline. His political interests appeared to become more theoretical in nature. In January 1996 the Demos 'think tank' published a paper written by him on reform of the income tax system. Demos was generally considered to be closely associated with New Labour. At the 1997 general election, Forman lost his seat to the Liberal Democrat candidate Tom Brake. Forman's 10,000 vote majority in the 1992 general election was converted into a 2,000 vote Liberal Democrat majority with a 12% swing from Conservative to Lib Dem. After Parliament Forman initially developed a portfolio of lecturing and writing work. In 1999 he joined the faculty of Wroxton College, the UK (Oxfordshire) campus of Fairleigh Dickinson University (FDU). Forman delivered courses for ‘Westminster Explained’, Parliament’s own in-house training facility which provides courses to members of both Houses and the wider public service. His later publications included "Constitutional Change in the UK" (Routledge, 2004 – a study of recent change introduced by New Labour) and "Mastering British Politics", (4th edition, update of a standard text, Macmillan, 1999). He was a visiting lecturer at Essex University and an honorary research fellow at University College London. Forman died of dementia-related issues on 11 May 2017. In the last year of his life he was reported to have been dismayed by the result of the 2016 Brexit referendum and to have stated that the UK had become a country he hardly knew. However, obituarists drew attention to his comment (quoted above) published thirty years earlier concerning the tendency of the Conservative party to be occasionally swept along in particular ideologies. References Category:1943 births Category:2017 deaths Category:Place of birth missing Category:College of Europe alumni Category:Alumni of New College, Oxford Category:Fairleigh Dickinson University faculty Category:Conservative Party (UK) MPs for English constituencies Category:UK MPs 1974–1979 Category:UK MPs 1979–1983 Category:UK MPs 1983–1987 Category:UK MPs 1987–1992 Category:UK MPs 1992–1997 Category:Alumni of the University of Sussex Category:John F. Kennedy School of Government alumni

Beschreibung Diese Gitarre holen Ohrstecker wurden handgefertigt und verfügen über eine echte Gitarre holen Form mit einem gebürstetem Patina und Musik Noten. Die Gitarre holen Formen wurden von 20 Gauge Sterling Silber mit einem Schmuck sah, gestempelt mit Musiknoten und gehämmert in einem dapping Block um die Krümmung zu schaffen, welches wandelt Licht in eine natürliche highlights und Schatten, während auch das Hinzufügen Charakter, von hand gesägt und Dimension der Ohrringe. Ich die fertigen Picks, hypoallergen Ohrstecker aus Sterlingsilber mit einer Acetylen-Taschenlampe gelötet und die Oberfläche mit einer Patina behandelt. Mit einer Drahtbürste, ich entfernt einige der Oberfläche Patina für einen gealterten polierten Look, aber links Musiknoten für maximalen Kontrast dunkel. Diese Gitarre holen Ohrstecker messen 8 mm lang und 6 mm breit und sind hypoallergen Sterling Silber Ohrstecker, die zertifiziert sind, nicht enthalten Giftstoffe wie Blei oder nickel verlötet. Wenn Ihr auf der Suche nach Graduierung Geschenk für jemanden aus der Musikschule oder ein Musik-Programm, diese Ohrringe ein hervorragendes Geschenk machen würde. Sie sind auch ideal für einen Musiklehrer oder Musik-Liebhaber. Kundenspezifische Aufträge sind immer willkommen. Ich genieße Ihre Sonderwünsche in einzigartigen Schmuck zu verwandeln. Bitte zögern Sie nicht, mich mit Fragen zu kontaktieren. Vielen Dank... Nici Oder klicken Sie hier, um zurück zu unserem Geschäft https://www.etsy.com/shop/nicilaskin

Black Diamond Compactor Poles $129.99 Combining our innovative folding Z-Pole technology with winter functionality, the Black Diamond Compactor is a four-season aluminum pole that folds into an ultra-compact package for easy storage. FlickLock Pro offers up to 20 cm of adjustability and dramatically improved clamping force in a low-profile design, while the Compactor’s speed cone deployment allows it to deploy in a matter of seconds. Its small size when folded makes it ideal for splitboarding, snowshoeing and airline travel to distant winter destinations. Related Products $179.99 Siam 7 Prolink is a confidence-building touring boot for women. It features a supportive cuff for more control, Custom Fit and easy adjusting quicklace for personalized all-day comfort, and Thinsulate for warmth. $359.99 Super, all-round skis that suit performance training and racing. The channeled air cores are light and maintain an ideal flex profile at any temperature. Air Tech Basalight construction has air channels in a lightweight wood core, and light fiber glass wrap to keep the weight down. Power edges are designed to strengthen the edge of the ski, protect against wear on the sidewalls, and promote even wax wear. World Cup Pro sintered base, race tuned and stone ground for an ultra-smooth finish. With the NIS plate system. $139.99 Universal design suits recreational skiers who want both speed and stability. Their light wood/air core offers great climbing and gliding, and makes them an excellent all-purpose option fibreglass and wood core air channel construction. Easy crown design combines single and double construction for good grip and smooth gliding. $229.99 The ZYMAX SKATING is a recreational performance skate ski designed for fitness-oriented skiers. A new lightweight construction reduces weight by 50 grams while the thinner core profile delivers a softer, more user-friendly flex at the tip and tail. Featuring Active Cap construction, Premium Low Density Core and Extended Edge technology, the lightweight Zymax Skating ski delivers powerful and precise performance. Racing Cobra sidecut widens at the tip for superior stability at push-off while the Double Groove Guide enhances tracking. The Zymax Skating is an accessible, top-shelf skate ski with the best-racing base at this price point on the market. NIS Compatible

About Us Established in 2002, Home, Food and Travel has grown to become a household brand in much of South Africa. We have now expanded to feature the Eastern Cape, Western Cape, KZN, Gauteng and Mpumalanga. We cover everything lifestyle - including restaurants, accommodation, activities, motoring, beauty and health as well as events. Home, Food & Travel is targeted at individuals looking to relax at home or explore some of the best spots and holiday destinations that their area has on offer. The magazine and website is owned by Ricochet Publishing, which is a private company based in Port Elizabeth. Ricochet Publishing also publish Business Link Magazine,Kids Connectionand Wedding & Function Magazine as well as the news website – RNEWS and retail website - Bargain Buys. If you enjoyed anything on our website, feel free to LIKE us on Facebook and to mention us to your friends and family! Top Stories People often say that McGregor is magic, and many residents say it’s destiny to be living here. So it was for the owner of 100 Long Street, who has created a retreat-like haven with two private self-catering cottages that, between them, will accommodate up to five guests...

Citation: Pengpid, S. & Peltzer, K. (2018) Prevalence and social and health correlates of insomnia symptoms among middle-and older-age persons in rural South Africa. <i>Journal of Psychology in Africa</i>. 28(6):472-478. Abstract: This study investigated the prevalence and social and health correlates of insomnia symptoms among middle- and older-adults in rural South Africa . We analysed baseline survey data from the Health and Aging in Africa: A Longitudinal Study of an INDEPTH community in South Africa (HAALSI) (N = 5 059; females = 53 .6%; largely African Shangaan/ Tsonga-speaking) . In all, 8 .0% of the adults had three insomnia symptoms, 8 .9% of participants had difficulty initiating sleep, 13 .6% had difficulty in sleep maintenance, and 6 .5% had poor sleep quality . In adjusted logistic regression, lower education, perceived unsafe neighbourhood, poorer self-rated health status, vision difficulty, pain, depressive symptoms, and posttraumatic stress disorder (PTSD) symptoms increased the odds of having insomnia symptoms . Insomnia symptoms are common in middle- and older-age adults in rural South Africa, and various risk factors were identified . This can help in improving insomnia prevention treatment in this population . Keywords: INSOMNIAADULTSELDERLY If you are interested in obtaining a copy of an output which is not immediately available for download, please contact Hanlie Baudin at [email protected]

Digital Edition Summer Project This summer, I am working with two undergraduate research fellows to build a prototype digital critical edition. Building on the Southern Audiobooks collection at GRU, we are creating an edition that brings together the audio, the text, annotations, and critical commentaries, all in one edition. Our goal is to produce an edition that makes these texts more fully accessible to general readers and students at the college or high school level. We have started with the audiofiles of Joel Chandler Harris’s Uncle Remus stories. These stories prove problematic for readers, especially in a classroom setting, for multiple reasons. First, the dialect makes them nearly inaccessible for some readers, making both the audio and the explanatory annotations valuable for deciphering some of the language. Second, the political, cultural, and historical context of the stories is especially complicated and controversial, so that reading them without accompanying commentary may leave readers with an incomplete understanding of the texts and the stories they seek to represent. Our project seeks to address both of these difficulties, as well as providing additional resources for further study. From our perspective as builders of a library of digital editions, the Harris stories present a necessary challenge: within these texts, we expect to encounter most of the anticipated difficulties in coding the texts, incorporating the audio and commentaries, and building a platform on which the texts can be displayed and searched. We are using TEI encoding for searchable metadata (allowing users to find all incidences of specific characters, for example, regardless of how they are called in the text). At the conclusion of this summer program, we will have at least four fully encoded, annotated texts with accompanying audio (divided by paragraph), accessible through a searchable library. We hope to have up to 20 additional texts with TEI markup, with the complete audio (not divided by paragraph), and with commentary and annotations to be developed later. Watch the projects page for a link to the Digital Editions Library. We plan to launch the prototype texts in July!

Let y be h(6). What is the second derivative of -2*p - 2*p**2 - p + 11 + 8*p + y*p - 4*p wrt p? -4 Let k(x) be the first derivative of -646*x**7/7 + x**3/3 - 56*x**2 - 1012. Find the third derivative of k(a) wrt a. -77520*a**3 Let c(i) be the second derivative of 146*i**2 + 0*i**5 - 1/10*i**6 + 0*i**3 + 55*i + 2 + 5/4*i**4. Find the first derivative of c(o) wrt o. -12*o**3 + 30*o Suppose 86856 = 8*l - 25224. Find the second derivative of -11*j**2 - l*j**3 - 6*j**2 + 6*j + 14018*j**3 wrt j. 48*j - 34 Let z(k) be the first derivative of 4*k**3/3 + 13*k**2/2 + 20*k - 25. Let f(l) = -l**2 - 3. Let q(x) = 2*f(x) + z(x). Differentiate q(g) with respect to g. 4*g + 13 Suppose 0 = 5*y - 4*j + 181 - 569, -308 = -4*y + 4*j. Find the first derivative of y + 35*x + 14 + 30*x - 4*x wrt x. 61 Find the second derivative of -818*t**2 - 2380*t + 2*t**3 + 818*t**2 wrt t. 12*t Let u(b) = -23333*b + 2561. Let p(n) = -5833*n + 619. Let o(d) = 26*p(d) - 6*u(d). What is the derivative of o(l) wrt l? -11660 Let s(l) be the first derivative of -4*l**6 + 91*l**3/6 - 135*l + 133. Let n(k) be the first derivative of s(k). What is the second derivative of n(j) wrt j? -1440*j**2 Let d(m) be the third derivative of -29*m**8/84 - 121*m**5/60 - 5*m**4/24 - 992*m**2. What is the third derivative of d(w) wrt w? -6960*w**2 Let d(z) be the second derivative of 83*z + 0*z**3 + 0 - z**5 + 0*z**2 - 5/3*z**4. Find the third derivative of d(b) wrt b. -120 Differentiate -31400 + 61536 + 4037*c - 32465 wrt c. 4037 Find the first derivative of 16*g + 6085 + 50*g**2 + 66*g**2 - g**3 + 47*g**2 - 256*g**2 - 2095 wrt g. -3*g**2 - 186*g + 16 What is the second derivative of -6495*h - 6965*h + 11880*h - 3448*h**2 wrt h? -6896 Let a(h) = -2378*h**2 + 1373*h + 18. Let j(k) = -140301*k**2 + 81005*k + 1071. Let f(g) = -119*a(g) + 2*j(g). Find the second derivative of f(t) wrt t. 4760 Let y(k) be the second derivative of -k + 163*k**3 - 22*k**2 - 2*k**4 - 163*k**3 + 4*k. Differentiate y(q) with respect to q. -48*q Let t be (-21 - -1)/(93/(-5580)). What is the third derivative of -1193*a**3 + 37*a**2 + 20*a**4 + 8*a**2 - 1 + t*a**3 wrt a? 480*a + 42 Let y(w) = -229*w**2 - 4066*w - 20. Let v(c) = 457*c**2 + 8131*c + 45. Let j(x) = 4*v(x) + 9*y(x). What is the second derivative of j(t) wrt t? -466 Find the third derivative of -2*h - 7538*h**5 + 58*h**2 + 7537*h**5 + 408*h**3 - 382*h**2 wrt h. -60*h**2 + 2448 Let l be 24/(-20)*(-20)/6. Let x be 1/4 - 11/(-4). What is the second derivative of 9*k - 5*k**3 - l*k**3 + 2*k**3 - 8*k**x wrt k? -90*k Let r(k) be the second derivative of -1997*k**4/6 + k**3/3 + 47*k**2/2 - 1966*k - 1. What is the second derivative of r(g) wrt g? -7988 Let l(f) be the second derivative of 21 + 0*f**2 - 3*f - 15/4*f**5 - 1/3*f**3 - 1/3*f**4. What is the third derivative of l(h) wrt h? -450 Suppose 4*q - a - 11 = 0, -q + 2 = 3*q + 2*a. Find the first derivative of -47*c**2 - 40 + 16*c**q + 22*c**2 + 11*c**2 + 163 - 47*c wrt c. 4*c - 47 Find the second derivative of -63*k**3 + 7*k**2 - 5*k**2 - 2*k**2 - 6074*k**3 - 4093*k wrt k. -36822*k Let k(l) be the third derivative of -5162*l**7/105 + l**5/60 - l**4/12 + 1213*l**3/6 + 55*l**2 + 41. Find the third derivative of k(a) wrt a. -247776*a Suppose 4*w + 1712 = 20*w. What is the derivative of w + 2021*r**3 - 1898*r**3 - 4 wrt r? 369*r**2 Let f(w) = -2*w**2 + 2*w - 1. Let g(z) = 167*z**2 - 312*z + 6. Let t(y) = -6*f(y) - g(y). Find the second derivative of t(a) wrt a. -310 Let m(r) be the first derivative of 4459*r**3/3 - 4951*r**2 - 6708. What is the second derivative of m(s) wrt s? 8918 Let z(i) = 21 - 115*i - 8 + 118*i. Let m be z(-3). Find the third derivative of -11*d**2 - 3*d**4 + 3*d**m + 2*d**2 - 18*d**6 wrt d. -2160*d**3 Let k(p) be the second derivative of -p**7/42 - 981*p**5/5 - p**4/12 + 3347*p**3/3 - 38*p + 6. Find the second derivative of k(v) wrt v. -20*v**3 - 23544*v - 2 What is the third derivative of -10*r**2 + 3926*r**4 - 121*r - 9*r**2 + 119*r - 1117*r**4 - 48 + r**2 wrt r? 67416*r Let h(y) = 3*y + 2. Let a(r) = -136*r + 117. Let q = 282 - 283. Let o(i) = q*a(i) + 6*h(i). What is the first derivative of o(l) wrt l? 154 Let l(h) be the third derivative of -13*h**5/60 - 485*h**4/24 + 3*h**2 - 14*h. Find the second derivative of l(j) wrt j. -26 What is the first derivative of -1132 + 5851*p**3 - 2925*p**3 - 2925*p**3 + 116*p**2 wrt p? 3*p**2 + 232*p Suppose 2*r + 5*r = -14. Let x be (-1)/r*8*6/24. Find the first derivative of -x - 5 + 5 - 3 + 4*d wrt d. 4 Let g(f) = 17*f**3 - 4*f**2 + 30*f - 951. Let y(b) = 17*b**3 - 3*b**2 + 30*b - 951. Let r(s) = -3*g(s) + 4*y(s). What is the first derivative of r(m) wrt m? 51*m**2 + 30 Let l(h) = 2*h**3 + 3820*h**2 - 4*h - 7704. Let y(d) = -6*d**3 - 7639*d**2 + 10*d + 15406. Let v(j) = -5*l(j) - 2*y(j). Find the first derivative of v(f) wrt f. 6*f**2 - 7644*f Let w(g) be the second derivative of 3199*g**3/6 - 1095*g**2 + 1738*g. Differentiate w(i) wrt i. 3199 Let t(r) be the second derivative of 255*r**7/7 + 35*r**4/3 + r + 29. What is the third derivative of t(w) wrt w? 91800*w**2 Let o be (0 + -3 + 7)*(2 - -2). Suppose -18*l + 10*l = -o. What is the derivative of 35 + f**l + 34*f**3 - 3 - f**2 wrt f? 102*f**2 Let o = 23963 - 23963. Let p(g) be the third derivative of 3/2*g**4 + 0 + 36*g**2 + 17/3*g**3 + o*g. Differentiate p(k) with respect to k. 36 Let u(c) be the second derivative of -1/6*c**4 + 0*c**5 - 21 + 0*c**6 - 1/14*c**7 + 2*c - 1/6*c**3 - 7*c**2. Find the second derivative of u(d) wrt d. -60*d**3 - 4 Let m(g) = 2*g**2 - 7*g - 31. Let y be m(-7). Differentiate -121*z**3 - 97 - 22*z**3 + y with respect to z. -429*z**2 Let o(n) = 345*n**2 - 873*n + 2. Let m(z) = 685*z**2 - 1746*z + 5. Let t(b) = -4*m(b) + 10*o(b). What is the second derivative of t(a) wrt a? 1420 Let q(r) = r**3 + 2*r**2. Let l(v) = 6*v**3 + 16*v**2 + 1587*v - 5468. Let o(a) = l(a) - 8*q(a). What is the derivative of o(h) wrt h? -6*h**2 + 1587 Let i be (-2 - (11 + -1)) + 34 + -18. Let g(s) be the first derivative of -10 + 0*s + 19/4*s**i + 5*s**3 + 0*s**2. Find the third derivative of g(t) wrt t. 114 Let z be (-16)/(-56) - 508/14. Let k = -19 - z. What is the third derivative of 9*s**2 - 10 - 1 + 11 + k*s**3 wrt s? 102 Suppose 3*t - 227 = f, -5*t + 2*f = -3*f - 395. Suppose t = 3*z - 5*u, 79 = 4*z - 3*u - 16. What is the first derivative of z - 4 + 7 + 11*n**4 + 6*n**4 wrt n? 68*n**3 Let i(s) be the first derivative of 0*s**2 - 115/3*s**3 - 136 - 13*s**5 + 0*s + 0*s**4. Find the third derivative of i(m) wrt m. -1560*m Let b(i) be the third derivative of -97*i**5/30 + 351*i**4 - 652*i**2 + 4. What is the second derivative of b(s) wrt s? -388 What is the second derivative of -2*x**2 + 2*x**2 + 37327*x**3 + 2097*x - 36226*x**3 wrt x? 6606*x Let w(h) = -3070*h**3 - 2*h**2 - 3166. Let j(t) = -6134*t**3 - 5*t**2 - t - 6333. Let b(q) = 2*j(q) - 5*w(q). What is the derivative of b(y) wrt y? 9246*y**2 - 2 Find the third derivative of -1394 + 5732*c**5 + 1392 - 508*c**2 + 5*c**3 - 249*c**2 - 5*c**3 wrt c. 343920*c**2 Suppose -4*j = -v - 169, 5*v + 189 = 4*j - 0*j. Let s = 44 - j. Differentiate 6*y**s + 405*y - 405*y - 12 with respect to y. 18*y**2 Suppose -5*s + 7 = -2*j, -6*j + 2*j = -3*s - 7. Let m(n) = 4*n - 482. Let u be m(121). Find the third derivative of -2*g**u + 56*g**4 - 11*g**2 - 21*g**j wrt g. 840*g Let t(b) be the second derivative of 1333*b**7/21 + 1427*b**3/6 + 442*b + 1. What is the second derivative of t(w) wrt w? 53320*w**3 Find the third derivative of 4*c + 2460*c**2 - 2939*c**5 + 39*c + 36*c - 79*c wrt c. -176340*c**2 Suppose 0 = -1666*l + 1484*l. Let q(j) be the first derivative of 0*j**4 + 0*j**3 + 24/5*j**5 - 26*j - 16 + l*j**2. Differentiate q(k) with respect to k. 96*k**3 Let x(i) = 38*i + 85. Let s(c) = -1. Suppose 3*b + 7 = -2*p, 5*b + 2*p + 3 = -6. Let t(h) = b*x(h) + s(h). Differentiate t(f) with respect to f. -38 Find the third derivative of -519*v**5 - 6*v**2 - 533 - 642*v**5 + 7*v**2 - 192 - 12 wrt v. -69660*v**2 What is the second derivative of -30*y**5 + 239*y**4 - 9321*y**2 + 4881*y + 9321*y**2 + 36*y**5 wrt y? 120*y**3 + 2868*y**2 Let w(z) be the first derivative of -5476*z**5/5 + 5198*z**3/3 - 5116. Find the third derivative of w(j) wrt j. -131424*j Let z(f) = -f**3 - 6*f**2