How would I get a logic circuit printed on an IC?
How much does it cost to have a custom ASIC made?
Identify a short story about post-apocalyptic household robots Media: Short story collection When I read it: 2011 but the story itself was much older (unsure how much) so this information only serves to clarify that it is by no means new. Plot summary: A futuristic home with household robots that help around the house (cooking, cleaning etc.), we learn about their routines and behaviour and later on it's revealed that nobody is home, in fact everyone is dead, and a description of the outside seems to imply post-nuclear apocalypse. Setting: I seem to remember snow or winter What it isn't: with Google I stumbled upon  by Ray Bradbury, and  is very similar, and the beginning made me think "Bingo!", but I do not remember there being a fire in the story I read, and I also remember a view from a briefly opened door, or window, of a snowy setting, so while it may be that I am confusing elements of another story, or my imagination, with There Will Come Soft Rains, I would still like to run this through here as a question, because I'm not convinced. Additional info: The short story collection had other short stories that I will include as I remember them, details will be fuzzy:   Meteor, by John Wyndham , by Charlotte Perkins Gilman A short story about a man who is driving a car and it is revealed in the end that he was dead the whole time , by Charles Dickens Subgroups of finitely generated groups are not necessarily finitely generated I was wondering this today, and my algebra professor didn't know the answer.      Are subgroups of finitely generated groups also finitely generated?    I suppose it is necessarily true for finitely generated abelian groups, but is it true in general?  And if not, is there a simple example of a finitely generated group with a non-finitely generated subgroup?  NOTE:  This question has been merged with another question, asked by an undergraduate.  For an example not involving free groups, please see Andreas Caranti's answer, which was the accepted answer on the merged question. How do threads work in Python, and what are common Python-threading specific pitfalls? I've been trying to wrap my head around how threads work in Python, and it's hard to find good information on how they operate. I may just be missing a link or something, but it seems like the official documentation isn't very thorough on the subject, and I haven't been able to find a good write-up.  From what I can tell, only one thread can be running at once, and the active thread switches every 10 instructions or so?  Where is there a good explanation, or can you provide one? It would also be very nice to be aware of common problems that you run into while using threads with Python. Alternative activity monitors for OS X? I’m a bit intrigued by the new detailed activity monitors and progress indicators in Windows 8 (copying files, the task monitor, network activity, etc.) It got me thinking: surely there must be some better alternatives to the built-in Activity Monitor.app?  “Better” as in more detailed and nicer graphs. Specifically, it would be interested and see percentage disk I/O (out of disk capacity), memory usage, and CPU usage in the same nice way   The Building windows blog has an article  in Windows 8.  I just think that OS X’s task manager — which I have always found superior — just doesn’t cut it anymore compared to what is coming in Windows 8. What is the difference between ubuntu-18.04-server and ubuntu-18.04-live-server? On the  there is a download link for ubuntu-18.04-live-server-amd64.iso, and on the  there is a download link for ubuntu-18.04-server-amd64.iso. Before 18.04, there is only a server version. What is the difference between these 2 images? So I am asked to find all the isomorphisms between $G = (\mathbb Z_4,+)$ and $H = (U_5,*)$.  I solved it as follows: we will have two isomorphism corresponding to the two generators of $U_5$.  The first isomorphism : $\phi([x]_4)$ = $[2]_5^x$   The second isomorphism is: $\phi([x]_4)$ = $[3]_5^x$   Notice that [2] and [3] are the only generators of $U_5$ one can check it systematically or use the fact that $a^m$ is a generator iff gcd(m,4) = 1.  So I just wanted a verification of my work I showed that they are bijective, well defined, and is a homomorphism. ViewPager and fragments — what's the right way to store fragment's state? For some or other reason, typing @ᔕᖺᘎᕊ in a chat room pings everyone who's been in that chat room for the last 7 days...    Seems to work in all chat rooms (I only tested 2 as I don't want to upset too many people...)  How should we proceed? After parsing collada files I found out that we have to load two(or more) indices each pointing to say a vertex or normal etc. like this (&lt;p>3 0 2 0 0 0&lt;/p>)  Is there a way to load (and use)these indices to indices buffer(ELEMENT_ARRAY_BUFFER) like this (vnvnvn...) ; where v is vertex pointer, n is normal pointer from the above. with vertices loaded to VBO1 like (vvvv...) and in VBO2 like (nnnn...). So that we dont have to repeat the normals in VBO2.  VBO like (vnvnvn...) is also ok. (and not something like this ), I'm not trying to use multiple indices buffer. I'm trying to put all the given indices into one index buffer and use them alternately.  (If I wasnt clear i will try for more clarification.) When documenting a style file, it would be nice to be able to easily put side by side different examples of code, side-by-side with the output they produce.  What recommendations to people have to do this efficiently, and &aelig;sthetically? What are some examples of induction where the base case is difficult but the inductive step is trivial? According to :     ...proofs by mathematical induction   have two parts: the "base case" that   shows that the theorem is true for a   particular initial value such as n = 0   or n = 1 and then an inductive step   that shows that if the theorem is true   for a certain value of n, it is also   true for the value n + 1. The base   case is often trivial and is   identified as such, although there are   cases where the base case is difficult   but the inductive step is trivial.   What are some examples of proofs by induction where the base case is difficult but the inductive step is trivial? What follows if we fail to reject the null hypothesis? Use HERE file and redirect output of command I have the following code in a batch script:  mpirun -np 6 ./laplace &lt;&lt;END 100 100 100 0.01 100 3 2 1 END | tail -n 1 &gt; output   But it isn't working. What I want it to do is to use the HERE file as input to the mpirun command, and then pipe the output to the tail command. However, I think the HERE file and tail output things are getting confused.  How should I write this so that it does what I want? I'm currently in the process of making a custom map and I want to add blocks that can only be placed on a certain colour clay.  This is the command I tried using.  /give @p cobblestone 1 0 {CanPlaceOn:["hardened_stained_clay"],Damage:3}   However, even with this command the cobblestone can be placed on any colour of stained clay. What command can I use for placing only on a certain block? How to automate entry of external column data in BCS? I have a document library, Resumes, that has a large number of resumes in it. There is a regular column on that library, called EmployeeID, that is already populated.  I have an external content type ( ECT ) that is mapped to a table that lists EmployeeID and several other columns of information. I added this ECT to the library as an External Column.    I am looking for a good way to automatically go through all items in the document library, and copy the value from the "regular" EmployeeID column into the External EmployeeID column and have it update the other columns from the ECT. Any techniques are useful (PowerShell, Object Model, Workflow?) When we have tried this in the past with workflows the setting of the External Column did not report failure, but didn't actually trigger a lookup of the other data and the value didn't seem to actually get saved.  [Update] I have been working on this and am getting closer. I am using PowerShell to access the list and set the external column ID field to the value I want it to be.  The problem is that it doesn't seem to be triggering a lookup of the external data when that field is set.  my "list" (a document library) has a few normal fields and a set of external columns mapped to an ECT "EmplData".  When you use the GUI to add or edit the properties of an item, it works. When I use PowerShell to do the following:  $spList = $spWeb.Lists["Resumes"] $spListItem = $spList.GetItemById(1) $spListItem["EmplData_ID"] = "00300"    $spListItem.Update()   Sometime the external ID field gets updated when I the refresh the web page, other times it says "(blank)". In all cases it does not load in the other fields.  Is there some Update method that updates the rest of the elements?  I gather from research that these are called "secondary fields", is the method to update the secondary fields based on the external item ID available in PowerShell cmdlets someplace?  [Update] I am finding that if I use:  $spListItem["EmplData"] = "000300"   instead of $spListItem["EmplData_ID"] = "00300" it gets around the problem of the column showing "(blank)".   I still need to figure how to make it update the other external columns (also known as "secondary columns" I think) I just came onto a project with a pretty huge code base.   I'm mostly dealing with C++ and a lot of the code they write uses double negation for their boolean logic.    if (!!variable &amp;&amp; (!!api.lookup("some-string"))) {        do_some_stuff();  }                                      I know these guys are intelligent programmers, it's obvious they aren't doing this by accident.   I'm no seasoned C++ expert, my only guess at why they are doing this is that they want to make absolutely positive that the value being evaluated is the actual boolean representation. So they negate it, then negate that again to get it back to its actual boolean value.   Is this correct, or am I missing something? Non-Exchange address in Exchange GAL We just made the switch to Google Apps for part of our domain. We disabled the accounts that are now on Google Apps and mail routes correctly. Our problem is that now we have no way of seeing those users in the Global Address List.  So we have these users in our Active Directory, they have no mailbox on Exchange, and we want to be able to see/search for their addresses in the GAL. Is there any way to do this?  This is Exchange 2007, if that matters. Order of a homomorphism of groups Let $f: G \to H$ be a homomorphism of groups. Assume that $a\in G$ and $\operatorname{ord}(a)=n$. Prove that the order of $f(a)$ is a divisor of $n$. I know that if $H$ is a subgroup of $G$, then $$|G|=|H|\cdot|\text{distinct cosets of $H$}|$$ so $|H|$ must be divisor of $|G|$, but I don't understand how to apply that logic to homomorphisms (or if that will even work). Any help is appreciated! Regular expression to match DNS hostname or IP Address? Does anyone have a regular expression handy that will match any legal DNS hostname or IP address?  It's easy to write one that works 95% of the time, but I'm hoping to get something that's well tested to exactly match the latest RFC specs for DNS hostnames. I have a specific requirement (probably silly!) for testing a browser of Chrome. I realize this requirement isn't the most logical, but politics being what they may I'd like to know the technical workaround.  I need to test a site in version, let's say, 28 of Google Chrome. Obviously Google runs a silent updater which can be disabled, but at this point they don't (to my knowledge) release old archives of the MSI installers (which I can easily use to reinstall and force a no-update option for testing). If we can get this working on a single instance then there's a possibility that a virtual machine or some other workaround will give us an easy restore point to meet this test.  If anyone has a good idea of where to start here that would be amazing.  I've already floated the "why are we doing this question?" and the answer is that it is part of the requirements so we need to make a best effort.  UPDATE:   FileHippo appears to only archive the online installer (automatic update)  OldApps doesn't archive Chrome anymore  OldVersion doesn't appear to have any Chrome Archives   UPDATE 2:  - The accepted answer's server is the correct solution here at this point in time. Basically speaking you're looking for the full install (30 or so MB). If you have an 800K file it is the online installer which automatically updates.