If I have 3 steam accounts, a primary one - the one that has all the games; and 2 empty ones. If I share my library on the primary account to the other two, can both of the other accounts play at the same time (not the same game obviously)?  So for instance: Account 1 Shares 2 games to account 2 and account 3, can account 2 play game 1 while account 3 plays game 2? Or as soon as account 3 comes online account 2 gets disconnected?
My brother owns Skyrim on steam. We use Steam Family Share, but we were wondering how both of us could play it at the same time?
Is there a way to reset/change my Steam email without being logged on? I cannot access the email that is linked to my Steam account and need to change it. However, Steam Guard sends a verification code to that email address.  Is there any way around this? I already have cast iron skillet but I can't find a decent "normal" pan, for eggs and stuff, sometimes steaks, more or less general purpose.   Here are some more features: high quality, durable, non stick, oven safe, dish washer safe, extremely flat surface - not to be higher in the middle, this is very important.  Of course pricier usually means better quality, but is it worth it based on the criteria I'm after? Is it likely to be worth going from pans below $60, to pans from $60 to $130, or to pans over $130? I'm stuck on the following phrases. Is it correct to use preposition "of" in the sentences bellow?    It's not a little unpleasant of being her so fussy. It's awfull of him having done this.   Thank you. Fetch the row which has the Max value for a column Table:   UserId, Value, Date.   I want to get the UserId, Value for the max(Date) for each UserId. That is, the Value for each UserId that has the latest date. Is there a way to do this simply in SQL? (Preferably Oracle)  Update: Apologies for any ambiguity: I need to get ALL the UserIds. But for each UserId, only that row where that user has the latest date. How do you keep parents of floated elements from collapsing? Although elements like &lt;div&gt;s normally grow to fit their contents, using the float property can cause a startling problem for CSS newbies: If floated elements have non-floated parent elements, the parent will collapse. For example:   &lt;div&gt;   &lt;div style="float: left;"&gt;Div 1&lt;/div&gt;   &lt;div style="float: left;"&gt;Div 2&lt;/div&gt; &lt;/div&gt;    The parent div in this example will not expand to contain its floated children - it will appear to have height: 0. How do you solve this problem? I would like to create an exhaustive list of solutions here. If you're aware of cross-browser compatibility issues, please point them out. Solution 1 Float the parent.   &lt;div style="float: left;"&gt;   &lt;div style="float: left;"&gt;Div 1&lt;/div&gt;   &lt;div style="float: left;"&gt;Div 2&lt;/div&gt; &lt;/div&gt;    Pros: Semantic code. Cons: You may not always want the parent floated. Even if you do, do you float the parents' parent, and so on? Must you float every ancestor element? Solution 2 Give the parent an explicit height.   &lt;div style="height: 300px;"&gt;   &lt;div style="float: left;"&gt;Div 1&lt;/div&gt;   &lt;div style="float: left;"&gt;Div 2&lt;/div&gt; &lt;/div&gt;    Pros: Semantic code. Cons: Not flexible - if the content changes or the browser is resized, the layout will break. Solution 3 Append a &quot;spacer&quot; element inside the parent element, like this:   &lt;div&gt;   &lt;div style="float: left;"&gt;Div 1&lt;/div&gt;   &lt;div style="float: left;"&gt;Div 2&lt;/div&gt;   &lt;div class="spacer" style="clear: both;"&gt;&lt;/div&gt; &lt;/div&gt;    Pros: Straightforward to code. Cons: Not semantic; the spacer div exists only as a layout hack. Solution 4 Set parent to overflow: auto.   &lt;div style="overflow: auto;"&gt;   &lt;div style="float: left;"&gt;Div 1&lt;/div&gt;   &lt;div style="float: left;"&gt;Div 2&lt;/div&gt; &lt;/div&gt;    Pros: Doesn't require extra div. Cons: Seems like a hack - that's not the overflow property's stated purpose. Comments? Other suggestions? How can I uninstall software? SUB-TREE WITHIN A TREE in MySQL  In my MYSQL Database COMPANY, I have a Table: Employee with recursive association, an employee can be boss of other employee. A self relationship of kind (SuperVisor (1)- SuperVisee (∞) ).     Query to Create Table:    CREATE TABLE IF NOT EXISTS `Employee` (   `SSN` varchar(64) NOT NULL,   `Name` varchar(64) DEFAULT NULL,   `Designation` varchar(128) NOT NULL,   `MSSN` varchar(64) NOT NULL,    PRIMARY KEY (`SSN`),   CONSTRAINT `FK_Manager_Employee`                 FOREIGN KEY (`MSSN`) REFERENCES Employee(SSN) ) ENGINE=InnoDB DEFAULT CHARSET=latin1;   I have inserted a set of tuples (Query):    INSERT INTO Employee VALUES   ("1", "A", "OWNER",  "1"),     ("2", "B", "BOSS",   "1"), # Employees under OWNER   ("3", "F", "BOSS",   "1"),   ("4", "C", "BOSS",   "2"), # Employees under B  ("5", "H", "BOSS",   "2"),   ("6", "L", "WORKER", "2"),   ("7", "I", "BOSS",   "2"),   # Remaining Leaf nodes     ("8", "K", "WORKER", "3"), # Employee under F        ("9", "J", "WORKER", "7"), # Employee under I        ("10","G", "WORKER", "5"), # Employee under H   ("11","D", "WORKER", "4"), # Employee under C  ("12","E", "WORKER", "4")     The inserted rows has following Tree-Hierarchical-Relationship:                A     &lt;---ROOT-OWNER         /|\                     / A \               B     F      //| \    \              // |  \    K        / | |   \                       I  L H    C         /     |   / \  J     G  D   E   I written a query to find relationship:    SELECT  SUPERVISOR.name AS SuperVisor,          GROUP_CONCAT(SUPERVISEE.name  ORDER BY SUPERVISEE.name ) AS SuperVisee,          COUNT(*)   FROM Employee AS SUPERVISOR    INNER JOIN Employee SUPERVISEE ON  SUPERVISOR.SSN = SUPERVISEE.MSSN  GROUP BY SuperVisor;   And output is:    +------------+------------+----------+ | SuperVisor | SuperVisee | COUNT(*) | +------------+------------+----------+ | A          | A,B,F      |        3 | | B          | C,H,I,L    |        4 | | C          | D,E        |        2 | | F          | K          |        1 | | H          | G          |        1 | | I          | J          |        1 | +------------+------------+----------+ 6 rows in set (0.00 sec)   [QUESTION] Instead of complete Hierarchical Tree, I need a SUB-TREE from a point (selective) e.g.: If input argument is B then output should be as below...  +------------+------------+----------+ | SuperVisor | SuperVisee | COUNT(*) | +------------+------------+----------+ | B          | C,H,I,L    |        4 | | C          | D,E        |        2 | | H          | G          |        1 | | I          | J          |        1 | +------------+------------+----------+      Please help me on this. If not query, a stored-procedure can be helpful. I tried, but all efforts were useless! Refactoring RadioGroup setter code? Do we know anything about Aragorn's first time in Moria? When the Company is forced to abandon their attempt to cross the Misty Mountains via the Redhorn Gate (the pass of Caradhras), Gandalf proposes they go "neither over the mountains, nor round them, but under them," via Moria. During the debate Aragorn remarks:     "I too once passed the Dirmrill Gate but though I also came out again, the memory is very evil. I do not wish to enter Moria a second time."    I haven't read much beyond the LOTR trilogy other than The Silmarillion. Does Tolkien ever describe Aragorn's first visit to Moria anywhere? I have a question concerning the time ordering operator. Let's suppose we have a time evolution generated by some Hamiltonian $H(t)$ given by $$ U(t)=T_\leftarrow\exp\left(-\mathrm{i}\int_0^t\mathrm{d}s\,H(s)\right)\tag{1}. $$ In Breuer and Petruccione, it's said that if the commutator of the Hamiltonian at some time $t$ with itself at some other time $t^\prime$ is a $c$-number function/ a complex function, i.e. $$\left[H(t),\,H(t^\prime)\right]=f(t,t'),$$ then the time evolution is given by $$ U(t)=\exp\left(-\frac{1}{2}\int_0^t\mathrm{d}s\int_0^t\mathrm{d}s^\prime\,\left[H(s),\,H(s^\prime)\right]\Theta(s-s^\prime)\right)$$ $$\times \exp\left(-\mathrm{i}\int_0^t\mathrm{ds}\,H(s)\right),\tag{2} $$ where $\Theta(s-s^\prime)$ is the Heaviside function. No proof or reference is given and I could not find any explanation anywhere, this is why I ask here. Any help would be very appreciated. An acquaintance recently posted an image to FB from his recent trip to the JFK Historic Site asking for an explanation of a visible artifact he states was not visible to the naked eye but was visible through the EVF of his camera and in the final image.    The artifact is a series of bright, nearly-vertical bars and a longer, almost horizontal bar superimposed over the lower part of the door frame and the radiator.  I found a very similar artifact in another image of the same room from a blogger which isn't as compressed:    In both cases the artifact seems to be a vertically inverted image of the post and rail outside the saturated window.  From looking at other images of the room available online I know there is spherical glass ornament topping the table lamp whose shape is visible at the left of the photo.  One response to the OP's question is as follows:     RK: It is lens flare. So, even on an iPhone, the camera lens is made   up of multiple lenses. Each designed to focus the image and make sure   it isn't distorted. Remember a lens bends light.  Sometimes, based on   angle and intensity of the incoming light, some stray light bounces   back and forth while traveling through the various elements that make   up what we think of as a camera lens (some of mine have 16 elements   inside a single lens.) Even the best glass is capable of reflecting   some light instead of passing it through the lens elements to the   sensor.  This is what you are seeing. The railing is overexposed, and   some stray light is bouncing around a bit inside the lens.   My response:     DJ: I don't think it's lens flare or ghosting. Those usually form an   image of starbursts, rings, or circles in a row across the image or in   the shape of the aperture; or a veiling glare or haze. This is forming   an image of the light outside minus objects in its path. It is more   likely a direct reflection/projection off a mirror or the glass in a   picture frame elsewhere in the room onto the opposite wall and the   radiator. There are two other clues which seem to confirm this. First,   the image has a gradiated appearance, it is less distinct in the   relatively bright area on the door frame and brighter in the   relatively darker areas behind and on the radiator. You would expect   lens flare to be more evenly specular. Second, the image representing   the light from below the horizontal rail changes angle on the   different faces of the door frame. Unlike a projection, lens flare is   an image created within the lens, the physical shape of the objects it   superimposes do not change its shape.      OP: If that were the case, would I have been able to see said   reflection in the room without the camera? There was no image I could   see with the naked eye. I notice the image in my phone before I took   the pic and did a double, triple and quadruple take before I took it   so I'm sure.      DJ: It would have been visible at the moment the image was taken, but   it may not have appeared nearly as bright and distinct because your   eyes were accommodating for the bright light coming in the window. The   projection could have easily been obscured by you or anyone around you   changing position or moving through the path of the projected   reflection. Also, it's been caught by other people... (see Image 2)   Notice that, in the linked example, the projection is again distorted   by the surface it falls on.   Anyone else want to chime in with an explanation? I'm trying to use scrlayer-scrpage with a twosided document using the scrartcl class but somehow can't manage to format the plain pagestyle in a way that is similar to the scrheadings style. I prepared the following MWE – thanks in advance!  \documentclass[12,a4paper,twoside]{scrartcl} \usepackage[automark,headsepline,footsepline,markcase=nouppercase]{scrlayer-scrpage} \renewcommand*{\sectionmarkformat}{} \renewcommand*{\subsectionmarkformat}{} \renewcommand*{\headfont}{\normalfont} \automark[subsection]{section} \chead{\leftmark} \cfoot{\pagemark} \ihead{} \ohead{} \ifoot{} \ofoot{}  \begin{document}  \pagestyle{scrheadings}  \section{Blah.}  Blah.  \newpage  \section{Blah.}  Blah.  \newpage  \pagestyle{plain.scrheadings}   \section{Blah.}  Blah.  \newpage  \section{Blah.}  Blah.  \end{document} Making data points different sizes based on data using QGIS? I am trying to plot sales data on a map using QGIS. I will add the disclaimer that I am a rookie at using the program. I added the different sales types by adding delimited text layers (utf16). The data included Longitude, Latitude, and Amount. I want to make the dots on the map scale with the value of the sale. Ive had no luck with trying to use Simple Marker->Data defined properties-> size and writing case functions. Some data points show up at different sizes while others show up at all data points. Here are my functions under different simple markers:   CASE WHEN Amount &lt;= 10000 THEN '.2' END CASE WHEN 10000 &lt; Amount &lt; 75000 THEN '.4' END CASE WHEN 75000 &lt; Amount &lt;= 250000 THEN '.6' END CASE WHEN Amount &gt;= 250000 THEN '1' END   The majority of my data set falls into the 10-75k range. However the .4 and .6 size circles show up at every data point on the map, while the .2 and 1 sizes only show up where the data specifies (along with the .4 and .6 sizes). At this point I am trying to figure out what is wrong with the equations, however I am stuck.   Is there a better way to go about this or am I just simply messing up the equations?   I wish I could share my whole map with you but it is looking great. I went with U/Joseph 's solution and here is an excerpt of the results for those interested. Problem: We have matrix $A\in M_{n-1\times n}(\mathbb Z)$ so that the sum of elements in each row is zero. Prove that $\det(AA^T)=nk^2$, where $k\in \mathbb Z$.  What have I considered so far:   First I thought, since sum of all elements in each row is zero, zero is eigenvalue of $A$ but $A\in M_{(n-1)\times n}(\mathbb Z)$ confused me. I see that $AA^T$ will be $(n-1)$ by $(n-1)$, so I tried calculating $AA^T$ but I failed to see any connection.   I did some research and found  question but we had no mention of it, which makes me believe I am on the wrong track.  Thank you all for your help. I moved a database from SQL Server 2005 to SQL Server 2012. Is there any way of restoring all the logins on the new server? I can't really remember how long ago it was, but I think the book was marketed towards children/teens.  All I remember is the basic premise of the story.  Some story about these unusual little blue electric critters that only certain people could see, and these kids took it upon themselves to go about destroying them since they fed off energy or something like that.  Not sure whether they fed off people or off electricity... or both maybe?  I think the dominant method of destroying them was an electric baton that was taken from law enforcement.  I wanna call them buzz batons, but that's probably thanks to Artemis Fowl. I messed up my system earlier, I was greeted with a black screen, when booting in to Ubuntu. When I started up my laptop, I selected the recovery option from the grub menu, and chose fallback at root terminal. I saw that I was able to use the add user command, with it, I probably could use to create a privileged user on my machine.   Isn't that a security issue?  One could have stolen my laptop and at startup chose recovery and add another user, I'm fudged then. Including my data.  Come to think of it, even if you somehow remove that entry, one could boot from a live-CD, get a chroot up and running and then add another user, with the right privileges that allows it to see all my data.   If I set the BIOS to boot at my HD only, no USB, CD/DVD, Network startup, and set a BIOS password, it still wouldn't matter, because you'd still have that grub recovery startup entry.  I am fairly certain that someone from China, Russia can't hack my Ubuntu Trusty Tahr, from the network, because it's secure like that. But, if one has physical access to my - your - machine, then, well, that's why I'm asking this question. How can I secure my machine so that hacking through physical access is not possible?    Bug Report: Prove that $\lim_{n\to\infty}a_n\le \lim_{n\to\infty}b_n$ I have configured my MySQL Database to require passwords on all users, even root from the machine itself.  Now I discovered that there are empty Users in my Database  Reproduce: mysql -u root -p and then use mysql; &amp; select * from user;  It gives me 2 entries, one with "localhost" and user &lt;empty&gt; and one with the machine's hostname and &lt;empty&gt;.  Now I tried to access the account with mysql -u ' ' (yes it's correct, leave a space between the ' things) and I log in without a password. The user can "only" see information_schema and test, the two databases created by default. He does not has access to mysql or any other custom created databases.  I already changed the Password of this user to something I won't tell you  mysql -u root -p use mysql; UPDATE mysql.user SET Password=PASSWORD('thisisasecretpassword') WHERE USER='root'; FLUSH PRIVILEGES;   Now my Questions:   Is any MySQL Server vulnerable for an attack with this entry? Could an attacker break out of this account or the two default databases? Should I password-protect those Users or can I delete them? Are They required for some MySQL-internal things? I found Minecraft's marvelous large worlds extremely slow to navigate, even with a quad core and meaty graphics card.  I assume Minecraft's slowness comes from:   Java, as spatial partitioning and memory management are faster in native C++. Weak world partitioning.   I could be wrong on both assumptions. However, this got me thinking about the best way to manage large voxel worlds. As it is a true 3D world, where a block can exist in any part of the world, it is basically a big 3D array [x][y][z], where each block in the world has a type (i.e BlockType.Empty = 0, BlockType.Dirt = 1, etc.)  I assume that to make this sort of world perform well, you would need to:   Use a tree of some variety (//) to split all the cubes out; it seems like an oct/kd would be the better option, as you can just partition on a per cube level not a per triangle level. Use some algorithm to work out which blocks can currently be seen, as blocks closer to the user could obfuscate the blocks behind, making it pointless to render them. Keep the block object themselves lightweight, so it is quick to add and remove them from the trees.   I guess there is no right answer to this, but I would be interested to see peoples' opinions on the subject.  How would you improve performance in a large voxel-based world?