pros and cons of HSA in Investment account
HSA - Continue to Invest?
In order to better understand the SQL Server query processor, I've been thinking about how the ORDER BY clause works, and how SQL Server provides results.  It appears SQL Server will provide results in exactly the same order for any given set of data that remains the same and never, ever changes.  Once you introduce any kind of uncertainty such as developers changing something, the order of results can no longer be expected to be the same.  Simply seeing the results in the same order, each time you press F5 does not guarantee the results you expect.  Try this:  USE TempDB; DROP TABLE TestOrderBy; DROP TABLE TestOrderBy2; CREATE TABLE TestOrderBy (     ID INT NOT NULL CONSTRAINT PK_TestOrderBy PRIMARY KEY CLUSTERED IDENTITY(1,1)     , SomeData varchar(255) ); INSERT INTO TestOrderBy (SomeData) VALUES ('E'); INSERT INTO TestOrderBy (SomeData) VALUES ('D'); INSERT INTO TestOrderBy (SomeData) VALUES ('C'); INSERT INTO TestOrderBy (SomeData) VALUES ('B'); INSERT INTO TestOrderBy (SomeData) VALUES ('A');  CREATE TABLE TestOrderBy2 (     ID INT NOT NULL CONSTRAINT PK_TestOrderBy2 PRIMARY KEY CLUSTERED IDENTITY(1,1)     , SomeData varchar(255) ); INSERT INTO TestOrderBy2 (SomeData) VALUES ('E'); INSERT INTO TestOrderBy2 (SomeData) VALUES ('D'); INSERT INTO TestOrderBy2 (SomeData) VALUES ('C'); INSERT INTO TestOrderBy2 (SomeData) VALUES ('B'); INSERT INTO TestOrderBy2 (SomeData) VALUES ('A');  SELECT SomeData  FROM TestOrderBy UNION ALL SELECT SomeData FROM TestOrderBy2;  CREATE INDEX IX_TestOrderBy_SomeData ON TestOrderBy (SomeData); CREATE INDEX IX_TestOrderBy2_SomeData ON TestOrderBy2 (SomeData);  SELECT SomeData  FROM TestOrderBy UNION ALL SELECT SomeData FROM TestOrderBy2;   The results:    As you see, adding a simple index on the fields selected in the query alters the order of the results.  From here on, I'm adding ORDER BY unless I truly don't care. What is the correct formula for gravitational time dilation for a satellite in a circular orbit? I am trying to create a stacked bar chart above a table, basically identical to the one below.    I have found similar posts such as:   However, my experience is very limited to simple tables and I am struggling to modify this to suit my needs.  Any ideas on how I can achieve such a graph?  Thanks! What if a light clock travels perpendicular to mirrors that make up the clock? Minecraft Forge 1.7.10 will not start My minecraft will not start on only that version, I have a Windows 7 computer with Java 8u20 installed, because the latest java 7 update will not work at all(plus imma dev for other stuff).   [22:26:39] [main/INFO] [LaunchWrapper]: Loading tweak class name   cpw.mods.fml.common.launcher.FMLTweaker  [22:26:39] [main/INFO] [LaunchWrapper]: Using primary tweak class name   cpw.mods.fml.common.launcher.FMLTweaker  [22:26:39] [main/INFO] [LaunchWrapper]: Calling tweak class   cpw.mods.fml.common.launcher.FMLTweaker  [22:26:40] [main/INFO] [FML]: Forge Mod Loader version 7.10.25.1208 for Minecraft   1.7.10 loading  [22:26:40] [main/INFO] [FML]: Java is Java HotSpot(TM) 64-Bit Server VM, version   1.8.0_20, running on Windows 7:amd64:6.1, installed at C:\Program   Files\Java\jre1.8.0_20  [22:26:40] [main/INFO] [LaunchWrapper]: Loading tweak class name   cpw.mods.fml.common.launcher.FMLInjectionAndSortingTweaker  [22:26:40] [main/INFO] [LaunchWrapper]: Loading tweak class name   cpw.mods.fml.common.launcher.FMLDeobfTweaker  [22:26:40] [main/INFO] [LaunchWrapper]: Calling tweak class   cpw.mods.fml.common.launcher.FMLInjectionAndSortingTweaker  [22:26:40] [main/ERROR] [LaunchWrapper]: Unable to launch  java.util.ConcurrentModificationException     at java.util.ArrayList$Itr.checkForComodification(Unknown Source) ~[?:1.8.0_20]     at java.util.ArrayList$Itr.remove(Unknown Source) ~[?:1.8.0_20]     at net.minecraft.launchwrapper.Launch.launch(Launch.java:117) [launchwrapper-  1.9.jar:?]     at net.minecraft.launchwrapper.Launch.main(Launch.java:28) [launchwrapper-1.9.jar:?]  Java HotSpot(TM) 64-Bit Server VM warning: Using incremental CMS is deprecated and   will likely be removed in a future release Design properties of the Rijndael finite field? So we've already had a question on . My question is - can we use a different finite field other than the one given by $x^8 + x^4 + x^3 + x + 1$ in $GF(2^8)$. In other words, would any irreducible polynomial over this field do the trick or are the special considerations and properties of that particular reducing polynomial?  If a more general discussion on appropriate fields for cryptographic operations, such as those used in ECC, is necessary, then I'd be happy to hear it. What I'm trying to get to is an understanding of whether there are any important properties in terms of the "randomness" of the operation - for example, are there weak fields to operate over? For example, $x^8 + x^3 + x + 1$ ought to also be irreducible - so would it be suitable? I ask partly because of the  which lead me to think not all fields might hold equal strength. Right? Wrong? Inconsequential? Importing coordinate data from Excel into QGIS I have an Excel file containing data collected over many years as latitude and longitude coordinates for archaeological sites. How can I import it into QGIS as a new layer? An arithmetic function is defined as follows:$f(1)=1$,  $f(2k)=k$ and $f(2k+1)=f(k)+f(k+1)$. When (for which $k$) is $f(k)$ even?  While it is obvious that $f(4n-1)=f(4n)=2n$, therefore $f(k)$ is even for $k=4n$ and $k=4n-1$, which is possible to prove using induction (isn't it?), I don't know how to prove the converse.  I tried to solve the recurrence or make use of constant difference between certain elements of the sequence $\ldots$ What am I missing?  Thank you. Mapping key combination with xmodmap I'm trying to achieve the following mapping keycode 135 = &lt;Ctrl-C&gt;  Is it possible to achieve this in some way? Is it possible to install Windows from an external hard drive?  I have Windows XP installed on my laptop, and I want to remove it and install Windows 7.  My Windows 7 installation is in an .iso format on an external USB hard drive.  Is it possible to install it or will I need to put in a DVD before I start installing? How to log out of a Stack Exchange site? What medium should be used for long term, high volume, data storage (archival)? Top bar search doesn't pick up subdomains I wanted to switch to  in the handy dandy site switcher in the new top bar. Entering "cook" brings up nothing:     ... so I have to remember that the boutique title of the site is "Seasoned Advice":     ... in which case the site switcher also thinks that maybe I was thinking of heading over to  to see what's up. So the site switcher searches site names and descriptions, but not subdomains. This is unexpected behavior - I believe it should search all three. Why are map tiles being repeated? Using MapServer and Openlayers Best practices for API versioning? Are there any known how-tos or best practices for web service REST API versioning?  I have noticed that . Is this the only way or are there other ways to accomplish the same goal? If there are multiple ways, what are the merits of each way? I'm bugged by the following that's summarized on p. 109 of .     False theorem: All horses are the same color.      Proof by induction:      $\fbox{$P(n)$ is the statement: In every set of horses of size $n$, all $n$ horses are the same color.}$   $\fbox{Base Case or $P(1)$:}$ One horse is the same color as itself. This is true by inspection.   $\fbox{Induction Step:}$ Assume $P(k)$ for some $k \geq 1$.   $\fbox{Proof of $P(k + 1) :$}$   Since $\{H_1, H_2, ... , H_n\}$ is a set of $n$ horses, the induction hypothesis applies to this set. Thus, all the horses in this set are the same color.   Since $\{H_2, H_3, ... , H_{n+1}\}$ is also a set of $n$ horses, the induction step likewise holds for this set. Thus, all the horses in this set are the same color too.         Therefore, all $n +1$ horses in $\{H_1, H_2, H_3, ... , H_n , H_{n+1}\}$ are the same color. QED.   The issue the instructor was trying to point out is clearly valid. For the case $n = 1$, there is only ${H_1}$. So this case says nothing about possible overlapping elements of each set of $(n + 1)$, for instance $H_2$ in the above proof.    But it was proposed in the class discussion that this was the only problem. Had you been able to prove $P(2)$ true, then a proof of the above format would have been fine.    My interpretation is that yes, you could prove all horses are the same color, if you can prove that any set of two horses will be the same color. But this format would not work.  Why not? The problem I see is that the above proof is for the existence of at least one particular pair of sets of horses of sizes $n$ and $n + 1$, such that in each set, all horses are the same color.  Particularly when the set of size $n$ is a subset of the set of size $n + 1$.  In order to prove the induction step, don't you need to prove that sets of sizes $n$ and $n + 1$, do not necessarily contain the same, overlapping elements?  You could prove that any horse can be added to a set of 2 horses.  Take the last two, and they must be the same color, and so on.  Wwhatever color the first two happen to be, all other horses must thus be the same color.    Am I misinterpreting the example, or am I making a logical error? Thanks in advance. (This is on NT based Windows like 2000, XP, Vista, 7)  On the command-line, the percentage characters are ignored:  wget "http://www.justitie.nl/images/Handleiding%20voor%20verwerkers%20persoonsgegevens_tcm34-3940.pdf"   So it correctly downloads this file (each %20 becomes a space):  "http://www.justitie.nl/images/Handleiding voor verwerkers persoonsgegevens_tcm34-3940.pdf"   But inside a batchfile, all the %20 are being interpreted as expanding parameter 2 (which is empty) resulting in this file to get downloaded (each %20 becomes 0):  "http://www.justitie.nl/images/Handleiding0voor0verwerkers0persoonsgegevens_tcm34-3940.pdf"   Is there a way to circumvent the percentage parameter expansion?  --jeroen Suppose you do bad in undergraduate school in say computer science. But you do very well in a masters program in computer science. If you want to apply to a PhD program in computer science, will the masters degree grades offset the undergraduate degree grades? See code:   var file1 = "50.xsl"; var file2 = "30.doc"; getFileExtension(file1); //returns xsl getFileExtension(file2); //returns doc  function getFileExtension(filename) {     /*TODO*/ } Can a ring of positive characteristic have infinite number of elements?