How to retain value of the variable after the page is reloaded?
Persist variables between page loads
I need to insert 800000 records into an MS Access table. I am using Delphi 2007 and the TAdoXxxx components. The table contains some integer fields, one float field and one text field with only one character. There is a primary key on one of the integer fields (which is not autoinc) and two indexes on another integer and the float field.  Inserting the data using AdoTable.AppendRecord(...) takes > 10 Minutes which is not acceptable since this is done every time the user starts using a new database with the program. I cannot prefill the table because the data comes from another database (which is not accessible through ADO).  I managed to get down to around 1 minute by writing the records to a tab separated text file and using a tAdoCommand object to execute  insert into table (...) select * from [filename.txt] in "c:\somedir" "Text;HDR=Yes"   But I don't like the overhead of this.  There must be a better way, I think.  EDIT:  Some additional information:   MS Access was chosen because it does not need any additional installation on the target machine(s) and the whole database is contained in one file which can be easily copied. This is a single user application. The data will be inserted only once and will not change for the lifetime of the database. Though, the table contains one additional field that is used as a flag to indicate that the corresponding record in another database has been processed by the user. One minute is acceptable (up to 3 minutes would be too) and my solution works, but it seems too complicated to me, so I thought there should be an easier way to do this. Once the data has been inserted, the performance of the table is quite good. When I started planning/implementing the feature of the program working with the Access database the table was not required. It only became necessary later on, when another feature was requested by the customer. (Isn't that always the case?)   EDIT:  From all the answers I got so far, it seems that I already got the fastest method for inserting that much data into an Access table. Thanks to everybody, I appreciate your help. Proving the measure of an increasing sequence of measurable sets is the limit of the measures Show that if $A_1\subseteq A_2\subseteq A_3\subseteq\cdots$ is an increasing sequence of measurable sets (so $A_j\subseteq A_{j+1}$ for every positive integer $j$), then we have $$m\left(\bigcup_{j=1}^\infty A_j\right)=\lim_{j\to\infty}m(A_j)$$  Here is my proof: According to the $\sigma$-algebra property, $\bigcup_{j=1}^{\infty}A_j$ is a measurable set, so it makes sense to talk about $m(\bigcup_{j=1}^{\infty}A_j)$. Firstly, I prove that $\lim_{j\to\infty}m(A_j)\leq m(\bigcup_{j=1}^{\infty}A_j)$. This is because for any given positive integer $N$, $A_N\subseteq \bigcup_{j=1}^{\infty}A_i$, according to monotonicity, we have $m(A_N)\leq m(\bigcup_{j=1}^{\infty}A_i)$. Take the limit,we will have $\lim_{j\to\infty}m(A_j)\leq m(\bigcup_{j=1}^{\infty}A_j)$. Secondly, I prove that $m(\bigcup_{j=1}^{\infty}A_j)\leq \lim_{j\to\infty}m(A_j)$. For any given positive integer $N$, $\bigcup_{j=1}^N A_j = A_N$. According to monotonicity,we have $m\left(\bigcup_{j=1}^N A_j\right)=m(A_N)\leq \lim_{j\to\infty}m(A_j)$. Take the limit, we will have $m\left(\bigcup_{j=1}^\infty A_j\right) \leq \lim_{j\to\infty} m(A_j)$. Combine the above two arguments, we will see that $$m\left(\bigcup_{j=1}^\infty A_j\right)=\lim_{j\to\infty} m(A_j)$$$\Box$  The above is my proof, unlike many books, my proof does not use the property of countable additivity. So I doubt my proof is correct. Who can point out where are my mistakes? Every irreducible polynomial $f$ over a perfect field $F$ is separable.   Can you check my proof? Assume that $f$ is irreducible but inseparable. So we have $f=\sum_i h_ix^i$ and $f^p=\sum_i h_i^px^{ip}$. Now I use Frobenius mapping $\phi (f)=f^p=(\sum_i h_ix^i)^p=\sum_i h_i^px^{ip}$ so it is reducible. Contradiction. Should I also show for char(F)=0? Is it possible to cancel or clear a notification created by using notify-send? So I wrote a little script that makes sure a certain user plugs in a laptop when he logs on (it disables if he doesn't). The script uses notify-send to tell him to plug it in. If he plugs it in, the script quits. Is it possible to clear the notification automatically when he plugs it in? I'm thinking it might require somehow getting the process id spawned by notify-send and killing that PID, but I don't know how to do this.  Here's the current script:  #!/bin/bash   cat /sys/class/power_supply/BAT0/status OUTPUT="$(cat /sys/class/power_supply/BAT0/status)" echo "${OUTPUT}" if [ "${OUTPUT}" = "Charging" ] || [ "${OUTPUT}" = "Unknown" ]; then     echo charging or full elif [ "${OUTPUT}" = "Discharging" ]; then     notify-send -i /home/evamvid/Documents/Programming/OokiNoUse/power25.png "Hey there brother" "plug it in"     COUNTER=0 while [ "$COUNTER" -le 12 ] do     cat /sys/class/power_supply/BAT0/status     OUTPUT="$(cat /sys/class/power_supply/BAT0/status)"     echo "${OUTPUT}"     if [ "${OUTPUT}" = "Charging" ] || [ "${OUTPUT}" = "Unknown" ]; then         exit     elif [ "${OUTPUT}" = "Discharging" ]; then         COUNTER=$(($COUNTER+1))         echo $COUNTER         sleep 1     fi done fi I found a couple useful threads on this forum with respect to the issues posed by (displaying) images in email signatures-- , for example-- and I've searched all over the web, but still have not found a good solution that sufficiently addresses the problem. A client of mine would simply like his company's logo included in the signature of his emails, and the issues I've encountered can be summarized as follows:   I can export a rasterized version of the logo from AI at actual size, and it will look sharp on the desktop but pixelated/blurry on hi-density (e.g. "retina") displays such as the iPhone. As suggested in the thread I referenced, I can export the logo at 2-3 times the actual, displayed size to target the hi-density displays, but the logo will then look soft on non-hi-density displays when it is scaled down. This is a particular problem in this instance as the logo contains text, which looks terrible when juxtaposed with actual text in the browser/email client. I've considered .svg as an option, but apparently the support is not great; and in this case I'm assuming the vast majority of the users reading this client's email will be using Outlook, so something that only renders properly in iOS/webkit/etc is not a viable option.   I'm at a loss at this point and wondering if there is any other possible option out there. I'm not sure, for instance, if it's possible to implement a hi-density image with lo-res fallback in an email signature?  Any suggestions/insights here are much appreciated. It's bordering on comical how difficult this task has turned out to be. Is there a built-in method to compare collections? I would like to compare the contents of a couple of collections in my Equals method.  I have a Dictionary and an IList.  Is there a built-in method to do this?  Edited: I want to compare two Dictionaries and two ILists, so I think what equality means is clear - if the two dictionaries contain the same keys mapped to the same values, then they're equal. How can I get another application's installation path programmatically? Multiple AES Key Derivation from a master key A formal name for "smallest" and "largest" partition Consider a set $A=\{1,2,3,4,5\}$, is there any terminology for the following partitions of $A$ ?  (1) $A=\{ \{1\},\{2\},\{3\},\{4\},\{5\} \}$  (2) $A=\{\{1,2,3,4,5\}\}$. Unwanted Lines when rendering using GPU and OpenCL (RX 580) Proving the measure of an increasing sequence of measurable sets is the limit of the measures How did Dumbledore gain the loyalty of Fawkes? How did Dumbledore find Fawkes. Did Dumbledore have Fawkes even when working as a Transfiguration teacher or acquired it after having Headmaster position. They both have a very strong bond between them. When did Dumbledore gain this. Update: Dumbledore says that Ollivander wrote to him when Harry's wand was purchased; if Dumbledore did not have Fawkes before 1938, he would not know about the two feathers being in the wands, so Fawkes and Dumbledore must have met and bonded before 1938  “My wand's feather came from Fawkes?” Harry said, amazed. &quot;Yes,” said Dumbledore. “Mr. Ollivander wrote to tell me you had bought the second wand, the moment you left his shop four years ago.” -Harry Potter and the Goblet Of Fire, Chapter 36-The Parting Of the Ways.  Update 2: JKR says that Dumbledore was the only owner of Fawkes. So it is to be believed that Fawkes was a wild Phoenix before its bonding with Dumbledore.  Peter Humphreys for BBC Newsround: Who did Fawkes previously belong to and will he play a vital role in the next book? JK Rowling: I am not going to answer about the role in the next books, which probably gives you a big clue, and he has never been owned by anyone but Dumbledore. You will notice that when Harry goes back in the Pensieve in this book, Fawkes is never there, and ­­ no, I am sorry, not in this book, I take that back. When Harry has previously seen the study with a different headmaster he saw it with Dippet and Fawkes was not there then. Fawkes is Dumbledore's possession, not a Hogwarts possession. Has anyone ever booked a flight with ?  I am just wondering where they get their prices and data from, and if I might find a cheaper flight by using something like Expedia or Travelocity. This problem comes from , who do not rigorously demonstrate (in their solution key) that the statistic is not sufficient.  Let $X_1,\dots,X_n$ be a random sample from a population with PDF $f(x|\theta)=\theta x^{\theta-1} \cdot 1_{\{x\in(0,1)\}}$ for $\theta&gt;0$. Show that $\sum_i X_i$ is not sufficient for $\theta$.  If you write out the PDF $p(\vec{x}|\theta)$ of the random sample, it is clear by the factorization theorem that $\prod_i X_i$ or $\sum_i \log(X_i)$ are sufficient for $\theta$; the PDF $p$ also suggests $\sum_i X_i$ is not sufficient for $\theta$. However, to rigorously demonstrate this, we need to analyze $p(\vec{x},\theta)/q(T(\vec{x},\theta)$, where $p$ is the distribution of sample $\vec{x}$, $q$ is the distribution of the statistic $T(\vec{X})=\sum_i X_i$. But finding the distribution of $T(X)=\sum_i X_i$ seems impractical. I have observed that $f$ is the PDF of a Beta($\theta$,1) distribution, but checking online, the distribution of the sum of Beta random variables doesn't appear to have a closed form. Are there any alternative routes (e.g., showing there is no factorization involving $T(\vec{X})$)? Did C&amp;B leave out a full explanation that $\sum_i X_i$ is not sufficient because none actually exist? Do these leaves signify anything? Occasionally, you can see little tufts of leaves blowing in spots on the map      Do these mean anything? Is there a word that means "a span of six months"? That is, I want to connote a stretch of time that lasts half a year, not an event that happens every six months. I have some lines. I want to draw perpendicular lines at the start and end of the lines, on both sides of the lines.  Can somebody help me in Python?  I am using ArcGIS. Consider equations defined in $D_x = (0,\infty) \times (0,\infty)$  1) Find the maximal solution to  $$ \dot y = \frac{3t^2}{5y^4} $$ satisfying the initial value problem $y(1) = 2^{\frac{1}{5}}$  I have found the maximum solution to be $((0,\infty), (t^3+1)^\frac{1}{5})$  2) Find the maximal solution to   $$ \dot y = -\frac{2y}{5t}+\frac{3}{5y^4}$$  satisfying the IVP $y(1) = 2^{\frac{1}{5}}$.  (HINT: Use a transformation of the form $t^{\alpha}y(t)$.   I hope someone can explain how to use the transformation to find the maximal solution. I'm working on a new edition of a book which uses a very unusual style of bibliography: Entries are sorted in author-year fashion, but then numbered per author or group of authors, e.g.:  Milnor, J.:    1. Construction of universal bundles: I, Ann. Math., (2)63:272-284 (1956).    2. Construction of universal bundles: II, Ann. Math., (2)63: 430-436 (1956).    3. On manifolds homeomorphic to the 7-sphere, Ann. Math., (2)64: 399-405       (1956).    4. The theory of characteristic classes, mimeographed, Princeton University,       Princeton, N.J., 1957. Milnor, J., and M. A. Kervaire:    1. Bernoulli numbers, homotopy groups, and a theorem of Rohlin, Proc. Intern.       Congr. Math., 1958. Milnor, J., and E. Spanier:    1. Two remarks on fibre homotopy type, Pacific J. Math., 10: 585-590 (1960).   Citations are formatted as Milnor [3], and so on.  Is there any bibtex style for something strange as this? Or can this type of bibliography be created with biblatex without too much coding? Is it possible for information to be transmitted faster than light by using a rigid pole?